36 namespace Test {
namespace FlatZinc {
45 (void)
new FlatZincTest(
"trucking",
46 "predicate bool_lin_ge(array [int] of int: a, array [int] of var bool: x, var int: c);\n\ 47 predicate bool_lin_gt(array [int] of int: a, array [int] of var bool: x, var int: c);\n\ 48 predicate bool_lin_lt(array [int] of int: a, array [int] of var bool: x, var int: c);\n\ 49 predicate bool_lin_ne(array [int] of int: a, array [int] of var bool: x, var int: c);\n\ 50 array [1..4] of int: Cost = [30, 27, 23, 20];\n\ 51 array [1..6] of int: Demand = [27, 11, 14, 19, 25, 22];\n\ 52 array [1..4] of int: Loads = [20, 18, 15, 13];\n\ 53 var 0..600: INT____00001 :: is_defined_var :: var_is_introduced;\n\ 54 var 0..600: obj :: output_var = INT____00001;\n\ 55 array [1..24] of var 0..1: x :: output_array([1..4, 1..6]);\n\ 56 constraint int_lin_eq([-1, 30, 30, 30, 30, 30, 30, 27, 27, 27, 27, 27, 27, 23, 23, 23, 23, 23, 23, 20, 20, 20, 20, 20, 20], [INT____00001, x[1], x[2], x[3], x[4], x[5], x[6], x[7], x[8], x[9], x[10], x[11], x[12], x[13], x[14], x[15], x[16], x[17], x[18], x[19], x[20], x[21], x[22], x[23], x[24]], 0) :: defines_var(INT____00001);\n\ 57 constraint int_lin_le([1, 1], [x[19], x[20]], 1);\n\ 58 constraint int_lin_le([1, 1], [x[20], x[21]], 1);\n\ 59 constraint int_lin_le([1, 1], [x[21], x[22]], 1);\n\ 60 constraint int_lin_le([1, 1], [x[22], x[23]], 1);\n\ 61 constraint int_lin_le([1, 1], [x[23], x[24]], 1);\n\ 62 constraint int_lin_le([1, 1, 1], [x[13], x[14], x[15]], 1);\n\ 63 constraint int_lin_le([1, 1, 1], [x[14], x[15], x[16]], 1);\n\ 64 constraint int_lin_le([1, 1, 1], [x[15], x[16], x[17]], 1);\n\ 65 constraint int_lin_le([1, 1, 1], [x[16], x[17], x[18]], 1);\n\ 66 constraint int_lin_le([-20, -18, -15, -13], [x[1], x[7], x[13], x[19]], -27);\n\ 67 constraint int_lin_le([-20, -18, -15, -13], [x[2], x[8], x[14], x[20]], -11);\n\ 68 constraint int_lin_le([-20, -18, -15, -13], [x[3], x[9], x[15], x[21]], -14);\n\ 69 constraint int_lin_le([-20, -18, -15, -13], [x[4], x[10], x[16], x[22]], -19);\n\ 70 constraint int_lin_le([-20, -18, -15, -13], [x[5], x[11], x[17], x[23]], -25);\n\ 71 constraint int_lin_le([-20, -18, -15, -13], [x[6], x[12], x[18], x[24]], -22);\n\ 72 solve ::int_search(x, first_fail, indomain_min, complete) minimize INT____00001;\n\ 74 x = array2d(1..4, 1..6, [0, 0, 0, 1, 0, 0, 0, 1, 1, 0, 1, 1, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 1, 0]);\n\ Gecode::FloatVal c(-8, 8)