eyeprolog 1.6.7 → 1.6.9

package/examples/proof/clpb-boolean-circuit.pl

@@ -10,6 +10,7 @@ clause(1,
 clause(2,
        xor_row(row(var('X'), var('Y'), var('Z'))),
        (xor_circuit(var('X'), var('Y'), var('Z')), labeling([var('X'), var('Y'), var('Z')]))).
+clause(3, xor_circuit_verified(var('T')), taut(x # y =:= x * ~ y + ~ x * y, var('T'))).
 
 step(xor_row(row(0, 0, 0)),
      rule(2),
@@ -39,4 +40,5 @@ step(xor_row(row(1, 0, 1)),
 step(xor_circuit(1, 0, 1), rule(1), ['X' = 1, 'Y' = 0, 'Z' = 1], [sat(1 =:= 1 * ~ 0 + ~ 1 * 0)]).
 step(sat(1 =:= 1 * ~ 0 + ~ 1 * 0), builtin, [], []).
 step(labeling([1, 0, 1]), builtin, [], []).
-step(xor_circuit_verified(1), unproven, [], []).
+step(xor_circuit_verified(1), rule(3), ['T' = 1], [taut(x # y =:= x * ~ y + ~ x * y, 1)]).
+step(taut(x # y =:= x * ~ y + ~ x * y, 1), builtin, [], []).

package/examples/proof/clpb-cardinality.pl

@@ -2,6 +2,42 @@ review_quorum(selection(alice(0), bob(0), carol(1), dan(1))).
 review_quorum(selection(alice(0), bob(1), carol(1), dan(0))).
 review_quorum_count(2).
 
-step(review_quorum(selection(alice(0), bob(0), carol(1), dan(1))), unproven, [], []).
-step(review_quorum(selection(alice(0), bob(1), carol(1), dan(0))), unproven, [], []).
-step(review_quorum_count(2), unproven, [], []).
+clause(1,
+       review_constraints(var('Alice'), var('Bob'), var('Carol'), var('Dan')),
+       sat(card([2], [var('Alice'), var('Bob'), var('Carol'), var('Dan')]) * (var('Alice') =< var('Carol')) * (var('Bob') # var('Dan')))).
+clause(2,
+       review_quorum(selection(alice(var('Alice')), bob(var('Bob')), carol(var('Carol')), dan(var('Dan')))),
+       (review_constraints(var('Alice'), var('Bob'), var('Carol'), var('Dan')),
+        labeling([var('Alice'), var('Bob'), var('Carol'), var('Dan')]))).
+clause(3,
+       review_quorum_count(var('Count')),
+       sat_count(card([2], [var('Alice'), var('Bob'), var('Carol'), var('Dan')]) * (var('Alice') =< var('Carol')) * (var('Bob') # var('Dan')), var('Count'))).
+
+step(review_quorum(selection(alice(0), bob(0), carol(1), dan(1))),
+     rule(2),
+     ['Alice' = 0, 'Bob' = 0, 'Carol' = 1, 'Dan' = 1],
+     [review_constraints(0, 0, 1, 1), labeling([0, 0, 1, 1])]).
+step(review_constraints(0, 0, 1, 1),
+     rule(1),
+     ['Alice' = 0, 'Bob' = 0, 'Carol' = 1, 'Dan' = 1],
+     [sat(card([2], [0, 0, 1, 1]) * (0 =< 1) * (0 # 1))]).
+step(sat(card([2], [0, 0, 1, 1]) * (0 =< 1) * (0 # 1)), builtin, [], []).
+step(labeling([0, 0, 1, 1]), builtin, [], []).
+step(review_quorum(selection(alice(0), bob(1), carol(1), dan(0))),
+     rule(2),
+     ['Alice' = 0, 'Bob' = 1, 'Carol' = 1, 'Dan' = 0],
+     [review_constraints(0, 1, 1, 0), labeling([0, 1, 1, 0])]).
+step(review_constraints(0, 1, 1, 0),
+     rule(1),
+     ['Alice' = 0, 'Bob' = 1, 'Carol' = 1, 'Dan' = 0],
+     [sat(card([2], [0, 1, 1, 0]) * (0 =< 1) * (1 # 0))]).
+step(sat(card([2], [0, 1, 1, 0]) * (0 =< 1) * (1 # 0)), builtin, [], []).
+step(labeling([0, 1, 1, 0]), builtin, [], []).
+step(review_quorum_count(2),
+     rule(3),
+     ['Count' = 2],
+     [sat_count(card([2], [Alice, Bob, Carol, Dan]) * (Alice =< Carol) * (Bob # Dan), 2)]).
+step(sat_count(card([2], [Alice, Bob, Carol, Dan]) * (Alice =< Carol) * (Bob # Dan), 2),
+     builtin,
+     [],
+     []).

package/examples/proof/clpb-feature-model.pl

@@ -11,6 +11,9 @@ clause(2,
        feature_plan(features(cloud(var('Cloud')), edge(var('Edge')), audit(var('Audit')), encryption(var('Encryption')))),
        (feature_constraints(var('Cloud'), var('Edge'), var('Audit'), var('Encryption')),
         labeling([var('Cloud'), var('Edge'), var('Audit'), var('Encryption')]))).
+clause(3,
+       feature_plan_count(var('Count')),
+       sat_count((anonymous(1) # var('Edge')) * (var('Audit') =< anonymous(2)) * (var('Edge') =< var('Audit')), var('Count'))).
 
 step(feature_plan(features(cloud(0), edge(1), audit(1), encryption(1))),
      rule(2),
@@ -52,4 +55,8 @@ step(feature_constraints(1, 0, 1, 1),
      [sat((1 # 0) * (1 =< 1) * (0 =< 1))]).
 step(sat((1 # 0) * (1 =< 1) * (0 =< 1)), builtin, [], []).
 step(labeling([1, 0, 1, 1]), builtin, [], []).
-step(feature_plan_count(4), unproven, [], []).
+step(feature_plan_count(4),
+     rule(3),
+     ['Count' = 4],
+     [sat_count((_Cloud # Edge) * (Audit =< _Encryption) * (Edge =< Audit), 4)]).
+step(sat_count((_Cloud # Edge) * (Audit =< _Encryption) * (Edge =< Audit), 4), builtin, [], []).

package/examples/proof/clpb-weighted-planning.pl

@@ -0,0 +1,3 @@
+best_release_plan(plan(api(1), cache(0), audit(0), search(1)), 13).
+
+step(best_release_plan(plan(api(1), cache(0), audit(0), search(1)), 13), unproven, [], []).

package/examples/proof/clpz-factorial.pl

@@ -0,0 +1,107 @@
+factorial(6, 720).
+
+clause(1, factorial(0, 1), true).
+clause(2,
+       factorial(var('N'), var('F')),
+       ((integer(var('N')) -> var('N') >= 0 + 1 ; var('Var#1') = 1, clpz:clpz_geq(var('N'), var('Var#1'))),
+        (integer(var('Previous')) -> (integer(var('N')) -> var('Previous') =:= var('N') - 1 ; var('T#2') is var('Previous'), clpz:clpz_equal(var('T#2'), var('N') - 1)) ; integer(var('N')) -> (true, var(var('Previous')) -> var('Previous') is var('N') - 1 ; var('T#2') is var('N') - 1, clpz:clpz_equal(var('Previous'), var('T#2'))) ; clpz:clpz_equal(var('Previous'), var('N') - 1)),
+        factorial(var('Previous'), var('PreviousFactorial')),
+        (integer(var('F')) -> (integer(var('N')), integer(var('PreviousFactorial')) -> var('F') =:= var('N') * var('PreviousFactorial') ; var('T#3') is var('F'), clpz:clpz_equal(var('T#3'), var('N') * var('PreviousFactorial'))) ; integer(var('N')), integer(var('PreviousFactorial')) -> (true, var(var('F')) -> var('F') is var('N') * var('PreviousFactorial') ; var('T#3') is var('N') * var('PreviousFactorial'), clpz:clpz_equal(var('F'), var('T#3'))) ; clpz:clpz_equal(var('F'), var('N') * var('PreviousFactorial'))))).
+
+step(factorial(6, 720),
+     rule(2),
+     ['N' = 6, 'F' = 720, 'Previous' = 5, 'PreviousFactorial' = 120],
+     [(integer(6) -> 6 >= 0 + 1 ; Var_1 = 1, clpz:clpz_geq(6, Var_1)),
+      (integer(5) -> (integer(6) -> 5 =:= 6 - 1 ; T_2 is 5, clpz:clpz_equal(T_2, 6 - 1)) ; integer(6) -> (true, var(5) -> 5 is 6 - 1 ; T_2 is 6 - 1, clpz:clpz_equal(5, T_2)) ; clpz:clpz_equal(5, 6 - 1)),
+      factorial(5, 120),
+      (integer(720) -> (integer(6), integer(120) -> 720 =:= 6 * 120 ; T_3 is 720, clpz:clpz_equal(T_3, 6 * 120)) ; integer(6), integer(120) -> (true, var(720) -> 720 is 6 * 120 ; T_3 is 6 * 120, clpz:clpz_equal(720, T_3)) ; clpz:clpz_equal(720, 6 * 120))]).
+step((integer(6) -> 6 >= 0 + 1 ; Var_1 = 1, clpz:clpz_geq(6, Var_1)), builtin, [], []).
+step((integer(5) -> (integer(6) -> 5 =:= 6 - 1 ; T_2 is 5, clpz:clpz_equal(T_2, 6 - 1)) ; integer(6) -> (true, var(5) -> 5 is 6 - 1 ; T_2 is 6 - 1, clpz:clpz_equal(5, T_2)) ; clpz:clpz_equal(5, 6 - 1)),
+     builtin,
+     [],
+     []).
+step(factorial(5, 120),
+     rule(2),
+     ['N' = 5, 'F' = 120, 'Previous' = 4, 'PreviousFactorial' = 24],
+     [(integer(5) -> 5 >= 0 + 1 ; Var_1 = 1, clpz:clpz_geq(5, Var_1)),
+      (integer(4) -> (integer(5) -> 4 =:= 5 - 1 ; T_2 is 4, clpz:clpz_equal(T_2, 5 - 1)) ; integer(5) -> (true, var(4) -> 4 is 5 - 1 ; T_2 is 5 - 1, clpz:clpz_equal(4, T_2)) ; clpz:clpz_equal(4, 5 - 1)),
+      factorial(4, 24),
+      (integer(120) -> (integer(5), integer(24) -> 120 =:= 5 * 24 ; T_3 is 120, clpz:clpz_equal(T_3, 5 * 24)) ; integer(5), integer(24) -> (true, var(120) -> 120 is 5 * 24 ; T_3 is 5 * 24, clpz:clpz_equal(120, T_3)) ; clpz:clpz_equal(120, 5 * 24))]).
+step((integer(5) -> 5 >= 0 + 1 ; Var_1 = 1, clpz:clpz_geq(5, Var_1)), builtin, [], []).
+step((integer(4) -> (integer(5) -> 4 =:= 5 - 1 ; T_2 is 4, clpz:clpz_equal(T_2, 5 - 1)) ; integer(5) -> (true, var(4) -> 4 is 5 - 1 ; T_2 is 5 - 1, clpz:clpz_equal(4, T_2)) ; clpz:clpz_equal(4, 5 - 1)),
+     builtin,
+     [],
+     []).
+step(factorial(4, 24),
+     rule(2),
+     ['N' = 4, 'F' = 24, 'Previous' = 3, 'PreviousFactorial' = 6],
+     [(integer(4) -> 4 >= 0 + 1 ; Var_1 = 1, clpz:clpz_geq(4, Var_1)),
+      (integer(3) -> (integer(4) -> 3 =:= 4 - 1 ; T_2 is 3, clpz:clpz_equal(T_2, 4 - 1)) ; integer(4) -> (true, var(3) -> 3 is 4 - 1 ; T_2 is 4 - 1, clpz:clpz_equal(3, T_2)) ; clpz:clpz_equal(3, 4 - 1)),
+      factorial(3, 6),
+      (integer(24) -> (integer(4), integer(6) -> 24 =:= 4 * 6 ; T_3 is 24, clpz:clpz_equal(T_3, 4 * 6)) ; integer(4), integer(6) -> (true, var(24) -> 24 is 4 * 6 ; T_3 is 4 * 6, clpz:clpz_equal(24, T_3)) ; clpz:clpz_equal(24, 4 * 6))]).
+step((integer(4) -> 4 >= 0 + 1 ; Var_1 = 1, clpz:clpz_geq(4, Var_1)), builtin, [], []).
+step((integer(3) -> (integer(4) -> 3 =:= 4 - 1 ; T_2 is 3, clpz:clpz_equal(T_2, 4 - 1)) ; integer(4) -> (true, var(3) -> 3 is 4 - 1 ; T_2 is 4 - 1, clpz:clpz_equal(3, T_2)) ; clpz:clpz_equal(3, 4 - 1)),
+     builtin,
+     [],
+     []).
+step(factorial(3, 6),
+     rule(2),
+     ['N' = 3, 'F' = 6, 'Previous' = 2, 'PreviousFactorial' = 2],
+     [(integer(3) -> 3 >= 0 + 1 ; Var_1 = 1, clpz:clpz_geq(3, Var_1)),
+      (integer(2) -> (integer(3) -> 2 =:= 3 - 1 ; T_2 is 2, clpz:clpz_equal(T_2, 3 - 1)) ; integer(3) -> (true, var(2) -> 2 is 3 - 1 ; T_2 is 3 - 1, clpz:clpz_equal(2, T_2)) ; clpz:clpz_equal(2, 3 - 1)),
+      factorial(2, 2),
+      (integer(6) -> (integer(3), integer(2) -> 6 =:= 3 * 2 ; T_3 is 6, clpz:clpz_equal(T_3, 3 * 2)) ; integer(3), integer(2) -> (true, var(6) -> 6 is 3 * 2 ; T_3 is 3 * 2, clpz:clpz_equal(6, T_3)) ; clpz:clpz_equal(6, 3 * 2))]).
+step((integer(3) -> 3 >= 0 + 1 ; Var_1 = 1, clpz:clpz_geq(3, Var_1)), builtin, [], []).
+step((integer(2) -> (integer(3) -> 2 =:= 3 - 1 ; T_2 is 2, clpz:clpz_equal(T_2, 3 - 1)) ; integer(3) -> (true, var(2) -> 2 is 3 - 1 ; T_2 is 3 - 1, clpz:clpz_equal(2, T_2)) ; clpz:clpz_equal(2, 3 - 1)),
+     builtin,
+     [],
+     []).
+step(factorial(2, 2),
+     rule(2),
+     ['N' = 2, 'F' = 2, 'Previous' = 1, 'PreviousFactorial' = 1],
+     [(integer(2) -> 2 >= 0 + 1 ; Var_1 = 1, clpz:clpz_geq(2, Var_1)),
+      (integer(1) -> (integer(2) -> 1 =:= 2 - 1 ; T_2 is 1, clpz:clpz_equal(T_2, 2 - 1)) ; integer(2) -> (true, var(1) -> 1 is 2 - 1 ; T_2 is 2 - 1, clpz:clpz_equal(1, T_2)) ; clpz:clpz_equal(1, 2 - 1)),
+      factorial(1, 1),
+      (integer(2) -> (integer(2), integer(1) -> 2 =:= 2 * 1 ; T_3 is 2, clpz:clpz_equal(T_3, 2 * 1)) ; integer(2), integer(1) -> (true, var(2) -> 2 is 2 * 1 ; T_3 is 2 * 1, clpz:clpz_equal(2, T_3)) ; clpz:clpz_equal(2, 2 * 1))]).
+step((integer(2) -> 2 >= 0 + 1 ; Var_1 = 1, clpz:clpz_geq(2, Var_1)), builtin, [], []).
+step((integer(1) -> (integer(2) -> 1 =:= 2 - 1 ; T_2 is 1, clpz:clpz_equal(T_2, 2 - 1)) ; integer(2) -> (true, var(1) -> 1 is 2 - 1 ; T_2 is 2 - 1, clpz:clpz_equal(1, T_2)) ; clpz:clpz_equal(1, 2 - 1)),
+     builtin,
+     [],
+     []).
+step(factorial(1, 1),
+     rule(2),
+     ['N' = 1, 'F' = 1, 'Previous' = 0, 'PreviousFactorial' = 1],
+     [(integer(1) -> 1 >= 0 + 1 ; Var_1 = 1, clpz:clpz_geq(1, Var_1)),
+      (integer(0) -> (integer(1) -> 0 =:= 1 - 1 ; T_2 is 0, clpz:clpz_equal(T_2, 1 - 1)) ; integer(1) -> (true, var(0) -> 0 is 1 - 1 ; T_2 is 1 - 1, clpz:clpz_equal(0, T_2)) ; clpz:clpz_equal(0, 1 - 1)),
+      factorial(0, 1),
+      (integer(1) -> (integer(1), integer(1) -> 1 =:= 1 * 1 ; T_3 is 1, clpz:clpz_equal(T_3, 1 * 1)) ; integer(1), integer(1) -> (true, var(1) -> 1 is 1 * 1 ; T_3 is 1 * 1, clpz:clpz_equal(1, T_3)) ; clpz:clpz_equal(1, 1 * 1))]).
+step((integer(1) -> 1 >= 0 + 1 ; Var_1 = 1, clpz:clpz_geq(1, Var_1)), builtin, [], []).
+step((integer(0) -> (integer(1) -> 0 =:= 1 - 1 ; T_2 is 0, clpz:clpz_equal(T_2, 1 - 1)) ; integer(1) -> (true, var(0) -> 0 is 1 - 1 ; T_2 is 1 - 1, clpz:clpz_equal(0, T_2)) ; clpz:clpz_equal(0, 1 - 1)),
+     builtin,
+     [],
+     []).
+step(factorial(0, 1), fact(1), [], []).
+step((integer(1) -> (integer(1), integer(1) -> 1 =:= 1 * 1 ; T_3 is 1, clpz:clpz_equal(T_3, 1 * 1)) ; integer(1), integer(1) -> (true, var(1) -> 1 is 1 * 1 ; T_3 is 1 * 1, clpz:clpz_equal(1, T_3)) ; clpz:clpz_equal(1, 1 * 1)),
+     builtin,
+     [],
+     []).
+step((integer(2) -> (integer(2), integer(1) -> 2 =:= 2 * 1 ; T_3 is 2, clpz:clpz_equal(T_3, 2 * 1)) ; integer(2), integer(1) -> (true, var(2) -> 2 is 2 * 1 ; T_3 is 2 * 1, clpz:clpz_equal(2, T_3)) ; clpz:clpz_equal(2, 2 * 1)),
+     builtin,
+     [],
+     []).
+step((integer(6) -> (integer(3), integer(2) -> 6 =:= 3 * 2 ; T_3 is 6, clpz:clpz_equal(T_3, 3 * 2)) ; integer(3), integer(2) -> (true, var(6) -> 6 is 3 * 2 ; T_3 is 3 * 2, clpz:clpz_equal(6, T_3)) ; clpz:clpz_equal(6, 3 * 2)),
+     builtin,
+     [],
+     []).
+step((integer(24) -> (integer(4), integer(6) -> 24 =:= 4 * 6 ; T_3 is 24, clpz:clpz_equal(T_3, 4 * 6)) ; integer(4), integer(6) -> (true, var(24) -> 24 is 4 * 6 ; T_3 is 4 * 6, clpz:clpz_equal(24, T_3)) ; clpz:clpz_equal(24, 4 * 6)),
+     builtin,
+     [],
+     []).
+step((integer(120) -> (integer(5), integer(24) -> 120 =:= 5 * 24 ; T_3 is 120, clpz:clpz_equal(T_3, 5 * 24)) ; integer(5), integer(24) -> (true, var(120) -> 120 is 5 * 24 ; T_3 is 5 * 24, clpz:clpz_equal(120, T_3)) ; clpz:clpz_equal(120, 5 * 24)),
+     builtin,
+     [],
+     []).
+step((integer(720) -> (integer(6), integer(120) -> 720 =:= 6 * 120 ; T_3 is 720, clpz:clpz_equal(T_3, 6 * 120)) ; integer(6), integer(120) -> (true, var(720) -> 720 is 6 * 120 ; T_3 is 6 * 120, clpz:clpz_equal(720, T_3)) ; clpz:clpz_equal(720, 6 * 120)),
+     builtin,
+     [],
+     []).

package/examples/proof/clpz-global-constraints.pl

@@ -0,0 +1,139 @@
+advanced_clpz(table, compatible(4, 0, 2)).
+advanced_clpz(table, compatible(4, 3, 2)).
+advanced_clpz(schedule, starts([0, 1, 3])).
+advanced_clpz(cardinality, assignment([1, 1, 3], 13, >)).
+advanced_clpz(cardinality, assignment([1, 3, 1], 12, >)).
+advanced_clpz(cardinality, assignment([3, 1, 1], 6, <)).
+advanced_clpz(circuit, successors([2, 3, 4, 1])).
+
+clause(1,
+       advanced_clpz(table, compatible(4, var('Y'), var('Distinct'))),
+       (tuples_in([[var('X'), var('Y')]], [[1, 2], [1, 5], [4, 0], [4, 3]]),
+        var('X') = 4,
+        nvalue(var('Distinct'), [var('X'), var('Y')]),
+        labeling([], [var('Y')]))).
+clause(2,
+       advanced_clpz(schedule, starts([var('A'), var('B'), var('C')])),
+       ([var('A'), var('B'), var('C')] ins 0..3,
+        lex_chain([[var('A'), var('B')], [var('B'), var('C')]]),
+        serialized([var('A'), var('B'), var('C')], [1, 2, 1]),
+        (integer(var('B')) -> (integer(var('A')) -> var('B') >= var('A') + 1 ; var('T#1') is var('B'), clpz:clpz_geq(var('T#1'), var('A') + 1)) ; integer(var('A')) -> var('T#1') is var('A') + 1, clpz:clpz_geq(var('B'), var('T#1')) ; clpz:clpz_geq(var('B'), var('A') + 1)),
+        (integer(var('C')) -> (integer(var('B')) -> var('C') >= var('B') + 1 ; var('T#2') is var('C'), clpz:clpz_geq(var('T#2'), var('B') + 1)) ; integer(var('B')) -> var('T#2') is var('B') + 1, clpz:clpz_geq(var('C'), var('T#2')) ; clpz:clpz_geq(var('C'), var('B') + 1)),
+        labeling([ff], [var('A'), var('B'), var('C')]))).
+clause(3,
+       advanced_clpz(cardinality, assignment(var('Values'), var('Cost'), var('Order'))),
+       (var('Values') = [anonymous(1), anonymous(2), anonymous(3)],
+        global_cardinality(var('Values'), [1 - 2, 3 - 1], [cost(var('Cost'), [[5, 1], [2, 4], [3, 6]])]),
+        labeling([ff], var('Values')),
+        zcompare(var('Order'), var('Cost'), 10))).
+clause(4,
+       advanced_clpz(circuit, successors(var('Values'))),
+       (var('Values') = [var('A'), var('B'), anonymous(1), anonymous(2)],
+        circuit(var('Values')),
+        (integer(var('A')) -> var('A') =:= 2 ; true, var(var('A')) -> var('A') = 2 ; var('Var#3') = 2, clpz:clpz_equal(var('A'), var('Var#3'))),
+        (integer(var('B')) -> var('B') =:= 3 ; true, var(var('B')) -> var('B') = 3 ; var('Var#4') = 3, clpz:clpz_equal(var('B'), var('Var#4'))),
+        labeling([ff], var('Values')))).
+
+step(advanced_clpz(table, compatible(4, 0, 2)),
+     rule(1),
+     ['Y' = 0, 'Distinct' = 2, 'X' = 4],
+     [tuples_in([[4, 0]], [[1, 2], [1, 5], [4, 0], [4, 3]]),
+      4 = 4,
+      nvalue(2, [4, 0]),
+      labeling([], [0])]).
+step(tuples_in([[4, 0]], [[1, 2], [1, 5], [4, 0], [4, 3]]), builtin, [], []).
+step(4 = 4, builtin, [], []).
+step(nvalue(2, [4, 0]), builtin, [], []).
+step(labeling([], [0]), builtin, [], []).
+step(advanced_clpz(table, compatible(4, 3, 2)),
+     rule(1),
+     ['Y' = 3, 'Distinct' = 2, 'X' = 4],
+     [tuples_in([[4, 3]], [[1, 2], [1, 5], [4, 0], [4, 3]]),
+      4 = 4,
+      nvalue(2, [4, 3]),
+      labeling([], [3])]).
+step(tuples_in([[4, 3]], [[1, 2], [1, 5], [4, 0], [4, 3]]), builtin, [], []).
+step(nvalue(2, [4, 3]), builtin, [], []).
+step(labeling([], [3]), builtin, [], []).
+step(advanced_clpz(schedule, starts([0, 1, 3])),
+     rule(2),
+     ['A' = 0, 'B' = 1, 'C' = 3],
+     [[0, 1, 3] ins 0..3,
+      lex_chain([[0, 1], [1, 3]]),
+      serialized([0, 1, 3], [1, 2, 1]),
+      (integer(1) -> (integer(0) -> 1 >= 0 + 1 ; T_1 is 1, clpz:clpz_geq(T_1, 0 + 1)) ; integer(0) -> T_1 is 0 + 1, clpz:clpz_geq(1, T_1) ; clpz:clpz_geq(1, 0 + 1)),
+      (integer(3) -> (integer(1) -> 3 >= 1 + 1 ; T_2 is 3, clpz:clpz_geq(T_2, 1 + 1)) ; integer(1) -> T_2 is 1 + 1, clpz:clpz_geq(3, T_2) ; clpz:clpz_geq(3, 1 + 1)),
+      labeling([ff], [0, 1, 3])]).
+step([0, 1, 3] ins 0..3, builtin, [], []).
+step(lex_chain([[0, 1], [1, 3]]), builtin, [], []).
+step(serialized([0, 1, 3], [1, 2, 1]), builtin, [], []).
+step((integer(1) -> (integer(0) -> 1 >= 0 + 1 ; T_1 is 1, clpz:clpz_geq(T_1, 0 + 1)) ; integer(0) -> T_1 is 0 + 1, clpz:clpz_geq(1, T_1) ; clpz:clpz_geq(1, 0 + 1)),
+     builtin,
+     [],
+     []).
+step((integer(3) -> (integer(1) -> 3 >= 1 + 1 ; T_2 is 3, clpz:clpz_geq(T_2, 1 + 1)) ; integer(1) -> T_2 is 1 + 1, clpz:clpz_geq(3, T_2) ; clpz:clpz_geq(3, 1 + 1)),
+     builtin,
+     [],
+     []).
+step(labeling([ff], [0, 1, 3]), builtin, [], []).
+step(advanced_clpz(cardinality, assignment([1, 1, 3], 13, >)),
+     rule(3),
+     ['Values' = [1, 1, 3], 'Cost' = 13, 'Order' = (>)],
+     [[1, 1, 3] = [1, 1, 3],
+      global_cardinality([1, 1, 3], [1 - 2, 3 - 1], [cost(13, [[5, 1], [2, 4], [3, 6]])]),
+      labeling([ff], [1, 1, 3]),
+      zcompare(>, 13, 10)]).
+step([1, 1, 3] = [1, 1, 3], builtin, [], []).
+step(global_cardinality([1, 1, 3], [1 - 2, 3 - 1], [cost(13, [[5, 1], [2, 4], [3, 6]])]),
+     builtin,
+     [],
+     []).
+step(labeling([ff], [1, 1, 3]), builtin, [], []).
+step(zcompare(>, 13, 10), builtin, [], []).
+step(advanced_clpz(cardinality, assignment([1, 3, 1], 12, >)),
+     rule(3),
+     ['Values' = [1, 3, 1], 'Cost' = 12, 'Order' = (>)],
+     [[1, 3, 1] = [1, 3, 1],
+      global_cardinality([1, 3, 1], [1 - 2, 3 - 1], [cost(12, [[5, 1], [2, 4], [3, 6]])]),
+      labeling([ff], [1, 3, 1]),
+      zcompare(>, 12, 10)]).
+step([1, 3, 1] = [1, 3, 1], builtin, [], []).
+step(global_cardinality([1, 3, 1], [1 - 2, 3 - 1], [cost(12, [[5, 1], [2, 4], [3, 6]])]),
+     builtin,
+     [],
+     []).
+step(labeling([ff], [1, 3, 1]), builtin, [], []).
+step(zcompare(>, 12, 10), builtin, [], []).
+step(advanced_clpz(cardinality, assignment([3, 1, 1], 6, <)),
+     rule(3),
+     ['Values' = [3, 1, 1], 'Cost' = 6, 'Order' = (<)],
+     [[3, 1, 1] = [3, 1, 1],
+      global_cardinality([3, 1, 1], [1 - 2, 3 - 1], [cost(6, [[5, 1], [2, 4], [3, 6]])]),
+      labeling([ff], [3, 1, 1]),
+      zcompare(<, 6, 10)]).
+step([3, 1, 1] = [3, 1, 1], builtin, [], []).
+step(global_cardinality([3, 1, 1], [1 - 2, 3 - 1], [cost(6, [[5, 1], [2, 4], [3, 6]])]),
+     builtin,
+     [],
+     []).
+step(labeling([ff], [3, 1, 1]), builtin, [], []).
+step(zcompare(<, 6, 10), builtin, [], []).
+step(advanced_clpz(circuit, successors([2, 3, 4, 1])),
+     rule(4),
+     ['Values' = [2, 3, 4, 1], 'A' = 2, 'B' = 3],
+     [[2, 3, 4, 1] = [2, 3, 4, 1],
+      circuit([2, 3, 4, 1]),
+      (integer(2) -> 2 =:= 2 ; true, var(2) -> 2 = 2 ; Var_3 = 2, clpz:clpz_equal(2, Var_3)),
+      (integer(3) -> 3 =:= 3 ; true, var(3) -> 3 = 3 ; Var_4 = 3, clpz:clpz_equal(3, Var_4)),
+      labeling([ff], [2, 3, 4, 1])]).
+step([2, 3, 4, 1] = [2, 3, 4, 1], builtin, [], []).
+step(circuit([2, 3, 4, 1]), builtin, [], []).
+step((integer(2) -> 2 =:= 2 ; true, var(2) -> 2 = 2 ; Var_3 = 2, clpz:clpz_equal(2, Var_3)),
+     builtin,
+     [],
+     []).
+step((integer(3) -> 3 =:= 3 ; true, var(3) -> 3 = 3 ; Var_4 = 3, clpz:clpz_equal(3, Var_4)),
+     builtin,
+     [],
+     []).
+step(labeling([ff], [2, 3, 4, 1]), builtin, [], []).