36 namespace Test {
namespace FlatZinc {
45 (void)
new FlatZincTest(
"alpha",
46 "predicate all_different_int(array [int] of var int: x);\n\ 47 predicate all_equal_int(array [int] of var int: x);\n\ 48 predicate among(var int: n, array [int] of var int: x, set of int: v);\n\ 49 predicate array_bool_lq(array [int] of var bool: x, array [int] of var bool: y);\n\ 50 predicate array_bool_lt(array [int] of var bool: x, array [int] of var bool: y);\n\ 51 predicate array_int_lq(array [int] of var int: x, array [int] of var int: y);\n\ 52 predicate array_int_lt(array [int] of var int: x, array [int] of var int: y);\n\ 53 predicate array_set_partition(array [int] of var set of int: S, set of int: universe);\n\ 54 predicate at_least_int(int: n, array [int] of var int: x, int: v);\n\ 55 predicate at_most_int(int: n, array [int] of var int: x, int: v);\n\ 56 predicate bool_lin_ge(array [int] of int: a, array [int] of var bool: x, var int: c);\n\ 57 predicate bool_lin_gt(array [int] of int: a, array [int] of var bool: x, var int: c);\n\ 58 predicate bool_lin_lt(array [int] of int: a, array [int] of var bool: x, var int: c);\n\ 59 predicate bool_lin_ne(array [int] of int: a, array [int] of var bool: x, var int: c);\n\ 60 predicate count(array [int] of var int: x, var int: y, var int: c);\n\ 61 predicate count_reif(array [int] of var int: x, var int: y, var int: c, var bool: b);\n\ 62 predicate cumulatives(array [int] of var int: s, array [int] of var int: d, array [int] of var int: r, var int: b);\n\ 63 predicate decreasing_bool(array [int] of var bool: x);\n\ 64 predicate decreasing_int(array [int] of var int: x);\n\ 65 predicate disjoint(var set of int: s1, var set of int: s2);\n\ 66 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\ 67 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\ 68 predicate gecode_circuit(int: offset, array [int] of var int: x);\n\ 69 predicate gecode_int_set_channel(array [int] of var int: x, int: xoff, array [int] of var set of int: y, int: yoff);\n\ 70 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\ 71 predicate gecode_link_set_to_booleans(var set of int: s, array [int] of var bool: b, int: idx);\n\ 72 predicate gecode_member_bool_reif(array [int] of var bool: x, var bool: y, var bool: b);\n\ 73 predicate gecode_member_int_reif(array [int] of var int: x, var int: y, var bool: b);\n\ 74 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\ 75 predicate gecode_precede(array [int] of var int: x, int: s, int: t);\n\ 76 predicate gecode_precede_set(array [int] of var set of int: x, int: s, int: t);\n\ 77 predicate gecode_range(array [int] of var int: x, int: xoff, var set of int: s, var set of int: t);\n\ 78 predicate gecode_set_weights(array [int] of int: csi, array [int] of int: cs, var set of int: x, var int: y);\n\ 79 predicate global_cardinality(array [int] of var int: x, array [int] of int: cover, array [int] of var int: counts);\n\ 80 predicate global_cardinality_closed(array [int] of var int: x, array [int] of int: cover, array [int] of var int: counts);\n\ 81 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\ 82 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\ 83 predicate increasing_bool(array [int] of var bool: x);\n\ 84 predicate increasing_int(array [int] of var int: x);\n\ 85 predicate inverse_offsets(array [int] of var int: f, int: foff, array [int] of var int: invf, int: invfoff);\n\ 86 predicate maximum_int(var int: m, array [int] of var int: x);\n\ 87 predicate member_bool(array [int] of var bool: x, var bool: y);\n\ 88 predicate member_int(array [int] of var int: x, var int: y);\n\ 89 predicate minimum_int(var int: m, array [int] of var int: x);\n\ 90 predicate nvalue(var int: n, array [int] of var int: x);\n\ 91 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\ 92 predicate sort(array [int] of var int: x, array [int] of var int: y);\n\ 93 predicate table_bool(array [int] of var bool: x, array [int, int] of bool: t);\n\ 94 predicate table_int(array [int] of var int: x, array [int, int] of int: t);\n\ 95 var 1..26: a :: output_var;\n\ 96 var 1..26: b :: output_var;\n\ 97 var 1..26: c :: output_var;\n\ 98 var 1..26: d :: output_var;\n\ 99 var 1..26: e :: output_var;\n\ 100 var 1..26: f :: output_var;\n\ 101 var 1..26: g :: output_var;\n\ 102 var 1..26: h :: output_var;\n\ 103 var 1..26: i :: output_var;\n\ 104 var 1..26: j :: output_var;\n\ 105 var 1..26: k :: output_var;\n\ 106 var 1..26: l :: output_var;\n\ 107 var 1..26: m :: output_var;\n\ 108 var 1..26: n :: output_var;\n\ 109 var 1..26: o :: output_var;\n\ 110 var 1..26: p :: output_var;\n\ 111 var 1..26: q :: output_var;\n\ 112 var 1..26: r :: output_var;\n\ 113 var 1..26: s :: output_var;\n\ 114 var 1..26: t :: output_var;\n\ 115 var 1..26: u :: output_var;\n\ 116 var 1..26: v :: output_var;\n\ 117 var 1..26: w :: output_var;\n\ 118 var 1..26: x :: output_var;\n\ 119 var 1..26: y :: output_var;\n\ 120 var 1..26: z :: output_var;\n\ 121 constraint all_different_int([a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q, r, s, t, u, v, w, x, y, z]);\n\ 122 constraint int_lin_eq([1, 1, 2], [a, j, z], 58);\n\ 123 constraint int_lin_eq([1, 1, 2], [b, e, o], 53);\n\ 124 constraint int_lin_eq([1, 2, 1], [l, o, s], 37);\n\ 125 constraint int_lin_eq([2, 1, 1], [e, g, l], 66);\n\ 126 constraint int_lin_eq([1, 1, 1, 1], [e, l, r, y], 47);\n\ 127 constraint int_lin_eq([1, 1, 1, 1], [g, n, o, s], 61);\n\ 128 constraint int_lin_eq([1, 1, 1, 2], [e, f, g, u], 50);\n\ 129 constraint int_lin_eq([1, 1, 2, 1], [c, e, l, o], 43);\n\ 130 constraint int_lin_eq([2, 1, 1, 1], [e, h, m, t], 72);\n\ 131 constraint int_lin_eq([1, 1, 1, 1, 1], [a, c, e, l, s], 51);\n\ 132 constraint int_lin_eq([1, 1, 1, 1, 1], [a, e, o, p, r], 65);\n\ 133 constraint int_lin_eq([1, 1, 1, 1, 1], [a, k, l, o, p], 59);\n\ 134 constraint int_lin_eq([1, 1, 1, 1, 1], [a, l, t, w, z], 34);\n\ 135 constraint int_lin_eq([1, 1, 1, 1, 1], [e, f, l, t, u], 30);\n\ 136 constraint int_lin_eq([1, 1, 1, 2, 1], [a, b, e, l, t], 45);\n\ 137 constraint int_lin_eq([2, 1, 1, 1, 1], [i, l, n, o, v], 100);\n\ 138 constraint int_lin_eq([1, 1, 1, 1, 2, 1], [a, e, q, r, t, u], 50);\n\ 139 constraint int_lin_eq([1, 1, 2, 1, 1, 1], [a, n, o, p, r, s], 82);\n\ 140 constraint int_lin_eq([2, 1, 1, 1, 1, 1], [c, e, n, o, r, t], 74);\n\ 141 constraint int_lin_eq([1, 1, 1, 1, 2, 1, 1, 1], [a, e, h, n, o, p, s, x], 134);\n\ Gecode::FloatVal c(-8, 8)