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/prover/verdict.ts
CHANGED
|
@@ -1,7 +1,16 @@
|
|
|
1
1
|
export type Verdict = "unsat" | "sat" | "unknown";
|
|
2
2
|
|
|
3
|
+
export const BACKENDS = ["zenon", "isabelle", "smt", "z3", "ls4"] as const;
|
|
4
|
+
|
|
5
|
+
export type Backend = (typeof BACKENDS)[number];
|
|
6
|
+
|
|
7
|
+
export const isBackend = (prover: string): prover is Backend =>
|
|
8
|
+
BACKENDS.some((backend) => backend === prover);
|
|
9
|
+
|
|
3
10
|
export interface Decision {
|
|
4
11
|
verdict: Verdict;
|
|
12
|
+
output?: string;
|
|
13
|
+
errorOutput?: string;
|
|
5
14
|
timeUsedMs: number;
|
|
6
15
|
}
|
|
7
16
|
|
|
@@ -87,8 +87,7 @@ export const checkProof = (root: Proof<Term>, context: CheckContext, limits: Lim
|
|
|
87
87
|
if (!needed.has(subproof)) stack.push([subproof, false]);
|
|
88
88
|
}
|
|
89
89
|
const hypotheses = new Set(context.hypotheses.map(keys.getTopKey));
|
|
90
|
-
|
|
91
|
-
return missing.length === 0;
|
|
90
|
+
return [...(needed.get(root) ?? [])].every((key) => hypotheses.has(key));
|
|
92
91
|
} catch (error) {
|
|
93
92
|
if (error instanceof UncheckedError) return false;
|
|
94
93
|
throw error;
|
|
@@ -25,7 +25,7 @@ export const getFields = (record: Term, constructor: "TLA.record" | "TLA.records
|
|
|
25
25
|
return fields;
|
|
26
26
|
};
|
|
27
27
|
|
|
28
|
-
const getLabels = (fields: [Term, Term][]) =>
|
|
28
|
+
export const getLabels = (fields: [Term, Term][]) =>
|
|
29
29
|
app(
|
|
30
30
|
"TLA.set",
|
|
31
31
|
fields.map((field) => field[0]),
|
|
@@ -1,15 +1,13 @@
|
|
|
1
1
|
import type { PlainRuleName } from "../proof";
|
|
2
|
-
import { getFields } from "./records";
|
|
2
|
+
import { getFields, getLabels } from "./records";
|
|
3
3
|
import {
|
|
4
4
|
and,
|
|
5
|
-
app,
|
|
6
5
|
domain,
|
|
7
6
|
ensure,
|
|
8
7
|
equal,
|
|
9
8
|
expectApp,
|
|
10
9
|
FALSE,
|
|
11
10
|
fapply,
|
|
12
|
-
getPairs,
|
|
13
11
|
getStringText,
|
|
14
12
|
instantiate,
|
|
15
13
|
isApp,
|
|
@@ -157,18 +155,7 @@ export const REWRITE_RULES = {
|
|
|
157
155
|
record_domain: (args, checker) =>
|
|
158
156
|
getRewriteSpec(checker, args[0], args[2], (filled) => {
|
|
159
157
|
const record = expectApp(filled, "TLA.DOMAIN", 1)[0];
|
|
160
|
-
|
|
161
|
-
return [
|
|
162
|
-
[
|
|
163
|
-
instantiate(
|
|
164
|
-
args[2],
|
|
165
|
-
app(
|
|
166
|
-
"TLA.set",
|
|
167
|
-
fields.map((field) => field[0]),
|
|
168
|
-
),
|
|
169
|
-
),
|
|
170
|
-
],
|
|
171
|
-
];
|
|
158
|
+
return [[instantiate(args[2], getLabels(getFields(record, "TLA.record")))]];
|
|
172
159
|
}),
|
|
173
160
|
boolcase_not: (args, checker) =>
|
|
174
161
|
getBoolCaseSpec(checker, args, (operand) => operand.kind === "not"),
|
|
@@ -40,6 +40,40 @@ const getSetEqualSpec = (formula: Term, isNegated: boolean, checker: Checker): R
|
|
|
40
40
|
return { premises: [formula], branches: [[isNegated ? not(extensional) : extensional]] };
|
|
41
41
|
};
|
|
42
42
|
|
|
43
|
+
const getUnionSpec = (formula: Term, isNegated: boolean, checker: Checker): RuleSpec => {
|
|
44
|
+
const spec = getMembershipSpec(formula, isNegated, "TLA.UNION", 1);
|
|
45
|
+
const exists = checker.bind("ex", "", (bound) =>
|
|
46
|
+
and(member(bound, spec.operands[0]), member(spec.element, bound)),
|
|
47
|
+
);
|
|
48
|
+
return { premises: [formula], branches: [[isNegated ? not(exists) : exists]] };
|
|
49
|
+
};
|
|
50
|
+
|
|
51
|
+
const getSetOfAllSpec = (formula: Term, isNegated: boolean, checker: Checker): RuleSpec => {
|
|
52
|
+
const spec = getMembershipSpec(formula, isNegated, "TLA.setOfAll", 2);
|
|
53
|
+
const mapping = spec.operands[1];
|
|
54
|
+
ensure(mapping.kind === "lam");
|
|
55
|
+
const exists = checker.bind("ex", "", (bound) =>
|
|
56
|
+
and(member(bound, spec.operands[0]), equal(spec.element, instantiate(mapping, bound))),
|
|
57
|
+
);
|
|
58
|
+
return { premises: [formula], branches: [[isNegated ? not(exists) : exists]] };
|
|
59
|
+
};
|
|
60
|
+
|
|
61
|
+
const getFuncSetSpec = (formula: Term, isNegated: boolean, checker: Checker): RuleSpec => {
|
|
62
|
+
const spec = getMembershipSpec(formula, isNegated, "TLA.FuncSet", 2);
|
|
63
|
+
const fcn = spec.element;
|
|
64
|
+
const conjuncts = [
|
|
65
|
+
app("TLA.isAFcn", [fcn]),
|
|
66
|
+
equal(domain(fcn), spec.operands[0]),
|
|
67
|
+
checker.bind("all", "", (bound) =>
|
|
68
|
+
imply(member(bound, spec.operands[0]), member(fapply(fcn, bound), spec.operands[1])),
|
|
69
|
+
),
|
|
70
|
+
];
|
|
71
|
+
return {
|
|
72
|
+
premises: [formula],
|
|
73
|
+
branches: isNegated ? conjuncts.map((inner) => [not(inner)]) : [conjuncts],
|
|
74
|
+
};
|
|
75
|
+
};
|
|
76
|
+
|
|
43
77
|
export const SET_RULES = {
|
|
44
78
|
in_emptyset: (args) => {
|
|
45
79
|
ensure(isVariable(expectApp(args[0], "TLA.in", 2)[1], "TLA.emptyset"));
|
|
@@ -112,20 +146,8 @@ export const SET_RULES = {
|
|
|
112
146
|
branches: [[not(app("TLA.subseteq", [spec.element, spec.operands[0]]))]],
|
|
113
147
|
};
|
|
114
148
|
},
|
|
115
|
-
in_UNION: (args, checker) =>
|
|
116
|
-
|
|
117
|
-
const exists = checker.bind("ex", "", (bound) =>
|
|
118
|
-
and(member(bound, spec.operands[0]), member(spec.element, bound)),
|
|
119
|
-
);
|
|
120
|
-
return { premises: [args[0]], branches: [[exists]] };
|
|
121
|
-
},
|
|
122
|
-
notin_UNION: (args, checker) => {
|
|
123
|
-
const spec = getMembershipSpec(args[0], true, "TLA.UNION", 1);
|
|
124
|
-
const exists = checker.bind("ex", "", (bound) =>
|
|
125
|
-
and(member(bound, spec.operands[0]), member(spec.element, bound)),
|
|
126
|
-
);
|
|
127
|
-
return { premises: [args[0]], branches: [[not(exists)]] };
|
|
128
|
-
},
|
|
149
|
+
in_UNION: (args, checker) => getUnionSpec(args[0], false, checker),
|
|
150
|
+
notin_UNION: (args, checker) => getUnionSpec(args[0], true, checker),
|
|
129
151
|
in_cup: (args) => {
|
|
130
152
|
const spec = getMembershipSpec(args[0], false, "TLA.cup", 2);
|
|
131
153
|
return {
|
|
@@ -194,50 +216,10 @@ export const SET_RULES = {
|
|
|
194
216
|
],
|
|
195
217
|
};
|
|
196
218
|
},
|
|
197
|
-
in_setofall: (args, checker) =>
|
|
198
|
-
|
|
199
|
-
|
|
200
|
-
|
|
201
|
-
const exists = checker.bind("ex", "", (bound) =>
|
|
202
|
-
and(member(bound, spec.operands[0]), equal(spec.element, instantiate(mapping, bound))),
|
|
203
|
-
);
|
|
204
|
-
return { premises: [args[0]], branches: [[exists]] };
|
|
205
|
-
},
|
|
206
|
-
notin_setofall: (args, checker) => {
|
|
207
|
-
const spec = getMembershipSpec(args[0], true, "TLA.setOfAll", 2);
|
|
208
|
-
const mapping = spec.operands[1];
|
|
209
|
-
ensure(mapping.kind === "lam");
|
|
210
|
-
const exists = checker.bind("ex", "", (bound) =>
|
|
211
|
-
and(member(bound, spec.operands[0]), equal(spec.element, instantiate(mapping, bound))),
|
|
212
|
-
);
|
|
213
|
-
return { premises: [args[0]], branches: [[not(exists)]] };
|
|
214
|
-
},
|
|
215
|
-
in_funcset: (args, checker) => {
|
|
216
|
-
const spec = getMembershipSpec(args[0], false, "TLA.FuncSet", 2);
|
|
217
|
-
const fcn = spec.element;
|
|
218
|
-
const maps = checker.bind("all", "", (bound) =>
|
|
219
|
-
imply(member(bound, spec.operands[0]), member(fapply(fcn, bound), spec.operands[1])),
|
|
220
|
-
);
|
|
221
|
-
return {
|
|
222
|
-
premises: [args[0]],
|
|
223
|
-
branches: [[app("TLA.isAFcn", [fcn]), equal(domain(fcn), spec.operands[0]), maps]],
|
|
224
|
-
};
|
|
225
|
-
},
|
|
226
|
-
notin_funcset: (args, checker) => {
|
|
227
|
-
const spec = getMembershipSpec(args[0], true, "TLA.FuncSet", 2);
|
|
228
|
-
const fcn = spec.element;
|
|
229
|
-
const maps = checker.bind("all", "", (bound) =>
|
|
230
|
-
imply(member(bound, spec.operands[0]), member(fapply(fcn, bound), spec.operands[1])),
|
|
231
|
-
);
|
|
232
|
-
return {
|
|
233
|
-
premises: [args[0]],
|
|
234
|
-
branches: [
|
|
235
|
-
[not(app("TLA.isAFcn", [fcn]))],
|
|
236
|
-
[not(equal(domain(fcn), spec.operands[0]))],
|
|
237
|
-
[not(maps)],
|
|
238
|
-
],
|
|
239
|
-
};
|
|
240
|
-
},
|
|
219
|
+
in_setofall: (args, checker) => getSetOfAllSpec(args[0], false, checker),
|
|
220
|
+
notin_setofall: (args, checker) => getSetOfAllSpec(args[0], true, checker),
|
|
221
|
+
in_funcset: (args, checker) => getFuncSetSpec(args[0], false, checker),
|
|
222
|
+
notin_funcset: (args, checker) => getFuncSetSpec(args[0], true, checker),
|
|
241
223
|
except_notin_funcset: (args) => {
|
|
242
224
|
const spec = getMembershipSpec(args[0], true, "TLA.FuncSet", 2);
|
|
243
225
|
const except = expectApp(spec.element, "TLA.except", 3);
|
|
@@ -1,3 +1,4 @@
|
|
|
1
|
+
import type { RelationProperty } from "../eqrel";
|
|
1
2
|
import type { ExprKind } from "../expr";
|
|
2
3
|
import type { Definition } from "../parse";
|
|
3
4
|
import type { PlainRuleName, RuleArgs } from "../proof";
|
|
@@ -20,8 +21,6 @@ export interface RuleSpec {
|
|
|
20
21
|
branches: Term[][];
|
|
21
22
|
}
|
|
22
23
|
|
|
23
|
-
export type RelationProperty = "reflexive" | "symmetric" | "transitive";
|
|
24
|
-
|
|
25
24
|
export type Binding = number | { formula: Term; env: Env; operators?: Operators };
|
|
26
25
|
|
|
27
26
|
export type Env = Map<string, Binding>;
|
|
@@ -1,7 +1,5 @@
|
|
|
1
|
-
// Ported from Zenon's main.ml, as shipped in tlapm. Copyright 1997 INRIA, see LICENSE.
|
|
2
|
-
|
|
3
1
|
import { TlaZenonError } from "../../errors";
|
|
4
|
-
import type { DecideOptions } from "../verdict";
|
|
2
|
+
import type { DecideOptions, Decision } from "../verdict";
|
|
5
3
|
import { checkProof } from "./check/check";
|
|
6
4
|
import { createRelations } from "./eqrel";
|
|
7
5
|
import { createExpressions } from "./expr";
|
|
@@ -87,9 +85,14 @@ export const runZenon = (text: string, options: DecideOptions): ZenonRun => {
|
|
|
87
85
|
};
|
|
88
86
|
};
|
|
89
87
|
|
|
90
|
-
|
|
88
|
+
const FAILURE_ERRORS = new Map<ZenonRun["failure"], string>([
|
|
89
|
+
["exhausted", "Zenon error: exhausted search space without finding a proof\n"],
|
|
90
|
+
["memory limit", "Zenon error: could not find a proof within the memory size limit\n"],
|
|
91
|
+
]);
|
|
91
92
|
|
|
92
|
-
export const decideZenon = (text: string, options: DecideOptions):
|
|
93
|
-
const
|
|
94
|
-
return isar === undefined
|
|
93
|
+
export const decideZenon = (text: string, options: DecideOptions): Omit<Decision, "timeUsedMs"> => {
|
|
94
|
+
const run = runZenon(text, options);
|
|
95
|
+
return run.isar === undefined
|
|
96
|
+
? { verdict: "unknown", errorOutput: FAILURE_ERRORS.get(run.failure) }
|
|
97
|
+
: { verdict: "unsat", output: run.isar };
|
|
95
98
|
};
|
|
@@ -1,5 +1,3 @@
|
|
|
1
|
-
// A port of tlapm's Backend.Zenon.
|
|
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, Hyp, Sequent } from "../../obligations/expression";
|
|
@@ -1,9 +1,9 @@
|
|
|
1
|
-
// Ported from Zenon's eqrel.ml, as shipped in tlapm. Copyright 2004 INRIA, see LICENSE.
|
|
2
|
-
|
|
3
1
|
import { TRUE, type Expr, type Expressions } from "./expr";
|
|
4
2
|
|
|
5
3
|
export type Direction = "left" | "right";
|
|
6
4
|
|
|
5
|
+
export type RelationProperty = "reflexive" | "symmetric" | "transitive";
|
|
6
|
+
|
|
7
7
|
export interface Origin {
|
|
8
8
|
formula: Expr;
|
|
9
9
|
directions: Direction[];
|
package/src/prover/zenon/expr.ts
CHANGED
|
@@ -1,5 +1,3 @@
|
|
|
1
|
-
// Ported from Zenon's expr.ml, as shipped in tlapm. Copyright 2002 INRIA, see LICENSE.
|
|
2
|
-
|
|
3
1
|
import { TlaZenonError } from "../../errors";
|
|
4
2
|
import { combine, createHasher, toInt63, type Int63 } from "./ocaml";
|
|
5
3
|
|
|
@@ -217,6 +215,11 @@ export const isApp = <Symbol extends string>(
|
|
|
217
215
|
expression.symbol === symbol &&
|
|
218
216
|
(arity === undefined || expression.args.length === arity);
|
|
219
217
|
|
|
218
|
+
export const getStringName = (expression: Expr) =>
|
|
219
|
+
isApp(expression, "$string", 1) && expression.args[0].kind === "var"
|
|
220
|
+
? expression.args[0].symbol
|
|
221
|
+
: undefined;
|
|
222
|
+
|
|
220
223
|
export const isMeta = (expression: Expr): expression is MetaExpr => expression.kind === "meta";
|
|
221
224
|
|
|
222
225
|
export const isRelation = (expression: Expr): expression is RelationExpr =>
|
|
@@ -504,6 +507,8 @@ export const createExpressions = () => {
|
|
|
504
507
|
emeta,
|
|
505
508
|
eapp,
|
|
506
509
|
enot,
|
|
510
|
+
binary,
|
|
511
|
+
binder,
|
|
507
512
|
eand: (left: Expr, right: Expr) => binary("and", left, right),
|
|
508
513
|
eor: (left: Expr, right: Expr) => binary("or", left, right),
|
|
509
514
|
eimply: (left: Expr, right: Expr) => binary("imply", left, right),
|
|
@@ -1,6 +1,6 @@
|
|
|
1
|
-
// Ported from Zenon's index.ml, as shipped in tlapm. Copyright 2004 INRIA, see LICENSE.
|
|
2
|
-
|
|
3
1
|
import {
|
|
2
|
+
getStringName,
|
|
3
|
+
isApp,
|
|
4
4
|
isNegatedRelation,
|
|
5
5
|
isRelation,
|
|
6
6
|
type Expr,
|
|
@@ -128,35 +128,23 @@ export const createIndex = (exprs: Expressions) => {
|
|
|
128
128
|
if (head !== undefined) action(positive, getHeadKey(head), formula);
|
|
129
129
|
};
|
|
130
130
|
|
|
131
|
-
const getStringLiteral = (expression: Expr) =>
|
|
132
|
-
expression.kind === "app" &&
|
|
133
|
-
expression.symbol === "$string" &&
|
|
134
|
-
expression.args.length === 1 &&
|
|
135
|
-
expression.args[0].kind === "var"
|
|
136
|
-
? expression.args[0].symbol
|
|
137
|
-
: undefined;
|
|
138
|
-
|
|
139
131
|
const getStringEquality = (formula: Expr) => {
|
|
140
|
-
if (formula
|
|
141
|
-
|
|
142
|
-
const rightString = getStringLiteral(formula.args[1]);
|
|
132
|
+
if (!isApp(formula, "=", 2)) return undefined;
|
|
133
|
+
const rightString = getStringName(formula.args[1]);
|
|
143
134
|
if (rightString !== undefined)
|
|
144
135
|
return { isReversed: false, term: formula.args[0], value: rightString };
|
|
145
|
-
const leftString =
|
|
136
|
+
const leftString = getStringName(formula.args[0]);
|
|
146
137
|
return leftString === undefined
|
|
147
138
|
? undefined
|
|
148
139
|
: { isReversed: true, term: formula.args[1], value: leftString };
|
|
149
140
|
};
|
|
150
141
|
|
|
151
|
-
const isEquality = (formula: Expr) =>
|
|
152
|
-
formula.kind === "app" && formula.symbol === "=" && formula.args.length === 2;
|
|
153
|
-
|
|
154
142
|
const add = (formula: Expr, goalness: number) => {
|
|
155
143
|
pushValue(formulas, formula, goalness);
|
|
156
|
-
if (
|
|
144
|
+
if (isApp(formula, "=", 2)) {
|
|
157
145
|
pushValue(equalLeftRight, formula.args[0], formula.args[1]);
|
|
158
146
|
pushValue(equalRightLeft, formula.args[1], formula.args[0]);
|
|
159
|
-
} else if (formula.kind === "not" &&
|
|
147
|
+
} else if (formula.kind === "not" && isApp(formula.args[0], "=", 2)) {
|
|
160
148
|
pushValue(unequalLeftRight, formula.args[0].args[0], formula.args[0].args[1]);
|
|
161
149
|
pushValue(unequalRightLeft, formula.args[0].args[1], formula.args[0].args[0]);
|
|
162
150
|
}
|
|
@@ -209,10 +197,10 @@ export const createIndex = (exprs: Expressions) => {
|
|
|
209
197
|
const stringEquality = getStringEquality(formula);
|
|
210
198
|
if (stringEquality !== undefined)
|
|
211
199
|
(stringEquality.isReversed ? reversedStringEqualities : stringEqualities).shift();
|
|
212
|
-
if (
|
|
200
|
+
if (isApp(formula, "=", 2)) {
|
|
213
201
|
popValue(equalLeftRight, formula.args[0]);
|
|
214
202
|
popValue(equalRightLeft, formula.args[1]);
|
|
215
|
-
} else if (formula.kind === "not" &&
|
|
203
|
+
} else if (formula.kind === "not" && isApp(formula.args[0], "=", 2)) {
|
|
216
204
|
popValue(unequalLeftRight, formula.args[0].args[0]);
|
|
217
205
|
popValue(unequalRightLeft, formula.args[0].args[1]);
|
|
218
206
|
}
|
package/src/prover/zenon/isar.ts
CHANGED
|
@@ -1,5 +1,3 @@
|
|
|
1
|
-
// Ported from Zenon's lltoisar.ml and the -oisar path of main.ml, as shipped in tlapm. Copyright 2008 INRIA, see LICENSE.
|
|
2
|
-
|
|
3
1
|
import { TlaZenonError } from "../../errors";
|
|
4
2
|
import { FALSE, GOAL_NAME, TRUE, type BinderExpr, type Expr, type Expressions } from "./expr";
|
|
5
3
|
import type { Relations } from "./eqrel";
|
|
@@ -10,40 +8,40 @@ import { isMetaName, translateProof, type MlProof } from "./mltoll";
|
|
|
10
8
|
import type { Phrase } from "./parse";
|
|
11
9
|
import { postprocessTla } from "./tla/llproof";
|
|
12
10
|
|
|
13
|
-
const INFIXES
|
|
14
|
-
"="
|
|
15
|
-
"TLA.cup"
|
|
16
|
-
"TLA.cap"
|
|
17
|
-
"TLA.setminus"
|
|
18
|
-
"TLA.in"
|
|
19
|
-
"TLA.subseteq"
|
|
20
|
-
"arith.natrange"
|
|
21
|
-
"arith.add"
|
|
22
|
-
"arith.sub"
|
|
23
|
-
"arith.mul"
|
|
24
|
-
"arith.le"
|
|
25
|
-
"arith.lt"
|
|
26
|
-
"TLA.concat"
|
|
27
|
-
"TLA.oneArg"
|
|
28
|
-
"TLA.extend"
|
|
29
|
-
|
|
11
|
+
const INFIXES = new Map([
|
|
12
|
+
["=", "="],
|
|
13
|
+
["TLA.cup", " \\\\cup "],
|
|
14
|
+
["TLA.cap", " \\\\cap "],
|
|
15
|
+
["TLA.setminus", " \\\\ "],
|
|
16
|
+
["TLA.in", " \\\\in "],
|
|
17
|
+
["TLA.subseteq", " \\\\subseteq "],
|
|
18
|
+
["arith.natrange", ".."],
|
|
19
|
+
["arith.add", " + "],
|
|
20
|
+
["arith.sub", " - "],
|
|
21
|
+
["arith.mul", " * "],
|
|
22
|
+
["arith.le", " <= "],
|
|
23
|
+
["arith.lt", " < "],
|
|
24
|
+
["TLA.concat", " \\\\circ "],
|
|
25
|
+
["TLA.oneArg", " :> "],
|
|
26
|
+
["TLA.extend", " @@ "],
|
|
27
|
+
]);
|
|
30
28
|
|
|
31
|
-
const CONSTANTS
|
|
32
|
-
"TLA.emptyset"
|
|
33
|
-
"arith.N"
|
|
34
|
-
"arith.Z"
|
|
35
|
-
"arith.R"
|
|
36
|
-
"arith.Infinity"
|
|
37
|
-
|
|
29
|
+
const CONSTANTS = new Map([
|
|
30
|
+
["TLA.emptyset", "{}"],
|
|
31
|
+
["arith.N", "Nat"],
|
|
32
|
+
["arith.Z", "Int"],
|
|
33
|
+
["arith.R", "isReal"],
|
|
34
|
+
["arith.Infinity", "isInfinity"],
|
|
35
|
+
]);
|
|
38
36
|
|
|
39
|
-
const PREFIXES
|
|
40
|
-
"arith.div"
|
|
41
|
-
"arith.euclidiv"
|
|
42
|
-
"arith.mod"
|
|
43
|
-
"arith.minus"
|
|
44
|
-
"arith.intrange"
|
|
45
|
-
"TLA.box"
|
|
46
|
-
|
|
37
|
+
const PREFIXES = new Map([
|
|
38
|
+
["arith.div", "isa'slash"],
|
|
39
|
+
["arith.euclidiv", "isa'div"],
|
|
40
|
+
["arith.mod", "isa'pc"],
|
|
41
|
+
["arith.minus", " -."],
|
|
42
|
+
["arith.intrange", "isa'dotdot"],
|
|
43
|
+
["TLA.box", "isa'box"],
|
|
44
|
+
]);
|
|
47
45
|
|
|
48
46
|
const stripNamespace = (symbol: string) =>
|
|
49
47
|
symbol.length > 4 && symbol.startsWith("TLA.")
|
|
@@ -159,7 +157,7 @@ export const printIsar = (proof: MlProof, context: IsarContext): string | undefi
|
|
|
159
157
|
case "var":
|
|
160
158
|
return isMetaName(expression.symbol)
|
|
161
159
|
? "(CHOOSE x : TRUE)"
|
|
162
|
-
: (CONSTANTS
|
|
160
|
+
: (CONSTANTS.get(expression.symbol) ?? stripNamespace(expression.symbol));
|
|
163
161
|
case "app": {
|
|
164
162
|
const args = expression.args;
|
|
165
163
|
switch (expression.symbol) {
|
|
@@ -192,11 +190,11 @@ export const printIsar = (proof: MlProof, context: IsarContext): string | undefi
|
|
|
192
190
|
if (numeral !== undefined) return String(numeral + 1);
|
|
193
191
|
return `(${print(args[0])}[${print(args[1])}])`;
|
|
194
192
|
}
|
|
195
|
-
const infix = INFIXES
|
|
193
|
+
const infix = INFIXES.get(expression.symbol);
|
|
196
194
|
if (infix !== undefined && args.length === 2)
|
|
197
195
|
return `(${print(args[0])}${infix}${print(args[1])})`;
|
|
198
196
|
if (args.length === 0) return expression.symbol;
|
|
199
|
-
return `${PREFIXES
|
|
197
|
+
return `${PREFIXES.get(expression.symbol) ?? stripNamespace(expression.symbol)}(${printList(args)})`;
|
|
200
198
|
}
|
|
201
199
|
case "not": {
|
|
202
200
|
const operand = expression.args[0];
|
|
@@ -1,5 +1,3 @@
|
|
|
1
|
-
// Ported from Zenon's llproof.ml, as shipped in tlapm. Copyright 2004 INRIA, see LICENSE.
|
|
2
|
-
|
|
3
1
|
import { TlaZenonError } from "../../errors";
|
|
4
2
|
import { FALSE, TRUE, type Expr, type Expressions } from "./expr";
|
|
5
3
|
|
|
@@ -39,15 +37,6 @@ export interface Lemma {
|
|
|
39
37
|
proof: LlProof;
|
|
40
38
|
}
|
|
41
39
|
|
|
42
|
-
export const connect = (exprs: Expressions, connective: Connective, left: Expr, right: Expr) =>
|
|
43
|
-
connective === "and"
|
|
44
|
-
? exprs.eand(left, right)
|
|
45
|
-
: connective === "or"
|
|
46
|
-
? exprs.eor(left, right)
|
|
47
|
-
: connective === "imply"
|
|
48
|
-
? exprs.eimply(left, right)
|
|
49
|
-
: exprs.eequiv(left, right);
|
|
50
|
-
|
|
51
40
|
const getLemma = (lemmas: Map<string, Lemma>, name: string) => {
|
|
52
41
|
const lemma = lemmas.get(name);
|
|
53
42
|
if (lemma === undefined) throw new TlaZenonError(`Zenon: no lemma ${name}`);
|
|
@@ -102,9 +91,9 @@ const getEliminated = (exprs: Expressions, lemmas: Map<string, Lemma>, rule: LlR
|
|
|
102
91
|
case "notnot":
|
|
103
92
|
return [exprs.enot(exprs.enot(rule.formula))];
|
|
104
93
|
case "connect":
|
|
105
|
-
return [
|
|
94
|
+
return [exprs.binary(rule.connective, rule.left, rule.right)];
|
|
106
95
|
case "notconnect":
|
|
107
|
-
return [exprs.enot(
|
|
96
|
+
return [exprs.enot(exprs.binary(rule.connective, rule.left, rule.right))];
|
|
108
97
|
case "ex":
|
|
109
98
|
case "all":
|
|
110
99
|
return [rule.quantified];
|
|
@@ -1,7 +1,5 @@
|
|
|
1
|
-
// Ported from Zenon's mltoll.ml, as shipped in tlapm. Copyright 2004 INRIA, see LICENSE.
|
|
2
|
-
|
|
3
1
|
import { TlaZenonError } from "../../errors";
|
|
4
|
-
import type { Direction, Origin, Relations } from "./eqrel";
|
|
2
|
+
import type { Direction, Origin, RelationProperty, Relations } from "./eqrel";
|
|
5
3
|
import {
|
|
6
4
|
difference,
|
|
7
5
|
union,
|
|
@@ -10,7 +8,7 @@ import {
|
|
|
10
8
|
type Expressions,
|
|
11
9
|
type VarExpr,
|
|
12
10
|
} from "./expr";
|
|
13
|
-
import {
|
|
11
|
+
import type { Connective, Lemma, LlProof, LlRule } from "./llproof";
|
|
14
12
|
import type { Definition, Phrase } from "./parse";
|
|
15
13
|
import type { Rule } from "./proof";
|
|
16
14
|
import { getTlaLlProof } from "./tla/llproof";
|
|
@@ -32,8 +30,6 @@ interface TranslateContext {
|
|
|
32
30
|
relations: Relations;
|
|
33
31
|
}
|
|
34
32
|
|
|
35
|
-
type RelationProperty = "reflexive" | "symmetric" | "transitive";
|
|
36
|
-
|
|
37
33
|
type HypothesisKind =
|
|
38
34
|
| { kind: "reflexive"; origin: Origin }
|
|
39
35
|
| { kind: "symmetric"; origin: Origin }
|
|
@@ -145,10 +141,8 @@ export const translateProof = (
|
|
|
145
141
|
): Lemma[] => {
|
|
146
142
|
const exprs = context.exprs;
|
|
147
143
|
const translatedExprs = new Map<Expr, Expr>();
|
|
148
|
-
const
|
|
149
|
-
const lemmaTable = new Map<string, [Lemma, Expr[]]>();
|
|
144
|
+
const lemmaTable = new Map<MlProof, [Lemma, Expr[]]>();
|
|
150
145
|
const lemmas: Lemma[] = [];
|
|
151
|
-
const getLemmaName = (number: number) => `${LEMMA_PREFIX}${number}_`;
|
|
152
146
|
|
|
153
147
|
const equal = (left: Expr, right: Expr) => exprs.eapp("=", [left, right]);
|
|
154
148
|
|
|
@@ -175,13 +169,13 @@ export const translateProof = (
|
|
|
175
169
|
case "imply":
|
|
176
170
|
case "equiv": {
|
|
177
171
|
const right = translateExpr(expression.args[1]);
|
|
178
|
-
return
|
|
172
|
+
return exprs.binary(expression.kind, translateExpr(expression.args[0]), right);
|
|
179
173
|
}
|
|
180
174
|
case "all":
|
|
181
175
|
case "ex":
|
|
182
176
|
case "tau":
|
|
183
177
|
case "lam":
|
|
184
|
-
return
|
|
178
|
+
return exprs.binder(
|
|
185
179
|
expression.kind,
|
|
186
180
|
expression.args[0],
|
|
187
181
|
expression.symbol,
|
|
@@ -195,15 +189,6 @@ export const translateProof = (
|
|
|
195
189
|
return result;
|
|
196
190
|
};
|
|
197
191
|
|
|
198
|
-
const makeBinder = (kind: BinderExpr["kind"], variable: VarExpr, type: string, body: Expr) =>
|
|
199
|
-
kind === "all"
|
|
200
|
-
? exprs.eall(variable, type, body)
|
|
201
|
-
: kind === "ex"
|
|
202
|
-
? exprs.eex(variable, type, body)
|
|
203
|
-
: kind === "tau"
|
|
204
|
-
? exprs.etau(variable, type, body)
|
|
205
|
-
: exprs.elam(variable, type, body);
|
|
206
|
-
|
|
207
192
|
const translateRule = (rule: MlRule): LlRule => {
|
|
208
193
|
switch (rule.name) {
|
|
209
194
|
case "close":
|
|
@@ -374,8 +359,7 @@ export const translateProof = (
|
|
|
374
359
|
};
|
|
375
360
|
|
|
376
361
|
const getLemmaReference = (proof: MlProof): Translated => {
|
|
377
|
-
const
|
|
378
|
-
const entry = number === undefined ? undefined : lemmaTable.get(getLemmaName(number));
|
|
362
|
+
const entry = lemmaTable.get(proof);
|
|
379
363
|
if (entry === undefined) throw new TlaZenonError("Zenon: a lemma that was never made");
|
|
380
364
|
const lemma = entry[0];
|
|
381
365
|
return [
|
|
@@ -389,19 +373,17 @@ export const translateProof = (
|
|
|
389
373
|
};
|
|
390
374
|
|
|
391
375
|
const makeLemma = (translated: LlProof, extras: Expr[], proof: MlProof) => {
|
|
392
|
-
const number = lemmas.length + 1;
|
|
393
|
-
lemmaNumbers.set(proof, number);
|
|
394
376
|
const lemma = {
|
|
395
|
-
name:
|
|
377
|
+
name: `${LEMMA_PREFIX}${lemmas.length + 1}_`,
|
|
396
378
|
params: translated.conclusions.reduce(getParams, []),
|
|
397
379
|
proof: translated,
|
|
398
380
|
};
|
|
399
|
-
lemmaTable.set(
|
|
381
|
+
lemmaTable.set(proof, [lemma, extras]);
|
|
400
382
|
lemmas.push(lemma);
|
|
401
383
|
};
|
|
402
384
|
|
|
403
385
|
const translate = (proof: MlProof): Translated => {
|
|
404
|
-
if (
|
|
386
|
+
if (lemmaTable.has(proof)) return getLemmaReference(proof);
|
|
405
387
|
const result = isDerived(proof.rule)
|
|
406
388
|
? translateDerived(proof)
|
|
407
389
|
: ((): Translated => {
|
|
@@ -422,7 +404,7 @@ export const translateProof = (
|
|
|
422
404
|
};
|
|
423
405
|
|
|
424
406
|
const isSharedProof = (proof: MlProof) =>
|
|
425
|
-
context.sharedProofs.has(proof) && !
|
|
407
|
+
context.sharedProofs.has(proof) && !lemmaTable.has(proof);
|
|
426
408
|
|
|
427
409
|
const translateAll = (proofs: MlProof[]): [LlProof[], Expr[]] => {
|
|
428
410
|
const translated = proofs.map(translate);
|
|
@@ -1420,10 +1402,10 @@ export const translateProof = (
|
|
|
1420
1402
|
) {
|
|
1421
1403
|
if (left.args[0] === right.args[0]) {
|
|
1422
1404
|
const diff = findDiff(variable, left.args[1], right.args[1]);
|
|
1423
|
-
return [
|
|
1405
|
+
return [exprs.binary(left.kind, left.args[0], diff[0]), diff[1], diff[2]];
|
|
1424
1406
|
}
|
|
1425
1407
|
const diff = findDiff(variable, left.args[0], right.args[0]);
|
|
1426
|
-
return [
|
|
1408
|
+
return [exprs.binary(left.kind, diff[0], left.args[1]), diff[1], diff[2]];
|
|
1427
1409
|
}
|
|
1428
1410
|
if (
|
|
1429
1411
|
left.kind === right.kind &&
|