this repo has no description
dekker.one
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 {
39 /// Helper class to create and register tests
40 class Create {
41 public:
42
43 /// Perform creation and registration
44 Create(void) {
45 (void) new FlatZincTest("cutstock",
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..3] of int: i_demand = [2, 2, 4];\n\
51array [1..3] of int: i_length = [7, 5, 3];\n\
52var 0..8: INT____00001 :: is_defined_var :: var_is_introduced;\n\
53array [1..24] of var int: items :: output_array([1..8, 1..3]);\n\
54var 0..8: obj :: output_var = INT____00001;\n\
55array [1..8] of var 0..1: pieces :: output_array([1..8]);\n\
56constraint int_le(0, items[1]);\n\
57constraint int_le(0, items[2]);\n\
58constraint int_le(0, items[3]);\n\
59constraint int_le(0, items[4]);\n\
60constraint int_le(0, items[5]);\n\
61constraint int_le(0, items[6]);\n\
62constraint int_le(0, items[7]);\n\
63constraint int_le(0, items[8]);\n\
64constraint int_le(0, items[9]);\n\
65constraint int_le(0, items[10]);\n\
66constraint int_le(0, items[11]);\n\
67constraint int_le(0, items[12]);\n\
68constraint int_le(0, items[13]);\n\
69constraint int_le(0, items[14]);\n\
70constraint int_le(0, items[15]);\n\
71constraint int_le(0, items[16]);\n\
72constraint int_le(0, items[17]);\n\
73constraint int_le(0, items[18]);\n\
74constraint int_le(0, items[19]);\n\
75constraint int_le(0, items[20]);\n\
76constraint int_le(0, items[21]);\n\
77constraint int_le(0, items[22]);\n\
78constraint int_le(0, items[23]);\n\
79constraint int_le(0, items[24]);\n\
80constraint int_lin_eq([-1, 1, 1, 1, 1, 1, 1, 1, 1], [INT____00001, pieces[1], pieces[2], pieces[3], pieces[4], pieces[5], pieces[6], pieces[7], pieces[8]], 0) :: defines_var(INT____00001);\n\
81constraint int_lin_le([7, 5, 3, -10], [items[1], items[2], items[3], pieces[1]], 0);\n\
82constraint int_lin_le([7, 5, 3, -10], [items[4], items[5], items[6], pieces[2]], 0);\n\
83constraint int_lin_le([7, 5, 3, -10], [items[7], items[8], items[9], pieces[3]], 0);\n\
84constraint int_lin_le([7, 5, 3, -10], [items[10], items[11], items[12], pieces[4]], 0);\n\
85constraint int_lin_le([7, 5, 3, -10], [items[13], items[14], items[15], pieces[5]], 0);\n\
86constraint int_lin_le([7, 5, 3, -10], [items[16], items[17], items[18], pieces[6]], 0);\n\
87constraint int_lin_le([7, 5, 3, -10], [items[19], items[20], items[21], pieces[7]], 0);\n\
88constraint int_lin_le([7, 5, 3, -10], [items[22], items[23], items[24], pieces[8]], 0);\n\
89constraint int_lin_le([-1, -1, -1, -1, -1, -1, -1, -1], [items[1], items[4], items[7], items[10], items[13], items[16], items[19], items[22]], -2);\n\
90constraint int_lin_le([-1, -1, -1, -1, -1, -1, -1, -1], [items[2], items[5], items[8], items[11], items[14], items[17], items[20], items[23]], -2);\n\
91constraint int_lin_le([-1, -1, -1, -1, -1, -1, -1, -1], [items[3], items[6], items[9], items[12], items[15], items[18], items[21], items[24]], -4);\n\
92solve :: int_search([items[1], items[2], items[3], items[4], items[5], items[6], items[7], items[8], items[9], items[10], items[11], items[12], items[13], items[14], items[15], items[16], items[17], items[18], items[19], items[20], items[21], items[22], items[23], items[24], pieces[1], pieces[2], pieces[3], pieces[4], pieces[5], pieces[6], pieces[7], pieces[8]], input_order, indomain_min, complete) minimize INT____00001;\n\
93", "items = array2d(1..8, 1..3, [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 0, 2, 0, 1, 0, 1, 1, 0, 1]);\n\
94obj = 4;\n\
95pieces = array1d(1..8, [0, 0, 0, 0, 1, 1, 1, 1]);\n\
96----------\n\
97==========\n\
98");
99 }
100 };
101
102 Create c;
103 }
104
105}}
106
107// STATISTICS: test-flatzinc