40 namespace Test {
namespace FlatZinc {
49 (void)
new FlatZincTest(
"cutstock",
50 "predicate bool_lin_ge(array [int] of int: a, array [int] of var bool: x, var int: c);\n\
51 predicate bool_lin_gt(array [int] of int: a, array [int] of var bool: x, var int: c);\n\
52 predicate bool_lin_lt(array [int] of int: a, array [int] of var bool: x, var int: c);\n\
53 predicate bool_lin_ne(array [int] of int: a, array [int] of var bool: x, var int: c);\n\
54 array [1..3] of int: i_demand = [2, 2, 4];\n\
55 array [1..3] of int: i_length = [7, 5, 3];\n\
56 var 0..8: INT____00001 :: is_defined_var :: var_is_introduced;\n\
57 array [1..24] of var int: items :: output_array([1..8, 1..3]);\n\
58 var 0..8: obj :: output_var = INT____00001;\n\
59 array [1..8] of var 0..1: pieces :: output_array([1..8]);\n\
60 constraint int_le(0, items[1]);\n\
61 constraint int_le(0, items[2]);\n\
62 constraint int_le(0, items[3]);\n\
63 constraint int_le(0, items[4]);\n\
64 constraint int_le(0, items[5]);\n\
65 constraint int_le(0, items[6]);\n\
66 constraint int_le(0, items[7]);\n\
67 constraint int_le(0, items[8]);\n\
68 constraint int_le(0, items[9]);\n\
69 constraint int_le(0, items[10]);\n\
70 constraint int_le(0, items[11]);\n\
71 constraint int_le(0, items[12]);\n\
72 constraint int_le(0, items[13]);\n\
73 constraint int_le(0, items[14]);\n\
74 constraint int_le(0, items[15]);\n\
75 constraint int_le(0, items[16]);\n\
76 constraint int_le(0, items[17]);\n\
77 constraint int_le(0, items[18]);\n\
78 constraint int_le(0, items[19]);\n\
79 constraint int_le(0, items[20]);\n\
80 constraint int_le(0, items[21]);\n\
81 constraint int_le(0, items[22]);\n\
82 constraint int_le(0, items[23]);\n\
83 constraint int_le(0, items[24]);\n\
84 constraint int_lin_eq([-1, 1, 1, 1, 1, 1, 1, 1, 1], [INT____00001, pieces[1], pieces[2], pieces[3], pieces[4], pieces[5], pieces[6], pieces[7], pieces[8]], 0) :: defines_var(INT____00001);\n\
85 constraint int_lin_le([7, 5, 3, -10], [items[1], items[2], items[3], pieces[1]], 0);\n\
86 constraint int_lin_le([7, 5, 3, -10], [items[4], items[5], items[6], pieces[2]], 0);\n\
87 constraint int_lin_le([7, 5, 3, -10], [items[7], items[8], items[9], pieces[3]], 0);\n\
88 constraint int_lin_le([7, 5, 3, -10], [items[10], items[11], items[12], pieces[4]], 0);\n\
89 constraint int_lin_le([7, 5, 3, -10], [items[13], items[14], items[15], pieces[5]], 0);\n\
90 constraint int_lin_le([7, 5, 3, -10], [items[16], items[17], items[18], pieces[6]], 0);\n\
91 constraint int_lin_le([7, 5, 3, -10], [items[19], items[20], items[21], pieces[7]], 0);\n\
92 constraint int_lin_le([7, 5, 3, -10], [items[22], items[23], items[24], pieces[8]], 0);\n\
93 constraint int_lin_le([-1, -1, -1, -1, -1, -1, -1, -1], [items[1], items[4], items[7], items[10], items[13], items[16], items[19], items[22]], -2);\n\
94 constraint int_lin_le([-1, -1, -1, -1, -1, -1, -1, -1], [items[2], items[5], items[8], items[11], items[14], items[17], items[20], items[23]], -2);\n\
95 constraint int_lin_le([-1, -1, -1, -1, -1, -1, -1, -1], [items[3], items[6], items[9], items[12], items[15], items[18], items[21], items[24]], -4);\n\
96 solve :: int_search([items[1], items[2], items[3], items[4], items[5], items[6], items[7], items[8], items[9], items[10], items[11], items[12], items[13], items[14], items[15], items[16], items[17], items[18], items[19], items[20], items[21], items[22], items[23], items[24], pieces[1], pieces[2], pieces[3], pieces[4], pieces[5], pieces[6], pieces[7], pieces[8]], input_order, indomain_min, complete) minimize INT____00001;\n\
97 ",
"items = array2d(1..8, 1..3, [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 0, 2, 0, 1, 0, 1, 1, 0, 1]);\n\
99 pieces = array1d(1..8, [0, 0, 0, 0, 1, 1, 1, 1]);\n\
Gecode::FloatVal c(-8, 8)