tla-ts 0.0.10-dev.f16792fed → 0.0.10-dev.fdc173479
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 +41 -37
- package/dist/index.cjs +1 -1
- package/dist/index.d.cts +21 -4
- package/dist/index.d.ts +21 -4
- 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 +2681 -425
- package/dist/prove.js +2681 -425
- package/dist/run.cjs +41 -42
- package/dist/run.js +41 -42
- package/dist/tlapm.cjs +2 -2
- package/dist/tlapm.js +2 -2
- package/dist/transfer.cjs +97 -89
- package/dist/transfer.js +97 -89
- package/dist/worker.cjs +7 -7
- package/dist/worker.js +7 -7
- package/package.json +1 -1
- package/src/ast.ts +72 -39
- package/src/bags.ts +50 -29
- package/src/builtins.ts +8 -16
- package/src/check-failure.ts +118 -0
- package/src/check-trace.ts +321 -0
- package/src/check.ts +828 -770
- package/src/cli/options.ts +6 -31
- package/src/cli/runtime-invariants.ts +20 -56
- package/src/cli/shared.ts +1 -1
- package/src/cli/tlapm.ts +433 -70
- package/src/cli/tlc-arguments.ts +224 -212
- package/src/cli/tlc-output.ts +701 -0
- package/src/cli/tlc-usage.ts +1 -2
- package/src/cli/tlc.ts +65 -712
- package/src/cli/xml-exporter.ts +23 -33
- package/src/codegen.ts +28 -20
- package/src/coverage.ts +255 -20
- package/src/dependencies.ts +96 -27
- package/src/dfid.ts +115 -50
- package/src/environment-config.ts +315 -0
- package/src/environment.ts +175 -373
- package/src/errors.ts +40 -5
- package/src/evaluate.ts +429 -139
- package/src/exit-codes.ts +28 -12
- package/src/fingerprints.ts +65 -1
- package/src/instances.ts +178 -17
- package/src/java-hash.ts +14 -0
- package/src/java-overrides.ts +2 -2
- package/src/json.ts +4 -7
- package/src/levels.ts +708 -272
- package/src/lexer.ts +17 -5
- package/src/liveness-checker.ts +707 -249
- package/src/liveness.ts +148 -95
- 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 +39 -9
- package/src/obligations/levels.ts +24 -11
- package/src/obligations/module.ts +28 -41
- package/src/obligations/normalize.ts +27 -18
- package/src/obligations/operators.ts +0 -2
- package/src/obligations/pragma.ts +53 -16
- package/src/obligations/printer.ts +48 -18
- package/src/obligations/proof.ts +3 -2
- package/src/obligations/regroup.ts +0 -2
- package/src/obligations/simplify.ts +55 -50
- package/src/obligations/source.ts +120 -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 +17 -31
- package/src/parallel.ts +29 -47
- package/src/parser.ts +757 -326
- 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 +226 -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 +1 -3
- package/src/prover/isabelle/provers/classical.ts +45 -20
- package/src/prover/isabelle/provers/hypsubst.ts +19 -30
- 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 +9 -20
- 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 +3 -5
- 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/md5.ts +26 -29
- 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 +1016 -618
- package/src/prover/smt/simplify.ts +441 -0
- package/src/prover/smt/solver/ackermannize-bv-tactic.ts +62 -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 +624 -9
- 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 +319 -0
- package/src/prover/smt/solver/asserted-formulas.ts +240 -56
- package/src/prover/smt/solver/ast-lt.ts +165 -11
- package/src/prover/smt/solver/ast-util.ts +160 -2
- package/src/prover/smt/solver/ast.ts +1483 -45
- package/src/prover/smt/solver/auf-solver.ts +25 -18
- package/src/prover/smt/solver/bit-blast-tactic.ts +608 -0
- package/src/prover/smt/solver/bit-blaster.ts +871 -0
- package/src/prover/smt/solver/blast-term-ite.ts +47 -0
- package/src/prover/smt/solver/bound-manager.ts +196 -0
- package/src/prover/smt/solver/bound-simplifier.ts +598 -0
- package/src/prover/smt/solver/bv-bound-chk.ts +492 -0
- package/src/prover/smt/solver/bv-decl-plugin.ts +341 -0
- package/src/prover/smt/solver/bv-divrem-bounds.ts +95 -0
- package/src/prover/smt/solver/bv-rewriter.ts +1901 -0
- package/src/prover/smt/solver/bv1-blast.ts +214 -0
- package/src/prover/smt/solver/bv2fpa-converter.ts +174 -0
- package/src/prover/smt/solver/bv2int-rewriter.ts +544 -0
- package/src/prover/smt/solver/bv2real-rewriter.ts +533 -0
- package/src/prover/smt/solver/card2bv.ts +127 -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 +293 -0
- package/src/prover/smt/solver/conflict-resolution.ts +78 -2
- package/src/prover/smt/solver/context.ts +598 -128
- package/src/prover/smt/solver/ctx-simplify.ts +29 -14
- package/src/prover/smt/solver/ctx-solver-simplify.ts +122 -0
- package/src/prover/smt/solver/datatype-decl-plugin.ts +580 -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 +93 -0
- package/src/prover/smt/solver/der.ts +38 -10
- package/src/prover/smt/solver/diff-neq.ts +207 -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 +298 -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-bounds.ts +89 -0
- package/src/prover/smt/solver/elim-small-bv-tactic.ts +129 -0
- package/src/prover/smt/solver/elim-term-ite-tactic.ts +48 -0
- package/src/prover/smt/solver/elim-uncnstr.ts +548 -0
- package/src/prover/smt/solver/enode.ts +100 -3
- package/src/prover/smt/solver/eq2bv-tactic.ts +227 -0
- package/src/prover/smt/solver/euf/arith-axioms.ts +403 -0
- package/src/prover/smt/solver/euf/arith-internalize.ts +653 -0
- package/src/prover/smt/solver/euf/arith-solver.ts +889 -0
- package/src/prover/smt/solver/euf/array-axioms.ts +527 -0
- package/src/prover/smt/solver/euf/array-internalize.ts +428 -0
- package/src/prover/smt/solver/euf/array-solver.ts +306 -0
- package/src/prover/smt/solver/euf/bv-ackerman.ts +162 -0
- package/src/prover/smt/solver/euf/bv-internalize.ts +748 -0
- package/src/prover/smt/solver/euf/bv-solver.ts +449 -0
- package/src/prover/smt/solver/euf/dt-solver.ts +618 -0
- package/src/prover/smt/solver/euf/egraph.ts +901 -0
- package/src/prover/smt/solver/euf/euf-solver.ts +1204 -0
- package/src/prover/smt/solver/euf/fpa-solver.ts +317 -0
- package/src/prover/smt/solver/euf/mam.ts +1046 -0
- package/src/prover/smt/solver/euf/q-ematch.ts +829 -0
- package/src/prover/smt/solver/euf/q-mbi.ts +587 -0
- package/src/prover/smt/solver/euf/q-model-fixer.ts +296 -0
- package/src/prover/smt/solver/euf/q-solver.ts +361 -0
- package/src/prover/smt/solver/euf/th-solver.ts +328 -0
- package/src/prover/smt/solver/euf/th-solvers.ts +30 -0
- package/src/prover/smt/solver/expr-ref.ts +0 -1
- package/src/prover/smt/solver/expr-safe-replace.ts +26 -2
- package/src/prover/smt/solver/expr2polynomial.ts +271 -0
- package/src/prover/smt/solver/factor.ts +163 -0
- package/src/prover/smt/solver/fd-solver.ts +734 -0
- package/src/prover/smt/solver/fingerprints.ts +15 -15
- package/src/prover/smt/solver/fix-dl-var.ts +147 -0
- package/src/prover/smt/solver/flat-literals.ts +0 -1
- package/src/prover/smt/solver/fm-tactic.ts +886 -0
- package/src/prover/smt/solver/fpa-decl-plugin.ts +618 -0
- package/src/prover/smt/solver/fpa-rewriter.ts +639 -0
- package/src/prover/smt/solver/fpa2bv-converter.ts +2251 -0
- package/src/prover/smt/solver/fpa2bv-rewriter.ts +349 -0
- package/src/prover/smt/solver/fpa2bv-tactic.ts +73 -0
- package/src/prover/smt/solver/goal.ts +178 -15
- package/src/prover/smt/solver/goal2nlsat.ts +216 -0
- package/src/prover/smt/solver/guard-set.ts +219 -0
- package/src/prover/smt/solver/hash.ts +0 -1
- package/src/prover/smt/solver/hashtable.ts +34 -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 +111 -39
- 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 +355 -0
- package/src/prover/smt/solver/lp/bound-propagator.ts +0 -1
- package/src/prover/smt/solver/lp/constraints.ts +0 -1
- package/src/prover/smt/solver/lp/containers.ts +7 -2
- package/src/prover/smt/solver/lp/core-solver.ts +30 -11
- package/src/prover/smt/solver/lp/cross-nested.ts +1 -4
- package/src/prover/smt/solver/lp/dep-intervals.ts +0 -3
- package/src/prover/smt/solver/lp/dependency.ts +0 -2
- package/src/prover/smt/solver/lp/dioph-eq.ts +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 +41 -5
- package/src/prover/smt/solver/lp/lar-term.ts +0 -1
- package/src/prover/smt/solver/lp/lp-settings.ts +6 -3
- package/src/prover/smt/solver/lp/maximize-term.ts +59 -10
- package/src/prover/smt/solver/lp/nex-creator.ts +3 -3
- package/src/prover/smt/solver/lp/nex.ts +2 -2
- package/src/prover/smt/solver/lp/nla-backoff.ts +0 -2
- package/src/prover/smt/solver/lp/nla-basics.ts +46 -3
- package/src/prover/smt/solver/lp/nla-core.ts +68 -17
- package/src/prover/smt/solver/lp/nla-divisions.ts +0 -2
- package/src/prover/smt/solver/lp/nla-emonics.ts +0 -1
- package/src/prover/smt/solver/lp/nla-factorization.ts +0 -1
- package/src/prover/smt/solver/lp/nla-grobner.ts +167 -85
- package/src/prover/smt/solver/lp/nla-horner.ts +0 -2
- package/src/prover/smt/solver/lp/nla-intervals.ts +0 -1
- package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +0 -2
- package/src/prover/smt/solver/lp/nla-monotone.ts +0 -1
- package/src/prover/smt/solver/lp/nla-order.ts +0 -2
- package/src/prover/smt/solver/lp/nla-patcher.ts +0 -1
- package/src/prover/smt/solver/lp/nla-powers.ts +220 -0
- package/src/prover/smt/solver/lp/nla-tangents.ts +0 -2
- package/src/prover/smt/solver/lp/nla-throttle.ts +0 -1
- package/src/prover/smt/solver/lp/nla-transcendentals.ts +324 -0
- package/src/prover/smt/solver/lp/nla-types.ts +0 -2
- package/src/prover/smt/solver/lp/nla-var-eqs.ts +0 -1
- package/src/prover/smt/solver/lp/nra-solver.ts +163 -99
- package/src/prover/smt/solver/lp/numeric-pair.ts +0 -1
- package/src/prover/smt/solver/lp/pdd-interval.ts +6 -3
- package/src/prover/smt/solver/lp/pdd-simplifier.ts +60 -21
- package/src/prover/smt/solver/lp/pdd-solver.ts +72 -41
- package/src/prover/smt/solver/lp/pdd.ts +725 -290
- package/src/prover/smt/solver/lp/random-updater.ts +0 -2
- package/src/prover/smt/solver/lp/static-matrix.ts +0 -1
- package/src/prover/smt/solver/lp/union-find.ts +7 -2
- package/src/prover/smt/solver/macro-finder.ts +530 -0
- package/src/prover/smt/solver/mam-compiler.ts +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 +310 -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 +106 -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 +19 -28
- package/src/prover/smt/solver/model-evaluator.ts +190 -12
- package/src/prover/smt/solver/model-finder.ts +12 -18
- package/src/prover/smt/solver/model-generator.ts +104 -35
- 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 +709 -0
- package/src/prover/smt/solver/mus.ts +50 -0
- package/src/prover/smt/solver/muz/dl-context.ts +382 -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 +495 -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 +214 -0
- package/src/prover/smt/solver/muz/rule-properties.ts +359 -0
- package/src/prover/smt/solver/muz/spacer-context.ts +1404 -0
- package/src/prover/smt/solver/muz/spacer-dl-interface.ts +52 -0
- package/src/prover/smt/solver/muz/spacer-generalizers.ts +241 -0
- package/src/prover/smt/solver/muz/spacer-manager.ts +127 -0
- package/src/prover/smt/solver/muz/spacer-pdr.ts +219 -0
- package/src/prover/smt/solver/muz/spacer-prop-solver.ts +333 -0
- package/src/prover/smt/solver/muz/spacer-util.ts +282 -0
- package/src/prover/smt/solver/muz/substitution.ts +203 -0
- package/src/prover/smt/solver/nla2bv-tactic.ts +285 -0
- package/src/prover/smt/solver/nlqsat.ts +485 -0
- package/src/prover/smt/solver/nlsat/algebraic.ts +315 -98
- package/src/prover/smt/solver/nlsat/atoms.ts +71 -38
- package/src/prover/smt/solver/nlsat/evaluator.ts +0 -1
- package/src/prover/smt/solver/nlsat/explain.ts +427 -229
- package/src/prover/smt/solver/nlsat/interval-set.ts +1 -2
- package/src/prover/smt/solver/nlsat/levelwise.ts +460 -246
- package/src/prover/smt/solver/nlsat/mpbq.ts +45 -1
- package/src/prover/smt/solver/nlsat/polynomial.ts +2376 -684
- package/src/prover/smt/solver/nlsat/solver.ts +293 -92
- package/src/prover/smt/solver/nlsat/transcendental-eval.ts +310 -0
- package/src/prover/smt/solver/nlsat/transcendentals.ts +391 -0
- package/src/prover/smt/solver/nlsat/types.ts +0 -2
- package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +9 -8
- package/src/prover/smt/solver/nlsat/upolynomial.ts +41 -20
- package/src/prover/smt/solver/nlsat-tactic.ts +82 -0
- package/src/prover/smt/solver/nnf.ts +110 -24
- 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 +801 -0
- package/src/prover/smt/solver/opt-nlsat.ts +386 -0
- package/src/prover/smt/solver/opt-pareto.ts +301 -0
- package/src/prover/smt/solver/opt-preprocess.ts +101 -0
- package/src/prover/smt/solver/opt-solver.ts +312 -0
- package/src/prover/smt/solver/opt-value.ts +55 -0
- package/src/prover/smt/solver/optsmt.ts +692 -0
- package/src/prover/smt/solver/parallel-tactic.ts +299 -0
- package/src/prover/smt/solver/pattern-inference.ts +19 -11
- package/src/prover/smt/solver/pb-rewriter.ts +281 -0
- package/src/prover/smt/solver/pb2bv-tactic.ts +546 -0
- package/src/prover/smt/solver/poly-rewriter.ts +259 -57
- package/src/prover/smt/solver/probes.ts +577 -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 +634 -0
- package/src/prover/smt/solver/push-app-ite.ts +37 -0
- package/src/prover/smt/solver/qe-arith-plugin.ts +1096 -0
- package/src/prover/smt/solver/qe-lite-der.ts +2 -3
- package/src/prover/smt/solver/qe-lite-fm.ts +3 -4
- package/src/prover/smt/solver/qe-lite.ts +39 -19
- package/src/prover/smt/solver/qe-mbp.ts +270 -0
- package/src/prover/smt/solver/qe.ts +1499 -0
- package/src/prover/smt/solver/qel.ts +25 -0
- package/src/prover/smt/solver/qi-queue.ts +0 -1
- package/src/prover/smt/solver/qsat.ts +829 -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 +22 -25
- package/src/prover/smt/solver/quasi-macros.ts +243 -0
- package/src/prover/smt/solver/random-gen.ts +0 -1
- package/src/prover/smt/solver/rational.ts +45 -1
- package/src/prover/smt/solver/recfun-decl-plugin.ts +262 -0
- package/src/prover/smt/solver/recfun-rewriter.ts +107 -0
- package/src/prover/smt/solver/reduce-args.ts +225 -0
- package/src/prover/smt/solver/reduce-bv-size.ts +119 -0
- package/src/prover/smt/solver/ref-vector.ts +0 -1
- package/src/prover/smt/solver/relevancy.ts +1 -2
- package/src/prover/smt/solver/rewriter-tpl.ts +82 -14
- package/src/prover/smt/solver/rewriter.ts +505 -60
- package/src/prover/smt/solver/rlimit.ts +45 -5
- 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 +589 -0
- package/src/prover/smt/solver/sat/inc-sat-solver.ts +480 -0
- package/src/prover/smt/solver/sat/model-converter.ts +136 -0
- package/src/prover/smt/solver/sat/pb-constraint.ts +268 -0
- package/src/prover/smt/solver/sat/pb-solver.ts +1596 -0
- package/src/prover/smt/solver/sat/probing.ts +170 -0
- package/src/prover/smt/solver/sat/sat-tactic.ts +72 -0
- package/src/prover/smt/solver/sat/sat2goal.ts +190 -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 +2107 -0
- package/src/prover/smt/solver/sat/var-queue.ts +117 -0
- package/src/prover/smt/solver/sat/watch-list.ts +140 -0
- package/src/prover/smt/solver/search-tree.ts +284 -0
- package/src/prover/smt/solver/seq-axioms.ts +995 -0
- package/src/prover/smt/solver/seq-decl-plugin.ts +819 -0
- package/src/prover/smt/solver/seq-derive.ts +1298 -0
- package/src/prover/smt/solver/seq-eq-approx.ts +236 -0
- package/src/prover/smt/solver/seq-eq-solver.ts +439 -0
- package/src/prover/smt/solver/seq-factory.ts +89 -0
- package/src/prover/smt/solver/seq-monadic.ts +730 -0
- package/src/prover/smt/solver/seq-range-predicate.ts +235 -0
- package/src/prover/smt/solver/seq-re-rewriter.ts +1171 -0
- package/src/prover/smt/solver/seq-re-util.ts +758 -0
- package/src/prover/smt/solver/seq-regex-bisim.ts +144 -0
- package/src/prover/smt/solver/seq-regex-live.ts +200 -0
- package/src/prover/smt/solver/seq-rewriter.ts +2404 -0
- package/src/prover/smt/solver/seq-skolem.ts +294 -0
- package/src/prover/smt/solver/seq-subset.ts +165 -0
- package/src/prover/smt/solver/seq-view-witness.ts +353 -0
- package/src/prover/smt/solver/smt-consequences.ts +297 -0
- package/src/prover/smt/solver/smt-kernel.ts +124 -0
- package/src/prover/smt/solver/smt-logics.ts +66 -0
- package/src/prover/smt/solver/smt-setup.ts +589 -0
- package/src/prover/smt/solver/smt2-printer.ts +765 -0
- package/src/prover/smt/solver/smtlib-parser.ts +3535 -360
- package/src/prover/smt/solver/smtlib-script.ts +2136 -0
- package/src/prover/smt/solver/solve-eqs.ts +928 -0
- package/src/prover/smt/solver/solver.ts +128 -23
- 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 +2176 -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 +1210 -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 +57 -70
- package/src/prover/smt/solver/theory-lra-internalize.ts +96 -27
- package/src/prover/smt/solver/theory-lra-model.ts +20 -35
- package/src/prover/smt/solver/theory-lra-propagate.ts +35 -28
- package/src/prover/smt/solver/theory-lra-state.ts +7 -23
- package/src/prover/smt/solver/theory-lra.ts +189 -2
- package/src/prover/smt/solver/theory-pb.ts +951 -0
- package/src/prover/smt/solver/theory-polymorphism.ts +58 -0
- package/src/prover/smt/solver/theory-recfun.ts +307 -0
- package/src/prover/smt/solver/theory-seq-regex.ts +867 -0
- package/src/prover/smt/solver/theory-seq-solve.ts +1373 -0
- package/src/prover/smt/solver/theory-seq-state.ts +852 -0
- package/src/prover/smt/solver/theory-seq.ts +961 -0
- package/src/prover/smt/solver/theory-without-terms.ts +24 -0
- package/src/prover/smt/solver/theory.ts +189 -0
- package/src/prover/smt/solver/tseitin-cnf.ts +495 -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 +57 -26
- 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 +24 -2
- package/src/prover/zenon/expr.ts +28 -2
- package/src/prover/zenon/index-table.ts +16 -23
- package/src/prover/zenon/isar-case.ts +1 -3
- package/src/prover/zenon/isar.ts +37 -39
- 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 +1 -3
- package/src/prover/zenon/proof.ts +0 -2
- package/src/prover/zenon/propositional-rules.ts +0 -2
- package/src/prover/zenon/rules.ts +2 -3
- package/src/prover/zenon/search.ts +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 +1327 -328
- package/src/runtime.ts +25 -2
- package/src/sany/builtins.ts +10 -10
- package/src/sany/generation.ts +384 -0
- package/src/sany/generator-def-entries.ts +297 -0
- package/src/sany/generator-definitions.ts +688 -0
- package/src/sany/generator-expressions.ts +1123 -0
- package/src/sany/generator-proofs.ts +668 -0
- package/src/sany/generator.ts +161 -2625
- package/src/sany/levels.ts +0 -2
- package/src/sany/lexer.ts +32 -23
- package/src/sany/linter.ts +0 -2
- package/src/sany/modules.ts +4 -2
- package/src/sany/nodes.ts +3 -4
- package/src/sany/report.ts +3 -6
- package/src/sany/selectors.ts +46 -44
- package/src/sany/xml.ts +25 -58
- package/src/search.ts +513 -165
- package/src/simulate.ts +340 -251
- package/src/spec-description.ts +48 -55
- package/src/standard-definitions.ts +5 -0
- package/src/standard-modules.ts +72 -54
- package/src/state-graph.ts +0 -2
- package/src/subexpressions.ts +564 -138
- package/src/substitution-levels.ts +5 -4
- package/src/successors.ts +56 -28
- package/src/symmetry.ts +4 -3
- package/src/tableau.ts +2 -2
- package/src/tlc/fingerprint.ts +81 -9
- package/src/tlc/jar-data.ts +10 -0
- package/src/tlc/messages.ts +23 -18
- package/src/tlc/order.ts +14 -3
- package/src/tlc/random.ts +6 -5
- package/src/tlc/replay.ts +152 -58
- package/src/tlc/summary.ts +29 -14
- package/src/tlc/tlc-operators.ts +12 -11
- package/src/tlc/tlcext-operators.ts +87 -26
- package/src/tlc/trace-spec.ts +27 -60
- package/src/trace-liveness.ts +529 -0
- package/src/typed-tier.ts +6556 -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/typescript/types.ts +2 -2
- package/src/values.ts +208 -227
- package/src/prover/isabelle/isar/statement.ts +0 -52
- package/src/prover/smt/solver/z3-license.txt +0 -10
- package/src/prover/tlaps-module.ts +0 -510
- package/src/prover/zenon/LICENSE +0 -32
|
@@ -1,19 +1,575 @@
|
|
|
1
|
-
|
|
2
|
-
|
|
3
|
-
import {
|
|
4
|
-
import { normHhf } from "../pure/simplifier";
|
|
5
|
-
import { mkVar, propT } from "../pure/term";
|
|
6
|
-
import { every, type Tactic } from "../pure/tactical";
|
|
1
|
+
import { TlaIsabelleError } from "../../../errors";
|
|
2
|
+
import { compIncr, forallIntrVars, protectD, protectI, revcutRl } from "../pure/drule";
|
|
3
|
+
import { conclude } from "../pure/goal";
|
|
7
4
|
import type { Limits } from "../pure/interrupt";
|
|
8
|
-
import {
|
|
9
|
-
import {
|
|
10
|
-
|
|
11
|
-
|
|
12
|
-
|
|
13
|
-
|
|
5
|
+
import { isProtected, stripAssumsConcl, stripParams } from "../pure/logic";
|
|
6
|
+
import {
|
|
7
|
+
appendSeq,
|
|
8
|
+
emptySeq,
|
|
9
|
+
filterSeq,
|
|
10
|
+
mapSeq,
|
|
11
|
+
mapsSeq,
|
|
12
|
+
seqHead,
|
|
13
|
+
singleSeq,
|
|
14
|
+
type Seq,
|
|
15
|
+
} from "../pure/seq";
|
|
16
|
+
import { normHhf } from "../pure/simplifier";
|
|
17
|
+
import { eresolveTac, resolveTac } from "../pure/tactic";
|
|
18
|
+
import { every, subgoal, thenGoal, type GoalTactic, type Tactic } from "../pure/tactical";
|
|
19
|
+
import { aconv, existsSubterm, mkAbs, mkFree, mkVar, propT, type Term } from "../pure/term";
|
|
20
|
+
import { bicompose, incrIndexesThm, instantiate, nprems, type Thm } from "../pure/thm";
|
|
21
|
+
import {
|
|
22
|
+
addAssumptions,
|
|
23
|
+
addFixes,
|
|
24
|
+
assumptionsOf,
|
|
25
|
+
augment,
|
|
26
|
+
bindTerm,
|
|
27
|
+
declareTerm,
|
|
28
|
+
exportThm,
|
|
29
|
+
maybeBindTerm,
|
|
30
|
+
putFacts,
|
|
31
|
+
readTerms,
|
|
32
|
+
simultMatches,
|
|
33
|
+
updateCases,
|
|
34
|
+
type IsarContext,
|
|
35
|
+
type ReadMode,
|
|
36
|
+
} from "./context";
|
|
37
|
+
import { applyAttributes } from "./attrib";
|
|
38
|
+
import { evaluate, finishTac, normHhfTac, unfoldGoals, unfoldRule, type GoalState } from "./method";
|
|
39
|
+
import { applyCase, dropJudgment } from "./rule-cases";
|
|
40
|
+
import { parseType } from "./inner-syntax";
|
|
41
|
+
import type { AttributeSource, FixedVariable, MethodText, StatementPart } from "./theory";
|
|
14
42
|
|
|
15
|
-
|
|
16
|
-
|
|
43
|
+
const initGoal = (prop: Term) =>
|
|
44
|
+
instantiate([{ variable: mkVar("A", 0, propT), term: prop }], protectI);
|
|
17
45
|
|
|
18
46
|
export const insertTac = (limits: Limits, facts: readonly Thm[], index: number): Tactic =>
|
|
19
47
|
every(facts.map((fact) => resolveTac(limits, [compIncr(forallIntrVars(fact), revcutRl)])(index)));
|
|
48
|
+
|
|
49
|
+
type Mode = "forward" | "chain" | "backward";
|
|
50
|
+
|
|
51
|
+
type AfterQed = (resultContext: IsarContext, results: readonly Thm[], state: State) => State;
|
|
52
|
+
|
|
53
|
+
interface Goal {
|
|
54
|
+
readonly props: readonly Term[];
|
|
55
|
+
readonly using: readonly Thm[];
|
|
56
|
+
readonly goal: Thm;
|
|
57
|
+
readonly afterQed: AfterQed;
|
|
58
|
+
}
|
|
59
|
+
|
|
60
|
+
interface Node {
|
|
61
|
+
readonly context: IsarContext;
|
|
62
|
+
readonly facts: readonly Thm[] | undefined;
|
|
63
|
+
readonly mode: Mode;
|
|
64
|
+
readonly goal: Goal | undefined;
|
|
65
|
+
}
|
|
66
|
+
|
|
67
|
+
// The stack of blocks, innermost last.
|
|
68
|
+
export type State = readonly Node[];
|
|
69
|
+
|
|
70
|
+
const error = (message: string) => new TlaIsabelleError("ERROR", message);
|
|
71
|
+
|
|
72
|
+
const hasVars = (term: Term) => existsSubterm((sub) => sub.kind === "Var", term);
|
|
73
|
+
|
|
74
|
+
const top = (state: State) => state[state.length - 1];
|
|
75
|
+
|
|
76
|
+
const mapTop = (state: State, map: (node: Node) => Node): State => [
|
|
77
|
+
...state.slice(0, -1),
|
|
78
|
+
map(top(state)),
|
|
79
|
+
];
|
|
80
|
+
|
|
81
|
+
export const contextOf = (state: State) => top(state).context;
|
|
82
|
+
|
|
83
|
+
const mapContext = (state: State, map: (context: IsarContext) => IsarContext) =>
|
|
84
|
+
mapTop(state, (node) => ({ ...node, context: map(node.context) }));
|
|
85
|
+
|
|
86
|
+
const openBlock = (state: State): State => [...state, top(state)];
|
|
87
|
+
|
|
88
|
+
const closeBlock = (state: State): State => {
|
|
89
|
+
if (state.length <= 1) throw error("Unbalanced block parentheses");
|
|
90
|
+
return state.slice(0, -1);
|
|
91
|
+
};
|
|
92
|
+
|
|
93
|
+
const putFactsOf = (state: State, facts: readonly Thm[] | undefined): State =>
|
|
94
|
+
mapTop(state, (node) => ({ ...node, facts, context: putFacts(node.context, "this", facts) }));
|
|
95
|
+
|
|
96
|
+
const theFacts = (state: State) => {
|
|
97
|
+
const facts = top(state).facts;
|
|
98
|
+
if (facts === undefined) throw error("No current facts available");
|
|
99
|
+
return facts;
|
|
100
|
+
};
|
|
101
|
+
|
|
102
|
+
const assertMode = (state: State, modes: readonly Mode[]) => {
|
|
103
|
+
if (!modes.includes(top(state).mode))
|
|
104
|
+
throw error(`Illegal application of proof command in ${top(state).mode} mode`);
|
|
105
|
+
return state;
|
|
106
|
+
};
|
|
107
|
+
|
|
108
|
+
const putMode = (state: State, mode: Mode) => mapTop(state, (node) => ({ ...node, mode }));
|
|
109
|
+
|
|
110
|
+
const findGoal = (state: State): [number, IsarContext, Goal] => {
|
|
111
|
+
for (let index = state.length - 1; index >= 0; index -= 1) {
|
|
112
|
+
const goal = state[index].goal;
|
|
113
|
+
if (goal !== undefined) return [index, state[index].context, goal];
|
|
114
|
+
}
|
|
115
|
+
throw error("No proof goal");
|
|
116
|
+
};
|
|
117
|
+
|
|
118
|
+
const mapGoal = (state: State, map: (context: IsarContext, goal: Goal) => [IsarContext, Goal]) => {
|
|
119
|
+
const [index, context, goal] = findGoal(state);
|
|
120
|
+
const [newContext, newGoal] = map(context, goal);
|
|
121
|
+
return state.map((node, position) =>
|
|
122
|
+
position === index ? { ...node, context: newContext, goal: newGoal } : node,
|
|
123
|
+
);
|
|
124
|
+
};
|
|
125
|
+
|
|
126
|
+
const provideGoal = (state: State, thm: Thm) =>
|
|
127
|
+
mapGoal(state, (context, goal) => [context, { ...goal, goal: thm }]);
|
|
128
|
+
|
|
129
|
+
const usingFacts = (state: State, using: readonly Thm[]) =>
|
|
130
|
+
mapGoal(state, (context, goal) => [context, { ...goal, using }]);
|
|
131
|
+
|
|
132
|
+
// Proof.refine: the method applies to the goal with its facts, in the given context, and its
|
|
133
|
+
// cases join the goal's context.
|
|
134
|
+
const refine = (state: State, text: MethodText): Seq<State> => {
|
|
135
|
+
const [, goalContext, goal] = findGoal(state);
|
|
136
|
+
const method = evaluate(contextOf(state), text);
|
|
137
|
+
return mapSeq(
|
|
138
|
+
(result: GoalState) => mapGoal(state, () => [result.context, { ...goal, goal: result.goal }]),
|
|
139
|
+
method(goal.using)({ context: goalContext, goal: goal.goal }),
|
|
140
|
+
);
|
|
141
|
+
};
|
|
142
|
+
|
|
143
|
+
const STANDARD_TEXT: MethodText = { kind: "source", name: "standard", args: [] };
|
|
144
|
+
|
|
145
|
+
export const proof = (state: State, text: MethodText | undefined): Seq<State> => {
|
|
146
|
+
assertMode(state, ["backward"]);
|
|
147
|
+
return mapSeq(
|
|
148
|
+
(result: State) =>
|
|
149
|
+
mapTop(openBlock(putMode(usingFacts(result, []), "forward")), (node) => ({
|
|
150
|
+
...node,
|
|
151
|
+
goal: undefined,
|
|
152
|
+
})),
|
|
153
|
+
refine(state, text ?? STANDARD_TEXT),
|
|
154
|
+
);
|
|
155
|
+
};
|
|
156
|
+
|
|
157
|
+
const theResult = <Item>(seq: Seq<Item>, message: string): Item => {
|
|
158
|
+
const result = seqHead(seq);
|
|
159
|
+
if (result === undefined) throw error(message);
|
|
160
|
+
return result;
|
|
161
|
+
};
|
|
162
|
+
|
|
163
|
+
// Proof.end_proof: the closing method, then the goal must have no subgoals.
|
|
164
|
+
const endProof = (state: State, text: MethodText | undefined): Seq<State> => {
|
|
165
|
+
assertMode(state, ["forward"]);
|
|
166
|
+
const closed = usingFacts(closeBlock(state), []);
|
|
167
|
+
if (top(closed).goal === undefined) throw error("No goal in this block");
|
|
168
|
+
const finish: Seq<State> = text === undefined ? singleSeq(closed) : refine(closed, text);
|
|
169
|
+
return filterSeq(
|
|
170
|
+
(result: State) => nprems(findGoal(result)[2].goal) === 0,
|
|
171
|
+
mapsSeq(
|
|
172
|
+
(result: State) =>
|
|
173
|
+
mapSeq(
|
|
174
|
+
(thm: Thm) => provideGoal(result, thm),
|
|
175
|
+
finishTac(contextOf(result).tactics.limits)(findGoal(result)[2].goal),
|
|
176
|
+
),
|
|
177
|
+
finish,
|
|
178
|
+
),
|
|
179
|
+
);
|
|
180
|
+
};
|
|
181
|
+
|
|
182
|
+
const concludeGoal = (context: IsarContext, goal: Goal): Thm => {
|
|
183
|
+
if (nprems(goal.goal) !== 0) throw error("Failed to finish proof");
|
|
184
|
+
const thm = conclude(goal.goal);
|
|
185
|
+
if (thm.tpairs.length > 0) throw error("Unsupported flex-flex constraints in result");
|
|
186
|
+
const assumptions = assumptionsOf(context);
|
|
187
|
+
if (!thm.hyps.every((hyp) => assumptions.some((assumption) => aconv(hyp, assumption))))
|
|
188
|
+
throw error("Undeclared hyps");
|
|
189
|
+
if (!aconv(thm.prop, goal.props[0])) throw error("Proved a different theorem");
|
|
190
|
+
return thm;
|
|
191
|
+
};
|
|
192
|
+
|
|
193
|
+
// Proof.generic_qed and its after_qed.
|
|
194
|
+
const genericQed = (state: State): State => {
|
|
195
|
+
const [, context, goal] = findGoal(state);
|
|
196
|
+
if (top(state).goal === undefined) throw error("No current goal");
|
|
197
|
+
return goal.afterQed(context, [concludeGoal(context, goal)], closeBlock(state));
|
|
198
|
+
};
|
|
199
|
+
|
|
200
|
+
export const qed = (state: State, text: MethodText | undefined): State =>
|
|
201
|
+
genericQed(theResult(endProof(state, text), "Failed to finish proof"));
|
|
202
|
+
|
|
203
|
+
// Proof.terminal_proof, as by: the first initial result that the terminal method finishes.
|
|
204
|
+
export const terminalProof = (
|
|
205
|
+
state: State,
|
|
206
|
+
initial: MethodText,
|
|
207
|
+
terminal: MethodText | undefined,
|
|
208
|
+
): State =>
|
|
209
|
+
genericQed(
|
|
210
|
+
theResult(
|
|
211
|
+
mapsSeq((result: State) => endProof(result, terminal), proof(state, initial)),
|
|
212
|
+
"Failed to finish proof",
|
|
213
|
+
),
|
|
214
|
+
);
|
|
215
|
+
|
|
216
|
+
// Auto_Bind.goal: ?thesis is a single goal's conclusion, abstracted over its parameters.
|
|
217
|
+
const thesisOf = (prop: Term) =>
|
|
218
|
+
stripParams(prop).reduceRight(
|
|
219
|
+
(body, param) => mkAbs(param.name, param.type, body),
|
|
220
|
+
dropJudgment(stripAssumsConcl(prop)),
|
|
221
|
+
);
|
|
222
|
+
|
|
223
|
+
// Proof.generic_goal: a new block whose goal is the proposition.
|
|
224
|
+
const genericGoal = (
|
|
225
|
+
state: State,
|
|
226
|
+
goalContext: IsarContext,
|
|
227
|
+
props: readonly Term[],
|
|
228
|
+
afterQed: AfterQed,
|
|
229
|
+
): State => {
|
|
230
|
+
if (props.length !== 1) throw error("Unsupported goal of several propositions");
|
|
231
|
+
const isChaining = top(state).mode === "chain";
|
|
232
|
+
assertMode(state, ["forward", "chain"]);
|
|
233
|
+
const opened = putMode(openBlock(putMode(state, "forward")), "backward");
|
|
234
|
+
const goalState = mapTop(opened, (node) => ({
|
|
235
|
+
...node,
|
|
236
|
+
context: maybeBindTerm({ ...goalContext, isBody: true }, "thesis", 0, thesisOf(props[0])),
|
|
237
|
+
goal: { props, using: [], goal: initGoal(props[0]), afterQed },
|
|
238
|
+
}));
|
|
239
|
+
return putFactsOf(isChaining ? usingFacts(goalState, theFacts(state)) : goalState, undefined);
|
|
240
|
+
};
|
|
241
|
+
|
|
242
|
+
interface Statement {
|
|
243
|
+
readonly props: readonly (readonly Term[])[];
|
|
244
|
+
readonly context: IsarContext;
|
|
245
|
+
readonly binds: readonly [string, number, Term][];
|
|
246
|
+
}
|
|
247
|
+
|
|
248
|
+
// Proof_Context.read_propp: the propositions together, then their patterns, which bind.
|
|
249
|
+
export const readStatement = (
|
|
250
|
+
context: IsarContext,
|
|
251
|
+
parts: readonly StatementPart[],
|
|
252
|
+
mode: ReadMode,
|
|
253
|
+
): Statement => {
|
|
254
|
+
const flat = parts.flatMap((part) => part.props);
|
|
255
|
+
const props = readTerms(
|
|
256
|
+
context,
|
|
257
|
+
flat.map((propp) => ({ text: propp.text })),
|
|
258
|
+
mode,
|
|
259
|
+
);
|
|
260
|
+
const propsContext = props.reduce(declareTerm, context);
|
|
261
|
+
const binds = flat.flatMap((propp, index) =>
|
|
262
|
+
propp.patterns.length === 0
|
|
263
|
+
? []
|
|
264
|
+
: simultMatches(
|
|
265
|
+
propsContext,
|
|
266
|
+
props[index],
|
|
267
|
+
readTerms(
|
|
268
|
+
propsContext,
|
|
269
|
+
propp.patterns.map((pattern) => ({ text: pattern })),
|
|
270
|
+
"pattern",
|
|
271
|
+
),
|
|
272
|
+
),
|
|
273
|
+
);
|
|
274
|
+
let offset = 0;
|
|
275
|
+
const grouped = parts.map((part) => {
|
|
276
|
+
const group = props.slice(offset, offset + part.props.length);
|
|
277
|
+
offset += part.props.length;
|
|
278
|
+
return group;
|
|
279
|
+
});
|
|
280
|
+
return {
|
|
281
|
+
props: grouped,
|
|
282
|
+
context: bindAll(propsContext, binds),
|
|
283
|
+
binds,
|
|
284
|
+
};
|
|
285
|
+
};
|
|
286
|
+
|
|
287
|
+
const bindAll = (context: IsarContext, binds: readonly [string, number, Term][]) =>
|
|
288
|
+
binds.reduce((result, bind) => bindTerm(result, ...bind), context);
|
|
289
|
+
|
|
290
|
+
// Proof.local_results: the results become named facts and the current facts.
|
|
291
|
+
const localResults = (
|
|
292
|
+
state: State,
|
|
293
|
+
parts: readonly StatementPart[],
|
|
294
|
+
results: readonly (readonly Thm[])[],
|
|
295
|
+
): State => {
|
|
296
|
+
const noted: Thm[] = [];
|
|
297
|
+
const named = parts.reduce((context, part, index) => {
|
|
298
|
+
const [declared, thms] = applyAttributes(context, part.attributes, results[index]);
|
|
299
|
+
noted.push(...thms);
|
|
300
|
+
return part.name === undefined ? declared : putFacts(declared, part.name, thms);
|
|
301
|
+
}, contextOf(state));
|
|
302
|
+
return putFactsOf(
|
|
303
|
+
mapContext(state, () => named),
|
|
304
|
+
noted,
|
|
305
|
+
);
|
|
306
|
+
};
|
|
307
|
+
|
|
308
|
+
// Proof.local_goal for have and show, whose statements are propositions only.
|
|
309
|
+
const localGoal = (state: State, parts: readonly StatementPart[], afterQed: AfterQed): State => {
|
|
310
|
+
const statement = readStatement(contextOf(state), parts, "default");
|
|
311
|
+
const props = statement.props.flat();
|
|
312
|
+
const goalContext = props.reduce(augment, statement.context);
|
|
313
|
+
return genericGoal(state, goalContext, props, (resultContext, results, outer) => {
|
|
314
|
+
const bound = mapContext(outer, (context) => bindAll(context, statement.binds));
|
|
315
|
+
const exported = results.map((result) =>
|
|
316
|
+
exportThm(resultContext, contextOf(bound), false, result),
|
|
317
|
+
);
|
|
318
|
+
let offset = 0;
|
|
319
|
+
const grouped = statement.props.map((group) => {
|
|
320
|
+
const slice = exported.slice(offset, offset + group.length);
|
|
321
|
+
offset += group.length;
|
|
322
|
+
return slice;
|
|
323
|
+
});
|
|
324
|
+
return afterQed(resultContext, results, localResults(bound, parts, grouped));
|
|
325
|
+
});
|
|
326
|
+
};
|
|
327
|
+
|
|
328
|
+
// Proof.refine_goals: the result, exported as a rule, refines some pending goal.
|
|
329
|
+
const finishGoalTac = (limits: Limits, count: number): GoalTactic =>
|
|
330
|
+
count === 0
|
|
331
|
+
? () => (state) => singleSeq(state)
|
|
332
|
+
: thenGoal(
|
|
333
|
+
normHhfTac(limits),
|
|
334
|
+
subgoal((goal, index) =>
|
|
335
|
+
isProtected(stripAssumsConcl(goal))
|
|
336
|
+
? (state: Thm) =>
|
|
337
|
+
mapsSeq(
|
|
338
|
+
finishGoalTac(limits, count - 1)(index),
|
|
339
|
+
eresolveTac(limits, [protectI])(index)(state),
|
|
340
|
+
)
|
|
341
|
+
: finishGoalTac(limits, count - 1)(index + 1),
|
|
342
|
+
),
|
|
343
|
+
);
|
|
344
|
+
|
|
345
|
+
const goalTac = (limits: Limits, rule: Thm): GoalTactic =>
|
|
346
|
+
thenGoal(
|
|
347
|
+
thenGoal(normHhfTac(limits), resolveTac(limits, [rule])),
|
|
348
|
+
finishGoalTac(limits, nprems(rule)),
|
|
349
|
+
);
|
|
350
|
+
|
|
351
|
+
const findGoalTac =
|
|
352
|
+
(tactic: GoalTactic): Tactic =>
|
|
353
|
+
(state) => {
|
|
354
|
+
const find = (index: number): Seq<Thm> =>
|
|
355
|
+
index > nprems(state) ? emptySeq : appendSeq(tactic(index)(state), find(index + 1));
|
|
356
|
+
return find(1);
|
|
357
|
+
};
|
|
358
|
+
|
|
359
|
+
const protectPrems = (thm: Thm): Thm => {
|
|
360
|
+
let result = thm;
|
|
361
|
+
for (let index = nprems(thm); index >= 1; index -= 1) {
|
|
362
|
+
const protectedResult = seqHead(
|
|
363
|
+
bicompose(
|
|
364
|
+
undefined,
|
|
365
|
+
{ flatten: false, match: false, incremented: true },
|
|
366
|
+
{ isElim: false, rule: incrIndexesThm(result.maxidx + 1, protectD), subgoals: 1 },
|
|
367
|
+
index,
|
|
368
|
+
result,
|
|
369
|
+
),
|
|
370
|
+
);
|
|
371
|
+
if (protectedResult === undefined) throw error("protect_prems");
|
|
372
|
+
result = protectedResult;
|
|
373
|
+
}
|
|
374
|
+
return result;
|
|
375
|
+
};
|
|
376
|
+
|
|
377
|
+
const refineGoals = (resultContext: IsarContext, results: readonly Thm[], state: State): State => {
|
|
378
|
+
const [, goalContext, goal] = findGoal(state);
|
|
379
|
+
const limits = goalContext.tactics.limits;
|
|
380
|
+
const rules = results.map((result) =>
|
|
381
|
+
exportThm(resultContext, goalContext, true, protectPrems(normHhf(limits, result))),
|
|
382
|
+
);
|
|
383
|
+
const refined = rules.reduce<Seq<Thm>>(
|
|
384
|
+
(states, rule) => mapsSeq(findGoalTac(goalTac(limits, rule)), states),
|
|
385
|
+
singleSeq(goal.goal),
|
|
386
|
+
);
|
|
387
|
+
return provideGoal(state, theResult(refined, "Failed to refine any pending goal"));
|
|
388
|
+
};
|
|
389
|
+
|
|
390
|
+
export const have = (state: State, parts: readonly StatementPart[]) =>
|
|
391
|
+
localGoal(state, parts, (_context, _results, result) => result);
|
|
392
|
+
|
|
393
|
+
export const show = (state: State, parts: readonly StatementPart[]) =>
|
|
394
|
+
localGoal(state, parts, refineGoals);
|
|
395
|
+
|
|
396
|
+
// Proof.chain: the current facts feed the next goal.
|
|
397
|
+
export const chain = (state: State) =>
|
|
398
|
+
putMode(putFactsOf(assertMode(state, ["forward"]), theFacts(state)), "chain");
|
|
399
|
+
|
|
400
|
+
// Calculation.update_calculation: the calculation belongs to the block at the current level.
|
|
401
|
+
const updateCalculation = (state: State, result: readonly Thm[] | undefined): State =>
|
|
402
|
+
mapContext(state, (context) => ({
|
|
403
|
+
...putFacts(context, "calculation", result),
|
|
404
|
+
calculation: result === undefined ? undefined : { result, level: state.length },
|
|
405
|
+
}));
|
|
406
|
+
|
|
407
|
+
// Calculation.moreover and ultimately: the current facts join the calculation, which ultimately
|
|
408
|
+
// passes on to the next goal.
|
|
409
|
+
export const collect = (state: State, isFinal: boolean): State => {
|
|
410
|
+
const facts = theFacts(assertMode(state, isFinal ? ["forward"] : ["forward", "chain"]));
|
|
411
|
+
const calculation = contextOf(state).calculation;
|
|
412
|
+
const previous = calculation?.level === state.length ? calculation.result : undefined;
|
|
413
|
+
if (previous === undefined && isFinal) throw error("No calculation yet");
|
|
414
|
+
const result = [...(previous ?? []), ...facts];
|
|
415
|
+
const updated = updateCalculation(state, result);
|
|
416
|
+
return isFinal
|
|
417
|
+
? putMode(putFactsOf(updateCalculation(updated, undefined), result), "chain")
|
|
418
|
+
: updated;
|
|
419
|
+
};
|
|
420
|
+
|
|
421
|
+
// Proof.assume: each group of propositions becomes hypotheses, which a named group names.
|
|
422
|
+
const assumeProps = (
|
|
423
|
+
state: State,
|
|
424
|
+
groups: readonly {
|
|
425
|
+
readonly name: string | undefined;
|
|
426
|
+
readonly attributes: readonly AttributeSource[];
|
|
427
|
+
readonly props: readonly Term[];
|
|
428
|
+
}[],
|
|
429
|
+
): State => {
|
|
430
|
+
assertMode(state, ["forward"]);
|
|
431
|
+
const props = groups.flatMap((group) => group.props);
|
|
432
|
+
const [thms, context] = addAssumptions(contextOf(state), false, props);
|
|
433
|
+
let offset = 0;
|
|
434
|
+
const noted: Thm[] = [];
|
|
435
|
+
const named = groups.reduce(
|
|
436
|
+
(current, group) => {
|
|
437
|
+
const [declared, slice] = applyAttributes(
|
|
438
|
+
current,
|
|
439
|
+
group.attributes,
|
|
440
|
+
thms.slice(offset, offset + group.props.length),
|
|
441
|
+
);
|
|
442
|
+
offset += group.props.length;
|
|
443
|
+
noted.push(...slice);
|
|
444
|
+
return group.name === undefined ? declared : putFacts(declared, group.name, slice);
|
|
445
|
+
},
|
|
446
|
+
props.reduce(declareTerm, context),
|
|
447
|
+
);
|
|
448
|
+
return putFactsOf(
|
|
449
|
+
mapContext(state, () => named),
|
|
450
|
+
noted,
|
|
451
|
+
);
|
|
452
|
+
};
|
|
453
|
+
|
|
454
|
+
export const assume = (state: State, parts: readonly StatementPart[]): State => {
|
|
455
|
+
assertMode(state, ["forward"]);
|
|
456
|
+
const statement = readStatement(contextOf(state), parts, "default");
|
|
457
|
+
return assumeProps(
|
|
458
|
+
mapContext(state, (context) => bindAll(context, statement.binds)),
|
|
459
|
+
parts.map((part, index) => ({
|
|
460
|
+
name: part.name,
|
|
461
|
+
attributes: part.attributes,
|
|
462
|
+
props: statement.props[index],
|
|
463
|
+
})),
|
|
464
|
+
);
|
|
465
|
+
};
|
|
466
|
+
|
|
467
|
+
// Proof.case: the case's fixes, under the names given, its term bindings and nested cases, then
|
|
468
|
+
// its assumptions, which the case's name names.
|
|
469
|
+
export const invokeCase = (
|
|
470
|
+
state: State,
|
|
471
|
+
binding: string | undefined,
|
|
472
|
+
name: string,
|
|
473
|
+
params: readonly (string | undefined)[],
|
|
474
|
+
): State => {
|
|
475
|
+
const context = contextOf(assertMode(state, ["forward"]));
|
|
476
|
+
const ruleCase = context.cases.get(name);
|
|
477
|
+
if (ruleCase === undefined) throw error(`Undefined case: "${name}"`);
|
|
478
|
+
if (params.length > ruleCase.fixes.length) throw error(`Too many parameters for case "${name}"`);
|
|
479
|
+
if (ruleCase.assumes.some((assumption) => assumption.props.some(hasVars)))
|
|
480
|
+
throw error(`Illegal schematic variable(s) in case "${name}"`);
|
|
481
|
+
const fixes = ruleCase.fixes.map((fix, index) => ({ ...fix, name: params[index] ?? fix.name }));
|
|
482
|
+
const fixed = addFixes(
|
|
483
|
+
{
|
|
484
|
+
...context,
|
|
485
|
+
types: new Map([...context.types, ...fixes.map((fix) => [fix.name, fix.type] as const)]),
|
|
486
|
+
},
|
|
487
|
+
fixes.map((fix) => fix.name),
|
|
488
|
+
);
|
|
489
|
+
const applied = applyCase(
|
|
490
|
+
fixes.map((fix) => mkFree(fix.name, fix.type)),
|
|
491
|
+
ruleCase,
|
|
492
|
+
);
|
|
493
|
+
const bound = applied.binds.reduce(
|
|
494
|
+
(current, bind) =>
|
|
495
|
+
maybeBindTerm(
|
|
496
|
+
current,
|
|
497
|
+
bind.name,
|
|
498
|
+
bind.index,
|
|
499
|
+
bind.term !== undefined && hasVars(bind.term) ? undefined : bind.term,
|
|
500
|
+
),
|
|
501
|
+
fixed,
|
|
502
|
+
);
|
|
503
|
+
const caseName = binding ?? name;
|
|
504
|
+
const assumed = assumeProps(
|
|
505
|
+
mapContext(state, () => updateCases(bound, applied.cases)),
|
|
506
|
+
applied.assumes.map((assumption) => ({
|
|
507
|
+
name: assumption.name === "" ? undefined : `${caseName}.${assumption.name}`,
|
|
508
|
+
attributes: [],
|
|
509
|
+
props: assumption.props,
|
|
510
|
+
})),
|
|
511
|
+
);
|
|
512
|
+
return mapContext(assumed, (current) => putFacts(current, caseName, theFacts(assumed)));
|
|
513
|
+
};
|
|
514
|
+
|
|
515
|
+
// Proof.fix: the variables are arbitrary but fixed from here on.
|
|
516
|
+
export const fix = (state: State, variables: readonly FixedVariable[]): State =>
|
|
517
|
+
putFactsOf(
|
|
518
|
+
mapContext(assertMode(state, ["forward"]), (context) => {
|
|
519
|
+
const types = new Map(context.types);
|
|
520
|
+
for (const variable of variables)
|
|
521
|
+
if (variable.type === undefined) types.delete(variable.name);
|
|
522
|
+
else types.set(variable.name, parseType(variable.type));
|
|
523
|
+
return addFixes(
|
|
524
|
+
{ ...context, types },
|
|
525
|
+
variables.map((variable) => variable.name),
|
|
526
|
+
);
|
|
527
|
+
}),
|
|
528
|
+
undefined,
|
|
529
|
+
);
|
|
530
|
+
|
|
531
|
+
export const next = (state: State): State =>
|
|
532
|
+
putFactsOf(
|
|
533
|
+
mapTop(openBlock(closeBlock(assertMode(state, ["forward"]))), (node) => ({
|
|
534
|
+
...node,
|
|
535
|
+
goal: undefined,
|
|
536
|
+
})),
|
|
537
|
+
undefined,
|
|
538
|
+
);
|
|
539
|
+
|
|
540
|
+
export const using = (state: State, facts: readonly Thm[]): State =>
|
|
541
|
+
usingFacts(assertMode(state, ["backward"]), [...findGoal(state)[2].using, ...facts]);
|
|
542
|
+
|
|
543
|
+
// Proof.unfolding: the facts unfold both the goal and the facts it uses.
|
|
544
|
+
export const unfolding = (state: State, facts: readonly Thm[]): State =>
|
|
545
|
+
mapGoal(assertMode(state, ["backward"]), (context, goal) => [
|
|
546
|
+
context,
|
|
547
|
+
{
|
|
548
|
+
...goal,
|
|
549
|
+
using: goal.using.map((thm) => unfoldRule(context.tactics, facts, thm)),
|
|
550
|
+
goal: unfoldGoals(context.tactics, facts, goal.goal),
|
|
551
|
+
},
|
|
552
|
+
]);
|
|
553
|
+
|
|
554
|
+
export const from = (state: State, facts: readonly Thm[], isWith: boolean): State =>
|
|
555
|
+
chain(
|
|
556
|
+
putFactsOf(assertMode(state, ["forward"]), isWith ? [...facts, ...theFacts(state)] : facts),
|
|
557
|
+
);
|
|
558
|
+
|
|
559
|
+
// Proof.theorem: the lemma's goal, whose result the after_qed stores.
|
|
560
|
+
export const theorem = (
|
|
561
|
+
context: IsarContext,
|
|
562
|
+
props: readonly Term[],
|
|
563
|
+
afterQed: (resultContext: IsarContext, results: readonly Thm[]) => void,
|
|
564
|
+
): State =>
|
|
565
|
+
genericGoal(
|
|
566
|
+
[{ context, facts: undefined, mode: "forward", goal: undefined }],
|
|
567
|
+
context,
|
|
568
|
+
props,
|
|
569
|
+
(resultContext, results, state) => {
|
|
570
|
+
afterQed(resultContext, results);
|
|
571
|
+
return state;
|
|
572
|
+
},
|
|
573
|
+
);
|
|
574
|
+
|
|
575
|
+
export const isFinished = (state: State) => state.length === 1;
|