| 1 |
/*** |
| 2 |
!Test |
| 3 |
solvers: [gecode, chuffed] |
| 4 |
expected: !Result |
| 5 |
solution: !SolutionSet |
| 6 |
- !Solution |
| 7 |
gcc_x: [null, 6, 7, 8, 8, 6, 9, null, null, 6] |
| 8 |
gcc_c: [3, 1, 2, 1] |
| 9 |
- !Solution |
| 10 |
gcc_x: [null, 6, 7, 6, 8, 8, 9, null, null, 6] |
| 11 |
gcc_c: [3, 1, 2, 1] |
| 12 |
- !Solution |
| 13 |
gcc_x: [null, 6, 7, 8, 8, null, 9, 6, null, 6] |
| 14 |
gcc_c: [3, 1, 2, 1] |
| 15 |
- !Solution |
| 16 |
gcc_x: [null, 6, 7, 6, 8, null, 9, 8, null, 6] |
| 17 |
gcc_c: [3, 1, 2, 1] |
| 18 |
- !Solution |
| 19 |
gcc_x: [null, 6, 7, null, 8, 8, 9, 6, null, 6] |
| 20 |
gcc_c: [3, 1, 2, 1] |
| 21 |
- !Solution |
| 22 |
gcc_x: [null, 6, 7, null, 8, 6, 9, 8, null, 6] |
| 23 |
gcc_c: [3, 1, 2, 1] |
| 24 |
- !Solution |
| 25 |
gcc_x: [null, 6, 7, 8, 8, null, 9, null, 6, 6] |
| 26 |
gcc_c: [3, 1, 2, 1] |
| 27 |
- !Solution |
| 28 |
gcc_x: [null, 6, 7, 6, 8, null, 9, null, 8, 6] |
| 29 |
gcc_c: [3, 1, 2, 1] |
| 30 |
- !Solution |
| 31 |
gcc_x: [null, 6, 7, null, 8, 8, 9, null, 6, 6] |
| 32 |
gcc_c: [3, 1, 2, 1] |
| 33 |
- !Solution |
| 34 |
gcc_x: [null, 6, 7, null, 8, 6, 9, null, 8, 6] |
| 35 |
gcc_c: [3, 1, 2, 1] |
| 36 |
- !Solution |
| 37 |
gcc_x: [null, 6, 7, null, 8, null, 9, 8, 6, 6] |
| 38 |
gcc_c: [3, 1, 2, 1] |
| 39 |
- !Solution |
| 40 |
gcc_x: [null, 6, 7, null, 8, null, 9, 6, 8, 6] |
| 41 |
gcc_c: [3, 1, 2, 1] |
| 42 |
options: |
| 43 |
all_solutions: true |
| 44 |
***/ |
| 45 |
|
| 46 |
include "globals.mzn"; |
| 47 |
|
| 48 |
constraint global_cardinality([3, 3, <>, 8, 6, <>], [3, 5, 6], [2, 0, 1]); |
| 49 |
|
| 50 |
array[1..10] of var opt 6..10: gcc_x :: output = [<>, 6, 7, _, 8, _, 9, _, _, 6]; |
| 51 |
array[1..4] of var -100..100: gcc_c :: output = [3, 1, 2, _]; |
| 52 |
|
| 53 |
constraint global_cardinality(gcc_x, [6, 7, 8, 9], gcc_c); |
| 54 |
constraint count (xi in gcc_x) (absent(xi)) > 2; |
| 55 |
|
| 56 |
solve satisfy; |