1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
|
% This file contains redefinitions of standard builtins that can be overridden
% by solvers.
predicate bool_clause_reif(array[int] of var bool: as,
array[int] of var bool: bs,
var bool: b);
predicate array_int_maximum(var int: m, array[int] of var int: x);
predicate array_float_maximum(var float: m, array[int] of var float: x) =
let { int: l = min(index_set(x)),
int: u = max(index_set(x)),
float: ly = lb_array(x),
float: uy = ub_array(x),
array[l..u] of var ly..uy: y } in
y[l] = x[l] /\
m = y[u] /\
forall (i in l+1 .. u) ( y[i] == max(x[i],y[i-1]) );
predicate array_int_minimum(var int: m, array[int] of var int: x);
predicate array_float_minimum(var float: m, array[int] of var float: x) =
let { int: l = min(index_set(x)),
int: u = max(index_set(x)),
float: ly = lb_array(x),
float: uy = ub_array(x),
array[l..u] of var ly..uy: y } in
y[l] = x[l] /\
m = y[u] /\
forall (i in l+1 .. u) ( y[i] == min(x[i],y[i-1]) );
|
