1
1
Model before rewriting:
2
2
3
- letting a be [[1,2,3;int(1..)],[4,5,6;int(1..)],[7,8,9;int(1..)];int(1..)]
3
+ letting a be [[1,2,3;int(1..3 )],[4,5,6;int(1..3 )],[7,8,9;int(1..3 )];int(1..3 )]
4
4
find b: int(1..10)
5
5
6
6
such that
7
7
8
- (b > a[[ 3, 3] ])
8
+ (b > a[3, 3])
9
9
10
10
--
11
11
12
- (b > a[[ 3, 3] ]),
12
+ (b > a[3, 3]),
13
13
~~> gt_to_geq ([("Minion", 8400)])
14
- (Sum([b, -1]) >= a[[ 3, 3] ])
14
+ (Sum([b, -1]) >= a[3, 3])
15
15
16
16
--
17
17
18
18
a,
19
19
~~> substitute_value_lettings ([("Base", 5000)])
20
- [[1,2,3;int(1..)],[4,5,6;int(1..)],[7,8,9;int(1..)];int(1..)]
20
+ [[1,2,3;int(1..3 )],[4,5,6;int(1..3 )],[7,8,9;int(1..3 )];int(1..3 )]
21
21
22
22
--
23
23
24
- (Sum([b, -1]) >= [[1,2,3;int(1..)],[4,5,6;int(1..)],[7,8,9;int(1..)];int(1..)][[ 3, 3] ]),
24
+ (Sum([b, -1]) >= [[1,2,3;int(1..3 )],[4,5,6;int(1..3 )],[7,8,9;int(1..3 )];int(1..3 )][3, 3]),
25
25
~~> flatten_generic ([("Minion", 4200)])
26
- (__0 >= [[1,2,3;int(1..)],[4,5,6;int(1..)],[7,8,9;int(1..)];int(1..)][[ 3, 3] ])
26
+ (__0 >= [[1,2,3;int(1..3 )],[4,5,6;int(1..3 )],[7,8,9;int(1..3 )];int(1..3 )][3, 3])
27
27
new variables:
28
28
find __0: int(0..9)
29
29
new constraints:
@@ -36,14 +36,20 @@ and([SumLeq([b, -1], __0),SumGeq([b, -1], __0);int(1..)])
36
36
37
37
--
38
38
39
+ [[1,2,3;int(1..3)],[4,5,6;int(1..3)],[7,8,9;int(1..3)];int(1..3)][3, 3],
40
+ ~~> matrix_to_list ([("Base", 2000)])
41
+ [[1,2,3;int(1..3)],[4,5,6;int(1..3)],[7,8,9;int(1..3)];int(1..)][3, 3]
42
+
43
+ --
44
+
39
45
Final model:
40
46
41
- letting a be [[1,2,3;int(1..)],[4,5,6;int(1..)],[7,8,9;int(1..)];int(1..)]
47
+ letting a be [[1,2,3;int(1..3 )],[4,5,6;int(1..3 )],[7,8,9;int(1..3 )];int(1..3 )]
42
48
find b: int(1..10)
43
49
find __0: int(0..9)
44
50
45
51
such that
46
52
47
- (__0 >= [[1,2,3;int(1..)],[4,5,6;int(1..)],[7,8,9;int(1..)];int(1..)][[ 3, 3] ]),
53
+ (__0 >= [[1,2,3;int(1..3 )],[4,5,6;int(1..3 )],[7,8,9;int(1..3 )];int(1..)][3, 3]),
48
54
and([SumLeq([b, -1], __0),SumGeq([b, -1], __0);int(1..)])
49
55
0 commit comments