Skip to content

Q
qgroundcontrol
Switch branch/tag
Find file
Normal viewHistoryPermalink
ormat_game_problem2.fzn 2.94 KB
Newer Older
Valentin Platzgummer's avatar
123
3ce021db
 
Valentin Platzgummer committed
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 
predicate all_different_int(array [int] of var int: x);
predicate count(array [int] of var int: x, var int: y, var int: c);
predicate fixed_cumulative(array [int] of var int: s, array [int] of int: d, array [int] of int: r, int: b);
predicate global_cardinality(array [int] of var int: x, array [int] of int: cover, array [int] of var int: counts);
predicate maximum_int(var int: m, array [int] of var int: x);
predicate minimum_int(var int: m, array [int] of var int: x);
predicate sliding_sum(int: low, int: up, int: seq, array [int] of var int: vs);
predicate sort(array [int] of var int: x, array [int] of var int: y);
predicate table_bool(array [int] of var bool: x, array [int, int] of bool: t);
predicate table_int(array [int] of var int: x, array [int, int] of int: t);
predicate var_cumulative(array [int] of var int: s, array [int] of int: d, array [int] of int: r, var int: b);
array [1..54] of int: overlays = [1, 0, 0, 0, 1, 0, 0, 0, 1, 1, 0, 0, 0, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 0, 0, 0, 1, 0, 0, 1, 1, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 1, 1, 0, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0];
array [1..9] of int: problem = [1, 1, 1, 1, 1, 1, 1, 1, 1];
var bool: BOOL____00002 :: is_defined_var :: var_is_introduced;
var bool: BOOL____00003 :: is_defined_var :: var_is_introduced;
var bool: BOOL____00004 :: is_defined_var :: var_is_introduced;
var bool: BOOL____00005 :: is_defined_var :: var_is_introduced;
var bool: BOOL____00006 :: is_defined_var :: var_is_introduced;
var bool: BOOL____00007 :: is_defined_var :: var_is_introduced;
var 1..6: INT____00001 :: is_defined_var :: var_is_introduced;
var 1..6: num_overlays :: output_var = INT____00001;
array [1..6] of var 0..1: x :: output_array([1..6]);
constraint array_bool_or([BOOL____00003, BOOL____00002], true);
constraint array_bool_or([BOOL____00004, BOOL____00002], true);
constraint array_bool_or([BOOL____00005, BOOL____00003], true);
constraint array_bool_or([BOOL____00005, BOOL____00004], true);
constraint array_bool_or([BOOL____00006, BOOL____00003], true);
constraint array_bool_or([BOOL____00006, BOOL____00004], true);
constraint array_bool_or([BOOL____00007, BOOL____00002], true);
constraint array_bool_or([BOOL____00007, BOOL____00005], true);
constraint array_bool_or([BOOL____00007, BOOL____00006], true);
constraint int_eq_reif(x[1], 1, BOOL____00002) :: defines_var(BOOL____00002);
constraint int_eq_reif(x[2], 1, BOOL____00003) :: defines_var(BOOL____00003);
constraint int_eq_reif(x[3], 1, BOOL____00004) :: defines_var(BOOL____00004);
constraint int_eq_reif(x[4], 1, BOOL____00005) :: defines_var(BOOL____00005);
constraint int_eq_reif(x[5], 1, BOOL____00006) :: defines_var(BOOL____00006);
constraint int_eq_reif(x[6], 1, BOOL____00007) :: defines_var(BOOL____00007);
constraint int_lin_eq([-1, 1, 1, 1, 1, 1, 1], [INT____00001, x[1], x[2], x[3], x[4], x[5], x[6]], 0) :: defines_var(INT____00001);
solve  :: int_search([x[1], x[2], x[3], x[4], x[5], x[6], INT____00001], max_regret, indomain_min, complete) minimize INT____00001;