main page
modules
namespaces
classes
files
Gecode home
Generated on Mon Jul 27 2020 00:00:00 for Gecode by
doxygen
1.8.18
test
flatzinc
tenpenki_4.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(
"tenpenki::4"
,
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
var bool: BOOL____00003 :: is_defined_var :: var_is_introduced;\n\
51
var bool: BOOL____00004 :: is_defined_var :: var_is_introduced;\n\
52
var bool: BOOL____00016 :: is_defined_var :: var_is_introduced;\n\
53
var bool: BOOL____00017 :: is_defined_var :: var_is_introduced;\n\
54
array [1..9] of var bool: a :: output_array([1..3, 1..3]);\n\
55
array [1..1] of var 1..3: s____00001;\n\
56
array [1..1] of var 1..3: s____00007;\n\
57
array [1..1] of var 1..3: s____00011;\n\
58
array [1..1] of var 1..3: s____00014;\n\
59
array [1..1] of var 1..3: s____00020;\n\
60
array [1..1] of var 1..3: s____00024;\n\
61
constraint array_bool_and([BOOL____00003, BOOL____00004], a[6]);\n\
62
constraint array_bool_and([BOOL____00016, BOOL____00017], a[8]);\n\
63
constraint bool_eq(a[3], true);\n\
64
constraint bool_eq(a[7], true);\n\
65
constraint int_le_reif(s____00001[1], 1, a[3]);\n\
66
constraint int_le_reif(s____00001[1], 2, BOOL____00003) :: defines_var(BOOL____00003);\n\
67
constraint int_le_reif(s____00007[1], 1, a[2]);\n\
68
constraint int_le_reif(s____00007[1], 2, a[5]);\n\
69
constraint int_le_reif(s____00011[1], 1, a[1]);\n\
70
constraint int_le_reif(s____00011[1], 2, a[4]);\n\
71
constraint int_le_reif(s____00014[1], 1, a[7]);\n\
72
constraint int_le_reif(s____00014[1], 2, BOOL____00016) :: defines_var(BOOL____00016);\n\
73
constraint int_le_reif(s____00020[1], 1, a[4]);\n\
74
constraint int_le_reif(s____00020[1], 2, a[5]);\n\
75
constraint int_le_reif(s____00024[1], 1, a[1]);\n\
76
constraint int_le_reif(s____00024[1], 2, a[2]);\n\
77
constraint int_lin_le([1], [s____00007[1]], 2);\n\
78
constraint int_lin_le([1], [s____00011[1]], 1);\n\
79
constraint int_lin_le([1], [s____00020[1]], 2);\n\
80
constraint int_lin_le([1], [s____00024[1]], 1);\n\
81
constraint int_lin_le_reif([-1], [s____00001[1]], -3, a[9]);\n\
82
constraint int_lin_le_reif([-1], [s____00001[1]], -2, BOOL____00004) :: defines_var(BOOL____00004);\n\
83
constraint int_lin_le_reif([-1], [s____00007[1]], -2, a[8]);\n\
84
constraint int_lin_le_reif([-1], [s____00014[1]], -3, a[9]);\n\
85
constraint int_lin_le_reif([-1], [s____00014[1]], -2, BOOL____00017) :: defines_var(BOOL____00017);\n\
86
constraint int_lin_le_reif([-1], [s____00020[1]], -2, a[6]);\n\
87
solve satisfy;\n\
88
"
,
"a = array2d(1..3, 1..3, [true, true, true, true, true, false, true, false, false]);\n\
89
----------\n\
90
"
);
91
}
92
};
93
94
Create
c
;
95
}
96
97
}}
98
99
// STATISTICS: test-flatzinc
Test
General test support.
Definition:
afc.cpp:39
Test::Float::Arithmetic::c
Gecode::FloatVal c(-8, 8)
flatzinc.hh