/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */ /* * Main authors: * Guido Tack * * Copyright: * Guido Tack, 2014 * * This file is part of Gecode, the generic constraint * development environment: * http://www.gecode.org * * Permission is hereby granted, free of charge, to any person obtaining * a copy of this software and associated documentation files (the * "Software"), to deal in the Software without restriction, including * without limitation the rights to use, copy, modify, merge, publish, * distribute, sublicense, and/or sell copies of the Software, and to * permit persons to whom the Software is furnished to do so, subject to * the following conditions: * * The above copyright notice and this permission notice shall be * included in all copies or substantial portions of the Software. * * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE * LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION * OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION * WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. * */ #include "test/flatzinc.hh" namespace Test { namespace FlatZinc { namespace { /// Helper class to create and register tests class Create { public: /// Perform creation and registration Create(void) { (void) new FlatZincTest("zebra", "predicate all_different_int(array [int] of var int: x);\n\ predicate all_equal_int(array [int] of var int: x);\n\ predicate among(var int: n, array [int] of var int: x, set of int: v);\n\ predicate array_bool_lq(array [int] of var bool: x, array [int] of var bool: y);\n\ predicate array_bool_lt(array [int] of var bool: x, array [int] of var bool: y);\n\ predicate array_int_lq(array [int] of var int: x, array [int] of var int: y);\n\ predicate array_int_lt(array [int] of var int: x, array [int] of var int: y);\n\ predicate array_set_partition(array [int] of var set of int: S, set of int: universe);\n\ predicate at_least_int(int: n, array [int] of var int: x, int: v);\n\ predicate at_most_int(int: n, array [int] of var int: x, int: v);\n\ predicate bool_lin_ge(array [int] of int: a, array [int] of var bool: x, var int: c);\n\ predicate bool_lin_gt(array [int] of int: a, array [int] of var bool: x, var int: c);\n\ predicate bool_lin_lt(array [int] of int: a, array [int] of var bool: x, var int: c);\n\ predicate bool_lin_ne(array [int] of int: a, array [int] of var bool: x, var int: c);\n\ predicate count(array [int] of var int: x, var int: y, var int: c);\n\ predicate count_reif(array [int] of var int: x, var int: y, var int: c, var bool: b);\n\ predicate cumulatives(array [int] of var int: s, array [int] of var int: d, array [int] of var int: r, var int: b);\n\ predicate decreasing_bool(array [int] of var bool: x);\n\ predicate decreasing_int(array [int] of var int: x);\n\ predicate disjoint(var set of int: s1, var set of int: s2);\n\ predicate gecode_array_set_element_union(var set of int: x, array [int] of var set of int: y, var set of int: z);\n\ predicate gecode_bin_packing_load(array [int] of var int: l, array [int] of var int: bin, array [int] of int: w, int: minIndex);\n\ predicate gecode_circuit(int: offset, array [int] of var int: x);\n\ predicate gecode_int_set_channel(array [int] of var int: x, int: xoff, array [int] of var set of int: y, int: yoff);\n\ predicate gecode_inverse_set(array [int] of var set of int: f, array [int] of var set of int: invf, int: xoff, int: yoff);\n\ predicate gecode_link_set_to_booleans(var set of int: s, array [int] of var bool: b, int: idx);\n\ predicate gecode_member_bool_reif(array [int] of var bool: x, var bool: y, var bool: b);\n\ predicate gecode_member_int_reif(array [int] of var int: x, var int: y, var bool: b);\n\ predicate gecode_nooverlap(array [int] of var int: x, array [int] of var int: w, array [int] of var int: y, array [int] of var int: h);\n\ predicate gecode_precede(array [int] of var int: x, int: s, int: t);\n\ predicate gecode_precede_set(array [int] of var set of int: x, int: s, int: t);\n\ predicate gecode_range(array [int] of var int: x, int: xoff, var set of int: s, var set of int: t);\n\ predicate gecode_set_weights(array [int] of int: csi, array [int] of int: cs, var set of int: x, var int: y);\n\ predicate global_cardinality(array [int] of var int: x, array [int] of int: cover, array [int] of var int: counts);\n\ predicate global_cardinality_closed(array [int] of var int: x, array [int] of int: cover, array [int] of var int: counts);\n\ predicate global_cardinality_low_up(array [int] of var int: x, array [int] of int: cover, array [int] of int: lbound, array [int] of int: ubound);\n\ predicate global_cardinality_low_up_closed(array [int] of var int: x, array [int] of int: cover, array [int] of int: lbound, array [int] of int: ubound);\n\ predicate increasing_bool(array [int] of var bool: x);\n\ predicate increasing_int(array [int] of var int: x);\n\ predicate inverse_offsets(array [int] of var int: f, int: foff, array [int] of var int: invf, int: invfoff);\n\ predicate maximum_int(var int: m, array [int] of var int: x);\n\ predicate member_bool(array [int] of var bool: x, var bool: y);\n\ predicate member_int(array [int] of var int: x, var int: y);\n\ predicate minimum_int(var int: m, array [int] of var int: x);\n\ predicate nvalue(var int: n, array [int] of var int: x);\n\ predicate regular(array [int] of var int: x, int: Q, int: S, array [int, int] of int: d, int: q0, set of int: F);\n\ predicate sort(array [int] of var int: x, array [int] of var int: y);\n\ predicate table_bool(array [int] of var bool: x, array [int, int] of bool: t);\n\ predicate table_int(array [int] of var int: x, array [int, int] of int: t);\n\ var bool: BOOL____00001 :: is_defined_var :: var_is_introduced;\n\ var bool: BOOL____00002 :: is_defined_var :: var_is_introduced;\n\ var bool: BOOL____00004 :: is_defined_var :: var_is_introduced;\n\ var bool: BOOL____00005 :: is_defined_var :: var_is_introduced;\n\ var bool: BOOL____00007 :: is_defined_var :: var_is_introduced;\n\ var bool: BOOL____00008 :: is_defined_var :: var_is_introduced;\n\ array [1..5] of var 1..5: animal :: output_array([0..4]);\n\ array [1..5] of var 1..5: colour :: output_array([0..4]);\n\ array [1..5] of var 1..5: drink :: output_array([0..4]);\n\ array [1..5] of var 1..5: nation :: output_array([0..4]);\n\ array [1..5] of var 1..5: smoke :: output_array([0..4]);\n\ constraint all_different_int(animal);\n\ constraint all_different_int(colour);\n\ constraint all_different_int(drink);\n\ constraint all_different_int(nation);\n\ constraint all_different_int(smoke);\n\ constraint array_bool_or([BOOL____00001, BOOL____00002], true);\n\ constraint array_bool_or([BOOL____00004, BOOL____00005], true);\n\ constraint array_bool_or([BOOL____00007, BOOL____00008], true);\n\ constraint int_eq(3, drink[3]);\n\ constraint int_eq(animal[1], nation[2]);\n\ constraint int_eq(animal[5], smoke[1]);\n\ constraint int_eq(colour[1], nation[1]);\n\ constraint int_eq(colour[2], drink[1]);\n\ constraint int_eq(colour[4], smoke[2]);\n\ constraint int_eq(drink[2], nation[3]);\n\ constraint int_eq(drink[4], smoke[4]);\n\ constraint int_eq(nation[4], 1);\n\ constraint int_eq(smoke[5], nation[5]);\n\ constraint int_lin_eq([-1, 1], [colour[2], colour[3]], -1);\n\ constraint int_lin_eq_reif([-1, 1], [animal[2], smoke[3]], -1, BOOL____00002) :: defines_var(BOOL____00002);\n\ constraint int_lin_eq_reif([-1, 1], [animal[3], smoke[2]], -1, BOOL____00005) :: defines_var(BOOL____00005);\n\ constraint int_lin_eq_reif([-1, 1], [colour[5], nation[4]], -1, BOOL____00008) :: defines_var(BOOL____00008);\n\ constraint int_lin_eq_reif([1, -1], [animal[2], smoke[3]], -1, BOOL____00001) :: defines_var(BOOL____00001);\n\ constraint int_lin_eq_reif([1, -1], [animal[3], smoke[2]], -1, BOOL____00004) :: defines_var(BOOL____00004);\n\ constraint int_lin_eq_reif([1, -1], [colour[5], nation[4]], -1, BOOL____00007) :: defines_var(BOOL____00007);\n\ solve satisfy;\n\ ", "animal = array1d(0..4, [4, 1, 2, 5, 3]);\n\ colour = array1d(0..4, [3, 5, 4, 1, 2]);\n\ drink = array1d(0..4, [5, 2, 3, 4, 1]);\n\ nation = array1d(0..4, [3, 4, 2, 1, 5]);\n\ smoke = array1d(0..4, [3, 1, 2, 4, 5]);\n\ ----------\n\ "); } }; Create c; } }} // STATISTICS: test-flatzinc