40 namespace Test {
namespace FlatZinc {
49 (void)
new FlatZincTest(
"template_design",
50 "predicate all_different_int(array [int] of var int: x);\n\ 51 predicate all_equal_int(array [int] of var int: x);\n\ 52 predicate among(var int: n, array [int] of var int: x, set of int: v);\n\ 53 predicate array_bool_lq(array [int] of var bool: x, array [int] of var bool: y);\n\ 54 predicate array_bool_lt(array [int] of var bool: x, array [int] of var bool: y);\n\ 55 predicate array_int_lq(array [int] of var int: x, array [int] of var int: y);\n\ 56 predicate array_int_lt(array [int] of var int: x, array [int] of var int: y);\n\ 57 predicate array_set_partition(array [int] of var set of int: S, set of int: universe);\n\ 58 predicate at_least_int(int: n, array [int] of var int: x, int: v);\n\ 59 predicate at_most_int(int: n, array [int] of var int: x, int: v);\n\ 60 predicate bool_lin_ge(array [int] of int: a, array [int] of var bool: x, var int: c);\n\ 61 predicate bool_lin_gt(array [int] of int: a, array [int] of var bool: x, var int: c);\n\ 62 predicate bool_lin_lt(array [int] of int: a, array [int] of var bool: x, var int: c);\n\ 63 predicate bool_lin_ne(array [int] of int: a, array [int] of var bool: x, var int: c);\n\ 64 predicate count(array [int] of var int: x, var int: y, var int: c);\n\ 65 predicate count_reif(array [int] of var int: x, var int: y, var int: c, var bool: b);\n\ 66 predicate cumulatives(array [int] of var int: s, array [int] of var int: d, array [int] of var int: r, var int: b);\n\ 67 predicate decreasing_bool(array [int] of var bool: x);\n\ 68 predicate decreasing_int(array [int] of var int: x);\n\ 69 predicate disjoint(var set of int: s1, var set of int: s2);\n\ 70 predicate gecode_array_set_element_union(var set of int: x, array [int] of var set of int: y, var set of int: z);\n\ 71 predicate gecode_bin_packing_load(array [int] of var int: l, array [int] of var int: bin, array [int] of int: w, int: minIndex);\n\ 72 predicate gecode_circuit(int: offset, array [int] of var int: x);\n\ 73 predicate gecode_int_set_channel(array [int] of var int: x, int: xoff, array [int] of var set of int: y, int: yoff);\n\ 74 predicate gecode_inverse_set(array [int] of var set of int: f, array [int] of var set of int: invf, int: xoff, int: yoff);\n\ 75 predicate gecode_link_set_to_booleans(var set of int: s, array [int] of var bool: b, int: idx);\n\ 76 predicate gecode_member_bool_reif(array [int] of var bool: x, var bool: y, var bool: b);\n\ 77 predicate gecode_member_int_reif(array [int] of var int: x, var int: y, var bool: b);\n\ 78 predicate gecode_nooverlap(array [int] of var int: x, array [int] of var int: w, array [int] of var int: y, array [int] of var int: h);\n\ 79 predicate gecode_precede(array [int] of var int: x, int: s, int: t);\n\ 80 predicate gecode_precede_set(array [int] of var set of int: x, int: s, int: t);\n\ 81 predicate gecode_range(array [int] of var int: x, int: xoff, var set of int: s, var set of int: t);\n\ 82 predicate gecode_set_weights(array [int] of int: csi, array [int] of int: cs, var set of int: x, var int: y);\n\ 83 predicate global_cardinality(array [int] of var int: x, array [int] of int: cover, array [int] of var int: counts);\n\ 84 predicate global_cardinality_closed(array [int] of var int: x, array [int] of int: cover, array [int] of var int: counts);\n\ 85 predicate global_cardinality_low_up(array [int] of var int: x, array [int] of int: cover, array [int] of int: lbound, array [int] of int: ubound);\n\ 86 predicate global_cardinality_low_up_closed(array [int] of var int: x, array [int] of int: cover, array [int] of int: lbound, array [int] of int: ubound);\n\ 87 predicate increasing_bool(array [int] of var bool: x);\n\ 88 predicate increasing_int(array [int] of var int: x);\n\ 89 predicate inverse_offsets(array [int] of var int: f, int: foff, array [int] of var int: invf, int: invfoff);\n\ 90 predicate maximum_int(var int: m, array [int] of var int: x);\n\ 91 predicate member_bool(array [int] of var bool: x, var bool: y);\n\ 92 predicate member_int(array [int] of var int: x, var int: y);\n\ 93 predicate minimum_int(var int: m, array [int] of var int: x);\n\ 94 predicate nvalue(var int: n, array [int] of var int: x);\n\ 95 predicate regular(array [int] of var int: x, int: Q, int: S, array [int, int] of int: d, int: q0, set of int: F);\n\ 96 predicate sort(array [int] of var int: x, array [int] of var int: y);\n\ 97 predicate table_bool(array [int] of var bool: x, array [int, int] of bool: t);\n\ 98 predicate table_int(array [int] of var int: x, array [int, int] of int: t);\n\ 99 array [1..7] of int: d = [250, 255, 260, 500, 500, 800, 1100];\n\ 100 var 204..408: INT____00002 :: is_defined_var :: var_is_introduced;\n\ 101 var 0..7344: INT____00003 :: is_defined_var :: var_is_introduced;\n\ 102 var 0..7344: INT____00004 :: is_defined_var :: var_is_introduced;\n\ 103 var 0..7344: INT____00005 :: is_defined_var :: var_is_introduced;\n\ 104 var 0..7344: INT____00006 :: is_defined_var :: var_is_introduced;\n\ 105 var 0..7344: INT____00007 :: is_defined_var :: var_is_introduced;\n\ 106 var 0..7344: INT____00008 :: is_defined_var :: var_is_introduced;\n\ 107 var 0..7344: INT____00009 :: is_defined_var :: var_is_introduced;\n\ 108 var 0..7344: INT____00010 :: is_defined_var :: var_is_introduced;\n\ 109 var 0..7344: INT____00011 :: is_defined_var :: var_is_introduced;\n\ 110 var 0..7344: INT____00012 :: is_defined_var :: var_is_introduced;\n\ 111 var 0..7344: INT____00013 :: is_defined_var :: var_is_introduced;\n\ 112 var 0..7344: INT____00014 :: is_defined_var :: var_is_introduced;\n\ 113 var 0..7344: INT____00015 :: is_defined_var :: var_is_introduced;\n\ 114 var 0..7344: INT____00016 :: is_defined_var :: var_is_introduced;\n\ 115 var 408..816: INT____00017 :: is_defined_var :: var_is_introduced;\n\ 116 var 408..816: Production :: output_var = INT____00017;\n\ 117 array [1..2] of var 1..816: R :: output_array([1..2]);\n\ 118 var 7..408: Surplus;\n\ 119 array [1..14] of var 0..9: p :: output_array([1..7, 1..2]);\n\ 120 constraint array_int_lq([p[7], p[8]], [p[9], p[10]]);\n\ 121 constraint int_div(Production, 2, INT____00002) :: defines_var(INT____00002);\n\ 122 constraint int_le(INT____00002, R[2]);\n\ 123 constraint int_le(R[1], INT____00002);\n\ 124 constraint int_lin_eq([-1, 9], [Surplus, Production], 3665);\n\ 125 constraint int_lin_eq([1, 1, 1, 1, 1, 1, 1], [p[1], p[3], p[5], p[7], p[9], p[11], p[13]], 9);\n\ 126 constraint int_lin_eq([1, 1, 1, 1, 1, 1, 1], [p[2], p[4], p[6], p[8], p[10], p[12], p[14]], 9);\n\ 127 constraint int_lin_le([-1, -1], [INT____00003, INT____00005], -250);\n\ 128 constraint int_lin_le([-1, -1], [INT____00004, INT____00006], -255);\n\ 129 constraint int_lin_le([-1, -1], [INT____00007, INT____00008], -260);\n\ 130 constraint int_lin_le([-1, -1], [INT____00009, INT____00010], -500);\n\ 131 constraint int_lin_le([-1, -1], [INT____00011, INT____00012], -500);\n\ 132 constraint int_lin_le([-1, -1], [INT____00013, INT____00014], -800);\n\ 133 constraint int_lin_le([-1, -1], [INT____00015, INT____00016], -1100);\n\ 134 constraint int_lin_le([-1, 1, 1], [Surplus, INT____00003, INT____00005], 500);\n\ 135 constraint int_lin_le([-1, 1, 1], [Surplus, INT____00004, INT____00006], 510);\n\ 136 constraint int_lin_le([-1, 1, 1], [Surplus, INT____00007, INT____00008], 520);\n\ 137 constraint int_lin_le([-1, 1, 1], [Surplus, INT____00009, INT____00010], 1000);\n\ 138 constraint int_lin_le([-1, 1, 1], [Surplus, INT____00011, INT____00012], 1000);\n\ 139 constraint int_lin_le([-1, 1, 1], [Surplus, INT____00013, INT____00014], 1600);\n\ 140 constraint int_lin_le([-1, 1, 1], [Surplus, INT____00015, INT____00016], 2200);\n\ 141 constraint int_lin_le([1, -1, 1, -1], [INT____00003, INT____00004, INT____00005, INT____00006], -1);\n\ 142 constraint int_lin_le([1, 1, -1, -1], [INT____00004, INT____00006, INT____00007, INT____00008], -1);\n\ 143 constraint int_lin_le([1, 1, -1, -1], [INT____00007, INT____00008, INT____00009, INT____00010], -1);\n\ 144 constraint int_lin_le([1, 1, -1, -1], [INT____00011, INT____00012, INT____00013, INT____00014], -1);\n\ 145 constraint int_lin_le([1, 1, -1, -1], [INT____00013, INT____00014, INT____00015, INT____00016], -1);\n\ 146 constraint int_lin_le([-1, 1, 1, 1, 1], [Surplus, INT____00003, INT____00004, INT____00005, INT____00006], 1010);\n\ 147 constraint int_lin_le([-1, 1, 1, 1, 1, 1, 1], [Surplus, INT____00003, INT____00004, INT____00005, INT____00006, INT____00007, INT____00008], 1530);\n\ 148 constraint int_lin_le([-1, 1, 1, 1, 1, 1, 1, 1, 1], [Surplus, INT____00003, INT____00004, INT____00005, INT____00006, INT____00007, INT____00008, INT____00009, INT____00010], 2530);\n\ 149 constraint int_lin_le([-1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [Surplus, INT____00003, INT____00004, INT____00005, INT____00006, INT____00007, INT____00008, INT____00009, INT____00010, INT____00011, INT____00012], 3530);\n\ 150 constraint int_lin_le([-1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [Surplus, INT____00003, INT____00004, INT____00005, INT____00006, INT____00007, INT____00008, INT____00009, INT____00010, INT____00011, INT____00012, INT____00013, INT____00014], 5130);\n\ 151 constraint int_plus(R[1], R[2], INT____00017) :: defines_var(INT____00017);\n\ 152 constraint int_times(p[1], R[1], INT____00003) :: defines_var(INT____00003);\n\ 153 constraint int_times(p[2], R[2], INT____00005) :: defines_var(INT____00005);\n\ 154 constraint int_times(p[3], R[1], INT____00004) :: defines_var(INT____00004);\n\ 155 constraint int_times(p[4], R[2], INT____00006) :: defines_var(INT____00006);\n\ 156 constraint int_times(p[5], R[1], INT____00007) :: defines_var(INT____00007);\n\ 157 constraint int_times(p[6], R[2], INT____00008) :: defines_var(INT____00008);\n\ 158 constraint int_times(p[7], R[1], INT____00009) :: defines_var(INT____00009);\n\ 159 constraint int_times(p[8], R[2], INT____00010) :: defines_var(INT____00010);\n\ 160 constraint int_times(p[9], R[1], INT____00011) :: defines_var(INT____00011);\n\ 161 constraint int_times(p[10], R[2], INT____00012) :: defines_var(INT____00012);\n\ 162 constraint int_times(p[11], R[1], INT____00013) :: defines_var(INT____00013);\n\ 163 constraint int_times(p[12], R[2], INT____00014) :: defines_var(INT____00014);\n\ 164 constraint int_times(p[13], R[1], INT____00015) :: defines_var(INT____00015);\n\ 165 constraint int_times(p[14], R[2], INT____00016) :: defines_var(INT____00016);\n\ 166 solve :: int_search([p[1], p[2], p[3], p[4], p[5], p[6], p[7], p[8], p[9], p[10], p[11], p[12], p[13], p[14], R[1], R[2]], input_order, indomain_min, complete) minimize INT____00017;\n\ 167 ",
"Production = 442;\n\ 168 R = array1d(1..2, [167, 275]);\n\ 169 p = array2d(1..7, 1..2, [0, 1, 2, 0, 1, 1, 3, 0, 3, 0, 0, 3, 0, 4]);\n\ Gecode::FloatVal c(-8, 8)