1
0
This repository has been archived on 2025-03-06. You can view files and clone it, but cannot push or open issues or pull requests.

81 lines
1.8 KiB
MiniZinc

% RUNS ON mzn20_fd
% RUNS ON mzn-fzn_fd
% RUNS ON mzn20_fd_linear
% RUNS ON mzn20_mip
% Regression test for a bug in mzn2fzn 1.2. The optimisation pass was leaving
% dangling references to variables it had "eliminated". The symptom was the
% following error from the FlatZinc interpreter:
%
% subsets_100.fzn:413:
% symbol error: `INT____407' undeclared
%
% (This model is from the original bug report.)
% Subsets 100 puzzle in MiniZinc.
%
% From rec.puzzle FAQ
% http://brainyplanet.com/index.php/Subsets?PHPSESSID=051ae1e2b6df794a5a08fc7b5ecf8028
% """
% Out of the set of integers 1,...,100 you are given ten different integers.
% From this set, A, of ten integers you can always find two disjoint non-empty
% subsets, S & T, such that the sum of elements in S equals the sum of elements
% in T. Note: S union T need not be all ten elements of A. Prove this.
% """
%
% This MiniZinc model was created by Hakan Kjellerstrand, hakank@bonetmail.com
% See also my MiniZinc page: http://www.hakank.org/minizinc
%
include "globals.mzn";
int: n = 100;
int: m = 10;
var set of 1..n: s;
var set of 1..n: t;
var int: s_total;
var int: t_total;
%
% sums the integer in set ss
%
predicate sum_set(var set of int: ss, var int: total) =
let {
int: m = card(ub(ss)),
array[1..m] of var 0..1: tmp
}
in
forall(i in 1..m) (
i in ss <-> tmp[i] = 1
)
/\
total = sum(i in 1..m) (i*tmp[i])
;
solve :: set_search([s,t],
input_order, indomain_min, complete) satisfy;
constraint
card(s union t) <= m
/\
card(s union t) > 0
/\
disjoint(s, t)
/\
sum_set(s, s_total)
/\
sum_set(t, t_total)
/\
s_total = t_total
% /\
% t_total = n
;
output [
"s: ", show(s), "\n",
"t: ", show(t), "\n",
"s_total: ", show(s_total), "\n",
"t_total: ", show(t_total), "\n",
];