35 lines
4.3 KiB
MiniZinc
35 lines
4.3 KiB
MiniZinc
predicate fzn_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_fzn_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_fzn_cumulative(array [int] of var int: s, array [int] of int: d, array [int] of int: r, var int: b);
|
|
array [1..384] of int: overlays = [0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1];
|
|
array [1..16] of int: problem = [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0];
|
|
var 1..24: INT____00001 :: is_defined_var :: var_is_introduced;
|
|
var 1..24: num_overlays :: output_var = INT____00001;
|
|
array [1..24] of var 0..1: x :: output_array([1..24]);
|
|
constraint int_lin_eq([-1, -1, -1, -1, -1, -1], [x[13], x[14], x[15], x[16], x[17], x[18]], 0);
|
|
constraint int_lin_eq([-1, -1, -1, -1, -1, -1], [x[19], x[20], x[21], x[22], x[23], x[24]], 0);
|
|
constraint int_lin_eq([-1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [INT____00001, x[1], x[2], x[3], x[4], x[5], x[6], x[7], x[8], x[9], x[10], x[11], x[12], x[13], x[14], x[15], x[16], x[17], x[18], x[19], x[20], x[21], x[22], x[23], x[24]], 0) :: defines_var(INT____00001);
|
|
constraint int_lin_le([-1, -1, -1, -1, -1, -1], [x[1], x[2], x[3], x[4], x[5], x[6]], -1);
|
|
constraint int_lin_le([-1, -1, -1, -1, -1, -1], [x[1], x[2], x[15], x[16], x[21], x[22]], -1);
|
|
constraint int_lin_le([-1, -1, -1, -1, -1, -1], [x[1], x[3], x[7], x[9], x[13], x[15]], -1);
|
|
constraint int_lin_le([-1, -1, -1, -1, -1, -1], [x[1], x[6], x[7], x[12], x[20], x[22]], -1);
|
|
constraint int_lin_le([-1, -1, -1, -1, -1, -1], [x[2], x[4], x[8], x[10], x[14], x[16]], -1);
|
|
constraint int_lin_le([-1, -1, -1, -1, -1, -1], [x[2], x[5], x[8], x[11], x[19], x[21]], -1);
|
|
constraint int_lin_le([-1, -1, -1, -1, -1, -1], [x[3], x[4], x[9], x[10], x[23], x[24]], -1);
|
|
constraint int_lin_le([-1, -1, -1, -1, -1, -1], [x[3], x[5], x[13], x[18], x[19], x[24]], -1);
|
|
constraint int_lin_le([-1, -1, -1, -1, -1, -1], [x[4], x[6], x[14], x[17], x[20], x[23]], -1);
|
|
constraint int_lin_le([-1, -1, -1, -1, -1, -1], [x[5], x[6], x[11], x[12], x[17], x[18]], -1);
|
|
constraint int_lin_le([-1, -1, -1, -1, -1, -1], [x[7], x[8], x[9], x[10], x[11], x[12]], -1);
|
|
constraint int_lin_le([-1, -1, -1, -1, -1, -1], [x[7], x[8], x[13], x[14], x[19], x[20]], -1);
|
|
constraint int_lin_le([-1, -1, -1, -1, -1, -1], [x[9], x[11], x[15], x[17], x[21], x[23]], -1);
|
|
constraint int_lin_le([-1, -1, -1, -1, -1, -1], [x[10], x[12], x[16], x[18], x[22], x[24]], -1);
|
|
solve :: int_search([x[1], x[2], x[3], x[4], x[5], x[6], x[7], x[8], x[9], x[10], x[11], x[12], x[13], x[14], x[15], x[16], x[17], x[18], x[19], x[20], x[21], x[22], x[23], x[24], INT____00001], smallest, indomain_min, complete) minimize INT____00001;
|