tla-ts 0.0.10-dev.63a6693bd → 0.0.10-dev.6b2a6741a
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 +2 -1
- package/dist/compile.cjs +3 -3
- package/dist/compile.js +1 -1
- package/dist/deciders.cjs +41 -37
- package/dist/deciders.js +45 -41
- package/dist/index.cjs +1 -1
- package/dist/index.d.cts +5 -1
- package/dist/index.d.ts +5 -1
- 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 +2682 -426
- package/dist/prove.js +2679 -423
- package/dist/run.cjs +43 -42
- package/dist/run.js +44 -43
- package/dist/tlapm.cjs +1 -1
- package/dist/tlapm.js +1 -1
- package/dist/transfer.cjs +43 -40
- package/dist/transfer.js +43 -40
- package/dist/worker.cjs +7 -7
- package/dist/worker.js +7 -7
- package/package.json +1 -1
- package/src/ast.ts +4 -3
- package/src/bags.ts +46 -28
- package/src/check-trace.ts +2 -16
- package/src/check.ts +349 -91
- package/src/cli/runtime-invariants.ts +20 -56
- package/src/cli/tlapm.ts +424 -62
- package/src/cli/tlc-arguments.ts +2 -2
- package/src/cli/tlc-output.ts +4 -5
- package/src/cli/tlc-usage.ts +0 -1
- package/src/cli/tlc.ts +26 -7
- package/src/cli/xml-exporter.ts +1 -1
- package/src/codegen.ts +9 -5
- package/src/dependencies.ts +72 -11
- package/src/dfid.ts +9 -2
- package/src/environment.ts +65 -36
- package/src/errors.ts +38 -3
- package/src/evaluate.ts +92 -32
- package/src/exit-codes.ts +5 -2
- package/src/instances.ts +5 -5
- package/src/java-overrides.ts +2 -2
- package/src/levels.ts +138 -90
- package/src/lexer.ts +5 -3
- package/src/liveness-checker.ts +572 -204
- package/src/liveness.ts +47 -32
- package/src/obligations/action.ts +10 -6
- package/src/obligations/anonymize.ts +33 -14
- package/src/obligations/enabled-axioms.ts +218 -0
- package/src/obligations/equality.ts +1 -3
- package/src/obligations/expression.ts +18 -6
- package/src/obligations/format.ts +0 -2
- package/src/obligations/generate.ts +22 -17
- package/src/obligations/index.ts +37 -7
- package/src/obligations/levels.ts +24 -11
- package/src/obligations/module.ts +1 -3
- package/src/obligations/normalize.ts +25 -17
- package/src/obligations/operators.ts +0 -2
- package/src/obligations/pragma.ts +53 -16
- package/src/obligations/printer.ts +48 -18
- package/src/obligations/proof.ts +3 -2
- package/src/obligations/regroup.ts +0 -2
- package/src/obligations/simplify.ts +17 -7
- package/src/obligations/source.ts +71 -17
- package/src/obligations/subexpression.ts +45 -18
- package/src/obligations/substitution.ts +1 -3
- package/src/obligations/temporal.ts +0 -2
- package/src/obligations/tuples.ts +0 -2
- package/src/parallel-worker.ts +8 -2
- package/src/parallel.ts +7 -2
- package/src/parser.ts +664 -287
- package/src/pretty-print.ts +1 -1
- package/src/prover/deciders.ts +11 -8
- package/src/prover/isabelle/decide.ts +3 -25
- package/src/prover/isabelle/encode.ts +71 -41
- 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 +149 -3
- package/src/prover/isabelle/isar/method.ts +506 -198
- package/src/prover/isabelle/isar/proof.ts +570 -14
- package/src/prover/isabelle/isar/rule-cases.ts +226 -0
- package/src/prover/isabelle/isar/theory.ts +479 -69
- package/src/prover/isabelle/isar/toplevel.ts +331 -0
- package/src/prover/isabelle/isar/type-check.ts +83 -8
- package/src/prover/isabelle/provers/blast/blast.ts +0 -2
- package/src/prover/isabelle/provers/blast/branch.ts +0 -2
- package/src/prover/isabelle/provers/blast/prove.ts +0 -2
- package/src/prover/isabelle/provers/blast/rules.ts +0 -2
- package/src/prover/isabelle/provers/blast/state.ts +0 -2
- package/src/prover/isabelle/provers/blast/term.ts +0 -2
- package/src/prover/isabelle/provers/clasimp.ts +1 -3
- package/src/prover/isabelle/provers/classical.ts +45 -20
- package/src/prover/isabelle/provers/hypsubst.ts +2 -4
- package/src/prover/isabelle/pure/bicompose.ts +0 -2
- package/src/prover/isabelle/pure/consts.ts +0 -2
- package/src/prover/isabelle/pure/conv.ts +0 -2
- package/src/prover/isabelle/pure/drule.ts +63 -4
- package/src/prover/isabelle/pure/envir.ts +0 -2
- package/src/prover/isabelle/pure/goal.ts +1 -3
- package/src/prover/isabelle/pure/logic.ts +0 -2
- package/src/prover/isabelle/pure/name.ts +0 -2
- package/src/prover/isabelle/pure/net.ts +0 -2
- package/src/prover/isabelle/pure/object-logic.ts +13 -7
- package/src/prover/isabelle/pure/pattern.ts +0 -2
- package/src/prover/isabelle/pure/raw-simplifier.ts +0 -2
- package/src/prover/isabelle/pure/rewriter.ts +4 -11
- package/src/prover/isabelle/pure/search.ts +0 -2
- package/src/prover/isabelle/pure/seq.ts +0 -2
- package/src/prover/isabelle/pure/simplifier.ts +26 -7
- package/src/prover/isabelle/pure/table.ts +0 -2
- package/src/prover/isabelle/pure/tactic.ts +0 -2
- package/src/prover/isabelle/pure/tactical.ts +0 -2
- package/src/prover/isabelle/pure/term-ord.ts +0 -2
- package/src/prover/isabelle/pure/term.ts +3 -5
- package/src/prover/isabelle/pure/thm.ts +0 -2
- package/src/prover/isabelle/pure/type.ts +0 -2
- package/src/prover/isabelle/pure/unify.ts +0 -2
- package/src/prover/isabelle/pure/variable.ts +0 -2
- package/src/prover/isabelle/tla/classical-setup.ts +1 -2
- package/src/prover/isabelle/tla/context.ts +51 -9
- package/src/prover/isabelle/tla/logic-data.ts +1 -1
- package/src/prover/isabelle/tla/logic.ts +40 -1
- package/src/prover/isabelle/tla/simpdata.ts +0 -2
- package/src/prover/isabelle/tools/intuitionistic.ts +28 -12
- package/src/prover/ocaml.ts +4 -1
- package/src/prover/prep/action.ts +19 -12
- package/src/prover/prep/enabled-axioms.ts +11 -2
- package/src/prover/prep/md5.ts +26 -29
- package/src/prover/prep/methods.ts +159 -50
- package/src/prover/prep/normalize.ts +38 -9
- package/src/prover/prove.ts +343 -65
- package/src/prover/ptl/decide.ts +95 -50
- package/src/prover/ptl/encode.ts +2 -3
- package/src/prover/ptl/tableau.ts +28 -2
- package/src/prover/smt/arithmetic.ts +310 -0
- package/src/prover/smt/axioms.ts +12 -8
- package/src/prover/smt/context.ts +42 -6
- package/src/prover/smt/data.ts +191 -84
- package/src/prover/smt/encode.ts +122 -43
- package/src/prover/smt/extensionality.ts +5 -3
- package/src/prover/smt/flatten.ts +4 -6
- package/src/prover/smt/format.ts +28 -4
- package/src/prover/smt/instances.ts +7 -1
- package/src/prover/smt/layout.ts +91 -0
- package/src/prover/smt/rewrite.ts +483 -116
- 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 -1
- 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 +613 -6
- 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 +309 -0
- package/src/prover/smt/solver/asserted-formulas.ts +93 -15
- package/src/prover/smt/solver/ast-lt.ts +165 -11
- package/src/prover/smt/solver/ast-util.ts +160 -2
- package/src/prover/smt/solver/ast.ts +1449 -41
- package/src/prover/smt/solver/auf-solver.ts +0 -1
- package/src/prover/smt/solver/bit-blast-tactic.ts +582 -0
- package/src/prover/smt/solver/bit-blaster.ts +871 -0
- package/src/prover/smt/solver/bound-manager.ts +196 -0
- package/src/prover/smt/solver/bound-simplifier.ts +600 -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 +109 -0
- package/src/prover/smt/solver/case-split-queue.ts +0 -2
- package/src/prover/smt/solver/cg-table.ts +39 -25
- package/src/prover/smt/solver/check-logic.ts +330 -0
- package/src/prover/smt/solver/clause.ts +0 -1
- package/src/prover/smt/solver/cofactor-elim-term-ite.ts +278 -0
- package/src/prover/smt/solver/conflict-resolution.ts +78 -2
- package/src/prover/smt/solver/context.ts +533 -114
- package/src/prover/smt/solver/ctx-simplify.ts +21 -12
- package/src/prover/smt/solver/ctx-solver-simplify.ts +122 -0
- package/src/prover/smt/solver/datatype-decl-plugin.ts +572 -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 +81 -0
- package/src/prover/smt/solver/der.ts +38 -10
- 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 +260 -0
- package/src/prover/smt/solver/dyn-ack.ts +0 -1
- package/src/prover/smt/solver/e-matching.ts +6 -7
- package/src/prover/smt/solver/elim-small-bv-tactic.ts +129 -0
- package/src/prover/smt/solver/elim-uncnstr.ts +542 -0
- package/src/prover/smt/solver/enode.ts +100 -3
- 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 -1
- package/src/prover/smt/solver/expr-safe-replace.ts +26 -2
- 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 +267 -0
- package/src/prover/smt/solver/fingerprints.ts +15 -15
- package/src/prover/smt/solver/fix-dl-var.ts +147 -0
- package/src/prover/smt/solver/flat-literals.ts +0 -1
- 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 +177 -15
- 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 -1
- package/src/prover/smt/solver/hashtable.ts +30 -16
- 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 +109 -36
- package/src/prover/smt/solver/lackr.ts +381 -0
- package/src/prover/smt/solver/lbool.ts +0 -1
- 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 -1
- package/src/prover/smt/solver/logic-tactics.ts +345 -0
- package/src/prover/smt/solver/lp/bound-propagator.ts +0 -1
- package/src/prover/smt/solver/lp/constraints.ts +0 -1
- package/src/prover/smt/solver/lp/containers.ts +7 -2
- package/src/prover/smt/solver/lp/core-solver.ts +18 -3
- package/src/prover/smt/solver/lp/cross-nested.ts +1 -4
- package/src/prover/smt/solver/lp/dep-intervals.ts +0 -3
- package/src/prover/smt/solver/lp/dependency.ts +0 -2
- package/src/prover/smt/solver/lp/dioph-eq.ts +0 -2
- package/src/prover/smt/solver/lp/explanation.ts +0 -1
- package/src/prover/smt/solver/lp/gomory.ts +0 -1
- package/src/prover/smt/solver/lp/hnf-cutter.ts +0 -1
- package/src/prover/smt/solver/lp/hnf.ts +0 -3
- package/src/prover/smt/solver/lp/int-cube.ts +3 -4
- package/src/prover/smt/solver/lp/int-solver.ts +0 -2
- package/src/prover/smt/solver/lp/lar-solver.ts +40 -4
- package/src/prover/smt/solver/lp/lar-term.ts +0 -1
- package/src/prover/smt/solver/lp/lp-settings.ts +0 -1
- package/src/prover/smt/solver/lp/maximize-term.ts +59 -10
- package/src/prover/smt/solver/lp/nex-creator.ts +3 -3
- package/src/prover/smt/solver/lp/nex.ts +2 -2
- package/src/prover/smt/solver/lp/nla-backoff.ts +0 -2
- package/src/prover/smt/solver/lp/nla-basics.ts +46 -3
- package/src/prover/smt/solver/lp/nla-core.ts +66 -11
- package/src/prover/smt/solver/lp/nla-divisions.ts +0 -2
- package/src/prover/smt/solver/lp/nla-emonics.ts +0 -1
- package/src/prover/smt/solver/lp/nla-factorization.ts +0 -1
- package/src/prover/smt/solver/lp/nla-grobner.ts +167 -85
- package/src/prover/smt/solver/lp/nla-horner.ts +0 -2
- package/src/prover/smt/solver/lp/nla-intervals.ts +0 -1
- package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +0 -2
- package/src/prover/smt/solver/lp/nla-monotone.ts +0 -1
- package/src/prover/smt/solver/lp/nla-order.ts +0 -2
- package/src/prover/smt/solver/lp/nla-patcher.ts +0 -1
- package/src/prover/smt/solver/lp/nla-powers.ts +220 -0
- package/src/prover/smt/solver/lp/nla-tangents.ts +0 -2
- package/src/prover/smt/solver/lp/nla-throttle.ts +0 -1
- package/src/prover/smt/solver/lp/nla-transcendentals.ts +324 -0
- package/src/prover/smt/solver/lp/nla-types.ts +0 -2
- package/src/prover/smt/solver/lp/nla-var-eqs.ts +0 -1
- package/src/prover/smt/solver/lp/nra-solver.ts +163 -99
- package/src/prover/smt/solver/lp/numeric-pair.ts +0 -1
- package/src/prover/smt/solver/lp/pdd-interval.ts +6 -3
- package/src/prover/smt/solver/lp/pdd-simplifier.ts +60 -21
- package/src/prover/smt/solver/lp/pdd-solver.ts +72 -41
- package/src/prover/smt/solver/lp/pdd.ts +725 -290
- package/src/prover/smt/solver/lp/random-updater.ts +0 -2
- package/src/prover/smt/solver/lp/static-matrix.ts +0 -1
- package/src/prover/smt/solver/lp/union-find.ts +7 -2
- package/src/prover/smt/solver/macro-finder.ts +530 -0
- package/src/prover/smt/solver/mam-compiler.ts +118 -88
- package/src/prover/smt/solver/mam-interpreter.ts +0 -1
- 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 +309 -0
- package/src/prover/smt/solver/maximize-ac-sharing.ts +8 -6
- package/src/prover/smt/solver/maxlex.ts +115 -0
- package/src/prover/smt/solver/maxsmt-base.ts +105 -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 +17 -26
- package/src/prover/smt/solver/model-evaluator.ts +188 -12
- package/src/prover/smt/solver/model-finder.ts +0 -1
- package/src/prover/smt/solver/model-generator.ts +59 -30
- package/src/prover/smt/solver/model-macro-solver.ts +38 -27
- 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 +410 -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 +496 -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 +201 -0
- package/src/prover/smt/solver/muz/rule-properties.ts +337 -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 +305 -88
- package/src/prover/smt/solver/nlsat/atoms.ts +52 -35
- package/src/prover/smt/solver/nlsat/evaluator.ts +0 -1
- package/src/prover/smt/solver/nlsat/explain.ts +424 -211
- package/src/prover/smt/solver/nlsat/interval-set.ts +1 -2
- package/src/prover/smt/solver/nlsat/levelwise.ts +460 -241
- package/src/prover/smt/solver/nlsat/mpbq.ts +45 -1
- package/src/prover/smt/solver/nlsat/polynomial.ts +2366 -683
- package/src/prover/smt/solver/nlsat/solver.ts +282 -69
- 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 -2
- package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +8 -7
- package/src/prover/smt/solver/nlsat/upolynomial.ts +41 -20
- package/src/prover/smt/solver/nlsat-tactic.ts +82 -0
- package/src/prover/smt/solver/nnf.ts +105 -23
- 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 +792 -0
- package/src/prover/smt/solver/opt-nlsat.ts +386 -0
- package/src/prover/smt/solver/opt-pareto.ts +282 -0
- package/src/prover/smt/solver/opt-preprocess.ts +101 -0
- package/src/prover/smt/solver/opt-solver.ts +311 -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 +19 -11
- 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 +202 -57
- package/src/prover/smt/solver/probes.ts +511 -0
- package/src/prover/smt/solver/propagate-values.ts +37 -21
- package/src/prover/smt/solver/proto-model.ts +650 -17
- package/src/prover/smt/solver/pull-quant.ts +28 -12
- package/src/prover/smt/solver/purify-arith.ts +632 -0
- package/src/prover/smt/solver/qe-arith-plugin.ts +1096 -0
- package/src/prover/smt/solver/qe-lite-der.ts +2 -3
- package/src/prover/smt/solver/qe-lite-fm.ts +3 -4
- package/src/prover/smt/solver/qe-lite.ts +37 -17
- 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 -1
- package/src/prover/smt/solver/qsat.ts +814 -0
- package/src/prover/smt/solver/quant-hoist.ts +196 -0
- package/src/prover/smt/solver/quant-tactics.ts +16 -56
- package/src/prover/smt/solver/quantifier-analyzer.ts +9 -10
- package/src/prover/smt/solver/quantifier-manager.ts +25 -24
- package/src/prover/smt/solver/quasi-macros.ts +243 -0
- package/src/prover/smt/solver/random-gen.ts +0 -1
- package/src/prover/smt/solver/rational.ts +45 -1
- 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 -1
- package/src/prover/smt/solver/relevancy.ts +1 -2
- package/src/prover/smt/solver/rewriter-tpl.ts +77 -10
- package/src/prover/smt/solver/rewriter.ts +475 -36
- package/src/prover/smt/solver/rlimit.ts +38 -2
- 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 +526 -0
- package/src/prover/smt/solver/sat/inc-sat-solver.ts +378 -0
- package/src/prover/smt/solver/sat/model-converter.ts +136 -0
- package/src/prover/smt/solver/sat/pb-constraint.ts +261 -0
- package/src/prover/smt/solver/sat/pb-solver.ts +1577 -0
- package/src/prover/smt/solver/sat/probing.ts +170 -0
- package/src/prover/smt/solver/sat/sat-tactic.ts +44 -0
- package/src/prover/smt/solver/sat/sat2goal.ts +165 -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 +2105 -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 +90 -0
- package/src/prover/smt/solver/smt-logics.ts +66 -0
- package/src/prover/smt/solver/smt-setup.ts +544 -0
- package/src/prover/smt/solver/smt2-printer.ts +765 -0
- package/src/prover/smt/solver/smtlib-parser.ts +3228 -327
- package/src/prover/smt/solver/smtlib-script.ts +1843 -0
- package/src/prover/smt/solver/solve-eqs.ts +923 -0
- package/src/prover/smt/solver/solver.ts +113 -22
- package/src/prover/smt/solver/static-features.ts +314 -0
- package/src/prover/smt/solver/sticky-generations.ts +0 -1
- package/src/prover/smt/solver/tactic.ts +2012 -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 +1200 -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 +53 -2
- package/src/prover/smt/solver/theory-lra-bounds.ts +31 -5
- package/src/prover/smt/solver/theory-lra-final-check.ts +56 -71
- package/src/prover/smt/solver/theory-lra-internalize.ts +89 -11
- package/src/prover/smt/solver/theory-lra-model.ts +20 -35
- package/src/prover/smt/solver/theory-lra-propagate.ts +24 -28
- package/src/prover/smt/solver/theory-lra-state.ts +6 -22
- package/src/prover/smt/solver/theory-lra.ts +188 -2
- package/src/prover/smt/solver/theory-pb.ts +933 -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.ts +189 -0
- package/src/prover/smt/solver/tseitin-cnf.ts +485 -0
- package/src/prover/smt/solver/var-subst.ts +36 -14
- package/src/prover/smt/table.ts +3 -2
- package/src/prover/smt/types.ts +146 -0
- package/src/prover/tlapm/cache.ts +37 -16
- package/src/prover/tlapm-library.ts +3208 -0
- package/src/prover/verdict.ts +2 -0
- package/src/prover/zenon/decide.ts +10 -7
- package/src/prover/zenon/encode.ts +0 -2
- package/src/prover/zenon/eqrel.ts +0 -2
- package/src/prover/zenon/equality-rules.ts +24 -2
- package/src/prover/zenon/expr.ts +21 -2
- package/src/prover/zenon/index-table.ts +7 -4
- package/src/prover/zenon/isar-case.ts +1 -3
- package/src/prover/zenon/isar.ts +2 -4
- package/src/prover/zenon/llproof.ts +0 -2
- package/src/prover/zenon/mltoll.ts +0 -2
- package/src/prover/zenon/node.ts +20 -5
- package/src/prover/zenon/parse.ts +6 -2
- package/src/prover/zenon/phrase.ts +1 -3
- package/src/prover/zenon/proof.ts +0 -2
- package/src/prover/zenon/propositional-rules.ts +0 -2
- package/src/prover/zenon/rules.ts +2 -3
- package/src/prover/zenon/search.ts +7 -5
- package/src/prover/zenon/tla/functions.ts +0 -2
- package/src/prover/zenon/tla/llproof.ts +0 -2
- package/src/prover/zenon/tla/records.ts +0 -2
- package/src/prover/zenon/tla/rewrites.ts +0 -2
- package/src/prover/zenon/tla/sets.ts +7 -8
- package/src/prover/zenon/tla/terms.ts +0 -2
- package/src/prover/zenon/tla/tla.ts +0 -2
- package/src/resolve.ts +625 -189
- package/src/runtime.ts +7 -1
- package/src/sany/builtins.ts +10 -10
- package/src/sany/generation.ts +2 -13
- package/src/sany/generator-definitions.ts +3 -1
- package/src/sany/generator-expressions.ts +36 -30
- package/src/sany/generator-proofs.ts +5 -3
- package/src/sany/generator.ts +2 -1
- package/src/sany/levels.ts +0 -2
- package/src/sany/lexer.ts +3 -3
- package/src/sany/linter.ts +0 -2
- package/src/sany/modules.ts +4 -2
- package/src/sany/nodes.ts +1 -1
- package/src/sany/selectors.ts +11 -6
- package/src/sany/xml.ts +2 -3
- package/src/search.ts +209 -56
- package/src/simulate.ts +3 -0
- package/src/spec-description.ts +2 -2
- package/src/standard-definitions.ts +4 -0
- package/src/state-graph.ts +0 -2
- package/src/subexpressions.ts +265 -94
- package/src/successors.ts +2 -1
- package/src/symmetry.ts +3 -3
- package/src/tableau.ts +2 -2
- package/src/tlc/fingerprint.ts +81 -9
- package/src/tlc/jar-data.ts +10 -0
- package/src/tlc/messages.ts +3 -3
- package/src/tlc/order.ts +14 -3
- package/src/tlc/summary.ts +29 -14
- package/src/tlc/tlc-operators.ts +3 -1
- package/src/tlc/tlcext-operators.ts +61 -16
- package/src/tlc/trace-spec.ts +5 -5
- package/src/typed-tier.ts +6541 -0
- package/src/typescript/types.ts +2 -2
- package/src/values.ts +46 -27
- package/src/prover/isabelle/isar/statement.ts +0 -52
- 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,5 +1,3 @@
|
|
|
1
|
-
// Ported from Isabelle2025's Provers/hypsubst.ML. Copyright (c) 1986-2025 University of Cambridge, Technische Universitaet Muenchen, and contributors, see LICENSE.
|
|
2
|
-
|
|
3
1
|
import { isIsabelleError, TlaIsabelleError } from "../../../errors";
|
|
4
2
|
import { asmRl, compIncr, revcutRl, thinRl, zeroVarIndexes } from "../pure/drule";
|
|
5
3
|
import { aeconv, etaContract } from "../pure/envir";
|
|
@@ -247,9 +245,9 @@ const instSubstTac = (context: HypsubstContext, isLeft: boolean, rule: Thm): Goa
|
|
|
247
245
|
chosen.kind === "Bound"
|
|
248
246
|
? substBounds(
|
|
249
247
|
[
|
|
250
|
-
...Array.from({ length: chosen.index }, (
|
|
248
|
+
...Array.from({ length: chosen.index }, (_value, position) => mkBound(position + 1)),
|
|
251
249
|
mkBound(0),
|
|
252
|
-
...Array.from({ length: params.length - chosen.index - 1 }, (
|
|
250
|
+
...Array.from({ length: params.length - chosen.index - 1 }, (_value, position) =>
|
|
253
251
|
mkBound(chosen.index + 2 + position),
|
|
254
252
|
),
|
|
255
253
|
],
|
|
@@ -1,5 +1,3 @@
|
|
|
1
|
-
// Ported from Isabelle2025's Pure/thm.ML. Copyright (c) 1986-2025 University of Cambridge, Technische Universitaet Muenchen, and contributors, see LICENSE.
|
|
2
|
-
|
|
3
1
|
import { TlaIsabelleError } from "../../../errors";
|
|
4
2
|
import { normTerm, type Envir } from "./envir";
|
|
5
3
|
import { allConst, isAllAbs, isImplies, mkImplies } from "./logic";
|
|
@@ -1,5 +1,3 @@
|
|
|
1
|
-
// Ported from Isabelle2025's Pure/conv.ML. Copyright (c) 1986-2025 University of Cambridge, Technische Universitaet Muenchen, and contributors, see LICENSE.
|
|
2
|
-
|
|
3
1
|
import { TlaIsabelleError } from "../../../errors";
|
|
4
2
|
import { destEquals, destImplies, implies, isAllAbs, isImplies } from "./logic";
|
|
5
3
|
import { declareName, makeNameContext, variantName, type NameContext } from "./name";
|
|
@@ -1,5 +1,3 @@
|
|
|
1
|
-
// Ported from Isabelle2025's Pure/drule.ML, Pure/term_subst.ML and Pure/Pure.thy. Copyright (c) 1986-2025 University of Cambridge, Technische Universitaet Muenchen, and contributors, see LICENSE.
|
|
2
|
-
|
|
3
1
|
import {
|
|
4
2
|
cleanName,
|
|
5
3
|
emptyNameContext,
|
|
@@ -17,10 +15,12 @@ import {
|
|
|
17
15
|
type IndexKey,
|
|
18
16
|
} from "./table";
|
|
19
17
|
import { TlaIsabelleError } from "../../../errors";
|
|
20
|
-
import { allConst, isProtected, mkEquals, mkImplies, mkTerm, protect } from "./logic";
|
|
21
|
-
import {
|
|
18
|
+
import { allConst, destEquals, isProtected, mkEquals, mkImplies, mkTerm, protect } from "./logic";
|
|
19
|
+
import type { Limits } from "./interrupt";
|
|
20
|
+
import { emptySeq, listOfSeq, mapsSeq, seqOfList, singleSeq, type Seq } from "./seq";
|
|
22
21
|
import { distinctThms } from "./tactical";
|
|
23
22
|
import {
|
|
23
|
+
aconv,
|
|
24
24
|
foldVars,
|
|
25
25
|
foldAtyps,
|
|
26
26
|
foldTypes,
|
|
@@ -38,14 +38,21 @@ import {
|
|
|
38
38
|
} from "./term";
|
|
39
39
|
import { normType, type TyEnv } from "./type";
|
|
40
40
|
import {
|
|
41
|
+
abstractRule,
|
|
41
42
|
axiomThm,
|
|
43
|
+
betaConversion,
|
|
42
44
|
bicompose,
|
|
45
|
+
biresolution,
|
|
46
|
+
etaConversion,
|
|
43
47
|
forallElim,
|
|
44
48
|
forallIntr,
|
|
45
49
|
incrIndexesThm,
|
|
46
50
|
instantiate,
|
|
47
51
|
instantiateTypes,
|
|
52
|
+
nprems,
|
|
48
53
|
rs,
|
|
54
|
+
symmetric,
|
|
55
|
+
transitive,
|
|
49
56
|
type Instantiation,
|
|
50
57
|
type Thm,
|
|
51
58
|
} from "./thm";
|
|
@@ -62,6 +69,13 @@ export const remdupsRl = axiomThm(
|
|
|
62
69
|
);
|
|
63
70
|
export const protectI = axiomThm(mkImplies(propVar("A"), protect(propVar("A"))));
|
|
64
71
|
export const protectD = axiomThm(mkImplies(protect(propVar("A")), propVar("A")));
|
|
72
|
+
export const protectCong = axiomThm(mkEquals(protect(propVar("A")), protect(propVar("A"))));
|
|
73
|
+
export const equalsCong = axiomThm(
|
|
74
|
+
mkEquals(
|
|
75
|
+
mkEquals(mkVar("x", 0, mkTVar("'a", 0)), mkVar("y", 0, mkTVar("'a", 0))),
|
|
76
|
+
mkEquals(mkVar("x", 0, mkTVar("'a", 0)), mkVar("y", 0, mkTVar("'a", 0))),
|
|
77
|
+
),
|
|
78
|
+
);
|
|
65
79
|
export const reflexiveThm = axiomThm(
|
|
66
80
|
mkEquals(mkVar("x", 0, mkTVar("'a", 0)), mkVar("x", 0, mkTVar("'a", 0))),
|
|
67
81
|
);
|
|
@@ -235,6 +249,30 @@ const compose = (tha: Thm, index: number, thb: Thm): Thm => {
|
|
|
235
249
|
return results[0];
|
|
236
250
|
};
|
|
237
251
|
|
|
252
|
+
export const betaEtaConversion = (term: Term) => {
|
|
253
|
+
const beta = betaConversion(true, term);
|
|
254
|
+
return transitive(beta, etaConversion(destEquals(beta.prop)[1]));
|
|
255
|
+
};
|
|
256
|
+
|
|
257
|
+
// f ?x1 ... ?xn == u becomes f == %x1 ... xn. u.
|
|
258
|
+
export const absDef = (thm: Thm): Thm => {
|
|
259
|
+
const contractLhs = (current: Thm) =>
|
|
260
|
+
transitive(symmetric(betaEtaConversion(destEquals(current.prop)[0])), current);
|
|
261
|
+
const varArgs = (term: Term): Term[] => {
|
|
262
|
+
if (term.kind !== "App" || term.arg.kind !== "Var") return [];
|
|
263
|
+
const variable = term.arg;
|
|
264
|
+
return [variable, ...varArgs(term.fun).filter((other) => !aconv(other, variable))];
|
|
265
|
+
};
|
|
266
|
+
const contracted = contractLhs(thm);
|
|
267
|
+
return contractLhs(
|
|
268
|
+
varArgs(destEquals(contracted.prop)[0]).reduce(
|
|
269
|
+
(current, variable) =>
|
|
270
|
+
abstractRule(variable.kind === "Var" ? variable.name : "", variable, current),
|
|
271
|
+
contracted,
|
|
272
|
+
),
|
|
273
|
+
);
|
|
274
|
+
};
|
|
275
|
+
|
|
238
276
|
export const compIncr = (tha: Thm, thb: Thm) =>
|
|
239
277
|
compose(tha, 1, incrIndexesThm(tha.maxidx + 1, thb));
|
|
240
278
|
|
|
@@ -253,3 +291,24 @@ export const compNoFlatten = (thm: Thm, count: number, index: number, rule: Thm)
|
|
|
253
291
|
if (results.length !== 1) throw new TlaIsabelleError("THM", `comp_no_flatten ${index}`);
|
|
254
292
|
return results[0];
|
|
255
293
|
};
|
|
294
|
+
|
|
295
|
+
export const multiResolves = (
|
|
296
|
+
limits: Limits,
|
|
297
|
+
facts: readonly Thm[],
|
|
298
|
+
rules: readonly Thm[],
|
|
299
|
+
): Seq<Thm> =>
|
|
300
|
+
mapsSeq(
|
|
301
|
+
(rule) =>
|
|
302
|
+
facts.reduceRight<Seq<Thm>>(
|
|
303
|
+
(results, fact, index) =>
|
|
304
|
+
mapsSeq(
|
|
305
|
+
(thm) =>
|
|
306
|
+
index + 1 > nprems(thm)
|
|
307
|
+
? emptySeq
|
|
308
|
+
: biresolution(limits, false, [{ isElim: false, rule: fact }], index + 1, thm),
|
|
309
|
+
results,
|
|
310
|
+
),
|
|
311
|
+
singleSeq(rule),
|
|
312
|
+
),
|
|
313
|
+
seqOfList(rules),
|
|
314
|
+
);
|
|
@@ -1,5 +1,3 @@
|
|
|
1
|
-
// Ported from Isabelle2025's Pure/goal.ML. Copyright (c) 1986-2025 University of Cambridge, Technische Universitaet Muenchen, and contributors, see LICENSE.
|
|
2
|
-
|
|
3
1
|
import { TlaIsabelleError } from "../../../errors";
|
|
4
2
|
import { compNoFlatten, protectD, protectI } from "./drule";
|
|
5
3
|
import { emptySeq } from "./seq";
|
|
@@ -8,7 +6,7 @@ import { nprems, permutePrems, type Thm } from "./thm";
|
|
|
8
6
|
|
|
9
7
|
const protect = (count: number, thm: Thm) => compNoFlatten(thm, count, 1, protectI);
|
|
10
8
|
|
|
11
|
-
const conclude = (thm: Thm) => compNoFlatten(thm, nprems(thm), 1, protectD);
|
|
9
|
+
export const conclude = (thm: Thm) => compNoFlatten(thm, nprems(thm), 1, protectD);
|
|
12
10
|
|
|
13
11
|
const restrict = (index: number, count: number, state: Thm) => {
|
|
14
12
|
if (index < 1 || count < 1 || index + count - 1 > nprems(state))
|
|
@@ -1,5 +1,3 @@
|
|
|
1
|
-
// Ported from Isabelle2025's Pure/name.ML and Pure/General/symbol.ML. Copyright (c) 1986-2025 University of Cambridge, Technische Universitaet Muenchen, and contributors, see LICENSE.
|
|
2
|
-
|
|
3
1
|
const explodeSymbols = (text: string): string[] => text.match(/\\<\^?[A-Za-z0-9_']*>|[^]/gu) ?? [];
|
|
4
2
|
|
|
5
3
|
const isRawSymbolic = (symbol: string) => symbol.startsWith("\\<") && !symbol.startsWith("\\<^");
|
|
@@ -1,27 +1,33 @@
|
|
|
1
|
-
// Ported from Isabelle2025's Pure/Isar/object_logic.ML and Pure/tactic.ML. Copyright (c) 1986-2025 University of Cambridge, Technische Universitaet Muenchen, and contributors, see LICENSE.
|
|
2
|
-
|
|
3
1
|
import { TlaIsabelleError } from "../../../errors";
|
|
4
|
-
import { gconvRule, paramsConv, premsConv } from "./conv";
|
|
2
|
+
import { fconvRule, gconvRule, paramsConv, premsConv } from "./conv";
|
|
5
3
|
import { hasMetaPrems } from "./logic";
|
|
6
4
|
import { makeSimpContext } from "./raw-simplifier";
|
|
7
5
|
import { rewriteCterm, simpleProver } from "./rewriter";
|
|
8
6
|
import { emptySeq, singleSeq } from "./seq";
|
|
9
7
|
import type { Limits } from "./interrupt";
|
|
10
8
|
import type { GoalTactic } from "./tactical";
|
|
9
|
+
import type { Term } from "./term";
|
|
11
10
|
import { reflexive, type Thm } from "./thm";
|
|
12
11
|
|
|
13
|
-
|
|
12
|
+
// The atomize rules apply newest first, as Object_Logic keeps them.
|
|
13
|
+
const atomizePrems = (limits: Limits, rules: readonly Thm[]) => {
|
|
14
14
|
const context = makeSimpContext(limits, rules);
|
|
15
15
|
const atomize = paramsConv(
|
|
16
16
|
premsConv((term) =>
|
|
17
17
|
rewriteCterm({ simprem: true, useprem: false, mutsimp: false }, simpleProver, context, term),
|
|
18
18
|
),
|
|
19
19
|
);
|
|
20
|
+
return (term: Term) => (hasMetaPrems(term) ? atomize(term) : reflexive(term));
|
|
21
|
+
};
|
|
22
|
+
|
|
23
|
+
export const flatRule = (limits: Limits, rules: readonly Thm[], rule: Thm) =>
|
|
24
|
+
fconvRule(premsConv(atomizePrems(limits, rules)), rule);
|
|
25
|
+
|
|
26
|
+
export const atomizePremsTac = (limits: Limits, rules: readonly Thm[]): GoalTactic => {
|
|
27
|
+
const atomize = atomizePrems(limits, rules);
|
|
20
28
|
return (index) => (state) => {
|
|
21
29
|
try {
|
|
22
|
-
return singleSeq(
|
|
23
|
-
gconvRule((term) => (hasMetaPrems(term) ? atomize(term) : reflexive(term)), index, state),
|
|
24
|
-
);
|
|
30
|
+
return singleSeq(gconvRule(atomize, index, state));
|
|
25
31
|
} catch (error) {
|
|
26
32
|
if (
|
|
27
33
|
error instanceof TlaIsabelleError &&
|
|
@@ -1,5 +1,3 @@
|
|
|
1
|
-
// Ported from Isabelle2025's Pure/pattern.ML and Pure/more_pattern.ML. Copyright (c) 1986-2025 University of Cambridge, Technische Universitaet Muenchen, and contributors, see LICENSE.
|
|
2
|
-
|
|
3
1
|
import { TlaIsabelleError } from "../../../errors";
|
|
4
2
|
import { aeconv, genvar, headNorm, lookup, lookup1, update, type Envir, type TEnv } from "./envir";
|
|
5
3
|
import type { Binder } from "./logic";
|
|
@@ -1,5 +1,3 @@
|
|
|
1
|
-
// Ported from Isabelle2025's Pure/raw_simplifier.ML. Copyright (c) 1986-2025 University of Cambridge, Technische Universitaet Muenchen, and contributors, see LICENSE.
|
|
2
|
-
|
|
3
1
|
import { TlaIsabelleError } from "../../../errors";
|
|
4
2
|
import { emptyTEnv, etaContract } from "./envir";
|
|
5
3
|
import { symmetricThm } from "./drule";
|
|
@@ -1,8 +1,6 @@
|
|
|
1
|
-
// Ported from Isabelle2025's Pure/raw_simplifier.ML and Pure/conv.ML. Copyright (c) 1986-2025 University of Cambridge, Technische Universitaet Muenchen, and contributors, see LICENSE.
|
|
2
|
-
|
|
3
1
|
import { isIsabelleError, TlaIsabelleError } from "../../../errors";
|
|
4
2
|
import { gconvRule, impCongRule } from "./conv";
|
|
5
|
-
import { impCong, swapPremsEq } from "./drule";
|
|
3
|
+
import { betaEtaConversion, impCong, swapPremsEq } from "./drule";
|
|
6
4
|
import { emptyTEnv } from "./envir";
|
|
7
5
|
import {
|
|
8
6
|
destEquals,
|
|
@@ -83,16 +81,11 @@ export const simpleProver: Prover = (context, thm) =>
|
|
|
83
81
|
const lhsOf = (thm: Thm) => destEquals(thm.prop)[0];
|
|
84
82
|
const rhsOf = (thm: Thm) => destEquals(thm.prop)[1];
|
|
85
83
|
|
|
86
|
-
const betaEtaConversion = (term: Term) => {
|
|
87
|
-
const beta = betaConversion(true, term);
|
|
88
|
-
return transitive(beta, etaConversion(rhsOf(beta)));
|
|
89
|
-
};
|
|
90
|
-
|
|
91
84
|
const instantiateMatch = (env: MatchEnv, rule: Thm): Thm => {
|
|
92
85
|
const typed = instantiateTypes(env.tyenv, rule);
|
|
93
|
-
const insts: Instantiation[] = tableEntries(env.tenv).map((
|
|
94
|
-
variable: mkVar(
|
|
95
|
-
term:
|
|
86
|
+
const insts: Instantiation[] = tableEntries(env.tenv).map((entry) => ({
|
|
87
|
+
variable: mkVar(entry[0].name, entry[0].index, substType(env.tyenv, entry[1].type)),
|
|
88
|
+
term: entry[1].term,
|
|
96
89
|
}));
|
|
97
90
|
return instantiate(insts, typed);
|
|
98
91
|
};
|
|
@@ -1,5 +1,3 @@
|
|
|
1
|
-
// Ported from Isabelle2025's Pure/search.ML. Copyright (c) 1986-2025 University of Cambridge, Technische Universitaet Muenchen, and contributors, see LICENSE.
|
|
2
|
-
|
|
3
1
|
import { listOfSeq, makeSeq, seqOfList } from "./seq";
|
|
4
2
|
import { eqThm, hasFewerPrems, noTac, orElse, type GoalTactic, type Tactic } from "./tactical";
|
|
5
3
|
import { termOrd } from "./term-ord";
|
|
@@ -1,5 +1,3 @@
|
|
|
1
|
-
// Ported from Isabelle2025's Pure/General/seq.ML. Copyright (c) 1986-2025 University of Cambridge, Technische Universitaet Muenchen, and contributors, see LICENSE.
|
|
2
|
-
|
|
3
1
|
export type Cell<Item> = readonly [Item, Seq<Item>] | undefined;
|
|
4
2
|
|
|
5
3
|
type Step<Item> = Cell<Item> | Seq<Item>;
|
|
@@ -1,8 +1,7 @@
|
|
|
1
|
-
|
|
2
|
-
|
|
3
|
-
import { genAll, isNormHhf, normHhfEq } from "./drule";
|
|
1
|
+
import { genAll, isNormHhf, normHhfEq, protectCong } from "./drule";
|
|
4
2
|
import { preferGoal } from "./goal";
|
|
5
|
-
import { makeSimpContext, type SimpContext, type Solver } from "./raw-simplifier";
|
|
3
|
+
import { congKey, makeSimpContext, type SimpContext, type Solver } from "./raw-simplifier";
|
|
4
|
+
import { updateTable } from "./table";
|
|
6
5
|
import { fconvRule } from "./conv";
|
|
7
6
|
import {
|
|
8
7
|
genericRewriteGoalTac,
|
|
@@ -80,9 +79,24 @@ const simpThm = (mode: RewriteMode, context: SimpContext, thm: Thm): Thm => {
|
|
|
80
79
|
export const simplify = (context: SimpContext, thm: Thm) =>
|
|
81
80
|
simpThm({ simprem: false, useprem: false, mutsimp: false }, context, thm);
|
|
82
81
|
|
|
83
|
-
|
|
84
|
-
|
|
85
|
-
|
|
82
|
+
// Drule.sort_constraint_eq, the other rule of hhf_ss, never applies: tlapm's terms carry no sort
|
|
83
|
+
// constraints.
|
|
84
|
+
const genNormHhf = (isProtecting: boolean, limits: Limits, thm: Thm): Thm => {
|
|
85
|
+
if (isNormHhf(isProtecting, thm.prop)) return genAll(thm);
|
|
86
|
+
const hhfContext = makeSimpContext(limits, [normHhfEq]);
|
|
87
|
+
const context = isProtecting
|
|
88
|
+
? {
|
|
89
|
+
...hhfContext,
|
|
90
|
+
simpset: {
|
|
91
|
+
...hhfContext.simpset,
|
|
92
|
+
congs: updateTable(
|
|
93
|
+
hhfContext.simpset.congs,
|
|
94
|
+
congKey({ isConst: true, name: "Pure.prop" }),
|
|
95
|
+
protectCong,
|
|
96
|
+
),
|
|
97
|
+
},
|
|
98
|
+
}
|
|
99
|
+
: hhfContext;
|
|
86
100
|
return genAll(
|
|
87
101
|
fconvRule(
|
|
88
102
|
(term) =>
|
|
@@ -96,3 +110,8 @@ export const normHhf = (limits: Limits, thm: Thm): Thm => {
|
|
|
96
110
|
),
|
|
97
111
|
);
|
|
98
112
|
};
|
|
113
|
+
|
|
114
|
+
export const normHhf = (limits: Limits, thm: Thm) => genNormHhf(false, limits, thm);
|
|
115
|
+
|
|
116
|
+
// Raw_Simplifier.norm_hhf_protect leaves protected propositions alone.
|
|
117
|
+
export const normHhfProtect = (limits: Limits, thm: Thm) => genNormHhf(true, limits, thm);
|
|
@@ -1,5 +1,3 @@
|
|
|
1
|
-
// Ported from Isabelle2025's Pure/tactic.ML. Copyright (c) 1986-2025 University of Cambridge, Technische Universitaet Muenchen, and contributors, see LICENSE.
|
|
2
|
-
|
|
3
1
|
import { makeElim } from "./drule";
|
|
4
2
|
import { checkInterrupt, type Limits } from "./interrupt";
|
|
5
3
|
import { stripAssumsConcl, stripAssumsHyp } from "./logic";
|
|
@@ -1,5 +1,3 @@
|
|
|
1
|
-
// Ported from Isabelle2025's Pure/term_ord.ML. Copyright (c) 1986-2025 University of Cambridge, Technische Universitaet Muenchen, and contributors, see LICENSE.
|
|
2
|
-
|
|
3
1
|
import { fastIndexnameOrd, fastStringOrd, indexnameOrd } from "./table";
|
|
4
2
|
import { dummyT, sizeOfTerm, type Term, type Typ } from "./term";
|
|
5
3
|
|
|
@@ -1,5 +1,3 @@
|
|
|
1
|
-
// Ported from Isabelle2025's Pure/term.ML. Copyright (c) 1986-2025 University of Cambridge, Technische Universitaet Muenchen, and contributors, see LICENSE.
|
|
2
|
-
|
|
3
1
|
import { TlaIsabelleError } from "../../../errors";
|
|
4
2
|
|
|
5
3
|
export type Sort = readonly string[];
|
|
@@ -638,10 +636,10 @@ const mapAbsVars = (rename: (name: string) => string, term: Term): Term => {
|
|
|
638
636
|
|
|
639
637
|
export const renameAbs = (pattern: Term, object: Term, term: Term): Term | undefined => {
|
|
640
638
|
const renaming = new Map<string, string>();
|
|
641
|
-
matchBvs(pattern, object, []).forEach((
|
|
642
|
-
if (!renaming.has(
|
|
639
|
+
matchBvs(pattern, object, []).forEach((pair) => {
|
|
640
|
+
if (!renaming.has(pair[0])) renaming.set(pair[0], pair[1]);
|
|
643
641
|
});
|
|
644
|
-
if ([...renaming].every((
|
|
642
|
+
if ([...renaming].every((pair) => pair[0] === pair[1])) return undefined;
|
|
645
643
|
const renamed = mapAbsVars((name) => renaming.get(name) ?? name, term);
|
|
646
644
|
return renamed === term ? undefined : renamed;
|
|
647
645
|
};
|
|
@@ -1,5 +1,3 @@
|
|
|
1
|
-
// Ported from Isabelle2025's Pure/unify.ML. Copyright (c) 1986-2025 University of Cambridge, Technische Universitaet Muenchen, and contributors, see LICENSE.
|
|
2
|
-
|
|
3
1
|
import { checkInterrupt, type Limits } from "./interrupt";
|
|
4
2
|
import { TlaIsabelleError } from "../../../errors";
|
|
5
3
|
import {
|
|
@@ -1,5 +1,3 @@
|
|
|
1
|
-
// Ported from Isabelle2025's Pure/variable.ML. Copyright (c) 1986-2025 University of Cambridge, Technische Universitaet Muenchen, and contributors, see LICENSE.
|
|
2
|
-
|
|
3
1
|
import { variantList } from "./name";
|
|
4
2
|
import { addFreeNames, addVars, mkFree } from "./term";
|
|
5
3
|
import { generalize, instantiate, type Thm } from "./thm";
|
|
@@ -1,5 +1,3 @@
|
|
|
1
|
-
// Ported from Isabelle/TLA+'s PredicateLogic.thy and SetTheory.thy, BSD licensed, see LICENSE.
|
|
2
|
-
|
|
3
1
|
import { TlaIsabelleError } from "../../../errors";
|
|
4
2
|
import { emptyNet } from "../pure/net";
|
|
5
3
|
import { thenGoal } from "../pure/tactical";
|
|
@@ -85,6 +83,7 @@ export const getClaset = (logic: TlaLogic, limits: Limits): Claset => {
|
|
|
85
83
|
safep: toNetPair(logic.claset.safep),
|
|
86
84
|
unsafe: toNetPair(logic.claset.unsafe),
|
|
87
85
|
dup: toNetPair(logic.claset.dup),
|
|
86
|
+
extra: toNetPair(logic.claset.extra),
|
|
88
87
|
};
|
|
89
88
|
return addbefore(
|
|
90
89
|
claset,
|
|
@@ -1,6 +1,8 @@
|
|
|
1
1
|
import { TlaIsabelleError } from "../../../errors";
|
|
2
2
|
import type { ProofContext } from "../isar/method";
|
|
3
|
+
import { normHhfEq } from "../pure/drule";
|
|
3
4
|
import type { Limits } from "../pure/interrupt";
|
|
5
|
+
import { symmetric } from "../pure/thm";
|
|
4
6
|
import { blastDepthTac, blastTac } from "../provers/blast/blast";
|
|
5
7
|
import type { BlastContext } from "../provers/blast/state";
|
|
6
8
|
import type { ClassicalContext } from "../provers/classical";
|
|
@@ -25,6 +27,19 @@ const ATOMIZE_RULES = [
|
|
|
25
27
|
"PredicateLogic.atomize_all",
|
|
26
28
|
];
|
|
27
29
|
|
|
30
|
+
// PredicateLogic.thy declares these [symmetric, rulify], newest first, after Pure's norm_hhf_eq.
|
|
31
|
+
const RULIFY_RULES = ["PredicateLogic.atomize_imp", "PredicateLogic.atomize_all"];
|
|
32
|
+
|
|
33
|
+
// PredicateLogic.thy declares these [symmetric, defn].
|
|
34
|
+
const DEFN_RULES = [
|
|
35
|
+
"PredicateLogic.atomize_all",
|
|
36
|
+
"PredicateLogic.atomize_imp",
|
|
37
|
+
"PredicateLogic.atomize_eq",
|
|
38
|
+
];
|
|
39
|
+
|
|
40
|
+
// PredicateLogic.thy's instantiation of Induct takes case_split as the default cases rule.
|
|
41
|
+
const CASES_DEFAULT = "PredicateLogic.case_split";
|
|
42
|
+
|
|
28
43
|
export const getProofContext = (logic: TlaLogic, limits: Limits): ProofContext => {
|
|
29
44
|
const atomizeRules = ATOMIZE_RULES.map((name) => getFact(logic, name));
|
|
30
45
|
const hypsubst = getHypsubstData(logic);
|
|
@@ -50,22 +65,49 @@ export const getProofContext = (logic: TlaLogic, limits: Limits): ProofContext =
|
|
|
50
65
|
atomize: atomizeRules,
|
|
51
66
|
},
|
|
52
67
|
});
|
|
68
|
+
const contextRules = [
|
|
69
|
+
toNetPair(logic.contextRules.bang),
|
|
70
|
+
toNetPair(logic.contextRules.plain),
|
|
71
|
+
toNetPair(logic.contextRules.query),
|
|
72
|
+
];
|
|
73
|
+
const getTaggedFact = (name: string) => {
|
|
74
|
+
const fullName = logic.factNames.get(name) ?? name;
|
|
75
|
+
return logic.facts
|
|
76
|
+
.get(fullName)
|
|
77
|
+
?.map((rule, index) => ({ rule, tags: logic.factTags.get(fullName)?.get(index) ?? [] }));
|
|
78
|
+
};
|
|
79
|
+
const taggedThms = new Set(
|
|
80
|
+
[...logic.factTags].flatMap((entry) =>
|
|
81
|
+
[...entry[1].keys()].map((index) => logic.facts.get(entry[0])?.[index]),
|
|
82
|
+
),
|
|
83
|
+
);
|
|
53
84
|
return {
|
|
54
85
|
limits,
|
|
55
86
|
simpset: getSimpset(logic),
|
|
56
87
|
classical,
|
|
57
|
-
intuitionistic: {
|
|
58
|
-
limits,
|
|
59
|
-
safeRules: toNetPair(logic.contextRules.bang),
|
|
60
|
-
rules: toNetPair(logic.contextRules.plain),
|
|
61
|
-
},
|
|
88
|
+
intuitionistic: { limits, safeRules: contextRules[0], rules: contextRules[1] },
|
|
62
89
|
atomizeRules,
|
|
90
|
+
defnRules: DEFN_RULES.map((name) => symmetric(getFact(logic, name))),
|
|
91
|
+
rulifyRules: [...RULIFY_RULES.map((name) => symmetric(getFact(logic, name))), normHhfEq],
|
|
63
92
|
blastDepthTac: (context, limit) => blastDepthTac(toBlastContext(context), limit),
|
|
64
93
|
blastTac: (context) => blastTac(toBlastContext(context)),
|
|
65
|
-
|
|
66
|
-
|
|
67
|
-
|
|
68
|
-
|
|
94
|
+
contextRules,
|
|
95
|
+
induct: {
|
|
96
|
+
casesType: logic.casesRules.type,
|
|
97
|
+
casesPred: logic.casesRules.pred,
|
|
98
|
+
casesDefault: {
|
|
99
|
+
rule: getFact(logic, CASES_DEFAULT),
|
|
100
|
+
tags: getTaggedFact(CASES_DEFAULT)?.[0].tags ?? [],
|
|
101
|
+
},
|
|
102
|
+
trivialRule: getFact(logic, "PredicateLogic.cases_trueI"),
|
|
103
|
+
getTaggedFact,
|
|
104
|
+
isTagged: (thm) => taggedThms.has(thm),
|
|
69
105
|
},
|
|
70
106
|
};
|
|
71
107
|
};
|
|
108
|
+
|
|
109
|
+
export const getLogicFact = (logic: TlaLogic, name: string) => {
|
|
110
|
+
const facts = logic.facts.get(logic.factNames.get(name) ?? name);
|
|
111
|
+
if (facts === undefined) throw new TlaIsabelleError("ERROR", `Undefined fact: ${name}`);
|
|
112
|
+
return facts;
|
|
113
|
+
};
|