Generated on Sat Feb 7 2015 02:01:32 for Gecode by doxygen 1.8.9.1
zebra.cpp
Go to the documentation of this file.
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  * Last modified:
10  * $Date: 2014-11-04 13:28:32 +0100 (Tue, 04 Nov 2014) $ by $Author: schulte $
11  * $Revision: 14287 $
12  *
13  * This file is part of Gecode, the generic constraint
14  * development environment:
15  * http://www.gecode.org
16  *
17  * Permission is hereby granted, free of charge, to any person obtaining
18  * a copy of this software and associated documentation files (the
19  * "Software"), to deal in the Software without restriction, including
20  * without limitation the rights to use, copy, modify, merge, publish,
21  * distribute, sublicense, and/or sell copies of the Software, and to
22  * permit persons to whom the Software is furnished to do so, subject to
23  * the following conditions:
24  *
25  * The above copyright notice and this permission notice shall be
26  * included in all copies or substantial portions of the Software.
27  *
28  * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
29  * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
30  * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
31  * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
32  * LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
33  * OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
34  * WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
35  *
36  */
37 
38 #include "test/flatzinc.hh"
39 
40 namespace Test { namespace FlatZinc {
41 
42  namespace {
44  class Create {
45  public:
46 
48  Create(void) {
49  (void) new FlatZincTest("zebra",
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 bool: BOOL____00001 :: is_defined_var :: var_is_introduced;\n\
100 var bool: BOOL____00002 :: is_defined_var :: var_is_introduced;\n\
101 var bool: BOOL____00004 :: is_defined_var :: var_is_introduced;\n\
102 var bool: BOOL____00005 :: is_defined_var :: var_is_introduced;\n\
103 var bool: BOOL____00007 :: is_defined_var :: var_is_introduced;\n\
104 var bool: BOOL____00008 :: is_defined_var :: var_is_introduced;\n\
105 array [1..5] of var 1..5: animal :: output_array([0..4]);\n\
106 array [1..5] of var 1..5: colour :: output_array([0..4]);\n\
107 array [1..5] of var 1..5: drink :: output_array([0..4]);\n\
108 array [1..5] of var 1..5: nation :: output_array([0..4]);\n\
109 array [1..5] of var 1..5: smoke :: output_array([0..4]);\n\
110 constraint all_different_int(animal);\n\
111 constraint all_different_int(colour);\n\
112 constraint all_different_int(drink);\n\
113 constraint all_different_int(nation);\n\
114 constraint all_different_int(smoke);\n\
115 constraint array_bool_or([BOOL____00001, BOOL____00002], true);\n\
116 constraint array_bool_or([BOOL____00004, BOOL____00005], true);\n\
117 constraint array_bool_or([BOOL____00007, BOOL____00008], true);\n\
118 constraint int_eq(3, drink[3]);\n\
119 constraint int_eq(animal[1], nation[2]);\n\
120 constraint int_eq(animal[5], smoke[1]);\n\
121 constraint int_eq(colour[1], nation[1]);\n\
122 constraint int_eq(colour[2], drink[1]);\n\
123 constraint int_eq(colour[4], smoke[2]);\n\
124 constraint int_eq(drink[2], nation[3]);\n\
125 constraint int_eq(drink[4], smoke[4]);\n\
126 constraint int_eq(nation[4], 1);\n\
127 constraint int_eq(smoke[5], nation[5]);\n\
128 constraint int_lin_eq([-1, 1], [colour[2], colour[3]], -1);\n\
129 constraint int_lin_eq_reif([-1, 1], [animal[2], smoke[3]], -1, BOOL____00002) :: defines_var(BOOL____00002);\n\
130 constraint int_lin_eq_reif([-1, 1], [animal[3], smoke[2]], -1, BOOL____00005) :: defines_var(BOOL____00005);\n\
131 constraint int_lin_eq_reif([-1, 1], [colour[5], nation[4]], -1, BOOL____00008) :: defines_var(BOOL____00008);\n\
132 constraint int_lin_eq_reif([1, -1], [animal[2], smoke[3]], -1, BOOL____00001) :: defines_var(BOOL____00001);\n\
133 constraint int_lin_eq_reif([1, -1], [animal[3], smoke[2]], -1, BOOL____00004) :: defines_var(BOOL____00004);\n\
134 constraint int_lin_eq_reif([1, -1], [colour[5], nation[4]], -1, BOOL____00007) :: defines_var(BOOL____00007);\n\
135 solve satisfy;\n\
136 ", "animal = array1d(0..4, [4, 1, 2, 5, 3]);\n\
137 colour = array1d(0..4, [3, 5, 4, 1, 2]);\n\
138 drink = array1d(0..4, [5, 2, 3, 4, 1]);\n\
139 nation = array1d(0..4, [3, 4, 2, 1, 5]);\n\
140 smoke = array1d(0..4, [3, 1, 2, 4, 5]);\n\
141 ----------\n\
142 ");
143  }
144  };
145 
146  Create c;
147  }
148 
149 }}
150 
151 // STATISTICS: test-flatzinc
Gecode::FloatVal c(-8, 8)
General test support.
Definition: afc.cpp:43