tla-ts 0.0.10-dev.f16792fed → 0.0.10-dev.f57f64938
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 +2682 -426
- 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 +42 -39
- 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 +49 -702
- package/src/cli/xml-exporter.ts +23 -33
- package/src/codegen.ts +5 -10
- package/src/coverage.ts +0 -2
- package/src/dependencies.ts +30 -14
- package/src/dfid.ts +16 -16
- package/src/environment-config.ts +315 -0
- package/src/environment.ts +55 -338
- 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/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 +56 -74
- package/src/runtime.ts +4 -0
- 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 +2 -3
- 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 +205 -43
- package/src/simulate.ts +157 -133
- package/src/spec-description.ts +33 -48
- package/src/standard-definitions.ts +4 -0
- package/src/standard-modules.ts +16 -32
- package/src/state-graph.ts +0 -2
- 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/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/tlcext-operators.ts +44 -12
- package/src/tlc/trace-spec.ts +21 -40
- 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 +62 -152
- 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
package/src/pretty-print.ts
CHANGED
|
@@ -1,9 +1,9 @@
|
|
|
1
1
|
import { TlaProverError } from "../errors";
|
|
2
2
|
import { spawnWorker, type WorkerHandle } from "../worker";
|
|
3
|
-
import type { DecideOptions, Decision } from "./verdict";
|
|
3
|
+
import type { Backend, DecideOptions, Decision } from "./verdict";
|
|
4
4
|
|
|
5
5
|
export interface DecideRequest {
|
|
6
|
-
prover:
|
|
6
|
+
prover: Backend;
|
|
7
7
|
text: string;
|
|
8
8
|
timeLimitMs: number;
|
|
9
9
|
}
|
|
@@ -19,7 +19,7 @@ interface PendingDecision {
|
|
|
19
19
|
|
|
20
20
|
export interface DecidePool {
|
|
21
21
|
decide: (
|
|
22
|
-
prover:
|
|
22
|
+
prover: Backend,
|
|
23
23
|
text: string,
|
|
24
24
|
options: DecideOptions,
|
|
25
25
|
priority: number,
|
package/src/prover/deciders.ts
CHANGED
|
@@ -2,28 +2,31 @@ import { SmtParseError, TlaProverError } from "../errors";
|
|
|
2
2
|
import { decideIsabelle } from "./isabelle/decide";
|
|
3
3
|
import { decidePtl } from "./ptl/decide";
|
|
4
4
|
import { decideSmt } from "./smt/solver/solver";
|
|
5
|
-
import type { DecideOptions, Decision
|
|
5
|
+
import type { Backend, DecideOptions, Decision } from "./verdict";
|
|
6
6
|
import { decideZenon } from "./zenon/decide";
|
|
7
7
|
|
|
8
8
|
const decideZ3 = (text: string, options: DecideOptions) => {
|
|
9
9
|
try {
|
|
10
|
-
|
|
10
|
+
const verdict = decideSmt(text, options);
|
|
11
|
+
return { verdict, output: `${verdict}\n` };
|
|
11
12
|
} catch (error) {
|
|
12
13
|
if (error instanceof SmtParseError) throw new TlaProverError(error.message, error);
|
|
13
14
|
throw error;
|
|
14
15
|
}
|
|
15
16
|
};
|
|
16
17
|
|
|
17
|
-
|
|
18
|
+
const DECIDERS: Record<
|
|
19
|
+
Backend,
|
|
20
|
+
(text: string, options: DecideOptions) => Omit<Decision, "timeUsedMs">
|
|
21
|
+
> = {
|
|
18
22
|
smt: decideZ3,
|
|
19
23
|
z3: decideZ3,
|
|
20
|
-
zenon:
|
|
21
|
-
isabelle: decideIsabelle,
|
|
22
|
-
ls4: decidePtl,
|
|
24
|
+
zenon: decideZenon,
|
|
25
|
+
isabelle: (text, options) => ({ verdict: decideIsabelle(text, options) }),
|
|
26
|
+
ls4: (text, options) => ({ verdict: decidePtl(text, options) }),
|
|
23
27
|
};
|
|
24
28
|
|
|
25
|
-
export const decide = (prover:
|
|
29
|
+
export const decide = (prover: Backend, text: string, options: DecideOptions): Decision => {
|
|
26
30
|
const start = performance.now();
|
|
27
|
-
|
|
28
|
-
return { verdict, timeUsedMs: performance.now() - start };
|
|
31
|
+
return { ...DECIDERS[prover](text, options), timeUsedMs: performance.now() - start };
|
|
29
32
|
};
|
|
@@ -1,36 +1,14 @@
|
|
|
1
1
|
import { isStackOverflow, TlaIsabelleError } from "../../errors";
|
|
2
2
|
import type { DecideOptions, Verdict } from "../verdict";
|
|
3
|
-
import { parseProofText, terminalProof } from "./isar/method";
|
|
4
|
-
import { getFacts, initGoal } from "./isar/proof";
|
|
5
|
-
import { readStatement } from "./isar/statement";
|
|
6
3
|
import { parseTheory } from "./isar/theory";
|
|
7
|
-
import {
|
|
8
|
-
import { seqHead } from "./pure/seq";
|
|
9
|
-
import { aconv } from "./pure/term";
|
|
10
|
-
import { getProofContext } from "./tla/context";
|
|
4
|
+
import { runTheory } from "./isar/toplevel";
|
|
11
5
|
import { loadLogic } from "./tla/logic";
|
|
12
6
|
|
|
13
7
|
export const decideIsabelle = (text: string, options: DecideOptions): Exclude<Verdict, "sat"> => {
|
|
14
8
|
const limits = { deadline: Date.now() + options.timeLimitMs, signal: options.signal };
|
|
15
9
|
try {
|
|
16
|
-
|
|
17
|
-
|
|
18
|
-
const statement = readStatement(logic, theory);
|
|
19
|
-
const facts = theory.isUsingAssms ? getFacts(limits, statement) : [];
|
|
20
|
-
const result = seqHead(
|
|
21
|
-
terminalProof(
|
|
22
|
-
getProofContext(logic, limits),
|
|
23
|
-
parseProofText(theory.method),
|
|
24
|
-
facts,
|
|
25
|
-
initGoal(statement),
|
|
26
|
-
),
|
|
27
|
-
);
|
|
28
|
-
return result !== undefined &&
|
|
29
|
-
result.tpairs.length === 0 &&
|
|
30
|
-
aconv(result.prop, protect(statement.conclusion)) &&
|
|
31
|
-
result.hyps.every((hyp) => statement.assumptions.some((assumption) => aconv(hyp, assumption)))
|
|
32
|
-
? "unsat"
|
|
33
|
-
: "unknown";
|
|
10
|
+
runTheory(loadLogic(), parseTheory(text), limits);
|
|
11
|
+
return "unsat";
|
|
34
12
|
} catch (error) {
|
|
35
13
|
if (error instanceof TlaIsabelleError || isStackOverflow(error)) return "unknown";
|
|
36
14
|
throw error;
|
|
@@ -1,5 +1,3 @@
|
|
|
1
|
-
// Ported from tlapm's src/backend/isabelle.ml (BSD licensed, see LICENSE-tlapm).
|
|
2
|
-
|
|
3
1
|
import { TlapmBugError, TlaProverError, TlaUnsupportedError } from "../../errors";
|
|
4
2
|
import { createContext, getBoundName, popNames, pushName } from "../../obligations/printer";
|
|
5
3
|
import type { Bound, Builtin, Expr, Sequent } from "../../obligations/expression";
|
|
@@ -145,7 +143,7 @@ const printLemma = (sequent: Sequent) => {
|
|
|
145
143
|
case "Ix": {
|
|
146
144
|
const name = getBoundName(context, operator.index);
|
|
147
145
|
if (operator.index <= 0 || name === undefined) throw new TlapmBugError();
|
|
148
|
-
return args.length === 0 ? name :
|
|
146
|
+
return args.length === 0 ? name : printNonfix(name, args);
|
|
149
147
|
}
|
|
150
148
|
case "Opaque": {
|
|
151
149
|
const name = pickle(operator.name);
|
|
@@ -340,8 +338,9 @@ const printLemma = (sequent: Sequent) => {
|
|
|
340
338
|
}
|
|
341
339
|
};
|
|
342
340
|
|
|
341
|
+
// A pragma's definition ends the lemma with an empty line in place of the goal.
|
|
342
|
+
const lines: string[] = [];
|
|
343
343
|
const printSequent = (sequent: Sequent) => {
|
|
344
|
-
const lines: string[] = [];
|
|
345
344
|
for (const hyp of sequent.context) {
|
|
346
345
|
switch (hyp.kind) {
|
|
347
346
|
case "Flex": {
|
|
@@ -374,60 +373,91 @@ const printLemma = (sequent: Sequent) => {
|
|
|
374
373
|
break;
|
|
375
374
|
}
|
|
376
375
|
case "Defn":
|
|
377
|
-
if (hyp.definition.kind === "Bpragma")
|
|
376
|
+
if (hyp.definition.kind === "Bpragma") {
|
|
377
|
+
lines.push("");
|
|
378
|
+
return;
|
|
379
|
+
}
|
|
378
380
|
lines.push(`(* usable definition ${hyp.definition.name} suppressed *)`);
|
|
379
381
|
adjoin(hyp.definition.name);
|
|
380
382
|
break;
|
|
381
383
|
}
|
|
382
384
|
}
|
|
383
|
-
|
|
385
|
+
lines.push(`shows "${printExpr(sequent.active)}"`);
|
|
384
386
|
};
|
|
385
387
|
|
|
386
|
-
|
|
387
|
-
|
|
388
|
-
|
|
389
|
-
|
|
390
|
-
|
|
391
|
-
|
|
392
|
-
|
|
393
|
-
|
|
394
|
-
|
|
395
|
-
}
|
|
388
|
+
const failure = (() => {
|
|
389
|
+
try {
|
|
390
|
+
printSequent(sequent);
|
|
391
|
+
return undefined;
|
|
392
|
+
} catch (error) {
|
|
393
|
+
if (error instanceof TlaProverError) return error;
|
|
394
|
+
if (!(error instanceof TlaUnsupportedError)) throw error;
|
|
395
|
+
return new TlaProverError(`isabelle : unsupported operator ${error.message}`);
|
|
396
|
+
}
|
|
397
|
+
})();
|
|
398
|
+
return {
|
|
399
|
+
text: lines.join("\n"),
|
|
400
|
+
isAssumed: lines.some((line) => line.startsWith("assumes ")),
|
|
401
|
+
failure,
|
|
402
|
+
};
|
|
396
403
|
};
|
|
397
404
|
|
|
398
|
-
|
|
405
|
+
interface ObligationSource {
|
|
406
|
+
location: string;
|
|
407
|
+
fingerprint: string;
|
|
408
|
+
}
|
|
409
|
+
|
|
410
|
+
export const encodeIsabelle = (
|
|
411
|
+
id: number,
|
|
412
|
+
sequent: Sequent,
|
|
413
|
+
tactic: string,
|
|
414
|
+
name: string,
|
|
415
|
+
source: ObligationSource,
|
|
416
|
+
write: (text: string) => void,
|
|
417
|
+
) => {
|
|
399
418
|
const lemma = printLemma(sequent);
|
|
400
|
-
|
|
401
|
-
|
|
402
|
-
|
|
403
|
-
|
|
404
|
-
|
|
405
|
-
|
|
406
|
-
|
|
407
|
-
|
|
408
|
-
|
|
409
|
-
|
|
410
|
-
|
|
419
|
+
write(
|
|
420
|
+
[
|
|
421
|
+
...getTheoryHeader(name, false),
|
|
422
|
+
`(* Generated from ${source.location} *)`,
|
|
423
|
+
`lemma ob'${id}: (* ${source.fingerprint} *)`,
|
|
424
|
+
lemma.text,
|
|
425
|
+
].join("\n"),
|
|
426
|
+
);
|
|
427
|
+
if (lemma.failure) throw lemma.failure;
|
|
428
|
+
write(
|
|
429
|
+
[
|
|
430
|
+
`(is "PROP ?ob'${id}")`,
|
|
431
|
+
"proof -",
|
|
432
|
+
`show "PROP ?ob'${id}"`,
|
|
433
|
+
`${lemma.isAssumed ? "using assms " : ""}by ${tactic}`,
|
|
434
|
+
"qed",
|
|
435
|
+
"end",
|
|
436
|
+
"",
|
|
437
|
+
].join("\n"),
|
|
438
|
+
);
|
|
411
439
|
};
|
|
412
440
|
|
|
413
441
|
interface IsabelleProof {
|
|
414
442
|
id: number;
|
|
415
443
|
sequent: Sequent;
|
|
416
|
-
|
|
444
|
+
proof: string;
|
|
417
445
|
}
|
|
418
446
|
|
|
419
447
|
export const encodeIsabelleTheory = (name: string, proofs: IsabelleProof[]) =>
|
|
420
448
|
[
|
|
421
|
-
|
|
422
|
-
...proofs.flatMap((proof) =>
|
|
423
|
-
|
|
424
|
-
|
|
425
|
-
|
|
426
|
-
|
|
427
|
-
|
|
428
|
-
|
|
429
|
-
|
|
430
|
-
|
|
431
|
-
|
|
432
|
-
|
|
433
|
-
|
|
449
|
+
`${getTheoryHeader(name, true).join("\n")}\n`,
|
|
450
|
+
...proofs.flatMap((proof) => {
|
|
451
|
+
const lemma = printLemma(proof.sequent);
|
|
452
|
+
if (lemma.failure) return [];
|
|
453
|
+
return [
|
|
454
|
+
`lemma ob'${proof.id}:`,
|
|
455
|
+
`${lemma.text}(is "PROP ?ob'${proof.id}")`,
|
|
456
|
+
"proof -",
|
|
457
|
+
`ML_command \\<open> writeln "*** TLAPS ENTER ${proof.id}"; \\<close>`,
|
|
458
|
+
`show "PROP ?ob'${proof.id}"`,
|
|
459
|
+
`${proof.proof}ML_command \\<open> writeln "*** TLAPS EXIT ${proof.id}"; \\<close> qed\n`,
|
|
460
|
+
].join("\n");
|
|
461
|
+
}),
|
|
462
|
+
"end\n",
|
|
463
|
+
].join("");
|
|
@@ -0,0 +1,250 @@
|
|
|
1
|
+
import { TlaIsabelleError } from "../../../errors";
|
|
2
|
+
import { addUnsafeDest, addUnsafeElim, addUnsafeIntro, withClaset } from "../provers/classical";
|
|
3
|
+
import { asmRl, compIncr, genAll, multiResolves, zeroVarIndexes } from "../pure/drule";
|
|
4
|
+
import { addSimps } from "../pure/raw-simplifier";
|
|
5
|
+
import { chopSeq } from "../pure/seq";
|
|
6
|
+
import { stripImpConcl } from "../pure/logic";
|
|
7
|
+
import { fastypeOf, type Var } from "../pure/term";
|
|
8
|
+
import { instantiate, instantiateTypes, type Thm } from "../pure/thm";
|
|
9
|
+
import { emptyTyEnv, matchTypes, substType, type TyEnv } from "../pure/type";
|
|
10
|
+
import { getFact, readTerms, varsOf, type IsarContext } from "./context";
|
|
11
|
+
import { rewriteRule, type ProofContext } from "./method";
|
|
12
|
+
import {
|
|
13
|
+
innerText,
|
|
14
|
+
syntaxError,
|
|
15
|
+
type AttributeSource,
|
|
16
|
+
type FactReference,
|
|
17
|
+
type OuterToken,
|
|
18
|
+
} from "./theory";
|
|
19
|
+
|
|
20
|
+
const isInnerToken = (token: OuterToken | undefined) =>
|
|
21
|
+
token !== undefined &&
|
|
22
|
+
(token.kind === "string" ||
|
|
23
|
+
token.kind === "cartouche" ||
|
|
24
|
+
token.kind === "word" ||
|
|
25
|
+
token.kind === "var");
|
|
26
|
+
|
|
27
|
+
export const parseFactReferences = (tokens: readonly OuterToken[]): FactReference[] => {
|
|
28
|
+
const references: FactReference[] = [];
|
|
29
|
+
let position = 0;
|
|
30
|
+
while (position < tokens.length) {
|
|
31
|
+
const token = tokens[position];
|
|
32
|
+
if (token.kind !== "word") throw syntaxError(token);
|
|
33
|
+
position += 1;
|
|
34
|
+
const attributes: AttributeSource[] = [];
|
|
35
|
+
if (tokens[position]?.kind === "symbol" && tokens[position].text === "[") {
|
|
36
|
+
position += 1;
|
|
37
|
+
for (;;) {
|
|
38
|
+
const attribute = tokens[position];
|
|
39
|
+
if (attribute?.kind !== "word") throw syntaxError(attribute);
|
|
40
|
+
position += 1;
|
|
41
|
+
const start = position;
|
|
42
|
+
let depth = 0;
|
|
43
|
+
while (
|
|
44
|
+
position < tokens.length &&
|
|
45
|
+
!(
|
|
46
|
+
depth === 0 &&
|
|
47
|
+
tokens[position].kind === "symbol" &&
|
|
48
|
+
(tokens[position].text === "," || tokens[position].text === "]")
|
|
49
|
+
)
|
|
50
|
+
) {
|
|
51
|
+
if (tokens[position].kind === "symbol" && "([".includes(tokens[position].text))
|
|
52
|
+
depth += 1;
|
|
53
|
+
if (tokens[position].kind === "symbol" && ")]".includes(tokens[position].text))
|
|
54
|
+
depth -= 1;
|
|
55
|
+
position += 1;
|
|
56
|
+
}
|
|
57
|
+
attributes.push({ name: attribute.text, args: tokens.slice(start, position) });
|
|
58
|
+
if (tokens[position]?.text === "]") break;
|
|
59
|
+
position += 1;
|
|
60
|
+
}
|
|
61
|
+
position += 1;
|
|
62
|
+
}
|
|
63
|
+
references.push({ name: token.text, attributes });
|
|
64
|
+
}
|
|
65
|
+
return references;
|
|
66
|
+
};
|
|
67
|
+
|
|
68
|
+
const varsOfThm = (thm: Thm) => varsOf([...thm.tpairs.flat(), thm.prop]);
|
|
69
|
+
|
|
70
|
+
// Rule_Insts.where_rule: the terms are read against the variables' types, whose type variables
|
|
71
|
+
// they instantiate, then Drule.instantiate_normalize.
|
|
72
|
+
const whereRule = (
|
|
73
|
+
context: IsarContext,
|
|
74
|
+
insts: readonly { readonly name: string; readonly index: number; readonly text: string }[],
|
|
75
|
+
thm: Thm,
|
|
76
|
+
): Thm => {
|
|
77
|
+
const vars = varsOfThm(thm);
|
|
78
|
+
const targets = insts.map((inst) => {
|
|
79
|
+
const variable = vars.find((other) => other.name === inst.name && other.index === inst.index);
|
|
80
|
+
if (variable === undefined)
|
|
81
|
+
throw new TlaIsabelleError(
|
|
82
|
+
"ERROR",
|
|
83
|
+
`No such variable in theorem: "?${inst.name}${inst.index === 0 ? "" : inst.index}"`,
|
|
84
|
+
);
|
|
85
|
+
return variable;
|
|
86
|
+
});
|
|
87
|
+
const terms = readTerms(
|
|
88
|
+
context,
|
|
89
|
+
insts.map((inst, index) => ({ text: inst.text, type: targets[index].type })),
|
|
90
|
+
"default",
|
|
91
|
+
);
|
|
92
|
+
const tyenv = targets.reduce<TyEnv>((env, target, index) => {
|
|
93
|
+
const matched = matchTypes(target.type, fastypeOf(terms[index]), env);
|
|
94
|
+
if (matched === undefined)
|
|
95
|
+
throw new TlaIsabelleError("ERROR", "Type mismatch in instantiation");
|
|
96
|
+
return matched;
|
|
97
|
+
}, emptyTyEnv);
|
|
98
|
+
const instantiated = instantiate(
|
|
99
|
+
targets.map((target, index) => ({
|
|
100
|
+
variable: { ...target, type: substType(tyenv, target.type) },
|
|
101
|
+
term: terms[index],
|
|
102
|
+
})),
|
|
103
|
+
instantiateTypes(tyenv, thm),
|
|
104
|
+
);
|
|
105
|
+
return compIncr(instantiated, asmRl);
|
|
106
|
+
};
|
|
107
|
+
|
|
108
|
+
// Rule_Insts.of_rule: the terms instantiate the theorem's variables in the order they occur,
|
|
109
|
+
// those after concl: the conclusion's.
|
|
110
|
+
const ofRule = (context: IsarContext, args: readonly OuterToken[], thm: Thm): Thm => {
|
|
111
|
+
const concl = args.findIndex(
|
|
112
|
+
(token, index) => token.text === "concl" && args[index + 1]?.text === ":",
|
|
113
|
+
);
|
|
114
|
+
const [premises, conclusion] =
|
|
115
|
+
concl < 0 ? [args, []] : [args.slice(0, concl), args.slice(concl + 2)];
|
|
116
|
+
const zipVars = (vars: readonly Var[], tokens: readonly OuterToken[]) => {
|
|
117
|
+
if (tokens.length > vars.length)
|
|
118
|
+
throw new TlaIsabelleError("ERROR", "More instantiations than variables in theorem");
|
|
119
|
+
return tokens.flatMap((token, index) => {
|
|
120
|
+
if (!isInnerToken(token)) throw syntaxError(token);
|
|
121
|
+
return token.kind === "word" && token.text === "_"
|
|
122
|
+
? []
|
|
123
|
+
: [{ name: vars[index].name, index: vars[index].index, text: innerText(token) }];
|
|
124
|
+
});
|
|
125
|
+
};
|
|
126
|
+
return whereRule(
|
|
127
|
+
context,
|
|
128
|
+
[
|
|
129
|
+
...zipVars(varsOfThm(thm), premises),
|
|
130
|
+
...zipVars(varsOf([stripImpConcl(thm.prop)]), conclusion),
|
|
131
|
+
],
|
|
132
|
+
thm,
|
|
133
|
+
);
|
|
134
|
+
};
|
|
135
|
+
|
|
136
|
+
const parseWhere = (args: readonly OuterToken[]) => {
|
|
137
|
+
const insts: { name: string; index: number; text: string }[] = [];
|
|
138
|
+
let position = 0;
|
|
139
|
+
while (position < args.length) {
|
|
140
|
+
const variable = args[position];
|
|
141
|
+
if ((variable.kind !== "word" && variable.kind !== "var") || variable.text.startsWith("'"))
|
|
142
|
+
throw syntaxError(variable);
|
|
143
|
+
const digits = /\d*$/.exec(variable.text)?.[0] ?? "";
|
|
144
|
+
if (args[position + 1]?.text !== "=" || !isInnerToken(args[position + 2]))
|
|
145
|
+
throw syntaxError(args[position + 1]);
|
|
146
|
+
insts.push({
|
|
147
|
+
name: variable.text.slice(
|
|
148
|
+
variable.kind === "var" ? 1 : 0,
|
|
149
|
+
variable.text.length - digits.length,
|
|
150
|
+
),
|
|
151
|
+
index: Number(digits || 0),
|
|
152
|
+
text: innerText(args[position + 2]),
|
|
153
|
+
});
|
|
154
|
+
position += 3;
|
|
155
|
+
if (position < args.length) {
|
|
156
|
+
if (args[position].text !== "and") throw syntaxError(args[position]);
|
|
157
|
+
position += 1;
|
|
158
|
+
}
|
|
159
|
+
}
|
|
160
|
+
return insts;
|
|
161
|
+
};
|
|
162
|
+
|
|
163
|
+
// Drule.OF: the facts resolve against the rule's premises, from the first, with a unique result.
|
|
164
|
+
const ofFacts = (context: IsarContext, rule: Thm, facts: readonly Thm[]): Thm => {
|
|
165
|
+
const [results] = chopSeq(2, multiResolves(context.tactics.limits, facts, [rule]));
|
|
166
|
+
if (results.length === 0) throw new TlaIsabelleError("THM", "OF: no unifiers");
|
|
167
|
+
if (results.length > 1) throw new TlaIsabelleError("THM", "OF: multiple unifiers");
|
|
168
|
+
return results[0];
|
|
169
|
+
};
|
|
170
|
+
|
|
171
|
+
// Object_Logic.rulify: object-level rules become meta-level ones.
|
|
172
|
+
const rulify = (context: IsarContext, thm: Thm): Thm =>
|
|
173
|
+
zeroVarIndexes(genAll(rewriteRule(context.tactics.limits, context.tactics.rulifyRules, thm)));
|
|
174
|
+
|
|
175
|
+
// Simplifier.simp_add and Classical's unsafe_intro, unsafe_elim and unsafe_dest: the declarations
|
|
176
|
+
// that add the theorem to a set the methods read.
|
|
177
|
+
const declareRule = (tactics: ProofContext, name: string, thm: Thm): ProofContext => {
|
|
178
|
+
if (name === "simp")
|
|
179
|
+
return {
|
|
180
|
+
...tactics,
|
|
181
|
+
simpset: addSimps({ limits: tactics.limits, simpset: tactics.simpset, bounds: 0 }, [thm]),
|
|
182
|
+
};
|
|
183
|
+
const classical = tactics.classical;
|
|
184
|
+
const add = name === "intro" ? addUnsafeIntro : name === "elim" ? addUnsafeElim : addUnsafeDest;
|
|
185
|
+
return {
|
|
186
|
+
...tactics,
|
|
187
|
+
classical: withClaset(classical, add(classical, thm, tactics.atomizeRules)),
|
|
188
|
+
};
|
|
189
|
+
};
|
|
190
|
+
|
|
191
|
+
// Thm.apply_attribute: a rule attribute changes the theorem, a declaration the context.
|
|
192
|
+
const applyAttribute = (
|
|
193
|
+
context: IsarContext,
|
|
194
|
+
attribute: AttributeSource,
|
|
195
|
+
thm: Thm,
|
|
196
|
+
): [IsarContext, Thm] => {
|
|
197
|
+
switch (attribute.name) {
|
|
198
|
+
case "of":
|
|
199
|
+
return [context, ofRule(context, attribute.args, thm)];
|
|
200
|
+
case "where":
|
|
201
|
+
return [context, whereRule(context, parseWhere(attribute.args), thm)];
|
|
202
|
+
case "rule_format":
|
|
203
|
+
if (attribute.args.length > 0) throw syntaxError(attribute.args[0]);
|
|
204
|
+
return [context, rulify(context, thm)];
|
|
205
|
+
case "OF":
|
|
206
|
+
return [
|
|
207
|
+
context,
|
|
208
|
+
ofFacts(context, thm, getThms(context, parseFactReferences(attribute.args))),
|
|
209
|
+
];
|
|
210
|
+
case "simp":
|
|
211
|
+
case "intro":
|
|
212
|
+
case "elim":
|
|
213
|
+
case "dest":
|
|
214
|
+
if (attribute.args.length > 0)
|
|
215
|
+
throw new TlaIsabelleError("ERROR", `Unsupported ${attribute.name} attribute arguments`);
|
|
216
|
+
return [{ ...context, tactics: declareRule(context.tactics, attribute.name, thm) }, thm];
|
|
217
|
+
default:
|
|
218
|
+
throw new TlaIsabelleError("ERROR", `Unsupported attribute: ${attribute.name}`);
|
|
219
|
+
}
|
|
220
|
+
};
|
|
221
|
+
|
|
222
|
+
// Thm.proof_attributes over a fact's theorems: each attribute sees what those before it declared.
|
|
223
|
+
export const applyAttributes = (
|
|
224
|
+
context: IsarContext,
|
|
225
|
+
attributes: readonly AttributeSource[],
|
|
226
|
+
thms: readonly Thm[],
|
|
227
|
+
): [IsarContext, Thm[]] =>
|
|
228
|
+
thms.reduce<[IsarContext, Thm[]]>(
|
|
229
|
+
([current, results], thm) => {
|
|
230
|
+
const [declared, result] = attributes.reduce<[IsarContext, Thm]>(
|
|
231
|
+
([inner, changed], attribute) => applyAttribute(inner, attribute, changed),
|
|
232
|
+
[current, thm],
|
|
233
|
+
);
|
|
234
|
+
return [declared, [...results, result]];
|
|
235
|
+
},
|
|
236
|
+
[context, []],
|
|
237
|
+
);
|
|
238
|
+
|
|
239
|
+
// The facts a command or a method cites, where the port keeps no declaration.
|
|
240
|
+
export const getThms = (context: IsarContext, references: readonly FactReference[]): Thm[] =>
|
|
241
|
+
references.flatMap((reference) => {
|
|
242
|
+
const [declared, thms] = applyAttributes(
|
|
243
|
+
context,
|
|
244
|
+
reference.attributes,
|
|
245
|
+
getFact(context, reference.name),
|
|
246
|
+
);
|
|
247
|
+
if (declared !== context)
|
|
248
|
+
throw new TlaIsabelleError("ERROR", "Unsupported declaration in a fact reference");
|
|
249
|
+
return thms;
|
|
250
|
+
});
|