this repo has no description
dekker.one
1/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
2/*
3 * Main authors:
4 * Guido Tack <tack@gecode.org>
5 *
6 * Copyright:
7 * Guido Tack, 2014
8 *
9 * This file is part of Gecode, the generic constraint
10 * development environment:
11 * http://www.gecode.org
12 *
13 * Permission is hereby granted, free of charge, to any person obtaining
14 * a copy of this software and associated documentation files (the
15 * "Software"), to deal in the Software without restriction, including
16 * without limitation the rights to use, copy, modify, merge, publish,
17 * distribute, sublicense, and/or sell copies of the Software, and to
18 * permit persons to whom the Software is furnished to do so, subject to
19 * the following conditions:
20 *
21 * The above copyright notice and this permission notice shall be
22 * included in all copies or substantial portions of the Software.
23 *
24 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
25 * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
26 * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
27 * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
28 * LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
29 * OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
30 * WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
31 *
32 */
33
34#include "test/flatzinc.hh"
35
36namespace Test { namespace FlatZinc {
37
38 namespace {
39 /// Helper class to create and register tests
40 class Create {
41 public:
42
43 /// Perform creation and registration
44 Create(void) {
45 (void) new FlatZincTest("alpha",
46"predicate all_different_int(array [int] of var int: x);\n\
47predicate all_equal_int(array [int] of var int: x);\n\
48predicate among(var int: n, array [int] of var int: x, set of int: v);\n\
49predicate array_bool_lq(array [int] of var bool: x, array [int] of var bool: y);\n\
50predicate array_bool_lt(array [int] of var bool: x, array [int] of var bool: y);\n\
51predicate array_int_lq(array [int] of var int: x, array [int] of var int: y);\n\
52predicate array_int_lt(array [int] of var int: x, array [int] of var int: y);\n\
53predicate array_set_partition(array [int] of var set of int: S, set of int: universe);\n\
54predicate at_least_int(int: n, array [int] of var int: x, int: v);\n\
55predicate at_most_int(int: n, array [int] of var int: x, int: v);\n\
56predicate bool_lin_ge(array [int] of int: a, array [int] of var bool: x, var int: c);\n\
57predicate bool_lin_gt(array [int] of int: a, array [int] of var bool: x, var int: c);\n\
58predicate bool_lin_lt(array [int] of int: a, array [int] of var bool: x, var int: c);\n\
59predicate bool_lin_ne(array [int] of int: a, array [int] of var bool: x, var int: c);\n\
60predicate count(array [int] of var int: x, var int: y, var int: c);\n\
61predicate count_reif(array [int] of var int: x, var int: y, var int: c, var bool: b);\n\
62predicate cumulatives(array [int] of var int: s, array [int] of var int: d, array [int] of var int: r, var int: b);\n\
63predicate decreasing_bool(array [int] of var bool: x);\n\
64predicate decreasing_int(array [int] of var int: x);\n\
65predicate disjoint(var set of int: s1, var set of int: s2);\n\
66predicate gecode_array_set_element_union(var set of int: x, array [int] of var set of int: y, var set of int: z);\n\
67predicate gecode_bin_packing_load(array [int] of var int: l, array [int] of var int: bin, array [int] of int: w, int: minIndex);\n\
68predicate gecode_circuit(int: offset, array [int] of var int: x);\n\
69predicate gecode_int_set_channel(array [int] of var int: x, int: xoff, array [int] of var set of int: y, int: yoff);\n\
70predicate gecode_inverse_set(array [int] of var set of int: f, array [int] of var set of int: invf, int: xoff, int: yoff);\n\
71predicate gecode_link_set_to_booleans(var set of int: s, array [int] of var bool: b, int: idx);\n\
72predicate gecode_member_bool_reif(array [int] of var bool: x, var bool: y, var bool: b);\n\
73predicate gecode_member_int_reif(array [int] of var int: x, var int: y, var bool: b);\n\
74predicate 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\
75predicate gecode_precede(array [int] of var int: x, int: s, int: t);\n\
76predicate gecode_precede_set(array [int] of var set of int: x, int: s, int: t);\n\
77predicate gecode_range(array [int] of var int: x, int: xoff, var set of int: s, var set of int: t);\n\
78predicate gecode_set_weights(array [int] of int: csi, array [int] of int: cs, var set of int: x, var int: y);\n\
79predicate global_cardinality(array [int] of var int: x, array [int] of int: cover, array [int] of var int: counts);\n\
80predicate global_cardinality_closed(array [int] of var int: x, array [int] of int: cover, array [int] of var int: counts);\n\
81predicate 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\
82predicate 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\
83predicate increasing_bool(array [int] of var bool: x);\n\
84predicate increasing_int(array [int] of var int: x);\n\
85predicate inverse_offsets(array [int] of var int: f, int: foff, array [int] of var int: invf, int: invfoff);\n\
86predicate maximum_int(var int: m, array [int] of var int: x);\n\
87predicate member_bool(array [int] of var bool: x, var bool: y);\n\
88predicate member_int(array [int] of var int: x, var int: y);\n\
89predicate minimum_int(var int: m, array [int] of var int: x);\n\
90predicate nvalue(var int: n, array [int] of var int: x);\n\
91predicate regular(array [int] of var int: x, int: Q, int: S, array [int, int] of int: d, int: q0, set of int: F);\n\
92predicate sort(array [int] of var int: x, array [int] of var int: y);\n\
93predicate table_bool(array [int] of var bool: x, array [int, int] of bool: t);\n\
94predicate table_int(array [int] of var int: x, array [int, int] of int: t);\n\
95var 1..26: a :: output_var;\n\
96var 1..26: b :: output_var;\n\
97var 1..26: c :: output_var;\n\
98var 1..26: d :: output_var;\n\
99var 1..26: e :: output_var;\n\
100var 1..26: f :: output_var;\n\
101var 1..26: g :: output_var;\n\
102var 1..26: h :: output_var;\n\
103var 1..26: i :: output_var;\n\
104var 1..26: j :: output_var;\n\
105var 1..26: k :: output_var;\n\
106var 1..26: l :: output_var;\n\
107var 1..26: m :: output_var;\n\
108var 1..26: n :: output_var;\n\
109var 1..26: o :: output_var;\n\
110var 1..26: p :: output_var;\n\
111var 1..26: q :: output_var;\n\
112var 1..26: r :: output_var;\n\
113var 1..26: s :: output_var;\n\
114var 1..26: t :: output_var;\n\
115var 1..26: u :: output_var;\n\
116var 1..26: v :: output_var;\n\
117var 1..26: w :: output_var;\n\
118var 1..26: x :: output_var;\n\
119var 1..26: y :: output_var;\n\
120var 1..26: z :: output_var;\n\
121constraint 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\
122constraint int_lin_eq([1, 1, 2], [a, j, z], 58);\n\
123constraint int_lin_eq([1, 1, 2], [b, e, o], 53);\n\
124constraint int_lin_eq([1, 2, 1], [l, o, s], 37);\n\
125constraint int_lin_eq([2, 1, 1], [e, g, l], 66);\n\
126constraint int_lin_eq([1, 1, 1, 1], [e, l, r, y], 47);\n\
127constraint int_lin_eq([1, 1, 1, 1], [g, n, o, s], 61);\n\
128constraint int_lin_eq([1, 1, 1, 2], [e, f, g, u], 50);\n\
129constraint int_lin_eq([1, 1, 2, 1], [c, e, l, o], 43);\n\
130constraint int_lin_eq([2, 1, 1, 1], [e, h, m, t], 72);\n\
131constraint int_lin_eq([1, 1, 1, 1, 1], [a, c, e, l, s], 51);\n\
132constraint int_lin_eq([1, 1, 1, 1, 1], [a, e, o, p, r], 65);\n\
133constraint int_lin_eq([1, 1, 1, 1, 1], [a, k, l, o, p], 59);\n\
134constraint int_lin_eq([1, 1, 1, 1, 1], [a, l, t, w, z], 34);\n\
135constraint int_lin_eq([1, 1, 1, 1, 1], [e, f, l, t, u], 30);\n\
136constraint int_lin_eq([1, 1, 1, 2, 1], [a, b, e, l, t], 45);\n\
137constraint int_lin_eq([2, 1, 1, 1, 1], [i, l, n, o, v], 100);\n\
138constraint int_lin_eq([1, 1, 1, 1, 2, 1], [a, e, q, r, t, u], 50);\n\
139constraint int_lin_eq([1, 1, 2, 1, 1, 1], [a, n, o, p, r, s], 82);\n\
140constraint int_lin_eq([2, 1, 1, 1, 1, 1], [c, e, n, o, r, t], 74);\n\
141constraint int_lin_eq([1, 1, 1, 1, 2, 1, 1, 1], [a, e, h, n, o, p, s, x], 134);\n\
142solve satisfy;\n\
143", "a = 5;\n\
144b = 13;\n\
145c = 9;\n\
146d = 16;\n\
147e = 20;\n\
148f = 4;\n\
149g = 24;\n\
150h = 21;\n\
151i = 25;\n\
152j = 17;\n\
153k = 23;\n\
154l = 2;\n\
155m = 8;\n\
156n = 12;\n\
157o = 10;\n\
158p = 19;\n\
159q = 7;\n\
160r = 11;\n\
161s = 15;\n\
162t = 3;\n\
163u = 1;\n\
164v = 26;\n\
165w = 6;\n\
166x = 22;\n\
167y = 14;\n\
168z = 18;\n\
169----------\n\
170");
171 }
172 };
173
174 Create c;
175 }
176
177}}
178
179// STATISTICS: test-flatzinc