tla-ts 0.0.10-dev.28c823e4b → 0.0.10-dev.3a85c3a9e
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 +6 -6
- package/dist/compile.js +10 -10
- package/dist/deciders.cjs +41 -37
- package/dist/deciders.js +57 -53
- package/dist/index.cjs +1 -1
- package/dist/index.d.cts +3 -0
- package/dist/index.d.ts +3 -0
- package/dist/index.js +1 -1
- package/dist/parallel-worker.cjs +1 -1
- package/dist/parallel-worker.js +1 -1
- package/dist/prove.cjs +2683 -427
- package/dist/prove.js +2681 -425
- package/dist/run.cjs +45 -42
- package/dist/run.js +47 -44
- package/dist/tlapm.cjs +2 -2
- package/dist/tlapm.js +2 -2
- package/dist/transfer.cjs +42 -39
- package/dist/transfer.js +44 -41
- package/dist/worker.cjs +7 -7
- package/dist/worker.js +7 -7
- package/package.json +1 -1
- package/src/ast.ts +41 -36
- package/src/builtins.ts +4 -13
- package/src/check-failure.ts +116 -0
- package/src/check-trace.ts +282 -0
- package/src/check.ts +353 -549
- package/src/cli/options.ts +6 -31
- package/src/cli/shared.ts +1 -1
- package/src/cli/tlapm.ts +433 -70
- package/src/cli/tlc-arguments.ts +222 -210
- package/src/cli/tlc-output.ts +687 -0
- package/src/cli/tlc-usage.ts +1 -2
- package/src/cli/tlc.ts +34 -701
- package/src/cli/xml-exporter.ts +23 -33
- package/src/codegen.ts +5 -10
- package/src/coverage.ts +3 -10
- package/src/dependencies.ts +30 -14
- package/src/dfid.ts +16 -16
- package/src/environment-config.ts +315 -0
- package/src/environment.ts +45 -333
- package/src/errors.ts +33 -5
- package/src/evaluate.ts +5 -4
- package/src/exit-codes.ts +1 -0
- package/src/fingerprints.ts +65 -1
- package/src/instances.ts +47 -10
- package/src/java-hash.ts +7 -0
- package/src/json.ts +4 -7
- package/src/levels.ts +39 -42
- package/src/lexer.ts +5 -3
- package/src/liveness-checker.ts +553 -237
- package/src/liveness.ts +94 -86
- package/src/obligations/action.ts +14 -17
- package/src/obligations/anonymize.ts +37 -16
- package/src/obligations/enabled-axioms.ts +218 -0
- package/src/obligations/equality.ts +1 -3
- package/src/obligations/expression.ts +36 -8
- package/src/obligations/format.ts +0 -2
- package/src/obligations/generate.ts +66 -54
- package/src/obligations/index.ts +38 -8
- package/src/obligations/levels.ts +24 -11
- package/src/obligations/module.ts +28 -41
- package/src/obligations/normalize.ts +26 -14
- package/src/obligations/operators.ts +0 -2
- package/src/obligations/pragma.ts +53 -16
- package/src/obligations/printer.ts +43 -13
- package/src/obligations/proof.ts +3 -2
- package/src/obligations/regroup.ts +0 -2
- package/src/obligations/simplify.ts +55 -50
- package/src/obligations/source.ts +118 -74
- package/src/obligations/subexpression.ts +45 -18
- package/src/obligations/substitution.ts +1 -3
- package/src/obligations/temporal.ts +5 -7
- package/src/obligations/tuples.ts +0 -2
- package/src/parallel-worker.ts +10 -30
- package/src/parallel.ts +24 -47
- package/src/parser.ts +580 -180
- package/src/pretty-print.ts +1 -1
- package/src/prover/decide-pool.ts +3 -3
- package/src/prover/deciders.ts +12 -9
- package/src/prover/isabelle/decide.ts +3 -25
- package/src/prover/isabelle/encode.ts +72 -42
- 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 +158 -7
- package/src/prover/isabelle/isar/method.ts +509 -212
- package/src/prover/isabelle/isar/proof.ts +570 -14
- package/src/prover/isabelle/isar/rule-cases.ts +224 -0
- package/src/prover/isabelle/isar/theory.ts +487 -76
- package/src/prover/isabelle/isar/toplevel.ts +331 -0
- package/src/prover/isabelle/isar/type-check.ts +89 -14
- package/src/prover/isabelle/provers/blast/blast.ts +7 -65
- 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 +0 -2
- package/src/prover/isabelle/provers/classical.ts +45 -20
- package/src/prover/isabelle/provers/hypsubst.ts +17 -28
- package/src/prover/isabelle/pure/bicompose.ts +9 -27
- package/src/prover/isabelle/pure/consts.ts +0 -2
- package/src/prover/isabelle/pure/conv.ts +2 -10
- package/src/prover/isabelle/pure/drule.ts +72 -6
- 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 +1 -3
- 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 +4 -15
- package/src/prover/isabelle/pure/rewriter.ts +6 -17
- 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 +2 -3
- package/src/prover/isabelle/pure/tactic.ts +0 -2
- package/src/prover/isabelle/pure/tactical.ts +42 -37
- package/src/prover/isabelle/pure/term-ord.ts +0 -2
- package/src/prover/isabelle/pure/term.ts +0 -2
- package/src/prover/isabelle/pure/thm.ts +14 -13
- 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 +18 -16
- package/src/prover/isabelle/tla/context.ts +58 -11
- package/src/prover/isabelle/tla/logic-data.ts +1 -1
- package/src/prover/isabelle/tla/logic.ts +49 -21
- package/src/prover/isabelle/tla/simpdata.ts +1 -12
- package/src/prover/isabelle/tools/intuitionistic.ts +28 -12
- package/src/prover/ocaml.ts +4 -1
- package/src/prover/prep/action.ts +30 -31
- package/src/prover/prep/enabled-axioms.ts +11 -2
- package/src/prover/prep/fingerprint.ts +2 -5
- package/src/prover/prep/methods.ts +181 -51
- package/src/prover/prep/normalize.ts +38 -9
- package/src/prover/prove.ts +395 -94
- 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 +43 -8
- package/src/prover/smt/data.ts +498 -379
- package/src/prover/smt/encode.ts +148 -57
- 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 +1021 -618
- 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 +87 -16
- package/src/prover/smt/solver/ast-lt.ts +166 -12
- package/src/prover/smt/solver/ast-util.ts +160 -2
- package/src/prover/smt/solver/ast.ts +1427 -41
- package/src/prover/smt/solver/auf-solver.ts +2 -6
- 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 +338 -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 +110 -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 +516 -115
- package/src/prover/smt/solver/ctx-simplify.ts +20 -10
- 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 +206 -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 +7 -8
- package/src/prover/smt/solver/elim-small-bv-tactic.ts +129 -0
- package/src/prover/smt/solver/elim-uncnstr.ts +545 -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 +907 -0
- package/src/prover/smt/solver/euf/euf-solver.ts +1205 -0
- package/src/prover/smt/solver/euf/fpa-solver.ts +317 -0
- package/src/prover/smt/solver/euf/mam.ts +1050 -0
- package/src/prover/smt/solver/euf/q-ematch.ts +830 -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 +335 -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 +146 -0
- package/src/prover/smt/solver/factor.ts +141 -0
- package/src/prover/smt/solver/fd-solver.ts +265 -0
- package/src/prover/smt/solver/fingerprints.ts +15 -15
- package/src/prover/smt/solver/fix-dl-var.ts +148 -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 +640 -0
- package/src/prover/smt/solver/fpa2bv-converter.ts +2249 -0
- package/src/prover/smt/solver/fpa2bv-rewriter.ts +348 -0
- package/src/prover/smt/solver/fpa2bv-tactic.ts +73 -0
- package/src/prover/smt/solver/goal.ts +175 -15
- package/src/prover/smt/solver/goal2nlsat.ts +189 -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 +110 -38
- 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 +0 -1
- package/src/prover/smt/solver/lp/core-solver.ts +18 -3
- package/src/prover/smt/solver/lp/cross-nested.ts +0 -1
- 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 +1 -10
- 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 +1 -2
- 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 +0 -1
- package/src/prover/smt/solver/lp/nex.ts +0 -1
- package/src/prover/smt/solver/lp/nla-backoff.ts +0 -2
- package/src/prover/smt/solver/lp/nla-basics.ts +0 -2
- package/src/prover/smt/solver/lp/nla-core.ts +42 -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 +9 -4
- 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 +25 -4
- package/src/prover/smt/solver/lp/numeric-pair.ts +0 -1
- package/src/prover/smt/solver/lp/pdd-interval.ts +0 -1
- package/src/prover/smt/solver/lp/pdd-simplifier.ts +0 -1
- package/src/prover/smt/solver/lp/pdd-solver.ts +0 -2
- package/src/prover/smt/solver/lp/pdd.ts +2 -2
- 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 +122 -90
- 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 +18 -27
- package/src/prover/smt/solver/model-evaluator.ts +188 -12
- package/src/prover/smt/solver/model-finder.ts +12 -18
- package/src/prover/smt/solver/model-generator.ts +56 -29
- package/src/prover/smt/solver/model-macro-solver.ts +49 -46
- package/src/prover/smt/solver/model-printer.ts +214 -0
- package/src/prover/smt/solver/mpf.ts +711 -0
- package/src/prover/smt/solver/mus.ts +51 -0
- package/src/prover/smt/solver/muz/dl-context.ts +404 -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 +1406 -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 +218 -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 +125 -12
- package/src/prover/smt/solver/nlsat/atoms.ts +20 -6
- package/src/prover/smt/solver/nlsat/evaluator.ts +0 -1
- package/src/prover/smt/solver/nlsat/explain.ts +63 -23
- package/src/prover/smt/solver/nlsat/interval-set.ts +1 -2
- package/src/prover/smt/solver/nlsat/levelwise.ts +3 -9
- package/src/prover/smt/solver/nlsat/mpbq.ts +45 -1
- package/src/prover/smt/solver/nlsat/polynomial.ts +13 -6
- package/src/prover/smt/solver/nlsat/solver.ts +234 -36
- package/src/prover/smt/solver/nlsat/transcendental-eval.ts +310 -0
- package/src/prover/smt/solver/nlsat/transcendentals.ts +367 -0
- package/src/prover/smt/solver/nlsat/types.ts +0 -2
- package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +1 -4
- package/src/prover/smt/solver/nlsat/upolynomial.ts +0 -2
- 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 +787 -0
- package/src/prover/smt/solver/opt-nlsat.ts +375 -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 +308 -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 +284 -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 +512 -0
- package/src/prover/smt/solver/propagate-values.ts +37 -21
- package/src/prover/smt/solver/proto-model.ts +648 -19
- 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 +1098 -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 +1498 -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 +19 -20
- package/src/prover/smt/solver/quantifier-manager.ts +8 -16
- 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 +261 -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 +25 -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 +43 -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 +2127 -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 +1010 -0
- package/src/prover/smt/solver/seq-decl-plugin.ts +819 -0
- package/src/prover/smt/solver/seq-derive.ts +1301 -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 +728 -0
- package/src/prover/smt/solver/seq-range-predicate.ts +235 -0
- package/src/prover/smt/solver/seq-re-rewriter.ts +1170 -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 +2402 -0
- package/src/prover/smt/solver/seq-skolem.ts +317 -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 +83 -0
- package/src/prover/smt/solver/smt-logics.ts +66 -0
- package/src/prover/smt/solver/smt-setup.ts +496 -0
- package/src/prover/smt/solver/smt2-printer.ts +765 -0
- package/src/prover/smt/solver/smtlib-parser.ts +3126 -316
- package/src/prover/smt/solver/smtlib-script.ts +1631 -0
- package/src/prover/smt/solver/solve-eqs.ts +929 -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 +1986 -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 -6
- package/src/prover/smt/solver/theory-lra-final-check.ts +56 -70
- package/src/prover/smt/solver/theory-lra-internalize.ts +86 -27
- package/src/prover/smt/solver/theory-lra-model.ts +20 -35
- package/src/prover/smt/solver/theory-lra-propagate.ts +24 -26
- package/src/prover/smt/solver/theory-lra-state.ts +6 -22
- package/src/prover/smt/solver/theory-lra.ts +188 -1
- package/src/prover/smt/solver/theory-pb.ts +934 -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 +871 -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 +50 -19
- package/src/prover/tlapm/tlapm.ts +15 -9
- package/src/prover/tlapm-library.ts +3208 -0
- package/src/prover/verdict.ts +9 -0
- package/src/prover/zenon/check/check.ts +1 -2
- package/src/prover/zenon/check/records.ts +1 -1
- package/src/prover/zenon/check/relations.ts +2 -1
- package/src/prover/zenon/check/rewrites.ts +2 -15
- package/src/prover/zenon/check/sets.ts +40 -58
- package/src/prover/zenon/check/terms.ts +1 -2
- package/src/prover/zenon/decide.ts +10 -7
- package/src/prover/zenon/encode.ts +0 -2
- package/src/prover/zenon/eqrel.ts +2 -2
- package/src/prover/zenon/equality-rules.ts +0 -2
- package/src/prover/zenon/expr.ts +7 -2
- package/src/prover/zenon/index-table.ts +9 -21
- package/src/prover/zenon/isar-case.ts +0 -2
- package/src/prover/zenon/isar.ts +35 -37
- package/src/prover/zenon/llproof.ts +2 -13
- package/src/prover/zenon/mltoll.ts +12 -30
- package/src/prover/zenon/node.ts +20 -5
- package/src/prover/zenon/parse.ts +9 -8
- package/src/prover/zenon/phrase.ts +0 -2
- package/src/prover/zenon/proof.ts +0 -2
- package/src/prover/zenon/propositional-rules.ts +0 -2
- package/src/prover/zenon/rules.ts +0 -2
- package/src/prover/zenon/search.ts +11 -19
- package/src/prover/zenon/tla/functions.ts +2 -4
- package/src/prover/zenon/tla/llproof.ts +9 -13
- package/src/prover/zenon/tla/records.ts +1 -8
- package/src/prover/zenon/tla/rewrites.ts +0 -2
- package/src/prover/zenon/tla/sets.ts +22 -22
- package/src/prover/zenon/tla/terms.ts +0 -2
- package/src/prover/zenon/tla/tla.ts +7 -8
- package/src/resolve.ts +55 -72
- package/src/sany/generation.ts +394 -0
- package/src/sany/generator-def-entries.ts +210 -0
- package/src/sany/generator-definitions.ts +686 -0
- package/src/sany/generator-expressions.ts +1100 -0
- package/src/sany/generator-proofs.ts +662 -0
- package/src/sany/generator.ts +155 -2625
- package/src/sany/levels.ts +0 -2
- package/src/sany/lexer.ts +17 -16
- package/src/sany/linter.ts +0 -2
- package/src/sany/nodes.ts +6 -13
- package/src/sany/report.ts +3 -6
- package/src/sany/selectors.ts +35 -38
- package/src/sany/xml.ts +23 -55
- package/src/search.ts +196 -43
- package/src/simulate.ts +157 -133
- package/src/spec-description.ts +33 -48
- package/src/standard-modules.ts +16 -32
- package/src/state-graph.ts +2 -9
- package/src/substitution-levels.ts +5 -4
- package/src/successors.ts +6 -8
- package/src/symmetry.ts +2 -2
- package/src/tableau.ts +2 -2
- package/src/tlc/fingerprint.ts +81 -9
- package/src/tlc/messages.ts +20 -15
- package/src/tlc/order.ts +2 -9
- package/src/tlc/random.ts +4 -4
- package/src/tlc/replay.ts +8 -15
- package/src/tlc/summary.ts +29 -14
- package/src/tlc/tlc-operators.ts +2 -3
- package/src/tlc/trace-spec.ts +25 -45
- package/src/typed-tier.ts +6535 -0
- package/src/typescript/actions.ts +2 -4
- package/src/typescript/collections.ts +34 -20
- package/src/typescript/compile.ts +1 -3
- package/src/typescript/formula.ts +5 -3
- package/src/typescript/model.ts +4 -5
- package/src/typescript/steps.ts +20 -18
- package/src/values.ts +63 -158
- 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,8 +1,6 @@
|
|
|
1
|
-
|
|
2
|
-
|
|
3
|
-
import { TlaIsabelleError } from "../../../errors";
|
|
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,
|
|
@@ -80,17 +78,9 @@ export type Prover = (context: SimpContext, thm: Thm) => Thm | undefined;
|
|
|
80
78
|
export const simpleProver: Prover = (context, thm) =>
|
|
81
79
|
seqHead(allGoals(resolveTac(context.limits, context.simpset.prems))(thm));
|
|
82
80
|
|
|
83
|
-
const isThmError = (error: unknown) =>
|
|
84
|
-
error instanceof TlaIsabelleError && error.exception === "THM";
|
|
85
|
-
|
|
86
81
|
const lhsOf = (thm: Thm) => destEquals(thm.prop)[0];
|
|
87
82
|
const rhsOf = (thm: Thm) => destEquals(thm.prop)[1];
|
|
88
83
|
|
|
89
|
-
const betaEtaConversion = (term: Term) => {
|
|
90
|
-
const beta = betaConversion(true, term);
|
|
91
|
-
return transitive(beta, etaConversion(rhsOf(beta)));
|
|
92
|
-
};
|
|
93
|
-
|
|
94
84
|
const instantiateMatch = (env: MatchEnv, rule: Thm): Thm => {
|
|
95
85
|
const typed = instantiateTypes(env.tyenv, rule);
|
|
96
86
|
const insts: Instantiation[] = tableEntries(env.tenv).map(([key, binding]) => ({
|
|
@@ -109,18 +99,18 @@ const checkConv = (thm: Thm, next: Thm): Thm | undefined => {
|
|
|
109
99
|
try {
|
|
110
100
|
return transitive(thm, next);
|
|
111
101
|
} catch (error) {
|
|
112
|
-
if (!
|
|
102
|
+
if (!isIsabelleError(error, "THM")) throw error;
|
|
113
103
|
}
|
|
114
104
|
try {
|
|
115
105
|
const normalized = transitive(symmetric(betaEtaConversion(lhsOf(next))), next);
|
|
116
106
|
try {
|
|
117
107
|
return transitive(thm, normalized);
|
|
118
108
|
} catch (error) {
|
|
119
|
-
if (!
|
|
109
|
+
if (!isIsabelleError(error, "THM")) throw error;
|
|
120
110
|
return transitive(transitive(thm, betaEtaConversion(rhsOf(thm))), normalized);
|
|
121
111
|
}
|
|
122
112
|
} catch (error) {
|
|
123
|
-
if (
|
|
113
|
+
if (isIsabelleError(error, "THM")) return undefined;
|
|
124
114
|
throw error;
|
|
125
115
|
}
|
|
126
116
|
};
|
|
@@ -328,9 +318,8 @@ const bottomc = (mode: RewriteMode, prover: Prover, maxidx: number) => {
|
|
|
328
318
|
return inner === undefined ? undefined : abstractRule(term.name, variable, inner);
|
|
329
319
|
}
|
|
330
320
|
if (term.kind !== "App") return undefined;
|
|
321
|
+
if (isImplies(term)) return impc(term, context);
|
|
331
322
|
const head = term.fun;
|
|
332
|
-
if (head.kind === "App" && head.fun.kind === "Const" && head.fun.name === "Pure.imp")
|
|
333
|
-
return impc(term, context);
|
|
334
323
|
if (head.kind === "Abs") {
|
|
335
324
|
const beta = betaConversion(false, term);
|
|
336
325
|
const rest = subc(SKEL0, context, rhsOf(beta));
|
|
@@ -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/General/table.ML. Copyright (c) 1986-2025 University of Cambridge, Technische Universitaet Muenchen, and contributors, see LICENSE.
|
|
2
|
-
|
|
3
1
|
export type Compare<Key> = (left: Key, right: Key) => number;
|
|
4
2
|
|
|
5
3
|
type Node<Key, Value> =
|
|
@@ -157,7 +155,8 @@ export const fastStringOrd = (left: string, right: string) =>
|
|
|
157
155
|
? -1
|
|
158
156
|
: 1;
|
|
159
157
|
|
|
160
|
-
const stringOrd = (left: string, right: string) =>
|
|
158
|
+
export const stringOrd = (left: string, right: string) =>
|
|
159
|
+
left === right ? 0 : left < right ? -1 : 1;
|
|
161
160
|
|
|
162
161
|
export interface IndexKey {
|
|
163
162
|
readonly name: string;
|
|
@@ -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,6 +1,4 @@
|
|
|
1
|
-
|
|
2
|
-
|
|
3
|
-
import { TlaIsabelleError } from "../../../errors";
|
|
1
|
+
import { isIsabelleError } from "../../../errors";
|
|
4
2
|
import {
|
|
5
3
|
appendSeq,
|
|
6
4
|
emptySeq,
|
|
@@ -94,39 +92,49 @@ export const eqThmProp = (left: Thm, right: Thm) => aconv(left.prop, right.prop)
|
|
|
94
92
|
interface Trail {
|
|
95
93
|
readonly state: Thm;
|
|
96
94
|
readonly rest: Seq<Thm>;
|
|
97
|
-
readonly
|
|
95
|
+
readonly position: number;
|
|
96
|
+
readonly next: Trail | undefined;
|
|
98
97
|
}
|
|
99
98
|
|
|
100
|
-
|
|
101
|
-
|
|
102
|
-
|
|
103
|
-
|
|
104
|
-
|
|
105
|
-
|
|
106
|
-
|
|
107
|
-
|
|
108
|
-
|
|
109
|
-
|
|
110
|
-
|
|
111
|
-
|
|
112
|
-
|
|
113
|
-
|
|
114
|
-
|
|
115
|
-
|
|
116
|
-
|
|
117
|
-
|
|
118
|
-
|
|
119
|
-
|
|
120
|
-
|
|
121
|
-
|
|
122
|
-
|
|
123
|
-
|
|
124
|
-
|
|
125
|
-
|
|
126
|
-
|
|
99
|
+
// EVY and evyBack as one loop: blast replays thousands of tactics, too deep for mutual recursion.
|
|
100
|
+
export const every =
|
|
101
|
+
(tactics: readonly Tactic[]): Tactic =>
|
|
102
|
+
(start) => {
|
|
103
|
+
const evy = (
|
|
104
|
+
initialTrail: Trail | undefined,
|
|
105
|
+
initialPosition: number,
|
|
106
|
+
initialState: Thm | undefined,
|
|
107
|
+
): Cell<Thm> => {
|
|
108
|
+
let trail = initialTrail;
|
|
109
|
+
let position = initialPosition;
|
|
110
|
+
let state = initialState;
|
|
111
|
+
for (;;) {
|
|
112
|
+
if (state === undefined) {
|
|
113
|
+
if (trail === undefined) return undefined;
|
|
114
|
+
const cell = trail.rest.pull();
|
|
115
|
+
if (cell === undefined) trail = trail.next;
|
|
116
|
+
else if (eqThm(trail.state, cell[0])) trail = { ...trail, rest: cell[1] };
|
|
117
|
+
else {
|
|
118
|
+
trail = { state: cell[0], rest: cell[1], position: trail.position, next: trail.next };
|
|
119
|
+
position = trail.position;
|
|
120
|
+
state = cell[0];
|
|
121
|
+
}
|
|
122
|
+
} else if (position === tactics.length) {
|
|
123
|
+
const saved = trail;
|
|
124
|
+
return [state, makeSeq(() => evy(saved, 0, undefined))];
|
|
125
|
+
} else {
|
|
126
|
+
const cell = tactics[position](state).pull();
|
|
127
|
+
if (cell === undefined) state = undefined;
|
|
128
|
+
else {
|
|
129
|
+
trail = { state: cell[0], rest: cell[1], position: position + 1, next: trail };
|
|
130
|
+
position += 1;
|
|
131
|
+
state = cell[0];
|
|
132
|
+
}
|
|
133
|
+
}
|
|
134
|
+
}
|
|
135
|
+
};
|
|
136
|
+
return ofCell(evy(undefined, 0, start));
|
|
127
137
|
};
|
|
128
|
-
return (state) => evy([], tactics, state);
|
|
129
|
-
};
|
|
130
138
|
|
|
131
139
|
export const first = (tactics: readonly Tactic[]): Tactic =>
|
|
132
140
|
tactics.reduceRight((rest, tactic) => orElse(tactic, rest), noTac);
|
|
@@ -182,9 +190,6 @@ export const firstGoalTac =
|
|
|
182
190
|
return find(1)(state);
|
|
183
191
|
};
|
|
184
192
|
|
|
185
|
-
const isThmError = (error: unknown) =>
|
|
186
|
-
error instanceof TlaIsabelleError && error.exception === "THM";
|
|
187
|
-
|
|
188
193
|
export const subgoal =
|
|
189
194
|
(build: (goal: Term, index: number) => Tactic): GoalTactic =>
|
|
190
195
|
(index) =>
|
|
@@ -215,7 +220,7 @@ export const primSeq =
|
|
|
215
220
|
try {
|
|
216
221
|
return apply(state);
|
|
217
222
|
} catch (error) {
|
|
218
|
-
if (
|
|
223
|
+
if (isIsabelleError(error, "THM")) return emptySeq;
|
|
219
224
|
throw error;
|
|
220
225
|
}
|
|
221
226
|
};
|
|
@@ -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,6 +1,4 @@
|
|
|
1
|
-
|
|
2
|
-
|
|
3
|
-
import { TlaIsabelleError } from "../../../errors";
|
|
1
|
+
import { isIsabelleError, TlaIsabelleError } from "../../../errors";
|
|
4
2
|
import {
|
|
5
3
|
betaNorm,
|
|
6
4
|
emptyEnvir,
|
|
@@ -20,6 +18,7 @@ import {
|
|
|
20
18
|
liftAll,
|
|
21
19
|
listAll,
|
|
22
20
|
listImplies,
|
|
21
|
+
isImplies,
|
|
23
22
|
mkEquals,
|
|
24
23
|
mkImplies,
|
|
25
24
|
occs,
|
|
@@ -142,13 +141,7 @@ export const impliesIntr = (premise: Term, thm: Thm): Thm => {
|
|
|
142
141
|
|
|
143
142
|
export const impliesElim = (major: Thm, minor: Thm): Thm => {
|
|
144
143
|
const prop = major.prop;
|
|
145
|
-
if (
|
|
146
|
-
prop.kind !== "App" ||
|
|
147
|
-
prop.fun.kind !== "App" ||
|
|
148
|
-
prop.fun.fun.kind !== "Const" ||
|
|
149
|
-
prop.fun.fun.name !== "Pure.imp" ||
|
|
150
|
-
!aconv(prop.fun.arg, minor.prop)
|
|
151
|
-
)
|
|
144
|
+
if (!isImplies(prop) || !aconv(prop.fun.arg, minor.prop))
|
|
152
145
|
throw new TlaIsabelleError("THM", "implies_elim: major premise");
|
|
153
146
|
return makeThm(
|
|
154
147
|
Math.max(major.maxidx, minor.maxidx),
|
|
@@ -631,8 +624,7 @@ const bicomposeAux = (
|
|
|
631
624
|
try {
|
|
632
625
|
return stripPrems(compose.subgoals, [], orule.prop);
|
|
633
626
|
} catch (error) {
|
|
634
|
-
if (error
|
|
635
|
-
throw new TlaIsabelleError("THM", "bicompose: rule");
|
|
627
|
+
if (isIsabelleError(error, "TERM")) throw new TlaIsabelleError("THM", "bicompose: rule");
|
|
636
628
|
throw error;
|
|
637
629
|
}
|
|
638
630
|
})();
|
|
@@ -652,7 +644,7 @@ const bicomposeAux = (
|
|
|
652
644
|
try {
|
|
653
645
|
return flags.flatten ? renamed.map((premise) => flattenParams(index, premise)) : renamed;
|
|
654
646
|
} catch (error) {
|
|
655
|
-
if (error
|
|
647
|
+
if (isIsabelleError(error, "TERM"))
|
|
656
648
|
throw new TlaIsabelleError("THM", "bicompose: 1st premise");
|
|
657
649
|
throw error;
|
|
658
650
|
}
|
|
@@ -758,3 +750,12 @@ export const rsn = (rule: Thm, index: number, state: Thm): Thm => {
|
|
|
758
750
|
};
|
|
759
751
|
|
|
760
752
|
export const rs = (rule: Thm, state: Thm) => rsn(rule, 1, state);
|
|
753
|
+
|
|
754
|
+
export const catchThm = <Result>(derive: () => Result): Result | undefined => {
|
|
755
|
+
try {
|
|
756
|
+
return derive();
|
|
757
|
+
} catch (error) {
|
|
758
|
+
if (isIsabelleError(error, "THM")) return undefined;
|
|
759
|
+
throw error;
|
|
760
|
+
}
|
|
761
|
+
};
|
|
@@ -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,15 +1,19 @@
|
|
|
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";
|
|
6
4
|
import type { Limits } from "../pure/interrupt";
|
|
7
|
-
import {
|
|
5
|
+
import {
|
|
6
|
+
assumeTac,
|
|
7
|
+
dresolveTac,
|
|
8
|
+
insertTaggedBrl,
|
|
9
|
+
type NetPair,
|
|
10
|
+
type TaggedRule,
|
|
11
|
+
} from "../pure/tactic";
|
|
8
12
|
import type { Term } from "../pure/term";
|
|
9
13
|
import type { Thm } from "../pure/thm";
|
|
10
14
|
import { addbefore, type Claset, type ClassicalData } from "../provers/classical";
|
|
11
15
|
import { hypSubstTac, type HypsubstData } from "../provers/hypsubst";
|
|
12
|
-
import type {
|
|
16
|
+
import type { LogicNetPair, TlaLogic } from "./logic";
|
|
13
17
|
|
|
14
18
|
export const getFact = (logic: TlaLogic, name: string): Thm => {
|
|
15
19
|
const thms = logic.facts.get(name);
|
|
@@ -52,19 +56,16 @@ export const getHypsubstData = (logic: TlaLogic): HypsubstData => ({
|
|
|
52
56
|
thinRefl: getFact(logic, "PredicateLogic.thin_refl"),
|
|
53
57
|
});
|
|
54
58
|
|
|
55
|
-
export const getClassicalData = (logic: TlaLogic): ClassicalData => {
|
|
56
|
-
|
|
57
|
-
|
|
58
|
-
|
|
59
|
-
|
|
60
|
-
|
|
61
|
-
|
|
62
|
-
|
|
63
|
-
hypSubstTacs: [(limits: Limits) => hypSubstTac({ limits, data: hypsubst })],
|
|
64
|
-
};
|
|
65
|
-
};
|
|
59
|
+
export const getClassicalData = (logic: TlaLogic, hypsubst: HypsubstData): ClassicalData => ({
|
|
60
|
+
impElim: getFact(logic, "PredicateLogic.impCE'"),
|
|
61
|
+
notElim: getFact(logic, "PredicateLogic.notE"),
|
|
62
|
+
swap: getFact(logic, "PredicateLogic.swap"),
|
|
63
|
+
classical: getFact(logic, "PredicateLogic.classical"),
|
|
64
|
+
judgment: "PredicateLogic.Trueprop",
|
|
65
|
+
hypSubstTacs: [(limits: Limits) => hypSubstTac({ limits, data: hypsubst })],
|
|
66
|
+
});
|
|
66
67
|
|
|
67
|
-
export const toNetPair = <Item extends
|
|
68
|
+
export const toNetPair = <Item extends TaggedRule>(pair: LogicNetPair<Item>): NetPair<Item> => {
|
|
68
69
|
const insertAll = (items: readonly Item[], netpair: NetPair<Item>) =>
|
|
69
70
|
items.reduceRight((result, item) => insertTaggedBrl(item, result), netpair);
|
|
70
71
|
return insertAll(pair.elim, insertAll(pair.intro, { intro: emptyNet, elim: emptyNet }));
|
|
@@ -82,6 +83,7 @@ export const getClaset = (logic: TlaLogic, limits: Limits): Claset => {
|
|
|
82
83
|
safep: toNetPair(logic.claset.safep),
|
|
83
84
|
unsafe: toNetPair(logic.claset.unsafe),
|
|
84
85
|
dup: toNetPair(logic.claset.dup),
|
|
86
|
+
extra: toNetPair(logic.claset.extra),
|
|
85
87
|
};
|
|
86
88
|
return addbefore(
|
|
87
89
|
claset,
|
|
@@ -1,7 +1,10 @@
|
|
|
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";
|
|
4
|
-
import {
|
|
5
|
+
import { symmetric } from "../pure/thm";
|
|
6
|
+
import { blastDepthTac, blastTac } from "../provers/blast/blast";
|
|
7
|
+
import type { BlastContext } from "../provers/blast/state";
|
|
5
8
|
import type { ClassicalContext } from "../provers/classical";
|
|
6
9
|
import { blastHypSubstTac } from "../provers/hypsubst";
|
|
7
10
|
import {
|
|
@@ -24,10 +27,27 @@ const ATOMIZE_RULES = [
|
|
|
24
27
|
"PredicateLogic.atomize_all",
|
|
25
28
|
];
|
|
26
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
|
+
|
|
27
43
|
export const getProofContext = (logic: TlaLogic, limits: Limits): ProofContext => {
|
|
28
44
|
const atomizeRules = ATOMIZE_RULES.map((name) => getFact(logic, name));
|
|
29
|
-
const classical = { limits, claset: getClaset(logic, limits), data: getClassicalData(logic) };
|
|
30
45
|
const hypsubst = getHypsubstData(logic);
|
|
46
|
+
const classical = {
|
|
47
|
+
limits,
|
|
48
|
+
claset: getClaset(logic, limits),
|
|
49
|
+
data: getClassicalData(logic, hypsubst),
|
|
50
|
+
};
|
|
31
51
|
const toBlastContext = (context: ClassicalContext): BlastContext => ({
|
|
32
52
|
limits: context.limits,
|
|
33
53
|
claset: context.claset,
|
|
@@ -45,22 +65,49 @@ export const getProofContext = (logic: TlaLogic, limits: Limits): ProofContext =
|
|
|
45
65
|
atomize: atomizeRules,
|
|
46
66
|
},
|
|
47
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
|
+
);
|
|
48
84
|
return {
|
|
49
85
|
limits,
|
|
50
86
|
simpset: getSimpset(logic),
|
|
51
87
|
classical,
|
|
52
|
-
intuitionistic: {
|
|
53
|
-
limits,
|
|
54
|
-
safeRules: toNetPair(logic.contextRules.bang),
|
|
55
|
-
rules: toNetPair(logic.contextRules.plain),
|
|
56
|
-
},
|
|
88
|
+
intuitionistic: { limits, safeRules: contextRules[0], rules: contextRules[1] },
|
|
57
89
|
atomizeRules,
|
|
90
|
+
defnRules: DEFN_RULES.map((name) => symmetric(getFact(logic, name))),
|
|
91
|
+
rulifyRules: [...RULIFY_RULES.map((name) => symmetric(getFact(logic, name))), normHhfEq],
|
|
58
92
|
blastDepthTac: (context, limit) => blastDepthTac(toBlastContext(context), limit),
|
|
59
93
|
blastTac: (context) => blastTac(toBlastContext(context)),
|
|
60
|
-
|
|
61
|
-
|
|
62
|
-
|
|
63
|
-
|
|
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),
|
|
64
105
|
},
|
|
65
106
|
};
|
|
66
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
|
+
};
|