36namespace Test {
namespace FlatZinc {
45 (void)
new FlatZincTest(
"2DPacking",
46"predicate bool_lin_ge(array [int] of int: a, array [int] of var bool: x, var int: c);\n\
47predicate bool_lin_gt(array [int] of int: a, array [int] of var bool: x, var int: c);\n\
48predicate bool_lin_lt(array [int] of int: a, array [int] of var bool: x, var int: c);\n\
49predicate bool_lin_ne(array [int] of int: a, array [int] of var bool: x, var int: c);\n\
50array [1..4] of int: ItemHeight = [4, 4, 4, 3];\n\
51array [1..4] of int: ItemWidth = [1, 1, 2, 3];\n\
52var 0..2: INT____00001 :: is_defined_var :: var_is_introduced;\n\
53array [1..2] of var 0..1: bin;\n\
54array [1..8] of var 0..1: item :: output_array([1..2, 1..4]);\n\
55var 0..2: obj :: output_var = INT____00001;\n\
56array [1..16] of var 0..1: x____00002;\n\
57array [1..16] of var 0..1: x____00003;\n\
58constraint int_eq(x____00002[5], 0);\n\
59constraint int_eq(x____00002[9], 0);\n\
60constraint int_eq(x____00002[10], 0);\n\
61constraint int_eq(x____00002[13], 0);\n\
62constraint int_eq(x____00002[14], 0);\n\
63constraint int_eq(x____00002[15], 0);\n\
64constraint int_eq(x____00003[5], 0);\n\
65constraint int_eq(x____00003[9], 0);\n\
66constraint int_eq(x____00003[10], 0);\n\
67constraint int_eq(x____00003[13], 0);\n\
68constraint int_eq(x____00003[14], 0);\n\
69constraint int_eq(x____00003[15], 0);\n\
70constraint int_lin_eq([1, -1], [item[1], x____00002[1]], 0);\n\
71constraint int_lin_eq([1, -1], [item[5], x____00003[1]], 0);\n\
72constraint int_lin_eq([1, 1], [item[1], item[5]], 1);\n\
73constraint int_lin_eq([1, 1], [item[2], item[6]], 1);\n\
74constraint int_lin_eq([1, 1], [item[3], item[7]], 1);\n\
75constraint int_lin_eq([1, 1], [item[4], item[8]], 1);\n\
76constraint int_lin_eq([1, -1, -1], [item[1], x____00002[2], x____00002[6]], 0);\n\
77constraint int_lin_eq([1, -1, -1], [item[5], x____00003[2], x____00003[6]], 0);\n\
78constraint int_lin_eq([1, -1, -1, -1], [item[1], x____00002[3], x____00002[7], x____00002[11]], 0);\n\
79constraint int_lin_eq([1, -1, -1, -1], [item[5], x____00003[3], x____00003[7], x____00003[11]], 0);\n\
80constraint int_lin_eq([1, -1, -1, -1, -1], [item[1], x____00002[4], x____00002[8], x____00002[12], x____00002[16]], 0);\n\
81constraint int_lin_eq([1, -1, -1, -1, -1], [item[5], x____00003[4], x____00003[8], x____00003[12], x____00003[16]], 0);\n\
82constraint int_lin_le([-2], [x____00002[16]], 0);\n\
83constraint int_lin_le([-2], [x____00003[16]], 0);\n\
84constraint int_lin_le([-3, 3], [x____00002[11], x____00002[12]], 0);\n\
85constraint int_lin_le([-3, 3], [x____00003[11], x____00003[12]], 0);\n\
86constraint int_lin_le([-4, 2, 3], [x____00002[6], x____00002[7], x____00002[8]], 0);\n\
87constraint int_lin_le([-4, 2, 3], [x____00003[6], x____00003[7], x____00003[8]], 0);\n\
88constraint int_lin_le([-4, 1, 2, 3], [x____00002[1], x____00002[2], x____00002[3], x____00002[4]], 0);\n\
89constraint int_lin_le([-4, 1, 2, 3], [x____00003[1], x____00003[2], x____00003[3], x____00003[4]], 0);\n\
90constraint int_lin_le([-10, 4, 4, 4, 3], [bin[1], x____00002[1], x____00002[6], x____00002[11], x____00002[16]], 0);\n\
91constraint int_lin_le([-10, 4, 4, 4, 3], [bin[2], x____00003[1], x____00003[6], x____00003[11], x____00003[16]], 0);\n\
92constraint int_plus(bin[1], bin[2], INT____00001) :: defines_var(INT____00001);\n\
93solve minimize INT____00001;\n\
95"item = array2d(1..2, 1..4, [1, 1, 1, 1, 0, 0, 0, 0]);\n\
Gecode::FloatVal c(-8, 8)