36 namespace Test {
namespace FlatZinc {
45 (void)
new FlatZincTest(
"queens::cp2",
46 "predicate all_different_int(array [int] of var int: x);\n\ 47 predicate bool_lin_ge(array [int] of int: a, array [int] of var bool: x, var int: c);\n\ 48 predicate bool_lin_gt(array [int] of int: a, array [int] of var bool: x, var int: c);\n\ 49 predicate bool_lin_lt(array [int] of int: a, array [int] of var bool: x, var int: c);\n\ 50 predicate bool_lin_ne(array [int] of int: a, array [int] of var bool: x, var int: c);\n\ 51 var 2..9: INT____00001 :: is_defined_var :: var_is_introduced;\n\ 52 var 3..10: INT____00002 :: is_defined_var :: var_is_introduced;\n\ 53 var 4..11: INT____00003 :: is_defined_var :: var_is_introduced;\n\ 54 var 5..12: INT____00004 :: is_defined_var :: var_is_introduced;\n\ 55 var 6..13: INT____00005 :: is_defined_var :: var_is_introduced;\n\ 56 var 7..14: INT____00006 :: is_defined_var :: var_is_introduced;\n\ 57 var 8..15: INT____00007 :: is_defined_var :: var_is_introduced;\n\ 58 var 8..15: INT____00008 :: is_defined_var :: var_is_introduced;\n\ 59 var 7..14: INT____00009 :: is_defined_var :: var_is_introduced;\n\ 60 var 6..13: INT____00010 :: is_defined_var :: var_is_introduced;\n\ 61 var 5..12: INT____00011 :: is_defined_var :: var_is_introduced;\n\ 62 var 4..11: INT____00012 :: is_defined_var :: var_is_introduced;\n\ 63 var 3..10: INT____00013 :: is_defined_var :: var_is_introduced;\n\ 64 var 2..9: INT____00014 :: is_defined_var :: var_is_introduced;\n\ 65 array [1..8] of var 1..8: q :: output_array([1..8]);\n\ 66 constraint all_different_int([INT____00008, INT____00009, INT____00010, INT____00011, INT____00012, INT____00013, INT____00014, q[8]]);\n\ 67 constraint all_different_int([q[1], INT____00001, INT____00002, INT____00003, INT____00004, INT____00005, INT____00006, INT____00007]);\n\ 68 constraint all_different_int(q);\n\ 69 constraint int_lin_eq([-1, 1], [INT____00001, q[2]], -1) :: defines_var(INT____00001);\n\ 70 constraint int_lin_eq([-1, 1], [INT____00002, q[3]], -2) :: defines_var(INT____00002);\n\ 71 constraint int_lin_eq([-1, 1], [INT____00003, q[4]], -3) :: defines_var(INT____00003);\n\ 72 constraint int_lin_eq([-1, 1], [INT____00004, q[5]], -4) :: defines_var(INT____00004);\n\ 73 constraint int_lin_eq([-1, 1], [INT____00005, q[6]], -5) :: defines_var(INT____00005);\n\ 74 constraint int_lin_eq([-1, 1], [INT____00006, q[7]], -6) :: defines_var(INT____00006);\n\ 75 constraint int_lin_eq([-1, 1], [INT____00007, q[8]], -7) :: defines_var(INT____00007);\n\ 76 constraint int_lin_eq([-1, 1], [INT____00008, q[1]], -7) :: defines_var(INT____00008);\n\ 77 constraint int_lin_eq([-1, 1], [INT____00009, q[2]], -6) :: defines_var(INT____00009);\n\ 78 constraint int_lin_eq([-1, 1], [INT____00010, q[3]], -5) :: defines_var(INT____00010);\n\ 79 constraint int_lin_eq([-1, 1], [INT____00011, q[4]], -4) :: defines_var(INT____00011);\n\ 80 constraint int_lin_eq([-1, 1], [INT____00012, q[5]], -3) :: defines_var(INT____00012);\n\ 81 constraint int_lin_eq([-1, 1], [INT____00013, q[6]], -2) :: defines_var(INT____00013);\n\ 82 constraint int_lin_eq([-1, 1], [INT____00014, q[7]], -1) :: defines_var(INT____00014);\n\ 83 solve :: int_search(q, first_fail, indomain_min, complete) satisfy;\n\ 84 ",
"q = array1d(1..8, [1, 5, 8, 6, 3, 7, 2, 4]);\n\ Gecode::FloatVal c(-8, 8)