Generated on Thu Jan 16 2025 00:00:00 for Gecode by doxygen 1.14.0
eq20.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
36namespace Test { namespace FlatZinc {
37
38 namespace {
40 class Create {
41 public:
42
44 Create(void) {
45 (void) new FlatZincTest("eq20",
46"predicate bool_lin_ge(array [int] of int: a, array [int] of var bool: x, var int: c);\n\
47predicate bool_lin_gt(array [int] of int: a, array [int] of var bool: x, var int: c);\n\
48predicate bool_lin_lt(array [int] of int: a, array [int] of var bool: x, var int: c);\n\
49predicate bool_lin_ne(array [int] of int: a, array [int] of var bool: x, var int: c);\n\
50array [1..7] of var 0..10: x :: output_array([0..6]);\n\
51constraint int_lin_eq([-85698, 29958, 57308, 48789, -78219, 4657, 34539], [x[1], x[2], x[3], x[4], x[5], x[6], x[7]], 249912);\n\
52constraint int_lin_eq([-76706, 98205, 23445, 67921, 24111, -48614, -41906], [x[1], x[2], x[3], x[4], x[5], x[6], x[7]], 821228);\n\
53constraint int_lin_eq([-67456, 84750, -51553, 21239, 81675, -99395, -4254], [x[1], x[2], x[3], x[4], x[5], x[6], x[7]], 277271);\n\
54constraint int_lin_eq([-64919, 80460, 90840, -59624, -75542, 25145, -47935], [x[1], x[2], x[3], x[4], x[5], x[6], x[7]], 18465);\n\
55constraint int_lin_eq([-60301, 31227, 93951, 73889, 81526, -72702, 68026], [x[1], x[2], x[3], x[4], x[5], x[6], x[7]], 1410723);\n\
56constraint int_lin_eq([-60113, 29475, 34421, -76870, 62646, 29278, -15212], [x[1], x[2], x[3], x[4], x[5], x[6], x[7]], 251591);\n\
57constraint int_lin_eq([-45086, 51830, -4578, 96120, 21231, 97919, 65651], [x[1], x[2], x[3], x[4], x[5], x[6], x[7]], 1198280);\n\
58constraint int_lin_eq([-43277, 43525, 92298, 58630, 92590, -9372, -60227], [x[1], x[2], x[3], x[4], x[5], x[6], x[7]], 1503588);\n\
59constraint int_lin_eq([-16835, 47385, 97715, -12640, 69028, 76212, -81102], [x[1], x[2], x[3], x[4], x[5], x[6], x[7]], 1244857);\n\
60constraint int_lin_eq([-16105, 62397, -6704, 43340, 95100, -68610, 58301], [x[1], x[2], x[3], x[4], x[5], x[6], x[7]], 876370);\n\
61constraint int_lin_eq([-10343, 87758, -11782, 19346, 70072, -36991, 44529], [x[1], x[2], x[3], x[4], x[5], x[6], x[7]], 740061);\n\
62constraint int_lin_eq([1671, -34121, 10763, 80609, 42532, 93520, -33488], [x[1], x[2], x[3], x[4], x[5], x[6], x[7]], 915683);\n\
63constraint int_lin_eq([8874, -58412, 73947, 17147, 62335, 16005, 8632], [x[1], x[2], x[3], x[4], x[5], x[6], x[7]], 752447);\n\
64constraint int_lin_eq([49149, 52871, -7132, 56728, -33576, -49530, -62089], [x[1], x[2], x[3], x[4], x[5], x[6], x[7]], 146074);\n\
65constraint int_lin_eq([51637, 67761, 95951, 3834, -96722, 59190, 15280], [x[1], x[2], x[3], x[4], x[5], x[6], x[7]], 533909);\n\
66constraint int_lin_eq([71202, -11119, 73017, -38875, -14413, -29234, 72370], [x[1], x[2], x[3], x[4], x[5], x[6], x[7]], 129768);\n\
67constraint int_lin_eq([85176, -95332, -1268, 57898, 15883, 50547, 83287], [x[1], x[2], x[3], x[4], x[5], x[6], x[7]], 373854);\n\
68constraint int_lin_eq([85268, 54180, -18810, -48219, 6013, 78169, -79785], [x[1], x[2], x[3], x[4], x[5], x[6], x[7]], 90614);\n\
69constraint int_lin_eq([87059, -29101, -5513, -21219, 22128, 7276, 57308], [x[1], x[2], x[3], x[4], x[5], x[6], x[7]], 22167);\n\
70constraint int_lin_eq([94016, -82071, 35961, 66597, -30705, -44404, -38304], [x[1], x[2], x[3], x[4], x[5], x[6], x[7]], 25334);\n\
71solve satisfy;\n\
72", "x = array1d(0..6, [1, 4, 6, 6, 6, 3, 1]);\n\
73----------\n\
74");
75 }
76 };
77
78 Create c;
79 }
80
81}}
82
83// STATISTICS: test-flatzinc
Tests for FlatZinc.
Definition flatzinc.cpp:36
Gecode::FloatVal c(-8, 8)
General test support.
Definition afc.cpp:39