eyeprolog 1.6.19 → 1.6.20

package/examples/check/access-control-policy.pl

@@ -3,7 +3,8 @@ condition('C2', well_founded, ok, 12).
 condition('C3', justification, ok, 12).
 condition('C4', coverage, ok, 17).
 condition('C5', re_decision, ok, 0).
-obligation(absent, theory_scoped, 2).
+obligation(absent, theory_scoped, \+ (allOf(policy_x, Claim), \+ has(test1, Claim))).
+obligation(absent, theory_scoped, \+ (noneOf(policy_x, Claim), has(test1, Claim))).
 steps(12).
 verified(10).
 recomputed(0).

package/examples/check/attributed-variables.pl

@@ -3,7 +3,9 @@ condition('C2', well_founded, ok, 10).
 condition('C3', justification, ok, 10).
 condition('C4', coverage, ok, 10).
 condition('C5', re_decision, ok, 3).
-obligation(builtin, stateful, 3).
+obligation(builtin, stateful, put_atts(Variable, required(7))).
+obligation(builtin, stateful, put_atts(Variable, required(ready))).
+obligation(builtin, stateful, get_atts(Y, required(ready))).
 steps(10).
 verified(4).
 recomputed(3).

package/examples/check/binomial-vandermonde.pl

@@ -3,7 +3,8 @@ condition('C2', well_founded, ok, 206).
 condition('C3', justification, ok, 206).
 condition('C4', coverage, ok, 291).
 condition('C5', re_decision, ok, 145).
-obligation(builtin, theory_scoped, 2).
+obligation(builtin, theory_scoped, sumall(Expression, (between(0, 8, K), Rk is 8 - K, choose(12, K, A), choose(10, Rk, B), Expression is A * B), 319770.0)).
+obligation(builtin, theory_scoped, sumall(Expression, (between(0, 12, K), choose(12, K, Expression)), 4096.0)).
 steps(206).
 verified(59).
 recomputed(145).

package/examples/check/blocks-world-planning.pl

@@ -3,8 +3,19 @@ condition('C2', well_founded, ok, 90).
 condition('C3', justification, ok, 90).
 condition('C4', coverage, ok, 96).
 condition('C5', re_decision, ok, 40).
-obligation(absent, theory_scoped, 12).
-obligation(collected, theory_scoped, 1).
+obligation(absent, theory_scoped, \+ member(on(_other, e), [on(a, table), on(b, a), on(c, b), on(d, c), on(e, d)])).
+obligation(absent, theory_scoped, \+ member([on(a, table), on(b, a), on(c, b), on(d, c), on(e, table)], [[on(a, table), on(b, a), on(c, b), on(d, c), on(e, d)]])).
+obligation(absent, theory_scoped, \+ member(on(_other, d), [on(a, table), on(b, a), on(c, b), on(d, c), on(e, table)])).
+obligation(absent, theory_scoped, \+ member([on(a, table), on(b, a), on(c, b), on(d, table), on(e, table)], [[on(a, table), on(b, a), on(c, b), on(d, c), on(e, table)], [on(a, table), on(b, a), on(c, b), on(d, c), on(e, d)]])).
+obligation(absent, theory_scoped, \+ member(on(_other, c), [on(a, table), on(b, a), on(c, b), on(d, table), on(e, table)])).
+obligation(absent, theory_scoped, \+ member([on(a, table), on(b, a), on(c, table), on(d, table), on(e, table)], [[on(a, table), on(b, a), on(c, b), on(d, table), on(e, table)], [on(a, table), on(b, a), on(c, b), on(d, c), on(e, table)], [on(a, table), on(b, a), on(c, b), on(d, c), on(e, d)]])).
+obligation(absent, theory_scoped, \+ member(on(_other, d), [on(a, table), on(b, a), on(c, table), on(d, table), on(e, table)])).
+obligation(absent, theory_scoped, \+ member(on(_other, c), [on(a, table), on(b, a), on(c, table), on(d, table), on(e, table)])).
+obligation(absent, theory_scoped, \+ member([on(a, table), on(b, a), on(c, table), on(d, c), on(e, table)], [[on(a, table), on(b, a), on(c, table), on(d, table), on(e, table)], [on(a, table), on(b, a), on(c, b), on(d, table), on(e, table)], [on(a, table), on(b, a), on(c, b), on(d, c), on(e, table)], [on(a, table), on(b, a), on(c, b), on(d, c), on(e, d)]])).
+obligation(absent, theory_scoped, \+ member(on(_other, e), [on(a, table), on(b, a), on(c, table), on(d, c), on(e, table)])).
+obligation(absent, theory_scoped, \+ member(on(_other, d), [on(a, table), on(b, a), on(c, table), on(d, c), on(e, table)])).
+obligation(absent, theory_scoped, \+ member([on(a, table), on(b, a), on(c, table), on(d, c), on(e, d)], [[on(a, table), on(b, a), on(c, table), on(d, c), on(e, table)], [on(a, table), on(b, a), on(c, table), on(d, table), on(e, table)], [on(a, table), on(b, a), on(c, b), on(d, table), on(e, table)], [on(a, table), on(b, a), on(c, b), on(d, c), on(e, table)], [on(a, table), on(b, a), on(c, b), on(d, c), on(e, d)]])).
+obligation(collected, theory_scoped, findall(Block, block(Block), "abcde")).
 steps(90).
 verified(37).
 recomputed(39).

package/examples/check/catalan-convolution.pl

@@ -3,7 +3,8 @@ condition('C2', well_founded, ok, 15).
 condition('C3', justification, ok, 15).
 condition('C4', coverage, ok, 17).
 condition('C5', re_decision, ok, 6).
-obligation(builtin, theory_scoped, 2).
+obligation(builtin, theory_scoped, sumall(Expression, (between(0, 11, I), J is 11 - I, catalan(I, A), catalan(J, B), Expression is A * B), 208012)).
+obligation(builtin, theory_scoped, sumall(Expression, (between(0, 9, N), catalan(N, Expression)), 6918)).
 steps(15).
 verified(7).
 recomputed(6).

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

@@ -3,7 +3,8 @@ condition('C2', well_founded, ok, 17).
 condition('C3', justification, ok, 17).
 condition('C4', coverage, ok, 20).
 condition('C5', re_decision, ok, 0).
-obligation(absent, theory_scoped, 2).
+obligation(absent, theory_scoped, \+ nonfalse_literal(initial, [neg(c)])).
+obligation(absent, theory_scoped, \+ unsatisfied_final_clause).
 steps(17).
 verified(15).
 recomputed(0).

package/examples/check/chart-parser.pl

@@ -3,7 +3,10 @@ condition('C2', well_founded, ok, 71).
 condition('C3', justification, ok, 71).
 condition('C4', coverage, ok, 92).
 condition('C5', re_decision, ok, 10).
-obligation(builtin, theory_scoped, 4).
+obligation(builtin, theory_scoped, countall(span(command, s, 0, 5), 1)).
+obligation(builtin, theory_scoped, countall(span(ambiguous_pp, s, 0, 8), 1)).
+obligation(builtin, theory_scoped, countall(span(command, np, _start, _end), 2)).
+obligation(builtin, theory_scoped, countall(span(ambiguous_pp, np, _start, _end), 4)).
 steps(71).
 verified(57).
 recomputed(10).

package/examples/check/clinical-trial-screening.pl

@@ -3,7 +3,9 @@ condition('C2', well_founded, ok, 32).
 condition('C3', justification, ok, 32).
 condition('C4', coverage, ok, 38).
 condition('C5', re_decision, ok, 4).
-obligation(absent, theory_scoped, 3).
+obligation(absent, theory_scoped, \+ exclusion_renal(p001)).
+obligation(absent, theory_scoped, \+ exclusion_pregnancy(p001)).
+obligation(absent, theory_scoped, \+ inclusion_hba1c(p004)).
 steps(32).
 verified(25).
 recomputed(4).

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

@@ -3,7 +3,11 @@ condition('C2', well_founded, ok, 18).
 condition('C3', justification, ok, 18).
 condition('C4', coverage, ok, 18).
 condition('C5', re_decision, ok, 4).
-obligation(builtin, stateful, 5).
+obligation(builtin, stateful, sat(0 =:= 0 * ~ 0 + ~ 0 * 0)).
+obligation(builtin, stateful, sat(0 =:= 1 * ~ 1 + ~ 1 * 1)).
+obligation(builtin, stateful, sat(1 =:= 0 * ~ 1 + ~ 0 * 1)).
+obligation(builtin, stateful, sat(1 =:= 1 * ~ 0 + ~ 1 * 0)).
+obligation(builtin, stateful, taut(x # y =:= x * ~ y + ~ x * y, 1)).
 steps(18).
 verified(9).
 recomputed(4).

package/examples/check/clpb-cardinality.pl

@@ -3,7 +3,9 @@ condition('C2', well_founded, ok, 10).
 condition('C3', justification, ok, 10).
 condition('C4', coverage, ok, 10).
 condition('C5', re_decision, ok, 2).
-obligation(builtin, stateful, 3).
+obligation(builtin, stateful, sat(card([2], [0, 0, 1, 1]) * (0 =< 1) * (0 # 1))).
+obligation(builtin, stateful, sat(card([2], [0, 1, 1, 0]) * (0 =< 1) * (1 # 0))).
+obligation(builtin, stateful, sat_count(card([2], [Alice, Bob, Carol, Dan]) * (Alice =< Carol) * (Bob # Dan), 2)).
 steps(10).
 verified(5).
 recomputed(2).

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

@@ -3,7 +3,11 @@ condition('C2', well_founded, ok, 18).
 condition('C3', justification, ok, 18).
 condition('C4', coverage, ok, 18).
 condition('C5', re_decision, ok, 4).
-obligation(builtin, stateful, 5).
+obligation(builtin, stateful, sat((0 # 1) * (1 =< 1) * (1 =< 1))).
+obligation(builtin, stateful, sat((1 # 0) * (0 =< 0) * (0 =< 0))).
+obligation(builtin, stateful, sat((1 # 0) * (0 =< 1) * (0 =< 0))).
+obligation(builtin, stateful, sat((1 # 0) * (1 =< 1) * (0 =< 1))).
+obligation(builtin, stateful, sat_count((_Cloud # Edge) * (Audit =< _Encryption) * (Edge =< Audit), 4)).
 steps(18).
 verified(9).
 recomputed(4).

package/examples/check/clpz-resource-allocation.pl

@@ -3,7 +3,7 @@ condition('C2', well_founded, ok, 25).
 condition('C3', justification, failed(1), 25).
 condition('C4', coverage, ok, 27).
 condition('C5', re_decision, ok, 22).
-failure('C3', clpz_example(domain, domain(2, 7, 4, \/('..'(2, 4), 7))), 'recorded as unproven').
+failure('C3', clpz_example(domain, domain(2, 7, 4, 2..4 \/ 7)), 'recorded as unproven').
 steps(25).
 verified(2).
 recomputed(22).

package/examples/check/combinatorics-findall-sort.pl

@@ -3,7 +3,7 @@ condition('C2', well_founded, ok, 6).
 condition('C3', justification, ok, 6).
 condition('C4', coverage, ok, 7).
 condition('C5', re_decision, ok, 2).
-obligation(collected, theory_scoped, 1).
+obligation(collected, theory_scoped, findall(C, combination(3, [1, 2, 3, 4, 5], C), [[1, 2, 3], [1, 2, 4], [1, 2, 5], [1, 2, 3], [1, 3, 4], [1, 3, 5], [1, 2, 4], [1, 3, 4], [1, 4, 5], [1, 2, 5], [1, 3, 5], [1, 4, 5], [1, 2, 3], [1, 2, 4], [1, 2, 5], [1, 2, 3], [2, 3, 4], [2, 3, 5], [1, 2, 4], [2, 3, 4], [2, 4, 5], [1, 2, 5], [2, 3, 5], [2, 4, 5], [1, 2, 3], [1, 3, 4], [1, 3, 5], [1, 2, 3], [2, 3, 4], [2, 3, 5], [1, 3, 4], [2, 3, 4], [3, 4, 5], [1, 3, 5], [2, 3, 5], [3, 4, 5], [1, 2, 4], [1, 3, 4], [1, 4, 5], [1, 2, 4], [2, 3, 4], [2, 4, 5], [1, 3, 4], [2, 3, 4], [3, 4, 5], [1, 4, 5], [2, 4, 5], [3, 4, 5], [1, 2, 5], [1, 3, 5], [1, 4, 5], [1, 2, 5], [2, 3, 5], [2, 4, 5], [1, 3, 5], [2, 3, 5], [3, 4, 5], [1, 4, 5], [2, 4, 5], [3, 4, 5]])).
 steps(6).
 verified(3).
 recomputed(2).

package/examples/check/context-schema-audit.pl

@@ -3,7 +3,8 @@ condition('C2', well_founded, ok, 79).
 condition('C3', justification, ok, 79).
 condition('C4', coverage, ok, 93).
 condition('C5', re_decision, ok, 26).
-obligation(absent, theory_scoped, 2).
+obligation(absent, theory_scoped, \+ allowed_shape(gps, 2)).
+obligation(absent, theory_scoped, \+ allowed_shape(tampered, 1)).
 steps(79).
 verified(51).
 recomputed(26).

package/examples/check/continued-fraction-sqrt2.pl

@@ -3,7 +3,7 @@ condition('C2', well_founded, ok, 124).
 condition('C3', justification, ok, 124).
 condition('C4', coverage, ok, 139).
 condition('C5', re_decision, ok, 102).
-obligation(builtin, theory_scoped, 1).
+obligation(builtin, theory_scoped, sumall(Expression, (between(0, 10, N), conv(N, Expression, _q)), 13859)).
 steps(124).
 verified(21).
 recomputed(102).

package/examples/check/critical-path-schedule.pl

@@ -3,8 +3,18 @@ condition('C2', well_founded, ok, 128).
 condition('C3', justification, ok, 128).
 condition('C4', coverage, ok, 186).
 condition('C5', re_decision, ok, 11).
-obligation(builtin, theory_scoped, 11).
-obligation(absent, theory_scoped, 1).
+obligation(builtin, theory_scoped, aggregate_max(Key, Value, finish_time(Value, Key), 23, launch)).
+obligation(builtin, theory_scoped, aggregate_max(Key, Value, (depends(launch, Value), finish_time(Value, Key)), 22, security_review)).
+obligation(builtin, theory_scoped, aggregate_max(Key, Value, (depends(security_review, Value), finish_time(Value, Key)), 19, integration)).
+obligation(builtin, theory_scoped, aggregate_max(Key, Value, (depends(integration, Value), finish_time(Value, Key)), 15, backend)).
+obligation(builtin, theory_scoped, aggregate_max(Key, Value, (depends(backend, Value), finish_time(Value, Key)), 9, database)).
+obligation(builtin, theory_scoped, aggregate_max(Key, Value, (depends(database, Value), finish_time(Value, Key)), 5, architecture)).
+obligation(builtin, theory_scoped, aggregate_max(Key, Value, (depends(architecture, Value), finish_time(Value, Key)), 2, requirements)).
+obligation(absent, theory_scoped, \+ depends(requirements, _pred)).
+obligation(builtin, theory_scoped, aggregate_max(Key, Value, (depends(api_design, Value), finish_time(Value, Key)), 2, requirements)).
+obligation(builtin, theory_scoped, aggregate_max(Key, Value, (depends(frontend, Value), finish_time(Value, Key)), 4, api_design)).
+obligation(builtin, theory_scoped, aggregate_max(Key, Value, (depends(auth, Value), finish_time(Value, Key)), 5, architecture)).
+obligation(builtin, theory_scoped, aggregate_max(Key, Value, (depends(load_test, Value), finish_time(Value, Key)), 19, integration)).
 steps(128).
 verified(105).
 recomputed(11).

package/examples/check/d3-group.pl

@@ -3,7 +3,7 @@ condition('C2', well_founded, ok, 6).
 condition('C3', justification, ok, 6).
 condition('C4', coverage, ok, 7).
 condition('C5', re_decision, ok, 2).
-obligation(collected, theory_scoped, 1).
+obligation(collected, theory_scoped, findall(G, valid_group(G), [[identity, reflection_a, reflection_b, reflection_c, rotation_120, rotation_240], [identity, reflection_a], [identity, reflection_b], [identity, reflection_c], [identity, rotation_120, rotation_240], [identity]])).
 steps(6).
 verified(3).
 recomputed(2).

package/examples/check/data-negotiation.pl

@@ -3,7 +3,7 @@ condition('C2', well_founded, ok, 12).
 condition('C3', justification, ok, 12).
 condition('C4', coverage, ok, 14).
 condition('C5', re_decision, ok, 3).
-obligation(absent, theory_scoped, 1).
+obligation(absent, theory_scoped, \+ member(data4, [data1, data2, data3])).
 steps(12).
 verified(8).
 recomputed(3).

package/examples/check/dcg-command-parser.pl

@@ -3,8 +3,10 @@ condition('C2', well_founded, ok, 8).
 condition('C3', justification, ok, 8).
 condition('C4', coverage, ok, 8).
 condition('C5', re_decision, ok, 0).
-obligation(builtin, theory_scoped, 3).
-obligation(absent, theory_scoped, 1).
+obligation(builtin, theory_scoped, phrase(command(set(light(kitchen), on)), [set, kitchen, light, to, on])).
+obligation(builtin, theory_scoped, phrase(command(set(light(hall), off)), [set, hall, light, to, off])).
+obligation(builtin, theory_scoped, phrase(command(set(light(kitchen), on)), [set, kitchen, light, to, on, then, wait], [then, wait])).
+obligation(absent, theory_scoped, \+ phrase(command(__anon0), [set, garage, light, to, blinking])).
 steps(8).
 verified(4).
 recomputed(0).

package/examples/check/dcg-expression-language.pl

@@ -3,8 +3,12 @@ condition('C2', well_founded, ok, 28).
 condition('C3', justification, ok, 28).
 condition('C4', coverage, ok, 28).
 condition('C5', re_decision, ok, 4).
-obligation(builtin, theory_scoped, 5).
-obligation(absent, theory_scoped, 1).
+obligation(builtin, theory_scoped, phrase(expression(add(lit(2), mul(lit(3), sub(lit(4), lit(1))))), [2, +, 3, *, '(', 4, -, 1, ')'])).
+obligation(builtin, theory_scoped, phrase(expression(sub(mul(var(x), add(var(y), lit(2))), var(z))), [x, *, '(', y, +, 2|")-z"])).
+obligation(builtin, theory_scoped, phrase(emit_expression(sub(lit(20), sub(lit(5), lit(3)))), [20, -, '(', 5, -, 3, ')'])).
+obligation(builtin, theory_scoped, phrase(expression(sub(lit(20), sub(lit(5), lit(3)))), [20, -, '(', 5, -, 3, ')'])).
+obligation(builtin, theory_scoped, phrase(expression(mul(var(x), lit(2))), [x, *, 2, then, stop], [then, stop])).
+obligation(absent, theory_scoped, \+ phrase(expression(__anon14), [2, *, '(', 3, +, 4])).
 steps(28).
 verified(18).
 recomputed(4).

package/examples/check/deep-taxonomy-1000.pl

@@ -3,7 +3,12 @@ condition('C2', well_founded, ok, 37).
 condition('C3', justification, ok, 37).
 condition('C4', coverage, ok, 60).
 condition('C5', re_decision, ok, 11).
-obligation(builtin, theory_scoped, 6).
+obligation(builtin, theory_scoped, once(a(ind, a2))).
+obligation(builtin, theory_scoped, once(a(ind, n500))).
+obligation(builtin, theory_scoped, once(a(ind, i500))).
+obligation(builtin, theory_scoped, once(a(ind, j500))).
+obligation(builtin, theory_scoped, once(a(ind, n999))).
+obligation(builtin, theory_scoped, once(a(ind, n1000))).
 steps(37).
 verified(20).
 recomputed(0).

package/examples/check/deep-taxonomy-10000.pl

@@ -3,7 +3,12 @@ condition('C2', well_founded, ok, 37).
 condition('C3', justification, ok, 37).
 condition('C4', coverage, ok, 60).
 condition('C5', re_decision, ok, 11).
-obligation(builtin, theory_scoped, 6).
+obligation(builtin, theory_scoped, once(a(ind, a2))).
+obligation(builtin, theory_scoped, once(a(ind, n5000))).
+obligation(builtin, theory_scoped, once(a(ind, i5000))).
+obligation(builtin, theory_scoped, once(a(ind, j5000))).
+obligation(builtin, theory_scoped, once(a(ind, n9999))).
+obligation(builtin, theory_scoped, once(a(ind, n10000))).
 steps(37).
 verified(20).
 recomputed(0).

package/examples/check/deep-taxonomy-100000.pl

@@ -3,7 +3,12 @@ condition('C2', well_founded, ok, 37).
 condition('C3', justification, ok, 37).
 condition('C4', coverage, ok, 60).
 condition('C5', re_decision, ok, 11).
-obligation(builtin, theory_scoped, 6).
+obligation(builtin, theory_scoped, once(a(ind, a2))).
+obligation(builtin, theory_scoped, once(a(ind, n50000))).
+obligation(builtin, theory_scoped, once(a(ind, i50000))).
+obligation(builtin, theory_scoped, once(a(ind, j50000))).
+obligation(builtin, theory_scoped, once(a(ind, n99999))).
+obligation(builtin, theory_scoped, once(a(ind, n100000))).
 steps(37).
 verified(20).
 recomputed(0).

package/examples/check/defeasible-reasoning.pl

@@ -3,7 +3,11 @@ condition('C2', well_founded, ok, 14).
 condition('C3', justification, ok, 14).
 condition('C4', coverage, ok, 14).
 condition('C5', re_decision, ok, 0).
-obligation(builtin, theory_scoped, 5).
+obligation(builtin, theory_scoped, wfs_truth(reimbursable(taxi_receipt), true)).
+obligation(builtin, theory_scoped, wfs_truth(reimbursable(client_dinner_wine), false)).
+obligation(builtin, theory_scoped, wfs_truth(reimbursable(client_dinner_wine_preapproved), true)).
+obligation(builtin, theory_scoped, wfs_truth(covered_by_blanket(team_offsite_hotel), undefined)).
+obligation(builtin, theory_scoped, wfs_truth(itemized(team_offsite_hotel), undefined)).
 steps(14).
 verified(9).
 recomputed(0).

package/examples/check/delfour.pl

@@ -3,7 +3,8 @@ condition('C2', well_founded, ok, 295).
 condition('C3', justification, ok, 295).
 condition('C4', coverage, ok, 354).
 condition('C5', re_decision, ok, 50).
-obligation(absent, theory_scoped, 2).
+obligation(absent, theory_scoped, \+ better_lower_sugar(120, 30)).
+obligation(absent, theory_scoped, \+ matches('createdat expiresat insight metric sugar_g_per_serving retailer delfour scopedevice self-scanner scopeevent pick_up_scanner', 'diabetes|medical')).
 steps(295).
 verified(243).
 recomputed(50).

package/examples/check/dijkstra-findall-sort.pl

@@ -3,7 +3,17 @@ condition('C2', well_founded, ok, 50).
 condition('C3', justification, ok, 50).
 condition('C4', coverage, ok, 51).
 condition('C5', re_decision, ok, 24).
-obligation(collected, theory_scoped, 11).
+obligation(collected, theory_scoped, findall([Newcost, Neighbor, a], (edge(a, Neighbor, Weight), \+ member(Neighbor, []), Newcost is 0 + Weight), [[4|"ba"], [2|"ca"]])).
+obligation(collected, theory_scoped, findall([Newcost, Neighbor|"ca"], (edge(c, Neighbor, Weight), \+ member(Neighbor, "a"), Newcost is 2 + Weight), [[10|"dca"], [12|"eca"], [3|"bca"]])).
+obligation(collected, theory_scoped, findall([Newcost, Neighbor|"bca"], (edge(b, Neighbor, Weight), \+ member(Neighbor, "ca"), Newcost is 3 + Weight), [[8|"dbca"]])).
+obligation(collected, theory_scoped, findall([Newcost, Neighbor|"ba"], (edge(b, Neighbor, Weight), \+ member(Neighbor, "bca"), Newcost is 4 + Weight), [[9|"dba"]])).
+obligation(collected, theory_scoped, findall([Newcost, Neighbor|"dbca"], (edge(d, Neighbor, Weight), \+ member(Neighbor, "bbca"), Newcost is 8 + Weight), [[10|"edbca"], [14|"fdbca"]])).
+obligation(collected, theory_scoped, findall([Newcost, Neighbor|"dba"], (edge(d, Neighbor, Weight), \+ member(Neighbor, "dbbca"), Newcost is 9 + Weight), [[11|"edba"], [15|"fdba"]])).
+obligation(collected, theory_scoped, findall([Newcost, Neighbor|"dca"], (edge(d, Neighbor, Weight), \+ member(Neighbor, "ddbbca"), Newcost is 10 + Weight), [[12|"edca"], [16|"fdca"]])).
+obligation(collected, theory_scoped, findall([Newcost, Neighbor|"edbca"], (edge(e, Neighbor, Weight), \+ member(Neighbor, "dddbbca"), Newcost is 10 + Weight), [[13|"fedbca"]])).
+obligation(collected, theory_scoped, findall([Newcost, Neighbor|"edba"], (edge(e, Neighbor, Weight), \+ member(Neighbor, "edddbbca"), Newcost is 11 + Weight), [[14|"fedba"]])).
+obligation(collected, theory_scoped, findall([Newcost, Neighbor|"eca"], (edge(e, Neighbor, Weight), \+ member(Neighbor, "eedddbbca"), Newcost is 12 + Weight), [[15|"feca"]])).
+obligation(collected, theory_scoped, findall([Newcost, Neighbor|"edca"], (edge(e, Neighbor, Weight), \+ member(Neighbor, "eeedddbbca"), Newcost is 12 + Weight), [[15|"fedca"]])).
 steps(50).
 verified(15).
 recomputed(23).

package/examples/check/dijkstra.pl

@@ -3,7 +3,23 @@ condition('C2', well_founded, ok, 167).
 condition('C3', justification, ok, 167).
 condition('C4', coverage, ok, 223).
 condition('C5', re_decision, ok, 29).
-obligation(absent, theory_scoped, 17).
+obligation(absent, theory_scoped, \+ member(b, "a")).
+obligation(absent, theory_scoped, \+ member(d, "ba")).
+obligation(absent, theory_scoped, \+ member(e, "dba")).
+obligation(absent, theory_scoped, \+ member(f, "edba")).
+obligation(absent, theory_scoped, \+ member(f, "dba")).
+obligation(absent, theory_scoped, \+ member(c, "a")).
+obligation(absent, theory_scoped, \+ member(d, "ca")).
+obligation(absent, theory_scoped, \+ member(e, "dca")).
+obligation(absent, theory_scoped, \+ member(f, "edca")).
+obligation(absent, theory_scoped, \+ member(f, "dca")).
+obligation(absent, theory_scoped, \+ member(e, "ca")).
+obligation(absent, theory_scoped, \+ member(f, "eca")).
+obligation(absent, theory_scoped, \+ member(b, "ca")).
+obligation(absent, theory_scoped, \+ member(d, "bca")).
+obligation(absent, theory_scoped, \+ member(e, "dbca")).
+obligation(absent, theory_scoped, \+ member(f, "edbca")).
+obligation(absent, theory_scoped, \+ member(f, "dbca")).
 steps(167).
 verified(121).
 recomputed(29).

package/examples/check/dog.pl

@@ -3,7 +3,7 @@ condition('C2', well_founded, ok, 5).
 condition('C3', justification, ok, 5).
 condition('C4', coverage, ok, 5).
 condition('C5', re_decision, ok, 1).
-obligation(builtin, theory_scoped, 1).
+obligation(builtin, theory_scoped, countall(hasDog(alice, _dog), 5)).
 steps(5).
 verified(3).
 recomputed(1).

package/examples/check/donald-gerald-robert.pl

@@ -3,7 +3,7 @@ condition('C2', well_founded, ok, 67).
 condition('C3', justification, ok, 67).
 condition('C4', coverage, ok, 75).
 condition('C5', re_decision, ok, 56).
-obligation(builtin, theory_scoped, 1).
+obligation(builtin, theory_scoped, countall(pandigital_cryptarithm(__anon0), 1)).
 steps(67).
 verified(10).
 recomputed(56).

package/examples/check/enigma1225.pl

@@ -3,7 +3,7 @@ condition('C2', well_founded, ok, 2).
 condition('C3', justification, ok, 2).
 condition('C4', coverage, ok, 2).
 condition('C5', re_decision, ok, 0).
-obligation(builtin, theory_scoped, 1).
+obligation(builtin, theory_scoped, aggregate_max(Key, board(M, Perm), square(8, M, Key, __anon0, Perm), 544, board([[1, 1, 2, 3, 4, 5, 6, 7], [1, 1, 3, 2, 5, 4, 7, 6], [3, 2, 8, 8, 9, 10, 11, 12], [2, 3, 8, 8, 10, 9, 12, 11], [5, 4, 10, 9, 13, 13, 14, 15], [4, 5, 9, 10, 13, 13, 15, 14], [7, 6, 12, 11, 15, 14, 16, 16], [6, 7, 11, 12, 14, 15, 16, 16]], [2, 1, 4, 3, 6, 5, 8, 7]))).
 steps(2).
 verified(1).
 recomputed(0).

package/examples/check/equality-saturation.pl

@@ -3,7 +3,8 @@ condition('C2', well_founded, ok, 9).
 condition('C3', justification, ok, 9).
 condition('C4', coverage, ok, 11).
 condition('C5', re_decision, ok, 0).
-obligation(builtin, theory_scoped, 2).
+obligation(builtin, theory_scoped, aggregate_min([Candidate_cost, Value], Value, (candidate_expression(Value), expr_cost(Value, Candidate_cost)), [3, add(x, 6)], add(x, 6))).
+obligation(builtin, theory_scoped, countall(candidate_expression(__anon2), 32)).
 steps(9).
 verified(7).
 recomputed(0).

package/examples/check/eulerian-path.pl

@@ -3,7 +3,9 @@ condition('C2', well_founded, ok, 84).
 condition('C3', justification, ok, 84).
 condition('C4', coverage, ok, 86).
 condition('C5', re_decision, ok, 6).
-obligation(collected, theory_scoped, 3).
+obligation(collected, theory_scoped, findall(V, odd_degree(V), [])).
+obligation(collected, theory_scoped, findall(V, vertex(V), [v1, v1, v1, v1, v2, v2, v2, v3, v3, v4, v4, v2, v3, v5, v6, v3, v4, v6, v4, v6, v5, v6])).
+obligation(collected, theory_scoped, findall(E, edge(E, _a, _b), [e12, e13, e15, e16, e23, e24, e26, e34, e36, e45, e46])).
 steps(84).
 verified(75).
 recomputed(5).

package/examples/check/evidence-demand-authority.pl

@@ -0,0 +1,14 @@
+condition('C1', resolution, ok, 7).
+condition('C2', well_founded, ok, 9).
+condition('C3', justification, ok, 9).
+condition('C4', coverage, ok, 12).
+condition('C5', re_decision, ok, 0).
+obligation(absent, theory_scoped, \+ may_demand(authority, evidence_of(continued_conditions))).
+obligation(absent, theory_scoped, \+ available_ground).
+steps(9).
+verified(7).
+recomputed(0).
+composed(0).
+trusted(2).
+claims(4).
+verdict(checked_with_obligations).

package/examples/check/explainable-ev-depot-configuration.pl

@@ -3,7 +3,7 @@ condition('C2', well_founded, ok, 54).
 condition('C3', justification, ok, 54).
 condition('C4', coverage, ok, 64).
 condition('C5', re_decision, ok, 11).
-obligation(absent, theory_scoped, 1).
+obligation(absent, theory_scoped, \+ blocker(depot_a, fleet22, __anon0)).
 steps(54).
 verified(42).
 recomputed(11).

package/examples/check/flandor.pl

@@ -3,7 +3,8 @@ condition('C2', well_founded, ok, 105).
 condition('C3', justification, ok, 105).
 condition('C4', coverage, ok, 153).
 condition('C5', re_decision, ok, 6).
-obligation(absent, theory_scoped, 2).
+obligation(absent, theory_scoped, \+ lower_cost_eligible_package(120)).
+obligation(absent, theory_scoped, \+ matches('createdat expiresat insight metric regional_retooling_priority region flanders scopedevice economic-resilience-board scopeevent budget-prep-window suggestionpolicy lowest_cost_package_covering_all_active_needs threshold 3', 'salary|payroll|invoice|medical|firmname')).
 steps(105).
 verified(97).
 recomputed(6).

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

@@ -3,7 +3,8 @@ condition('C2', well_founded, ok, 15).
 condition('C3', justification, ok, 15).
 condition('C4', coverage, ok, 17).
 condition('C5', re_decision, ok, 4).
-obligation(collected, theory_scoped, 2).
+obligation(collected, theory_scoped, findall(Country, valid_assignment(Country), [belgium, netherlands, luxemburg, france, germany, italy, denmark, ireland, greece, spain, portugal, austria, sweden, finland, cyprus, malta, poland, hungary, czech_republic, slovakia, slovenia, estonia, latvia, lithuania, bulgaria, romania, croatia])).
+obligation(collected, theory_scoped, findall([A, B], border_colours_differ(A, B), [[belgium, france], [belgium, netherlands], [belgium, luxemburg], [belgium, germany], [netherlands, germany], [luxemburg, france], [luxemburg, germany], [france, spain], [france, germany], [france, italy], [germany, denmark], [germany, austria], [germany, poland], [germany, czech_republic], [italy, austria], [italy, slovenia], [greece, bulgaria], [spain, portugal], [austria, czech_republic], [austria, hungary], [austria, slovenia], [austria, slovakia], [sweden, finland], [poland, czech_republic], [poland, slovakia], [poland, lithuania], [hungary, slovakia], [hungary, romania], [hungary, croatia], [hungary, slovenia], [czech_republic, slovakia], [slovakia, austria], [slovenia, croatia], [estonia, latvia], [latvia, lithuania], [bulgaria, romania]])).
 steps(15).
 verified(9).
 recomputed(4).

package/examples/check/gdpr-compliance.pl

@@ -3,7 +3,10 @@ condition('C2', well_founded, ok, 28).
 condition('C3', justification, ok, 28).
 condition('C4', coverage, ok, 29).
 condition('C5', re_decision, ok, 0).
-obligation(absent, theory_scoped, 4).
+obligation(absent, theory_scoped, \+ third_country_transfer(case_alpha)).
+obligation(absent, theory_scoped, \+ has_required_basis(case_beta)).
+obligation(absent, theory_scoped, \+ safeguard(case_beta, access_logging)).
+obligation(absent, theory_scoped, \+ adequacy_decision(case_beta)).
 steps(28).
 verified(24).
 recomputed(0).

package/examples/check/graph-reachability.pl

@@ -3,7 +3,13 @@ condition('C2', well_founded, ok, 26).
 condition('C3', justification, ok, 26).
 condition('C4', coverage, ok, 26).
 condition('C5', re_decision, ok, 0).
-obligation(absent, theory_scoped, 7).
+obligation(absent, theory_scoped, \+ member(b, "a")).
+obligation(absent, theory_scoped, \+ member(d, "ba")).
+obligation(absent, theory_scoped, \+ member(f, "dba")).
+obligation(absent, theory_scoped, \+ member(e, "c")).
+obligation(absent, theory_scoped, \+ member(f, "ec")).
+obligation(absent, theory_scoped, \+ member(g, "fec")).
+obligation(absent, theory_scoped, \+ is_reachable(b, e)).
 steps(26).
 verified(19).
 recomputed(0).