main page
modules
namespaces
classes
files
Gecode home
Generated on Tue Jan 28 2020 00:00:00 for Gecode by
doxygen
1.8.17
test
flatzinc
langford2.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(
"langford2"
,
50
"predicate bool_lin_ge(array [int] of int: a, array [int] of var bool: x, var int: c);\n\
51
predicate bool_lin_gt(array [int] of int: a, array [int] of var bool: x, var int: c);\n\
52
predicate bool_lin_lt(array [int] of int: a, array [int] of var bool: x, var int: c);\n\
53
predicate bool_lin_ne(array [int] of int: a, array [int] of var bool: x, var int: c);\n\
54
var bool: BOOL____00002 :: is_defined_var :: var_is_introduced;\n\
55
var bool: BOOL____00006 :: is_defined_var :: var_is_introduced;\n\
56
var bool: BOOL____00008 :: is_defined_var :: var_is_introduced;\n\
57
var bool: BOOL____00012 :: is_defined_var :: var_is_introduced;\n\
58
var bool: BOOL____00014 :: is_defined_var :: var_is_introduced;\n\
59
var bool: BOOL____00018 :: is_defined_var :: var_is_introduced;\n\
60
var bool: BOOL____00020 :: is_defined_var :: var_is_introduced;\n\
61
var bool: BOOL____00024 :: is_defined_var :: var_is_introduced;\n\
62
var bool: BOOL____00026 :: is_defined_var :: var_is_introduced;\n\
63
var bool: BOOL____00030 :: is_defined_var :: var_is_introduced;\n\
64
var bool: BOOL____00032 :: is_defined_var :: var_is_introduced;\n\
65
var bool: BOOL____00036 :: is_defined_var :: var_is_introduced;\n\
66
var bool: BOOL____00038 :: is_defined_var :: var_is_introduced;\n\
67
var bool: BOOL____00042 :: is_defined_var :: var_is_introduced;\n\
68
array [1..7] of var 1..14: Fst;\n\
69
var 3..16: INT____00003 :: is_defined_var :: var_is_introduced;\n\
70
var 1..14: INT____00004 :: is_defined_var :: var_is_introduced;\n\
71
var 1..7: INT____00005 :: is_defined_var :: var_is_introduced;\n\
72
var 4..17: INT____00009 :: is_defined_var :: var_is_introduced;\n\
73
var 1..14: INT____00010 :: is_defined_var :: var_is_introduced;\n\
74
var 1..7: INT____00011 :: is_defined_var :: var_is_introduced;\n\
75
var 5..18: INT____00015 :: is_defined_var :: var_is_introduced;\n\
76
var 1..14: INT____00016 :: is_defined_var :: var_is_introduced;\n\
77
var 1..7: INT____00017 :: is_defined_var :: var_is_introduced;\n\
78
var 6..19: INT____00021 :: is_defined_var :: var_is_introduced;\n\
79
var 1..14: INT____00022 :: is_defined_var :: var_is_introduced;\n\
80
var 1..7: INT____00023 :: is_defined_var :: var_is_introduced;\n\
81
var 7..20: INT____00027 :: is_defined_var :: var_is_introduced;\n\
82
var 1..14: INT____00028 :: is_defined_var :: var_is_introduced;\n\
83
var 1..7: INT____00029 :: is_defined_var :: var_is_introduced;\n\
84
var 8..21: INT____00033 :: is_defined_var :: var_is_introduced;\n\
85
var 1..14: INT____00034 :: is_defined_var :: var_is_introduced;\n\
86
var 1..7: INT____00035 :: is_defined_var :: var_is_introduced;\n\
87
var 9..22: INT____00039 :: is_defined_var :: var_is_introduced;\n\
88
var 1..14: INT____00040 :: is_defined_var :: var_is_introduced;\n\
89
var 1..7: INT____00041 :: is_defined_var :: var_is_introduced;\n\
90
array [1..14] of var 1..7: a :: output_array([1..14]);\n\
91
constraint array_bool_and([BOOL____00006, BOOL____00002, BOOL____00002], true);\n\
92
constraint array_bool_and([BOOL____00012, BOOL____00008, BOOL____00008], true);\n\
93
constraint array_bool_and([BOOL____00018, BOOL____00014, BOOL____00014], true);\n\
94
constraint array_bool_and([BOOL____00024, BOOL____00020, BOOL____00020], true);\n\
95
constraint array_bool_and([BOOL____00030, BOOL____00026, BOOL____00026], true);\n\
96
constraint array_bool_and([BOOL____00036, BOOL____00032, BOOL____00032], true);\n\
97
constraint array_bool_and([BOOL____00042, BOOL____00038, BOOL____00038], true);\n\
98
constraint array_var_int_element(INT____00004, a, INT____00005) :: defines_var(INT____00005);\n\
99
constraint array_var_int_element(INT____00010, a, INT____00011) :: defines_var(INT____00011);\n\
100
constraint array_var_int_element(INT____00016, a, INT____00017) :: defines_var(INT____00017);\n\
101
constraint array_var_int_element(INT____00022, a, INT____00023) :: defines_var(INT____00023);\n\
102
constraint array_var_int_element(INT____00028, a, INT____00029) :: defines_var(INT____00029);\n\
103
constraint array_var_int_element(INT____00034, a, INT____00035) :: defines_var(INT____00035);\n\
104
constraint array_var_int_element(INT____00040, a, INT____00041) :: defines_var(INT____00041);\n\
105
constraint array_var_int_element(Fst[1], a, 1);\n\
106
constraint array_var_int_element(Fst[2], a, 2);\n\
107
constraint array_var_int_element(Fst[3], a, 3);\n\
108
constraint array_var_int_element(Fst[4], a, 4);\n\
109
constraint array_var_int_element(Fst[5], a, 5);\n\
110
constraint array_var_int_element(Fst[6], a, 6);\n\
111
constraint array_var_int_element(Fst[7], a, 7);\n\
112
constraint int_eq_reif(INT____00003, INT____00004, BOOL____00002);\n\
113
constraint int_eq_reif(INT____00005, 1, BOOL____00006) :: defines_var(BOOL____00006);\n\
114
constraint int_eq_reif(INT____00009, INT____00010, BOOL____00008);\n\
115
constraint int_eq_reif(INT____00011, 2, BOOL____00012) :: defines_var(BOOL____00012);\n\
116
constraint int_eq_reif(INT____00015, INT____00016, BOOL____00014);\n\
117
constraint int_eq_reif(INT____00017, 3, BOOL____00018) :: defines_var(BOOL____00018);\n\
118
constraint int_eq_reif(INT____00021, INT____00022, BOOL____00020);\n\
119
constraint int_eq_reif(INT____00023, 4, BOOL____00024) :: defines_var(BOOL____00024);\n\
120
constraint int_eq_reif(INT____00027, INT____00028, BOOL____00026);\n\
121
constraint int_eq_reif(INT____00029, 5, BOOL____00030) :: defines_var(BOOL____00030);\n\
122
constraint int_eq_reif(INT____00033, INT____00034, BOOL____00032);\n\
123
constraint int_eq_reif(INT____00035, 6, BOOL____00036) :: defines_var(BOOL____00036);\n\
124
constraint int_eq_reif(INT____00039, INT____00040, BOOL____00038);\n\
125
constraint int_eq_reif(INT____00041, 7, BOOL____00042) :: defines_var(BOOL____00042);\n\
126
constraint int_le(Fst[1], 12);\n\
127
constraint int_le(Fst[2], 11);\n\
128
constraint int_le(Fst[3], 10);\n\
129
constraint int_le(Fst[4], 9);\n\
130
constraint int_le(Fst[5], 8);\n\
131
constraint int_le(Fst[6], 7);\n\
132
constraint int_le(Fst[7], 6);\n\
133
constraint int_le(a[1], a[14]);\n\
134
constraint int_lin_eq([-1, 1], [INT____00003, Fst[1]], -2) :: defines_var(INT____00003) :: domain;\n\
135
constraint int_lin_eq([-1, 1], [INT____00009, Fst[2]], -3) :: defines_var(INT____00009) :: domain;\n\
136
constraint int_lin_eq([-1, 1], [INT____00015, Fst[3]], -4) :: defines_var(INT____00015) :: domain;\n\
137
constraint int_lin_eq([-1, 1], [INT____00021, Fst[4]], -5) :: defines_var(INT____00021) :: domain;\n\
138
constraint int_lin_eq([-1, 1], [INT____00027, Fst[5]], -6) :: defines_var(INT____00027) :: domain;\n\
139
constraint int_lin_eq([-1, 1], [INT____00033, Fst[6]], -7) :: defines_var(INT____00033) :: domain;\n\
140
constraint int_lin_eq([-1, 1], [INT____00039, Fst[7]], -8) :: defines_var(INT____00039) :: domain;\n\
141
constraint int_lin_le_reif([1], [Fst[1]], 12, BOOL____00002) :: defines_var(BOOL____00002);\n\
142
constraint int_lin_le_reif([1], [Fst[2]], 11, BOOL____00008) :: defines_var(BOOL____00008);\n\
143
constraint int_lin_le_reif([1], [Fst[3]], 10, BOOL____00014) :: defines_var(BOOL____00014);\n\
144
constraint int_lin_le_reif([1], [Fst[4]], 9, BOOL____00020) :: defines_var(BOOL____00020);\n\
145
constraint int_lin_le_reif([1], [Fst[5]], 8, BOOL____00026) :: defines_var(BOOL____00026);\n\
146
constraint int_lin_le_reif([1], [Fst[6]], 7, BOOL____00032) :: defines_var(BOOL____00032);\n\
147
constraint int_lin_le_reif([1], [Fst[7]], 6, BOOL____00038) :: defines_var(BOOL____00038);\n\
148
solve :: int_search(Fst, first_fail, indomain_min, complete) satisfy;\n\
149
"
,
"a = array1d(1..14, [1, 7, 1, 2, 6, 4, 2, 5, 3, 7, 4, 6, 3, 5]);\n\
150
----------\n\
151
"
);
152
}
153
};
154
155
Create
c
;
156
}
157
158
}}
159
160
// STATISTICS: test-flatzinc
Test
General test support.
Definition:
afc.cpp:43
Test::Float::Arithmetic::c
Gecode::FloatVal c(-8, 8)
flatzinc.hh