main page
modules
namespaces
classes
files
Gecode home
Generated on Wed Jan 1 2020 10:37:59 for Gecode by
doxygen
1.8.16
test
flatzinc
perfsq.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
* 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
36
namespace
Test
{
namespace
FlatZinc {
37
38
namespace
{
40
class
Create {
41
public
:
42
44
Create(
void
) {
45
(void)
new
FlatZincTest(
"perfect_square::1"
,
46
"predicate bool_lin_ge(array [int] of int: a, array [int] of var bool: x, var int: c);\n\
47
predicate bool_lin_gt(array [int] of int: a, array [int] of var bool: x, var int: c);\n\
48
predicate bool_lin_lt(array [int] of int: a, array [int] of var bool: x, var int: c);\n\
49
predicate bool_lin_ne(array [int] of int: a, array [int] of var bool: x, var int: c);\n\
50
array [1..11] of int: sq = [0, 1, 4, 9, 16, 25, 36, 49, 64, 81, 100];\n\
51
var bool: BOOL____00003 :: is_defined_var :: var_is_introduced;\n\
52
var bool: BOOL____00004 :: is_defined_var :: var_is_introduced;\n\
53
var bool: BOOL____00005 :: is_defined_var :: var_is_introduced;\n\
54
var bool: BOOL____00006 :: is_defined_var :: var_is_introduced;\n\
55
var bool: BOOL____00007 :: is_defined_var :: var_is_introduced;\n\
56
var bool: BOOL____00008 :: is_defined_var :: var_is_introduced;\n\
57
var bool: BOOL____00009 :: is_defined_var :: var_is_introduced;\n\
58
var bool: BOOL____00010 :: is_defined_var :: var_is_introduced;\n\
59
var bool: BOOL____00011 :: is_defined_var :: var_is_introduced;\n\
60
var bool: BOOL____00012 :: is_defined_var :: var_is_introduced;\n\
61
var bool: BOOL____00013 :: is_defined_var :: var_is_introduced;\n\
62
var bool: BOOL____00014 :: is_defined_var :: var_is_introduced;\n\
63
var bool: BOOL____00015 :: is_defined_var :: var_is_introduced;\n\
64
var bool: BOOL____00016 :: is_defined_var :: var_is_introduced;\n\
65
var bool: BOOL____00017 :: is_defined_var :: var_is_introduced;\n\
66
var bool: BOOL____00018 :: is_defined_var :: var_is_introduced;\n\
67
var bool: BOOL____00019 :: is_defined_var :: var_is_introduced;\n\
68
var bool: BOOL____00020 :: is_defined_var :: var_is_introduced;\n\
69
var bool: BOOL____00021 :: is_defined_var :: var_is_introduced;\n\
70
var bool: BOOL____00022 :: is_defined_var :: var_is_introduced;\n\
71
var 2..11: INT____00001 :: is_defined_var :: var_is_introduced;\n\
72
var 1..10: INT____00002 :: is_defined_var :: var_is_introduced;\n\
73
var 1..11: INT____00023 :: is_defined_var :: var_is_introduced;\n\
74
var 0..100: INT____00024 :: is_defined_var :: var_is_introduced;\n\
75
var 1..11: INT____00025 :: is_defined_var :: var_is_introduced;\n\
76
var 0..100: INT____00026 :: is_defined_var :: var_is_introduced;\n\
77
var 1..11: INT____00027 :: is_defined_var :: var_is_introduced;\n\
78
var 0..100: INT____00028 :: is_defined_var :: var_is_introduced;\n\
79
var 1..11: INT____00029 :: is_defined_var :: var_is_introduced;\n\
80
var 0..100: INT____00030 :: is_defined_var :: var_is_introduced;\n\
81
var 1..11: INT____00031 :: is_defined_var :: var_is_introduced;\n\
82
var 0..100: INT____00032 :: is_defined_var :: var_is_introduced;\n\
83
var 1..11: INT____00033 :: is_defined_var :: var_is_introduced;\n\
84
var 0..100: INT____00034 :: is_defined_var :: var_is_introduced;\n\
85
var 1..11: INT____00035 :: is_defined_var :: var_is_introduced;\n\
86
var 0..100: INT____00036 :: is_defined_var :: var_is_introduced;\n\
87
var 1..11: INT____00037 :: is_defined_var :: var_is_introduced;\n\
88
var 0..100: INT____00038 :: is_defined_var :: var_is_introduced;\n\
89
var 1..11: INT____00039 :: is_defined_var :: var_is_introduced;\n\
90
var 0..100: INT____00040 :: is_defined_var :: var_is_introduced;\n\
91
var 1..11: INT____00041 :: is_defined_var :: var_is_introduced;\n\
92
var 0..100: INT____00042 :: is_defined_var :: var_is_introduced;\n\
93
var 1..11: INT____00043 :: is_defined_var :: var_is_introduced;\n\
94
var 0..100: INT____00044 :: is_defined_var :: var_is_introduced;\n\
95
var 2..11: INT____00045 :: is_defined_var :: var_is_introduced;\n\
96
var 0..100: INT____00047 :: is_defined_var :: var_is_introduced;\n\
97
var 1..10: j;\n\
98
var 1..10: k :: output_var;\n\
99
array [1..11] of var 0..10: s :: output_array([0..10]);\n\
100
constraint array_int_element(INT____00023, sq, INT____00024) :: defines_var(INT____00024);\n\
101
constraint array_int_element(INT____00025, sq, INT____00026) :: defines_var(INT____00026);\n\
102
constraint array_int_element(INT____00027, sq, INT____00028) :: defines_var(INT____00028);\n\
103
constraint array_int_element(INT____00029, sq, INT____00030) :: defines_var(INT____00030);\n\
104
constraint array_int_element(INT____00031, sq, INT____00032) :: defines_var(INT____00032);\n\
105
constraint array_int_element(INT____00033, sq, INT____00034) :: defines_var(INT____00034);\n\
106
constraint array_int_element(INT____00035, sq, INT____00036) :: defines_var(INT____00036);\n\
107
constraint array_int_element(INT____00037, sq, INT____00038) :: defines_var(INT____00038);\n\
108
constraint array_int_element(INT____00039, sq, INT____00040) :: defines_var(INT____00040);\n\
109
constraint array_int_element(INT____00041, sq, INT____00042) :: defines_var(INT____00042);\n\
110
constraint array_int_element(INT____00043, sq, INT____00044) :: defines_var(INT____00044);\n\
111
constraint array_int_element(INT____00045, sq, INT____00047);\n\
112
constraint array_var_int_element(INT____00001, s, INT____00002) :: defines_var(INT____00002);\n\
113
constraint bool_le(BOOL____00003, BOOL____00004);\n\
114
constraint bool_le(BOOL____00005, BOOL____00006);\n\
115
constraint bool_le(BOOL____00007, BOOL____00008);\n\
116
constraint bool_le(BOOL____00009, BOOL____00010);\n\
117
constraint bool_le(BOOL____00011, BOOL____00012);\n\
118
constraint bool_le(BOOL____00013, BOOL____00014);\n\
119
constraint bool_le(BOOL____00015, BOOL____00016);\n\
120
constraint bool_le(BOOL____00017, BOOL____00018);\n\
121
constraint bool_le(BOOL____00019, BOOL____00020);\n\
122
constraint bool_le(BOOL____00021, BOOL____00022);\n\
123
constraint int_lin_eq([-1, 1], [INT____00001, j], -1) :: defines_var(INT____00001) :: domain;\n\
124
constraint int_lin_eq([-1, 1], [INT____00023, s[1]], -1) :: defines_var(INT____00023) :: domain;\n\
125
constraint int_lin_eq([-1, 1], [INT____00025, s[2]], -1) :: defines_var(INT____00025) :: domain;\n\
126
constraint int_lin_eq([-1, 1], [INT____00027, s[3]], -1) :: defines_var(INT____00027) :: domain;\n\
127
constraint int_lin_eq([-1, 1], [INT____00029, s[4]], -1) :: defines_var(INT____00029) :: domain;\n\
128
constraint int_lin_eq([-1, 1], [INT____00031, s[5]], -1) :: defines_var(INT____00031) :: domain;\n\
129
constraint int_lin_eq([-1, 1], [INT____00033, s[6]], -1) :: defines_var(INT____00033) :: domain;\n\
130
constraint int_lin_eq([-1, 1], [INT____00035, s[7]], -1) :: defines_var(INT____00035) :: domain;\n\
131
constraint int_lin_eq([-1, 1], [INT____00037, s[8]], -1) :: defines_var(INT____00037) :: domain;\n\
132
constraint int_lin_eq([-1, 1], [INT____00039, s[9]], -1) :: defines_var(INT____00039) :: domain;\n\
133
constraint int_lin_eq([-1, 1], [INT____00041, s[10]], -1) :: defines_var(INT____00041) :: domain;\n\
134
constraint int_lin_eq([-1, 1], [INT____00043, s[11]], -1) :: defines_var(INT____00043) :: domain;\n\
135
constraint int_lin_eq([-1, 1], [INT____00045, k], -1) :: defines_var(INT____00045) :: domain;\n\
136
constraint int_lin_eq([-1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [INT____00047, INT____00024, INT____00026, INT____00028, INT____00030, INT____00032, INT____00034, INT____00036, INT____00038, INT____00040, INT____00042, INT____00044], 0) :: defines_var(INT____00047);\n\
137
constraint int_lt(s[1], k);\n\
138
constraint int_lt_reif(0, s[2], BOOL____00003) :: defines_var(BOOL____00003);\n\
139
constraint int_lt_reif(0, s[3], BOOL____00005) :: defines_var(BOOL____00005);\n\
140
constraint int_lt_reif(0, s[4], BOOL____00007) :: defines_var(BOOL____00007);\n\
141
constraint int_lt_reif(0, s[5], BOOL____00009) :: defines_var(BOOL____00009);\n\
142
constraint int_lt_reif(0, s[6], BOOL____00011) :: defines_var(BOOL____00011);\n\
143
constraint int_lt_reif(0, s[7], BOOL____00013) :: defines_var(BOOL____00013);\n\
144
constraint int_lt_reif(0, s[8], BOOL____00015) :: defines_var(BOOL____00015);\n\
145
constraint int_lt_reif(0, s[9], BOOL____00017) :: defines_var(BOOL____00017);\n\
146
constraint int_lt_reif(0, s[10], BOOL____00019) :: defines_var(BOOL____00019);\n\
147
constraint int_lt_reif(0, s[11], BOOL____00021) :: defines_var(BOOL____00021);\n\
148
constraint int_lt_reif(s[2], s[1], BOOL____00004) :: defines_var(BOOL____00004);\n\
149
constraint int_lt_reif(s[3], s[2], BOOL____00006) :: defines_var(BOOL____00006);\n\
150
constraint int_lt_reif(s[4], s[3], BOOL____00008) :: defines_var(BOOL____00008);\n\
151
constraint int_lt_reif(s[5], s[4], BOOL____00010) :: defines_var(BOOL____00010);\n\
152
constraint int_lt_reif(s[6], s[5], BOOL____00012) :: defines_var(BOOL____00012);\n\
153
constraint int_lt_reif(s[7], s[6], BOOL____00014) :: defines_var(BOOL____00014);\n\
154
constraint int_lt_reif(s[8], s[7], BOOL____00016) :: defines_var(BOOL____00016);\n\
155
constraint int_lt_reif(s[9], s[8], BOOL____00018) :: defines_var(BOOL____00018);\n\
156
constraint int_lt_reif(s[10], s[9], BOOL____00020) :: defines_var(BOOL____00020);\n\
157
constraint int_lt_reif(s[11], s[10], BOOL____00022) :: defines_var(BOOL____00022);\n\
158
solve maximize j;\n\
159
"
,
"k = 10;\n\
160
s = array1d(0..10, [7, 5, 4, 3, 1, 0, 0, 0, 0, 0, 0]);\n\
161
----------\n\
162
==========\n\
163
"
);
164
}
165
};
166
167
Create
c
;
168
}
169
170
}}
171
172
// STATISTICS: test-flatzinc
Test
General test support.
Definition:
afc.cpp:39
Test::Float::Arithmetic::c
Gecode::FloatVal c(-8, 8)
flatzinc.hh