tla-ts 0.0.4-dev.a297123 → 0.0.4-dev.e92649a
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/README.md +26 -141
- package/dist/deciders.cjs +366 -0
- package/dist/deciders.js +366 -0
- package/dist/index.cjs +1 -1
- package/dist/index.d.cts +35 -1
- package/dist/index.d.ts +35 -1
- package/dist/index.js +1 -1
- package/dist/parallel-worker.cjs +1 -4
- package/dist/parallel-worker.js +1 -4
- package/dist/prove-worker.cjs +9 -0
- package/dist/prove-worker.d.cts +9 -0
- package/dist/prove-worker.d.ts +9 -0
- package/dist/prove-worker.js +9 -0
- package/dist/prove.cjs +515 -0
- package/dist/prove.js +515 -0
- package/dist/run-cli.cjs +30 -47
- package/dist/run-cli.js +30 -47
- package/dist/tlapm.cjs +10 -0
- package/dist/tlapm.js +10 -0
- package/dist/transfer.cjs +38 -44
- package/dist/transfer.js +38 -44
- package/dist/worker.cjs +21 -0
- package/dist/worker.js +21 -0
- package/package.json +21 -12
- package/src/check.ts +1 -0
- package/src/codegen.ts +5 -3
- package/src/errors.ts +86 -0
- package/src/evaluate.ts +54 -19
- package/src/index.ts +10 -0
- package/src/{obligation-action.ts → obligations/action.ts} +258 -37
- package/src/{obligation-anon.ts → obligations/anon.ts} +13 -7
- package/src/obligations/ctx.ts +64 -0
- package/src/{obligation-deref.ts → obligations/deref.ts} +2 -2
- package/src/{obligation-expression.ts → obligations/expression.ts} +54 -8
- package/src/{obligation-generate.ts → obligations/generate.ts} +134 -61
- package/src/{obligations.ts → obligations/index.ts} +26 -12
- package/src/{obligation-levels.ts → obligations/levels.ts} +12 -2
- package/src/{obligation-module.ts → obligations/module.ts} +46 -20
- package/src/obligations/pickle.ts +100 -0
- package/src/obligations/pragma.ts +189 -0
- package/src/{obligation-printer.ts → obligations/printer.ts} +5 -59
- package/src/{obligation-proof.ts → obligations/proof.ts} +7 -1
- package/src/{obligation-source.ts → obligations/source.ts} +91 -35
- package/src/obligations/temporal.ts +319 -0
- package/src/{obligation-tuples.ts → obligations/tuples.ts} +1 -1
- package/src/parallel-worker.ts +2 -18
- package/src/parallel.ts +10 -43
- package/src/prove/decide-pool.ts +100 -0
- package/src/prove/deciders.ts +27 -0
- package/src/prove/isabelle/LICENSE +36 -0
- package/src/prove/isabelle/LICENSE-tlapm +26 -0
- package/src/prove/isabelle/decide.ts +47 -0
- package/src/prove/isabelle/encode.ts +477 -0
- package/src/prove/isabelle/isar/inner-syntax.ts +579 -0
- package/src/prove/isabelle/isar/method.ts +367 -0
- package/src/prove/isabelle/isar/proof.ts +28 -0
- package/src/prove/isabelle/isar/statement.ts +57 -0
- package/src/prove/isabelle/isar/theory.ts +192 -0
- package/src/prove/isabelle/isar/type-check.ts +278 -0
- package/src/prove/isabelle/provers/blast/blast.ts +258 -0
- package/src/prove/isabelle/provers/blast/branch.ts +322 -0
- package/src/prove/isabelle/provers/blast/prove.ts +347 -0
- package/src/prove/isabelle/provers/blast/rules.ts +330 -0
- package/src/prove/isabelle/provers/blast/state.ts +180 -0
- package/src/prove/isabelle/provers/blast/term.ts +547 -0
- package/src/prove/isabelle/provers/clasimp.ts +150 -0
- package/src/prove/isabelle/provers/classical.ts +389 -0
- package/src/prove/isabelle/provers/hypsubst.ts +441 -0
- package/src/prove/isabelle/pure/bicompose.ts +174 -0
- package/src/prove/isabelle/pure/consts.ts +32 -0
- package/src/prove/isabelle/pure/conv.ts +79 -0
- package/src/prove/isabelle/pure/drule.ts +264 -0
- package/src/prove/isabelle/pure/envir.ts +363 -0
- package/src/prove/isabelle/pure/goal.ts +53 -0
- package/src/prove/isabelle/pure/interrupt.ts +16 -0
- package/src/prove/isabelle/pure/list.ts +12 -0
- package/src/prove/isabelle/pure/logic.ts +402 -0
- package/src/prove/isabelle/pure/name.ts +110 -0
- package/src/prove/isabelle/pure/net.ts +262 -0
- package/src/prove/isabelle/pure/object-logic.ts +41 -0
- package/src/prove/isabelle/pure/pattern.ts +650 -0
- package/src/prove/isabelle/pure/raw-simplifier.ts +353 -0
- package/src/prove/isabelle/pure/rewriter.ts +602 -0
- package/src/prove/isabelle/pure/search.ts +68 -0
- package/src/prove/isabelle/pure/seq.ts +156 -0
- package/src/prove/isabelle/pure/simplifier.ts +112 -0
- package/src/prove/isabelle/pure/table.ts +208 -0
- package/src/prove/isabelle/pure/tactic.ts +276 -0
- package/src/prove/isabelle/pure/tactical.ts +347 -0
- package/src/prove/isabelle/pure/term-ord.ts +159 -0
- package/src/prove/isabelle/pure/term.ts +808 -0
- package/src/prove/isabelle/pure/thm.ts +806 -0
- package/src/prove/isabelle/pure/type.ts +133 -0
- package/src/prove/isabelle/pure/unify.ts +753 -0
- package/src/prove/isabelle/pure/variable.ts +25 -0
- package/src/prove/isabelle/tla/classical-setup.ts +101 -0
- package/src/prove/isabelle/tla/context.ts +74 -0
- package/src/prove/isabelle/tla/logic-data.ts +5 -0
- package/src/prove/isabelle/tla/logic.ts +215 -0
- package/src/prove/isabelle/tla/simpdata.ts +241 -0
- package/src/prove/isabelle/tools/intuitionistic.ts +132 -0
- package/src/prove/ocaml.ts +22 -0
- package/src/prove/prep/action.ts +520 -0
- package/src/prove/prep/defs.ts +27 -0
- package/src/prove/prep/elab.ts +156 -0
- package/src/prove/prep/enabled-axioms.ts +189 -0
- package/src/prove/prep/enabled.ts +43 -0
- package/src/prove/prep/fingerprint.ts +388 -0
- package/src/prove/prep/flatten.ts +70 -0
- package/src/prove/prep/level-comparison.ts +552 -0
- package/src/prove/prep/md5.ts +67 -0
- package/src/prove/prep/pragma.ts +221 -0
- package/src/prove/prep/trivial.ts +22 -0
- package/src/prove/prove-worker.ts +29 -0
- package/src/prove/prove.ts +417 -0
- package/src/prove/ptl/decide.ts +68 -0
- package/src/prove/ptl/encode.ts +256 -0
- package/src/prove/ptl/sat.ts +151 -0
- package/src/prove/ptl/tableau.ts +276 -0
- package/src/prove/smt/axiomatize.ts +69 -0
- package/src/prove/smt/axioms.ts +210 -0
- package/src/prove/smt/context.ts +108 -0
- package/src/prove/smt/data.ts +665 -0
- package/src/prove/smt/encode.ts +169 -0
- package/src/prove/smt/extensionality.ts +63 -0
- package/src/prove/smt/flatten.ts +127 -0
- package/src/prove/smt/format.ts +143 -0
- package/src/prove/smt/instances.ts +182 -0
- package/src/prove/smt/rewrite.ts +784 -0
- package/src/prove/smt/simplify.ts +57 -0
- package/src/prove/smt/solver/act-cache.ts +265 -0
- package/src/prove/smt/solver/arith-rewriter.ts +962 -0
- package/src/prove/smt/solver/array.ts +22 -0
- package/src/prove/smt/solver/asserted-formulas.ts +469 -0
- package/src/prove/smt/solver/ast-lt.ts +157 -0
- package/src/prove/smt/solver/ast-util.ts +147 -0
- package/src/prove/smt/solver/ast.ts +1315 -0
- package/src/prove/smt/solver/auf-solver.ts +572 -0
- package/src/prove/smt/solver/case-split-queue.ts +178 -0
- package/src/prove/smt/solver/cg-table.ts +175 -0
- package/src/prove/smt/solver/clause.ts +276 -0
- package/src/prove/smt/solver/conflict-resolution.ts +343 -0
- package/src/prove/smt/solver/context.ts +1292 -0
- package/src/prove/smt/solver/ctx-simplify.ts +334 -0
- package/src/prove/smt/solver/der.ts +224 -0
- package/src/prove/smt/solver/dyn-ack.ts +141 -0
- package/src/prove/smt/solver/e-matching.ts +659 -0
- package/src/prove/smt/solver/enode.ts +259 -0
- package/src/prove/smt/solver/expr-ref.ts +21 -0
- package/src/prove/smt/solver/expr-safe-replace.ts +172 -0
- package/src/prove/smt/solver/fingerprints.ts +92 -0
- package/src/prove/smt/solver/flat-literals.ts +51 -0
- package/src/prove/smt/solver/goal.ts +138 -0
- package/src/prove/smt/solver/hash.ts +173 -0
- package/src/prove/smt/solver/hashtable.ts +166 -0
- package/src/prove/smt/solver/internalizer.ts +1381 -0
- package/src/prove/smt/solver/lbool.ts +5 -0
- package/src/prove/smt/solver/literal.ts +24 -0
- package/src/prove/smt/solver/lp/bound-propagator.ts +391 -0
- package/src/prove/smt/solver/lp/constraints.ts +78 -0
- package/src/prove/smt/solver/lp/containers.ts +296 -0
- package/src/prove/smt/solver/lp/core-solver.ts +504 -0
- package/src/prove/smt/solver/lp/cross-nested.ts +224 -0
- package/src/prove/smt/solver/lp/dep-intervals.ts +656 -0
- package/src/prove/smt/solver/lp/dependency.ts +51 -0
- package/src/prove/smt/solver/lp/dioph-eq.ts +1181 -0
- package/src/prove/smt/solver/lp/explanation.ts +46 -0
- package/src/prove/smt/solver/lp/gomory.ts +255 -0
- package/src/prove/smt/solver/lp/hnf-cutter.ts +125 -0
- package/src/prove/smt/solver/lp/hnf.ts +281 -0
- package/src/prove/smt/solver/lp/int-cube.ts +295 -0
- package/src/prove/smt/solver/lp/int-solver.ts +514 -0
- package/src/prove/smt/solver/lp/lar-solver.ts +816 -0
- package/src/prove/smt/solver/lp/lar-term.ts +62 -0
- package/src/prove/smt/solver/lp/lp-settings.ts +91 -0
- package/src/prove/smt/solver/lp/maximize-term.ts +347 -0
- package/src/prove/smt/solver/lp/nex-creator.ts +381 -0
- package/src/prove/smt/solver/lp/nex.ts +120 -0
- package/src/prove/smt/solver/lp/nla-backoff.ts +43 -0
- package/src/prove/smt/solver/lp/nla-basics.ts +398 -0
- package/src/prove/smt/solver/lp/nla-core.ts +968 -0
- package/src/prove/smt/solver/lp/nla-divisions.ts +332 -0
- package/src/prove/smt/solver/lp/nla-emonics.ts +373 -0
- package/src/prove/smt/solver/lp/nla-factorization.ts +30 -0
- package/src/prove/smt/solver/lp/nla-grobner.ts +904 -0
- package/src/prove/smt/solver/lp/nla-horner.ts +126 -0
- package/src/prove/smt/solver/lp/nla-intervals.ts +265 -0
- package/src/prove/smt/solver/lp/nla-monomial-bounds.ts +715 -0
- package/src/prove/smt/solver/lp/nla-monotone.ts +59 -0
- package/src/prove/smt/solver/lp/nla-order.ts +307 -0
- package/src/prove/smt/solver/lp/nla-patcher.ts +112 -0
- package/src/prove/smt/solver/lp/nla-tangents.ts +251 -0
- package/src/prove/smt/solver/lp/nla-throttle.ts +85 -0
- package/src/prove/smt/solver/lp/nla-types.ts +124 -0
- package/src/prove/smt/solver/lp/nla-var-eqs.ts +141 -0
- package/src/prove/smt/solver/lp/nra-solver.ts +440 -0
- package/src/prove/smt/solver/lp/numeric-pair.ts +65 -0
- package/src/prove/smt/solver/lp/pdd-interval.ts +31 -0
- package/src/prove/smt/solver/lp/pdd-simplifier.ts +184 -0
- package/src/prove/smt/solver/lp/pdd-solver.ts +408 -0
- package/src/prove/smt/solver/lp/pdd.ts +971 -0
- package/src/prove/smt/solver/lp/random-updater.ts +138 -0
- package/src/prove/smt/solver/lp/static-matrix.ts +246 -0
- package/src/prove/smt/solver/lp/union-find.ts +96 -0
- package/src/prove/smt/solver/mam-compiler.ts +847 -0
- package/src/prove/smt/solver/mam-interpreter.ts +400 -0
- package/src/prove/smt/solver/maximize-ac-sharing.ts +118 -0
- package/src/prove/smt/solver/model-checker.ts +347 -0
- package/src/prove/smt/solver/model-evaluator.ts +262 -0
- package/src/prove/smt/solver/model-finder.ts +155 -0
- package/src/prove/smt/solver/model-generator.ts +97 -0
- package/src/prove/smt/solver/model-macro-solver.ts +728 -0
- package/src/prove/smt/solver/nlsat/algebraic.ts +1161 -0
- package/src/prove/smt/solver/nlsat/atoms.ts +238 -0
- package/src/prove/smt/solver/nlsat/evaluator.ts +303 -0
- package/src/prove/smt/solver/nlsat/explain.ts +607 -0
- package/src/prove/smt/solver/nlsat/interval-set.ts +351 -0
- package/src/prove/smt/solver/nlsat/levelwise.ts +740 -0
- package/src/prove/smt/solver/nlsat/mpbq.ts +161 -0
- package/src/prove/smt/solver/nlsat/polynomial.ts +1722 -0
- package/src/prove/smt/solver/nlsat/solver.ts +911 -0
- package/src/prove/smt/solver/nlsat/types.ts +43 -0
- package/src/prove/smt/solver/nlsat/upolynomial-factorization.ts +648 -0
- package/src/prove/smt/solver/nlsat/upolynomial.ts +996 -0
- package/src/prove/smt/solver/nnf.ts +469 -0
- package/src/prove/smt/solver/pattern-inference.ts +351 -0
- package/src/prove/smt/solver/poly-rewriter.ts +477 -0
- package/src/prove/smt/solver/propagate-values.ts +83 -0
- package/src/prove/smt/solver/proto-model.ts +551 -0
- package/src/prove/smt/solver/pull-quant.ts +139 -0
- package/src/prove/smt/solver/qe-lite-der.ts +526 -0
- package/src/prove/smt/solver/qe-lite-fm.ts +576 -0
- package/src/prove/smt/solver/qe-lite.ts +381 -0
- package/src/prove/smt/solver/qi-queue.ts +362 -0
- package/src/prove/smt/solver/quant-tactics.ts +117 -0
- package/src/prove/smt/solver/quantifier-analyzer.ts +562 -0
- package/src/prove/smt/solver/quantifier-manager.ts +186 -0
- package/src/prove/smt/solver/random-gen.ts +10 -0
- package/src/prove/smt/solver/rational.ts +165 -0
- package/src/prove/smt/solver/ref-vector.ts +62 -0
- package/src/prove/smt/solver/relevancy.ts +247 -0
- package/src/prove/smt/solver/rewriter-tpl.ts +1159 -0
- package/src/prove/smt/solver/rewriter.ts +843 -0
- package/src/prove/smt/solver/rlimit.ts +79 -0
- package/src/prove/smt/solver/smtlib-parser.ts +526 -0
- package/src/prove/smt/solver/solver.ts +71 -0
- package/src/prove/smt/solver/sort.ts +35 -0
- package/src/prove/smt/solver/sticky-generations.ts +69 -0
- package/src/prove/smt/solver/theory-lra-axioms.ts +340 -0
- package/src/prove/smt/solver/theory-lra-bounds.ts +226 -0
- package/src/prove/smt/solver/theory-lra-final-check.ts +252 -0
- package/src/prove/smt/solver/theory-lra-internalize.ts +476 -0
- package/src/prove/smt/solver/theory-lra-model.ts +243 -0
- package/src/prove/smt/solver/theory-lra-propagate.ts +405 -0
- package/src/prove/smt/solver/theory-lra-state.ts +43 -0
- package/src/prove/smt/solver/theory-lra.ts +56 -0
- package/src/prove/smt/solver/var-subst.ts +258 -0
- package/src/prove/smt/solver/z3-license.txt +10 -0
- package/src/prove/smt/table.ts +170 -0
- package/src/prove/tlapm/tlapm.ts +96 -0
- package/src/prove/tlaps-module.ts +510 -0
- package/src/prove/verdict.ts +13 -0
- package/src/prove/zenon/LICENSE +32 -0
- package/src/prove/zenon/check/check.ts +105 -0
- package/src/prove/zenon/check/definitions.ts +144 -0
- package/src/prove/zenon/check/equality.ts +182 -0
- package/src/prove/zenon/check/functions.ts +62 -0
- package/src/prove/zenon/check/keys.ts +125 -0
- package/src/prove/zenon/check/propositional.ts +104 -0
- package/src/prove/zenon/check/records.ts +188 -0
- package/src/prove/zenon/check/relations.ts +121 -0
- package/src/prove/zenon/check/rewrites.ts +224 -0
- package/src/prove/zenon/check/sets.ts +302 -0
- package/src/prove/zenon/check/terms.ts +127 -0
- package/src/prove/zenon/check/tla.ts +126 -0
- package/src/prove/zenon/decide.ts +113 -0
- package/src/prove/zenon/encode.ts +444 -0
- package/src/prove/zenon/eqrel.ts +300 -0
- package/src/prove/zenon/equality-rules.ts +435 -0
- package/src/prove/zenon/expr.ts +551 -0
- package/src/prove/zenon/index-table.ts +350 -0
- package/src/prove/zenon/isar-case.ts +513 -0
- package/src/prove/zenon/isar.ts +1249 -0
- package/src/prove/zenon/limits.ts +15 -0
- package/src/prove/zenon/llproof.ts +173 -0
- package/src/prove/zenon/mltoll.ts +1566 -0
- package/src/prove/zenon/node.ts +297 -0
- package/src/prove/zenon/ocaml.ts +169 -0
- package/src/prove/zenon/parse.ts +247 -0
- package/src/prove/zenon/phrase.ts +191 -0
- package/src/prove/zenon/proof.ts +198 -0
- package/src/prove/zenon/propositional-rules.ts +387 -0
- package/src/prove/zenon/rules.ts +94 -0
- package/src/prove/zenon/search.ts +288 -0
- package/src/prove/zenon/tla/functions.ts +151 -0
- package/src/prove/zenon/tla/llproof.ts +480 -0
- package/src/prove/zenon/tla/records.ts +225 -0
- package/src/prove/zenon/tla/rewrites.ts +447 -0
- package/src/prove/zenon/tla/sets.ts +304 -0
- package/src/prove/zenon/tla/terms.ts +181 -0
- package/src/prove/zenon/tla/tla.ts +506 -0
- package/src/run-cli.ts +73 -20
- package/src/standard-modules.ts +5 -2
- package/src/successors.ts +24 -5
- package/src/tlc-random.ts +55 -32
- package/src/tlc-version.ts +8 -7
- package/src/values.ts +80 -35
- package/src/worker.ts +65 -0
- package/dist/parallel.cjs +0 -12
- package/dist/parallel.js +0 -12
- /package/src/{obligation-format.ts → obligations/format.ts} +0 -0
|
@@ -0,0 +1,15 @@
|
|
|
1
|
+
// When Zenon gives up: past the deadline, a time from Date.now(), or once the signal aborts. tlapm
|
|
2
|
+
// kills Zenon at its deadline whether Zenon is searching or printing the proof, so the search, the
|
|
3
|
+
// checker and the printer each check the limits at every step.
|
|
4
|
+
export interface Limits {
|
|
5
|
+
deadline: number;
|
|
6
|
+
signal: AbortSignal | undefined;
|
|
7
|
+
}
|
|
8
|
+
|
|
9
|
+
// Why the limits stop Zenon now, if they do.
|
|
10
|
+
export const getLimitFailure = (limits: Limits) =>
|
|
11
|
+
Date.now() > limits.deadline
|
|
12
|
+
? "time limit"
|
|
13
|
+
: limits.signal?.aborted === true
|
|
14
|
+
? "aborted"
|
|
15
|
+
: undefined;
|
|
@@ -0,0 +1,173 @@
|
|
|
1
|
+
// Ported from Zenon's llproof.ml, as shipped in tlapm. Copyright 2004 INRIA, see LICENSE.
|
|
2
|
+
//
|
|
3
|
+
// The low-level proofs that Zenon prints: each node's conclusions are the formulas its subproofs
|
|
4
|
+
// leave open, and the proof is a list of lemmas, the theorem last.
|
|
5
|
+
|
|
6
|
+
import { TlaZenonError } from "../../errors";
|
|
7
|
+
import { FALSE, TRUE, type Expr, type Expressions } from "./expr";
|
|
8
|
+
|
|
9
|
+
export type Connective = "and" | "or" | "imply" | "equiv";
|
|
10
|
+
|
|
11
|
+
export type LlRule =
|
|
12
|
+
| { kind: "false" }
|
|
13
|
+
| { kind: "nottrue" }
|
|
14
|
+
| { kind: "axiom"; formula: Expr }
|
|
15
|
+
| { kind: "cut"; formula: Expr }
|
|
16
|
+
| { kind: "noteq"; term: Expr }
|
|
17
|
+
| { kind: "eqsym"; left: Expr; right: Expr }
|
|
18
|
+
| { kind: "notnot"; formula: Expr }
|
|
19
|
+
| { kind: "connect" | "notconnect"; connective: Connective; left: Expr; right: Expr }
|
|
20
|
+
// The quantified formula, and the witness or the term that instantiates it.
|
|
21
|
+
| { kind: "ex" | "all" | "notex" | "notall"; quantified: Expr; term: Expr }
|
|
22
|
+
| { kind: "pnotp"; positive: Expr; negative: Expr }
|
|
23
|
+
| { kind: "notequal"; left: Expr; right: Expr }
|
|
24
|
+
| { kind: "congruencelr" | "congruencerl"; context: Expr; left: Expr; right: Expr }
|
|
25
|
+
| {
|
|
26
|
+
kind: "definition";
|
|
27
|
+
name: string;
|
|
28
|
+
folded: Expr;
|
|
29
|
+
unfolded: Expr;
|
|
30
|
+
}
|
|
31
|
+
| { kind: "extension"; name: string; args: Expr[]; conclusions: Expr[]; branches: Expr[][] }
|
|
32
|
+
| { kind: "lemma"; name: string; args: Expr[] };
|
|
33
|
+
|
|
34
|
+
export interface LlProof {
|
|
35
|
+
conclusions: Expr[];
|
|
36
|
+
rule: LlRule;
|
|
37
|
+
subproofs: LlProof[];
|
|
38
|
+
}
|
|
39
|
+
|
|
40
|
+
// A lemma's parameters pair each free tau or metavariable with its type.
|
|
41
|
+
export interface Lemma {
|
|
42
|
+
name: string;
|
|
43
|
+
params: [string, Expr][];
|
|
44
|
+
proof: LlProof;
|
|
45
|
+
}
|
|
46
|
+
|
|
47
|
+
export const connect = (exprs: Expressions, connective: Connective, left: Expr, right: Expr) =>
|
|
48
|
+
connective === "and"
|
|
49
|
+
? exprs.eand(left, right)
|
|
50
|
+
: connective === "or"
|
|
51
|
+
? exprs.eor(left, right)
|
|
52
|
+
: connective === "imply"
|
|
53
|
+
? exprs.eimply(left, right)
|
|
54
|
+
: exprs.eequiv(left, right);
|
|
55
|
+
|
|
56
|
+
export const getLemma = (lemmas: Map<string, Lemma>, name: string) => {
|
|
57
|
+
const lemma = lemmas.get(name);
|
|
58
|
+
if (lemma === undefined) throw new TlaZenonError(`Zenon: no lemma ${name}`);
|
|
59
|
+
return lemma;
|
|
60
|
+
};
|
|
61
|
+
|
|
62
|
+
const makeLeaf = (conclusions: Expr[], rule: LlRule): LlProof => ({
|
|
63
|
+
conclusions,
|
|
64
|
+
rule,
|
|
65
|
+
subproofs: [],
|
|
66
|
+
});
|
|
67
|
+
|
|
68
|
+
// Zenon's direct_close: a node that closes the conclusions at once, if one does.
|
|
69
|
+
const getDirectClose = (exprs: Expressions, conclusions: Expr[]): LlProof | undefined => {
|
|
70
|
+
for (const [position, formula] of conclusions.entries()) {
|
|
71
|
+
const rest = conclusions.slice(position + 1);
|
|
72
|
+
if (formula.kind === "false") return makeLeaf([formula], { kind: "false" });
|
|
73
|
+
if (formula.kind === "not") {
|
|
74
|
+
const operand = formula.args[0];
|
|
75
|
+
if (operand.kind === "true") return makeLeaf([formula], { kind: "nottrue" });
|
|
76
|
+
if (
|
|
77
|
+
operand.kind === "app" &&
|
|
78
|
+
operand.symbol === "=" &&
|
|
79
|
+
operand.args.length === 2 &&
|
|
80
|
+
operand.args[0] === operand.args[1]
|
|
81
|
+
)
|
|
82
|
+
return makeLeaf([formula], { kind: "noteq", term: operand.args[0] });
|
|
83
|
+
if (rest.includes(operand))
|
|
84
|
+
return makeLeaf([formula, operand], { kind: "axiom", formula: operand });
|
|
85
|
+
continue;
|
|
86
|
+
}
|
|
87
|
+
const negation = exprs.enot(formula);
|
|
88
|
+
if (rest.includes(negation)) return makeLeaf([formula, negation], { kind: "axiom", formula });
|
|
89
|
+
}
|
|
90
|
+
return undefined;
|
|
91
|
+
};
|
|
92
|
+
|
|
93
|
+
// The formulas that a rule takes from its conclusions.
|
|
94
|
+
const getEliminated = (exprs: Expressions, lemmas: Map<string, Lemma>, rule: LlRule): Expr[] => {
|
|
95
|
+
const equal = (left: Expr, right: Expr) => exprs.eapp("=", [left, right]);
|
|
96
|
+
switch (rule.kind) {
|
|
97
|
+
case "false":
|
|
98
|
+
return [FALSE];
|
|
99
|
+
case "nottrue":
|
|
100
|
+
return [exprs.enot(TRUE)];
|
|
101
|
+
case "axiom":
|
|
102
|
+
return [rule.formula, exprs.enot(rule.formula)];
|
|
103
|
+
case "cut":
|
|
104
|
+
return [];
|
|
105
|
+
case "noteq":
|
|
106
|
+
return [exprs.enot(equal(rule.term, rule.term))];
|
|
107
|
+
case "eqsym":
|
|
108
|
+
return [equal(rule.left, rule.right), exprs.enot(equal(rule.right, rule.left))];
|
|
109
|
+
case "notnot":
|
|
110
|
+
return [exprs.enot(exprs.enot(rule.formula))];
|
|
111
|
+
case "connect":
|
|
112
|
+
return [connect(exprs, rule.connective, rule.left, rule.right)];
|
|
113
|
+
case "notconnect":
|
|
114
|
+
return [exprs.enot(connect(exprs, rule.connective, rule.left, rule.right))];
|
|
115
|
+
case "ex":
|
|
116
|
+
case "all":
|
|
117
|
+
return [rule.quantified];
|
|
118
|
+
case "notex":
|
|
119
|
+
case "notall":
|
|
120
|
+
return [exprs.enot(rule.quantified)];
|
|
121
|
+
case "pnotp":
|
|
122
|
+
return [rule.positive, rule.negative];
|
|
123
|
+
case "notequal":
|
|
124
|
+
return [exprs.enot(equal(rule.left, rule.right))];
|
|
125
|
+
case "congruencelr":
|
|
126
|
+
return [exprs.apply(rule.context, rule.left), equal(rule.left, rule.right)];
|
|
127
|
+
case "congruencerl":
|
|
128
|
+
return [exprs.apply(rule.context, rule.left), equal(rule.right, rule.left)];
|
|
129
|
+
case "definition":
|
|
130
|
+
return [rule.folded];
|
|
131
|
+
case "extension":
|
|
132
|
+
return rule.conclusions;
|
|
133
|
+
case "lemma":
|
|
134
|
+
return getLemma(lemmas, rule.name).proof.conclusions;
|
|
135
|
+
}
|
|
136
|
+
};
|
|
137
|
+
|
|
138
|
+
// Zenon's Llproof.optimise: drops the conclusions that no rule uses and the nodes whose subproof
|
|
139
|
+
// already proves their conclusions.
|
|
140
|
+
export const optimise = (exprs: Expressions, proof: Lemma[]): Lemma[] => {
|
|
141
|
+
const lemmas = new Map<string, Lemma>();
|
|
142
|
+
const optimiseTree = (tree: LlProof): LlProof => {
|
|
143
|
+
const subproofs = tree.subproofs.map(optimiseTree);
|
|
144
|
+
const closed = getDirectClose(exprs, tree.conclusions);
|
|
145
|
+
if (closed !== undefined) return closed;
|
|
146
|
+
const useful = new Set([
|
|
147
|
+
...getEliminated(exprs, lemmas, tree.rule),
|
|
148
|
+
...subproofs.flatMap((subproof) => subproof.conclusions),
|
|
149
|
+
]);
|
|
150
|
+
const conclusions = tree.conclusions.filter((formula) => useful.has(formula));
|
|
151
|
+
const subsuming = subproofs.find((subproof) =>
|
|
152
|
+
subproof.conclusions.every((formula) => conclusions.includes(formula)),
|
|
153
|
+
);
|
|
154
|
+
if (subsuming !== undefined) return subsuming;
|
|
155
|
+
return {
|
|
156
|
+
conclusions,
|
|
157
|
+
rule:
|
|
158
|
+
tree.rule.kind === "lemma"
|
|
159
|
+
? {
|
|
160
|
+
kind: "lemma",
|
|
161
|
+
name: tree.rule.name,
|
|
162
|
+
args: getLemma(lemmas, tree.rule.name).params.map((param) => param[1]),
|
|
163
|
+
}
|
|
164
|
+
: tree.rule,
|
|
165
|
+
subproofs,
|
|
166
|
+
};
|
|
167
|
+
};
|
|
168
|
+
return proof.map((lemma) => {
|
|
169
|
+
const optimised = { ...lemma, proof: optimiseTree(lemma.proof) };
|
|
170
|
+
lemmas.set(optimised.name, optimised);
|
|
171
|
+
return optimised;
|
|
172
|
+
});
|
|
173
|
+
};
|