eyeprolog 1.6.15 → 1.6.17

package/bin/eyeprolog.js

@@ -16,6 +16,16 @@ import module from 'node:module';
 // unwanted cache directory simply leaves startup as it was.
 module.enableCompileCache?.();
 
+// Writing into a pipe whose reader has already gone is a normal way for a
+// command line to end -- `eyeprolog --proof p.pl | head`, or a checker that
+// rejects a proof and exits before the producer finishes. Node reports it as
+// an unhandled error event on stdout, which would otherwise turn an ordinary
+// early exit into a crash dump.
+process.stdout.on('error', (error) => {
+  if (error?.code === 'EPIPE') process.exit(0);
+  throw error;
+});
+
 const { main } = await import('../src/cli.js');
 
 await main(process.argv.slice(2)).catch((error) => {

package/examples/check/abstract-interpretation.txt

@@ -0,0 +1,6 @@
+  C1 Resolution    ok             34 step(s) re-performed against the source clause they cite
+  C2 Well-founded  ok             34 step(s) checked for a conclusion resting on its own derivation
+  C3 Justification ok             34 step(s) carrying exactly one known justification
+  C4 Coverage      ok             16 claim(s) and 31 use(s) resolved to a step or to a statement the program gives
+  C5 Re-decision   ok             0 step(s) recomputed against a program holding no clause of the theory
+checked: 34 steps.

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

@@ -0,0 +1,7 @@
+  C1 Resolution    ok             10 step(s) re-performed against the source clause they cite
+  C2 Well-founded  ok             12 step(s) checked for a conclusion resting on its own derivation
+  C3 Justification ok             12 step(s) carrying exactly one known justification
+  C4 Coverage      ok             2 claim(s) and 15 use(s) resolved to a step or to a statement the program gives
+  C5 Re-decision   ok             0 step(s) recomputed against a program holding no clause of the theory
+  -- 2 obligation(s) the check rests on rather than establishes: 2 absent
+checked with obligations: 12 steps, 2 trusted.

package/examples/check/ackermann.txt

@@ -0,0 +1,6 @@
+  C1 Resolution    ok             59 step(s) re-performed against the source clause they cite
+  C2 Well-founded  ok             102 step(s) checked for a conclusion resting on its own derivation
+  C3 Justification ok             102 step(s) carrying exactly one known justification
+  C4 Coverage      ok             12 claim(s) and 123 use(s) resolved to a step or to a statement the program gives
+  C5 Re-decision   ok             43 step(s) recomputed against a program holding no clause of the theory
+checked: 102 steps, 43 recomputed.

package/examples/check/age.txt

@@ -0,0 +1,6 @@
+  C1 Resolution    ok             5 step(s) re-performed against the source clause they cite
+  C2 Well-founded  ok             7 step(s) checked for a conclusion resting on its own derivation
+  C3 Justification ok             7 step(s) carrying exactly one known justification
+  C4 Coverage      ok             2 claim(s) and 6 use(s) resolved to a step or to a statement the program gives
+  C5 Re-decision   ok             2 step(s) recomputed against a program holding no clause of the theory
+checked: 7 steps, 2 recomputed.

package/examples/check/aliases-and-namespaces.txt

@@ -0,0 +1,6 @@
+  C1 Resolution    ok             6 step(s) re-performed against the source clause they cite
+  C2 Well-founded  ok             10 step(s) checked for a conclusion resting on its own derivation
+  C3 Justification ok             10 step(s) carrying exactly one known justification
+  C4 Coverage      ok             5 claim(s) and 5 use(s) resolved to a step or to a statement the program gives
+  C5 Re-decision   ok             4 step(s) recomputed against a program holding no clause of the theory
+checked: 10 steps, 4 recomputed.

package/examples/check/alignment-demo.txt

@@ -0,0 +1,6 @@
+  C1 Resolution    ok             41 step(s) re-performed against the source clause they cite
+  C2 Well-founded  ok             45 step(s) checked for a conclusion resting on its own derivation
+  C3 Justification ok             45 step(s) carrying exactly one known justification
+  C4 Coverage      ok             32 claim(s) and 38 use(s) resolved to a step or to a statement the program gives
+  C5 Re-decision   ok             4 step(s) recomputed against a program holding no clause of the theory
+checked: 45 steps, 4 recomputed.

package/examples/check/allen-interval-calculus.txt

@@ -0,0 +1,6 @@
+  C1 Resolution    ok             276 step(s) re-performed against the source clause they cite
+  C2 Well-founded  ok             316 step(s) checked for a conclusion resting on its own derivation
+  C3 Justification ok             316 step(s) carrying exactly one known justification
+  C4 Coverage      ok             154 claim(s) and 512 use(s) resolved to a step or to a statement the program gives
+  C5 Re-decision   ok             40 step(s) recomputed against a program holding no clause of the theory
+checked: 316 steps, 40 recomputed.

package/examples/check/ancestor.txt

@@ -0,0 +1,6 @@
+  C1 Resolution    ok             9 step(s) re-performed against the source clause they cite
+  C2 Well-founded  ok             9 step(s) checked for a conclusion resting on its own derivation
+  C3 Justification ok             9 step(s) carrying exactly one known justification
+  C4 Coverage      ok             6 claim(s) and 9 use(s) resolved to a step or to a statement the program gives
+  C5 Re-decision   ok             0 step(s) recomputed against a program holding no clause of the theory
+checked: 9 steps.

package/examples/check/animal.txt

@@ -0,0 +1,6 @@
+  C1 Resolution    ok             7 step(s) re-performed against the source clause they cite
+  C2 Well-founded  ok             7 step(s) checked for a conclusion resting on its own derivation
+  C3 Justification ok             7 step(s) carrying exactly one known justification
+  C4 Coverage      ok             4 claim(s) and 5 use(s) resolved to a step or to a statement the program gives
+  C5 Re-decision   ok             0 step(s) recomputed against a program holding no clause of the theory
+checked: 7 steps.

package/examples/check/annotation.txt

@@ -0,0 +1,6 @@
+  C1 Resolution    ok             13 step(s) re-performed against the source clause they cite
+  C2 Well-founded  ok             16 step(s) checked for a conclusion resting on its own derivation
+  C3 Justification ok             16 step(s) carrying exactly one known justification
+  C4 Coverage      ok             4 claim(s) and 16 use(s) resolved to a step or to a statement the program gives
+  C5 Re-decision   ok             3 step(s) recomputed against a program holding no clause of the theory
+checked: 16 steps, 3 recomputed.

package/examples/check/attributed-variables.txt

@@ -0,0 +1,7 @@
+  C1 Resolution    ok             4 step(s) re-performed against the source clause they cite
+  C2 Well-founded  ok             10 step(s) checked for a conclusion resting on its own derivation
+  C3 Justification ok             10 step(s) carrying exactly one known justification
+  C4 Coverage      ok             2 claim(s) and 8 use(s) resolved to a step or to a statement the program gives
+  C5 Re-decision   ok             3 step(s) recomputed against a program holding no clause of the theory
+  -- 3 obligation(s) the check rests on rather than establishes: 3 stateful
+checked with obligations: 10 steps, 3 recomputed, 3 trusted.

package/examples/check/auroracare.txt

@@ -0,0 +1,6 @@
+  C1 Resolution    ok             174 step(s) re-performed against the source clause they cite
+  C2 Well-founded  ok             174 step(s) checked for a conclusion resting on its own derivation
+  C3 Justification ok             174 step(s) carrying exactly one known justification
+  C4 Coverage      ok             117 claim(s) and 156 use(s) resolved to a step or to a statement the program gives
+  C5 Re-decision   ok             0 step(s) recomputed against a program holding no clause of the theory
+checked: 174 steps.

package/examples/check/backward.txt

@@ -0,0 +1,6 @@
+  C1 Resolution    ok             2 step(s) re-performed against the source clause they cite
+  C2 Well-founded  ok             3 step(s) checked for a conclusion resting on its own derivation
+  C3 Justification ok             3 step(s) carrying exactly one known justification
+  C4 Coverage      ok             1 claim(s) and 2 use(s) resolved to a step or to a statement the program gives
+  C5 Re-decision   ok             1 step(s) recomputed against a program holding no clause of the theory
+checked: 3 steps, 1 recomputed.

package/examples/check/basic-monadic.txt

@@ -0,0 +1,6 @@
+  C1 Resolution    ok             1883 step(s) re-performed against the source clause they cite
+  C2 Well-founded  ok             1883 step(s) checked for a conclusion resting on its own derivation
+  C3 Justification ok             1883 step(s) carrying exactly one known justification
+  C4 Coverage      ok             1518 claim(s) and 15180 use(s) resolved to a step or to a statement the program gives
+  C5 Re-decision   ok             0 step(s) recomputed against a program holding no clause of the theory
+checked: 1883 steps.

package/examples/check/bayes-diagnosis.txt

@@ -0,0 +1,6 @@
+  C1 Resolution    ok             30 step(s) re-performed against the source clause they cite
+  C2 Well-founded  ok             30 step(s) checked for a conclusion resting on its own derivation
+  C3 Justification ok             30 step(s) carrying exactly one known justification
+  C4 Coverage      ok             17 claim(s) and 17 use(s) resolved to a step or to a statement the program gives
+  C5 Re-decision   ok             0 step(s) recomputed against a program holding no clause of the theory
+checked: 30 steps.

package/examples/check/bayes-therapy.txt

@@ -0,0 +1,6 @@
+  C1 Resolution    ok             177 step(s) re-performed against the source clause they cite
+  C2 Well-founded  ok             267 step(s) checked for a conclusion resting on its own derivation
+  C3 Justification ok             267 step(s) carrying exactly one known justification
+  C4 Coverage      ok             23 claim(s) and 310 use(s) resolved to a step or to a statement the program gives
+  C5 Re-decision   ok             90 step(s) recomputed against a program holding no clause of the theory
+checked: 267 steps, 90 recomputed.

package/examples/check/beam-deflection.txt

@@ -0,0 +1,6 @@
+  C1 Resolution    ok             12 step(s) re-performed against the source clause they cite
+  C2 Well-founded  ok             19 step(s) checked for a conclusion resting on its own derivation
+  C3 Justification ok             19 step(s) carrying exactly one known justification
+  C4 Coverage      ok             5 claim(s) and 18 use(s) resolved to a step or to a statement the program gives
+  C5 Re-decision   ok             7 step(s) recomputed against a program holding no clause of the theory
+checked: 19 steps, 7 recomputed.

package/examples/check/bench.txt

@@ -0,0 +1,6 @@
+  C1 Resolution    ok             498 step(s) re-performed against the source clause they cite
+  C2 Well-founded  ok             498 step(s) checked for a conclusion resting on its own derivation
+  C3 Justification ok             498 step(s) carrying exactly one known justification
+  C4 Coverage      ok             1 claim(s) and 497 use(s) resolved to a step or to a statement the program gives
+  C5 Re-decision   ok             0 step(s) recomputed against a program holding no clause of the theory
+checked: 498 steps.

package/examples/check/binomial-vandermonde.txt

@@ -0,0 +1,7 @@
+  C1 Resolution    ok             59 step(s) re-performed against the source clause they cite
+  C2 Well-founded  ok             206 step(s) checked for a conclusion resting on its own derivation
+  C3 Justification ok             206 step(s) carrying exactly one known justification
+  C4 Coverage      ok             4 claim(s) and 287 use(s) resolved to a step or to a statement the program gives
+  C5 Re-decision   ok             145 step(s) recomputed against a program holding no clause of the theory
+  -- 2 obligation(s) the check rests on rather than establishes: 2 builtin
+checked with obligations: 206 steps, 145 recomputed, 2 trusted.

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

@@ -0,0 +1,7 @@
+  C1 Resolution    ok             37 step(s) re-performed against the source clause they cite
+  C2 Well-founded  ok             90 step(s) checked for a conclusion resting on its own derivation
+  C3 Justification ok             90 step(s) carrying exactly one known justification
+  C4 Coverage      ok             4 claim(s) and 92 use(s) resolved to a step or to a statement the program gives
+  C5 Re-decision   ok             39 step(s) recomputed against a program holding no clause of the theory
+  -- 14 obligation(s) the check rests on rather than establishes: 1 builtin, 12 absent, 1 collected
+checked with obligations: 90 steps, 39 recomputed, 14 trusted.

package/examples/check/bmi.txt

@@ -0,0 +1,6 @@
+  C1 Resolution    ok             53 step(s) re-performed against the source clause they cite
+  C2 Well-founded  ok             82 step(s) checked for a conclusion resting on its own derivation
+  C3 Justification ok             82 step(s) carrying exactly one known justification
+  C4 Coverage      ok             41 claim(s) and 89 use(s) resolved to a step or to a statement the program gives
+  C5 Re-decision   ok             29 step(s) recomputed against a program holding no clause of the theory
+checked: 82 steps, 29 recomputed.

package/examples/check/braking-safety-worlds.txt

@@ -0,0 +1,6 @@
+  C1 Resolution    ok             55 step(s) re-performed against the source clause they cite
+  C2 Well-founded  ok             101 step(s) checked for a conclusion resting on its own derivation
+  C3 Justification ok             101 step(s) carrying exactly one known justification
+  C4 Coverage      ok             18 claim(s) and 150 use(s) resolved to a step or to a statement the program gives
+  C5 Re-decision   ok             46 step(s) recomputed against a program holding no clause of the theory
+checked: 101 steps, 46 recomputed.

package/examples/check/buck-converter-design.txt

@@ -0,0 +1,6 @@
+  C1 Resolution    ok             19 step(s) re-performed against the source clause they cite
+  C2 Well-founded  ok             30 step(s) checked for a conclusion resting on its own derivation
+  C3 Justification ok             30 step(s) carrying exactly one known justification
+  C4 Coverage      ok             6 claim(s) and 33 use(s) resolved to a step or to a statement the program gives
+  C5 Re-decision   ok             11 step(s) recomputed against a program holding no clause of the theory
+checked: 30 steps, 11 recomputed.

package/examples/check/bulk-stream-write.txt

@@ -0,0 +1,7 @@
+  C1 Resolution    ok             0 step(s) re-performed against the source clause they cite
+  C2 Well-founded  ok             1 step(s) checked for a conclusion resting on its own derivation
+  C3 Justification 1 failure(s)   1 step(s) carrying exactly one known justification
+  C4 Coverage      ok             1 claim(s) and 0 use(s) resolved to a step or to a statement the program gives
+  C5 Re-decision   ok             0 step(s) recomputed against a program holding no clause of the theory
+  [C3] bulk_write_result(5000, 5000) -- recorded as unproven
+1 failure(s).

package/examples/check/cache-performance.txt

@@ -0,0 +1,6 @@
+  C1 Resolution    ok             11 step(s) re-performed against the source clause they cite
+  C2 Well-founded  ok             19 step(s) checked for a conclusion resting on its own derivation
+  C3 Justification ok             19 step(s) carrying exactly one known justification
+  C4 Coverage      ok             4 claim(s) and 21 use(s) resolved to a step or to a statement the program gives
+  C5 Re-decision   ok             8 step(s) recomputed against a program holding no clause of the theory
+checked: 19 steps, 8 recomputed.

package/examples/check/canary-release.txt

@@ -0,0 +1,6 @@
+  C1 Resolution    ok             12 step(s) re-performed against the source clause they cite
+  C2 Well-founded  ok             15 step(s) checked for a conclusion resting on its own derivation
+  C3 Justification ok             15 step(s) carrying exactly one known justification
+  C4 Coverage      ok             5 claim(s) and 14 use(s) resolved to a step or to a statement the program gives
+  C5 Re-decision   ok             3 step(s) recomputed against a program holding no clause of the theory
+checked: 15 steps, 3 recomputed.

package/examples/check/cat-koko.txt

@@ -0,0 +1,6 @@
+  C1 Resolution    ok             6 step(s) re-performed against the source clause they cite
+  C2 Well-founded  ok             7 step(s) checked for a conclusion resting on its own derivation
+  C3 Justification ok             7 step(s) carrying exactly one known justification
+  C4 Coverage      ok             3 claim(s) and 7 use(s) resolved to a step or to a statement the program gives
+  C5 Re-decision   ok             1 step(s) recomputed against a program holding no clause of the theory
+checked: 7 steps, 1 recomputed.

package/examples/check/catalan-convolution.txt

@@ -0,0 +1,7 @@
+  C1 Resolution    ok             7 step(s) re-performed against the source clause they cite
+  C2 Well-founded  ok             15 step(s) checked for a conclusion resting on its own derivation
+  C3 Justification ok             15 step(s) carrying exactly one known justification
+  C4 Coverage      ok             4 claim(s) and 13 use(s) resolved to a step or to a statement the program gives
+  C5 Re-decision   ok             6 step(s) recomputed against a program holding no clause of the theory
+  -- 2 obligation(s) the check rests on rather than establishes: 2 builtin
+checked with obligations: 15 steps, 6 recomputed, 2 trusted.

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

@@ -0,0 +1,7 @@
+  C1 Resolution    ok             15 step(s) re-performed against the source clause they cite
+  C2 Well-founded  ok             17 step(s) checked for a conclusion resting on its own derivation
+  C3 Justification ok             17 step(s) carrying exactly one known justification
+  C4 Coverage      ok             7 claim(s) and 13 use(s) resolved to a step or to a statement the program gives
+  C5 Re-decision   ok             0 step(s) recomputed against a program holding no clause of the theory
+  -- 2 obligation(s) the check rests on rather than establishes: 2 absent
+checked with obligations: 17 steps, 2 trusted.

package/examples/check/chart-parser.txt

@@ -0,0 +1,7 @@
+  C1 Resolution    ok             57 step(s) re-performed against the source clause they cite
+  C2 Well-founded  ok             71 step(s) checked for a conclusion resting on its own derivation
+  C3 Justification ok             71 step(s) carrying exactly one known justification
+  C4 Coverage      ok             6 claim(s) and 86 use(s) resolved to a step or to a statement the program gives
+  C5 Re-decision   ok             10 step(s) recomputed against a program holding no clause of the theory
+  -- 4 obligation(s) the check rests on rather than establishes: 4 builtin
+checked with obligations: 71 steps, 10 recomputed, 4 trusted.

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

@@ -0,0 +1,7 @@
+  C1 Resolution    ok             25 step(s) re-performed against the source clause they cite
+  C2 Well-founded  ok             32 step(s) checked for a conclusion resting on its own derivation
+  C3 Justification ok             32 step(s) carrying exactly one known justification
+  C4 Coverage      ok             9 claim(s) and 29 use(s) resolved to a step or to a statement the program gives
+  C5 Re-decision   ok             4 step(s) recomputed against a program holding no clause of the theory
+  -- 3 obligation(s) the check rests on rather than establishes: 3 absent
+checked with obligations: 32 steps, 4 recomputed, 3 trusted.

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

@@ -0,0 +1,7 @@
+  C1 Resolution    ok             9 step(s) re-performed against the source clause they cite
+  C2 Well-founded  ok             18 step(s) checked for a conclusion resting on its own derivation
+  C3 Justification ok             18 step(s) carrying exactly one known justification
+  C4 Coverage      ok             5 claim(s) and 13 use(s) resolved to a step or to a statement the program gives
+  C5 Re-decision   ok             4 step(s) recomputed against a program holding no clause of the theory
+  -- 5 obligation(s) the check rests on rather than establishes: 5 stateful
+checked with obligations: 18 steps, 4 recomputed, 5 trusted.

package/examples/check/clpb-cardinality.txt

@@ -0,0 +1,7 @@
+  C1 Resolution    ok             5 step(s) re-performed against the source clause they cite
+  C2 Well-founded  ok             10 step(s) checked for a conclusion resting on its own derivation
+  C3 Justification ok             10 step(s) carrying exactly one known justification
+  C4 Coverage      ok             3 claim(s) and 7 use(s) resolved to a step or to a statement the program gives
+  C5 Re-decision   ok             2 step(s) recomputed against a program holding no clause of the theory
+  -- 3 obligation(s) the check rests on rather than establishes: 3 stateful
+checked with obligations: 10 steps, 2 recomputed, 3 trusted.

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

@@ -0,0 +1,7 @@
+  C1 Resolution    ok             9 step(s) re-performed against the source clause they cite
+  C2 Well-founded  ok             18 step(s) checked for a conclusion resting on its own derivation
+  C3 Justification ok             18 step(s) carrying exactly one known justification
+  C4 Coverage      ok             5 claim(s) and 13 use(s) resolved to a step or to a statement the program gives
+  C5 Re-decision   ok             4 step(s) recomputed against a program holding no clause of the theory
+  -- 5 obligation(s) the check rests on rather than establishes: 5 stateful
+checked with obligations: 18 steps, 4 recomputed, 5 trusted.

package/examples/check/clpb-weighted-planning.txt

@@ -0,0 +1,7 @@
+  C1 Resolution    ok             0 step(s) re-performed against the source clause they cite
+  C2 Well-founded  ok             1 step(s) checked for a conclusion resting on its own derivation
+  C3 Justification 1 failure(s)   1 step(s) carrying exactly one known justification
+  C4 Coverage      ok             1 claim(s) and 0 use(s) resolved to a step or to a statement the program gives
+  C5 Re-decision   ok             0 step(s) recomputed against a program holding no clause of the theory
+  [C3] best_release_plan(plan(api(1), cache(0), audit(0), search(1)), 13) -- recorded as unproven
+1 failure(s).

package/examples/check/clpz-factorial.txt

@@ -0,0 +1,6 @@
+  C1 Resolution    ok             7 step(s) re-performed against the source clause they cite
+  C2 Well-founded  ok             25 step(s) checked for a conclusion resting on its own derivation
+  C3 Justification ok             25 step(s) carrying exactly one known justification
+  C4 Coverage      ok             1 claim(s) and 24 use(s) resolved to a step or to a statement the program gives
+  C5 Re-decision   ok             18 step(s) recomputed against a program holding no clause of the theory
+checked: 25 steps, 18 recomputed.

package/examples/check/clpz-global-constraints.txt

@@ -0,0 +1,6 @@
+  C1 Resolution    ok             7 step(s) re-performed against the source clause they cite
+  C2 Well-founded  ok             37 step(s) checked for a conclusion resting on its own derivation
+  C3 Justification ok             37 step(s) carrying exactly one known justification
+  C4 Coverage      ok             7 claim(s) and 31 use(s) resolved to a step or to a statement the program gives
+  C5 Re-decision   ok             30 step(s) recomputed against a program holding no clause of the theory
+checked: 37 steps, 30 recomputed.

package/examples/check/clpz-n-queens.txt

@@ -0,0 +1,6 @@
+  C1 Resolution    ok             76 step(s) re-performed against the source clause they cite
+  C2 Well-founded  ok             174 step(s) checked for a conclusion resting on its own derivation
+  C3 Justification ok             174 step(s) carrying exactly one known justification
+  C4 Coverage      ok             3 claim(s) and 209 use(s) resolved to a step or to a statement the program gives
+  C5 Re-decision   ok             98 step(s) recomputed against a program holding no clause of the theory
+checked: 174 steps, 98 recomputed.

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

@@ -0,0 +1,7 @@
+  C1 Resolution    ok             2 step(s) re-performed against the source clause they cite
+  C2 Well-founded  ok             25 step(s) checked for a conclusion resting on its own derivation
+  C3 Justification 1 failure(s)   25 step(s) carrying exactly one known justification
+  C4 Coverage      ok             3 claim(s) and 24 use(s) resolved to a step or to a statement the program gives
+  C5 Re-decision   ok             22 step(s) recomputed against a program holding no clause of the theory
+  [C3] clpz_example(domain, domain(2, 7, 4, \/('..'(2, 4), 7))) -- recorded as unproven
+1 failure(s).

package/examples/check/clpz-sudoku-9x9.txt

@@ -0,0 +1,6 @@
+  C1 Resolution    ok             219 step(s) re-performed against the source clause they cite
+  C2 Well-founded  ok             257 step(s) checked for a conclusion resting on its own derivation
+  C3 Justification ok             257 step(s) carrying exactly one known justification
+  C4 Coverage      ok             1 claim(s) and 274 use(s) resolved to a step or to a statement the program gives
+  C5 Re-decision   ok             38 step(s) recomputed against a program holding no clause of the theory
+checked: 257 steps, 38 recomputed.

package/examples/check/collatz-1000.txt

@@ -0,0 +1,6 @@
+  C1 Resolution    ok             4228 step(s) re-performed against the source clause they cite
+  C2 Well-founded  ok             13725 step(s) checked for a conclusion resting on its own derivation
+  C3 Justification ok             13725 step(s) carrying exactly one known justification
+  C4 Coverage      ok             1000 claim(s) and 14724 use(s) resolved to a step or to a statement the program gives
+  C5 Re-decision   ok             9497 step(s) recomputed against a program holding no clause of the theory
+checked: 13725 steps, 9497 recomputed.

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

@@ -0,0 +1,7 @@
+  C1 Resolution    ok             3 step(s) re-performed against the source clause they cite
+  C2 Well-founded  ok             6 step(s) checked for a conclusion resting on its own derivation
+  C3 Justification ok             6 step(s) carrying exactly one known justification
+  C4 Coverage      ok             2 claim(s) and 5 use(s) resolved to a step or to a statement the program gives
+  C5 Re-decision   ok             2 step(s) recomputed against a program holding no clause of the theory
+  -- 1 obligation(s) the check rests on rather than establishes: 1 collected
+checked with obligations: 6 steps, 2 recomputed, 1 trusted.

package/examples/check/competitive-enzyme-kinetics.txt

@@ -0,0 +1,6 @@
+  C1 Resolution    ok             18 step(s) re-performed against the source clause they cite
+  C2 Well-founded  ok             29 step(s) checked for a conclusion resting on its own derivation
+  C3 Justification ok             29 step(s) carrying exactly one known justification
+  C4 Coverage      ok             6 claim(s) and 32 use(s) resolved to a step or to a statement the program gives
+  C5 Re-decision   ok             11 step(s) recomputed against a program holding no clause of the theory
+checked: 29 steps, 11 recomputed.

package/examples/check/complex.txt

@@ -0,0 +1,6 @@
+  C1 Resolution    ok             20 step(s) re-performed against the source clause they cite
+  C2 Well-founded  ok             98 step(s) checked for a conclusion resting on its own derivation
+  C3 Justification ok             98 step(s) carrying exactly one known justification
+  C4 Coverage      ok             6 claim(s) and 139 use(s) resolved to a step or to a statement the program gives
+  C5 Re-decision   ok             78 step(s) recomputed against a program holding no clause of the theory
+checked: 98 steps, 78 recomputed.

package/examples/check/composition-of-injective-functions-is-injective.txt

@@ -0,0 +1,6 @@
+  C1 Resolution    ok             16 step(s) re-performed against the source clause they cite
+  C2 Well-founded  ok             19 step(s) checked for a conclusion resting on its own derivation
+  C3 Justification ok             19 step(s) carrying exactly one known justification
+  C4 Coverage      ok             2 claim(s) and 31 use(s) resolved to a step or to a statement the program gives
+  C5 Re-decision   ok             3 step(s) recomputed against a program holding no clause of the theory
+checked: 19 steps, 3 recomputed.

package/examples/check/context-association.txt

@@ -0,0 +1,6 @@
+  C1 Resolution    ok             14 step(s) re-performed against the source clause they cite
+  C2 Well-founded  ok             20 step(s) checked for a conclusion resting on its own derivation
+  C3 Justification ok             20 step(s) carrying exactly one known justification
+  C4 Coverage      ok             3 claim(s) and 17 use(s) resolved to a step or to a statement the program gives
+  C5 Re-decision   ok             6 step(s) recomputed against a program holding no clause of the theory
+checked: 20 steps, 6 recomputed.

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

@@ -0,0 +1,7 @@
+  C1 Resolution    ok             51 step(s) re-performed against the source clause they cite
+  C2 Well-founded  ok             79 step(s) checked for a conclusion resting on its own derivation
+  C3 Justification ok             79 step(s) carrying exactly one known justification
+  C4 Coverage      ok             12 claim(s) and 81 use(s) resolved to a step or to a statement the program gives
+  C5 Re-decision   ok             26 step(s) recomputed against a program holding no clause of the theory
+  -- 2 obligation(s) the check rests on rather than establishes: 2 absent
+checked with obligations: 79 steps, 26 recomputed, 2 trusted.

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

@@ -0,0 +1,7 @@
+  C1 Resolution    ok             21 step(s) re-performed against the source clause they cite
+  C2 Well-founded  ok             124 step(s) checked for a conclusion resting on its own derivation
+  C3 Justification ok             124 step(s) carrying exactly one known justification
+  C4 Coverage      ok             4 claim(s) and 135 use(s) resolved to a step or to a statement the program gives
+  C5 Re-decision   ok             102 step(s) recomputed against a program holding no clause of the theory
+  -- 1 obligation(s) the check rests on rather than establishes: 1 builtin
+checked with obligations: 124 steps, 102 recomputed, 1 trusted.

package/examples/check/control-system.txt

@@ -0,0 +1,6 @@
+  C1 Resolution    ok             16 step(s) re-performed against the source clause they cite
+  C2 Well-founded  ok             30 step(s) checked for a conclusion resting on its own derivation
+  C3 Justification ok             30 step(s) carrying exactly one known justification
+  C4 Coverage      ok             6 claim(s) and 29 use(s) resolved to a step or to a statement the program gives
+  C5 Re-decision   ok             14 step(s) recomputed against a program holding no clause of the theory
+checked: 30 steps, 14 recomputed.

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

@@ -0,0 +1,7 @@
+  C1 Resolution    ok             105 step(s) re-performed against the source clause they cite
+  C2 Well-founded  ok             128 step(s) checked for a conclusion resting on its own derivation
+  C3 Justification ok             128 step(s) carrying exactly one known justification
+  C4 Coverage      ok             19 claim(s) and 167 use(s) resolved to a step or to a statement the program gives
+  C5 Re-decision   ok             11 step(s) recomputed against a program holding no clause of the theory
+  -- 12 obligation(s) the check rests on rather than establishes: 11 builtin, 1 absent
+checked with obligations: 128 steps, 11 recomputed, 12 trusted.

package/examples/check/cross-organization-data-sharing.txt

@@ -0,0 +1,6 @@
+  C1 Resolution    ok             79 step(s) re-performed against the source clause they cite
+  C2 Well-founded  ok             93 step(s) checked for a conclusion resting on its own derivation
+  C3 Justification ok             93 step(s) carrying exactly one known justification
+  C4 Coverage      ok             8 claim(s) and 121 use(s) resolved to a step or to a statement the program gives
+  C5 Re-decision   ok             14 step(s) recomputed against a program holding no clause of the theory
+checked: 93 steps, 14 recomputed.

package/examples/check/cyclic-path.txt

@@ -0,0 +1,6 @@
+  C1 Resolution    ok             20 step(s) re-performed against the source clause they cite
+  C2 Well-founded  ok             20 step(s) checked for a conclusion resting on its own derivation
+  C3 Justification ok             20 step(s) carrying exactly one known justification
+  C4 Coverage      ok             16 claim(s) and 28 use(s) resolved to a step or to a statement the program gives
+  C5 Re-decision   ok             0 step(s) recomputed against a program holding no clause of the theory
+checked: 20 steps.

package/examples/check/d3-group.txt

@@ -0,0 +1,7 @@
+  C1 Resolution    ok             3 step(s) re-performed against the source clause they cite
+  C2 Well-founded  ok             6 step(s) checked for a conclusion resting on its own derivation
+  C3 Justification ok             6 step(s) carrying exactly one known justification
+  C4 Coverage      ok             2 claim(s) and 5 use(s) resolved to a step or to a statement the program gives
+  C5 Re-decision   ok             2 step(s) recomputed against a program holding no clause of the theory
+  -- 1 obligation(s) the check rests on rather than establishes: 1 collected
+checked with obligations: 6 steps, 2 recomputed, 1 trusted.

package/examples/check/dairy-energy-balance.txt

@@ -0,0 +1,6 @@
+  C1 Resolution    ok             41 step(s) re-performed against the source clause they cite
+  C2 Well-founded  ok             74 step(s) checked for a conclusion resting on its own derivation
+  C3 Justification ok             74 step(s) carrying exactly one known justification
+  C4 Coverage      ok             13 claim(s) and 83 use(s) resolved to a step or to a statement the program gives
+  C5 Re-decision   ok             33 step(s) recomputed against a program holding no clause of the theory
+checked: 74 steps, 33 recomputed.

package/examples/check/data-negotiation.txt

@@ -0,0 +1,7 @@
+  C1 Resolution    ok             8 step(s) re-performed against the source clause they cite
+  C2 Well-founded  ok             12 step(s) checked for a conclusion resting on its own derivation
+  C3 Justification ok             12 step(s) carrying exactly one known justification
+  C4 Coverage      ok             1 claim(s) and 13 use(s) resolved to a step or to a statement the program gives
+  C5 Re-decision   ok             3 step(s) recomputed against a program holding no clause of the theory
+  -- 1 obligation(s) the check rests on rather than establishes: 1 absent
+checked with obligations: 12 steps, 3 recomputed, 1 trusted.

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

@@ -0,0 +1,7 @@
+  C1 Resolution    ok             4 step(s) re-performed against the source clause they cite
+  C2 Well-founded  ok             8 step(s) checked for a conclusion resting on its own derivation
+  C3 Justification ok             8 step(s) carrying exactly one known justification
+  C4 Coverage      ok             4 claim(s) and 4 use(s) resolved to a step or to a statement the program gives
+  C5 Re-decision   ok             0 step(s) recomputed against a program holding no clause of the theory
+  -- 4 obligation(s) the check rests on rather than establishes: 3 builtin, 1 absent
+checked with obligations: 8 steps, 4 trusted.

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

@@ -0,0 +1,7 @@
+  C1 Resolution    ok             18 step(s) re-performed against the source clause they cite
+  C2 Well-founded  ok             28 step(s) checked for a conclusion resting on its own derivation
+  C3 Justification ok             28 step(s) carrying exactly one known justification
+  C4 Coverage      ok             5 claim(s) and 23 use(s) resolved to a step or to a statement the program gives
+  C5 Re-decision   ok             4 step(s) recomputed against a program holding no clause of the theory
+  -- 6 obligation(s) the check rests on rather than establishes: 5 builtin, 1 absent
+checked with obligations: 28 steps, 4 recomputed, 6 trusted.

package/examples/check/declarative-fault-localization.txt

@@ -0,0 +1,6 @@
+  C1 Resolution    ok             7 step(s) re-performed against the source clause they cite
+  C2 Well-founded  ok             11 step(s) checked for a conclusion resting on its own derivation
+  C3 Justification ok             11 step(s) carrying exactly one known justification
+  C4 Coverage      ok             1 claim(s) and 12 use(s) resolved to a step or to a statement the program gives
+  C5 Re-decision   ok             4 step(s) recomputed against a program holding no clause of the theory
+checked: 11 steps, 4 recomputed.

package/examples/check/deep-taxonomy-10.txt

@@ -0,0 +1,7 @@
+  C1 Resolution    ok             32 step(s) re-performed against the source clause they cite
+  C2 Well-founded  ok             49 step(s) checked for a conclusion resting on its own derivation
+  C3 Justification ok             49 step(s) carrying exactly one known justification
+  C4 Coverage      ok             16 claim(s) and 62 use(s) resolved to a step or to a statement the program gives
+  C5 Re-decision   ok             0 step(s) recomputed against a program holding no clause of the theory
+  -- 17 obligation(s) the check rests on rather than establishes: 17 builtin
+checked with obligations: 49 steps, 17 trusted.

package/examples/check/deep-taxonomy-100.txt

@@ -0,0 +1,7 @@
+  C1 Resolution    ok             122 step(s) re-performed against the source clause they cite
+  C2 Well-founded  ok             139 step(s) checked for a conclusion resting on its own derivation
+  C3 Justification ok             139 step(s) carrying exactly one known justification
+  C4 Coverage      ok             16 claim(s) and 152 use(s) resolved to a step or to a statement the program gives
+  C5 Re-decision   ok             0 step(s) recomputed against a program holding no clause of the theory
+  -- 17 obligation(s) the check rests on rather than establishes: 17 builtin
+checked with obligations: 139 steps, 17 trusted.

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

@@ -0,0 +1,7 @@
+  C1 Resolution    ok             20 step(s) re-performed against the source clause they cite
+  C2 Well-founded  ok             37 step(s) checked for a conclusion resting on its own derivation
+  C3 Justification ok             37 step(s) carrying exactly one known justification
+  C4 Coverage      ok             16 claim(s) and 44 use(s) resolved to a step or to a statement the program gives
+  C5 Re-decision   ok             0 step(s) recomputed against a program holding no clause of the theory
+  -- 17 obligation(s) the check rests on rather than establishes: 17 builtin
+checked with obligations: 37 steps, 17 trusted.

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

@@ -0,0 +1,7 @@
+  C1 Resolution    ok             20 step(s) re-performed against the source clause they cite
+  C2 Well-founded  ok             37 step(s) checked for a conclusion resting on its own derivation
+  C3 Justification ok             37 step(s) carrying exactly one known justification
+  C4 Coverage      ok             16 claim(s) and 44 use(s) resolved to a step or to a statement the program gives
+  C5 Re-decision   ok             0 step(s) recomputed against a program holding no clause of the theory
+  -- 17 obligation(s) the check rests on rather than establishes: 17 builtin
+checked with obligations: 37 steps, 17 trusted.

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

@@ -0,0 +1,7 @@
+  C1 Resolution    ok             20 step(s) re-performed against the source clause they cite
+  C2 Well-founded  ok             37 step(s) checked for a conclusion resting on its own derivation
+  C3 Justification ok             37 step(s) carrying exactly one known justification
+  C4 Coverage      ok             16 claim(s) and 44 use(s) resolved to a step or to a statement the program gives
+  C5 Re-decision   ok             0 step(s) recomputed against a program holding no clause of the theory
+  -- 17 obligation(s) the check rests on rather than establishes: 17 builtin
+checked with obligations: 37 steps, 17 trusted.

package/examples/check/defeasible-reasoning.txt

@@ -0,0 +1,7 @@
+  C1 Resolution    ok             9 step(s) re-performed against the source clause they cite
+  C2 Well-founded  ok             14 step(s) checked for a conclusion resting on its own derivation
+  C3 Justification ok             14 step(s) carrying exactly one known justification
+  C4 Coverage      ok             6 claim(s) and 8 use(s) resolved to a step or to a statement the program gives
+  C5 Re-decision   ok             0 step(s) recomputed against a program holding no clause of the theory
+  -- 5 obligation(s) the check rests on rather than establishes: 5 builtin
+checked with obligations: 14 steps, 5 trusted.

package/examples/check/delfour.txt

@@ -0,0 +1,7 @@
+  C1 Resolution    ok             243 step(s) re-performed against the source clause they cite
+  C2 Well-founded  ok             295 step(s) checked for a conclusion resting on its own derivation
+  C3 Justification ok             295 step(s) carrying exactly one known justification
+  C4 Coverage      ok             31 claim(s) and 323 use(s) resolved to a step or to a statement the program gives
+  C5 Re-decision   ok             50 step(s) recomputed against a program holding no clause of the theory
+  -- 2 obligation(s) the check rests on rather than establishes: 2 absent
+checked with obligations: 295 steps, 50 recomputed, 2 trusted.

package/examples/check/deontic-logic.txt

@@ -0,0 +1,6 @@
+  C1 Resolution    ok             12 step(s) re-performed against the source clause they cite
+  C2 Well-founded  ok             12 step(s) checked for a conclusion resting on its own derivation
+  C3 Justification ok             12 step(s) carrying exactly one known justification
+  C4 Coverage      ok             4 claim(s) and 11 use(s) resolved to a step or to a statement the program gives
+  C5 Re-decision   ok             0 step(s) recomputed against a program holding no clause of the theory
+checked: 12 steps.