36 namespace Test {
namespace FlatZinc {
45 (void)
new FlatZincTest(
"product::fd",
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..2] of int: capacity = [200, 400];\n\ 51 array [1..6] of int: consumption = [5, 2, 4, 4, 3, 6];\n\ 52 array [1..3] of int: demand = [100, 200, 300];\n\ 53 array [1..3] of int: insideCost = [60, 80, 30];\n\ 54 array [1..3] of int: outsideCost = [80, 90, 40];\n\ 55 var 0..131000: INT____00001 :: is_defined_var :: var_is_introduced;\n\ 56 array [1..3] of var 0..400: inside :: output_array([1..3]);\n\ 57 array [1..3] of var 0..300: outside :: output_array([1..3]);\n\ 58 constraint int_lin_eq([-1, 60, 80, 30, 80, 90, 40], [INT____00001, inside[1], inside[2], inside[3], outside[1], outside[2], outside[3]], 0) :: defines_var(INT____00001);\n\ 59 constraint int_lin_le([-1, -1], [inside[1], outside[1]], -100);\n\ 60 constraint int_lin_le([-1, -1], [inside[2], outside[2]], -200);\n\ 61 constraint int_lin_le([-1, -1], [inside[3], outside[3]], -300);\n\ 62 constraint int_lin_le([2, 4, 6], [inside[1], inside[2], inside[3]], 400);\n\ 63 constraint int_lin_le([5, 4, 3], [inside[1], inside[2], inside[3]], 200);\n\ 64 solve minimize INT____00001;\n\ 65 ",
"inside = array1d(1..3, [40, 0, 0]);\n\ 66 outside = array1d(1..3, [60, 200, 300]);\n\ Gecode::FloatVal c(-8, 8)