combinatorial_auction.fzn

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..5] of int: bids = [8, 6, 5, 2, 2];
array [1..5] of set of int: packages = [1..4, {2, 3, 6}, {1, 4, 5}, {2, 7}, 5..6];
var 0..23: INT____00001 :: is_defined_var :: var_is_introduced;
var 0..23: total :: output_var = INT____00001;
array [1..5] of var 0..1: x :: output_array([1..5]);
constraint int_lin_eq([-1, 8, 6, 5, 2, 2], [INT____00001, x[1], x[2], x[3], x[4], x[5]], 0) :: defines_var(INT____00001);
constraint int_lin_le([1, 1], [x[1], x[2]], 1);
constraint int_lin_le([1, 1], [x[1], x[3]], 1);
constraint int_lin_le([1, 1], [x[2], x[5]], 1);
constraint int_lin_le([1, 1], [x[3], x[5]], 1);
constraint int_lin_le([1, 1, 1], [x[1], x[2], x[4]], 1);
solve  :: int_search(x, first_fail, indomain_min, complete) maximize INT____00001;