eyeprolog 1.6.19 → 1.6.21

package/examples/check/knuth-bendix-completion.pl

@@ -3,8 +3,11 @@ condition('C2', well_founded, ok, 52).
 condition('C3', justification, ok, 52).
 condition('C4', coverage, ok, 57).
 condition('C5', re_decision, ok, 0).
-obligation(absent, theory_scoped, 3).
-obligation(builtin, theory_scoped, 2).
+obligation(absent, theory_scoped, \+ rewrite_once(append(a, append(b, c)), __anon0, __anon1)).
+obligation(absent, theory_scoped, \+ rewrite_once(append(a, b), __anon0, __anon1)).
+obligation(absent, theory_scoped, \+ rewrite_once(append(a, append(b, append(c, d))), __anon0, __anon1)).
+obligation(builtin, theory_scoped, countall(oriented_rule(__anon3, __anon4, __anon5), 3)).
+obligation(builtin, theory_scoped, countall(joined_pair(__anon6), 3)).
 steps(52).
 verified(47).
 recomputed(0).

package/examples/check/lee.pl

@@ -3,7 +3,21 @@ condition('C2', well_founded, ok, 119).
 condition('C3', justification, ok, 119).
 condition('C4', coverage, ok, 142).
 condition('C5', re_decision, ok, 33).
-obligation(builtin, theory_scoped, 15).
+obligation(builtin, theory_scoped, setof(X, admissible(X, [[1, 1]], [], [[[2, 3], [4, 5]], [[6, 6], [8, 8]]]), [[0, 1], [1, 0], [1, 2], [2, 1]])).
+obligation(builtin, theory_scoped, setof(X, admissible(X, [[0, 1], [1, 0], [1, 2], [2, 1]], [[1, 1]], [[[2, 3], [4, 5]], [[6, 6], [8, 8]]]), [[0, 0], [0, 2], [1, 3], [2, 0], [2, 2], [3, 1]])).
+obligation(builtin, theory_scoped, setof(X, admissible(X, [[0, 0], [0, 2], [1, 3], [2, 0], [2, 2], [3, 1]], [[0, 1], [1, 0], [1, 2], [2, 1]], [[[2, 3], [4, 5]], [[6, 6], [8, 8]]]), [[0, 3], [1, 4], [3, 0], [3, 2], [4, 1]])).
+obligation(builtin, theory_scoped, setof(X, admissible(X, [[0, 3], [1, 4], [3, 0], [3, 2], [4, 1]], [[0, 0], [0, 2], [1, 3], [2, 0], [2, 2], [3, 1]], [[[2, 3], [4, 5]], [[6, 6], [8, 8]]]), [[0, 4], [1, 5], [4, 0], [4, 2], [5, 1]])).
+obligation(builtin, theory_scoped, setof(X, admissible(X, [[0, 4], [1, 5], [4, 0], [4, 2], [5, 1]], [[0, 3], [1, 4], [3, 0], [3, 2], [4, 1]], [[[2, 3], [4, 5]], [[6, 6], [8, 8]]]), [[0, 5], [1, 6], [5, 0], [5, 2], [6, 1]])).
+obligation(builtin, theory_scoped, setof(X, admissible(X, [[0, 5], [1, 6], [5, 0], [5, 2], [6, 1]], [[0, 4], [1, 5], [4, 0], [4, 2], [5, 1]], [[[2, 3], [4, 5]], [[6, 6], [8, 8]]]), [[0, 6], [1, 7], [2, 6], [5, 3], [6, 0], [6, 2], [7, 1]])).
+obligation(builtin, theory_scoped, setof(X, admissible(X, [[0, 6], [1, 7], [2, 6], [5, 3], [6, 0], [6, 2], [7, 1]], [[0, 5], [1, 6], [5, 0], [5, 2], [6, 1]], [[[2, 3], [4, 5]], [[6, 6], [8, 8]]]), [[0, 7], [1, 8], [2, 7], [3, 6], [5, 4], [6, 3], [7, 0], [7, 2], [8, 1]])).
+obligation(builtin, theory_scoped, setof(X, admissible(X, [[0, 7], [1, 8], [2, 7], [3, 6], [5, 4], [6, 3], [7, 0], [7, 2], [8, 1]], [[0, 6], [1, 7], [2, 6], [5, 3], [6, 0], [6, 2], [7, 1]], [[[2, 3], [4, 5]], [[6, 6], [8, 8]]]), [[0, 8], [1, 9], [2, 8], [3, 7], [4, 6], [5, 5], [6, 4], [7, 3], [8, 0], [8, 2], [9, 1]])).
+obligation(builtin, theory_scoped, setof(X, admissible(X, [[0, 8], [1, 9], [2, 8], [3, 7], [4, 6], [5, 5], [6, 4], [7, 3], [8, 0], [8, 2], [9, 1]], [[0, 7], [1, 8], [2, 7], [3, 6], [5, 4], [6, 3], [7, 0], [7, 2], [8, 1]], [[[2, 3], [4, 5]], [[6, 6], [8, 8]]]), [[0, 9], [1, 10], [2, 9], [3, 8], [4, 7], [5, 6], [6, 5], [7, 4], [8, 3], [9, 0], [9, 2], [10, 1]])).
+obligation(builtin, theory_scoped, setof(X, admissible(X, [[0, 9], [1, 10], [2, 9], [3, 8], [4, 7], [5, 6], [6, 5], [7, 4], [8, 3], [9, 0], [9, 2], [10, 1]], [[0, 8], [1, 9], [2, 8], [3, 7], [4, 6], [5, 5], [6, 4], [7, 3], [8, 0], [8, 2], [9, 1]], [[[2, 3], [4, 5]], [[6, 6], [8, 8]]]), [[0, 10], [1, 11], [2, 10], [3, 9], [4, 8], [5, 7], [7, 5], [8, 4], [9, 3], [10, 0], [10, 2], [11, 1]])).
+obligation(builtin, theory_scoped, setof(X, admissible(X, [[0, 10], [1, 11], [2, 10], [3, 9], [4, 8], [5, 7], [7, 5], [8, 4], [9, 3], [10, 0], [10, 2], [11, 1]], [[0, 9], [1, 10], [2, 9], [3, 8], [4, 7], [5, 6], [6, 5], [7, 4], [8, 3], [9, 0], [9, 2], [10, 1]], [[[2, 3], [4, 5]], [[6, 6], [8, 8]]]), [[0, 11], [1, 12], [2, 11], [3, 10], [4, 9], [5, 8], [8, 5], [9, 4], [10, 3], [11, 0], [11, 2], [12, 1]])).
+obligation(builtin, theory_scoped, setof(X, admissible(X, [[0, 11], [1, 12], [2, 11], [3, 10], [4, 9], [5, 8], [8, 5], [9, 4], [10, 3], [11, 0], [11, 2], [12, 1]], [[0, 10], [1, 11], [2, 10], [3, 9], [4, 8], [5, 7], [7, 5], [8, 4], [9, 3], [10, 0], [10, 2], [11, 1]], [[[2, 3], [4, 5]], [[6, 6], [8, 8]]]), [[0, 12], [1, 13], [2, 12], [3, 11], [4, 10], [5, 9], [9, 5], [10, 4], [11, 3], [12, 0], [12, 2], [13, 1]])).
+obligation(builtin, theory_scoped, setof(X, admissible(X, [[0, 12], [1, 13], [2, 12], [3, 11], [4, 10], [5, 9], [9, 5], [10, 4], [11, 3], [12, 0], [12, 2], [13, 1]], [[0, 11], [1, 12], [2, 11], [3, 10], [4, 9], [5, 8], [8, 5], [9, 4], [10, 3], [11, 0], [11, 2], [12, 1]], [[[2, 3], [4, 5]], [[6, 6], [8, 8]]]), [[0, 13], [1, 14], [2, 13], [3, 12], [4, 11], [5, 10], [6, 9], [9, 6], [10, 5], [11, 4], [12, 3], [13, 0], [13, 2], [14, 1]])).
+obligation(builtin, theory_scoped, setof(X, admissible(X, [[0, 13], [1, 14], [2, 13], [3, 12], [4, 11], [5, 10], [6, 9], [9, 6], [10, 5], [11, 4], [12, 3], [13, 0], [13, 2], [14, 1]], [[0, 12], [1, 13], [2, 12], [3, 11], [4, 10], [5, 9], [9, 5], [10, 4], [11, 3], [12, 0], [12, 2], [13, 1]], [[[2, 3], [4, 5]], [[6, 6], [8, 8]]]), [[0, 14], [1, 15], [2, 14], [3, 13], [4, 12], [5, 11], [6, 10], [7, 9], [9, 7], [10, 6], [11, 5], [12, 4], [13, 3], [14, 0], [14, 2], [15, 1]])).
+obligation(builtin, theory_scoped, setof(X, admissible(X, [[0, 14], [1, 15], [2, 14], [3, 13], [4, 12], [5, 11], [6, 10], [7, 9], [9, 7], [10, 6], [11, 5], [12, 4], [13, 3], [14, 0], [14, 2], [15, 1]], [[0, 13], [1, 14], [2, 13], [3, 12], [4, 11], [5, 10], [6, 9], [9, 6], [10, 5], [11, 4], [12, 3], [13, 0], [13, 2], [14, 1]], [[[2, 3], [4, 5]], [[6, 6], [8, 8]]]), [[0, 15], [1, 16], [2, 15], [3, 14], [4, 13], [5, 12], [6, 11], [7, 10], [8, 9], [9, 8], [10, 7], [11, 6], [12, 5], [13, 4], [14, 3], [15, 0], [15, 2], [16, 1]])).
 steps(119).
 verified(71).
 recomputed(33).

package/examples/check/linear-logic-resources.pl

@@ -3,7 +3,7 @@ condition('C2', well_founded, ok, 38).
 condition('C3', justification, ok, 38).
 condition('C4', coverage, ok, 38).
 condition('C5', re_decision, ok, 15).
-obligation(absent, theory_scoped, 1).
+obligation(absent, theory_scoped, \+ run_linear(2, [coin], [buy_flour, buy_yeast], _finalstate)).
 steps(38).
 verified(22).
 recomputed(15).

package/examples/check/map-four-color-search.pl

@@ -3,7 +3,33 @@ condition('C2', well_founded, ok, 144).
 condition('C3', justification, ok, 144).
 condition('C4', coverage, ok, 167).
 condition('C5', re_decision, ok, 1).
-obligation(absent, theory_scoped, 27).
+obligation(absent, theory_scoped, \+ (member([Neighbor, red], []), member(Neighbor, [slovenia, hungary]))).
+obligation(absent, theory_scoped, \+ (member([Neighbor, red], [[croatia, red]]), member(Neighbor, [hungary, bulgaria]))).
+obligation(absent, theory_scoped, \+ (member([Neighbor, green], [[romania, red], [croatia, red]]), member(Neighbor, [romania, greece]))).
+obligation(absent, theory_scoped, \+ (member([Neighbor, red], [[bulgaria, green], [romania, red], [croatia, red]]), member(Neighbor, [latvia, poland]))).
+obligation(absent, theory_scoped, \+ (member([Neighbor, green], [[lithuania, red], [bulgaria, green], [romania, red], [croatia, red]]), member(Neighbor, [estonia, lithuania]))).
+obligation(absent, theory_scoped, \+ (member([Neighbor, red], [[latvia, green], [lithuania, red], [bulgaria, green], [romania, red], [croatia, red]]), member(Neighbor, [latvia]))).
+obligation(absent, theory_scoped, \+ (member([Neighbor, green], [[estonia, red], [latvia, green], [lithuania, red], [bulgaria, green], [romania, red], [croatia, red]]), member(Neighbor, [austria, italy, hungary, croatia]))).
+obligation(absent, theory_scoped, \+ (member([Neighbor, red], [[slovenia, green], [estonia, red], [latvia, green], [lithuania, red], [bulgaria, green], [romania, red], [croatia, red]]), member(Neighbor, [czech_republic, poland, hungary, austria]))).
+obligation(absent, theory_scoped, \+ (member([Neighbor, green], [[slovakia, red], [slovenia, green], [estonia, red], [latvia, green], [lithuania, red], [bulgaria, green], [romania, red], [croatia, red]]), member(Neighbor, [germany, poland, slovakia, austria]))).
+obligation(absent, theory_scoped, \+ (member([Neighbor, blue], [[czech_republic, green], [slovakia, red], [slovenia, green], [estonia, red], [latvia, green], [lithuania, red], [bulgaria, green], [romania, red], [croatia, red]]), member(Neighbor, [austria, slovakia, romania, croatia, slovenia]))).
+obligation(absent, theory_scoped, \+ (member([Neighbor, blue], [[hungary, blue], [czech_republic, green], [slovakia, red], [slovenia, green], [estonia, red], [latvia, green], [lithuania, red], [bulgaria, green], [romania, red], [croatia, red]]), member(Neighbor, [germany, czech_republic, slovakia, lithuania]))).
+obligation(absent, theory_scoped, \+ (member([Neighbor, red], [[poland, blue], [hungary, blue], [czech_republic, green], [slovakia, red], [slovenia, green], [estonia, red], [latvia, green], [lithuania, red], [bulgaria, green], [romania, red], [croatia, red]]), member(Neighbor, []))).
+obligation(absent, theory_scoped, \+ (member([Neighbor, red], [[malta, red], [poland, blue], [hungary, blue], [czech_republic, green], [slovakia, red], [slovenia, green], [estonia, red], [latvia, green], [lithuania, red], [bulgaria, green], [romania, red], [croatia, red]]), member(Neighbor, []))).
+obligation(absent, theory_scoped, \+ (member([Neighbor, red], [[cyprus, red], [malta, red], [poland, blue], [hungary, blue], [czech_republic, green], [slovakia, red], [slovenia, green], [estonia, red], [latvia, green], [lithuania, red], [bulgaria, green], [romania, red], [croatia, red]]), member(Neighbor, [sweden]))).
+obligation(absent, theory_scoped, \+ (member([Neighbor, green], [[finland, red], [cyprus, red], [malta, red], [poland, blue], [hungary, blue], [czech_republic, green], [slovakia, red], [slovenia, green], [estonia, red], [latvia, green], [lithuania, red], [bulgaria, green], [romania, red], [croatia, red]]), member(Neighbor, [finland]))).
+obligation(absent, theory_scoped, \+ (member([Neighbor, yellow], [[sweden, green], [finland, red], [cyprus, red], [malta, red], [poland, blue], [hungary, blue], [czech_republic, green], [slovakia, red], [slovenia, green], [estonia, red], [latvia, green], [lithuania, red], [bulgaria, green], [romania, red], [croatia, red]]), member(Neighbor, [czech_republic, germany, hungary, italy, slovenia, slovakia]))).
+obligation(absent, theory_scoped, \+ (member([Neighbor, red], [[austria, yellow], [sweden, green], [finland, red], [cyprus, red], [malta, red], [poland, blue], [hungary, blue], [czech_republic, green], [slovakia, red], [slovenia, green], [estonia, red], [latvia, green], [lithuania, red], [bulgaria, green], [romania, red], [croatia, red]]), member(Neighbor, [spain]))).
+obligation(absent, theory_scoped, \+ (member([Neighbor, green], [[portugal, red], [austria, yellow], [sweden, green], [finland, red], [cyprus, red], [malta, red], [poland, blue], [hungary, blue], [czech_republic, green], [slovakia, red], [slovenia, green], [estonia, red], [latvia, green], [lithuania, red], [bulgaria, green], [romania, red], [croatia, red]]), member(Neighbor, [france, portugal]))).
+obligation(absent, theory_scoped, \+ (member([Neighbor, red], [[spain, green], [portugal, red], [austria, yellow], [sweden, green], [finland, red], [cyprus, red], [malta, red], [poland, blue], [hungary, blue], [czech_republic, green], [slovakia, red], [slovenia, green], [estonia, red], [latvia, green], [lithuania, red], [bulgaria, green], [romania, red], [croatia, red]]), member(Neighbor, [bulgaria]))).
+obligation(absent, theory_scoped, \+ (member([Neighbor, red], [[greece, red], [spain, green], [portugal, red], [austria, yellow], [sweden, green], [finland, red], [cyprus, red], [malta, red], [poland, blue], [hungary, blue], [czech_republic, green], [slovakia, red], [slovenia, green], [estonia, red], [latvia, green], [lithuania, red], [bulgaria, green], [romania, red], [croatia, red]]), member(Neighbor, []))).
+obligation(absent, theory_scoped, \+ (member([Neighbor, green], [[ireland, red], [greece, red], [spain, green], [portugal, red], [austria, yellow], [sweden, green], [finland, red], [cyprus, red], [malta, red], [poland, blue], [hungary, blue], [czech_republic, green], [slovakia, red], [slovenia, green], [estonia, red], [latvia, green], [lithuania, red], [bulgaria, green], [romania, red], [croatia, red]]), member(Neighbor, [germany]))).
+obligation(absent, theory_scoped, \+ (member([Neighbor, red], [[denmark, green], [ireland, red], [greece, red], [spain, green], [portugal, red], [austria, yellow], [sweden, green], [finland, red], [cyprus, red], [malta, red], [poland, blue], [hungary, blue], [czech_republic, green], [slovakia, red], [slovenia, green], [estonia, red], [latvia, green], [lithuania, red], [bulgaria, green], [romania, red], [croatia, red]]), member(Neighbor, [france, austria, slovenia]))).
+obligation(absent, theory_scoped, \+ (member([Neighbor, red], [[italy, red], [denmark, green], [ireland, red], [greece, red], [spain, green], [portugal, red], [austria, yellow], [sweden, green], [finland, red], [cyprus, red], [malta, red], [poland, blue], [hungary, blue], [czech_republic, green], [slovakia, red], [slovenia, green], [estonia, red], [latvia, green], [lithuania, red], [bulgaria, green], [romania, red], [croatia, red]]), member(Neighbor, [netherlands, belgium, luxemburg, denmark, france, austria, poland, czech_republic]))).
+obligation(absent, theory_scoped, \+ (member([Neighbor, blue], [[germany, red], [italy, red], [denmark, green], [ireland, red], [greece, red], [spain, green], [portugal, red], [austria, yellow], [sweden, green], [finland, red], [cyprus, red], [malta, red], [poland, blue], [hungary, blue], [czech_republic, green], [slovakia, red], [slovenia, green], [estonia, red], [latvia, green], [lithuania, red], [bulgaria, green], [romania, red], [croatia, red]]), member(Neighbor, [spain, belgium, luxemburg, germany, italy]))).
+obligation(absent, theory_scoped, \+ (member([Neighbor, green], [[france, blue], [germany, red], [italy, red], [denmark, green], [ireland, red], [greece, red], [spain, green], [portugal, red], [austria, yellow], [sweden, green], [finland, red], [cyprus, red], [malta, red], [poland, blue], [hungary, blue], [czech_republic, green], [slovakia, red], [slovenia, green], [estonia, red], [latvia, green], [lithuania, red], [bulgaria, green], [romania, red], [croatia, red]]), member(Neighbor, [belgium, france, germany]))).
+obligation(absent, theory_scoped, \+ (member([Neighbor, green], [[luxemburg, green], [france, blue], [germany, red], [italy, red], [denmark, green], [ireland, red], [greece, red], [spain, green], [portugal, red], [austria, yellow], [sweden, green], [finland, red], [cyprus, red], [malta, red], [poland, blue], [hungary, blue], [czech_republic, green], [slovakia, red], [slovenia, green], [estonia, red], [latvia, green], [lithuania, red], [bulgaria, green], [romania, red], [croatia, red]]), member(Neighbor, [belgium, germany]))).
+obligation(absent, theory_scoped, \+ (member([Neighbor, yellow], [[netherlands, green], [luxemburg, green], [france, blue], [germany, red], [italy, red], [denmark, green], [ireland, red], [greece, red], [spain, green], [portugal, red], [austria, yellow], [sweden, green], [finland, red], [cyprus, red], [malta, red], [poland, blue], [hungary, blue], [czech_republic, green], [slovakia, red], [slovenia, green], [estonia, red], [latvia, green], [lithuania, red], [bulgaria, green], [romania, red], [croatia, red]]), member(Neighbor, [france, netherlands, luxemburg, germany]))).
 steps(144).
 verified(116).
 recomputed(0).

package/examples/check/markov-logic-network.pl

@@ -3,8 +3,16 @@ condition('C2', well_founded, ok, 80).
 condition('C3', justification, ok, 80).
 condition('C4', coverage, ok, 121).
 condition('C5', re_decision, ok, 0).
-obligation(absent, theory_scoped, 5).
-obligation(builtin, theory_scoped, 5).
+obligation(absent, theory_scoped, \+ formula_satisfied(w_bob_not_smokes_not_cancer, friend_smoking)).
+obligation(absent, theory_scoped, \+ formula_satisfied(w_bob_not_smokes_cancer, friend_smoking)).
+obligation(absent, theory_scoped, \+ formula_satisfied(w_bob_not_smokes_cancer, cancer_is_rare)).
+obligation(absent, theory_scoped, \+ formula_satisfied(w_bob_smokes_not_cancer, smoking_causes_cancer)).
+obligation(absent, theory_scoped, \+ formula_satisfied(w_bob_smokes_cancer, cancer_is_rare)).
+obligation(builtin, theory_scoped, sumall(Expression, contribution_tenths(w_bob_not_smokes_not_cancer, _Formula, Expression), 19)).
+obligation(builtin, theory_scoped, sumall(Expression, contribution_tenths(w_bob_not_smokes_cancer, _Formula, Expression), 13)).
+obligation(builtin, theory_scoped, sumall(Expression, contribution_tenths(w_bob_smokes_not_cancer, _Formula, Expression), 26)).
+obligation(builtin, theory_scoped, sumall(Expression, contribution_tenths(w_bob_smokes_cancer, _Formula, Expression), 33)).
+obligation(builtin, theory_scoped, aggregate_max(Key, Value, world_score_tenths(Value, Key), 33, w_bob_smokes_cancer)).
 steps(80).
 verified(70).
 recomputed(0).

package/examples/check/matrix-chain-order.pl

@@ -3,7 +3,13 @@ condition('C2', well_founded, ok, 38).
 condition('C3', justification, ok, 38).
 condition('C4', coverage, ok, 45).
 condition('C5', re_decision, ok, 10).
-obligation(builtin, theory_scoped, 7).
+obligation(builtin, theory_scoped, aggregate_min(Key, Value, (between(1, 6, Value), Value < 6, cost(1, Value, Left), K1 is Value + 1, cost(K1, 6, Right), I0 is 1 - 1, dim(I0, Rows), dim(Value, Shared), dim(6, Cols), First is Rows * Shared, Multcost is First * Cols, Partial is Left + Right, Key is Partial + Multcost), 15125, 3)).
+obligation(builtin, theory_scoped, aggregate_min(Key, 3, (between(1, 6, 3), 3 < 6, cost(1, 3, Left), K1 is 3 + 1, cost(K1, 6, Right), I0 is 1 - 1, dim(I0, Rows), dim(3, Shared), dim(6, Cols), First is Rows * Shared, Multcost is First * Cols, Partial is Left + Right, Key is Partial + Multcost), 15125, 3)).
+obligation(builtin, theory_scoped, aggregate_min(Key, 1, (between(1, 3, 1), 1 < 3, cost(1, 1, Left), K1 is 1 + 1, cost(K1, 3, Right), I0 is 1 - 1, dim(I0, Rows), dim(1, Shared), dim(3, Cols), First is Rows * Shared, Multcost is First * Cols, Partial is Left + Right, Key is Partial + Multcost), 7875, 1)).
+obligation(builtin, theory_scoped, aggregate_min(Key, 2, (between(2, 3, 2), 2 < 3, cost(2, 2, Left), K1 is 2 + 1, cost(K1, 3, Right), I0 is 2 - 1, dim(I0, Rows), dim(2, Shared), dim(3, Cols), First is Rows * Shared, Multcost is First * Cols, Partial is Left + Right, Key is Partial + Multcost), 2625, 2)).
+obligation(builtin, theory_scoped, aggregate_min(Key, 5, (between(4, 6, 5), 5 < 6, cost(4, 5, Left), K1 is 5 + 1, cost(K1, 6, Right), I0 is 4 - 1, dim(I0, Rows), dim(5, Shared), dim(6, Cols), First is Rows * Shared, Multcost is First * Cols, Partial is Left + Right, Key is Partial + Multcost), 3500, 5)).
+obligation(builtin, theory_scoped, aggregate_min(Key, 4, (between(4, 5, 4), 4 < 5, cost(4, 4, Left), K1 is 4 + 1, cost(K1, 5, Right), I0 is 4 - 1, dim(I0, Rows), dim(4, Shared), dim(5, Cols), First is Rows * Shared, Multcost is First * Cols, Partial is Left + Right, Key is Partial + Multcost), 1000, 4)).
+obligation(builtin, theory_scoped, countall(subproblem(_i, _j, _cost), 21)).
 steps(38).
 verified(21).
 recomputed(10).

package/examples/check/missionaries-cannibals.pl

@@ -3,8 +3,18 @@ condition('C2', well_founded, ok, 97).
 condition('C3', justification, ok, 97).
 condition('C4', coverage, ok, 166).
 condition('C5', re_decision, ok, 32).
-obligation(absent, theory_scoped, 11).
-obligation(builtin, theory_scoped, 1).
+obligation(absent, theory_scoped, \+ member(state(3, 1, right), [state(3, 3, left)])).
+obligation(absent, theory_scoped, \+ member(state(3, 2, left), [state(3, 1, right), state(3, 3, left)])).
+obligation(absent, theory_scoped, \+ member(state(3, 0, right), [state(3, 2, left), state(3, 1, right), state(3, 3, left)])).
+obligation(absent, theory_scoped, \+ member(state(3, 1, left), [state(3, 0, right), state(3, 2, left), state(3, 1, right), state(3, 3, left)])).
+obligation(absent, theory_scoped, \+ member(state(1, 1, right), [state(3, 1, left), state(3, 0, right), state(3, 2, left), state(3, 1, right), state(3, 3, left)])).
+obligation(absent, theory_scoped, \+ member(state(2, 2, left), [state(1, 1, right), state(3, 1, left), state(3, 0, right), state(3, 2, left), state(3, 1, right), state(3, 3, left)])).
+obligation(absent, theory_scoped, \+ member(state(0, 2, right), [state(2, 2, left), state(1, 1, right), state(3, 1, left), state(3, 0, right), state(3, 2, left), state(3, 1, right), state(3, 3, left)])).
+obligation(absent, theory_scoped, \+ member(state(0, 3, left), [state(0, 2, right), state(2, 2, left), state(1, 1, right), state(3, 1, left), state(3, 0, right), state(3, 2, left), state(3, 1, right), state(3, 3, left)])).
+obligation(absent, theory_scoped, \+ member(state(0, 1, right), [state(0, 3, left), state(0, 2, right), state(2, 2, left), state(1, 1, right), state(3, 1, left), state(3, 0, right), state(3, 2, left), state(3, 1, right), state(3, 3, left)])).
+obligation(absent, theory_scoped, \+ member(state(1, 1, left), [state(0, 1, right), state(0, 3, left), state(0, 2, right), state(2, 2, left), state(1, 1, right), state(3, 1, left), state(3, 0, right), state(3, 2, left), state(3, 1, right), state(3, 3, left)])).
+obligation(absent, theory_scoped, \+ member(state(0, 0, right), [state(1, 1, left), state(0, 1, right), state(0, 3, left), state(0, 2, right), state(2, 2, left), state(1, 1, right), state(3, 1, left), state(3, 0, right), state(3, 2, left), state(3, 1, right), state(3, 3, left)])).
+obligation(builtin, theory_scoped, countall(state_safe(state(_m, _c, _boat)), 10)).
 steps(97).
 verified(53).
 recomputed(31).

package/examples/check/modal-logic-kripke.pl

@@ -3,7 +3,8 @@ condition('C2', well_founded, ok, 17).
 condition('C3', justification, ok, 17).
 condition('C4', coverage, ok, 18).
 condition('C5', re_decision, ok, 0).
-obligation(absent, theory_scoped, 2).
+obligation(absent, theory_scoped, \+ box_counterexample(w0, atom(clear))).
+obligation(absent, theory_scoped, \+ mforces(w0, box(atom(repaired)))).
 steps(17).
 verified(15).
 recomputed(0).

package/examples/check/observability-log-correlation.pl

@@ -3,7 +3,7 @@ condition('C2', well_founded, ok, 205).
 condition('C3', justification, ok, 205).
 condition('C4', coverage, ok, 257).
 condition('C5', re_decision, ok, 42).
-obligation(collected, theory_scoped, 1).
+obligation(collected, theory_scoped, findall(raw(Log0, Text), raw_log(Log0, Text), [raw(l1, 'ts=2026-06-18T10:00:00Z level=warn event=login_failed user=alice ip=203.0.113.9 traceparent=00-4bf92f3577b34da6a3ce929d0e0e4736-00f067aa0ba902b7-01'), raw(l2, 'ts=2026-06-18T10:00:03Z level=error event=payment_denied user=alice ip=203.0.113.9 traceparent=00-4bf92f3577b34da6a3ce929d0e0e4736-aaf067aa0ba90000-01'), raw(l3, 'ts=2026-06-18T10:01:12Z level=info event=login_success user=bob ip=198.51.100.4 traceparent=00-aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa-bbbbbbbbbbbbbbbb-01'), raw(noise, 'healthcheck ok')])).
 steps(205).
 verified(162).
 recomputed(42).

package/examples/check/odrl-dpv-healthcare-risk-ranked.pl

@@ -3,7 +3,7 @@ condition('C2', well_founded, ok, 75).
 condition('C3', justification, ok, 75).
 condition('C4', coverage, ok, 115).
 condition('C5', re_decision, ok, 22).
-obligation(collected, theory_scoped, 1).
+obligation(collected, theory_scoped, findall(key(InverseScore, Clause) - dpv_risk(Risk, Score, Level, Clause, Mitigation), (risk_report(Risk, Score, Level, Clause, Mitigation), InverseScore is 1000 - Score), [key(900, h1) - dpv_risk(consent_risk, 100, high, h1, require_explicit_consent), key(900, h2) - dpv_risk(sharing_risk, 100, high, h2, require_deidentification), key(930, h4) - dpv_risk(retention_risk, 70, moderate, h4, limit_retention_to_1095_days)])).
 steps(75).
 verified(52).
 recomputed(22).

package/examples/check/odrl-dpv-risk-ranked.pl

@@ -3,7 +3,7 @@ condition('C2', well_founded, ok, 104).
 condition('C3', justification, ok, 104).
 condition('C4', coverage, ok, 157).
 condition('C5', re_decision, ok, 31).
-obligation(collected, theory_scoped, 1).
+obligation(collected, theory_scoped, findall(key(InverseScore, Clause) - dpv_risk(Risk, Score, Level, Clause, Mitigation), (risk_report(Risk, Score, Level, Clause, Mitigation), InverseScore is 1000 - Score), [key(900, c1) - dpv_risk(deletion_risk, 100, high, c1, require_notice_before_deletion), key(915, c2) - dpv_risk(terms_risk, 85, high, c2, require_14_days_notice), key(903, c3) - dpv_risk(sharing_risk, 97, high, c3, require_explicit_consent), key(930, c4) - dpv_risk(portability_risk, 70, moderate, c4, permit_data_export)])).
 steps(104).
 verified(72).
 recomputed(31).

package/examples/check/odrl-policy-reasoning.pl

@@ -3,8 +3,46 @@ condition('C2', well_founded, ok, 248).
 condition('C3', justification, ok, 248).
 condition('C4', coverage, ok, 327).
 condition('C5', re_decision, ok, 3).
-obligation(absent, theory_scoped, 35).
-obligation(builtin, theory_scoped, 5).
+obligation(absent, theory_scoped, \+ positive_action_match(display, delete, __anon0)).
+obligation(absent, theory_scoped, \+ (constraint(open_use, Key, Value), \+ evidence(q_print, Key, Value))).
+obligation(absent, theory_scoped, \+ (duty(open_use, Duty), \+ duty_done(q_print, Duty))).
+obligation(absent, theory_scoped, \+ (constraint(share_report, Key, Value), \+ evidence(q_share_done, Key, Value))).
+obligation(absent, theory_scoped, \+ (duty(share_report, Duty), \+ duty_done(q_share_done, Duty))).
+obligation(absent, theory_scoped, \+ (constraint(share_report, Key, Value), \+ evidence(q_share_missing, Key, Value))).
+obligation(absent, theory_scoped, \+ duty_done(q_share_missing, attribute_source)).
+obligation(absent, theory_scoped, \+ (constraint(research_use, Key, Value), \+ evidence(q_research, Key, Value))).
+obligation(absent, theory_scoped, \+ (duty(research_use, Duty), \+ duty_done(q_research, Duty))).
+obligation(absent, theory_scoped, \+ evidence(q_commercial, purpose, research)).
+obligation(absent, theory_scoped, \+ rule_scope_matches(research_use, q_unrelated)).
+obligation(absent, theory_scoped, \+ (constraint(open_no_print, Key, Value), \+ evidence(q_print, Key, Value))).
+obligation(absent, theory_scoped, \+ (constraint(strict_use, Key, Value), \+ evidence(q_print, Key, Value))).
+obligation(absent, theory_scoped, \+ (duty(strict_use, Duty), \+ duty_done(q_print, Duty))).
+obligation(absent, theory_scoped, \+ (constraint(strict_no_print, Key, Value), \+ evidence(q_print, Key, Value))).
+obligation(absent, theory_scoped, \+ (constraint(invalid_use, Key, Value), \+ evidence(q_print, Key, Value))).
+obligation(absent, theory_scoped, \+ (duty(invalid_use, Duty), \+ duty_done(q_print, Duty))).
+obligation(absent, theory_scoped, \+ (constraint(invalid_no_print, Key, Value), \+ evidence(q_print, Key, Value))).
+obligation(absent, theory_scoped, \+ policy_prohibition(duty_policy, q_share_done)).
+obligation(absent, theory_scoped, \+ policy_permission(duty_policy, q_share_missing)).
+obligation(absent, theory_scoped, \+ policy_prohibition(duty_policy, q_share_missing)).
+obligation(absent, theory_scoped, \+ policy_permission(context_policy, q_commercial)).
+obligation(absent, theory_scoped, \+ policy_prohibition(context_policy, q_commercial)).
+obligation(absent, theory_scoped, \+ policy_applicable(context_policy, q_unrelated)).
+obligation(absent, theory_scoped, \+ (constraint(exact_permit, Key, A), constraint(exact_prohibit, Key, B), A \= B)).
+obligation(absent, theory_scoped, \+ (constraint(broad_permit, Key, A), constraint(narrow_prohibit, Key, B), A \= B)).
+obligation(builtin, theory_scoped, action_subsumes(use, print) ; action_subsumes(print, use)).
+obligation(absent, theory_scoped, \+ (constraint(aggregate_permit, Key, A), constraint(read_prohibit, Key, B), A \= B)).
+obligation(absent, theory_scoped, \+ action_subsumes(aggregate, read)).
+obligation(absent, theory_scoped, \+ action_subsumes(read, aggregate)).
+obligation(builtin, theory_scoped, action_requires(aggregate, read) ; action_requires(read, aggregate)).
+obligation(absent, theory_scoped, \+ action_subsumes(display, use)).
+obligation(absent, theory_scoped, \+ (constraint(general_use, Key, Value), \+ constraint(specific_display, Key, Value))).
+obligation(absent, theory_scoped, \+ (duty(general_use, Duty), \+ duty(specific_display, Duty))).
+obligation(absent, theory_scoped, \+ rule_subsumes(specific_display, general_use)).
+obligation(absent, theory_scoped, \+ (rule(SpecificRule, specific_policy, __anon54, __anon55, __anon56, __anon57), \+ (rule(GeneralRule, general_policy, __anon58, __anon59, __anon60, __anon61), rule_subsumes(GeneralRule, SpecificRule)))).
+obligation(absent, theory_scoped, \+ policy_subsumes(specific_policy, general_policy)).
+obligation(builtin, theory_scoped, wfs_truth(profile_permission(clear), true)).
+obligation(builtin, theory_scoped, wfs_truth(profile_permission(denied), false)).
+obligation(builtin, theory_scoped, wfs_truth(profile_permission(cycle), undefined)).
 steps(248).
 verified(205).
 recomputed(3).

package/examples/check/partial-evaluator.pl

@@ -3,7 +3,13 @@ condition('C2', well_founded, ok, 37).
 condition('C3', justification, ok, 37).
 condition('C4', coverage, ok, 42).
 condition('C5', re_decision, ok, 2).
-obligation(absent, theory_scoped, 7).
+obligation(absent, theory_scoped, \+ known_var([bind(x, const(10))], y, __anon3)).
+obligation(absent, theory_scoped, \+ (const(10) = const(_A), var(y) = const(_B))).
+obligation(absent, theory_scoped, \+ (mul(const(10), var(y)) = const(_A), const(13) = const(_B))).
+obligation(absent, theory_scoped, \+ known_var([bind(x, const(10))], flag, __anon3)).
+obligation(absent, theory_scoped, \+ var(flag) = bool(true)).
+obligation(absent, theory_scoped, \+ var(flag) = bool(false)).
+obligation(absent, theory_scoped, \+ (var(y) = const(_A), const(2) = const(_B))).
 steps(37).
 verified(28).
 recomputed(2).

package/examples/check/path-discovery.pl

@@ -3,7 +3,13 @@ condition('C2', well_founded, ok, 80).
 condition('C3', justification, ok, 80).
 condition('C4', coverage, ok, 118).
 condition('C5', re_decision, ok, 31).
-obligation(absent, theory_scoped, 7).
+obligation(absent, theory_scoped, \+ member(res_airport_309, [res_airport_310])).
+obligation(absent, theory_scoped, \+ member(res_airport_1452, [res_airport_309, res_airport_310])).
+obligation(absent, theory_scoped, \+ member(res_airport_1587, [res_airport_1452, res_airport_309, res_airport_310])).
+obligation(absent, theory_scoped, \+ member(res_airport_1472, [res_airport_309, res_airport_310])).
+obligation(absent, theory_scoped, \+ member(res_airport_1587, [res_airport_1472, res_airport_309, res_airport_310])).
+obligation(absent, theory_scoped, \+ member(res_airport_3998, [res_airport_309, res_airport_310])).
+obligation(absent, theory_scoped, \+ member(res_airport_1587, [res_airport_3998, res_airport_309, res_airport_310])).
 steps(80).
 verified(42).
 recomputed(31).

package/examples/check/pell-equation.pl

@@ -3,7 +3,7 @@ condition('C2', well_founded, ok, 83).
 condition('C3', justification, ok, 83).
 condition('C4', coverage, ok, 85).
 condition('C5', re_decision, ok, 68).
-obligation(builtin, theory_scoped, 1).
+obligation(builtin, theory_scoped, sumall(Expression, (between(1, 8, N), pell(N, _x, Expression)), 568344)).
 steps(83).
 verified(14).
 recomputed(68).

package/examples/check/prime-range.pl

@@ -3,8 +3,9 @@ condition('C2', well_founded, ok, 7).
 condition('C3', justification, ok, 7).
 condition('C4', coverage, ok, 7).
 condition('C5', re_decision, ok, 0).
-obligation(collected, theory_scoped, 1).
-obligation(builtin, theory_scoped, 2).
+obligation(collected, theory_scoped, findall(P, prime(P), [2, 3, 5, 7, 11, 13, 17, 19, 23, 29])).
+obligation(builtin, theory_scoped, countall(prime(_P), 10)).
+obligation(builtin, theory_scoped, countall(coprime(271, _k), 270)).
 steps(7).
 verified(4).
 recomputed(0).

package/examples/check/propositional-dynamic-logic.pl

@@ -3,8 +3,13 @@ condition('C2', well_founded, ok, 18).
 condition('C3', justification, ok, 18).
 condition('C4', coverage, ok, 23).
 condition('C5', re_decision, ok, 3).
-obligation(builtin, theory_scoped, 6).
-obligation(absent, theory_scoped, 1).
+obligation(builtin, theory_scoped, call(diamond(seq(unlock, seq(open_door, walk_to_garden)), at(garden), [at(hall), door(locked)]))).
+obligation(absent, theory_scoped, \+ run(open_door, [at(hall), door(locked)], __anon3)).
+obligation(builtin, theory_scoped, call(box(open_door, at(garden), [at(hall), door(locked)]))).
+obligation(builtin, theory_scoped, call(box(walk_to_garden, at(garden), [at(hall), door(open)]))).
+obligation(builtin, theory_scoped, call(diamond(choice(walk_to_garden, wait), at(garden), [at(hall), door(open)]))).
+obligation(builtin, theory_scoped, call(diamond(star(wait), at(hall), [at(hall), door(locked)]))).
+obligation(builtin, theory_scoped, call(diamond(seq(test(door(open)), walk_to_garden), at(garden), [at(hall), door(open)]))).
 steps(18).
 verified(8).
 recomputed(3).

package/examples/check/quine-mccluskey.pl

@@ -3,9 +3,27 @@ condition('C2', well_founded, ok, 242).
 condition('C3', justification, ok, 242).
 condition('C4', coverage, ok, 307).
 condition('C5', re_decision, ok, 76).
-obligation(asserted, theory_scoped, 1).
-obligation(collected, theory_scoped, 4).
-obligation(absent, theory_scoped, 16).
+obligation(asserted, theory_scoped, solution_cache(["00xx", "0xx1", "xx11"], ["00xx", "xx11"])).
+obligation(collected, theory_scoped, findall(Part, (member(Pat, ["00xx", "xx11"]), term_sop(Pat, Part)), ['~A~B', 'CD'])).
+obligation(collected, theory_scoped, findall(M, minterm(M), [1, 3, 7, 11, 15])).
+obligation(collected, theory_scoped, findall(Z, is_true_zero(Z), [4, 6, 8, 9, 10, 12, 13, 14])).
+obligation(absent, theory_scoped, \+ covers_int("00xx", 4)).
+obligation(absent, theory_scoped, \+ covers_int("xx11", 4)).
+obligation(absent, theory_scoped, \+ covers_int("00xx", 6)).
+obligation(absent, theory_scoped, \+ covers_int("xx11", 6)).
+obligation(absent, theory_scoped, \+ covers_int("00xx", 8)).
+obligation(absent, theory_scoped, \+ covers_int("xx11", 8)).
+obligation(absent, theory_scoped, \+ covers_int("00xx", 9)).
+obligation(absent, theory_scoped, \+ covers_int("xx11", 9)).
+obligation(absent, theory_scoped, \+ covers_int("00xx", 10)).
+obligation(absent, theory_scoped, \+ covers_int("xx11", 10)).
+obligation(absent, theory_scoped, \+ covers_int("00xx", 12)).
+obligation(absent, theory_scoped, \+ covers_int("xx11", 12)).
+obligation(absent, theory_scoped, \+ covers_int("00xx", 13)).
+obligation(absent, theory_scoped, \+ covers_int("xx11", 13)).
+obligation(absent, theory_scoped, \+ covers_int("00xx", 14)).
+obligation(absent, theory_scoped, \+ covers_int("xx11", 14)).
+obligation(collected, theory_scoped, findall(C, (find_combination(2, ["00xx", "0xx1", "xx11"], C), covers_all(C, [1, 3, 7, 11, 15])), [["00xx", "xx11"], ["00xx", "xx11"], ["0xx1", "xx11"], ["0xx1", "xx11"], ["0xx1", "xx11"], ["0xx1", "xx11"]])).
 steps(242).
 verified(145).
 recomputed(76).

package/examples/check/rdf12-annotated-claims.pl

@@ -3,7 +3,7 @@ condition('C2', well_founded, ok, 43).
 condition('C3', justification, ok, 43).
 condition('C4', coverage, ok, 57).
 condition('C5', re_decision, ok, 12).
-obligation(collected, theory_scoped, 1).
+obligation(collected, theory_scoped, findall(key(NegativeScore, Status) - claim(Status, Source, score(Score)), (annotated_status_claim(Status, Source, Score), NegativeScore is - Score), [key(-9310, closed) - claim(closed, transport_authority, score(9310)), key(-700, open) - claim(open, anonymous_post, score(700))])).
 steps(43).
 verified(30).
 recomputed(12).

package/examples/check/register-allocation.pl

@@ -3,7 +3,8 @@ condition('C2', well_founded, ok, 21).
 condition('C3', justification, ok, 21).
 condition('C4', coverage, ok, 27).
 condition('C5', re_decision, ok, 0).
-obligation(builtin, theory_scoped, 2).
+obligation(builtin, theory_scoped, aggregate_min([Candidate_cost, Value], Value, (valid_allocation(Value), allocation_cost(Value, Candidate_cost)), [1, [bind(a, r1), bind(b, spill), bind(c, r2), bind(d, r1)]], [bind(a, r1), bind(b, spill), bind(c, r2), bind(d, r1)])).
+obligation(builtin, theory_scoped, countall(valid_allocation(__anon8), 33)).
 steps(21).
 verified(19).
 recomputed(0).

package/examples/check/reified-conditionals.pl

@@ -3,7 +3,10 @@ condition('C2', well_founded, ok, 5).
 condition('C3', justification, ok, 5).
 condition('C4', coverage, ok, 5).
 condition('C5', re_decision, ok, 0).
-obligation(builtin, theory_scoped, 4).
+obligation(builtin, theory_scoped, tfilter(even_t, [1, 2, 3, 4, 5, 6, 7, 8], [2, 4, 6, 8])).
+obligation(builtin, theory_scoped, tpartition(even_t, [1, 2, 3, 4, 5, 6, 7, 8], [2, 4, 6, 8], [1, 3, 5, 7])).
+obligation(builtin, theory_scoped, if_(even_t(4), even = even, even = odd)).
+obligation(builtin, theory_scoped, if_(even_t(7), odd = even, odd = odd)).
 steps(5).
 verified(1).
 recomputed(0).

package/examples/check/riemann-hypothesis.pl

@@ -3,7 +3,10 @@ condition('C2', well_founded, ok, 40).
 condition('C3', justification, ok, 40).
 condition('C4', coverage, ok, 57).
 condition('C5', re_decision, ok, 2).
-obligation(absent, theory_scoped, 4).
+obligation(absent, theory_scoped, \+ trivial_zero(z1)).
+obligation(absent, theory_scoped, \+ counterexample_found(yes)).
+obligation(absent, theory_scoped, \+ trivial_zero(z2)).
+obligation(absent, theory_scoped, \+ trivial_zero(z3)).
 steps(40).
 verified(34).
 recomputed(2).

package/examples/check/sat-solver-dpll.pl

@@ -3,7 +3,7 @@ condition('C2', well_founded, ok, 42).
 condition('C3', justification, ok, 42).
 condition('C4', coverage, ok, 57).
 condition('C5', re_decision, ok, 5).
-obligation(builtin, theory_scoped, 1).
+obligation(builtin, theory_scoped, aggregate_min(Key, Value, (satisfying_model(Value), model_rank(Value, Key)), 7, [bind(d, true), bind(c, true), bind(b, true), bind(a, false)])).
 steps(42).
 verified(36).
 recomputed(5).

package/examples/check/sbom-vulnerability-response.pl

@@ -3,7 +3,10 @@ condition('C2', well_founded, ok, 71).
 condition('C3', justification, ok, 71).
 condition('C4', coverage, ok, 101).
 condition('C5', re_decision, ok, 9).
-obligation(absent, theory_scoped, 4).
+obligation(absent, theory_scoped, \+ member(payments_sdk, [shop_app])).
+obligation(absent, theory_scoped, \+ member(crypto_wrapper, [payments_sdk, shop_app])).
+obligation(absent, theory_scoped, \+ member(openssl_3_0_12, [crypto_wrapper, payments_sdk, shop_app])).
+obligation(absent, theory_scoped, \+ active_waiver(checkout_prod, cve_2026_7777)).
 steps(71).
 verified(58).
 recomputed(9).

package/examples/check/scientific-evidence-graph.pl

@@ -3,7 +3,8 @@ condition('C2', well_founded, ok, 92).
 condition('C3', justification, ok, 92).
 condition('C4', coverage, ok, 143).
 condition('C5', re_decision, ok, 17).
-obligation(absent, theory_scoped, 2).
+obligation(absent, theory_scoped, \+ high_quality(study_c, marker_reduction, iri('https://example.org/evidence/direction/contradicts'), __anon2)).
+obligation(absent, theory_scoped, \+ high_quality_counterevidence(marker_reduction, _Counter)).
 steps(92).
 verified(73).
 recomputed(17).

package/examples/check/send-more-money.pl

@@ -3,7 +3,7 @@ condition('C2', well_founded, ok, 55).
 condition('C3', justification, ok, 55).
 condition('C4', coverage, ok, 56).
 condition('C5', re_decision, ok, 46).
-obligation(builtin, theory_scoped, 1).
+obligation(builtin, theory_scoped, countall(send_more_money(_solution), 1)).
 steps(55).
 verified(8).
 recomputed(46).

package/examples/check/sieve.pl

@@ -3,7 +3,7 @@ condition('C2', well_founded, ok, 3).
 condition('C3', justification, ok, 3).
 condition('C4', coverage, ok, 3).
 condition('C5', re_decision, ok, 0).
-obligation(collected, theory_scoped, 1).
+obligation(collected, theory_scoped, findall(P, prime_under(1000, P), [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269, 271, 277, 281, 283, 293, 307, 311, 313, 317, 331, 337, 347, 349, 353, 359, 367, 373, 379, 383, 389, 397, 401, 409, 419, 421, 431, 433, 439, 443, 449, 457, 461, 463, 467, 479, 487, 491, 499, 503, 509, 521, 523, 541, 547, 557, 563, 569, 571, 577, 587, 593, 599, 601, 607, 613, 617, 619, 631, 641, 643, 647, 653, 659, 661, 673, 677, 683, 691, 701, 709, 719, 727, 733, 739, 743, 751, 757, 761, 769, 773, 787, 797, 809, 811, 821, 823, 827, 829, 839, 853, 857, 859, 863, 877, 881, 883, 887, 907, 911, 919, 929, 937, 941, 947, 953, 967, 971, 977, 983, 991, 997])).
 steps(3).
 verified(2).
 recomputed(0).

package/examples/check/snaf.pl

@@ -3,7 +3,7 @@ condition('C2', well_founded, ok, 3).
 condition('C3', justification, ok, 3).
 condition('C4', coverage, ok, 3).
 condition('C5', re_decision, ok, 0).
-obligation(absent, theory_scoped, 1).
+obligation(absent, theory_scoped, \+ hates(alice, bob)).
 steps(3).
 verified(2).
 recomputed(0).

package/examples/check/stable-marriage.pl

@@ -3,8 +3,8 @@ condition('C2', well_founded, ok, 16).
 condition('C3', justification, ok, 16).
 condition('C4', coverage, ok, 16).
 condition('C5', re_decision, ok, 5).
-obligation(absent, theory_scoped, 1).
-obligation(builtin, theory_scoped, 1).
+obligation(absent, theory_scoped, \+ blocking_pair([pair(adam, bea), pair(brian, dana), pair(cole, amy), pair(drew, cora)], _man, _woman)).
+obligation(builtin, theory_scoped, countall(stable_matching(_matching), 1)).
 steps(16).
 verified(9).
 recomputed(4).

package/examples/check/stirling-bell-numbers.pl

@@ -3,7 +3,10 @@ condition('C2', well_founded, ok, 39).
 condition('C3', justification, ok, 39).
 condition('C4', coverage, ok, 44).
 condition('C5', re_decision, ok, 21).
-obligation(builtin, theory_scoped, 4).
+obligation(builtin, theory_scoped, sumall(Expression, (between(0, 4, I), signed_term(10, 4, I, Expression)), 818520.0)).
+obligation(builtin, theory_scoped, sumall(Expression, (between(0, 5, I), signed_term(12, 5, I, Expression)), 165528000.0)).
+obligation(builtin, theory_scoped, sumall(Expression, (between(0, 9, K), binomial(9, K, Choose), bell(K, Bell), Expression is Choose * Bell), 115975)).
+obligation(builtin, theory_scoped, sumall(Expression, (between(0, 11, K), binomial(11, K, Choose), bell(K, Bell), Expression is Choose * Bell), 4213597)).
 steps(39).
 verified(14).
 recomputed(21).

package/examples/check/superdense-coding.pl

@@ -3,7 +3,14 @@ condition('C2', well_founded, ok, 38).
 condition('C3', justification, ok, 38).
 condition('C4', coverage, ok, 50).
 condition('C5', re_decision, ok, 0).
-obligation(absent, theory_scoped, 8).
+obligation(absent, theory_scoped, \+ duplicate_sdc_path(1, 1, path(false, false, true))).
+obligation(absent, theory_scoped, \+ duplicate_sdc_path(3, 3, path(false, false, false))).
+obligation(absent, theory_scoped, \+ duplicate_sdc_path(0, 0, path(true, true, true))).
+obligation(absent, theory_scoped, \+ duplicate_sdc_path(2, 2, path(true, true, false))).
+obligation(absent, theory_scoped, \+ sdcoding(0, 1)).
+obligation(absent, theory_scoped, \+ sdcoding(1, 0)).
+obligation(absent, theory_scoped, \+ sdcoding(2, 3)).
+obligation(absent, theory_scoped, \+ sdcoding(3, 2)).
 steps(38).
 verified(30).
 recomputed(0).

package/examples/check/symbiotic-knowledge-graph.pl

@@ -3,8 +3,20 @@ condition('C2', well_founded, ok, 227).
 condition('C3', justification, ok, 227).
 condition('C4', coverage, ok, 295).
 condition('C5', re_decision, ok, 14).
-obligation(builtin, theory_scoped, 1).
-obligation(absent, theory_scoped, 13).
+obligation(builtin, theory_scoped, \+ conflict_iri(iri('https://example.org/city/proposal/p1'), iri('https://example.org/city/route/7'), iri('https://example.org/vocab/status'), _Existing) ; authoritative_override(iri('https://example.org/city/evidence/transit-api-20260827'), iri('https://example.org/vocab/status'))).
+obligation(absent, theory_scoped, \+ proposal_state_iri(iri('https://example.org/city/proposal/p4'), auto_accepted)).
+obligation(absent, theory_scoped, \+ human_review(iri('https://example.org/city/proposal/p4'), _Reviewer, _Decision, _Note)).
+obligation(absent, theory_scoped, \+ known(before_review, iri('https://example.org/city/facility/riverside-school'), iri('https://example.org/vocab/emergencyDesignation'), iri('https://example.org/city/class/cooling-center'))).
+obligation(absent, theory_scoped, \+ has_accepted_override(after_review, iri('https://example.org/city/facility/riverside-school'), iri('https://example.org/vocab/status'))).
+obligation(absent, theory_scoped, \+ has_accepted_override(after_review, iri('https://example.org/city/facility/riverside-school'), iri('https://example.org/vocab/cooling'))).
+obligation(absent, theory_scoped, \+ has_accepted_override(after_review, iri('https://example.org/city/facility/riverside-school'), iri('https://example.org/vocab/wheelchairAccess'))).
+obligation(absent, theory_scoped, \+ has_accepted_override(after_review, iri('https://example.org/city/facility/riverside-school'), iri('https://example.org/vocab/capacity'))).
+obligation(absent, theory_scoped, \+ has_accepted_override(after_review, iri('https://example.org/city/neighbourhood/riverside'), iri('https://example.org/vocab/expectedDemand'))).
+obligation(absent, theory_scoped, \+ known(after_review, iri('https://example.org/city/facility/riverside-school'), iri('https://example.org/vocab/power'), iri('https://example.org/city/state/unstable'))).
+obligation(absent, theory_scoped, \+ has_accepted_override(after_review, iri('https://example.org/city/facility/riverside-school'), iri('https://example.org/vocab/neighbourhood'))).
+obligation(absent, theory_scoped, \+ local_center(before_review, Neighbourhood, _Local)).
+obligation(absent, theory_scoped, \+ reachable_center(before_review, Neighbourhood, _Remote)).
+obligation(absent, theory_scoped, \+ has_accepted_override(before_review, iri('https://example.org/city/neighbourhood/riverside'), iri('https://example.org/vocab/mobileUnitAvailable'))).
 steps(227).
 verified(199).
 recomputed(14).

package/examples/check/term-tools.pl

@@ -3,7 +3,7 @@ condition('C2', well_founded, ok, 12).
 condition('C3', justification, ok, 12).
 condition('C4', coverage, ok, 12).
 condition('C5', re_decision, ok, 5).
-obligation(absent, theory_scoped, 1).
+obligation(absent, theory_scoped, \+ nonpositive_edge).
 steps(12).
 verified(6).
 recomputed(5).

package/examples/check/totient-summatory.pl

@@ -3,7 +3,10 @@ condition('C2', well_founded, ok, 15).
 condition('C3', justification, ok, 15).
 condition('C4', coverage, ok, 15).
 condition('C5', re_decision, ok, 3).
-obligation(builtin, theory_scoped, 4).
+obligation(builtin, theory_scoped, countall(coprime_upto(36, _k), 12)).
+obligation(builtin, theory_scoped, countall(coprime_upto(97, _k), 96)).
+obligation(builtin, theory_scoped, countall(coprime_upto(84, _k), 24)).
+obligation(builtin, theory_scoped, sumall(Expression, (between(1, 30, N), totient(N, Expression)), 278)).
 steps(15).
 verified(8).
 recomputed(3).

package/examples/check/universal-vs-existential-termination.pl

@@ -3,7 +3,7 @@ condition('C2', well_founded, ok, 7).
 condition('C3', justification, ok, 7).
 condition('C4', coverage, ok, 7).
 condition('C5', re_decision, ok, 5).
-obligation(collected, theory_scoped, 1).
+obligation(collected, theory_scoped, findall(X - Y, append(X, Y, "abc"), [[] - "abc", "a" - "bc", "ab" - "c", "abc" - []])).
 steps(7).
 verified(1).
 recomputed(5).

package/examples/check/vanilla-meta-interpreter.pl

@@ -3,7 +3,8 @@ condition('C2', well_founded, ok, 3).
 condition('C3', justification, ok, 3).
 condition('C4', coverage, ok, 3).
 condition('C5', re_decision, ok, 0).
-obligation(collected, theory_scoped, 2).
+obligation(collected, theory_scoped, findall(X, solve(grandparent(tom, X)), [ann, pat])).
+obligation(collected, theory_scoped, findall(X, solve(great_grandparent(tom, X)), [jim])).
 steps(3).
 verified(1).
 recomputed(0).