tla-ts 0.0.9 → 0.0.10-dev.094b9b512
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/README.md +30 -1
- package/dist/compile.cjs +23 -0
- package/dist/compile.js +23 -0
- package/dist/deciders.cjs +40 -37
- package/dist/deciders.js +47 -44
- package/dist/index.cjs +1 -1
- package/dist/index.d.cts +106 -10
- package/dist/index.d.ts +106 -10
- package/dist/index.js +1 -1
- package/dist/parallel-worker.cjs +1 -1
- package/dist/parallel-worker.js +1 -1
- package/dist/prove-worker.cjs +1 -1
- package/dist/prove-worker.js +1 -1
- package/dist/prove.cjs +2658 -410
- package/dist/prove.js +2657 -409
- package/dist/run.cjs +144 -31
- package/dist/run.js +144 -31
- package/dist/tlapm.cjs +2 -2
- package/dist/tlapm.js +2 -2
- package/dist/transfer.cjs +129 -104
- package/dist/transfer.js +129 -104
- package/dist/worker.cjs +6 -6
- package/dist/worker.js +6 -6
- package/package.json +3 -1
- package/src/ast.ts +48 -62
- package/src/bags.ts +99 -102
- package/src/builtins.ts +28 -75
- package/src/bundled-modules.ts +1 -8
- package/src/check-failure.ts +116 -0
- package/src/check-trace.ts +282 -0
- package/src/check.ts +599 -754
- package/src/cli/options.ts +12 -32
- package/src/cli/run.ts +0 -2
- package/src/cli/runtime-invariants.ts +136 -0
- package/src/cli/shared.ts +19 -12
- package/src/cli/tlapm.ts +208 -54
- package/src/cli/tlc-arguments.ts +652 -0
- package/src/cli/tlc-output.ts +687 -0
- package/src/cli/tlc-usage.ts +361 -0
- package/src/cli/tlc.ts +309 -658
- package/src/cli/typescript.ts +23 -0
- package/src/cli/xml-exporter.ts +27 -49
- package/src/cli.ts +0 -1
- package/src/codegen.ts +196 -74
- package/src/config.ts +140 -109
- package/src/coverage.ts +830 -0
- package/src/dependencies.ts +14 -53
- package/src/dfid.ts +618 -0
- package/src/environment-config.ts +315 -0
- package/src/environment.ts +169 -335
- package/src/errors.ts +100 -57
- package/src/evaluate.ts +598 -340
- package/src/exit-codes.ts +37 -3
- package/src/fingerprints.ts +75 -11
- package/src/index.ts +3 -0
- package/src/instances.ts +126 -21
- package/src/java-hash.ts +7 -0
- package/src/java-overrides.ts +4 -19
- package/src/json-reader.ts +455 -0
- package/src/json.ts +252 -139
- package/src/levels.ts +46 -58
- package/src/lexer.ts +83 -101
- package/src/liveness-checker.ts +103 -153
- package/src/liveness.ts +150 -109
- package/src/obligations/action.ts +18 -43
- package/src/obligations/anonymize.ts +119 -90
- package/src/obligations/enabled-axioms.ts +218 -0
- package/src/obligations/equality.ts +2 -2
- package/src/obligations/expression.ts +38 -25
- package/src/obligations/format.ts +1 -9
- package/src/obligations/generate.ts +67 -63
- package/src/obligations/index.ts +38 -20
- package/src/obligations/levels.ts +28 -17
- package/src/obligations/module.ts +29 -54
- package/src/obligations/normalize.ts +31 -36
- package/src/obligations/operators.ts +1 -2
- package/src/obligations/pragma.ts +53 -25
- package/src/obligations/printer.ts +90 -57
- package/src/obligations/proof.ts +4 -5
- package/src/obligations/regroup.ts +1 -4
- package/src/obligations/simplify.ts +58 -62
- package/src/obligations/source.ts +119 -95
- package/src/obligations/subexpression.ts +51 -27
- package/src/obligations/substitution.ts +2 -4
- package/src/obligations/temporal.ts +13 -19
- package/src/obligations/tuples.ts +3 -9
- package/src/parallel-worker.ts +30 -60
- package/src/parallel.ts +57 -71
- package/src/parser.ts +961 -387
- package/src/pcal/ast.ts +53 -86
- package/src/pcal/parse.ts +144 -219
- package/src/pcal/tokenize.ts +91 -131
- package/src/pcal/translate.ts +83 -130
- package/src/pcal/validate.ts +48 -68
- package/src/pretty-print.ts +7 -8
- package/src/prover/decide-pool.ts +8 -13
- package/src/prover/deciders.ts +19 -13
- package/src/prover/first-order.ts +0 -11
- package/src/prover/isabelle/decide.ts +3 -31
- package/src/prover/isabelle/encode.ts +82 -62
- package/src/prover/isabelle/isar/attrib.ts +219 -0
- package/src/prover/isabelle/isar/context.ts +336 -0
- package/src/prover/isabelle/isar/induct.ts +392 -0
- package/src/prover/isabelle/isar/inner-syntax.ts +262 -117
- package/src/prover/isabelle/isar/method.ts +513 -225
- package/src/prover/isabelle/isar/proof.ts +569 -23
- package/src/prover/isabelle/isar/rule-cases.ts +234 -0
- package/src/prover/isabelle/isar/theory.ts +490 -89
- package/src/prover/isabelle/isar/toplevel.ts +341 -0
- package/src/prover/isabelle/isar/type-check.ts +100 -37
- package/src/prover/isabelle/provers/blast/blast.ts +17 -104
- package/src/prover/isabelle/provers/blast/branch.ts +1 -32
- package/src/prover/isabelle/provers/blast/prove.ts +1 -35
- package/src/prover/isabelle/provers/blast/rules.ts +6 -44
- package/src/prover/isabelle/provers/blast/state.ts +2 -28
- package/src/prover/isabelle/provers/blast/term.ts +9 -36
- package/src/prover/isabelle/provers/clasimp.ts +1 -13
- package/src/prover/isabelle/provers/classical.ts +59 -60
- package/src/prover/isabelle/provers/hypsubst.ts +28 -51
- package/src/prover/isabelle/pure/bicompose.ts +25 -38
- package/src/prover/isabelle/pure/consts.ts +1 -7
- package/src/prover/isabelle/pure/conv.ts +3 -17
- package/src/prover/isabelle/pure/drule.ts +96 -44
- package/src/prover/isabelle/pure/envir.ts +3 -52
- package/src/prover/isabelle/pure/goal.ts +2 -8
- package/src/prover/isabelle/pure/interrupt.ts +0 -5
- package/src/prover/isabelle/pure/list.ts +0 -3
- package/src/prover/isabelle/pure/logic.ts +2 -15
- package/src/prover/isabelle/pure/name.ts +2 -9
- package/src/prover/isabelle/pure/net.ts +3 -59
- package/src/prover/isabelle/pure/object-logic.ts +16 -15
- package/src/prover/isabelle/pure/pattern.ts +2 -19
- package/src/prover/isabelle/pure/raw-simplifier.ts +17 -62
- package/src/prover/isabelle/pure/rewriter.ts +32 -73
- package/src/prover/isabelle/pure/search.ts +3 -10
- package/src/prover/isabelle/pure/seq.ts +1 -10
- package/src/prover/isabelle/pure/simplifier.ts +28 -15
- package/src/prover/isabelle/pure/table.ts +3 -32
- package/src/prover/isabelle/pure/tactic.ts +12 -22
- package/src/prover/isabelle/pure/tactical.ts +48 -47
- package/src/prover/isabelle/pure/term-ord.ts +2 -6
- package/src/prover/isabelle/pure/term.ts +2 -43
- package/src/prover/isabelle/pure/thm.ts +27 -47
- package/src/prover/isabelle/pure/type.ts +2 -15
- package/src/prover/isabelle/pure/unify.ts +20 -30
- package/src/prover/isabelle/pure/variable.ts +3 -7
- package/src/prover/isabelle/tla/classical-setup.ts +18 -24
- package/src/prover/isabelle/tla/context.ts +65 -26
- package/src/prover/isabelle/tla/logic-data.ts +1 -1
- package/src/prover/isabelle/tla/logic.ts +53 -32
- package/src/prover/isabelle/tla/simpdata.ts +46 -43
- package/src/prover/isabelle/tools/intuitionistic.ts +29 -20
- package/src/prover/ocaml.ts +0 -6
- package/src/prover/prep/action.ts +32 -66
- package/src/prover/prep/enabled-axioms.ts +22 -20
- package/src/prover/prep/fingerprint.ts +2 -21
- package/src/prover/prep/level-comparison.ts +8 -12
- package/src/prover/prep/md5.ts +0 -2
- package/src/prover/prep/methods.ts +137 -83
- package/src/prover/prep/normalize.ts +38 -36
- package/src/prover/prove-worker.ts +0 -2
- package/src/prover/prove.ts +371 -132
- package/src/prover/ptl/decide.ts +104 -44
- package/src/prover/ptl/encode.ts +15 -38
- package/src/prover/ptl/sat.ts +24 -32
- package/src/prover/ptl/tableau.ts +40 -28
- package/src/prover/smt/arithmetic.ts +310 -0
- package/src/prover/smt/axioms.ts +12 -15
- package/src/prover/smt/context.ts +61 -29
- package/src/prover/smt/data.ts +497 -387
- package/src/prover/smt/encode.ts +156 -85
- package/src/prover/smt/extensionality.ts +5 -13
- package/src/prover/smt/flatten.ts +7 -28
- package/src/prover/smt/format.ts +33 -14
- package/src/prover/smt/instances.ts +7 -11
- package/src/prover/smt/layout.ts +91 -0
- package/src/prover/smt/rewrite.ts +1025 -658
- package/src/prover/smt/simplify.ts +441 -0
- package/src/prover/smt/solver/ackermannize-bv-tactic.ts +63 -0
- package/src/prover/smt/solver/ackr-helper.ts +182 -0
- package/src/prover/smt/solver/ackr-model-converter.ts +112 -0
- package/src/prover/smt/solver/act-cache.ts +0 -15
- package/src/prover/smt/solver/add-bounds-tactic.ts +60 -0
- package/src/prover/smt/solver/aig-tactic.ts +43 -0
- package/src/prover/smt/solver/aig.ts +890 -0
- package/src/prover/smt/solver/arith-rewriter.ts +613 -48
- package/src/prover/smt/solver/arith-terms.ts +123 -0
- package/src/prover/smt/solver/array-decl-plugin.ts +176 -0
- package/src/prover/smt/solver/array-rewriter.ts +312 -0
- package/src/prover/smt/solver/array.ts +1 -3
- package/src/prover/smt/solver/asserted-formulas.ts +87 -57
- package/src/prover/smt/solver/ast-lt.ts +166 -21
- package/src/prover/smt/solver/ast-util.ts +161 -7
- package/src/prover/smt/solver/ast.ts +1466 -178
- package/src/prover/smt/solver/auf-solver.ts +8 -44
- package/src/prover/smt/solver/bit-blast-tactic.ts +591 -0
- package/src/prover/smt/solver/bit-blaster.ts +874 -0
- package/src/prover/smt/solver/bound-manager.ts +186 -0
- package/src/prover/smt/solver/bound-simplifier.ts +602 -0
- package/src/prover/smt/solver/bv-bound-chk.ts +500 -0
- package/src/prover/smt/solver/bv-decl-plugin.ts +339 -0
- package/src/prover/smt/solver/bv-divrem-bounds.ts +97 -0
- package/src/prover/smt/solver/bv-rewriter.ts +1905 -0
- package/src/prover/smt/solver/bv1-blast.ts +224 -0
- package/src/prover/smt/solver/bv2fpa-converter.ts +175 -0
- package/src/prover/smt/solver/bv2int-rewriter.ts +545 -0
- package/src/prover/smt/solver/bv2real-rewriter.ts +534 -0
- package/src/prover/smt/solver/card2bv.ts +112 -0
- package/src/prover/smt/solver/case-split-queue.ts +1 -9
- package/src/prover/smt/solver/cg-table.ts +28 -34
- package/src/prover/smt/solver/check-logic.ts +326 -0
- package/src/prover/smt/solver/clause.ts +1 -27
- package/src/prover/smt/solver/cofactor-elim-term-ite.ts +280 -0
- package/src/prover/smt/solver/conflict-resolution.ts +79 -12
- package/src/prover/smt/solver/context.ts +510 -175
- package/src/prover/smt/solver/ctx-simplify.ts +34 -50
- package/src/prover/smt/solver/ctx-solver-simplify.ts +124 -0
- package/src/prover/smt/solver/datatype-decl-plugin.ts +575 -0
- package/src/prover/smt/solver/datatype-rewriter.ts +83 -0
- package/src/prover/smt/solver/demodulator.ts +789 -0
- package/src/prover/smt/solver/dependent-expr-state.ts +68 -0
- package/src/prover/smt/solver/der.ts +40 -30
- package/src/prover/smt/solver/diff-neq.ts +207 -0
- package/src/prover/smt/solver/distribute-forall.ts +67 -0
- package/src/prover/smt/solver/dom-simplify.ts +513 -0
- package/src/prover/smt/solver/dt2bv-tactic.ts +267 -0
- package/src/prover/smt/solver/dyn-ack.ts +1 -11
- package/src/prover/smt/solver/e-matching.ts +4 -35
- package/src/prover/smt/solver/elim-small-bv-tactic.ts +130 -0
- package/src/prover/smt/solver/elim-uncnstr.ts +558 -0
- package/src/prover/smt/solver/enode.ts +93 -22
- package/src/prover/smt/solver/eq2bv-tactic.ts +219 -0
- package/src/prover/smt/solver/euf/arith-axioms.ts +404 -0
- package/src/prover/smt/solver/euf/arith-internalize.ts +659 -0
- package/src/prover/smt/solver/euf/arith-solver.ts +895 -0
- package/src/prover/smt/solver/euf/array-axioms.ts +528 -0
- package/src/prover/smt/solver/euf/array-internalize.ts +419 -0
- package/src/prover/smt/solver/euf/array-solver.ts +308 -0
- package/src/prover/smt/solver/euf/bv-ackerman.ts +164 -0
- package/src/prover/smt/solver/euf/bv-internalize.ts +750 -0
- package/src/prover/smt/solver/euf/bv-solver.ts +451 -0
- package/src/prover/smt/solver/euf/dt-solver.ts +620 -0
- package/src/prover/smt/solver/euf/egraph.ts +885 -0
- package/src/prover/smt/solver/euf/euf-solver.ts +1203 -0
- package/src/prover/smt/solver/euf/fpa-solver.ts +333 -0
- package/src/prover/smt/solver/euf/mam.ts +1094 -0
- package/src/prover/smt/solver/euf/q-ematch.ts +900 -0
- package/src/prover/smt/solver/euf/q-mbi.ts +587 -0
- package/src/prover/smt/solver/euf/q-model-fixer.ts +299 -0
- package/src/prover/smt/solver/euf/q-solver.ts +361 -0
- package/src/prover/smt/solver/euf/th-solver.ts +343 -0
- package/src/prover/smt/solver/euf/th-solvers.ts +31 -0
- package/src/prover/smt/solver/expr-ref.ts +1 -5
- package/src/prover/smt/solver/expr-safe-replace.ts +26 -6
- package/src/prover/smt/solver/expr2polynomial.ts +147 -0
- package/src/prover/smt/solver/factor.ts +152 -0
- package/src/prover/smt/solver/fd-solver.ts +269 -0
- package/src/prover/smt/solver/fingerprints.ts +16 -26
- package/src/prover/smt/solver/fix-dl-var.ts +149 -0
- package/src/prover/smt/solver/flat-literals.ts +1 -9
- package/src/prover/smt/solver/fm-tactic.ts +873 -0
- package/src/prover/smt/solver/fpa-decl-plugin.ts +619 -0
- package/src/prover/smt/solver/fpa-rewriter.ts +641 -0
- package/src/prover/smt/solver/fpa2bv-converter.ts +2246 -0
- package/src/prover/smt/solver/fpa2bv-rewriter.ts +349 -0
- package/src/prover/smt/solver/fpa2bv-tactic.ts +75 -0
- package/src/prover/smt/solver/goal.ts +177 -28
- package/src/prover/smt/solver/goal2nlsat.ts +191 -0
- package/src/prover/smt/solver/guard-set.ts +220 -0
- package/src/prover/smt/solver/hash.ts +0 -8
- package/src/prover/smt/solver/hashtable.ts +27 -23
- package/src/prover/smt/solver/inf-eps.ts +64 -0
- package/src/prover/smt/solver/inj-axiom.ts +102 -0
- package/src/prover/smt/solver/internalizer.ts +72 -130
- package/src/prover/smt/solver/lackr.ts +383 -0
- package/src/prover/smt/solver/lbool.ts +1 -2
- package/src/prover/smt/solver/lia2card.ts +269 -0
- package/src/prover/smt/solver/lia2pb.ts +141 -0
- package/src/prover/smt/solver/literal.ts +0 -3
- package/src/prover/smt/solver/logic-tactics.ts +349 -0
- package/src/prover/smt/solver/lp/bound-propagator.ts +8 -26
- package/src/prover/smt/solver/lp/constraints.ts +2 -8
- package/src/prover/smt/solver/lp/containers.ts +12 -30
- package/src/prover/smt/solver/lp/core-solver.ts +24 -27
- package/src/prover/smt/solver/lp/cross-nested.ts +6 -20
- package/src/prover/smt/solver/lp/dep-intervals.ts +7 -22
- package/src/prover/smt/solver/lp/dependency.ts +1 -4
- package/src/prover/smt/solver/lp/dioph-eq.ts +9 -102
- package/src/prover/smt/solver/lp/explanation.ts +1 -6
- package/src/prover/smt/solver/lp/gomory.ts +9 -22
- package/src/prover/smt/solver/lp/hnf-cutter.ts +17 -23
- package/src/prover/smt/solver/lp/hnf.ts +11 -26
- package/src/prover/smt/solver/lp/int-cube.ts +18 -39
- package/src/prover/smt/solver/lp/int-solver.ts +4 -34
- package/src/prover/smt/solver/lp/lar-solver.ts +70 -82
- package/src/prover/smt/solver/lp/lar-term.ts +1 -5
- package/src/prover/smt/solver/lp/lp-settings.ts +1 -14
- package/src/prover/smt/solver/lp/maximize-term.ts +79 -52
- package/src/prover/smt/solver/lp/nex-creator.ts +5 -28
- package/src/prover/smt/solver/lp/nex.ts +1 -6
- package/src/prover/smt/solver/lp/nla-backoff.ts +1 -4
- package/src/prover/smt/solver/lp/nla-basics.ts +5 -30
- package/src/prover/smt/solver/lp/nla-core.ts +69 -132
- package/src/prover/smt/solver/lp/nla-divisions.ts +32 -42
- package/src/prover/smt/solver/lp/nla-emonics.ts +4 -21
- package/src/prover/smt/solver/lp/nla-factorization.ts +1 -4
- package/src/prover/smt/solver/lp/nla-grobner.ts +24 -72
- package/src/prover/smt/solver/lp/nla-horner.ts +3 -11
- package/src/prover/smt/solver/lp/nla-intervals.ts +2 -12
- package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +16 -41
- package/src/prover/smt/solver/lp/nla-monotone.ts +2 -6
- package/src/prover/smt/solver/lp/nla-order.ts +2 -13
- package/src/prover/smt/solver/lp/nla-patcher.ts +4 -7
- package/src/prover/smt/solver/lp/nla-powers.ts +184 -0
- package/src/prover/smt/solver/lp/nla-tangents.ts +1 -9
- package/src/prover/smt/solver/lp/nla-throttle.ts +1 -6
- package/src/prover/smt/solver/lp/nla-transcendentals.ts +293 -0
- package/src/prover/smt/solver/lp/nla-types.ts +1 -11
- package/src/prover/smt/solver/lp/nla-var-eqs.ts +4 -25
- package/src/prover/smt/solver/lp/nra-solver.ts +30 -54
- package/src/prover/smt/solver/lp/numeric-pair.ts +1 -4
- package/src/prover/smt/solver/lp/pdd-interval.ts +1 -3
- package/src/prover/smt/solver/lp/pdd-simplifier.ts +2 -14
- package/src/prover/smt/solver/lp/pdd-solver.ts +4 -33
- package/src/prover/smt/solver/lp/pdd.ts +7 -70
- package/src/prover/smt/solver/lp/random-updater.ts +1 -8
- package/src/prover/smt/solver/lp/static-matrix.ts +9 -19
- package/src/prover/smt/solver/lp/union-find.ts +6 -5
- package/src/prover/smt/solver/macro-finder.ts +533 -0
- package/src/prover/smt/solver/mam-compiler.ts +117 -126
- package/src/prover/smt/solver/mam-interpreter.ts +1 -21
- package/src/prover/smt/solver/max-bv-sharing-tactic.ts +29 -0
- package/src/prover/smt/solver/max-cliques.ts +107 -0
- package/src/prover/smt/solver/maxcore.ts +318 -0
- package/src/prover/smt/solver/maximize-ac-sharing.ts +9 -20
- package/src/prover/smt/solver/maxlex.ts +123 -0
- package/src/prover/smt/solver/maxsmt-base.ts +99 -0
- package/src/prover/smt/solver/maxsmt.ts +93 -0
- package/src/prover/smt/solver/mbp/mbp-arith.ts +477 -0
- package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +102 -0
- package/src/prover/smt/solver/mbp/mbp-plugin.ts +280 -0
- package/src/prover/smt/solver/mbp/mbp-qel.ts +49 -0
- package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +280 -0
- package/src/prover/smt/solver/mbp/mbp-term-graph.ts +624 -0
- package/src/prover/smt/solver/model-based-opt.ts +845 -0
- package/src/prover/smt/solver/model-checker.ts +20 -62
- package/src/prover/smt/solver/model-evaluator.ts +186 -39
- package/src/prover/smt/solver/model-finder.ts +15 -32
- package/src/prover/smt/solver/model-generator.ts +57 -40
- package/src/prover/smt/solver/model-macro-solver.ts +58 -111
- package/src/prover/smt/solver/model-printer.ts +215 -0
- package/src/prover/smt/solver/mpf.ts +712 -0
- package/src/prover/smt/solver/mus.ts +52 -0
- package/src/prover/smt/solver/muz/dl-context.ts +362 -0
- package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +98 -0
- package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +121 -0
- package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +121 -0
- package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +305 -0
- package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +427 -0
- package/src/prover/smt/solver/muz/dl-mk-slice.ts +278 -0
- package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +158 -0
- package/src/prover/smt/solver/muz/dl-rule-set.ts +303 -0
- package/src/prover/smt/solver/muz/dl-rule-transformer.ts +127 -0
- package/src/prover/smt/solver/muz/dl-rule.ts +460 -0
- package/src/prover/smt/solver/muz/hnf.ts +201 -0
- package/src/prover/smt/solver/muz/horn-tactic.ts +192 -0
- package/src/prover/smt/solver/muz/rule-properties.ts +179 -0
- package/src/prover/smt/solver/muz/spacer-context.ts +1395 -0
- package/src/prover/smt/solver/muz/spacer-dl-interface.ts +41 -0
- package/src/prover/smt/solver/muz/spacer-generalizers.ts +244 -0
- package/src/prover/smt/solver/muz/spacer-manager.ts +133 -0
- package/src/prover/smt/solver/muz/spacer-pdr.ts +219 -0
- package/src/prover/smt/solver/muz/spacer-prop-solver.ts +344 -0
- package/src/prover/smt/solver/muz/spacer-util.ts +309 -0
- package/src/prover/smt/solver/muz/substitution.ts +154 -0
- package/src/prover/smt/solver/nla2bv-tactic.ts +286 -0
- package/src/prover/smt/solver/nlqsat.ts +484 -0
- package/src/prover/smt/solver/nlsat/algebraic.ts +179 -159
- package/src/prover/smt/solver/nlsat/atoms.ts +25 -23
- package/src/prover/smt/solver/nlsat/evaluator.ts +17 -22
- package/src/prover/smt/solver/nlsat/explain.ts +61 -69
- package/src/prover/smt/solver/nlsat/interval-set.ts +10 -51
- package/src/prover/smt/solver/nlsat/levelwise.ts +49 -135
- package/src/prover/smt/solver/nlsat/mpbq.ts +48 -14
- package/src/prover/smt/solver/nlsat/polynomial.ts +30 -160
- package/src/prover/smt/solver/nlsat/solver.ts +227 -99
- package/src/prover/smt/solver/nlsat/transcendental-eval.ts +311 -0
- package/src/prover/smt/solver/nlsat/transcendentals.ts +369 -0
- package/src/prover/smt/solver/nlsat/types.ts +1 -8
- package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +2 -45
- package/src/prover/smt/solver/nlsat/upolynomial.ts +11 -92
- package/src/prover/smt/solver/nlsat-tactic.ts +83 -0
- package/src/prover/smt/solver/nnf.ts +108 -60
- package/src/prover/smt/solver/normalize-bounds.ts +54 -0
- package/src/prover/smt/solver/occf.ts +98 -0
- package/src/prover/smt/solver/opt-context.ts +787 -0
- package/src/prover/smt/solver/opt-nlsat.ts +366 -0
- package/src/prover/smt/solver/opt-pareto.ts +284 -0
- package/src/prover/smt/solver/opt-preprocess.ts +102 -0
- package/src/prover/smt/solver/opt-solver.ts +300 -0
- package/src/prover/smt/solver/opt-value.ts +56 -0
- package/src/prover/smt/solver/optsmt.ts +691 -0
- package/src/prover/smt/solver/parallel-tactic.ts +301 -0
- package/src/prover/smt/solver/pattern-inference.ts +19 -23
- package/src/prover/smt/solver/pb-rewriter.ts +296 -0
- package/src/prover/smt/solver/pb2bv-tactic.ts +542 -0
- package/src/prover/smt/solver/poly-rewriter.ts +203 -77
- package/src/prover/smt/solver/probes.ts +514 -0
- package/src/prover/smt/solver/propagate-values.ts +34 -30
- package/src/prover/smt/solver/proto-model.ts +648 -63
- package/src/prover/smt/solver/pull-quant.ts +29 -23
- package/src/prover/smt/solver/purify-arith.ts +598 -0
- package/src/prover/smt/solver/qe-arith-plugin.ts +1099 -0
- package/src/prover/smt/solver/qe-lite-der.ts +3 -31
- package/src/prover/smt/solver/qe-lite-fm.ts +5 -28
- package/src/prover/smt/solver/qe-lite.ts +40 -49
- package/src/prover/smt/solver/qe-mbp.ts +281 -0
- package/src/prover/smt/solver/qe.ts +1508 -0
- package/src/prover/smt/solver/qel.ts +26 -0
- package/src/prover/smt/solver/qi-queue.ts +1 -16
- package/src/prover/smt/solver/qsat.ts +840 -0
- package/src/prover/smt/solver/quant-hoist.ts +195 -0
- package/src/prover/smt/solver/quant-tactics.ts +18 -74
- package/src/prover/smt/solver/quantifier-analyzer.ts +27 -47
- package/src/prover/smt/solver/quantifier-manager.ts +9 -23
- package/src/prover/smt/solver/quasi-macros.ts +254 -0
- package/src/prover/smt/solver/random-gen.ts +1 -2
- package/src/prover/smt/solver/rational.ts +29 -8
- package/src/prover/smt/solver/recfun-decl-plugin.ts +248 -0
- package/src/prover/smt/solver/recfun-rewriter.ts +108 -0
- package/src/prover/smt/solver/reduce-args.ts +226 -0
- package/src/prover/smt/solver/reduce-bv-size.ts +120 -0
- package/src/prover/smt/solver/ref-vector.ts +1 -6
- package/src/prover/smt/solver/relevancy.ts +3 -16
- package/src/prover/smt/solver/rewriter-tpl.ts +49 -129
- package/src/prover/smt/solver/rewriter.ts +478 -120
- package/src/prover/smt/solver/rlimit.ts +27 -21
- package/src/prover/smt/solver/sat/asymm-branch.ts +314 -0
- package/src/prover/smt/solver/sat/big.ts +178 -0
- package/src/prover/smt/solver/sat/clause-use-list.ts +79 -0
- package/src/prover/smt/solver/sat/clause.ts +221 -0
- package/src/prover/smt/solver/sat/cleaner.ts +96 -0
- package/src/prover/smt/solver/sat/config.ts +125 -0
- package/src/prover/smt/solver/sat/consequences.ts +204 -0
- package/src/prover/smt/solver/sat/elim-eqs.ts +144 -0
- package/src/prover/smt/solver/sat/goal2sat.ts +528 -0
- package/src/prover/smt/solver/sat/inc-sat-solver.ts +388 -0
- package/src/prover/smt/solver/sat/model-converter.ts +156 -0
- package/src/prover/smt/solver/sat/pb-constraint.ts +264 -0
- package/src/prover/smt/solver/sat/pb-solver.ts +1553 -0
- package/src/prover/smt/solver/sat/probing.ts +169 -0
- package/src/prover/smt/solver/sat/sat-tactic.ts +44 -0
- package/src/prover/smt/solver/sat/sat2goal.ts +171 -0
- package/src/prover/smt/solver/sat/scc.ts +143 -0
- package/src/prover/smt/solver/sat/simplifier.ts +1662 -0
- package/src/prover/smt/solver/sat/solver.ts +2128 -0
- package/src/prover/smt/solver/sat/var-queue.ts +119 -0
- package/src/prover/smt/solver/sat/watch-list.ts +136 -0
- package/src/prover/smt/solver/search-tree.ts +285 -0
- package/src/prover/smt/solver/seq-axioms.ts +1013 -0
- package/src/prover/smt/solver/seq-decl-plugin.ts +823 -0
- package/src/prover/smt/solver/seq-derive.ts +1303 -0
- package/src/prover/smt/solver/seq-eq-approx.ts +238 -0
- package/src/prover/smt/solver/seq-eq-solver.ts +440 -0
- package/src/prover/smt/solver/seq-factory.ts +91 -0
- package/src/prover/smt/solver/seq-monadic.ts +730 -0
- package/src/prover/smt/solver/seq-range-predicate.ts +225 -0
- package/src/prover/smt/solver/seq-re-rewriter.ts +1296 -0
- package/src/prover/smt/solver/seq-re-util.ts +777 -0
- package/src/prover/smt/solver/seq-regex-bisim.ts +145 -0
- package/src/prover/smt/solver/seq-regex-live.ts +202 -0
- package/src/prover/smt/solver/seq-regex-witness.ts +100 -0
- package/src/prover/smt/solver/seq-rewriter.ts +2407 -0
- package/src/prover/smt/solver/seq-skolem.ts +318 -0
- package/src/prover/smt/solver/seq-subset.ts +166 -0
- package/src/prover/smt/solver/seq-view-witness.ts +355 -0
- package/src/prover/smt/solver/smt-consequences.ts +299 -0
- package/src/prover/smt/solver/smt-kernel.ts +85 -0
- package/src/prover/smt/solver/smt-logics.ts +67 -0
- package/src/prover/smt/solver/smt-setup.ts +492 -0
- package/src/prover/smt/solver/smt2-printer.ts +767 -0
- package/src/prover/smt/solver/smtlib-parser.ts +2423 -270
- package/src/prover/smt/solver/smtlib-script.ts +1493 -0
- package/src/prover/smt/solver/solve-eqs.ts +931 -0
- package/src/prover/smt/solver/solver.ts +120 -39
- package/src/prover/smt/solver/sort.ts +1 -5
- package/src/prover/smt/solver/static-features.ts +319 -0
- package/src/prover/smt/solver/sticky-generations.ts +0 -5
- package/src/prover/smt/solver/tactic.ts +1936 -0
- package/src/prover/smt/solver/term-enumeration.ts +206 -0
- package/src/prover/smt/solver/theory-array.ts +1275 -0
- package/src/prover/smt/solver/theory-bv.ts +1239 -0
- package/src/prover/smt/solver/theory-char.ts +356 -0
- package/src/prover/smt/solver/theory-datatype.ts +599 -0
- package/src/prover/smt/solver/theory-finite-set.ts +30 -0
- package/src/prover/smt/solver/theory-fpa.ts +422 -0
- package/src/prover/smt/solver/theory-lra-axioms.ts +56 -25
- package/src/prover/smt/solver/theory-lra-bounds.ts +31 -10
- package/src/prover/smt/solver/theory-lra-final-check.ts +60 -91
- package/src/prover/smt/solver/theory-lra-internalize.ts +87 -53
- package/src/prover/smt/solver/theory-lra-model.ts +24 -53
- package/src/prover/smt/solver/theory-lra-propagate.ts +25 -40
- package/src/prover/smt/solver/theory-lra-state.ts +7 -27
- package/src/prover/smt/solver/theory-lra.ts +194 -8
- package/src/prover/smt/solver/theory-pb.ts +932 -0
- package/src/prover/smt/solver/theory-polymorphism.ts +59 -0
- package/src/prover/smt/solver/theory-recfun.ts +308 -0
- package/src/prover/smt/solver/theory-seq-regex.ts +871 -0
- package/src/prover/smt/solver/theory-seq-solve.ts +1375 -0
- package/src/prover/smt/solver/theory-seq-state.ts +880 -0
- package/src/prover/smt/solver/theory-seq.ts +984 -0
- package/src/prover/smt/solver/theory.ts +175 -0
- package/src/prover/smt/solver/tseitin-cnf.ts +487 -0
- package/src/prover/smt/solver/var-subst.ts +33 -35
- package/src/prover/smt/table.ts +1 -9
- package/src/prover/smt/types.ts +146 -0
- package/src/prover/tlapm/cache.ts +67 -41
- package/src/prover/tlapm/ocaml-marshal.ts +19 -21
- package/src/prover/tlapm/tlapm.ts +21 -20
- package/src/prover/tlapm-library.ts +3208 -0
- package/src/prover/verdict.ts +9 -2
- package/src/prover/zenon/check/check.ts +1 -11
- package/src/prover/zenon/check/definitions.ts +5 -15
- package/src/prover/zenon/check/equality.ts +0 -8
- package/src/prover/zenon/check/functions.ts +0 -4
- package/src/prover/zenon/check/keys.ts +0 -7
- package/src/prover/zenon/check/propositional.ts +0 -3
- package/src/prover/zenon/check/records.ts +1 -6
- package/src/prover/zenon/check/relations.ts +2 -14
- package/src/prover/zenon/check/rewrites.ts +2 -21
- package/src/prover/zenon/check/sets.ts +40 -61
- package/src/prover/zenon/check/terms.ts +1 -19
- package/src/prover/zenon/check/tla.ts +0 -6
- package/src/prover/zenon/decide.ts +10 -15
- package/src/prover/zenon/encode.ts +1 -8
- package/src/prover/zenon/eqrel.ts +2 -13
- package/src/prover/zenon/equality-rules.ts +0 -4
- package/src/prover/zenon/expr.ts +8 -26
- package/src/prover/zenon/index-table.ts +26 -57
- package/src/prover/zenon/isar-case.ts +9 -19
- package/src/prover/zenon/isar.ts +36 -64
- package/src/prover/zenon/limits.ts +0 -4
- package/src/prover/zenon/llproof.ts +2 -20
- package/src/prover/zenon/mltoll.ts +66 -104
- package/src/prover/zenon/node.ts +20 -14
- package/src/prover/zenon/ocaml.ts +1 -17
- package/src/prover/zenon/parse.ts +10 -12
- package/src/prover/zenon/phrase.ts +1 -11
- package/src/prover/zenon/proof.ts +0 -9
- package/src/prover/zenon/propositional-rules.ts +0 -5
- package/src/prover/zenon/rules.ts +2 -6
- package/src/prover/zenon/search.ts +11 -33
- package/src/prover/zenon/tla/functions.ts +59 -31
- package/src/prover/zenon/tla/llproof.ts +67 -76
- package/src/prover/zenon/tla/records.ts +57 -33
- package/src/prover/zenon/tla/rewrites.ts +12 -19
- package/src/prover/zenon/tla/sets.ts +88 -57
- package/src/prover/zenon/tla/terms.ts +0 -6
- package/src/prover/zenon/tla/tla.ts +66 -64
- package/src/randomization.ts +81 -35
- package/src/resolve.ts +67 -184
- package/src/runtime.ts +22 -22
- package/src/sany/builtins.ts +2 -5
- package/src/sany/generation.ts +394 -0
- package/src/sany/generator-def-entries.ts +210 -0
- package/src/sany/generator-definitions.ts +686 -0
- package/src/sany/generator-expressions.ts +1100 -0
- package/src/sany/generator-proofs.ts +662 -0
- package/src/sany/generator.ts +191 -2764
- package/src/sany/levels.ts +6 -34
- package/src/sany/lexer.ts +58 -77
- package/src/sany/linter.ts +1 -9
- package/src/sany/modules.ts +1 -5
- package/src/sany/nodes.ts +5 -43
- package/src/sany/parse-error.ts +39 -117
- package/src/sany/report.ts +32 -69
- package/src/sany/selectors.ts +49 -76
- package/src/sany/source.ts +1 -17
- package/src/sany/xml.ts +35 -117
- package/src/search.ts +541 -163
- package/src/simulate.ts +709 -0
- package/src/spec-description.ts +192 -100
- package/src/standard-definitions.ts +0 -4
- package/src/standard-modules.ts +264 -95
- package/src/state-graph.ts +52 -31
- package/src/subexpressions.ts +69 -52
- package/src/substitution-levels.ts +7 -7
- package/src/successors.ts +266 -99
- package/src/symmetry.ts +33 -25
- package/src/tableau.ts +27 -24
- package/src/tlc/fingerprint.ts +183 -67
- package/src/tlc/jar-data.ts +112 -6
- package/src/tlc/messages.ts +125 -54
- package/src/tlc/order.ts +39 -69
- package/src/tlc/random.ts +37 -49
- package/src/tlc/replay.ts +553 -228
- package/src/tlc/summary.ts +36 -47
- package/src/tlc/tlc-operators.ts +78 -44
- package/src/tlc/tlcext-operators.ts +139 -122
- package/src/tlc/trace-spec.ts +249 -0
- package/src/tlc/value-stream.ts +139 -0
- package/src/tlc/version.ts +1 -4
- package/src/transfer.ts +22 -25
- package/src/typescript/actions.ts +479 -0
- package/src/typescript/collections.ts +614 -0
- package/src/typescript/compile.ts +63 -0
- package/src/typescript/context.ts +94 -0
- package/src/typescript/emit.ts +121 -0
- package/src/typescript/expressions.ts +496 -0
- package/src/typescript/formula.ts +154 -0
- package/src/typescript/functions.ts +284 -0
- package/src/typescript/model.ts +162 -0
- package/src/typescript/names.ts +114 -0
- package/src/typescript/program.ts +48 -0
- package/src/typescript/properties.ts +139 -0
- package/src/typescript/scope.ts +112 -0
- package/src/typescript/steps.ts +167 -0
- package/src/typescript/types.ts +171 -0
- package/src/values.ts +832 -484
- package/src/worker.ts +7 -8
- package/src/prover/isabelle/isar/statement.ts +0 -57
- package/src/prover/tlaps-module.ts +0 -510
|
@@ -1,6 +1,3 @@
|
|
|
1
|
-
// Expr.Action.implication_to_enabled, the ENABLEDaxioms frontend: it proves a rule about ENABLED
|
|
2
|
-
// from facts of the form the rule needs.
|
|
3
|
-
|
|
4
1
|
import { TlapmBugError, TlaProverError } from "../../errors";
|
|
5
2
|
import { shiftExpr } from "../../obligations/substitution";
|
|
6
3
|
import { isEqualExpr } from "../../obligations/equality";
|
|
@@ -9,10 +6,13 @@ import {
|
|
|
9
6
|
adjoinAll,
|
|
10
7
|
getScopeAt,
|
|
11
8
|
mapScoped,
|
|
9
|
+
getAtPrefix,
|
|
12
10
|
type Builtin,
|
|
13
11
|
type Expr,
|
|
12
|
+
type Locus,
|
|
14
13
|
type Scope,
|
|
15
14
|
type Sequent,
|
|
15
|
+
type Warn,
|
|
16
16
|
} from "../../obligations/expression";
|
|
17
17
|
import { getLevelInfo } from "../../obligations/levels";
|
|
18
18
|
|
|
@@ -40,7 +40,6 @@ const getEnabled = (expression: Expr) =>
|
|
|
40
40
|
? expression.args[0]
|
|
41
41
|
: undefined;
|
|
42
42
|
|
|
43
|
-
// Both operands of the connective, when each is an ENABLED.
|
|
44
43
|
const getEnabledOperands = (expression: Expr, builtin: Builtin) => {
|
|
45
44
|
const operands = getOperands(expression, builtin);
|
|
46
45
|
const left = operands && getEnabled(operands[0]);
|
|
@@ -48,7 +47,6 @@ const getEnabledOperands = (expression: Expr, builtin: Builtin) => {
|
|
|
48
47
|
return left && right ? [left, right] : undefined;
|
|
49
48
|
};
|
|
50
49
|
|
|
51
|
-
// E_visit.collect_primed_vars: the variables under a prime, an UNCHANGED, or a subscript.
|
|
52
50
|
const getPrimedVariables = (scope: Scope | undefined, expression: Expr) => {
|
|
53
51
|
const names = new Set<string>();
|
|
54
52
|
const visit = (state: { scope: Scope | undefined; isPrimed: boolean }, inner: Expr): Expr => {
|
|
@@ -90,7 +88,6 @@ const isDisjoint = (scope: Scope | undefined, left: Expr, right: Expr) => {
|
|
|
90
88
|
return [...getPrimedVariables(scope, right)].every((name) => !leftNames.has(name));
|
|
91
89
|
};
|
|
92
90
|
|
|
93
|
-
// check_active: the rule the goal's form calls for, with the operands the facts must mention.
|
|
94
91
|
const getRule = (scope: Scope | undefined, goal: Expr): Rule | undefined => {
|
|
95
92
|
const getLevelOf = (expression: Expr) => getLevelInfo(scope, expression).level;
|
|
96
93
|
const assertActions = (left: Expr, right: Expr) => {
|
|
@@ -135,13 +132,17 @@ const getRule = (scope: Scope | undefined, goal: Expr): Rule | undefined => {
|
|
|
135
132
|
return implication && { name: "implies", left: implication[0], right: implication[1] };
|
|
136
133
|
};
|
|
137
134
|
|
|
138
|
-
//
|
|
139
|
-
|
|
140
|
-
|
|
141
|
-
|
|
135
|
+
// When no rule applies, tlapm records the obligation as not tried.
|
|
136
|
+
export const implicationToEnabled = (
|
|
137
|
+
sequent: Sequent,
|
|
138
|
+
locus: Locus | undefined,
|
|
139
|
+
onWarning: Warn,
|
|
140
|
+
): Sequent => {
|
|
142
141
|
const goalScope = adjoinAll(undefined, sequent.context);
|
|
143
142
|
const rule = getRule(goalScope, sequent.active);
|
|
144
|
-
|
|
143
|
+
let isPremise = false;
|
|
144
|
+
let isLeftBoolean = false;
|
|
145
|
+
let isRightBoolean = false;
|
|
145
146
|
sequent.context.forEach((hyp, index) => {
|
|
146
147
|
if (!rule || hyp.kind !== "Fact" || hyp.visibility !== "Visible") return;
|
|
147
148
|
const amount = sequent.context.length - index;
|
|
@@ -167,23 +168,24 @@ export const implicationToEnabled = (sequent: Sequent): Sequent => {
|
|
|
167
168
|
isPair(getEnabledOperands(fact, "Conj"), ["abconj_inverse", "pconj_inverse"]) ||
|
|
168
169
|
isPair(conjunction && action && [conjunction[0], action], ["pconj_inverse"])
|
|
169
170
|
) {
|
|
170
|
-
|
|
171
|
+
isPremise = true;
|
|
171
172
|
} else if (isPair(getOperands(fact, "Equiv"), ["equiv"])) {
|
|
172
|
-
|
|
173
|
-
|
|
174
|
-
|
|
173
|
+
isPremise = true;
|
|
174
|
+
isLeftBoolean = true;
|
|
175
|
+
isRightBoolean = true;
|
|
175
176
|
} else if (isPair(getOperands(fact, "Eq"), ["equiv"])) {
|
|
176
|
-
|
|
177
|
+
isPremise = true;
|
|
177
178
|
} else if (membership && isBoolean && isLeft(membership[0])) {
|
|
178
|
-
|
|
179
|
+
isLeftBoolean = true;
|
|
179
180
|
} else if (membership && isBoolean && isRight(membership[0])) {
|
|
180
|
-
|
|
181
|
+
isRightBoolean = true;
|
|
181
182
|
} else if (isPair(getOperands(fact, "Implies"), ["implies"])) {
|
|
182
|
-
|
|
183
|
+
isPremise = true;
|
|
183
184
|
}
|
|
184
185
|
});
|
|
185
|
-
if (!
|
|
186
|
+
if (!rule || !isPremise || !isLeftBoolean || !isRightBoolean) {
|
|
186
187
|
throw new TlaProverError("ENABLEDaxioms proof directive did not succeed.\n");
|
|
187
188
|
}
|
|
189
|
+
onWarning({ text: `${getAtPrefix(locus)}[INFO]\nProved ${rule.name}\n`, channel: "stdout" });
|
|
188
190
|
return { ...sequent, active: TRUE };
|
|
189
191
|
};
|
|
@@ -1,21 +1,16 @@
|
|
|
1
|
-
// A port of tlapm's Backend.Fingerprints.fp_sequent: the digest of an obligation that names its
|
|
2
|
-
// hypotheses and bound variables by the order of their first use, so two obligations that differ
|
|
3
|
-
// only in names share it.
|
|
4
|
-
|
|
5
1
|
import { TlapmBugError } from "../../errors";
|
|
6
2
|
import {
|
|
7
3
|
adjoin,
|
|
8
4
|
type Bound,
|
|
9
5
|
type Builtin,
|
|
10
6
|
type Expr,
|
|
11
|
-
type Hyp,
|
|
12
7
|
type Scope,
|
|
13
8
|
type Sequent,
|
|
14
9
|
} from "../../obligations/expression";
|
|
15
10
|
import { isConstant } from "../../obligations/temporal";
|
|
11
|
+
import { LEVEL_PREFIXES } from "./action";
|
|
16
12
|
import { getMd5 } from "./md5";
|
|
17
13
|
|
|
18
|
-
// builtin_to_int, whose numbers skip [], which fp_bin prints by name.
|
|
19
14
|
const BUILTIN_NUMBERS: Builtin[] = [
|
|
20
15
|
"TRUE",
|
|
21
16
|
"FALSE",
|
|
@@ -97,8 +92,6 @@ const MODALS = { Box: 0, Dia: 1 };
|
|
|
97
92
|
|
|
98
93
|
const FAIRNESS = { Weak: 0, Strong: 1 };
|
|
99
94
|
|
|
100
|
-
// What a stack entry stands for: a hypothesis not yet used, under the label its first use prints,
|
|
101
|
-
// one used, numbered, a bound variable not yet used, one used, a pragma, or a hidden fact.
|
|
102
95
|
type Ident =
|
|
103
96
|
| { kind: "Hyp"; label: string }
|
|
104
97
|
| { kind: "HypIndex"; index: number }
|
|
@@ -126,7 +119,6 @@ const OCAML_ESCAPES: Record<number, string> = {
|
|
|
126
119
|
0x08: "\\b",
|
|
127
120
|
};
|
|
128
121
|
|
|
129
|
-
// OCaml's %S: a string literal, with each byte outside printable ASCII as a decimal escape.
|
|
130
122
|
const quoteString = (value: string) =>
|
|
131
123
|
`"${[...new TextEncoder().encode(value)]
|
|
132
124
|
.map(
|
|
@@ -144,10 +136,6 @@ const getBuiltin = (builtin: Builtin) => {
|
|
|
144
136
|
return `$${BUILTIN_NUMBERS.indexOf(builtin)}`;
|
|
145
137
|
};
|
|
146
138
|
|
|
147
|
-
const getFreshLabel = (hyp: Extract<Hyp, { kind: "Fresh" }>) =>
|
|
148
|
-
hyp.level === "Unknown" ? "Unknown" : hyp.level.toUpperCase();
|
|
149
|
-
|
|
150
|
-
// fp_sequent's text for an obligation, before its digest.
|
|
151
139
|
const getFingerprintText = (sequent: Sequent) => {
|
|
152
140
|
const stack: Entry[] = [];
|
|
153
141
|
const getEntry = (index: number) => {
|
|
@@ -163,7 +151,6 @@ const getFingerprintText = (sequent: Sequent) => {
|
|
|
163
151
|
};
|
|
164
152
|
const pushVariables = (count: number) =>
|
|
165
153
|
Array.from({ length: count }).forEach(() => push({ kind: "Var" }));
|
|
166
|
-
// Stack.popn: the entries from the top down.
|
|
167
154
|
const popVariables = (count: number) => Array.from({ length: count }, pop);
|
|
168
155
|
const getVariableNumber = (entry: Entry) => {
|
|
169
156
|
if (entry.ident.kind === "VarIndex") return entry.ident.index;
|
|
@@ -178,7 +165,6 @@ const getFingerprintText = (sequent: Sequent) => {
|
|
|
178
165
|
const printExpr = (counters: Counters, expression: Expr): string => {
|
|
179
166
|
const print = (inner: Expr) => printExpr(counters, inner);
|
|
180
167
|
const printList = (items: Expr[]) => items.map(print).join(",");
|
|
181
|
-
// fp_bounds pairs each bound with an entry, and prints those with a domain.
|
|
182
168
|
const printBounds = (entries: Entry[], bounds: Bound[]) =>
|
|
183
169
|
bounds
|
|
184
170
|
.map((bound, index) =>
|
|
@@ -187,7 +173,6 @@ const getFingerprintText = (sequent: Sequent) => {
|
|
|
187
173
|
: "",
|
|
188
174
|
)
|
|
189
175
|
.join("");
|
|
190
|
-
// A binder's body comes first, then what pops off the stack after it.
|
|
191
176
|
const printBound = (count: number, body: Expr) => {
|
|
192
177
|
pushVariables(count);
|
|
193
178
|
const text = print(body);
|
|
@@ -220,7 +205,6 @@ const getFingerprintText = (sequent: Sequent) => {
|
|
|
220
205
|
case "Pragma":
|
|
221
206
|
return "";
|
|
222
207
|
}
|
|
223
|
-
throw new TlapmBugError();
|
|
224
208
|
}
|
|
225
209
|
case "Opaque":
|
|
226
210
|
return expression.name;
|
|
@@ -333,8 +317,6 @@ const getFingerprintText = (sequent: Sequent) => {
|
|
|
333
317
|
}
|
|
334
318
|
};
|
|
335
319
|
|
|
336
|
-
// Each hypothesis prints after the goal and the hypotheses after it, once their uses have
|
|
337
|
-
// numbered it.
|
|
338
320
|
const printSequent = (inner: Sequent): string => {
|
|
339
321
|
const counters = { hyp: 1, variable: 1 };
|
|
340
322
|
const spin = (index: number, scope: Scope | undefined): string => {
|
|
@@ -348,7 +330,7 @@ const getFingerprintText = (sequent: Sequent) => {
|
|
|
348
330
|
switch (hyp.kind) {
|
|
349
331
|
case "Fresh": {
|
|
350
332
|
if (!hyp.domain) {
|
|
351
|
-
const label =
|
|
333
|
+
const label = LEVEL_PREFIXES[hyp.level];
|
|
352
334
|
const after = getRest({ kind: "Hyp", label });
|
|
353
335
|
return after.entry.isUsed ? `${after.rest}${label}${hyp.name}` : after.rest;
|
|
354
336
|
}
|
|
@@ -384,5 +366,4 @@ const getFingerprintText = (sequent: Sequent) => {
|
|
|
384
366
|
return printSequent(sequent);
|
|
385
367
|
};
|
|
386
368
|
|
|
387
|
-
// fingerprint: the hex digest of an obligation's fp_sequent text.
|
|
388
369
|
export const getFingerprint = (sequent: Sequent) => getMd5(getFingerprintText(sequent));
|
|
@@ -1,7 +1,3 @@
|
|
|
1
|
-
// A port of tlapm's Expr.LevelComparison, the LevelComparison frontend: it proves an obligation
|
|
2
|
-
// whose goal is a visible fact, or the goal of a visible ASSUME/PROVE fact, with identifiers
|
|
3
|
-
// renamed to identifiers of no higher level, each renamed one declared by the fact.
|
|
4
|
-
|
|
5
1
|
import { TlapmBugError, TlaProverError } from "../../errors";
|
|
6
2
|
import {
|
|
7
3
|
adjoin,
|
|
@@ -30,6 +26,12 @@ interface Declaration {
|
|
|
30
26
|
level: number;
|
|
31
27
|
}
|
|
32
28
|
|
|
29
|
+
interface Binder {
|
|
30
|
+
name: string;
|
|
31
|
+
domain: Expr | undefined;
|
|
32
|
+
body: Expr;
|
|
33
|
+
}
|
|
34
|
+
|
|
33
35
|
const RANKS: Partial<Record<Declaration["kind"], number>> = {
|
|
34
36
|
Constant: 0,
|
|
35
37
|
State: 1,
|
|
@@ -46,7 +48,6 @@ const isPairwise = <Item>(
|
|
|
46
48
|
left.every((item, index) => index < right.length && isSameItem(item, right[index])) &&
|
|
47
49
|
left.length === right.length;
|
|
48
50
|
|
|
49
|
-
// Util.Coll.Sm built from a list, where the first entry of a name wins, in key order.
|
|
50
51
|
const getSortedFields = (fields: { name: string; value: Expr }[]) =>
|
|
51
52
|
[...new Map(fields.toReversed().map((field) => [field.name, field.value]))].toSorted(
|
|
52
53
|
(first, second) => (first[0] < second[0] ? -1 : 1),
|
|
@@ -81,8 +82,6 @@ const bindFlexible = (scope: Scope | undefined, names: string[]) =>
|
|
|
81
82
|
names.map((name) => ({ kind: "Flex", name })),
|
|
82
83
|
);
|
|
83
84
|
|
|
84
|
-
// level_comparison#compare: the expressions match up to a renaming that maps each name one way,
|
|
85
|
-
// and the fact's context declares each name it changes.
|
|
86
85
|
const compare = (
|
|
87
86
|
factScope: Scope | undefined,
|
|
88
87
|
goalScope: Scope | undefined,
|
|
@@ -227,8 +226,8 @@ const compare = (
|
|
|
227
226
|
const isSameBinder = (
|
|
228
227
|
leftScope: Scope | undefined,
|
|
229
228
|
rightScope: Scope | undefined,
|
|
230
|
-
left:
|
|
231
|
-
right:
|
|
229
|
+
left: Binder,
|
|
230
|
+
right: Binder,
|
|
232
231
|
) => {
|
|
233
232
|
if (!left.domain || !right.domain) {
|
|
234
233
|
return (
|
|
@@ -317,7 +316,6 @@ const compare = (
|
|
|
317
316
|
}
|
|
318
317
|
return selector.kind === other.kind;
|
|
319
318
|
});
|
|
320
|
-
// List.for_all2 raises when the lists differ in length after a matching prefix.
|
|
321
319
|
if (isPrefix && left.selectors.length !== rightSelectors.length) {
|
|
322
320
|
throw new TlapmBugError("Invalid_argument");
|
|
323
321
|
}
|
|
@@ -507,8 +505,6 @@ const compare = (
|
|
|
507
505
|
return isMatch && isDeclared.every(Boolean);
|
|
508
506
|
};
|
|
509
507
|
|
|
510
|
-
// check_level_change: the first visible fact that matches proves the goal, which becomes TRUE.
|
|
511
|
-
// When none does, tlapm records the obligation as not tried.
|
|
512
508
|
export const checkLevelChange = (sequent: Sequent): Sequent => {
|
|
513
509
|
const goalScope = adjoinAll(undefined, sequent.context);
|
|
514
510
|
const isProved = sequent.context.some((hyp, index) => {
|
package/src/prover/prep/md5.ts
CHANGED
|
@@ -1,5 +1,3 @@
|
|
|
1
|
-
// MD5 (RFC 1321), as OCaml's Digest computes it. tlapm names the operators it coalesces by
|
|
2
|
-
// the digest of their printed form, so matching its SMT-LIB output needs the same digest.
|
|
3
1
|
const SHIFTS = [7, 12, 17, 22, 5, 9, 14, 20, 4, 11, 16, 23, 6, 10, 15, 21];
|
|
4
2
|
|
|
5
3
|
const CONSTANTS = Array.from({ length: 64 }, (_value, index) =>
|
|
@@ -1,23 +1,36 @@
|
|
|
1
|
-
|
|
2
|
-
// prover with its time limit, or a frontend that rewrites the obligation first. A malformed method
|
|
3
|
-
// throws a TlaProverError, since Prep.ship catches compute_meth's failure and fails only that
|
|
4
|
-
// obligation.
|
|
5
|
-
|
|
6
|
-
import { TlapmBugError, TlaProverError } from "../../errors";
|
|
1
|
+
import { TlaMethodError, TlapmBugError, TlaProverError } from "../../errors";
|
|
7
2
|
import type { Expr, Locus, Sequent } from "../../obligations/expression";
|
|
8
3
|
import type { OldMethod, PragmaSetting } from "../../obligations/pragma";
|
|
4
|
+
import type { Backend } from "../verdict";
|
|
5
|
+
|
|
6
|
+
type Prover =
|
|
7
|
+
| Backend
|
|
8
|
+
| "yices"
|
|
9
|
+
| "cvc4"
|
|
10
|
+
| "cooper"
|
|
11
|
+
| "fail"
|
|
12
|
+
| "verit"
|
|
13
|
+
| "zipper"
|
|
14
|
+
| "spass"
|
|
15
|
+
| "tptp"
|
|
16
|
+
| "trivial"
|
|
17
|
+
| "expandenabled"
|
|
18
|
+
| "expandcdot"
|
|
19
|
+
| "autouse"
|
|
20
|
+
| "lambdify"
|
|
21
|
+
| "enabledaxioms"
|
|
22
|
+
| "levelcomparison";
|
|
9
23
|
|
|
10
|
-
// A method, named after the Method.t constructor tlapm reports it by. A Z3 resource budget turns
|
|
11
|
-
// the time limit off.
|
|
12
24
|
export interface Method {
|
|
13
|
-
prover:
|
|
25
|
+
prover: Prover;
|
|
14
26
|
timeLimitMs: number;
|
|
15
27
|
rlimit?: number;
|
|
16
28
|
tactic?: string;
|
|
17
29
|
}
|
|
18
30
|
|
|
19
|
-
|
|
20
|
-
|
|
31
|
+
export const getBudget = (method: Method) => method.rlimit ?? method.timeLimitMs / 1000;
|
|
32
|
+
|
|
33
|
+
export const FRONTENDS = new Set<Prover>([
|
|
21
34
|
"expandenabled",
|
|
22
35
|
"expandcdot",
|
|
23
36
|
"autouse",
|
|
@@ -26,40 +39,35 @@ const FRONTENDS = new Set([
|
|
|
26
39
|
"levelcomparison",
|
|
27
40
|
]);
|
|
28
41
|
|
|
29
|
-
// Method.default_*_timeout, in seconds.
|
|
30
42
|
const SMT_SECONDS = 5;
|
|
31
43
|
const ZENON_SECONDS = 10;
|
|
32
44
|
const ISABELLE_SECONDS = 30;
|
|
33
45
|
const LS4_SECONDS = 10;
|
|
34
46
|
|
|
35
|
-
// Method.rlimit_base and Method.max_rlimit.
|
|
36
47
|
const RLIMIT_BASE = 3_000_000;
|
|
37
48
|
const MAX_RLIMIT = 0xffff_ffff;
|
|
38
49
|
|
|
39
|
-
// Params.default_method: what tlapm tries when a step cites no prover.
|
|
40
50
|
const DEFAULT_METHODS: Method[] = [
|
|
41
51
|
{ prover: "smt", timeLimitMs: SMT_SECONDS * 1000 },
|
|
42
52
|
{ prover: "zenon", timeLimitMs: ZENON_SECONDS * 1000 },
|
|
43
53
|
{ prover: "isabelle", timeLimitMs: ISABELLE_SECONDS * 1000, tactic: "auto" },
|
|
44
54
|
];
|
|
45
55
|
|
|
46
|
-
|
|
47
|
-
// selects. The SMT solvers take a resource budget.
|
|
48
|
-
const PROVERS: Record<string, { prover: string; seconds: number; isBudgeted?: boolean }> = {
|
|
56
|
+
const PROVERS: Record<string, { prover: Prover; seconds: number; isBudgeted?: boolean }> = {
|
|
49
57
|
zenon: { prover: "zenon", seconds: ZENON_SECONDS },
|
|
50
58
|
isabelle: { prover: "isabelle", seconds: ISABELLE_SECONDS },
|
|
51
59
|
yices: { prover: "yices", seconds: 30 },
|
|
52
60
|
ls4: { prover: "ls4", seconds: LS4_SECONDS },
|
|
53
61
|
z3: { prover: "z3", seconds: SMT_SECONDS, isBudgeted: true },
|
|
54
62
|
smt: { prover: "smt", seconds: SMT_SECONDS, isBudgeted: true },
|
|
55
|
-
cvc3: { prover: "
|
|
56
|
-
cooper: { prover: "cooper", seconds:
|
|
57
|
-
fail: { prover: "fail", seconds:
|
|
63
|
+
cvc3: { prover: "cvc4", seconds: SMT_SECONDS },
|
|
64
|
+
cooper: { prover: "cooper", seconds: Infinity },
|
|
65
|
+
fail: { prover: "fail", seconds: Infinity },
|
|
58
66
|
smt2lib: { prover: "smt", seconds: SMT_SECONDS, isBudgeted: true },
|
|
59
67
|
smt2z3: { prover: "z3", seconds: SMT_SECONDS, isBudgeted: true },
|
|
60
68
|
smt3: { prover: "smt", seconds: SMT_SECONDS, isBudgeted: true },
|
|
61
69
|
z33: { prover: "z3", seconds: SMT_SECONDS, isBudgeted: true },
|
|
62
|
-
cvc33: { prover: "
|
|
70
|
+
cvc33: { prover: "cvc4", seconds: SMT_SECONDS },
|
|
63
71
|
yices3: { prover: "yices", seconds: SMT_SECONDS },
|
|
64
72
|
verit: { prover: "verit", seconds: SMT_SECONDS },
|
|
65
73
|
zipper: { prover: "zipper", seconds: 30 },
|
|
@@ -77,10 +85,6 @@ const getProverMethod = (
|
|
|
77
85
|
): Method => {
|
|
78
86
|
const known = PROVERS[name];
|
|
79
87
|
if (!known) throw new TlaProverError(`Unknown prover: ${name}`);
|
|
80
|
-
if (rlimit !== undefined && !known.isBudgeted)
|
|
81
|
-
throw new TlaProverError(
|
|
82
|
-
'A Z3 rlimit budget ("rN") is only supported by the SMT and Z3 backends.',
|
|
83
|
-
);
|
|
84
88
|
return {
|
|
85
89
|
prover: known.prover,
|
|
86
90
|
timeLimitMs: rlimit === undefined ? (timeout ?? known.seconds) * 1000 : Infinity,
|
|
@@ -89,64 +93,92 @@ const getProverMethod = (
|
|
|
89
93
|
};
|
|
90
94
|
};
|
|
91
95
|
|
|
92
|
-
|
|
93
|
-
|
|
94
|
-
|
|
96
|
+
const BUDGET_FORMS =
|
|
97
|
+
'a number of seconds (wall-clock timeout), or a deterministic Z3 rlimit budget of the form "rN" (e.g. "r5")';
|
|
98
|
+
|
|
99
|
+
const getRlimit = (budget: string, locus: Locus | undefined) => {
|
|
100
|
+
const count = Number(budget.slice(1));
|
|
95
101
|
if (!/^[rR]./.test(budget) || !Number.isFinite(count) || count <= 0)
|
|
96
|
-
throw new
|
|
102
|
+
throw new TlaMethodError(
|
|
103
|
+
`Invalid SMT budget ${JSON.stringify(budget)}: expected ${BUDGET_FORMS}.`,
|
|
104
|
+
locus,
|
|
105
|
+
);
|
|
97
106
|
return Math.max(1, Math.trunc(Math.min(count * RLIMIT_BASE, MAX_RLIMIT)));
|
|
98
107
|
};
|
|
99
108
|
|
|
100
|
-
|
|
101
|
-
|
|
102
|
-
|
|
103
|
-
|
|
104
|
-
|
|
105
|
-
|
|
106
|
-
|
|
107
|
-
|
|
108
|
-
|
|
109
|
-
|
|
109
|
+
interface MethodValues {
|
|
110
|
+
args: Expr[];
|
|
111
|
+
prover?: string;
|
|
112
|
+
proverLocus?: Locus;
|
|
113
|
+
timeout?: number;
|
|
114
|
+
rlimit?: number;
|
|
115
|
+
tactic?: string;
|
|
116
|
+
}
|
|
117
|
+
|
|
118
|
+
// Each @ takes the next argument the pragma is applied to at the use.
|
|
119
|
+
const computeMethod = (settings: PragmaSetting[], args: Expr[], use: Locus | undefined): Method => {
|
|
120
|
+
const values = settings.reduce<MethodValues>(
|
|
110
121
|
(state, setting) => {
|
|
111
122
|
const value = setting.value;
|
|
112
123
|
const argument = value.kind === "Default" ? state.args[0] : undefined;
|
|
113
124
|
const rest = value.kind === "Default" ? state.args.slice(1) : state.args;
|
|
125
|
+
if (setting.hint !== "prover" && setting.hint !== "tactic" && setting.hint !== "timeout")
|
|
126
|
+
throw new TlaMethodError(
|
|
127
|
+
`Unknown keyword in proof method definition: ${setting.hint}`,
|
|
128
|
+
setting.location,
|
|
129
|
+
);
|
|
114
130
|
if (value.kind === "Default" && !argument)
|
|
115
|
-
throw new
|
|
116
|
-
|
|
117
|
-
value.kind === "
|
|
118
|
-
|
|
119
|
-
:
|
|
120
|
-
|
|
121
|
-
: undefined;
|
|
122
|
-
switch (setting.hint) {
|
|
123
|
-
case "prover":
|
|
124
|
-
case "tactic":
|
|
125
|
-
if (text === undefined) throw new TlaProverError(`This argument should be a string`);
|
|
126
|
-
return { ...state, args: rest, [setting.hint]: text };
|
|
127
|
-
case "timeout": {
|
|
128
|
-
if (value.kind === "Float") return { ...state, args: rest, timeout: value.value };
|
|
129
|
-
if (text !== undefined) return { ...state, args: rest, rlimit: getRlimit(text) };
|
|
130
|
-
if (argument?.kind !== "Num")
|
|
131
|
-
throw new TlaProverError("This argument should be a number of seconds");
|
|
131
|
+
throw new TlaMethodError("Some arguments are missing", use);
|
|
132
|
+
if (setting.hint === "timeout") {
|
|
133
|
+
if (value.kind === "Float") return { ...state, timeout: value.value };
|
|
134
|
+
if (value.kind === "String")
|
|
135
|
+
return { ...state, rlimit: getRlimit(value.value, setting.location) };
|
|
136
|
+
if (argument?.kind === "Num")
|
|
132
137
|
return {
|
|
133
138
|
...state,
|
|
134
139
|
args: rest,
|
|
135
140
|
timeout: Number(`${argument.integer}.${argument.fraction}`),
|
|
136
141
|
};
|
|
137
|
-
|
|
138
|
-
|
|
139
|
-
|
|
142
|
+
if (argument?.kind === "String")
|
|
143
|
+
return { ...state, args: rest, rlimit: getRlimit(argument.value, argument.location) };
|
|
144
|
+
throw new TlaMethodError(`This argument should be ${BUDGET_FORMS}`, argument?.location);
|
|
140
145
|
}
|
|
146
|
+
if (value.kind === "Float")
|
|
147
|
+
throw new TlaMethodError("Argument should be a string or @", setting.location);
|
|
148
|
+
const text =
|
|
149
|
+
value.kind === "String"
|
|
150
|
+
? value.value
|
|
151
|
+
: argument?.kind === "String"
|
|
152
|
+
? argument.value
|
|
153
|
+
: undefined;
|
|
154
|
+
if (text === undefined)
|
|
155
|
+
throw new TlaMethodError(
|
|
156
|
+
`This argument should be a string (${setting.hint === "prover" ? "prover name" : "proof tactic"})`,
|
|
157
|
+
argument?.location,
|
|
158
|
+
);
|
|
159
|
+
if (setting.hint === "tactic") return { ...state, args: rest, tactic: text };
|
|
160
|
+
return {
|
|
161
|
+
...state,
|
|
162
|
+
args: rest,
|
|
163
|
+
prover: text,
|
|
164
|
+
proverLocus: value.kind === "Default" ? use : setting.location,
|
|
165
|
+
};
|
|
141
166
|
},
|
|
142
167
|
{ args },
|
|
143
168
|
);
|
|
144
|
-
if (values.args.length > 0) throw new
|
|
145
|
-
if (values.prover === undefined)
|
|
169
|
+
if (values.args.length > 0) throw new TlaMethodError("Too many arguments", use);
|
|
170
|
+
if (values.prover === undefined)
|
|
171
|
+
throw new TlaMethodError("Missing prover name", settings[0].location);
|
|
172
|
+
const known = PROVERS[values.prover];
|
|
173
|
+
if (!known) throw new TlaMethodError(`Unknown prover: ${values.prover}`, values.proverLocus);
|
|
174
|
+
if (values.rlimit !== undefined && !known.isBudgeted)
|
|
175
|
+
throw new TlaMethodError(
|
|
176
|
+
'A Z3 rlimit budget ("rN") is only supported by the SMT and Z3 backends.',
|
|
177
|
+
use,
|
|
178
|
+
);
|
|
146
179
|
return getProverMethod(values.prover, values.timeout, values.rlimit, values.tactic);
|
|
147
180
|
};
|
|
148
181
|
|
|
149
|
-
// An old-style method, as Method_prs reads it, with its default time unless it names one.
|
|
150
182
|
const getOldMethod = (method: OldMethod) =>
|
|
151
183
|
getProverMethod(method.name, method.timeout, undefined, method.tactic);
|
|
152
184
|
|
|
@@ -155,21 +187,14 @@ type Cited =
|
|
|
155
187
|
| { kind: "Meth"; method: OldMethod }
|
|
156
188
|
| undefined;
|
|
157
189
|
|
|
158
|
-
// find_meth: an obligation whose proof names a method keeps it. Otherwise each visible fact that
|
|
159
|
-
// cites a pragma, alone or applied to arguments, adds the methods its groups compute, and each that
|
|
160
|
-
// cites a theorem or carries an old-style method adds that method. A pragma that a fact from
|
|
161
|
-
// another BY or USE cites drops the methods found so far: tlapm compares the USE locations
|
|
162
|
-
// physically, as tla-ts compares the objects.
|
|
163
190
|
const getCitedMethods = (sequent: Sequent) => {
|
|
164
191
|
const cited: Cited[] = [];
|
|
165
|
-
|
|
166
|
-
|
|
167
|
-
useLocation: null,
|
|
168
|
-
};
|
|
192
|
+
let methods: Method[] = [];
|
|
193
|
+
let useLocation: Locus | undefined | null = null;
|
|
169
194
|
sequent.context.forEach((hyp, index) => {
|
|
170
195
|
const expression = hyp.kind === "Fact" && hyp.visibility === "Visible" && hyp.expression;
|
|
171
196
|
if (expression && expression.kind === "With") {
|
|
172
|
-
|
|
197
|
+
methods.push(getOldMethod(expression.method));
|
|
173
198
|
cited.push(undefined);
|
|
174
199
|
return;
|
|
175
200
|
}
|
|
@@ -188,25 +213,25 @@ const getCitedMethods = (sequent: Sequent) => {
|
|
|
188
213
|
if (operator.kind !== "Ix") return;
|
|
189
214
|
const entry = cited[index - operator.index];
|
|
190
215
|
if (entry?.kind === "Premeth") {
|
|
191
|
-
if (hyp.useLocation !==
|
|
192
|
-
|
|
193
|
-
|
|
216
|
+
if (hyp.useLocation !== useLocation) {
|
|
217
|
+
methods = [];
|
|
218
|
+
useLocation = hyp.useLocation;
|
|
194
219
|
}
|
|
195
220
|
const args = expression.kind === "Apply" ? expression.args : [];
|
|
196
|
-
|
|
221
|
+
methods.push(...entry.groups.map((group) => computeMethod(group, args, expression.location)));
|
|
197
222
|
return;
|
|
198
223
|
}
|
|
199
224
|
if (entry?.kind !== "Meth") return;
|
|
200
|
-
// find_meth asserts that a theorem with a method is not applied to arguments.
|
|
201
225
|
if (expression.kind === "Apply") throw new TlapmBugError();
|
|
202
|
-
|
|
226
|
+
methods.push(getOldMethod(entry.method));
|
|
203
227
|
});
|
|
204
|
-
return
|
|
228
|
+
return methods;
|
|
205
229
|
};
|
|
206
230
|
|
|
207
|
-
|
|
208
|
-
|
|
209
|
-
|
|
231
|
+
export const findMethods = (
|
|
232
|
+
obligation: { sequent: Sequent; method?: OldMethod },
|
|
233
|
+
defaultMethods = DEFAULT_METHODS,
|
|
234
|
+
) => {
|
|
210
235
|
const methods =
|
|
211
236
|
obligation.method === undefined
|
|
212
237
|
? getCitedMethods(obligation.sequent)
|
|
@@ -216,6 +241,35 @@ export const findMethods = (obligation: { sequent: Sequent; method?: OldMethod }
|
|
|
216
241
|
frontends: new Set(
|
|
217
242
|
methods.flatMap((method) => (FRONTENDS.has(method.prover) ? [method.prover] : [])),
|
|
218
243
|
),
|
|
219
|
-
provers: provers.length > 0 ? provers :
|
|
244
|
+
provers: provers.length > 0 ? provers : defaultMethods,
|
|
220
245
|
};
|
|
221
246
|
};
|
|
247
|
+
|
|
248
|
+
const DEFAULT_METHOD_NAMES: Record<string, string> = {
|
|
249
|
+
zenon: "zenon",
|
|
250
|
+
smt: "smt",
|
|
251
|
+
z3: "z3",
|
|
252
|
+
cvc4: "cvc33",
|
|
253
|
+
yices: "yices3",
|
|
254
|
+
verit: "verit",
|
|
255
|
+
zipper: "zipper",
|
|
256
|
+
spass: "spass",
|
|
257
|
+
tptp: "tptp",
|
|
258
|
+
ls4: "ls4",
|
|
259
|
+
};
|
|
260
|
+
|
|
261
|
+
export const parseDefaultMethods = (text: string) =>
|
|
262
|
+
text.split(",").map((entry): Method => {
|
|
263
|
+
const separator = entry.indexOf(":");
|
|
264
|
+
const name = separator === -1 ? entry : entry.slice(0, separator);
|
|
265
|
+
const seconds = separator === -1 ? undefined : Number.parseFloat(entry.slice(separator + 1));
|
|
266
|
+
if (Number.isNaN(seconds))
|
|
267
|
+
throw new TlaProverError("--method: bad timeout specification: not a number");
|
|
268
|
+
if (name === "auto" || name === "blast" || name === "force")
|
|
269
|
+
return getProverMethod("isabelle", seconds, undefined, name);
|
|
270
|
+
if (name === "fail") return { prover: "fail", timeLimitMs: Infinity };
|
|
271
|
+
const known = DEFAULT_METHOD_NAMES[name];
|
|
272
|
+
if (known === undefined)
|
|
273
|
+
throw new TlaProverError(`--method: unknown method ${JSON.stringify(name)}`);
|
|
274
|
+
return getProverMethod(known, seconds, undefined, undefined);
|
|
275
|
+
});
|