tla-ts 0.0.9 → 0.0.10-dev.094b9b512
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 +30 -1
- package/dist/compile.cjs +23 -0
- package/dist/compile.js +23 -0
- package/dist/deciders.cjs +40 -37
- package/dist/deciders.js +47 -44
- package/dist/index.cjs +1 -1
- package/dist/index.d.cts +106 -10
- package/dist/index.d.ts +106 -10
- package/dist/index.js +1 -1
- package/dist/parallel-worker.cjs +1 -1
- package/dist/parallel-worker.js +1 -1
- package/dist/prove-worker.cjs +1 -1
- package/dist/prove-worker.js +1 -1
- package/dist/prove.cjs +2658 -410
- package/dist/prove.js +2657 -409
- package/dist/run.cjs +144 -31
- package/dist/run.js +144 -31
- package/dist/tlapm.cjs +2 -2
- package/dist/tlapm.js +2 -2
- package/dist/transfer.cjs +129 -104
- package/dist/transfer.js +129 -104
- package/dist/worker.cjs +6 -6
- package/dist/worker.js +6 -6
- package/package.json +3 -1
- package/src/ast.ts +48 -62
- package/src/bags.ts +99 -102
- package/src/builtins.ts +28 -75
- package/src/bundled-modules.ts +1 -8
- package/src/check-failure.ts +116 -0
- package/src/check-trace.ts +282 -0
- package/src/check.ts +599 -754
- package/src/cli/options.ts +12 -32
- package/src/cli/run.ts +0 -2
- package/src/cli/runtime-invariants.ts +136 -0
- package/src/cli/shared.ts +19 -12
- package/src/cli/tlapm.ts +208 -54
- package/src/cli/tlc-arguments.ts +652 -0
- package/src/cli/tlc-output.ts +687 -0
- package/src/cli/tlc-usage.ts +361 -0
- package/src/cli/tlc.ts +309 -658
- package/src/cli/typescript.ts +23 -0
- package/src/cli/xml-exporter.ts +27 -49
- package/src/cli.ts +0 -1
- package/src/codegen.ts +196 -74
- package/src/config.ts +140 -109
- package/src/coverage.ts +830 -0
- package/src/dependencies.ts +14 -53
- package/src/dfid.ts +618 -0
- package/src/environment-config.ts +315 -0
- package/src/environment.ts +169 -335
- package/src/errors.ts +100 -57
- package/src/evaluate.ts +598 -340
- package/src/exit-codes.ts +37 -3
- package/src/fingerprints.ts +75 -11
- package/src/index.ts +3 -0
- package/src/instances.ts +126 -21
- package/src/java-hash.ts +7 -0
- package/src/java-overrides.ts +4 -19
- package/src/json-reader.ts +455 -0
- package/src/json.ts +252 -139
- package/src/levels.ts +46 -58
- package/src/lexer.ts +83 -101
- package/src/liveness-checker.ts +103 -153
- package/src/liveness.ts +150 -109
- package/src/obligations/action.ts +18 -43
- package/src/obligations/anonymize.ts +119 -90
- package/src/obligations/enabled-axioms.ts +218 -0
- package/src/obligations/equality.ts +2 -2
- package/src/obligations/expression.ts +38 -25
- package/src/obligations/format.ts +1 -9
- package/src/obligations/generate.ts +67 -63
- package/src/obligations/index.ts +38 -20
- package/src/obligations/levels.ts +28 -17
- package/src/obligations/module.ts +29 -54
- package/src/obligations/normalize.ts +31 -36
- package/src/obligations/operators.ts +1 -2
- package/src/obligations/pragma.ts +53 -25
- package/src/obligations/printer.ts +90 -57
- package/src/obligations/proof.ts +4 -5
- package/src/obligations/regroup.ts +1 -4
- package/src/obligations/simplify.ts +58 -62
- package/src/obligations/source.ts +119 -95
- package/src/obligations/subexpression.ts +51 -27
- package/src/obligations/substitution.ts +2 -4
- package/src/obligations/temporal.ts +13 -19
- package/src/obligations/tuples.ts +3 -9
- package/src/parallel-worker.ts +30 -60
- package/src/parallel.ts +57 -71
- package/src/parser.ts +961 -387
- package/src/pcal/ast.ts +53 -86
- package/src/pcal/parse.ts +144 -219
- package/src/pcal/tokenize.ts +91 -131
- package/src/pcal/translate.ts +83 -130
- package/src/pcal/validate.ts +48 -68
- package/src/pretty-print.ts +7 -8
- package/src/prover/decide-pool.ts +8 -13
- package/src/prover/deciders.ts +19 -13
- package/src/prover/first-order.ts +0 -11
- package/src/prover/isabelle/decide.ts +3 -31
- package/src/prover/isabelle/encode.ts +82 -62
- package/src/prover/isabelle/isar/attrib.ts +219 -0
- package/src/prover/isabelle/isar/context.ts +336 -0
- package/src/prover/isabelle/isar/induct.ts +392 -0
- package/src/prover/isabelle/isar/inner-syntax.ts +262 -117
- package/src/prover/isabelle/isar/method.ts +513 -225
- package/src/prover/isabelle/isar/proof.ts +569 -23
- package/src/prover/isabelle/isar/rule-cases.ts +234 -0
- package/src/prover/isabelle/isar/theory.ts +490 -89
- package/src/prover/isabelle/isar/toplevel.ts +341 -0
- package/src/prover/isabelle/isar/type-check.ts +100 -37
- package/src/prover/isabelle/provers/blast/blast.ts +17 -104
- package/src/prover/isabelle/provers/blast/branch.ts +1 -32
- package/src/prover/isabelle/provers/blast/prove.ts +1 -35
- package/src/prover/isabelle/provers/blast/rules.ts +6 -44
- package/src/prover/isabelle/provers/blast/state.ts +2 -28
- package/src/prover/isabelle/provers/blast/term.ts +9 -36
- package/src/prover/isabelle/provers/clasimp.ts +1 -13
- package/src/prover/isabelle/provers/classical.ts +59 -60
- package/src/prover/isabelle/provers/hypsubst.ts +28 -51
- package/src/prover/isabelle/pure/bicompose.ts +25 -38
- package/src/prover/isabelle/pure/consts.ts +1 -7
- package/src/prover/isabelle/pure/conv.ts +3 -17
- package/src/prover/isabelle/pure/drule.ts +96 -44
- package/src/prover/isabelle/pure/envir.ts +3 -52
- package/src/prover/isabelle/pure/goal.ts +2 -8
- package/src/prover/isabelle/pure/interrupt.ts +0 -5
- package/src/prover/isabelle/pure/list.ts +0 -3
- package/src/prover/isabelle/pure/logic.ts +2 -15
- package/src/prover/isabelle/pure/name.ts +2 -9
- package/src/prover/isabelle/pure/net.ts +3 -59
- package/src/prover/isabelle/pure/object-logic.ts +16 -15
- package/src/prover/isabelle/pure/pattern.ts +2 -19
- package/src/prover/isabelle/pure/raw-simplifier.ts +17 -62
- package/src/prover/isabelle/pure/rewriter.ts +32 -73
- package/src/prover/isabelle/pure/search.ts +3 -10
- package/src/prover/isabelle/pure/seq.ts +1 -10
- package/src/prover/isabelle/pure/simplifier.ts +28 -15
- package/src/prover/isabelle/pure/table.ts +3 -32
- package/src/prover/isabelle/pure/tactic.ts +12 -22
- package/src/prover/isabelle/pure/tactical.ts +48 -47
- package/src/prover/isabelle/pure/term-ord.ts +2 -6
- package/src/prover/isabelle/pure/term.ts +2 -43
- package/src/prover/isabelle/pure/thm.ts +27 -47
- package/src/prover/isabelle/pure/type.ts +2 -15
- package/src/prover/isabelle/pure/unify.ts +20 -30
- package/src/prover/isabelle/pure/variable.ts +3 -7
- package/src/prover/isabelle/tla/classical-setup.ts +18 -24
- package/src/prover/isabelle/tla/context.ts +65 -26
- package/src/prover/isabelle/tla/logic-data.ts +1 -1
- package/src/prover/isabelle/tla/logic.ts +53 -32
- package/src/prover/isabelle/tla/simpdata.ts +46 -43
- package/src/prover/isabelle/tools/intuitionistic.ts +29 -20
- package/src/prover/ocaml.ts +0 -6
- package/src/prover/prep/action.ts +32 -66
- package/src/prover/prep/enabled-axioms.ts +22 -20
- package/src/prover/prep/fingerprint.ts +2 -21
- package/src/prover/prep/level-comparison.ts +8 -12
- package/src/prover/prep/md5.ts +0 -2
- package/src/prover/prep/methods.ts +137 -83
- package/src/prover/prep/normalize.ts +38 -36
- package/src/prover/prove-worker.ts +0 -2
- package/src/prover/prove.ts +371 -132
- package/src/prover/ptl/decide.ts +104 -44
- package/src/prover/ptl/encode.ts +15 -38
- package/src/prover/ptl/sat.ts +24 -32
- package/src/prover/ptl/tableau.ts +40 -28
- package/src/prover/smt/arithmetic.ts +310 -0
- package/src/prover/smt/axioms.ts +12 -15
- package/src/prover/smt/context.ts +61 -29
- package/src/prover/smt/data.ts +497 -387
- package/src/prover/smt/encode.ts +156 -85
- package/src/prover/smt/extensionality.ts +5 -13
- package/src/prover/smt/flatten.ts +7 -28
- package/src/prover/smt/format.ts +33 -14
- package/src/prover/smt/instances.ts +7 -11
- package/src/prover/smt/layout.ts +91 -0
- package/src/prover/smt/rewrite.ts +1025 -658
- package/src/prover/smt/simplify.ts +441 -0
- package/src/prover/smt/solver/ackermannize-bv-tactic.ts +63 -0
- package/src/prover/smt/solver/ackr-helper.ts +182 -0
- package/src/prover/smt/solver/ackr-model-converter.ts +112 -0
- package/src/prover/smt/solver/act-cache.ts +0 -15
- package/src/prover/smt/solver/add-bounds-tactic.ts +60 -0
- package/src/prover/smt/solver/aig-tactic.ts +43 -0
- package/src/prover/smt/solver/aig.ts +890 -0
- package/src/prover/smt/solver/arith-rewriter.ts +613 -48
- package/src/prover/smt/solver/arith-terms.ts +123 -0
- package/src/prover/smt/solver/array-decl-plugin.ts +176 -0
- package/src/prover/smt/solver/array-rewriter.ts +312 -0
- package/src/prover/smt/solver/array.ts +1 -3
- package/src/prover/smt/solver/asserted-formulas.ts +87 -57
- package/src/prover/smt/solver/ast-lt.ts +166 -21
- package/src/prover/smt/solver/ast-util.ts +161 -7
- package/src/prover/smt/solver/ast.ts +1466 -178
- package/src/prover/smt/solver/auf-solver.ts +8 -44
- package/src/prover/smt/solver/bit-blast-tactic.ts +591 -0
- package/src/prover/smt/solver/bit-blaster.ts +874 -0
- package/src/prover/smt/solver/bound-manager.ts +186 -0
- package/src/prover/smt/solver/bound-simplifier.ts +602 -0
- package/src/prover/smt/solver/bv-bound-chk.ts +500 -0
- package/src/prover/smt/solver/bv-decl-plugin.ts +339 -0
- package/src/prover/smt/solver/bv-divrem-bounds.ts +97 -0
- package/src/prover/smt/solver/bv-rewriter.ts +1905 -0
- package/src/prover/smt/solver/bv1-blast.ts +224 -0
- package/src/prover/smt/solver/bv2fpa-converter.ts +175 -0
- package/src/prover/smt/solver/bv2int-rewriter.ts +545 -0
- package/src/prover/smt/solver/bv2real-rewriter.ts +534 -0
- package/src/prover/smt/solver/card2bv.ts +112 -0
- package/src/prover/smt/solver/case-split-queue.ts +1 -9
- package/src/prover/smt/solver/cg-table.ts +28 -34
- package/src/prover/smt/solver/check-logic.ts +326 -0
- package/src/prover/smt/solver/clause.ts +1 -27
- package/src/prover/smt/solver/cofactor-elim-term-ite.ts +280 -0
- package/src/prover/smt/solver/conflict-resolution.ts +79 -12
- package/src/prover/smt/solver/context.ts +510 -175
- package/src/prover/smt/solver/ctx-simplify.ts +34 -50
- package/src/prover/smt/solver/ctx-solver-simplify.ts +124 -0
- package/src/prover/smt/solver/datatype-decl-plugin.ts +575 -0
- package/src/prover/smt/solver/datatype-rewriter.ts +83 -0
- package/src/prover/smt/solver/demodulator.ts +789 -0
- package/src/prover/smt/solver/dependent-expr-state.ts +68 -0
- package/src/prover/smt/solver/der.ts +40 -30
- package/src/prover/smt/solver/diff-neq.ts +207 -0
- package/src/prover/smt/solver/distribute-forall.ts +67 -0
- package/src/prover/smt/solver/dom-simplify.ts +513 -0
- package/src/prover/smt/solver/dt2bv-tactic.ts +267 -0
- package/src/prover/smt/solver/dyn-ack.ts +1 -11
- package/src/prover/smt/solver/e-matching.ts +4 -35
- package/src/prover/smt/solver/elim-small-bv-tactic.ts +130 -0
- package/src/prover/smt/solver/elim-uncnstr.ts +558 -0
- package/src/prover/smt/solver/enode.ts +93 -22
- package/src/prover/smt/solver/eq2bv-tactic.ts +219 -0
- package/src/prover/smt/solver/euf/arith-axioms.ts +404 -0
- package/src/prover/smt/solver/euf/arith-internalize.ts +659 -0
- package/src/prover/smt/solver/euf/arith-solver.ts +895 -0
- package/src/prover/smt/solver/euf/array-axioms.ts +528 -0
- package/src/prover/smt/solver/euf/array-internalize.ts +419 -0
- package/src/prover/smt/solver/euf/array-solver.ts +308 -0
- package/src/prover/smt/solver/euf/bv-ackerman.ts +164 -0
- package/src/prover/smt/solver/euf/bv-internalize.ts +750 -0
- package/src/prover/smt/solver/euf/bv-solver.ts +451 -0
- package/src/prover/smt/solver/euf/dt-solver.ts +620 -0
- package/src/prover/smt/solver/euf/egraph.ts +885 -0
- package/src/prover/smt/solver/euf/euf-solver.ts +1203 -0
- package/src/prover/smt/solver/euf/fpa-solver.ts +333 -0
- package/src/prover/smt/solver/euf/mam.ts +1094 -0
- package/src/prover/smt/solver/euf/q-ematch.ts +900 -0
- package/src/prover/smt/solver/euf/q-mbi.ts +587 -0
- package/src/prover/smt/solver/euf/q-model-fixer.ts +299 -0
- package/src/prover/smt/solver/euf/q-solver.ts +361 -0
- package/src/prover/smt/solver/euf/th-solver.ts +343 -0
- package/src/prover/smt/solver/euf/th-solvers.ts +31 -0
- package/src/prover/smt/solver/expr-ref.ts +1 -5
- package/src/prover/smt/solver/expr-safe-replace.ts +26 -6
- package/src/prover/smt/solver/expr2polynomial.ts +147 -0
- package/src/prover/smt/solver/factor.ts +152 -0
- package/src/prover/smt/solver/fd-solver.ts +269 -0
- package/src/prover/smt/solver/fingerprints.ts +16 -26
- package/src/prover/smt/solver/fix-dl-var.ts +149 -0
- package/src/prover/smt/solver/flat-literals.ts +1 -9
- package/src/prover/smt/solver/fm-tactic.ts +873 -0
- package/src/prover/smt/solver/fpa-decl-plugin.ts +619 -0
- package/src/prover/smt/solver/fpa-rewriter.ts +641 -0
- package/src/prover/smt/solver/fpa2bv-converter.ts +2246 -0
- package/src/prover/smt/solver/fpa2bv-rewriter.ts +349 -0
- package/src/prover/smt/solver/fpa2bv-tactic.ts +75 -0
- package/src/prover/smt/solver/goal.ts +177 -28
- package/src/prover/smt/solver/goal2nlsat.ts +191 -0
- package/src/prover/smt/solver/guard-set.ts +220 -0
- package/src/prover/smt/solver/hash.ts +0 -8
- package/src/prover/smt/solver/hashtable.ts +27 -23
- package/src/prover/smt/solver/inf-eps.ts +64 -0
- package/src/prover/smt/solver/inj-axiom.ts +102 -0
- package/src/prover/smt/solver/internalizer.ts +72 -130
- package/src/prover/smt/solver/lackr.ts +383 -0
- package/src/prover/smt/solver/lbool.ts +1 -2
- package/src/prover/smt/solver/lia2card.ts +269 -0
- package/src/prover/smt/solver/lia2pb.ts +141 -0
- package/src/prover/smt/solver/literal.ts +0 -3
- package/src/prover/smt/solver/logic-tactics.ts +349 -0
- package/src/prover/smt/solver/lp/bound-propagator.ts +8 -26
- package/src/prover/smt/solver/lp/constraints.ts +2 -8
- package/src/prover/smt/solver/lp/containers.ts +12 -30
- package/src/prover/smt/solver/lp/core-solver.ts +24 -27
- package/src/prover/smt/solver/lp/cross-nested.ts +6 -20
- package/src/prover/smt/solver/lp/dep-intervals.ts +7 -22
- package/src/prover/smt/solver/lp/dependency.ts +1 -4
- package/src/prover/smt/solver/lp/dioph-eq.ts +9 -102
- package/src/prover/smt/solver/lp/explanation.ts +1 -6
- package/src/prover/smt/solver/lp/gomory.ts +9 -22
- package/src/prover/smt/solver/lp/hnf-cutter.ts +17 -23
- package/src/prover/smt/solver/lp/hnf.ts +11 -26
- package/src/prover/smt/solver/lp/int-cube.ts +18 -39
- package/src/prover/smt/solver/lp/int-solver.ts +4 -34
- package/src/prover/smt/solver/lp/lar-solver.ts +70 -82
- package/src/prover/smt/solver/lp/lar-term.ts +1 -5
- package/src/prover/smt/solver/lp/lp-settings.ts +1 -14
- package/src/prover/smt/solver/lp/maximize-term.ts +79 -52
- package/src/prover/smt/solver/lp/nex-creator.ts +5 -28
- package/src/prover/smt/solver/lp/nex.ts +1 -6
- package/src/prover/smt/solver/lp/nla-backoff.ts +1 -4
- package/src/prover/smt/solver/lp/nla-basics.ts +5 -30
- package/src/prover/smt/solver/lp/nla-core.ts +69 -132
- package/src/prover/smt/solver/lp/nla-divisions.ts +32 -42
- package/src/prover/smt/solver/lp/nla-emonics.ts +4 -21
- package/src/prover/smt/solver/lp/nla-factorization.ts +1 -4
- package/src/prover/smt/solver/lp/nla-grobner.ts +24 -72
- package/src/prover/smt/solver/lp/nla-horner.ts +3 -11
- package/src/prover/smt/solver/lp/nla-intervals.ts +2 -12
- package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +16 -41
- package/src/prover/smt/solver/lp/nla-monotone.ts +2 -6
- package/src/prover/smt/solver/lp/nla-order.ts +2 -13
- package/src/prover/smt/solver/lp/nla-patcher.ts +4 -7
- package/src/prover/smt/solver/lp/nla-powers.ts +184 -0
- package/src/prover/smt/solver/lp/nla-tangents.ts +1 -9
- package/src/prover/smt/solver/lp/nla-throttle.ts +1 -6
- package/src/prover/smt/solver/lp/nla-transcendentals.ts +293 -0
- package/src/prover/smt/solver/lp/nla-types.ts +1 -11
- package/src/prover/smt/solver/lp/nla-var-eqs.ts +4 -25
- package/src/prover/smt/solver/lp/nra-solver.ts +30 -54
- package/src/prover/smt/solver/lp/numeric-pair.ts +1 -4
- package/src/prover/smt/solver/lp/pdd-interval.ts +1 -3
- package/src/prover/smt/solver/lp/pdd-simplifier.ts +2 -14
- package/src/prover/smt/solver/lp/pdd-solver.ts +4 -33
- package/src/prover/smt/solver/lp/pdd.ts +7 -70
- package/src/prover/smt/solver/lp/random-updater.ts +1 -8
- package/src/prover/smt/solver/lp/static-matrix.ts +9 -19
- package/src/prover/smt/solver/lp/union-find.ts +6 -5
- package/src/prover/smt/solver/macro-finder.ts +533 -0
- package/src/prover/smt/solver/mam-compiler.ts +117 -126
- package/src/prover/smt/solver/mam-interpreter.ts +1 -21
- package/src/prover/smt/solver/max-bv-sharing-tactic.ts +29 -0
- package/src/prover/smt/solver/max-cliques.ts +107 -0
- package/src/prover/smt/solver/maxcore.ts +318 -0
- package/src/prover/smt/solver/maximize-ac-sharing.ts +9 -20
- package/src/prover/smt/solver/maxlex.ts +123 -0
- package/src/prover/smt/solver/maxsmt-base.ts +99 -0
- package/src/prover/smt/solver/maxsmt.ts +93 -0
- package/src/prover/smt/solver/mbp/mbp-arith.ts +477 -0
- package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +102 -0
- package/src/prover/smt/solver/mbp/mbp-plugin.ts +280 -0
- package/src/prover/smt/solver/mbp/mbp-qel.ts +49 -0
- package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +280 -0
- package/src/prover/smt/solver/mbp/mbp-term-graph.ts +624 -0
- package/src/prover/smt/solver/model-based-opt.ts +845 -0
- package/src/prover/smt/solver/model-checker.ts +20 -62
- package/src/prover/smt/solver/model-evaluator.ts +186 -39
- package/src/prover/smt/solver/model-finder.ts +15 -32
- package/src/prover/smt/solver/model-generator.ts +57 -40
- package/src/prover/smt/solver/model-macro-solver.ts +58 -111
- package/src/prover/smt/solver/model-printer.ts +215 -0
- package/src/prover/smt/solver/mpf.ts +712 -0
- package/src/prover/smt/solver/mus.ts +52 -0
- package/src/prover/smt/solver/muz/dl-context.ts +362 -0
- package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +98 -0
- package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +121 -0
- package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +121 -0
- package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +305 -0
- package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +427 -0
- package/src/prover/smt/solver/muz/dl-mk-slice.ts +278 -0
- package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +158 -0
- package/src/prover/smt/solver/muz/dl-rule-set.ts +303 -0
- package/src/prover/smt/solver/muz/dl-rule-transformer.ts +127 -0
- package/src/prover/smt/solver/muz/dl-rule.ts +460 -0
- package/src/prover/smt/solver/muz/hnf.ts +201 -0
- package/src/prover/smt/solver/muz/horn-tactic.ts +192 -0
- package/src/prover/smt/solver/muz/rule-properties.ts +179 -0
- package/src/prover/smt/solver/muz/spacer-context.ts +1395 -0
- package/src/prover/smt/solver/muz/spacer-dl-interface.ts +41 -0
- package/src/prover/smt/solver/muz/spacer-generalizers.ts +244 -0
- package/src/prover/smt/solver/muz/spacer-manager.ts +133 -0
- package/src/prover/smt/solver/muz/spacer-pdr.ts +219 -0
- package/src/prover/smt/solver/muz/spacer-prop-solver.ts +344 -0
- package/src/prover/smt/solver/muz/spacer-util.ts +309 -0
- package/src/prover/smt/solver/muz/substitution.ts +154 -0
- package/src/prover/smt/solver/nla2bv-tactic.ts +286 -0
- package/src/prover/smt/solver/nlqsat.ts +484 -0
- package/src/prover/smt/solver/nlsat/algebraic.ts +179 -159
- package/src/prover/smt/solver/nlsat/atoms.ts +25 -23
- package/src/prover/smt/solver/nlsat/evaluator.ts +17 -22
- package/src/prover/smt/solver/nlsat/explain.ts +61 -69
- package/src/prover/smt/solver/nlsat/interval-set.ts +10 -51
- package/src/prover/smt/solver/nlsat/levelwise.ts +49 -135
- package/src/prover/smt/solver/nlsat/mpbq.ts +48 -14
- package/src/prover/smt/solver/nlsat/polynomial.ts +30 -160
- package/src/prover/smt/solver/nlsat/solver.ts +227 -99
- package/src/prover/smt/solver/nlsat/transcendental-eval.ts +311 -0
- package/src/prover/smt/solver/nlsat/transcendentals.ts +369 -0
- package/src/prover/smt/solver/nlsat/types.ts +1 -8
- package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +2 -45
- package/src/prover/smt/solver/nlsat/upolynomial.ts +11 -92
- package/src/prover/smt/solver/nlsat-tactic.ts +83 -0
- package/src/prover/smt/solver/nnf.ts +108 -60
- package/src/prover/smt/solver/normalize-bounds.ts +54 -0
- package/src/prover/smt/solver/occf.ts +98 -0
- package/src/prover/smt/solver/opt-context.ts +787 -0
- package/src/prover/smt/solver/opt-nlsat.ts +366 -0
- package/src/prover/smt/solver/opt-pareto.ts +284 -0
- package/src/prover/smt/solver/opt-preprocess.ts +102 -0
- package/src/prover/smt/solver/opt-solver.ts +300 -0
- package/src/prover/smt/solver/opt-value.ts +56 -0
- package/src/prover/smt/solver/optsmt.ts +691 -0
- package/src/prover/smt/solver/parallel-tactic.ts +301 -0
- package/src/prover/smt/solver/pattern-inference.ts +19 -23
- package/src/prover/smt/solver/pb-rewriter.ts +296 -0
- package/src/prover/smt/solver/pb2bv-tactic.ts +542 -0
- package/src/prover/smt/solver/poly-rewriter.ts +203 -77
- package/src/prover/smt/solver/probes.ts +514 -0
- package/src/prover/smt/solver/propagate-values.ts +34 -30
- package/src/prover/smt/solver/proto-model.ts +648 -63
- package/src/prover/smt/solver/pull-quant.ts +29 -23
- package/src/prover/smt/solver/purify-arith.ts +598 -0
- package/src/prover/smt/solver/qe-arith-plugin.ts +1099 -0
- package/src/prover/smt/solver/qe-lite-der.ts +3 -31
- package/src/prover/smt/solver/qe-lite-fm.ts +5 -28
- package/src/prover/smt/solver/qe-lite.ts +40 -49
- package/src/prover/smt/solver/qe-mbp.ts +281 -0
- package/src/prover/smt/solver/qe.ts +1508 -0
- package/src/prover/smt/solver/qel.ts +26 -0
- package/src/prover/smt/solver/qi-queue.ts +1 -16
- package/src/prover/smt/solver/qsat.ts +840 -0
- package/src/prover/smt/solver/quant-hoist.ts +195 -0
- package/src/prover/smt/solver/quant-tactics.ts +18 -74
- package/src/prover/smt/solver/quantifier-analyzer.ts +27 -47
- package/src/prover/smt/solver/quantifier-manager.ts +9 -23
- package/src/prover/smt/solver/quasi-macros.ts +254 -0
- package/src/prover/smt/solver/random-gen.ts +1 -2
- package/src/prover/smt/solver/rational.ts +29 -8
- package/src/prover/smt/solver/recfun-decl-plugin.ts +248 -0
- package/src/prover/smt/solver/recfun-rewriter.ts +108 -0
- package/src/prover/smt/solver/reduce-args.ts +226 -0
- package/src/prover/smt/solver/reduce-bv-size.ts +120 -0
- package/src/prover/smt/solver/ref-vector.ts +1 -6
- package/src/prover/smt/solver/relevancy.ts +3 -16
- package/src/prover/smt/solver/rewriter-tpl.ts +49 -129
- package/src/prover/smt/solver/rewriter.ts +478 -120
- package/src/prover/smt/solver/rlimit.ts +27 -21
- package/src/prover/smt/solver/sat/asymm-branch.ts +314 -0
- package/src/prover/smt/solver/sat/big.ts +178 -0
- package/src/prover/smt/solver/sat/clause-use-list.ts +79 -0
- package/src/prover/smt/solver/sat/clause.ts +221 -0
- package/src/prover/smt/solver/sat/cleaner.ts +96 -0
- package/src/prover/smt/solver/sat/config.ts +125 -0
- package/src/prover/smt/solver/sat/consequences.ts +204 -0
- package/src/prover/smt/solver/sat/elim-eqs.ts +144 -0
- package/src/prover/smt/solver/sat/goal2sat.ts +528 -0
- package/src/prover/smt/solver/sat/inc-sat-solver.ts +388 -0
- package/src/prover/smt/solver/sat/model-converter.ts +156 -0
- package/src/prover/smt/solver/sat/pb-constraint.ts +264 -0
- package/src/prover/smt/solver/sat/pb-solver.ts +1553 -0
- package/src/prover/smt/solver/sat/probing.ts +169 -0
- package/src/prover/smt/solver/sat/sat-tactic.ts +44 -0
- package/src/prover/smt/solver/sat/sat2goal.ts +171 -0
- package/src/prover/smt/solver/sat/scc.ts +143 -0
- package/src/prover/smt/solver/sat/simplifier.ts +1662 -0
- package/src/prover/smt/solver/sat/solver.ts +2128 -0
- package/src/prover/smt/solver/sat/var-queue.ts +119 -0
- package/src/prover/smt/solver/sat/watch-list.ts +136 -0
- package/src/prover/smt/solver/search-tree.ts +285 -0
- package/src/prover/smt/solver/seq-axioms.ts +1013 -0
- package/src/prover/smt/solver/seq-decl-plugin.ts +823 -0
- package/src/prover/smt/solver/seq-derive.ts +1303 -0
- package/src/prover/smt/solver/seq-eq-approx.ts +238 -0
- package/src/prover/smt/solver/seq-eq-solver.ts +440 -0
- package/src/prover/smt/solver/seq-factory.ts +91 -0
- package/src/prover/smt/solver/seq-monadic.ts +730 -0
- package/src/prover/smt/solver/seq-range-predicate.ts +225 -0
- package/src/prover/smt/solver/seq-re-rewriter.ts +1296 -0
- package/src/prover/smt/solver/seq-re-util.ts +777 -0
- package/src/prover/smt/solver/seq-regex-bisim.ts +145 -0
- package/src/prover/smt/solver/seq-regex-live.ts +202 -0
- package/src/prover/smt/solver/seq-regex-witness.ts +100 -0
- package/src/prover/smt/solver/seq-rewriter.ts +2407 -0
- package/src/prover/smt/solver/seq-skolem.ts +318 -0
- package/src/prover/smt/solver/seq-subset.ts +166 -0
- package/src/prover/smt/solver/seq-view-witness.ts +355 -0
- package/src/prover/smt/solver/smt-consequences.ts +299 -0
- package/src/prover/smt/solver/smt-kernel.ts +85 -0
- package/src/prover/smt/solver/smt-logics.ts +67 -0
- package/src/prover/smt/solver/smt-setup.ts +492 -0
- package/src/prover/smt/solver/smt2-printer.ts +767 -0
- package/src/prover/smt/solver/smtlib-parser.ts +2423 -270
- package/src/prover/smt/solver/smtlib-script.ts +1493 -0
- package/src/prover/smt/solver/solve-eqs.ts +931 -0
- package/src/prover/smt/solver/solver.ts +120 -39
- package/src/prover/smt/solver/sort.ts +1 -5
- package/src/prover/smt/solver/static-features.ts +319 -0
- package/src/prover/smt/solver/sticky-generations.ts +0 -5
- package/src/prover/smt/solver/tactic.ts +1936 -0
- package/src/prover/smt/solver/term-enumeration.ts +206 -0
- package/src/prover/smt/solver/theory-array.ts +1275 -0
- package/src/prover/smt/solver/theory-bv.ts +1239 -0
- package/src/prover/smt/solver/theory-char.ts +356 -0
- package/src/prover/smt/solver/theory-datatype.ts +599 -0
- package/src/prover/smt/solver/theory-finite-set.ts +30 -0
- package/src/prover/smt/solver/theory-fpa.ts +422 -0
- package/src/prover/smt/solver/theory-lra-axioms.ts +56 -25
- package/src/prover/smt/solver/theory-lra-bounds.ts +31 -10
- package/src/prover/smt/solver/theory-lra-final-check.ts +60 -91
- package/src/prover/smt/solver/theory-lra-internalize.ts +87 -53
- package/src/prover/smt/solver/theory-lra-model.ts +24 -53
- package/src/prover/smt/solver/theory-lra-propagate.ts +25 -40
- package/src/prover/smt/solver/theory-lra-state.ts +7 -27
- package/src/prover/smt/solver/theory-lra.ts +194 -8
- package/src/prover/smt/solver/theory-pb.ts +932 -0
- package/src/prover/smt/solver/theory-polymorphism.ts +59 -0
- package/src/prover/smt/solver/theory-recfun.ts +308 -0
- package/src/prover/smt/solver/theory-seq-regex.ts +871 -0
- package/src/prover/smt/solver/theory-seq-solve.ts +1375 -0
- package/src/prover/smt/solver/theory-seq-state.ts +880 -0
- package/src/prover/smt/solver/theory-seq.ts +984 -0
- package/src/prover/smt/solver/theory.ts +175 -0
- package/src/prover/smt/solver/tseitin-cnf.ts +487 -0
- package/src/prover/smt/solver/var-subst.ts +33 -35
- package/src/prover/smt/table.ts +1 -9
- package/src/prover/smt/types.ts +146 -0
- package/src/prover/tlapm/cache.ts +67 -41
- package/src/prover/tlapm/ocaml-marshal.ts +19 -21
- package/src/prover/tlapm/tlapm.ts +21 -20
- package/src/prover/tlapm-library.ts +3208 -0
- package/src/prover/verdict.ts +9 -2
- package/src/prover/zenon/check/check.ts +1 -11
- package/src/prover/zenon/check/definitions.ts +5 -15
- package/src/prover/zenon/check/equality.ts +0 -8
- package/src/prover/zenon/check/functions.ts +0 -4
- package/src/prover/zenon/check/keys.ts +0 -7
- package/src/prover/zenon/check/propositional.ts +0 -3
- package/src/prover/zenon/check/records.ts +1 -6
- package/src/prover/zenon/check/relations.ts +2 -14
- package/src/prover/zenon/check/rewrites.ts +2 -21
- package/src/prover/zenon/check/sets.ts +40 -61
- package/src/prover/zenon/check/terms.ts +1 -19
- package/src/prover/zenon/check/tla.ts +0 -6
- package/src/prover/zenon/decide.ts +10 -15
- package/src/prover/zenon/encode.ts +1 -8
- package/src/prover/zenon/eqrel.ts +2 -13
- package/src/prover/zenon/equality-rules.ts +0 -4
- package/src/prover/zenon/expr.ts +8 -26
- package/src/prover/zenon/index-table.ts +26 -57
- package/src/prover/zenon/isar-case.ts +9 -19
- package/src/prover/zenon/isar.ts +36 -64
- package/src/prover/zenon/limits.ts +0 -4
- package/src/prover/zenon/llproof.ts +2 -20
- package/src/prover/zenon/mltoll.ts +66 -104
- package/src/prover/zenon/node.ts +20 -14
- package/src/prover/zenon/ocaml.ts +1 -17
- package/src/prover/zenon/parse.ts +10 -12
- package/src/prover/zenon/phrase.ts +1 -11
- package/src/prover/zenon/proof.ts +0 -9
- package/src/prover/zenon/propositional-rules.ts +0 -5
- package/src/prover/zenon/rules.ts +2 -6
- package/src/prover/zenon/search.ts +11 -33
- package/src/prover/zenon/tla/functions.ts +59 -31
- package/src/prover/zenon/tla/llproof.ts +67 -76
- package/src/prover/zenon/tla/records.ts +57 -33
- package/src/prover/zenon/tla/rewrites.ts +12 -19
- package/src/prover/zenon/tla/sets.ts +88 -57
- package/src/prover/zenon/tla/terms.ts +0 -6
- package/src/prover/zenon/tla/tla.ts +66 -64
- package/src/randomization.ts +81 -35
- package/src/resolve.ts +67 -184
- package/src/runtime.ts +22 -22
- package/src/sany/builtins.ts +2 -5
- package/src/sany/generation.ts +394 -0
- package/src/sany/generator-def-entries.ts +210 -0
- package/src/sany/generator-definitions.ts +686 -0
- package/src/sany/generator-expressions.ts +1100 -0
- package/src/sany/generator-proofs.ts +662 -0
- package/src/sany/generator.ts +191 -2764
- package/src/sany/levels.ts +6 -34
- package/src/sany/lexer.ts +58 -77
- package/src/sany/linter.ts +1 -9
- package/src/sany/modules.ts +1 -5
- package/src/sany/nodes.ts +5 -43
- package/src/sany/parse-error.ts +39 -117
- package/src/sany/report.ts +32 -69
- package/src/sany/selectors.ts +49 -76
- package/src/sany/source.ts +1 -17
- package/src/sany/xml.ts +35 -117
- package/src/search.ts +541 -163
- package/src/simulate.ts +709 -0
- package/src/spec-description.ts +192 -100
- package/src/standard-definitions.ts +0 -4
- package/src/standard-modules.ts +264 -95
- package/src/state-graph.ts +52 -31
- package/src/subexpressions.ts +69 -52
- package/src/substitution-levels.ts +7 -7
- package/src/successors.ts +266 -99
- package/src/symmetry.ts +33 -25
- package/src/tableau.ts +27 -24
- package/src/tlc/fingerprint.ts +183 -67
- package/src/tlc/jar-data.ts +112 -6
- package/src/tlc/messages.ts +125 -54
- package/src/tlc/order.ts +39 -69
- package/src/tlc/random.ts +37 -49
- package/src/tlc/replay.ts +553 -228
- package/src/tlc/summary.ts +36 -47
- package/src/tlc/tlc-operators.ts +78 -44
- package/src/tlc/tlcext-operators.ts +139 -122
- package/src/tlc/trace-spec.ts +249 -0
- package/src/tlc/value-stream.ts +139 -0
- package/src/tlc/version.ts +1 -4
- package/src/transfer.ts +22 -25
- package/src/typescript/actions.ts +479 -0
- package/src/typescript/collections.ts +614 -0
- package/src/typescript/compile.ts +63 -0
- package/src/typescript/context.ts +94 -0
- package/src/typescript/emit.ts +121 -0
- package/src/typescript/expressions.ts +496 -0
- package/src/typescript/formula.ts +154 -0
- package/src/typescript/functions.ts +284 -0
- package/src/typescript/model.ts +162 -0
- package/src/typescript/names.ts +114 -0
- package/src/typescript/program.ts +48 -0
- package/src/typescript/properties.ts +139 -0
- package/src/typescript/scope.ts +112 -0
- package/src/typescript/steps.ts +167 -0
- package/src/typescript/types.ts +171 -0
- package/src/values.ts +832 -484
- package/src/worker.ts +7 -8
- package/src/prover/isabelle/isar/statement.ts +0 -57
- package/src/prover/tlaps-module.ts +0 -510
|
@@ -1,17 +1,11 @@
|
|
|
1
|
-
// Ported from Isabelle2025's Provers/blast.ML. Copyright (c) 1986-2025 University of Cambridge,
|
|
2
|
-
// Technische Universitaet Muenchen, and contributors, see LICENSE.
|
|
3
|
-
//
|
|
4
|
-
// Paulson's generic tableau prover with proof reconstruction. It converts subgoal 1 to
|
|
5
|
-
// prototerms, Skolemizing its parameters, searches for a tableau proof with the claset's rules,
|
|
6
|
-
// and replays the proof with Isabelle tactics, so the kernel checks every result. Blast ignores
|
|
7
|
-
// the claset's wrappers and the elimination rules whose conclusion is not a formula variable.
|
|
1
|
+
// Ported from Isabelle2025's Provers/blast.ML. Copyright (c) 1986-2025 University of Cambridge, Technische Universitaet Muenchen, and contributors, see LICENSE.
|
|
8
2
|
|
|
9
|
-
import { TlaIsabelleError } from "../../../../errors";
|
|
3
|
+
import { isIsabelleError, TlaIsabelleError } from "../../../../errors";
|
|
10
4
|
import { selectGoal } from "../../pure/goal";
|
|
11
|
-
import { destImplies, stripParams } from "../../pure/logic";
|
|
5
|
+
import { destImplies, isAllAbs, stripParams } from "../../pure/logic";
|
|
12
6
|
import { makeNameContext } from "../../pure/name";
|
|
13
|
-
import { emptySeq,
|
|
14
|
-
import {
|
|
7
|
+
import { emptySeq, ofCell, type Seq } from "../../pure/seq";
|
|
8
|
+
import { every, orElse, thenTac, type GoalTactic, type Tactic } from "../../pure/tactical";
|
|
15
9
|
import { addFreeNames, stripComb, type Term } from "../../pure/term";
|
|
16
10
|
import { nprems, type Thm } from "../../pure/thm";
|
|
17
11
|
import { atomizePremsTac } from "../../pure/object-logic";
|
|
@@ -36,25 +30,16 @@ import {
|
|
|
36
30
|
mkBlastFree,
|
|
37
31
|
mkBlastSkolem,
|
|
38
32
|
mkBlastVar,
|
|
39
|
-
|
|
40
|
-
stripBlastImpConcl,
|
|
41
|
-
stripBlastImpPrems,
|
|
33
|
+
splitGoalPrems,
|
|
42
34
|
type BlastTerm,
|
|
43
35
|
type VarEntry,
|
|
44
36
|
type VarRef,
|
|
45
37
|
} from "./term";
|
|
46
38
|
|
|
47
|
-
export type { BlastContext } from "./state";
|
|
48
|
-
|
|
49
|
-
// Blast's depth_limit configuration option.
|
|
50
39
|
const DEPTH_LIMIT = 20;
|
|
51
40
|
|
|
52
|
-
// TRANS: the subgoal has no translation, such as one applying an unknown to a non-parameter.
|
|
53
41
|
class Trans extends Error {}
|
|
54
42
|
|
|
55
|
-
const isTermError = (error: unknown) =>
|
|
56
|
-
error instanceof TlaIsabelleError && error.exception === "TERM";
|
|
57
|
-
|
|
58
43
|
const initialize = (context: BlastContext, state: Thm): BlastState => {
|
|
59
44
|
for (const name of [GOAL_NAME, FALSE_NAME])
|
|
60
45
|
if (context.consts.has(name))
|
|
@@ -63,32 +48,25 @@ const initialize = (context: BlastContext, state: Thm): BlastState => {
|
|
|
63
48
|
};
|
|
64
49
|
|
|
65
50
|
const discardForalls = (term: Term): Term =>
|
|
66
|
-
term.
|
|
67
|
-
term.fun.kind === "Const" &&
|
|
68
|
-
term.fun.name === "Pure.all" &&
|
|
69
|
-
term.arg.kind === "Abs"
|
|
70
|
-
? discardForalls(term.arg.body)
|
|
71
|
-
: term;
|
|
51
|
+
isAllAbs(term) ? discardForalls(term.arg.body) : term;
|
|
72
52
|
|
|
73
53
|
interface SubgoalVar {
|
|
74
54
|
readonly key: string;
|
|
75
55
|
readonly ref: VarRef;
|
|
76
|
-
// The parameters the variable is applied to.
|
|
77
56
|
readonly bounds: readonly number[];
|
|
78
57
|
}
|
|
79
58
|
|
|
80
|
-
// Translates a subgoal, Skolemizing all its parameters.
|
|
81
59
|
const fromSubgoal = (state: BlastState, term: Term): BlastTerm => {
|
|
82
60
|
const vars: SubgoalVar[] = [];
|
|
83
61
|
const tvars: VarEntry[] = [];
|
|
84
|
-
const
|
|
62
|
+
const convert = (level: number, current: Term): BlastTerm => {
|
|
85
63
|
const [head, args] = stripComb(current);
|
|
86
64
|
const apply = (blastHead: BlastTerm) =>
|
|
87
65
|
listBlastComb(
|
|
88
66
|
blastHead,
|
|
89
|
-
args.map((arg) =>
|
|
67
|
+
args.map((arg) => convert(level, arg)),
|
|
90
68
|
);
|
|
91
|
-
const
|
|
69
|
+
const getBounds = () =>
|
|
92
70
|
args.map((arg) => {
|
|
93
71
|
if (arg.kind !== "Bound")
|
|
94
72
|
throw new Trans("Function unknown's argument not a bound variable");
|
|
@@ -106,11 +84,11 @@ const fromSubgoal = (state: BlastState, term: Term): BlastTerm => {
|
|
|
106
84
|
const key = `${head.name}.${head.index}`;
|
|
107
85
|
const known = vars.find((entry) => entry.key === key);
|
|
108
86
|
if (known === undefined) {
|
|
109
|
-
const entry = { key, ref: { value: undefined }, bounds:
|
|
87
|
+
const entry = { key, ref: { value: undefined }, bounds: getBounds() };
|
|
110
88
|
vars.unshift(entry);
|
|
111
89
|
return mkBlastVar(entry.ref);
|
|
112
90
|
}
|
|
113
|
-
const argBounds =
|
|
91
|
+
const argBounds = getBounds();
|
|
114
92
|
if (
|
|
115
93
|
known.bounds.length === argBounds.length &&
|
|
116
94
|
known.bounds.every((bound, index) => bound === argBounds[index])
|
|
@@ -120,13 +98,13 @@ const fromSubgoal = (state: BlastState, term: Term): BlastTerm => {
|
|
|
120
98
|
}
|
|
121
99
|
case "Abs":
|
|
122
100
|
if (args.length > 0) throw new Trans("argument not in normal form");
|
|
123
|
-
return mkBlastAbs(head.name,
|
|
101
|
+
return mkBlastAbs(head.name, convert(level + 1, head.body));
|
|
124
102
|
case "App":
|
|
125
103
|
throw new Trans("strip_comb");
|
|
126
104
|
}
|
|
127
105
|
};
|
|
128
106
|
const npars = stripParams(term).length;
|
|
129
|
-
let result =
|
|
107
|
+
let result = convert(0, discardForalls(term));
|
|
130
108
|
for (let index = 0; index < npars; index += 1) {
|
|
131
109
|
const args = vars.filter((entry) => !entry.bounds.includes(index)).map((entry) => entry.ref);
|
|
132
110
|
result = blastSubstBound(mkBlastSkolem(gensym(state, "T"), args), result);
|
|
@@ -134,54 +112,6 @@ const fromSubgoal = (state: BlastState, term: Term): BlastTerm => {
|
|
|
134
112
|
return result;
|
|
135
113
|
};
|
|
136
114
|
|
|
137
|
-
interface EveryTrail {
|
|
138
|
-
readonly state: Thm;
|
|
139
|
-
readonly rest: Seq<Thm>;
|
|
140
|
-
readonly position: number;
|
|
141
|
-
readonly next: EveryTrail | undefined;
|
|
142
|
-
}
|
|
143
|
-
|
|
144
|
-
// EVERY, as a loop: Isabelle's EVY and evyBack call each other in tail position, so backtracking
|
|
145
|
-
// over a long reconstruction must not grow the stack.
|
|
146
|
-
const everyTac =
|
|
147
|
-
(tactics: readonly Tactic[]): Tactic =>
|
|
148
|
-
(start) => {
|
|
149
|
-
const advance = (
|
|
150
|
-
initialTrail: EveryTrail | undefined,
|
|
151
|
-
initialPosition: number,
|
|
152
|
-
initialState: Thm | undefined,
|
|
153
|
-
): Cell<Thm> => {
|
|
154
|
-
let trail = initialTrail;
|
|
155
|
-
let position = initialPosition;
|
|
156
|
-
let state = initialState;
|
|
157
|
-
for (;;) {
|
|
158
|
-
if (state === undefined) {
|
|
159
|
-
if (trail === undefined) return undefined;
|
|
160
|
-
const cell = trail.rest.pull();
|
|
161
|
-
if (cell === undefined) trail = trail.next;
|
|
162
|
-
else if (eqThm(trail.state, cell[0])) trail = { ...trail, rest: cell[1] };
|
|
163
|
-
else {
|
|
164
|
-
trail = { state: cell[0], rest: cell[1], position: trail.position, next: trail.next };
|
|
165
|
-
position = trail.position;
|
|
166
|
-
state = cell[0];
|
|
167
|
-
}
|
|
168
|
-
} else if (position === tactics.length) {
|
|
169
|
-
const saved = trail;
|
|
170
|
-
return [state, makeSeq(() => advance(saved, 0, undefined))];
|
|
171
|
-
} else {
|
|
172
|
-
const cell = tactics[position](state).pull();
|
|
173
|
-
if (cell === undefined) state = undefined;
|
|
174
|
-
else {
|
|
175
|
-
trail = { state: cell[0], rest: cell[1], position: position + 1, next: trail };
|
|
176
|
-
position += 1;
|
|
177
|
-
state = cell[0];
|
|
178
|
-
}
|
|
179
|
-
}
|
|
180
|
-
}
|
|
181
|
-
};
|
|
182
|
-
return makeSeq(() => advance(undefined, 0, start));
|
|
183
|
-
};
|
|
184
|
-
|
|
185
115
|
const initBranch = (terms: readonly BlastTerm[], lim: number): Branch => ({
|
|
186
116
|
pairs: [{ safe: terms.map((term) => ({ term, md: true })), unsafe: [] }],
|
|
187
117
|
lits: [],
|
|
@@ -189,7 +119,6 @@ const initBranch = (terms: readonly BlastTerm[], lim: number): Branch => ({
|
|
|
189
119
|
lim,
|
|
190
120
|
});
|
|
191
121
|
|
|
192
|
-
// The tableau engine and proof reconstruction on subgoal 1, with depth limit lim.
|
|
193
122
|
const rawBlast =
|
|
194
123
|
(context: BlastContext, lim: number): Tactic =>
|
|
195
124
|
(goalState) => {
|
|
@@ -200,9 +129,9 @@ const rawBlast =
|
|
|
200
129
|
const replay: Tactic[] = [];
|
|
201
130
|
for (let current = tactics; current !== undefined; current = current.tail)
|
|
202
131
|
replay.push(current.head(1));
|
|
203
|
-
return
|
|
132
|
+
return every(replay.reverse())(goalState).pull();
|
|
204
133
|
} catch (error) {
|
|
205
|
-
if (
|
|
134
|
+
if (isIsabelleError(error, "TERM")) return backtrack(choices);
|
|
206
135
|
throw error;
|
|
207
136
|
}
|
|
208
137
|
})();
|
|
@@ -210,27 +139,13 @@ const rawBlast =
|
|
|
210
139
|
};
|
|
211
140
|
try {
|
|
212
141
|
const skoprem = fromSubgoal(state, destImplies(goalState.prop)[0]);
|
|
213
|
-
|
|
214
|
-
return prove(
|
|
215
|
-
state,
|
|
216
|
-
[
|
|
217
|
-
initBranch(
|
|
218
|
-
[
|
|
219
|
-
mkGoal(stripBlastImpConcl(trueprop, skoprem)),
|
|
220
|
-
...stripBlastImpPrems(trueprop, skoprem),
|
|
221
|
-
],
|
|
222
|
-
lim,
|
|
223
|
-
),
|
|
224
|
-
],
|
|
225
|
-
cont,
|
|
226
|
-
);
|
|
142
|
+
return prove(state, [initBranch(splitGoalPrems(context.data.trueprop, skoprem), lim)], cont);
|
|
227
143
|
} catch (error) {
|
|
228
144
|
if (isBacktrackTo(error, undefined) || error instanceof Trans) return emptySeq;
|
|
229
145
|
throw error;
|
|
230
146
|
}
|
|
231
147
|
};
|
|
232
148
|
|
|
233
|
-
// Blast.depth_tac: blast with a fixed depth limit.
|
|
234
149
|
export const blastDepthTac =
|
|
235
150
|
(context: BlastContext, limit: number): GoalTactic =>
|
|
236
151
|
(index) =>
|
|
@@ -238,7 +153,6 @@ export const blastDepthTac =
|
|
|
238
153
|
thenTac(atomizePremsTac(context.limits, context.data.atomize)(1), rawBlast(context, limit)),
|
|
239
154
|
)(index);
|
|
240
155
|
|
|
241
|
-
// Search.DEEPEN (1, lim) from depth m on goal 1.
|
|
242
156
|
const deepen =
|
|
243
157
|
(context: BlastContext, limit: number, depth: number): Tactic =>
|
|
244
158
|
(state): Seq<Thm> =>
|
|
@@ -246,7 +160,6 @@ const deepen =
|
|
|
246
160
|
? emptySeq
|
|
247
161
|
: orElse(rawBlast(context, depth), deepen(context, limit, depth + 1))(state);
|
|
248
162
|
|
|
249
|
-
// Blast.blast_tac: iterative deepening up to the depth limit.
|
|
250
163
|
export const blastTac =
|
|
251
164
|
(context: BlastContext): GoalTactic =>
|
|
252
165
|
(index) =>
|
|
@@ -1,8 +1,4 @@
|
|
|
1
|
-
// Ported from Isabelle2025's Provers/blast.ML. Copyright (c) 1986-2025 University of Cambridge,
|
|
2
|
-
// Technische Universitaet Muenchen, and contributors, see LICENSE.
|
|
3
|
-
//
|
|
4
|
-
// Operations on branches: naive substitution for equalities, closing a branch by complementary
|
|
5
|
-
// literals, and the pruning of choice points.
|
|
1
|
+
// Ported from Isabelle2025's Provers/blast.ML. Copyright (c) 1986-2025 University of Cambridge, Technische Universitaet Muenchen, and contributors, see LICENSE.
|
|
6
2
|
|
|
7
3
|
import { orElseGoal, thenGoal, type GoalTactic } from "../../pure/tactical";
|
|
8
4
|
import { assumeTac, eqAssumeTac, ematchTac } from "../../pure/tactic";
|
|
@@ -33,7 +29,6 @@ import {
|
|
|
33
29
|
const negate = (state: BlastState, term: BlastTerm) =>
|
|
34
30
|
mkBlastApp(mkBlastConst(state.context.data.notName), term);
|
|
35
31
|
|
|
36
|
-
// Converts a *Goal* to an ordinary negation.
|
|
37
32
|
export const negOfGoal = (state: BlastState, term: BlastTerm) => {
|
|
38
33
|
const goal = destConstApp(term, GOAL_NAME);
|
|
39
34
|
return goal === undefined ? term : negate(state, goal);
|
|
@@ -44,15 +39,12 @@ const negOfGoal2 = (state: BlastState, formula: Formula): Formula => ({
|
|
|
44
39
|
md: formula.md,
|
|
45
40
|
});
|
|
46
41
|
|
|
47
|
-
// Converts the goals to negations in the safe parts of a branch. They could have been moved there
|
|
48
|
-
// from the literals by an equality substitution.
|
|
49
42
|
export const negOfGoals = (state: BlastState, pairs: readonly Level[]): Level[] =>
|
|
50
43
|
pairs.map((level) => ({
|
|
51
44
|
safe: level.safe.map((formula) => negOfGoal2(state, formula)),
|
|
52
45
|
unsafe: level.unsafe,
|
|
53
46
|
}));
|
|
54
47
|
|
|
55
|
-
// Replaces the atomic term old by new, returning the very same term where nothing changes.
|
|
56
48
|
const substAtomic = (old: BlastTerm, replacement: BlastTerm, term: BlastTerm): BlastTerm => {
|
|
57
49
|
if (term.kind === "Var" && term.ref.value !== undefined)
|
|
58
50
|
return substAtomic(old, replacement, term.ref.value);
|
|
@@ -68,7 +60,6 @@ const substAtomic = (old: BlastTerm, replacement: BlastTerm, term: BlastTerm): B
|
|
|
68
60
|
return blastAconv(term, old) ? replacement : term;
|
|
69
61
|
};
|
|
70
62
|
|
|
71
|
-
// Eta-contracts a term from outside, just enough to reduce it to an atom.
|
|
72
63
|
const etaContractAtom = (term: BlastTerm): BlastTerm => {
|
|
73
64
|
if (term.kind !== "Abs") return term;
|
|
74
65
|
const body = etaContract2(term.body);
|
|
@@ -82,10 +73,6 @@ const etaContractAtom = (term: BlastTerm): BlastTerm => {
|
|
|
82
73
|
const etaContract2 = (term: BlastTerm): BlastTerm =>
|
|
83
74
|
term.kind === "App" ? mkBlastApp(term.fun, etaContractAtom(term.arg)) : etaContractAtom(term);
|
|
84
75
|
|
|
85
|
-
// Can term occur in other? Does not examine the arguments of Skolem terms, which substitution does
|
|
86
|
-
// not affect, and is reflexive because hyp_subst_tac fails on x = x. No variables may occur in
|
|
87
|
-
// other except the arguments of a Skolem term, so that no equation that could be instantiated to
|
|
88
|
-
// a cycle is deleted.
|
|
89
76
|
const substOccur = (term: BlastTerm, other: BlastTerm) => {
|
|
90
77
|
const vars = term.kind === "Skolem" ? term.args : [];
|
|
91
78
|
const occEq = (current: BlastTerm): boolean => blastAconv(term, current) || occ(current);
|
|
@@ -106,8 +93,6 @@ const substOccur = (term: BlastTerm, other: BlastTerm) => {
|
|
|
106
93
|
return occEq(other);
|
|
107
94
|
};
|
|
108
95
|
|
|
109
|
-
// Takes apart an equality and orients it to eliminate a Skolem term or a free variable, or gives
|
|
110
|
-
// undefined (DEST_EQ) if it has no substitutable side.
|
|
111
96
|
const orientEquality = (state: BlastState, term: BlastTerm): [BlastTerm, BlastTerm] | undefined => {
|
|
112
97
|
if (
|
|
113
98
|
term.kind !== "App" ||
|
|
@@ -132,9 +117,6 @@ interface Substituted {
|
|
|
132
117
|
readonly kept: readonly Formula[];
|
|
133
118
|
}
|
|
134
119
|
|
|
135
|
-
// Substitutes through the branch if the formula is an equality with a substitutable variable.
|
|
136
|
-
// Moves the affected formulae and literals back to the safe formulae, but it is not clear where
|
|
137
|
-
// they should go: this could make proofs fail.
|
|
138
120
|
export const equalSubst = (
|
|
139
121
|
state: BlastState,
|
|
140
122
|
formula: BlastTerm,
|
|
@@ -184,10 +166,8 @@ export const equalSubst = (
|
|
|
184
166
|
};
|
|
185
167
|
};
|
|
186
168
|
|
|
187
|
-
// Tries to unify complementary literals, giving the tactic that closes the branch.
|
|
188
169
|
const eAssumeTac = (state: BlastState) => orElseGoal(eqAssumeTac, assumeTac(state.context.limits));
|
|
189
170
|
|
|
190
|
-
// contr_tac: trying eq_contr_tac first increases the effort, slowing reconstruction.
|
|
191
171
|
const eContrTac = (state: BlastState) =>
|
|
192
172
|
thenGoal(ematchTac(state.context.limits, [state.context.data.notE]), eAssumeTac(state));
|
|
193
173
|
|
|
@@ -215,7 +195,6 @@ export const tryClose = (
|
|
|
215
195
|
return undefined;
|
|
216
196
|
};
|
|
217
197
|
|
|
218
|
-
// Were there Skolem terms in the premise? Must not chase variables.
|
|
219
198
|
const hasSkolem = (term: BlastTerm): boolean => {
|
|
220
199
|
switch (term.kind) {
|
|
221
200
|
case "Skolem":
|
|
@@ -229,12 +208,9 @@ const hasSkolem = (term: BlastTerm): boolean => {
|
|
|
229
208
|
}
|
|
230
209
|
};
|
|
231
210
|
|
|
232
|
-
// Attaches the may-duplicate flag to new formulae: those with Skolem terms may be duplicated.
|
|
233
211
|
export const joinMd = (md: boolean, terms: readonly BlastTerm[]): Formula[] =>
|
|
234
212
|
terms.map((term) => ({ term, md: hasSkolem(term) || md }));
|
|
235
213
|
|
|
236
|
-
// Whether any of the last count assignments of the trail below top occurs in vars or their
|
|
237
|
-
// instantiations.
|
|
238
214
|
const clashVar = (state: BlastState, vars: readonly BlastTerm[], count: number, top: number) => {
|
|
239
215
|
if (vars.length === 0) return false;
|
|
240
216
|
for (
|
|
@@ -249,9 +225,6 @@ const clashVar = (state: BlastState, vars: readonly BlastTerm[], count: number,
|
|
|
249
225
|
return false;
|
|
250
226
|
};
|
|
251
227
|
|
|
252
|
-
// Deletes the choice points for goals the latest inference proved, provided no variable of the
|
|
253
|
-
// next branch was updated. nbrs is the number of branches just before closing this one. Does not
|
|
254
|
-
// prune at the very end, to allow backtracking over bad proofs.
|
|
255
228
|
export const prune = (
|
|
256
229
|
state: BlastState,
|
|
257
230
|
nbrs: number,
|
|
@@ -275,8 +248,6 @@ export const prune = (
|
|
|
275
248
|
export const nextVars = (brs: readonly Branch[]) =>
|
|
276
249
|
brs.length === 0 ? [] : brs[0].vars.map((ref) => mkBlastVar(ref));
|
|
277
250
|
|
|
278
|
-
// Adds the literal, handling *Goal* and detecting duplicates. A new *Goal* turns the other goals
|
|
279
|
-
// into negations.
|
|
280
251
|
export const addLit = (state: BlastState, term: BlastTerm, lits: readonly BlastTerm[]) => {
|
|
281
252
|
const goal = destConstApp(term, GOAL_NAME);
|
|
282
253
|
if (goal === undefined) return insTerm(term, lits);
|
|
@@ -297,10 +268,8 @@ export const addLit = (state: BlastState, term: BlastTerm, lits: readonly BlastT
|
|
|
297
268
|
];
|
|
298
269
|
};
|
|
299
270
|
|
|
300
|
-
// The penalty for a branching factor: log2 seems a little too severe.
|
|
301
271
|
export const log4 = (count: number): number => (count < 4 ? 0 : 1 + log4(Math.floor(count / 4)));
|
|
302
272
|
|
|
303
|
-
// Whether term might be an instance of pattern, to detect recursive rules such as transitivity.
|
|
304
273
|
export const match = (state: BlastState, pattern: BlastTerm, term: BlastTerm): boolean => {
|
|
305
274
|
if (pattern.kind === "Var") return true;
|
|
306
275
|
if (pattern.kind === "Const" && term.kind === "Const") {
|
|
@@ -1,10 +1,4 @@
|
|
|
1
|
-
// Ported from Isabelle2025's Provers/blast.ML. Copyright (c) 1986-2025 University of Cambridge,
|
|
2
|
-
// Technische Universitaet Muenchen, and contributors, see LICENSE.
|
|
3
|
-
//
|
|
4
|
-
// The tableau prover, based on leanTaP. It works on a list of branches, each with its unexpanded
|
|
5
|
-
// formulae, its literals and a bound on unsafe expansions. Every inference records the tactic
|
|
6
|
-
// that replays it; once all branches close, the continuation reconstructs the proof. Each
|
|
7
|
-
// recursion level that can be backtracked to owns a token, and a choice point raises it.
|
|
1
|
+
// Ported from Isabelle2025's Provers/blast.ML. Copyright (c) 1986-2025 University of Cambridge, Technische Universitaet Muenchen, and contributors, see LICENSE.
|
|
8
2
|
|
|
9
3
|
import type { Seq } from "../../pure/seq";
|
|
10
4
|
import type { GoalTactic } from "../../pure/tactical";
|
|
@@ -46,13 +40,10 @@ import {
|
|
|
46
40
|
type VarRef,
|
|
47
41
|
} from "./term";
|
|
48
42
|
|
|
49
|
-
// The tactics that replay the inferences so far, latest first.
|
|
50
43
|
type Tactics = List<GoalTactic> | undefined;
|
|
51
44
|
|
|
52
45
|
export type Continuation = (tactics: Tactics, choices: Choices) => Seq<Thm>;
|
|
53
46
|
|
|
54
|
-
// A step either finishes the search or continues the same branches without a choice point, which
|
|
55
|
-
// blast.ML does by a tail call. prv loops on the latter, so a long search can't exhaust the stack.
|
|
56
47
|
type Step =
|
|
57
48
|
| { readonly kind: "done"; readonly result: Seq<Thm> }
|
|
58
49
|
| {
|
|
@@ -76,7 +67,6 @@ export const prove = (
|
|
|
76
67
|
const safeList = [context.claset.safe0, context.claset.safep];
|
|
77
68
|
const unsafeList = [context.claset.unsafe];
|
|
78
69
|
|
|
79
|
-
// Applies a safe rule only, possibly allowing instantiation; defers any unsafe formulae.
|
|
80
70
|
const safeStep = (tactics: Tactics, choices: Choices, brs: readonly Branch[]): Step => {
|
|
81
71
|
const token = {};
|
|
82
72
|
const branch = brs[0];
|
|
@@ -90,7 +80,6 @@ export const prove = (
|
|
|
90
80
|
const nxtVars = nextVars(rest);
|
|
91
81
|
const formula = norm(head.safe[0].term);
|
|
92
82
|
const rules = netMkRules(state, formula, branch.vars, safeList);
|
|
93
|
-
// Makes the new branches, decrementing lim if instantiations occur.
|
|
94
83
|
const newBr = (vars: readonly VarRef[], lim: number, prems: TableauRule["prems"]): Branch[] => [
|
|
95
84
|
...prems.map((prem): Branch => {
|
|
96
85
|
const level = { safe: joinMd(md, prem), unsafe: [] };
|
|
@@ -105,14 +94,11 @@ export const prove = (
|
|
|
105
94
|
}),
|
|
106
95
|
...rest,
|
|
107
96
|
];
|
|
108
|
-
// Seeks a matching rule; if unifiable, adds its premises to the branch. Undefined is
|
|
109
|
-
// NEWBRANCHES.
|
|
110
97
|
const deeper = (): Seq<Thm> | undefined => {
|
|
111
98
|
for (let position = 0; position < rules.length; position += 1) {
|
|
112
99
|
const rule = rules[position];
|
|
113
100
|
if (!unify(state, addTermVars(rule.major, []), rule.major, formula)) continue;
|
|
114
101
|
const isUpdated = ntrl < state.trail.length;
|
|
115
|
-
// Discourages branching updates.
|
|
116
102
|
const lim = isUpdated ? branch.lim - (1 + log4(rules.length)) : branch.lim;
|
|
117
103
|
const vars = addPremsVars(rule.prems, varsInVars(branch.vars));
|
|
118
104
|
const nextChoices = cons({ ntrl, nbrs, token }, choices);
|
|
@@ -120,7 +106,6 @@ export const prove = (
|
|
|
120
106
|
try {
|
|
121
107
|
if (rule.prems.length === 0)
|
|
122
108
|
return prv(nextTactics, prune(state, nbrs, nxtVars, nextChoices), rest);
|
|
123
|
-
// Faster to kill all the alternatives.
|
|
124
109
|
if (lim < 0) {
|
|
125
110
|
clearTo(state, ntrl);
|
|
126
111
|
return undefined;
|
|
@@ -128,15 +113,12 @@ export const prove = (
|
|
|
128
113
|
return prv(nextTactics, nextChoices, newBr(vars, lim, rule.prems));
|
|
129
114
|
} catch (error) {
|
|
130
115
|
if (!isBacktrackTo(error, token)) throw error;
|
|
131
|
-
// Backtracks at this level, resetting variables and trying another rule, or to the
|
|
132
|
-
// previous level.
|
|
133
116
|
if (!isUpdated) return backtrack(choices);
|
|
134
117
|
clearTo(state, ntrl);
|
|
135
118
|
}
|
|
136
119
|
}
|
|
137
120
|
return undefined;
|
|
138
121
|
};
|
|
139
|
-
// Tries to close the branch by unifying the formula with a literal. Undefined is CLOSEF.
|
|
140
122
|
const closeF = (literals: readonly BlastTerm[]): Seq<Thm> | undefined => {
|
|
141
123
|
for (const literal of literals) {
|
|
142
124
|
const tactic = tryClose(state, formula, literal);
|
|
@@ -151,7 +133,6 @@ export const prove = (
|
|
|
151
133
|
}
|
|
152
134
|
return undefined;
|
|
153
135
|
};
|
|
154
|
-
// Tries to unify a queued formula, safe or unsafe, with the formula.
|
|
155
136
|
const closeFl = (levels: readonly Level[]): Seq<Thm> | undefined => {
|
|
156
137
|
for (const level of levels) {
|
|
157
138
|
const closed =
|
|
@@ -173,7 +154,6 @@ export const prove = (
|
|
|
173
154
|
const closed = closeF(branch.lits) ?? closeFl(pairs) ?? deeper();
|
|
174
155
|
if (closed !== undefined) return done(closed);
|
|
175
156
|
if (netMkRules(state, formula, branch.vars, unsafeList).length === 0)
|
|
176
|
-
// There are no plausible unsafe rules: the formula becomes a literal.
|
|
177
157
|
return {
|
|
178
158
|
kind: "next",
|
|
179
159
|
tactics,
|
|
@@ -183,7 +163,6 @@ export const prove = (
|
|
|
183
163
|
...rest,
|
|
184
164
|
],
|
|
185
165
|
};
|
|
186
|
-
// The formula admits some unsafe rules: try them later.
|
|
187
166
|
const deferred: Formula = { term: negOfGoal(state, formula), md };
|
|
188
167
|
return {
|
|
189
168
|
kind: "next",
|
|
@@ -201,7 +180,6 @@ export const prove = (
|
|
|
201
180
|
};
|
|
202
181
|
};
|
|
203
182
|
|
|
204
|
-
// No safe steps are possible at any level: applies an unsafe rule.
|
|
205
183
|
const unsafeStep = (tactics: Tactics, choices: Choices, brs: readonly Branch[]): Step => {
|
|
206
184
|
const token = {};
|
|
207
185
|
const branch = brs[0];
|
|
@@ -212,7 +190,6 @@ export const prove = (
|
|
|
212
190
|
const formula = norm(queued[0].term);
|
|
213
191
|
const ntrl = state.trail.length;
|
|
214
192
|
const rules = netMkRules(state, formula, branch.vars, unsafeList);
|
|
215
|
-
// The new premises of unsafe rules may not be duplicated.
|
|
216
193
|
const newPrem = (
|
|
217
194
|
vars: readonly VarRef[],
|
|
218
195
|
pattern: BlastTerm,
|
|
@@ -223,8 +200,6 @@ export const prove = (
|
|
|
223
200
|
const safe = prem.map((term) => ({ term, md: false }));
|
|
224
201
|
const unsafe = isDup ? [...others, { term: negOfGoal(state, formula), md }] : others;
|
|
225
202
|
return {
|
|
226
|
-
// A premise recursive in the rule makes no new stack frame: its unsafe premises end up at
|
|
227
|
-
// the back of the queue, preventing the exclusion of others.
|
|
228
203
|
pairs: prem.some((term) => match(state, pattern, term))
|
|
229
204
|
? [{ safe, unsafe }]
|
|
230
205
|
: [
|
|
@@ -243,16 +218,10 @@ export const prove = (
|
|
|
243
218
|
const isUpdated = ntrl < state.trail.length;
|
|
244
219
|
const vars = varsInVars(branch.vars);
|
|
245
220
|
const newVars = addPremsVars(rule.prems, vars);
|
|
246
|
-
// Duplicates the formula if md permits.
|
|
247
221
|
const isDup = md;
|
|
248
|
-
// Decrements lim extra if updates occur.
|
|
249
222
|
const lim = isUpdated ? branch.lim - (1 + log4(rules.length)) : branch.lim - 1;
|
|
250
|
-
// Allows backtracking from a rule application if other matching rules exist, if the rule
|
|
251
|
-
// updated variables, or if it introduced no new variables, so that it is not a standard
|
|
252
|
-
// gamma-rule. This emulates fast_tac, which allows all unsafe steps to be undone.
|
|
253
223
|
const mayUndo = position + 1 < rules.length || isUpdated || sameVars(vars, newVars);
|
|
254
224
|
const tactic = rule.tactic(isUpdated, isDup, true);
|
|
255
|
-
// Faster to kill all the alternatives.
|
|
256
225
|
if (lim < 0 && rule.prems.length > 0) {
|
|
257
226
|
clearTo(state, ntrl);
|
|
258
227
|
return undefined;
|
|
@@ -273,7 +242,6 @@ export const prove = (
|
|
|
273
242
|
if (branch.lim < 1) return backtrack(choices);
|
|
274
243
|
const closed = deeper();
|
|
275
244
|
if (closed !== undefined) return done(closed);
|
|
276
|
-
// If no rule closes the branch, the formula becomes a literal.
|
|
277
245
|
return {
|
|
278
246
|
kind: "next",
|
|
279
247
|
tactics,
|
|
@@ -300,7 +268,6 @@ export const prove = (
|
|
|
300
268
|
let brs = branches;
|
|
301
269
|
for (;;) {
|
|
302
270
|
checkInterrupt(context.limits);
|
|
303
|
-
// All branches closed.
|
|
304
271
|
if (brs.length === 0) return cont(tactics, choices);
|
|
305
272
|
const branch = brs[0];
|
|
306
273
|
const head = branch.pairs[0];
|
|
@@ -319,7 +286,6 @@ export const prove = (
|
|
|
319
286
|
continue;
|
|
320
287
|
}
|
|
321
288
|
if (branch.pairs.length > 1) {
|
|
322
|
-
// No more safe formulae: transfers the unsafe ones down a level.
|
|
323
289
|
const below = branch.pairs[1];
|
|
324
290
|
brs = [
|
|
325
291
|
{
|