40 namespace Test {
namespace FlatZinc {
49 (void)
new FlatZincTest(
"golomb",
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 var 0..15: INT____00001 :: is_defined_var :: var_is_introduced;\n\
100 var 0..16: INT____00002 :: is_defined_var :: var_is_introduced;\n\
101 var 0..16: INT____00003 :: is_defined_var :: var_is_introduced;\n\
102 var 0..16: INT____00004 :: is_defined_var :: var_is_introduced;\n\
103 var 0..16: INT____00005 :: is_defined_var :: var_is_introduced;\n\
104 var 1..16: INT____00006 :: is_defined_var :: var_is_introduced;\n\
105 array [1..6] of var 0..16: differences = [INT____00001, INT____00002, INT____00003, INT____00004, INT____00005, INT____00006];\n\
106 array [1..4] of var 0..16: mark :: output_array([1..4]);\n\
107 constraint all_different_int(differences);\n\
108 constraint int_eq(mark[1], 0);\n\
109 constraint int_lin_eq([-1, -1, 1], [INT____00001, mark[1], mark[2]], 0) :: defines_var(INT____00001);\n\
110 constraint int_lin_eq([-1, -1, 1], [INT____00002, mark[1], mark[3]], 0) :: defines_var(INT____00002);\n\
111 constraint int_lin_eq([-1, -1, 1], [INT____00003, mark[1], mark[4]], 0) :: defines_var(INT____00003);\n\
112 constraint int_lin_eq([-1, -1, 1], [INT____00004, mark[2], mark[3]], 0) :: defines_var(INT____00004);\n\
113 constraint int_lin_eq([-1, -1, 1], [INT____00005, mark[2], mark[4]], 0) :: defines_var(INT____00005);\n\
114 constraint int_lin_eq([-1, -1, 1], [INT____00006, mark[3], mark[4]], 0) :: defines_var(INT____00006);\n\
115 constraint int_lt(INT____00001, INT____00006);\n\
116 constraint int_lt(mark[1], mark[2]);\n\
117 constraint int_lt(mark[2], mark[3]);\n\
118 constraint int_lt(mark[3], mark[4]);\n\
119 solve :: int_search(mark, input_order, indomain, complete) minimize mark[4];\n\
120 ",
"mark = array1d(1..4, [0, 1, 4, 6]);\n\
Gecode::FloatVal c(-8, 8)