Debian Codegraph @

tests/spec/unit/regression/github_897.mzn

raw
1 /***
2 !Test
3 solvers: [gecode]
4 expected: !Result
5 - !Solution
6 arr: [2, 1]
7 ***/
8 int: n = 2;
9 int: m = 4;
10 array[1..n] of var 1..m: soln;
11
12 constraint forall(i in 1..n-1)(soln[i] > soln[i+1]);
13 var int: total = sum(i in 1..n)(soln[i]);
14
15 solve
16 :: warm_start(soln[1..n], [2,1])
17 minimize total;