tla-ts 0.0.9 → 0.0.10-dev.06b481ee0
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 +41 -37
- package/dist/deciders.js +48 -44
- package/dist/index.cjs +1 -1
- package/dist/index.d.cts +122 -12
- package/dist/index.d.ts +122 -12
- 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 +2746 -410
- package/dist/prove.js +2745 -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 +134 -104
- package/dist/transfer.js +134 -104
- package/dist/worker.cjs +7 -7
- package/dist/worker.js +7 -7
- package/package.json +3 -1
- package/src/ast.ts +56 -60
- package/src/bags.ts +128 -110
- package/src/builtins.ts +31 -77
- package/src/bundled-modules.ts +1 -8
- package/src/check-failure.ts +118 -0
- package/src/check-trace.ts +320 -0
- package/src/check.ts +1156 -888
- package/src/cli/options.ts +12 -32
- package/src/cli/run.ts +0 -2
- package/src/cli/runtime-invariants.ts +100 -0
- package/src/cli/shared.ts +19 -12
- package/src/cli/tlapm.ts +433 -82
- package/src/cli/tlc-arguments.ts +652 -0
- package/src/cli/tlc-output.ts +701 -0
- package/src/cli/tlc-usage.ts +360 -0
- package/src/cli/tlc.ts +330 -659
- 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 +217 -82
- package/src/config.ts +140 -109
- package/src/coverage.ts +1019 -0
- package/src/dependencies.ts +101 -66
- package/src/dfid.ts +683 -0
- package/src/environment-config.ts +315 -0
- package/src/environment.ts +263 -370
- package/src/errors.ts +107 -57
- package/src/evaluate.ts +898 -369
- package/src/exit-codes.ts +63 -13
- package/src/fingerprints.ts +75 -11
- package/src/index.ts +3 -0
- package/src/instances.ts +137 -22
- package/src/java-hash.ts +21 -0
- package/src/java-overrides.ts +6 -21
- package/src/json-reader.ts +455 -0
- package/src/json.ts +252 -139
- package/src/levels.ts +231 -154
- package/src/lexer.ts +83 -101
- package/src/liveness-checker.ts +743 -322
- package/src/liveness.ts +230 -133
- package/src/obligations/action.ts +17 -44
- package/src/obligations/anonymize.ts +120 -95
- package/src/obligations/enabled-axioms.ts +218 -0
- package/src/obligations/equality.ts +1 -3
- package/src/obligations/expression.ts +37 -26
- package/src/obligations/format.ts +0 -10
- package/src/obligations/generate.ts +66 -64
- package/src/obligations/index.ts +39 -20
- package/src/obligations/levels.ts +27 -18
- package/src/obligations/module.ts +28 -55
- package/src/obligations/normalize.ts +31 -41
- package/src/obligations/operators.ts +0 -3
- package/src/obligations/pragma.ts +52 -24
- package/src/obligations/printer.ts +94 -63
- package/src/obligations/proof.ts +3 -6
- package/src/obligations/regroup.ts +0 -5
- package/src/obligations/simplify.ts +57 -63
- package/src/obligations/source.ts +121 -95
- package/src/obligations/subexpression.ts +49 -28
- package/src/obligations/substitution.ts +1 -5
- package/src/obligations/temporal.ts +12 -20
- package/src/obligations/tuples.ts +2 -10
- package/src/parallel-worker.ts +36 -60
- package/src/parallel.ts +64 -73
- package/src/parser.ts +1184 -531
- 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 +12 -13
- package/src/prover/first-order.ts +0 -11
- package/src/prover/isabelle/decide.ts +3 -31
- package/src/prover/isabelle/encode.ts +82 -64
- package/src/prover/isabelle/isar/attrib.ts +250 -0
- package/src/prover/isabelle/isar/context.ts +335 -0
- package/src/prover/isabelle/isar/induct.ts +382 -0
- package/src/prover/isabelle/isar/inner-syntax.ts +262 -117
- package/src/prover/isabelle/isar/method.ts +510 -226
- package/src/prover/isabelle/isar/proof.ts +570 -23
- package/src/prover/isabelle/isar/rule-cases.ts +226 -0
- package/src/prover/isabelle/isar/theory.ts +488 -88
- package/src/prover/isabelle/isar/toplevel.ts +331 -0
- package/src/prover/isabelle/isar/type-check.ts +99 -38
- package/src/prover/isabelle/provers/blast/blast.ts +16 -105
- package/src/prover/isabelle/provers/blast/branch.ts +0 -33
- package/src/prover/isabelle/provers/blast/prove.ts +0 -36
- package/src/prover/isabelle/provers/blast/rules.ts +5 -45
- package/src/prover/isabelle/provers/blast/state.ts +1 -29
- package/src/prover/isabelle/provers/blast/term.ts +8 -37
- package/src/prover/isabelle/provers/clasimp.ts +1 -15
- package/src/prover/isabelle/provers/classical.ts +58 -61
- package/src/prover/isabelle/provers/hypsubst.ts +29 -54
- package/src/prover/isabelle/pure/bicompose.ts +24 -39
- package/src/prover/isabelle/pure/consts.ts +0 -8
- package/src/prover/isabelle/pure/conv.ts +2 -18
- package/src/prover/isabelle/pure/drule.ts +95 -45
- package/src/prover/isabelle/pure/envir.ts +2 -53
- package/src/prover/isabelle/pure/goal.ts +1 -9
- 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 +1 -16
- package/src/prover/isabelle/pure/name.ts +1 -10
- package/src/prover/isabelle/pure/net.ts +2 -60
- package/src/prover/isabelle/pure/object-logic.ts +15 -16
- package/src/prover/isabelle/pure/pattern.ts +1 -20
- package/src/prover/isabelle/pure/raw-simplifier.ts +16 -63
- package/src/prover/isabelle/pure/rewriter.ts +34 -77
- package/src/prover/isabelle/pure/search.ts +2 -11
- package/src/prover/isabelle/pure/seq.ts +0 -11
- package/src/prover/isabelle/pure/simplifier.ts +27 -16
- package/src/prover/isabelle/pure/table.ts +2 -33
- package/src/prover/isabelle/pure/tactic.ts +11 -23
- package/src/prover/isabelle/pure/tactical.ts +47 -48
- package/src/prover/isabelle/pure/term-ord.ts +1 -7
- package/src/prover/isabelle/pure/term.ts +4 -47
- package/src/prover/isabelle/pure/thm.ts +26 -48
- package/src/prover/isabelle/pure/type.ts +1 -16
- package/src/prover/isabelle/pure/unify.ts +19 -31
- package/src/prover/isabelle/pure/variable.ts +2 -8
- package/src/prover/isabelle/tla/classical-setup.ts +17 -25
- 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 +45 -44
- package/src/prover/isabelle/tools/intuitionistic.ts +28 -21
- package/src/prover/ocaml.ts +4 -7
- package/src/prover/prep/action.ts +33 -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 +26 -31
- package/src/prover/prep/methods.ts +189 -86
- package/src/prover/prep/normalize.ts +42 -37
- package/src/prover/prove-worker.ts +0 -2
- package/src/prover/prove.ts +398 -133
- package/src/prover/ptl/decide.ts +96 -56
- 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 +60 -32
- package/src/prover/smt/data.ts +517 -401
- package/src/prover/smt/encode.ts +155 -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 +1021 -658
- package/src/prover/smt/simplify.ts +441 -0
- package/src/prover/smt/solver/ackermannize-bv-tactic.ts +61 -0
- package/src/prover/smt/solver/ackr-helper.ts +179 -0
- package/src/prover/smt/solver/ackr-model-converter.ts +105 -0
- package/src/prover/smt/solver/act-cache.ts +0 -16
- package/src/prover/smt/solver/add-bounds-tactic.ts +59 -0
- package/src/prover/smt/solver/aig-tactic.ts +52 -0
- package/src/prover/smt/solver/aig.ts +889 -0
- package/src/prover/smt/solver/arith-rewriter.ts +626 -56
- package/src/prover/smt/solver/arith-terms.ts +121 -0
- package/src/prover/smt/solver/array-decl-plugin.ts +175 -0
- package/src/prover/smt/solver/array-rewriter.ts +319 -0
- package/src/prover/smt/solver/array.ts +1 -3
- package/src/prover/smt/solver/asserted-formulas.ts +241 -99
- package/src/prover/smt/solver/ast-lt.ts +165 -21
- package/src/prover/smt/solver/ast-util.ts +160 -7
- package/src/prover/smt/solver/ast.ts +1480 -184
- package/src/prover/smt/solver/auf-solver.ts +30 -56
- package/src/prover/smt/solver/bit-blast-tactic.ts +608 -0
- package/src/prover/smt/solver/bit-blaster.ts +871 -0
- package/src/prover/smt/solver/blast-term-ite.ts +47 -0
- package/src/prover/smt/solver/bound-manager.ts +196 -0
- package/src/prover/smt/solver/bound-simplifier.ts +598 -0
- package/src/prover/smt/solver/bv-bound-chk.ts +492 -0
- package/src/prover/smt/solver/bv-decl-plugin.ts +341 -0
- package/src/prover/smt/solver/bv-divrem-bounds.ts +95 -0
- package/src/prover/smt/solver/bv-rewriter.ts +1901 -0
- package/src/prover/smt/solver/bv1-blast.ts +214 -0
- package/src/prover/smt/solver/bv2fpa-converter.ts +174 -0
- package/src/prover/smt/solver/bv2int-rewriter.ts +544 -0
- package/src/prover/smt/solver/bv2real-rewriter.ts +533 -0
- package/src/prover/smt/solver/card2bv.ts +127 -0
- package/src/prover/smt/solver/case-split-queue.ts +0 -10
- package/src/prover/smt/solver/cg-table.ts +39 -42
- package/src/prover/smt/solver/check-logic.ts +330 -0
- package/src/prover/smt/solver/clause.ts +0 -27
- package/src/prover/smt/solver/cofactor-elim-term-ite.ts +293 -0
- package/src/prover/smt/solver/conflict-resolution.ts +78 -11
- package/src/prover/smt/solver/context.ts +600 -187
- package/src/prover/smt/solver/ctx-simplify.ts +34 -52
- package/src/prover/smt/solver/ctx-solver-simplify.ts +122 -0
- package/src/prover/smt/solver/datatype-decl-plugin.ts +580 -0
- package/src/prover/smt/solver/datatype-rewriter.ts +82 -0
- package/src/prover/smt/solver/demodulator.ts +786 -0
- package/src/prover/smt/solver/dependent-expr-state.ts +93 -0
- package/src/prover/smt/solver/der.ts +39 -30
- package/src/prover/smt/solver/diff-neq.ts +205 -0
- package/src/prover/smt/solver/distribute-forall.ts +57 -0
- package/src/prover/smt/solver/dom-simplify.ts +511 -0
- package/src/prover/smt/solver/dt2bv-tactic.ts +296 -0
- package/src/prover/smt/solver/dyn-ack.ts +0 -11
- package/src/prover/smt/solver/e-matching.ts +9 -41
- package/src/prover/smt/solver/elim-bounds.ts +89 -0
- package/src/prover/smt/solver/elim-small-bv-tactic.ts +129 -0
- package/src/prover/smt/solver/elim-term-ite-tactic.ts +48 -0
- package/src/prover/smt/solver/elim-uncnstr.ts +542 -0
- package/src/prover/smt/solver/enode.ts +100 -23
- package/src/prover/smt/solver/eq2bv-tactic.ts +218 -0
- package/src/prover/smt/solver/euf/arith-axioms.ts +403 -0
- package/src/prover/smt/solver/euf/arith-internalize.ts +653 -0
- package/src/prover/smt/solver/euf/arith-solver.ts +889 -0
- package/src/prover/smt/solver/euf/array-axioms.ts +527 -0
- package/src/prover/smt/solver/euf/array-internalize.ts +428 -0
- package/src/prover/smt/solver/euf/array-solver.ts +306 -0
- package/src/prover/smt/solver/euf/bv-ackerman.ts +162 -0
- package/src/prover/smt/solver/euf/bv-internalize.ts +748 -0
- package/src/prover/smt/solver/euf/bv-solver.ts +449 -0
- package/src/prover/smt/solver/euf/dt-solver.ts +618 -0
- package/src/prover/smt/solver/euf/egraph.ts +901 -0
- package/src/prover/smt/solver/euf/euf-solver.ts +1204 -0
- package/src/prover/smt/solver/euf/fpa-solver.ts +317 -0
- package/src/prover/smt/solver/euf/mam.ts +1046 -0
- package/src/prover/smt/solver/euf/q-ematch.ts +829 -0
- package/src/prover/smt/solver/euf/q-mbi.ts +587 -0
- package/src/prover/smt/solver/euf/q-model-fixer.ts +296 -0
- package/src/prover/smt/solver/euf/q-solver.ts +361 -0
- package/src/prover/smt/solver/euf/th-solver.ts +328 -0
- package/src/prover/smt/solver/euf/th-solvers.ts +30 -0
- package/src/prover/smt/solver/expr-ref.ts +0 -5
- package/src/prover/smt/solver/expr-safe-replace.ts +26 -7
- package/src/prover/smt/solver/expr2polynomial.ts +271 -0
- package/src/prover/smt/solver/factor.ts +163 -0
- package/src/prover/smt/solver/fd-solver.ts +734 -0
- package/src/prover/smt/solver/fingerprints.ts +15 -26
- package/src/prover/smt/solver/fix-dl-var.ts +147 -0
- package/src/prover/smt/solver/flat-literals.ts +0 -9
- package/src/prover/smt/solver/fm-tactic.ts +884 -0
- package/src/prover/smt/solver/fpa-decl-plugin.ts +618 -0
- package/src/prover/smt/solver/fpa-rewriter.ts +639 -0
- package/src/prover/smt/solver/fpa2bv-converter.ts +2251 -0
- package/src/prover/smt/solver/fpa2bv-rewriter.ts +349 -0
- package/src/prover/smt/solver/fpa2bv-tactic.ts +73 -0
- package/src/prover/smt/solver/goal.ts +179 -28
- package/src/prover/smt/solver/goal2nlsat.ts +216 -0
- package/src/prover/smt/solver/guard-set.ts +219 -0
- package/src/prover/smt/solver/hash.ts +0 -9
- package/src/prover/smt/solver/hashtable.ts +30 -23
- package/src/prover/smt/solver/inf-eps.ts +63 -0
- package/src/prover/smt/solver/inj-axiom.ts +101 -0
- package/src/prover/smt/solver/internalizer.ts +113 -133
- package/src/prover/smt/solver/lackr.ts +381 -0
- package/src/prover/smt/solver/lbool.ts +0 -2
- package/src/prover/smt/solver/lia2card.ts +268 -0
- package/src/prover/smt/solver/lia2pb.ts +154 -0
- package/src/prover/smt/solver/literal.ts +0 -4
- package/src/prover/smt/solver/logic-tactics.ts +355 -0
- package/src/prover/smt/solver/lp/bound-propagator.ts +7 -26
- package/src/prover/smt/solver/lp/constraints.ts +1 -8
- package/src/prover/smt/solver/lp/containers.ts +18 -31
- package/src/prover/smt/solver/lp/core-solver.ts +35 -37
- package/src/prover/smt/solver/lp/cross-nested.ts +4 -21
- package/src/prover/smt/solver/lp/dep-intervals.ts +6 -24
- package/src/prover/smt/solver/lp/dependency.ts +0 -5
- package/src/prover/smt/solver/lp/dioph-eq.ts +8 -103
- package/src/prover/smt/solver/lp/explanation.ts +0 -6
- package/src/prover/smt/solver/lp/gomory.ts +8 -22
- package/src/prover/smt/solver/lp/hnf-cutter.ts +16 -23
- package/src/prover/smt/solver/lp/hnf.ts +10 -28
- package/src/prover/smt/solver/lp/int-cube.ts +17 -39
- package/src/prover/smt/solver/lp/int-solver.ts +3 -35
- package/src/prover/smt/solver/lp/lar-solver.ts +70 -83
- package/src/prover/smt/solver/lp/lar-term.ts +0 -5
- package/src/prover/smt/solver/lp/lp-settings.ts +6 -16
- package/src/prover/smt/solver/lp/maximize-term.ts +76 -52
- package/src/prover/smt/solver/lp/nex-creator.ts +7 -30
- package/src/prover/smt/solver/lp/nex.ts +2 -7
- package/src/prover/smt/solver/lp/nla-backoff.ts +0 -5
- package/src/prover/smt/solver/lp/nla-basics.ts +48 -30
- package/src/prover/smt/solver/lp/nla-core.ts +92 -136
- package/src/prover/smt/solver/lp/nla-divisions.ts +31 -43
- package/src/prover/smt/solver/lp/nla-emonics.ts +3 -21
- package/src/prover/smt/solver/lp/nla-factorization.ts +0 -4
- package/src/prover/smt/solver/lp/nla-grobner.ts +177 -149
- package/src/prover/smt/solver/lp/nla-horner.ts +2 -12
- package/src/prover/smt/solver/lp/nla-intervals.ts +1 -12
- package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +15 -42
- package/src/prover/smt/solver/lp/nla-monotone.ts +1 -6
- package/src/prover/smt/solver/lp/nla-order.ts +0 -13
- package/src/prover/smt/solver/lp/nla-patcher.ts +3 -7
- package/src/prover/smt/solver/lp/nla-powers.ts +220 -0
- package/src/prover/smt/solver/lp/nla-tangents.ts +0 -10
- package/src/prover/smt/solver/lp/nla-throttle.ts +0 -6
- package/src/prover/smt/solver/lp/nla-transcendentals.ts +324 -0
- package/src/prover/smt/solver/lp/nla-types.ts +0 -12
- package/src/prover/smt/solver/lp/nla-var-eqs.ts +4 -26
- package/src/prover/smt/solver/lp/nra-solver.ts +164 -147
- package/src/prover/smt/solver/lp/numeric-pair.ts +0 -4
- package/src/prover/smt/solver/lp/pdd-interval.ts +6 -5
- package/src/prover/smt/solver/lp/pdd-simplifier.ts +61 -34
- package/src/prover/smt/solver/lp/pdd-solver.ts +74 -72
- package/src/prover/smt/solver/lp/pdd.ts +730 -358
- package/src/prover/smt/solver/lp/random-updater.ts +0 -9
- package/src/prover/smt/solver/lp/static-matrix.ts +8 -19
- package/src/prover/smt/solver/lp/union-find.ts +5 -5
- package/src/prover/smt/solver/macro-finder.ts +530 -0
- package/src/prover/smt/solver/mam-compiler.ts +129 -139
- package/src/prover/smt/solver/mam-interpreter.ts +0 -21
- package/src/prover/smt/solver/max-bv-sharing-tactic.ts +17 -0
- package/src/prover/smt/solver/max-cliques.ts +105 -0
- package/src/prover/smt/solver/maxcore.ts +310 -0
- package/src/prover/smt/solver/maximize-ac-sharing.ts +8 -21
- package/src/prover/smt/solver/maxlex.ts +115 -0
- package/src/prover/smt/solver/maxsmt-base.ts +106 -0
- package/src/prover/smt/solver/maxsmt.ts +92 -0
- package/src/prover/smt/solver/mbp/mbp-arith.ts +467 -0
- package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +101 -0
- package/src/prover/smt/solver/mbp/mbp-plugin.ts +287 -0
- package/src/prover/smt/solver/mbp/mbp-qel.ts +48 -0
- package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +271 -0
- package/src/prover/smt/solver/mbp/mbp-term-graph.ts +606 -0
- package/src/prover/smt/solver/model-based-opt.ts +844 -0
- package/src/prover/smt/solver/model-checker.ts +20 -63
- package/src/prover/smt/solver/model-evaluator.ts +192 -40
- package/src/prover/smt/solver/model-finder.ts +14 -32
- package/src/prover/smt/solver/model-generator.ts +104 -46
- package/src/prover/smt/solver/model-macro-solver.ts +60 -114
- package/src/prover/smt/solver/model-printer.ts +214 -0
- package/src/prover/smt/solver/mpf.ts +709 -0
- package/src/prover/smt/solver/mus.ts +50 -0
- package/src/prover/smt/solver/muz/dl-context.ts +382 -0
- package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +97 -0
- package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +167 -0
- package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +125 -0
- package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +299 -0
- package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +455 -0
- package/src/prover/smt/solver/muz/dl-mk-slice.ts +340 -0
- package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +163 -0
- package/src/prover/smt/solver/muz/dl-rule-set.ts +273 -0
- package/src/prover/smt/solver/muz/dl-rule-transformer.ts +123 -0
- package/src/prover/smt/solver/muz/dl-rule.ts +495 -0
- package/src/prover/smt/solver/muz/hnf.ts +201 -0
- package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +176 -0
- package/src/prover/smt/solver/muz/horn-tactic.ts +214 -0
- package/src/prover/smt/solver/muz/rule-properties.ts +359 -0
- package/src/prover/smt/solver/muz/spacer-context.ts +1404 -0
- package/src/prover/smt/solver/muz/spacer-dl-interface.ts +52 -0
- package/src/prover/smt/solver/muz/spacer-generalizers.ts +241 -0
- package/src/prover/smt/solver/muz/spacer-manager.ts +127 -0
- package/src/prover/smt/solver/muz/spacer-pdr.ts +219 -0
- package/src/prover/smt/solver/muz/spacer-prop-solver.ts +333 -0
- package/src/prover/smt/solver/muz/spacer-util.ts +282 -0
- package/src/prover/smt/solver/muz/substitution.ts +203 -0
- package/src/prover/smt/solver/nla2bv-tactic.ts +285 -0
- package/src/prover/smt/solver/nlqsat.ts +484 -0
- package/src/prover/smt/solver/nlsat/algebraic.ts +357 -236
- package/src/prover/smt/solver/nlsat/atoms.ts +73 -54
- package/src/prover/smt/solver/nlsat/evaluator.ts +16 -22
- package/src/prover/smt/solver/nlsat/explain.ts +429 -275
- package/src/prover/smt/solver/nlsat/interval-set.ts +9 -51
- package/src/prover/smt/solver/nlsat/levelwise.ts +477 -344
- package/src/prover/smt/solver/nlsat/mpbq.ts +47 -14
- package/src/prover/smt/solver/nlsat/polynomial.ts +2385 -832
- package/src/prover/smt/solver/nlsat/solver.ts +297 -156
- package/src/prover/smt/solver/nlsat/transcendental-eval.ts +310 -0
- package/src/prover/smt/solver/nlsat/transcendentals.ts +391 -0
- package/src/prover/smt/solver/nlsat/types.ts +0 -9
- package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +9 -51
- package/src/prover/smt/solver/nlsat/upolynomial.ts +49 -109
- package/src/prover/smt/solver/nlsat-tactic.ts +82 -0
- package/src/prover/smt/solver/nnf.ts +112 -61
- package/src/prover/smt/solver/normalize-bounds.ts +53 -0
- package/src/prover/smt/solver/occf.ts +97 -0
- package/src/prover/smt/solver/opt-context.ts +801 -0
- package/src/prover/smt/solver/opt-nlsat.ts +386 -0
- package/src/prover/smt/solver/opt-pareto.ts +301 -0
- package/src/prover/smt/solver/opt-preprocess.ts +101 -0
- package/src/prover/smt/solver/opt-solver.ts +312 -0
- package/src/prover/smt/solver/opt-value.ts +55 -0
- package/src/prover/smt/solver/optsmt.ts +692 -0
- package/src/prover/smt/solver/parallel-tactic.ts +299 -0
- package/src/prover/smt/solver/pattern-inference.ts +21 -26
- package/src/prover/smt/solver/pb-rewriter.ts +281 -0
- package/src/prover/smt/solver/pb2bv-tactic.ts +540 -0
- package/src/prover/smt/solver/poly-rewriter.ts +261 -79
- package/src/prover/smt/solver/probes.ts +577 -0
- package/src/prover/smt/solver/propagate-values.ts +37 -30
- package/src/prover/smt/solver/proto-model.ts +650 -66
- package/src/prover/smt/solver/pull-quant.ts +28 -23
- package/src/prover/smt/solver/purify-arith.ts +632 -0
- package/src/prover/smt/solver/push-app-ite.ts +37 -0
- package/src/prover/smt/solver/qe-arith-plugin.ts +1096 -0
- package/src/prover/smt/solver/qe-lite-der.ts +2 -31
- package/src/prover/smt/solver/qe-lite-fm.ts +4 -28
- package/src/prover/smt/solver/qe-lite.ts +41 -51
- package/src/prover/smt/solver/qe-mbp.ts +270 -0
- package/src/prover/smt/solver/qe.ts +1499 -0
- package/src/prover/smt/solver/qel.ts +25 -0
- package/src/prover/smt/solver/qi-queue.ts +0 -16
- package/src/prover/smt/solver/qsat.ts +829 -0
- package/src/prover/smt/solver/quant-hoist.ts +196 -0
- package/src/prover/smt/solver/quant-tactics.ts +17 -74
- package/src/prover/smt/solver/quantifier-analyzer.ts +26 -47
- package/src/prover/smt/solver/quantifier-manager.ts +22 -32
- package/src/prover/smt/solver/quasi-macros.ts +243 -0
- package/src/prover/smt/solver/random-gen.ts +0 -2
- package/src/prover/smt/solver/rational.ts +45 -8
- package/src/prover/smt/solver/recfun-decl-plugin.ts +262 -0
- package/src/prover/smt/solver/recfun-rewriter.ts +107 -0
- package/src/prover/smt/solver/reduce-args.ts +225 -0
- package/src/prover/smt/solver/reduce-bv-size.ts +119 -0
- package/src/prover/smt/solver/ref-vector.ts +0 -6
- package/src/prover/smt/solver/relevancy.ts +2 -16
- package/src/prover/smt/solver/rewriter-tpl.ts +59 -135
- package/src/prover/smt/solver/rewriter.ts +507 -144
- package/src/prover/smt/solver/rlimit.ts +46 -24
- package/src/prover/smt/solver/sat/asymm-branch.ts +325 -0
- package/src/prover/smt/solver/sat/big.ts +177 -0
- package/src/prover/smt/solver/sat/clause-use-list.ts +71 -0
- package/src/prover/smt/solver/sat/clause.ts +203 -0
- package/src/prover/smt/solver/sat/cleaner.ts +94 -0
- package/src/prover/smt/solver/sat/config.ts +122 -0
- package/src/prover/smt/solver/sat/consequences.ts +203 -0
- package/src/prover/smt/solver/sat/elim-eqs.ts +142 -0
- package/src/prover/smt/solver/sat/goal2sat.ts +579 -0
- package/src/prover/smt/solver/sat/inc-sat-solver.ts +464 -0
- package/src/prover/smt/solver/sat/model-converter.ts +136 -0
- package/src/prover/smt/solver/sat/pb-constraint.ts +268 -0
- package/src/prover/smt/solver/sat/pb-solver.ts +1596 -0
- package/src/prover/smt/solver/sat/probing.ts +170 -0
- package/src/prover/smt/solver/sat/sat-tactic.ts +53 -0
- package/src/prover/smt/solver/sat/sat2goal.ts +189 -0
- package/src/prover/smt/solver/sat/scc.ts +142 -0
- package/src/prover/smt/solver/sat/simplifier.ts +1618 -0
- package/src/prover/smt/solver/sat/solver.ts +2107 -0
- package/src/prover/smt/solver/sat/var-queue.ts +117 -0
- package/src/prover/smt/solver/sat/watch-list.ts +140 -0
- package/src/prover/smt/solver/search-tree.ts +284 -0
- package/src/prover/smt/solver/seq-axioms.ts +995 -0
- package/src/prover/smt/solver/seq-decl-plugin.ts +819 -0
- package/src/prover/smt/solver/seq-derive.ts +1298 -0
- package/src/prover/smt/solver/seq-eq-approx.ts +236 -0
- package/src/prover/smt/solver/seq-eq-solver.ts +439 -0
- package/src/prover/smt/solver/seq-factory.ts +89 -0
- package/src/prover/smt/solver/seq-monadic.ts +730 -0
- package/src/prover/smt/solver/seq-range-predicate.ts +235 -0
- package/src/prover/smt/solver/seq-re-rewriter.ts +1171 -0
- package/src/prover/smt/solver/seq-re-util.ts +758 -0
- package/src/prover/smt/solver/seq-regex-bisim.ts +144 -0
- package/src/prover/smt/solver/seq-regex-live.ts +200 -0
- package/src/prover/smt/solver/seq-rewriter.ts +2404 -0
- package/src/prover/smt/solver/seq-skolem.ts +294 -0
- package/src/prover/smt/solver/seq-subset.ts +165 -0
- package/src/prover/smt/solver/seq-view-witness.ts +353 -0
- package/src/prover/smt/solver/smt-consequences.ts +297 -0
- package/src/prover/smt/solver/smt-kernel.ts +124 -0
- package/src/prover/smt/solver/smt-logics.ts +66 -0
- package/src/prover/smt/solver/smt-setup.ts +589 -0
- package/src/prover/smt/solver/smt2-printer.ts +765 -0
- package/src/prover/smt/solver/smtlib-parser.ts +3546 -406
- package/src/prover/smt/solver/smtlib-script.ts +2134 -0
- package/src/prover/smt/solver/solve-eqs.ts +928 -0
- package/src/prover/smt/solver/solver.ts +135 -40
- package/src/prover/smt/solver/sort.ts +1 -5
- package/src/prover/smt/solver/static-features.ts +314 -0
- package/src/prover/smt/solver/sticky-generations.ts +0 -6
- package/src/prover/smt/solver/tactic.ts +2141 -0
- package/src/prover/smt/solver/term-enumeration.ts +205 -0
- package/src/prover/smt/solver/theory-array.ts +1240 -0
- package/src/prover/smt/solver/theory-bv.ts +1210 -0
- package/src/prover/smt/solver/theory-char.ts +355 -0
- package/src/prover/smt/solver/theory-datatype.ts +598 -0
- package/src/prover/smt/solver/theory-finite-set.ts +30 -0
- package/src/prover/smt/solver/theory-fpa.ts +389 -0
- package/src/prover/smt/solver/theory-lra-axioms.ts +55 -25
- package/src/prover/smt/solver/theory-lra-bounds.ts +31 -11
- package/src/prover/smt/solver/theory-lra-final-check.ts +60 -91
- package/src/prover/smt/solver/theory-lra-internalize.ts +96 -53
- package/src/prover/smt/solver/theory-lra-model.ts +23 -53
- package/src/prover/smt/solver/theory-lra-propagate.ts +34 -42
- package/src/prover/smt/solver/theory-lra-state.ts +7 -28
- package/src/prover/smt/solver/theory-lra.ts +189 -9
- package/src/prover/smt/solver/theory-pb.ts +951 -0
- package/src/prover/smt/solver/theory-polymorphism.ts +58 -0
- package/src/prover/smt/solver/theory-recfun.ts +307 -0
- package/src/prover/smt/solver/theory-seq-regex.ts +867 -0
- package/src/prover/smt/solver/theory-seq-solve.ts +1373 -0
- package/src/prover/smt/solver/theory-seq-state.ts +852 -0
- package/src/prover/smt/solver/theory-seq.ts +961 -0
- package/src/prover/smt/solver/theory-without-terms.ts +24 -0
- package/src/prover/smt/solver/theory.ts +189 -0
- package/src/prover/smt/solver/tseitin-cnf.ts +486 -0
- package/src/prover/smt/solver/var-subst.ts +37 -39
- package/src/prover/smt/table.ts +3 -10
- package/src/prover/smt/types.ts +146 -0
- package/src/prover/tlapm/cache.ts +74 -48
- 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 -19
- package/src/prover/zenon/encode.ts +0 -9
- package/src/prover/zenon/eqrel.ts +2 -15
- package/src/prover/zenon/equality-rules.ts +24 -6
- package/src/prover/zenon/expr.ts +29 -28
- package/src/prover/zenon/index-table.ts +33 -61
- package/src/prover/zenon/isar-case.ts +9 -21
- package/src/prover/zenon/isar.ts +37 -67
- package/src/prover/zenon/limits.ts +0 -4
- package/src/prover/zenon/llproof.ts +2 -22
- package/src/prover/zenon/mltoll.ts +66 -106
- package/src/prover/zenon/node.ts +20 -15
- package/src/prover/zenon/ocaml.ts +1 -17
- package/src/prover/zenon/parse.ts +9 -13
- package/src/prover/zenon/phrase.ts +2 -14
- package/src/prover/zenon/proof.ts +0 -11
- package/src/prover/zenon/propositional-rules.ts +0 -7
- package/src/prover/zenon/rules.ts +3 -8
- package/src/prover/zenon/search.ts +11 -35
- package/src/prover/zenon/tla/functions.ts +59 -33
- package/src/prover/zenon/tla/llproof.ts +67 -78
- package/src/prover/zenon/tla/records.ts +57 -35
- package/src/prover/zenon/tla/rewrites.ts +12 -21
- package/src/prover/zenon/tla/sets.ts +88 -59
- package/src/prover/zenon/tla/terms.ts +0 -8
- package/src/prover/zenon/tla/tla.ts +66 -66
- package/src/randomization.ts +81 -35
- package/src/resolve.ts +1132 -430
- package/src/runtime.ts +33 -23
- package/src/sany/builtins.ts +11 -14
- package/src/sany/generation.ts +383 -0
- package/src/sany/generator-def-entries.ts +210 -0
- package/src/sany/generator-definitions.ts +688 -0
- package/src/sany/generator-expressions.ts +1108 -0
- package/src/sany/generator-proofs.ts +665 -0
- package/src/sany/generator.ts +192 -2764
- package/src/sany/levels.ts +5 -35
- package/src/sany/lexer.ts +61 -80
- package/src/sany/linter.ts +0 -10
- package/src/sany/modules.ts +5 -7
- package/src/sany/nodes.ts +6 -44
- package/src/sany/parse-error.ts +39 -117
- package/src/sany/report.ts +32 -69
- package/src/sany/selectors.ts +60 -82
- package/src/sany/source.ts +1 -17
- package/src/sany/xml.ts +37 -120
- package/src/search.ts +913 -227
- package/src/simulate.ts +765 -0
- package/src/spec-description.ts +198 -104
- package/src/standard-definitions.ts +4 -4
- package/src/standard-modules.ts +302 -99
- package/src/state-graph.ts +52 -33
- package/src/subexpressions.ts +578 -166
- package/src/substitution-levels.ts +7 -7
- package/src/successors.ts +299 -108
- package/src/symmetry.ts +37 -28
- package/src/tableau.ts +29 -26
- package/src/tlc/fingerprint.ts +267 -79
- package/src/tlc/jar-data.ts +122 -6
- package/src/tlc/messages.ts +127 -56
- package/src/tlc/order.ts +53 -72
- package/src/tlc/random.ts +38 -49
- package/src/tlc/replay.ts +579 -230
- package/src/tlc/summary.ts +64 -60
- package/src/tlc/tlc-operators.ts +83 -47
- package/src/tlc/tlcext-operators.ts +205 -127
- package/src/tlc/trace-spec.ts +235 -0
- package/src/tlc/value-stream.ts +139 -0
- package/src/tlc/version.ts +1 -4
- package/src/trace-liveness.ts +529 -0
- package/src/transfer.ts +22 -25
- package/src/typed-tier.ts +6556 -0
- 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 +945 -526
- package/src/worker.ts +7 -8
- package/src/prover/isabelle/isar/statement.ts +0 -57
- package/src/prover/smt/solver/z3-license.txt +0 -10
- package/src/prover/tlaps-module.ts +0 -510
- package/src/prover/zenon/LICENSE +0 -32
|
@@ -1,9 +1,3 @@
|
|
|
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
|
-
// Conversion of the classical rules to tableau operations, each with the Isabelle tactic that
|
|
5
|
-
// replays it during proof reconstruction.
|
|
6
|
-
|
|
7
1
|
import { TlaIsabelleError } from "../../../../errors";
|
|
8
2
|
import { revcutRl, zeroVarIndexes } from "../../pure/drule";
|
|
9
3
|
import { unifyTermNet } from "../../pure/net";
|
|
@@ -33,6 +27,7 @@ import {
|
|
|
33
27
|
mkBlastSkolem,
|
|
34
28
|
mkBlastVar,
|
|
35
29
|
mkGoal,
|
|
30
|
+
splitGoalPrems,
|
|
36
31
|
stripBlastImpConcl,
|
|
37
32
|
stripBlastImpPrems,
|
|
38
33
|
toTemplate,
|
|
@@ -42,19 +37,12 @@ import {
|
|
|
42
37
|
type VarRef,
|
|
43
38
|
} from "./term";
|
|
44
39
|
|
|
45
|
-
// A tableau rule: the formula it applies to, the formulae of each new branch, and the tactic
|
|
46
|
-
// for the flags upd (the inference updated the branch), dup (duplicate the formula) and rot
|
|
47
|
-
// (rotate the new hypotheses).
|
|
48
40
|
export interface TableauRule {
|
|
49
41
|
readonly major: BlastTerm;
|
|
50
42
|
readonly prems: readonly (readonly BlastTerm[])[];
|
|
51
43
|
readonly tactic: (isUpdated: boolean, isDup: boolean, isRotated: boolean) => GoalTactic;
|
|
52
44
|
}
|
|
53
45
|
|
|
54
|
-
// Blast converts each rule it looks up afresh, with fresh variables and Skolem terms. This
|
|
55
|
-
// converts each rule once, numbering them: concl is the conclusion's variable, which conversion
|
|
56
|
-
// sets to *False*, and skolems counts the Skolem terms, which take fresh names in this order. An
|
|
57
|
-
// ill-formed rule has no major premise, but still takes the names its conversion took.
|
|
58
46
|
export interface RuleTemplate {
|
|
59
47
|
readonly count: number;
|
|
60
48
|
readonly concl: number | undefined;
|
|
@@ -63,8 +51,6 @@ export interface RuleTemplate {
|
|
|
63
51
|
readonly prems: readonly (readonly Template[])[];
|
|
64
52
|
}
|
|
65
53
|
|
|
66
|
-
// The conclusion becomes the goal or the negated assumption *False*: delete it. A premise without
|
|
67
|
-
// it is ill-formed and could make reconstruction fail.
|
|
68
54
|
const deleteConcl = (state: BlastState, prems: readonly BlastTerm[]): BlastTerm[] | undefined => {
|
|
69
55
|
const position = prems.findIndex((prem) => {
|
|
70
56
|
if (prem.kind !== "App" || prem.fun.kind !== "Const") return false;
|
|
@@ -79,8 +65,6 @@ const deleteConcl = (state: BlastState, prems: readonly BlastTerm[]): BlastTerm[
|
|
|
79
65
|
return position === -1 ? undefined : [...prems.slice(0, position), ...prems.slice(position + 1)];
|
|
80
66
|
};
|
|
81
67
|
|
|
82
|
-
// Skolemizes a premise with placeholder Skolem terms, adding them to skolems in the order that
|
|
83
|
-
// blast names them.
|
|
84
68
|
const skoPrem = (skolems: BlastTerm[], prem: BlastTerm): BlastTerm => {
|
|
85
69
|
const body = destConstApp(prem, "Pure.all");
|
|
86
70
|
if (body?.kind !== "Abs") return prem;
|
|
@@ -97,8 +81,6 @@ const illFormed = (skolems: number): RuleTemplate => ({
|
|
|
97
81
|
prems: [],
|
|
98
82
|
});
|
|
99
83
|
|
|
100
|
-
// fromRule's convertRule, which expects an elimination rule to have a formula variable as its
|
|
101
|
-
// conclusion.
|
|
102
84
|
const makeElimTemplate = (state: BlastState, rule: Thm): RuleTemplate => {
|
|
103
85
|
const trueprop = state.context.data.trueprop;
|
|
104
86
|
const term = fromTerm(state.context.consts, rule.prop);
|
|
@@ -111,11 +93,7 @@ const makeElimTemplate = (state: BlastState, rule: Thm): RuleTemplate => {
|
|
|
111
93
|
const skolems: BlastTerm[] = [];
|
|
112
94
|
const converted: BlastTerm[][] = [];
|
|
113
95
|
for (const prem of prems.slice(1)) {
|
|
114
|
-
const
|
|
115
|
-
const deleted = deleteConcl(state, [
|
|
116
|
-
mkGoal(stripBlastImpConcl(trueprop, skolemized)),
|
|
117
|
-
...stripBlastImpPrems(trueprop, skolemized),
|
|
118
|
-
]);
|
|
96
|
+
const deleted = deleteConcl(state, splitGoalPrems(trueprop, skoPrem(skolems, prem)));
|
|
119
97
|
if (deleted === undefined) return illFormed(skolems.length);
|
|
120
98
|
converted.push(deleted);
|
|
121
99
|
}
|
|
@@ -128,20 +106,15 @@ const makeElimTemplate = (state: BlastState, rule: Thm): RuleTemplate => {
|
|
|
128
106
|
};
|
|
129
107
|
};
|
|
130
108
|
|
|
131
|
-
// fromIntrRule's conversion.
|
|
132
109
|
const makeIntroTemplate = (state: BlastState, rule: Thm): RuleTemplate => {
|
|
133
110
|
const trueprop = state.context.data.trueprop;
|
|
134
111
|
const term = fromTerm(state.context.consts, rule.prop);
|
|
135
112
|
const refs: VarRef[] = [];
|
|
136
113
|
toTemplate(refs, [], term);
|
|
137
114
|
const skolems: BlastTerm[] = [];
|
|
138
|
-
const converted = stripBlastImpPrems(trueprop, term).map((prem) =>
|
|
139
|
-
|
|
140
|
-
|
|
141
|
-
mkGoal(stripBlastImpConcl(trueprop, skolemized)),
|
|
142
|
-
...stripBlastImpPrems(trueprop, skolemized),
|
|
143
|
-
];
|
|
144
|
-
});
|
|
115
|
+
const converted = stripBlastImpPrems(trueprop, term).map((prem) =>
|
|
116
|
+
splitGoalPrems(trueprop, skoPrem(skolems, prem)),
|
|
117
|
+
);
|
|
145
118
|
return {
|
|
146
119
|
count: refs.length,
|
|
147
120
|
concl: undefined,
|
|
@@ -151,7 +124,6 @@ const makeIntroTemplate = (state: BlastState, rule: Thm): RuleTemplate => {
|
|
|
151
124
|
};
|
|
152
125
|
};
|
|
153
126
|
|
|
154
|
-
// Like dup_elim, but puts the duplicated major premise first.
|
|
155
127
|
const revDupElim = (rule: Thm) => {
|
|
156
128
|
const result = seqHead(assumption(undefined, 2, rsn(rule, 2, revcutRl)));
|
|
157
129
|
if (result === undefined) throw new TlaIsabelleError("ERROR", "rev_dup_elim: Seq.hd");
|
|
@@ -161,7 +133,6 @@ const revDupElim = (rule: Thm) => {
|
|
|
161
133
|
const countNewHyps = (prem: readonly BlastTerm[]) =>
|
|
162
134
|
prem.filter((term) => destConstApp(term, GOAL_NAME) === undefined).length;
|
|
163
135
|
|
|
164
|
-
// Rotates the assumptions in all new subgoals for the LIFO discipline.
|
|
165
136
|
const rotSubgoalsTac =
|
|
166
137
|
(isRotated: boolean, prems: readonly (readonly BlastTerm[])[]): GoalTactic =>
|
|
167
138
|
(index) =>
|
|
@@ -174,8 +145,6 @@ const rotSubgoalsTac =
|
|
|
174
145
|
),
|
|
175
146
|
);
|
|
176
147
|
|
|
177
|
-
// Resolution or matching: if the inference updated the branch, the proof state may be updated.
|
|
178
|
-
// Matching keeps the tactics more deterministic in the presence of variables.
|
|
179
148
|
const emtac = (state: BlastState, isUpdated: boolean, rule: Thm): GoalTactic =>
|
|
180
149
|
isUpdated ? eresolveTac(state.context.limits, [rule]) : ematchTac(state.context.limits, [rule]);
|
|
181
150
|
|
|
@@ -204,9 +173,6 @@ const intrRuleTactic =
|
|
|
204
173
|
rotSubgoalsTac(isRotated, prems)(index),
|
|
205
174
|
);
|
|
206
175
|
|
|
207
|
-
// A tableau rule from a rule's template. Blast tries the rules in order until one's major premise
|
|
208
|
-
// unifies, and often only checks that a rule exists, so this instantiates the template with fresh
|
|
209
|
-
// variables only when the major premise is used, and the premises only when they are.
|
|
210
176
|
class InstantiatedRule implements TableauRule {
|
|
211
177
|
private readonly state: BlastState;
|
|
212
178
|
private readonly rule: Thm;
|
|
@@ -234,7 +200,6 @@ class InstantiatedRule implements TableauRule {
|
|
|
234
200
|
this.skolems = skolems;
|
|
235
201
|
}
|
|
236
202
|
|
|
237
|
-
// Fresh variables for the template's, with the conclusion's set to *False*.
|
|
238
203
|
private getVars() {
|
|
239
204
|
if (this.vars !== undefined) return this.vars;
|
|
240
205
|
const vars: BlastTerm[] = [];
|
|
@@ -264,7 +229,6 @@ class InstantiatedRule implements TableauRule {
|
|
|
264
229
|
return this.instantiatedPrems;
|
|
265
230
|
}
|
|
266
231
|
|
|
267
|
-
// Since unsafe rules are delayed, dup is always false for introduction rules.
|
|
268
232
|
tactic(isUpdated: boolean, isDup: boolean, isRotated: boolean) {
|
|
269
233
|
return (this.isIntro ? intrRuleTactic : elimRuleTactic)(this.state, this.rule, this.prems)(
|
|
270
234
|
isUpdated,
|
|
@@ -274,8 +238,6 @@ class InstantiatedRule implements TableauRule {
|
|
|
274
238
|
}
|
|
275
239
|
}
|
|
276
240
|
|
|
277
|
-
// fromRule or fromIntrRule: undefined for an ill-formed rule. Its Skolem terms take their names
|
|
278
|
-
// now, as blast converts all the rules it looks up at once.
|
|
279
241
|
const instantiateRule = (
|
|
280
242
|
state: BlastState,
|
|
281
243
|
vars: readonly VarRef[],
|
|
@@ -295,7 +257,6 @@ const instantiateRule = (
|
|
|
295
257
|
: new InstantiatedRule(state, rule, isIntro, template, template.major, skolems);
|
|
296
258
|
};
|
|
297
259
|
|
|
298
|
-
// Too flexible assertions or goals, such as those of (!!P. ~P) ==> 0 == 1.
|
|
299
260
|
const isVarForm = (state: BlastState, term: BlastTerm) =>
|
|
300
261
|
term.kind === "Var" || destConstApp(term, state.context.data.notName)?.kind === "Var";
|
|
301
262
|
|
|
@@ -325,6 +286,5 @@ export const netMkRules = (
|
|
|
325
286
|
return rules;
|
|
326
287
|
};
|
|
327
288
|
|
|
328
|
-
// Converts *Goal* to a negated assumption in first position.
|
|
329
289
|
export const negOfGoalTac = (state: BlastState): GoalTactic =>
|
|
330
290
|
thenGoal(resolveTac(state.context.limits, [state.context.data.ccontr]), rotateTac(-1));
|
|
@@ -1,9 +1,3 @@
|
|
|
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 object logic's data for blast, and the state of one search: the names of its Skolem
|
|
5
|
-
// constants and the trail of variable assignments that backtracking undoes.
|
|
6
|
-
|
|
7
1
|
import { bumpInit, bumpString } from "../../pure/name";
|
|
8
2
|
import type { GoalTactic } from "../../pure/tactical";
|
|
9
3
|
import type { Limits } from "../../pure/interrupt";
|
|
@@ -13,19 +7,14 @@ import type { Claset } from "../classical";
|
|
|
13
7
|
import type { RuleTemplate } from "./rules";
|
|
14
8
|
import { blastAconv, varOccur, wkNorm, type BlastTerm, type ConstType, type VarRef } from "./term";
|
|
15
9
|
|
|
16
|
-
// BLAST_DATA, with the two rules of other structures that blast uses.
|
|
17
10
|
export interface BlastData {
|
|
18
11
|
readonly trueprop: string;
|
|
19
12
|
readonly equalityName: string;
|
|
20
13
|
readonly notName: string;
|
|
21
|
-
// ~P ==> P ==> R
|
|
22
14
|
readonly notE: Thm;
|
|
23
|
-
// (~P ==> False) ==> P
|
|
24
15
|
readonly ccontr: Thm;
|
|
25
16
|
readonly hypSubstTac: (limits: Limits) => GoalTactic;
|
|
26
|
-
// The classical reasoner's (~P ==> P) ==> P, which Classical.dup_intr resolves with.
|
|
27
17
|
readonly classical: Thm;
|
|
28
|
-
// The atomize rules of Object_Logic, newest first, for atomize_prems_tac.
|
|
29
18
|
readonly atomize: readonly Thm[];
|
|
30
19
|
}
|
|
31
20
|
|
|
@@ -33,20 +22,16 @@ export interface BlastContext {
|
|
|
33
22
|
readonly limits: Limits;
|
|
34
23
|
readonly claset: Claset;
|
|
35
24
|
readonly data: BlastData;
|
|
36
|
-
// The constants' declared types, for Sign.const_typargs.
|
|
37
25
|
readonly consts: ReadonlyMap<string, ConstType>;
|
|
38
|
-
// The elimination and introduction rules converted to tableau rules so far.
|
|
39
26
|
readonly elimTemplates: WeakMap<Thm, RuleTemplate>;
|
|
40
27
|
readonly introTemplates: WeakMap<Thm, RuleTemplate>;
|
|
41
28
|
}
|
|
42
29
|
|
|
43
|
-
// A formula pending on a branch, with its may-duplicate flag.
|
|
44
30
|
export interface Formula {
|
|
45
31
|
readonly term: BlastTerm;
|
|
46
32
|
readonly md: boolean;
|
|
47
33
|
}
|
|
48
34
|
|
|
49
|
-
// The safe and unsafe formulae of one level of a branch.
|
|
50
35
|
export interface Level {
|
|
51
36
|
readonly safe: readonly Formula[];
|
|
52
37
|
readonly unsafe: readonly Formula[];
|
|
@@ -54,16 +39,11 @@ export interface Level {
|
|
|
54
39
|
|
|
55
40
|
export interface Branch {
|
|
56
41
|
readonly pairs: readonly Level[];
|
|
57
|
-
// Literals: irreducible formulae.
|
|
58
42
|
readonly lits: readonly BlastTerm[];
|
|
59
|
-
// The variables occurring in the branch.
|
|
60
43
|
readonly vars: readonly VarRef[];
|
|
61
|
-
// The resource limit.
|
|
62
44
|
readonly lim: number;
|
|
63
45
|
}
|
|
64
46
|
|
|
65
|
-
// A choice point: the trail length and branch count when it was made, and the token its handler
|
|
66
|
-
// catches. The token is undefined for PROVE, the end of the search.
|
|
67
47
|
export interface Choice {
|
|
68
48
|
readonly ntrl: number;
|
|
69
49
|
readonly nbrs: number;
|
|
@@ -72,14 +52,11 @@ export interface Choice {
|
|
|
72
52
|
|
|
73
53
|
export interface BlastState {
|
|
74
54
|
readonly context: BlastContext;
|
|
75
|
-
// The used names with their latest renaming, a Name.context updated in place.
|
|
76
55
|
readonly names: Map<string, string | undefined>;
|
|
77
|
-
// The assigned variables, latest last, so that the trail's length is ntrail.
|
|
78
56
|
readonly trail: VarRef[];
|
|
79
57
|
}
|
|
80
58
|
|
|
81
|
-
//
|
|
82
|
-
// Error, since backtracking is frequent and needs no stack trace.
|
|
59
|
+
// Not an Error: backtracking is frequent and needs no stack trace.
|
|
83
60
|
class Backtrack {
|
|
84
61
|
readonly token: object | undefined;
|
|
85
62
|
constructor(token: object | undefined) {
|
|
@@ -87,7 +64,6 @@ class Backtrack {
|
|
|
87
64
|
}
|
|
88
65
|
}
|
|
89
66
|
|
|
90
|
-
// The choice points, latest first. The last is PROVE's.
|
|
91
67
|
export type Choices = List<Choice> | undefined;
|
|
92
68
|
|
|
93
69
|
export const isBacktrackTo = (error: unknown, token: object | undefined) =>
|
|
@@ -97,7 +73,6 @@ export const backtrack = (choices: Choices): never => {
|
|
|
97
73
|
throw new Backtrack(choices?.head.token);
|
|
98
74
|
};
|
|
99
75
|
|
|
100
|
-
// Name.variant on the state's names, for names without trailing underscores.
|
|
101
76
|
export const gensym = (state: BlastState, name: string) => {
|
|
102
77
|
const names = state.names;
|
|
103
78
|
if (!names.has(name)) {
|
|
@@ -112,7 +87,6 @@ export const gensym = (state: BlastState, name: string) => {
|
|
|
112
87
|
return current;
|
|
113
88
|
};
|
|
114
89
|
|
|
115
|
-
// Restores the trail to a previous length, for backtracking.
|
|
116
90
|
export const clearTo = (state: BlastState, count: number) => {
|
|
117
91
|
while (state.trail.length > count) {
|
|
118
92
|
const ref = state.trail.pop();
|
|
@@ -120,8 +94,6 @@ export const clearTo = (state: BlastState, count: number) => {
|
|
|
120
94
|
}
|
|
121
95
|
};
|
|
122
96
|
|
|
123
|
-
// First-order unification with bound variables. The variables of vars are local to a rule: their
|
|
124
|
-
// assignments are not trailed.
|
|
125
97
|
const updateVar = (
|
|
126
98
|
state: BlastState,
|
|
127
99
|
vars: readonly VarRef[],
|
|
@@ -1,10 +1,3 @@
|
|
|
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
|
-
// Blast's prototerms: untyped terms whose variables are mutable references, so that unification
|
|
5
|
-
// updates them in place and backtracking resets them from the trail. Constants carry their type
|
|
6
|
-
// arguments as terms, so that overloading is tracked faithfully.
|
|
7
|
-
|
|
8
1
|
import { typargs, type TypargPosition } from "../../pure/consts";
|
|
9
2
|
import {
|
|
10
3
|
dummyT,
|
|
@@ -17,14 +10,11 @@ import {
|
|
|
17
10
|
type Typ,
|
|
18
11
|
} from "../../pure/term";
|
|
19
12
|
|
|
20
|
-
// A variable's assignment: term option Unsynchronized.ref, compared by identity.
|
|
21
13
|
export interface VarRef {
|
|
22
14
|
value: BlastTerm | undefined;
|
|
23
15
|
}
|
|
24
16
|
|
|
25
|
-
//
|
|
26
|
-
// doesn't use undefined, and the constructors below list them in this order. So all prototerms
|
|
27
|
-
// share one object layout, and V8 compiles the many switches on kind to monomorphic loads.
|
|
17
|
+
// Every prototerm lists every field in this order, unused ones undefined, so V8 sees one object layout.
|
|
28
18
|
interface Fields {
|
|
29
19
|
readonly name: string;
|
|
30
20
|
readonly typargs: readonly BlastTerm[];
|
|
@@ -140,7 +130,6 @@ export const mkBlastApp = (fun: BlastTerm, arg: BlastTerm): BlastTerm => ({
|
|
|
140
130
|
export const listBlastComb = (head: BlastTerm, args: readonly BlastTerm[]) =>
|
|
141
131
|
args.reduce((result, arg) => mkBlastApp(result, arg), head);
|
|
142
132
|
|
|
143
|
-
// Const (c, _) $ t: the argument of a constant applied to one term, if the term is one.
|
|
144
133
|
export const destConstApp = (term: BlastTerm, name: string): BlastTerm | undefined =>
|
|
145
134
|
term.kind === "App" && term.fun.kind === "Const" && term.fun.name === name ? term.arg : undefined;
|
|
146
135
|
|
|
@@ -148,7 +137,6 @@ export const mkGoal = (term: BlastTerm) => mkBlastApp(mkBlastConst(GOAL_NAME), t
|
|
|
148
137
|
|
|
149
138
|
export const isGoal = (term: BlastTerm) => destConstApp(term, GOAL_NAME) !== undefined;
|
|
150
139
|
|
|
151
|
-
// Tests whether two terms are alpha-convertible, chasing instantiations.
|
|
152
140
|
export const blastAconv = (left: BlastTerm, right: BlastTerm): boolean => {
|
|
153
141
|
if (left === right) return true;
|
|
154
142
|
if (left.kind === "Const" && right.kind === "Const")
|
|
@@ -169,21 +157,15 @@ export const blastAconv = (left: BlastTerm, right: BlastTerm): boolean => {
|
|
|
169
157
|
const blastAconvs = (lefts: readonly BlastTerm[], rights: readonly BlastTerm[]) =>
|
|
170
158
|
lefts.length === rights.length && lefts.every((left, index) => blastAconv(left, rights[index]));
|
|
171
159
|
|
|
172
|
-
const memTerm = (term: BlastTerm, terms: readonly BlastTerm[]) =>
|
|
173
|
-
terms.some((other) => blastAconv(term, other));
|
|
174
|
-
|
|
175
160
|
export const insTerm = (term: BlastTerm, terms: readonly BlastTerm[]) =>
|
|
176
|
-
|
|
161
|
+
terms.some((other) => blastAconv(term, other)) ? terms : [term, ...terms];
|
|
177
162
|
|
|
178
163
|
export const sameVars = (left: readonly VarRef[], right: readonly VarRef[]) =>
|
|
179
164
|
left.length === right.length && left.every((ref, index) => ref === right[index]);
|
|
180
165
|
|
|
181
|
-
const memVar = (ref: VarRef, refs: readonly VarRef[]) => refs.includes(ref);
|
|
182
|
-
|
|
183
166
|
const insVar = (ref: VarRef, refs: readonly VarRef[]) =>
|
|
184
|
-
|
|
167
|
+
refs.includes(ref) ? refs : [ref, ...refs];
|
|
185
168
|
|
|
186
|
-
// Accumulates the unassigned variables of a term, suppressing duplicates.
|
|
187
169
|
export const addTermVars = (term: BlastTerm, refs: readonly VarRef[]): readonly VarRef[] => {
|
|
188
170
|
switch (term.kind) {
|
|
189
171
|
case "Skolem":
|
|
@@ -213,7 +195,6 @@ const addVarsVars = (vars: readonly VarRef[], refs: readonly VarRef[]) =>
|
|
|
213
195
|
refs,
|
|
214
196
|
);
|
|
215
197
|
|
|
216
|
-
// Chases the assignments of the variables, returning the unassigned ones.
|
|
217
198
|
export const varsInVars = (refs: readonly VarRef[]) => addVarsVars(refs, []);
|
|
218
199
|
|
|
219
200
|
const incrBv = (increment: number, level: number, term: BlastTerm): BlastTerm => {
|
|
@@ -232,7 +213,6 @@ const incrBv = (increment: number, level: number, term: BlastTerm): BlastTerm =>
|
|
|
232
213
|
export const incrBlastBoundvars = (increment: number, term: BlastTerm) =>
|
|
233
214
|
increment === 0 ? term : incrBv(increment, 0, term);
|
|
234
215
|
|
|
235
|
-
// member (op =) (loose_bnos term) 0, which does not chase variables.
|
|
236
216
|
export const hasLooseBound0 = (term: BlastTerm, level = 0): boolean => {
|
|
237
217
|
switch (term.kind) {
|
|
238
218
|
case "Bound":
|
|
@@ -262,8 +242,6 @@ const substBoundAt = (arg: BlastTerm, level: number, term: BlastTerm): BlastTerm
|
|
|
262
242
|
|
|
263
243
|
export const blastSubstBound = (arg: BlastTerm, body: BlastTerm) => substBoundAt(arg, 0, body);
|
|
264
244
|
|
|
265
|
-
// Normalizes, but not the bodies of abstractions. Returns the very same term where nothing
|
|
266
|
-
// changes, so normalizing a normal formula allocates nothing.
|
|
267
245
|
export const norm = (term: BlastTerm): BlastTerm => {
|
|
268
246
|
switch (term.kind) {
|
|
269
247
|
case "Skolem": {
|
|
@@ -319,7 +297,6 @@ const wkNormAux = (term: BlastTerm): BlastTerm => {
|
|
|
319
297
|
}
|
|
320
298
|
};
|
|
321
299
|
|
|
322
|
-
// Weak, one-level normalization for unification; eta-contracts where it can.
|
|
323
300
|
export const wkNorm = (term: BlastTerm): BlastTerm => {
|
|
324
301
|
const head = blastHeadOf(term);
|
|
325
302
|
return head.kind === "Const" || head.kind === "Skolem" || head.kind === "Free"
|
|
@@ -327,7 +304,6 @@ export const wkNorm = (term: BlastTerm): BlastTerm => {
|
|
|
327
304
|
: wkNormAux(term);
|
|
328
305
|
};
|
|
329
306
|
|
|
330
|
-
// Does variable ref occur in term? Dangling bound variables count as occurrences too.
|
|
331
307
|
const occurs = (ref: VarRef, level: number, term: BlastTerm): boolean => {
|
|
332
308
|
switch (term.kind) {
|
|
333
309
|
case "Var":
|
|
@@ -351,14 +327,12 @@ const occurs = (ref: VarRef, level: number, term: BlastTerm): boolean => {
|
|
|
351
327
|
|
|
352
328
|
export const varOccur = (ref: VarRef, term: BlastTerm) => occurs(ref, 0, term);
|
|
353
329
|
|
|
354
|
-
// An entry of the association lists from schematic variables to prototerms that fromTerm keeps.
|
|
355
330
|
export interface VarEntry {
|
|
356
331
|
readonly name: string;
|
|
357
332
|
readonly index: number;
|
|
358
333
|
readonly term: BlastTerm;
|
|
359
334
|
}
|
|
360
335
|
|
|
361
|
-
// AList.lookup, adding a fresh variable for a new one.
|
|
362
336
|
const lookupVar = (entries: VarEntry[], name: string, index: number): BlastTerm => {
|
|
363
337
|
const known = entries.find((entry) => entry.index === index && entry.name === name);
|
|
364
338
|
if (known !== undefined) return known.term;
|
|
@@ -384,7 +358,6 @@ export const fromConst = (
|
|
|
384
358
|
type: Typ,
|
|
385
359
|
) => {
|
|
386
360
|
const declared = consts.get(name);
|
|
387
|
-
// Sign.const_typargs. Constants the map lacks are the ones a theory declares, which have none.
|
|
388
361
|
return declared === undefined || declared.typargs.length === 0
|
|
389
362
|
? mkBlastConst(name)
|
|
390
363
|
: mkBlastConst(
|
|
@@ -425,12 +398,9 @@ const fromTermAux = (
|
|
|
425
398
|
}
|
|
426
399
|
};
|
|
427
400
|
|
|
428
|
-
// Converts a real term to a prototerm, eta-contracting it.
|
|
429
401
|
export const fromTerm = (consts: ReadonlyMap<string, ConstType>, term: Term): BlastTerm =>
|
|
430
402
|
fromTermAux(consts, [], [], term);
|
|
431
403
|
|
|
432
|
-
// A prototerm with its variables and Skolem terms numbered, so that instantiating it with fresh
|
|
433
|
-
// ones gives a copy that shares the parts without them, which blast never updates.
|
|
434
404
|
export type Template =
|
|
435
405
|
| { readonly kind: "ground"; readonly term: BlastTerm }
|
|
436
406
|
| { readonly kind: "var"; readonly index: number }
|
|
@@ -441,7 +411,6 @@ export type Template =
|
|
|
441
411
|
|
|
442
412
|
const isGround = (template: Template) => template.kind === "ground";
|
|
443
413
|
|
|
444
|
-
// Numbers the variables in refs, adding new ones, and the Skolem terms by their place in skolems.
|
|
445
414
|
export const toTemplate = (
|
|
446
415
|
refs: VarRef[],
|
|
447
416
|
skolems: readonly BlastTerm[],
|
|
@@ -507,7 +476,6 @@ export const instantiateTemplate = (
|
|
|
507
476
|
|
|
508
477
|
const dummyVar = mkVar("etc", 0, dummyT);
|
|
509
478
|
|
|
510
|
-
// Converts a prototerm to a real term with dummy types for net lookup, stopping at depth.
|
|
511
479
|
export const toTerm = (depth: number, term: BlastTerm): Term => {
|
|
512
480
|
if (depth === 0) return dummyVar;
|
|
513
481
|
switch (term.kind) {
|
|
@@ -527,7 +495,6 @@ export const toTerm = (depth: number, term: BlastTerm): Term => {
|
|
|
527
495
|
|
|
528
496
|
const stripTrueprop = (trueprop: string, term: BlastTerm) => destConstApp(term, trueprop) ?? term;
|
|
529
497
|
|
|
530
|
-
// A1 ==> ... ==> An ==> B goes to [A1, ..., An], where B is not an implication.
|
|
531
498
|
export const stripBlastImpPrems = (trueprop: string, term: BlastTerm): BlastTerm[] =>
|
|
532
499
|
term.kind === "App" &&
|
|
533
500
|
term.fun.kind === "App" &&
|
|
@@ -536,7 +503,6 @@ export const stripBlastImpPrems = (trueprop: string, term: BlastTerm): BlastTerm
|
|
|
536
503
|
? [stripTrueprop(trueprop, term.fun.arg), ...stripBlastImpPrems(trueprop, term.arg)]
|
|
537
504
|
: [];
|
|
538
505
|
|
|
539
|
-
// A1 ==> ... ==> An ==> B goes to B, where B is not an implication.
|
|
540
506
|
export const stripBlastImpConcl = (trueprop: string, term: BlastTerm): BlastTerm =>
|
|
541
507
|
term.kind === "App" &&
|
|
542
508
|
term.fun.kind === "App" &&
|
|
@@ -544,3 +510,8 @@ export const stripBlastImpConcl = (trueprop: string, term: BlastTerm): BlastTerm
|
|
|
544
510
|
term.fun.fun.name === "Pure.imp"
|
|
545
511
|
? stripBlastImpConcl(trueprop, term.arg)
|
|
546
512
|
: stripTrueprop(trueprop, term);
|
|
513
|
+
|
|
514
|
+
export const splitGoalPrems = (trueprop: string, term: BlastTerm): BlastTerm[] => [
|
|
515
|
+
mkGoal(stripBlastImpConcl(trueprop, term)),
|
|
516
|
+
...stripBlastImpPrems(trueprop, term),
|
|
517
|
+
];
|
|
@@ -1,9 +1,3 @@
|
|
|
1
|
-
// Ported from Isabelle2025's Provers/clasimp.ML and the prune_params_tac of Pure/tactic.ML.
|
|
2
|
-
// Copyright (c) 1986-2025 University of Cambridge, Technische Universitaet Muenchen, and
|
|
3
|
-
// contributors, see LICENSE.
|
|
4
|
-
//
|
|
5
|
-
// The classical reasoner combined with the simplifier: auto, clarsimp and force.
|
|
6
|
-
|
|
7
1
|
import { trivForallEquality } from "../pure/drule";
|
|
8
2
|
import { selectGoal } from "../pure/goal";
|
|
9
3
|
import { addSimps, emptySimpset, type SimpContext } from "../pure/raw-simplifier";
|
|
@@ -49,11 +43,9 @@ import {
|
|
|
49
43
|
export interface ClasimpContext {
|
|
50
44
|
readonly classical: ClassicalContext;
|
|
51
45
|
readonly simp: SimpContext;
|
|
52
|
-
// Blast.depth_tac, the Blast argument of the Clasimp functor.
|
|
53
46
|
readonly blastDepthTac: (context: ClassicalContext, limit: number) => GoalTactic;
|
|
54
47
|
}
|
|
55
48
|
|
|
56
|
-
// addss: the simplifier as an unsafe wrapper.
|
|
57
49
|
const addss = (context: ClasimpContext): ClassicalContext =>
|
|
58
50
|
withClaset(
|
|
59
51
|
context.classical,
|
|
@@ -62,7 +54,6 @@ const addss = (context: ClasimpContext): ClassicalContext =>
|
|
|
62
54
|
),
|
|
63
55
|
);
|
|
64
56
|
|
|
65
|
-
// addSss: the simplifier as a safe wrapper.
|
|
66
57
|
const addSss = (context: ClasimpContext): ClassicalContext =>
|
|
67
58
|
withClaset(
|
|
68
59
|
context.classical,
|
|
@@ -74,7 +65,6 @@ const addSss = (context: ClasimpContext): ClassicalContext =>
|
|
|
74
65
|
export const clarsimpTac = (context: ClasimpContext): GoalTactic =>
|
|
75
66
|
thenAllNew(safeAsmFullSimpTac(context.simp), clarifyTac(addSss(context)));
|
|
76
67
|
|
|
77
|
-
// A variant of Classical.depth_tac that keeps the simplifier from interfering with dup_step_tac.
|
|
78
68
|
const nodupDepthTac =
|
|
79
69
|
(context: ClassicalContext, limit: number): GoalTactic =>
|
|
80
70
|
(index) =>
|
|
@@ -97,12 +87,11 @@ const nodupDepthTac =
|
|
|
97
87
|
),
|
|
98
88
|
)(index)(state);
|
|
99
89
|
|
|
100
|
-
// prune_params_tac: drops the parameters that no goal uses.
|
|
101
90
|
const pruneParamsTac = (simp: SimpContext): Tactic => {
|
|
102
91
|
const empty = { ...simp, simpset: emptySimpset };
|
|
103
92
|
const context = { ...empty, simpset: addSimps(empty, [trivForallEquality]) };
|
|
104
93
|
return primitive((state) =>
|
|
105
|
-
Array.from({ length: nprems(state) }, (
|
|
94
|
+
Array.from({ length: nprems(state) }, (_value, offset) => offset + 1).reduce(
|
|
106
95
|
(current, index) =>
|
|
107
96
|
gconvRule(
|
|
108
97
|
(term) =>
|
|
@@ -125,8 +114,6 @@ const mkAutoTac = (context: ClasimpContext, depth: number, nodupDepth: number):
|
|
|
125
114
|
changed(nodupDepthTac(addss(context), nodupDepth)(index)),
|
|
126
115
|
);
|
|
127
116
|
return every([
|
|
128
|
-
// PARALLEL_ALLGOALS simplifies each goal on its own only when no goal has schematic variables,
|
|
129
|
-
// which gives the same result as simplifying them in turn.
|
|
130
117
|
determ(allGoals(asmFullSimpTac(context.simp))),
|
|
131
118
|
tryTac(safeTac(context.classical)),
|
|
132
119
|
repeatDeterm(firstGoalTac(mainTac)),
|
|
@@ -137,7 +124,6 @@ const mkAutoTac = (context: ClasimpContext, depth: number, nodupDepth: number):
|
|
|
137
124
|
|
|
138
125
|
export const autoTac = (context: ClasimpContext) => mkAutoTac(context, 4, 2);
|
|
139
126
|
|
|
140
|
-
// force_tac: aims to solve the goal outright, with clarify, the simplifier and best-first search.
|
|
141
127
|
export const forceTac = (context: ClasimpContext, atomizeRules: readonly Thm[]): GoalTactic => {
|
|
142
128
|
const classical = addss(context);
|
|
143
129
|
return selectGoal(
|