Generated on Thu Apr 11 13:59:21 2019 for Gecode by doxygen 1.6.3

jobshop2x2.cpp

Go to the documentation of this file.
00001 /* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
00002 /*
00003  *  Main authors:
00004  *     Guido Tack <tack@gecode.org>
00005  *
00006  *  Copyright:
00007  *     Guido Tack, 2014
00008  *
00009  *  This file is part of Gecode, the generic constraint
00010  *  development environment:
00011  *     http://www.gecode.org
00012  *
00013  *  Permission is hereby granted, free of charge, to any person obtaining
00014  *  a copy of this software and associated documentation files (the
00015  *  "Software"), to deal in the Software without restriction, including
00016  *  without limitation the rights to use, copy, modify, merge, publish,
00017  *  distribute, sublicense, and/or sell copies of the Software, and to
00018  *  permit persons to whom the Software is furnished to do so, subject to
00019  *  the following conditions:
00020  *
00021  *  The above copyright notice and this permission notice shall be
00022  *  included in all copies or substantial portions of the Software.
00023  *
00024  *  THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
00025  *  EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
00026  *  MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
00027  *  NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
00028  *  LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
00029  *  OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
00030  *  WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
00031  *
00032  */
00033 
00034 #include "test/flatzinc.hh"
00035 
00036 namespace Test { namespace FlatZinc {
00037 
00038   namespace {
00040     class Create {
00041     public:
00042 
00044       Create(void) {
00045         (void) new FlatZincTest("jobshop2x2",
00046 "predicate bool_lin_ge(array [int] of int: a, array [int] of var bool: x, var int: c);\n\
00047 predicate bool_lin_gt(array [int] of int: a, array [int] of var bool: x, var int: c);\n\
00048 predicate bool_lin_lt(array [int] of int: a, array [int] of var bool: x, var int: c);\n\
00049 predicate bool_lin_ne(array [int] of int: a, array [int] of var bool: x, var int: c);\n\
00050 array [1..4] of int: d = [2, 5, 3, 4];\n\
00051 var bool: BOOL____00001 :: is_defined_var :: var_is_introduced;\n\
00052 var bool: BOOL____00002 :: is_defined_var :: var_is_introduced;\n\
00053 var bool: BOOL____00004 :: is_defined_var :: var_is_introduced;\n\
00054 var bool: BOOL____00005 :: is_defined_var :: var_is_introduced;\n\
00055 var 5..14: end;\n\
00056 array [1..4] of var 0..14: s :: output_array([1..2, 1..2]);\n\
00057 constraint array_bool_or([BOOL____00001, BOOL____00002], true);\n\
00058 constraint array_bool_or([BOOL____00004, BOOL____00005], true);\n\
00059 constraint int_lin_le([-1, 1], [end, s[2]], -5);\n\
00060 constraint int_lin_le([-1, 1], [end, s[4]], -4);\n\
00061 constraint int_lin_le([1, -1], [s[1], s[2]], -2);\n\
00062 constraint int_lin_le([1, -1], [s[3], s[4]], -3);\n\
00063 constraint int_lin_le_reif([-1, 1], [s[1], s[3]], -3, BOOL____00002) :: defines_var(BOOL____00002);\n\
00064 constraint int_lin_le_reif([-1, 1], [s[2], s[4]], -4, BOOL____00005) :: defines_var(BOOL____00005);\n\
00065 constraint int_lin_le_reif([1, -1], [s[1], s[3]], -2, BOOL____00001) :: defines_var(BOOL____00001);\n\
00066 constraint int_lin_le_reif([1, -1], [s[2], s[4]], -5, BOOL____00004) :: defines_var(BOOL____00004);\n\
00067 solve minimize end;\n\
00068 ", "s = array2d(1..2, 1..2, [0, 2, 2, 7]);\n\
00069 ----------\n\
00070 ==========\n\
00071 ");
00072       }
00073     };
00074 
00075     Create c;
00076   }
00077 
00078 }}
00079 
00080 // STATISTICS: test-flatzinc