tla-ts 0.0.9-dev.8298a52 → 0.0.10-dev.06b481ee0
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 +8 -0
- 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 +121 -12
- package/dist/index.d.ts +121 -12
- 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 +2746 -410
- package/dist/prove.js +2745 -409
- package/dist/run.cjs +144 -31
- package/dist/run.js +144 -31
- package/dist/tlapm.cjs +2 -2
- package/dist/tlapm.js +2 -2
- package/dist/transfer.cjs +134 -104
- package/dist/transfer.js +134 -104
- package/dist/worker.cjs +7 -7
- package/dist/worker.js +7 -7
- package/package.json +1 -1
- package/src/ast.ts +56 -60
- package/src/bags.ts +128 -110
- package/src/builtins.ts +31 -77
- package/src/bundled-modules.ts +1 -8
- package/src/check-failure.ts +118 -0
- package/src/check-trace.ts +320 -0
- package/src/check.ts +1155 -900
- package/src/cli/options.ts +12 -32
- package/src/cli/run.ts +0 -2
- package/src/cli/runtime-invariants.ts +100 -0
- package/src/cli/shared.ts +19 -12
- package/src/cli/tlapm.ts +433 -82
- package/src/cli/tlc-arguments.ts +652 -0
- package/src/cli/tlc-output.ts +701 -0
- package/src/cli/tlc-usage.ts +360 -0
- package/src/cli/tlc.ts +318 -656
- package/src/cli/typescript.ts +0 -3
- package/src/cli/xml-exporter.ts +27 -49
- package/src/cli.ts +0 -1
- package/src/codegen.ts +217 -82
- package/src/config.ts +140 -109
- package/src/coverage.ts +1019 -0
- package/src/dependencies.ts +101 -66
- package/src/dfid.ts +683 -0
- package/src/environment-config.ts +315 -0
- package/src/environment.ts +260 -371
- package/src/errors.ts +93 -58
- package/src/evaluate.ts +848 -374
- package/src/exit-codes.ts +63 -13
- package/src/fingerprints.ts +75 -11
- package/src/index.ts +3 -0
- package/src/instances.ts +97 -43
- package/src/java-hash.ts +21 -0
- package/src/java-overrides.ts +6 -21
- package/src/json-reader.ts +455 -0
- package/src/json.ts +252 -139
- package/src/levels.ts +231 -154
- package/src/lexer.ts +83 -101
- package/src/liveness-checker.ts +743 -325
- package/src/liveness.ts +224 -131
- package/src/obligations/action.ts +17 -44
- package/src/obligations/anonymize.ts +120 -95
- package/src/obligations/enabled-axioms.ts +218 -0
- package/src/obligations/equality.ts +1 -3
- package/src/obligations/expression.ts +37 -26
- package/src/obligations/format.ts +0 -10
- package/src/obligations/generate.ts +66 -64
- package/src/obligations/index.ts +39 -20
- package/src/obligations/levels.ts +27 -18
- package/src/obligations/module.ts +28 -55
- package/src/obligations/normalize.ts +31 -41
- package/src/obligations/operators.ts +0 -3
- package/src/obligations/pragma.ts +52 -24
- package/src/obligations/printer.ts +94 -63
- package/src/obligations/proof.ts +3 -6
- package/src/obligations/regroup.ts +0 -5
- package/src/obligations/simplify.ts +57 -63
- package/src/obligations/source.ts +121 -95
- package/src/obligations/subexpression.ts +49 -28
- package/src/obligations/substitution.ts +1 -5
- package/src/obligations/temporal.ts +12 -20
- package/src/obligations/tuples.ts +2 -10
- package/src/parallel-worker.ts +34 -57
- package/src/parallel.ts +62 -72
- package/src/parser.ts +1184 -531
- package/src/pcal/ast.ts +53 -86
- package/src/pcal/parse.ts +144 -219
- package/src/pcal/tokenize.ts +91 -131
- package/src/pcal/translate.ts +83 -130
- package/src/pcal/validate.ts +48 -68
- package/src/pretty-print.ts +7 -8
- package/src/prover/decide-pool.ts +8 -13
- package/src/prover/deciders.ts +12 -13
- package/src/prover/first-order.ts +0 -11
- package/src/prover/isabelle/decide.ts +3 -31
- package/src/prover/isabelle/encode.ts +82 -64
- 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 +262 -117
- package/src/prover/isabelle/isar/method.ts +510 -226
- package/src/prover/isabelle/isar/proof.ts +570 -23
- package/src/prover/isabelle/isar/rule-cases.ts +226 -0
- package/src/prover/isabelle/isar/theory.ts +488 -88
- package/src/prover/isabelle/isar/toplevel.ts +331 -0
- package/src/prover/isabelle/isar/type-check.ts +99 -38
- package/src/prover/isabelle/provers/blast/blast.ts +16 -105
- package/src/prover/isabelle/provers/blast/branch.ts +0 -33
- package/src/prover/isabelle/provers/blast/prove.ts +0 -36
- package/src/prover/isabelle/provers/blast/rules.ts +5 -45
- package/src/prover/isabelle/provers/blast/state.ts +1 -29
- package/src/prover/isabelle/provers/blast/term.ts +8 -37
- package/src/prover/isabelle/provers/clasimp.ts +1 -15
- package/src/prover/isabelle/provers/classical.ts +58 -61
- package/src/prover/isabelle/provers/hypsubst.ts +29 -54
- package/src/prover/isabelle/pure/bicompose.ts +24 -39
- package/src/prover/isabelle/pure/consts.ts +0 -8
- package/src/prover/isabelle/pure/conv.ts +2 -18
- package/src/prover/isabelle/pure/drule.ts +95 -45
- package/src/prover/isabelle/pure/envir.ts +2 -53
- package/src/prover/isabelle/pure/goal.ts +1 -9
- package/src/prover/isabelle/pure/interrupt.ts +0 -5
- package/src/prover/isabelle/pure/list.ts +0 -3
- package/src/prover/isabelle/pure/logic.ts +1 -16
- package/src/prover/isabelle/pure/name.ts +1 -10
- package/src/prover/isabelle/pure/net.ts +2 -60
- package/src/prover/isabelle/pure/object-logic.ts +15 -16
- package/src/prover/isabelle/pure/pattern.ts +1 -20
- package/src/prover/isabelle/pure/raw-simplifier.ts +16 -63
- package/src/prover/isabelle/pure/rewriter.ts +34 -77
- package/src/prover/isabelle/pure/search.ts +2 -11
- package/src/prover/isabelle/pure/seq.ts +0 -11
- package/src/prover/isabelle/pure/simplifier.ts +27 -16
- package/src/prover/isabelle/pure/table.ts +2 -33
- package/src/prover/isabelle/pure/tactic.ts +11 -23
- package/src/prover/isabelle/pure/tactical.ts +47 -48
- package/src/prover/isabelle/pure/term-ord.ts +1 -7
- package/src/prover/isabelle/pure/term.ts +4 -47
- package/src/prover/isabelle/pure/thm.ts +26 -48
- package/src/prover/isabelle/pure/type.ts +1 -16
- package/src/prover/isabelle/pure/unify.ts +19 -31
- package/src/prover/isabelle/pure/variable.ts +2 -8
- package/src/prover/isabelle/tla/classical-setup.ts +17 -25
- package/src/prover/isabelle/tla/context.ts +65 -26
- package/src/prover/isabelle/tla/logic-data.ts +1 -1
- package/src/prover/isabelle/tla/logic.ts +53 -32
- package/src/prover/isabelle/tla/simpdata.ts +45 -44
- package/src/prover/isabelle/tools/intuitionistic.ts +28 -21
- package/src/prover/ocaml.ts +4 -7
- package/src/prover/prep/action.ts +33 -66
- package/src/prover/prep/enabled-axioms.ts +22 -20
- package/src/prover/prep/fingerprint.ts +2 -21
- package/src/prover/prep/level-comparison.ts +8 -12
- package/src/prover/prep/md5.ts +26 -31
- package/src/prover/prep/methods.ts +189 -86
- package/src/prover/prep/normalize.ts +42 -37
- package/src/prover/prove-worker.ts +0 -2
- package/src/prover/prove.ts +398 -133
- package/src/prover/ptl/decide.ts +96 -56
- package/src/prover/ptl/encode.ts +15 -38
- package/src/prover/ptl/sat.ts +24 -32
- package/src/prover/ptl/tableau.ts +40 -28
- package/src/prover/smt/arithmetic.ts +310 -0
- package/src/prover/smt/axioms.ts +12 -15
- package/src/prover/smt/context.ts +60 -32
- package/src/prover/smt/data.ts +517 -401
- package/src/prover/smt/encode.ts +155 -85
- package/src/prover/smt/extensionality.ts +5 -13
- package/src/prover/smt/flatten.ts +7 -28
- package/src/prover/smt/format.ts +33 -14
- package/src/prover/smt/instances.ts +7 -11
- package/src/prover/smt/layout.ts +91 -0
- package/src/prover/smt/rewrite.ts +1021 -658
- 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 -16
- 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 +626 -56
- 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/array.ts +1 -3
- package/src/prover/smt/solver/asserted-formulas.ts +241 -99
- package/src/prover/smt/solver/ast-lt.ts +165 -21
- package/src/prover/smt/solver/ast-util.ts +160 -7
- package/src/prover/smt/solver/ast.ts +1480 -184
- package/src/prover/smt/solver/auf-solver.ts +30 -56
- 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 -10
- package/src/prover/smt/solver/cg-table.ts +39 -42
- package/src/prover/smt/solver/check-logic.ts +330 -0
- package/src/prover/smt/solver/clause.ts +0 -27
- package/src/prover/smt/solver/cofactor-elim-term-ite.ts +293 -0
- package/src/prover/smt/solver/conflict-resolution.ts +78 -11
- package/src/prover/smt/solver/context.ts +600 -187
- package/src/prover/smt/solver/ctx-simplify.ts +34 -52
- 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 +39 -30
- package/src/prover/smt/solver/diff-neq.ts +205 -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 +296 -0
- package/src/prover/smt/solver/dyn-ack.ts +0 -11
- package/src/prover/smt/solver/e-matching.ts +9 -41
- 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 +542 -0
- package/src/prover/smt/solver/enode.ts +100 -23
- 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 +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 -5
- package/src/prover/smt/solver/expr-safe-replace.ts +26 -7
- 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 -26
- package/src/prover/smt/solver/fix-dl-var.ts +147 -0
- package/src/prover/smt/solver/flat-literals.ts +0 -9
- 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 +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 +179 -28
- 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 -9
- package/src/prover/smt/solver/hashtable.ts +30 -23
- 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 +113 -133
- package/src/prover/smt/solver/lackr.ts +381 -0
- package/src/prover/smt/solver/lbool.ts +0 -2
- 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 -4
- package/src/prover/smt/solver/logic-tactics.ts +355 -0
- package/src/prover/smt/solver/lp/bound-propagator.ts +7 -26
- package/src/prover/smt/solver/lp/constraints.ts +1 -8
- package/src/prover/smt/solver/lp/containers.ts +18 -31
- package/src/prover/smt/solver/lp/core-solver.ts +35 -37
- package/src/prover/smt/solver/lp/cross-nested.ts +4 -21
- package/src/prover/smt/solver/lp/dep-intervals.ts +6 -24
- package/src/prover/smt/solver/lp/dependency.ts +0 -5
- package/src/prover/smt/solver/lp/dioph-eq.ts +8 -103
- package/src/prover/smt/solver/lp/explanation.ts +0 -6
- package/src/prover/smt/solver/lp/gomory.ts +8 -22
- package/src/prover/smt/solver/lp/hnf-cutter.ts +16 -23
- package/src/prover/smt/solver/lp/hnf.ts +10 -28
- package/src/prover/smt/solver/lp/int-cube.ts +17 -39
- package/src/prover/smt/solver/lp/int-solver.ts +3 -35
- package/src/prover/smt/solver/lp/lar-solver.ts +70 -83
- package/src/prover/smt/solver/lp/lar-term.ts +0 -5
- package/src/prover/smt/solver/lp/lp-settings.ts +6 -16
- package/src/prover/smt/solver/lp/maximize-term.ts +76 -52
- package/src/prover/smt/solver/lp/nex-creator.ts +7 -30
- package/src/prover/smt/solver/lp/nex.ts +2 -7
- package/src/prover/smt/solver/lp/nla-backoff.ts +0 -5
- package/src/prover/smt/solver/lp/nla-basics.ts +48 -30
- package/src/prover/smt/solver/lp/nla-core.ts +92 -136
- package/src/prover/smt/solver/lp/nla-divisions.ts +31 -43
- package/src/prover/smt/solver/lp/nla-emonics.ts +3 -21
- package/src/prover/smt/solver/lp/nla-factorization.ts +0 -4
- package/src/prover/smt/solver/lp/nla-grobner.ts +177 -149
- package/src/prover/smt/solver/lp/nla-horner.ts +2 -12
- package/src/prover/smt/solver/lp/nla-intervals.ts +1 -12
- package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +15 -42
- package/src/prover/smt/solver/lp/nla-monotone.ts +1 -6
- package/src/prover/smt/solver/lp/nla-order.ts +0 -13
- package/src/prover/smt/solver/lp/nla-patcher.ts +3 -7
- package/src/prover/smt/solver/lp/nla-powers.ts +220 -0
- package/src/prover/smt/solver/lp/nla-tangents.ts +0 -10
- package/src/prover/smt/solver/lp/nla-throttle.ts +0 -6
- package/src/prover/smt/solver/lp/nla-transcendentals.ts +324 -0
- package/src/prover/smt/solver/lp/nla-types.ts +0 -12
- package/src/prover/smt/solver/lp/nla-var-eqs.ts +4 -26
- package/src/prover/smt/solver/lp/nra-solver.ts +164 -147
- package/src/prover/smt/solver/lp/numeric-pair.ts +0 -4
- package/src/prover/smt/solver/lp/pdd-interval.ts +6 -5
- package/src/prover/smt/solver/lp/pdd-simplifier.ts +61 -34
- package/src/prover/smt/solver/lp/pdd-solver.ts +74 -72
- package/src/prover/smt/solver/lp/pdd.ts +730 -358
- package/src/prover/smt/solver/lp/random-updater.ts +0 -9
- package/src/prover/smt/solver/lp/static-matrix.ts +8 -19
- package/src/prover/smt/solver/lp/union-find.ts +5 -5
- package/src/prover/smt/solver/macro-finder.ts +530 -0
- package/src/prover/smt/solver/mam-compiler.ts +129 -139
- package/src/prover/smt/solver/mam-interpreter.ts +0 -21
- 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 -21
- 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 +20 -63
- package/src/prover/smt/solver/model-evaluator.ts +192 -40
- package/src/prover/smt/solver/model-finder.ts +14 -32
- package/src/prover/smt/solver/model-generator.ts +104 -46
- package/src/prover/smt/solver/model-macro-solver.ts +60 -114
- 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 +484 -0
- package/src/prover/smt/solver/nlsat/algebraic.ts +357 -236
- package/src/prover/smt/solver/nlsat/atoms.ts +73 -54
- package/src/prover/smt/solver/nlsat/evaluator.ts +16 -22
- package/src/prover/smt/solver/nlsat/explain.ts +429 -275
- package/src/prover/smt/solver/nlsat/interval-set.ts +9 -51
- package/src/prover/smt/solver/nlsat/levelwise.ts +477 -344
- package/src/prover/smt/solver/nlsat/mpbq.ts +47 -14
- package/src/prover/smt/solver/nlsat/polynomial.ts +2385 -832
- package/src/prover/smt/solver/nlsat/solver.ts +297 -156
- 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 -9
- package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +9 -51
- package/src/prover/smt/solver/nlsat/upolynomial.ts +49 -109
- package/src/prover/smt/solver/nlsat-tactic.ts +82 -0
- package/src/prover/smt/solver/nnf.ts +112 -61
- 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 +21 -26
- package/src/prover/smt/solver/pb-rewriter.ts +281 -0
- package/src/prover/smt/solver/pb2bv-tactic.ts +540 -0
- package/src/prover/smt/solver/poly-rewriter.ts +261 -79
- package/src/prover/smt/solver/probes.ts +577 -0
- package/src/prover/smt/solver/propagate-values.ts +37 -30
- package/src/prover/smt/solver/proto-model.ts +650 -66
- package/src/prover/smt/solver/pull-quant.ts +28 -23
- package/src/prover/smt/solver/purify-arith.ts +632 -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 -31
- package/src/prover/smt/solver/qe-lite-fm.ts +4 -28
- package/src/prover/smt/solver/qe-lite.ts +41 -51
- 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 -16
- 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 +17 -74
- package/src/prover/smt/solver/quantifier-analyzer.ts +26 -47
- package/src/prover/smt/solver/quantifier-manager.ts +22 -32
- package/src/prover/smt/solver/quasi-macros.ts +243 -0
- package/src/prover/smt/solver/random-gen.ts +0 -2
- package/src/prover/smt/solver/rational.ts +45 -8
- 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 -6
- package/src/prover/smt/solver/relevancy.ts +2 -16
- package/src/prover/smt/solver/rewriter-tpl.ts +59 -135
- package/src/prover/smt/solver/rewriter.ts +507 -144
- package/src/prover/smt/solver/rlimit.ts +46 -24
- 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 +579 -0
- package/src/prover/smt/solver/sat/inc-sat-solver.ts +464 -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 +53 -0
- package/src/prover/smt/solver/sat/sat2goal.ts +189 -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 +3546 -406
- package/src/prover/smt/solver/smtlib-script.ts +2134 -0
- package/src/prover/smt/solver/solve-eqs.ts +928 -0
- package/src/prover/smt/solver/solver.ts +129 -38
- package/src/prover/smt/solver/sort.ts +1 -5
- package/src/prover/smt/solver/static-features.ts +314 -0
- package/src/prover/smt/solver/sticky-generations.ts +0 -6
- package/src/prover/smt/solver/tactic.ts +2141 -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 +55 -25
- package/src/prover/smt/solver/theory-lra-bounds.ts +31 -11
- package/src/prover/smt/solver/theory-lra-final-check.ts +60 -91
- package/src/prover/smt/solver/theory-lra-internalize.ts +96 -53
- package/src/prover/smt/solver/theory-lra-model.ts +23 -53
- package/src/prover/smt/solver/theory-lra-propagate.ts +34 -42
- package/src/prover/smt/solver/theory-lra-state.ts +7 -28
- package/src/prover/smt/solver/theory-lra.ts +189 -9
- 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 +486 -0
- package/src/prover/smt/solver/var-subst.ts +37 -39
- package/src/prover/smt/table.ts +3 -10
- package/src/prover/smt/types.ts +146 -0
- package/src/prover/tlapm/cache.ts +74 -48
- package/src/prover/tlapm/ocaml-marshal.ts +19 -21
- package/src/prover/tlapm/tlapm.ts +21 -20
- package/src/prover/tlapm-library.ts +3208 -0
- package/src/prover/verdict.ts +9 -2
- package/src/prover/zenon/check/check.ts +1 -11
- package/src/prover/zenon/check/definitions.ts +5 -15
- package/src/prover/zenon/check/equality.ts +0 -8
- package/src/prover/zenon/check/functions.ts +0 -4
- package/src/prover/zenon/check/keys.ts +0 -7
- package/src/prover/zenon/check/propositional.ts +0 -3
- package/src/prover/zenon/check/records.ts +1 -6
- package/src/prover/zenon/check/relations.ts +2 -14
- package/src/prover/zenon/check/rewrites.ts +2 -21
- package/src/prover/zenon/check/sets.ts +40 -61
- package/src/prover/zenon/check/terms.ts +1 -19
- package/src/prover/zenon/check/tla.ts +0 -6
- package/src/prover/zenon/decide.ts +10 -19
- package/src/prover/zenon/encode.ts +0 -9
- package/src/prover/zenon/eqrel.ts +2 -15
- package/src/prover/zenon/equality-rules.ts +24 -6
- package/src/prover/zenon/expr.ts +29 -28
- package/src/prover/zenon/index-table.ts +33 -61
- package/src/prover/zenon/isar-case.ts +9 -21
- package/src/prover/zenon/isar.ts +37 -67
- package/src/prover/zenon/limits.ts +0 -4
- package/src/prover/zenon/llproof.ts +2 -22
- package/src/prover/zenon/mltoll.ts +66 -106
- package/src/prover/zenon/node.ts +20 -15
- package/src/prover/zenon/ocaml.ts +1 -17
- package/src/prover/zenon/parse.ts +9 -13
- package/src/prover/zenon/phrase.ts +2 -14
- package/src/prover/zenon/proof.ts +0 -11
- package/src/prover/zenon/propositional-rules.ts +0 -7
- package/src/prover/zenon/rules.ts +3 -8
- package/src/prover/zenon/search.ts +11 -35
- package/src/prover/zenon/tla/functions.ts +59 -33
- package/src/prover/zenon/tla/llproof.ts +67 -78
- package/src/prover/zenon/tla/records.ts +57 -35
- package/src/prover/zenon/tla/rewrites.ts +12 -21
- package/src/prover/zenon/tla/sets.ts +88 -59
- package/src/prover/zenon/tla/terms.ts +0 -8
- package/src/prover/zenon/tla/tla.ts +66 -66
- package/src/randomization.ts +81 -35
- package/src/resolve.ts +1132 -430
- package/src/runtime.ts +33 -23
- package/src/sany/builtins.ts +11 -14
- package/src/sany/generation.ts +383 -0
- package/src/sany/generator-def-entries.ts +210 -0
- package/src/sany/generator-definitions.ts +688 -0
- package/src/sany/generator-expressions.ts +1108 -0
- package/src/sany/generator-proofs.ts +665 -0
- package/src/sany/generator.ts +192 -2764
- package/src/sany/levels.ts +5 -35
- package/src/sany/lexer.ts +61 -80
- package/src/sany/linter.ts +0 -10
- package/src/sany/modules.ts +5 -7
- package/src/sany/nodes.ts +6 -44
- package/src/sany/parse-error.ts +39 -117
- package/src/sany/report.ts +32 -69
- package/src/sany/selectors.ts +60 -82
- package/src/sany/source.ts +1 -17
- package/src/sany/xml.ts +37 -120
- package/src/search.ts +913 -227
- package/src/simulate.ts +765 -0
- package/src/spec-description.ts +198 -104
- package/src/standard-definitions.ts +4 -4
- package/src/standard-modules.ts +302 -99
- package/src/state-graph.ts +52 -33
- package/src/subexpressions.ts +578 -166
- package/src/substitution-levels.ts +7 -7
- package/src/successors.ts +296 -105
- package/src/symmetry.ts +37 -28
- package/src/tableau.ts +29 -26
- package/src/tlc/fingerprint.ts +267 -79
- package/src/tlc/jar-data.ts +122 -6
- package/src/tlc/messages.ts +127 -56
- package/src/tlc/order.ts +53 -72
- package/src/tlc/random.ts +38 -49
- package/src/tlc/replay.ts +579 -230
- package/src/tlc/summary.ts +64 -60
- package/src/tlc/tlc-operators.ts +83 -47
- package/src/tlc/tlcext-operators.ts +205 -127
- package/src/tlc/trace-spec.ts +235 -0
- package/src/tlc/value-stream.ts +139 -0
- package/src/tlc/version.ts +1 -4
- package/src/trace-liveness.ts +529 -0
- package/src/transfer.ts +22 -25
- package/src/typed-tier.ts +6556 -0
- package/src/typescript/actions.ts +10 -25
- package/src/typescript/collections.ts +34 -35
- package/src/typescript/compile.ts +1 -8
- package/src/typescript/context.ts +0 -12
- package/src/typescript/emit.ts +0 -1
- package/src/typescript/expressions.ts +0 -12
- package/src/typescript/formula.ts +9 -15
- package/src/typescript/functions.ts +6 -17
- package/src/typescript/model.ts +14 -16
- package/src/typescript/names.ts +0 -2
- package/src/typescript/program.ts +0 -3
- package/src/typescript/properties.ts +6 -8
- package/src/typescript/scope.ts +0 -5
- package/src/typescript/steps.ts +20 -28
- package/src/typescript/types.ts +3 -10
- package/src/values.ts +917 -522
- package/src/worker.ts +7 -8
- package/src/prover/isabelle/isar/statement.ts +0 -57
- 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,15 +1,11 @@
|
|
|
1
|
-
|
|
2
|
-
// of Cambridge, Technische Universitaet Muenchen, and contributors, see LICENSE.
|
|
3
|
-
|
|
1
|
+
import type { List } from "./list";
|
|
4
2
|
import { boundName } from "./name";
|
|
5
3
|
import {
|
|
6
4
|
emptyTable,
|
|
7
5
|
fastStringOrd,
|
|
8
6
|
foldTable,
|
|
9
|
-
isEmptyTable,
|
|
10
7
|
lookupTable,
|
|
11
8
|
updateTable,
|
|
12
|
-
deleteTable,
|
|
13
9
|
type Table,
|
|
14
10
|
} from "./table";
|
|
15
11
|
import { headOf, type Term } from "./term";
|
|
@@ -33,8 +29,6 @@ export type Net<Item> =
|
|
|
33
29
|
|
|
34
30
|
export const emptyNet: Net<never> = { kind: "Leaf", items: [] };
|
|
35
31
|
|
|
36
|
-
const isEmptyNet = <Item>(net: Net<Item>) => net.kind === "Leaf" && net.items.length === 0;
|
|
37
|
-
|
|
38
32
|
const makeNode = <Item>(): Extract<Net<Item>, { kind: "Net" }> => ({
|
|
39
33
|
kind: "Net",
|
|
40
34
|
comb: emptyNet,
|
|
@@ -42,7 +36,6 @@ const makeNode = <Item>(): Extract<Net<Item>, { kind: "Net" }> => ({
|
|
|
42
36
|
atoms: emptyTable(fastStringOrd),
|
|
43
37
|
});
|
|
44
38
|
|
|
45
|
-
// Net.key_of_term: preorder keys, with any term headed by a variable or an abstraction as a Var.
|
|
46
39
|
export const keyOfTerm = (term: Term): NetKey[] => {
|
|
47
40
|
const keys: NetKey[] = [];
|
|
48
41
|
const add = (current: Term) => {
|
|
@@ -68,8 +61,6 @@ export const keyOfTerm = (term: Term): NetKey[] => {
|
|
|
68
61
|
return keys;
|
|
69
62
|
};
|
|
70
63
|
|
|
71
|
-
// Net.insert: raises nothing on a duplicate here; insert_safe semantics with eq. It walks down
|
|
72
|
-
// the keys and rebuilds the path bottom-up, so a long key list can't exhaust the stack.
|
|
73
64
|
export const insertNet = <Item>(
|
|
74
65
|
isEqual: (left: Item, right: Item) => boolean,
|
|
75
66
|
keys: readonly NetKey[],
|
|
@@ -104,56 +95,7 @@ export const insertNet = <Item>(
|
|
|
104
95
|
export const insertTermNet = <Item>(term: Term, item: Item, net: Net<Item>) =>
|
|
105
96
|
insertNet(() => false, keyOfTerm(term), item, net) ?? net;
|
|
106
97
|
|
|
107
|
-
|
|
108
|
-
isEmptyNet(node.comb) && isEmptyNet(node.var) && isEmptyTable(node.atoms) ? emptyNet : node;
|
|
109
|
-
|
|
110
|
-
// Net.delete: undefined where Isabelle raises DELETE.
|
|
111
|
-
const deleteNet = <Item>(
|
|
112
|
-
isEqual: (left: Item, right: Item) => boolean,
|
|
113
|
-
keys: readonly NetKey[],
|
|
114
|
-
item: Item,
|
|
115
|
-
net: Net<Item>,
|
|
116
|
-
): Net<Item> | undefined => {
|
|
117
|
-
const del = (position: number, node: Net<Item>): Net<Item> | undefined => {
|
|
118
|
-
if (node.kind === "Leaf") {
|
|
119
|
-
if (position < keys.length) return undefined;
|
|
120
|
-
const index = node.items.findIndex((other) => isEqual(other, item));
|
|
121
|
-
if (index === -1) return undefined;
|
|
122
|
-
return { kind: "Leaf", items: node.items.filter((other) => !isEqual(other, item)) };
|
|
123
|
-
}
|
|
124
|
-
if (position === keys.length) return undefined;
|
|
125
|
-
const key = keys[position];
|
|
126
|
-
if (key.kind === "Comb") {
|
|
127
|
-
const comb = del(position + 1, node.comb);
|
|
128
|
-
return comb && newNet({ ...node, comb });
|
|
129
|
-
}
|
|
130
|
-
if (key.kind === "Var") {
|
|
131
|
-
const child = del(position + 1, node.var);
|
|
132
|
-
return child && newNet({ ...node, var: child });
|
|
133
|
-
}
|
|
134
|
-
const existing = lookupTable(node.atoms, key.name);
|
|
135
|
-
if (existing === undefined) return undefined;
|
|
136
|
-
const child = del(position + 1, existing);
|
|
137
|
-
if (child === undefined) return undefined;
|
|
138
|
-
return newNet({
|
|
139
|
-
...node,
|
|
140
|
-
atoms: isEmptyNet(child)
|
|
141
|
-
? deleteTable(node.atoms, key.name)
|
|
142
|
-
: updateTable(node.atoms, key.name, child),
|
|
143
|
-
});
|
|
144
|
-
};
|
|
145
|
-
return del(0, net);
|
|
146
|
-
};
|
|
147
|
-
|
|
148
|
-
export const deleteTermSafe = <Item>(
|
|
149
|
-
isEqual: (left: Item, right: Item) => boolean,
|
|
150
|
-
term: Term,
|
|
151
|
-
item: Item,
|
|
152
|
-
net: Net<Item>,
|
|
153
|
-
) => deleteNet(isEqual, keyOfTerm(term), item, net) ?? net;
|
|
154
|
-
|
|
155
|
-
// The lists of nets that matching conses up, as Isabelle's lists.
|
|
156
|
-
type Nets<Item> = { readonly head: Net<Item>; readonly tail: Nets<Item> } | undefined;
|
|
98
|
+
type Nets<Item> = List<Net<Item>> | undefined;
|
|
157
99
|
|
|
158
100
|
const toArray = <Item>(nets: Nets<Item>) => {
|
|
159
101
|
const array: Net<Item>[] = [];
|
|
@@ -1,35 +1,34 @@
|
|
|
1
|
-
// Ported from Isabelle2025's Pure/Isar/object_logic.ML, atomize_prems_tac, and the CONVERSION of
|
|
2
|
-
// Pure/tactic.ML. Copyright (c) 1986-2025 University of Cambridge, Technische Universitaet
|
|
3
|
-
// Muenchen, and contributors, see LICENSE.
|
|
4
|
-
|
|
5
1
|
import { TlaIsabelleError } from "../../../errors";
|
|
6
|
-
import { gconvRule, paramsConv, premsConv } from "./conv";
|
|
2
|
+
import { fconvRule, gconvRule, paramsConv, premsConv } from "./conv";
|
|
7
3
|
import { hasMetaPrems } from "./logic";
|
|
8
|
-
import {
|
|
4
|
+
import { makeSimpContext } from "./raw-simplifier";
|
|
9
5
|
import { rewriteCterm, simpleProver } from "./rewriter";
|
|
10
6
|
import { emptySeq, singleSeq } from "./seq";
|
|
11
7
|
import type { Limits } from "./interrupt";
|
|
12
8
|
import type { GoalTactic } from "./tactical";
|
|
9
|
+
import type { Term } from "./term";
|
|
13
10
|
import { reflexive, type Thm } from "./thm";
|
|
14
11
|
|
|
15
|
-
//
|
|
16
|
-
|
|
17
|
-
|
|
18
|
-
const empty = { limits, simpset: emptySimpset, bounds: 0 };
|
|
19
|
-
const context = { ...empty, simpset: addSimps(empty, rules) };
|
|
20
|
-
// Raw_Simplifier.rewrite ctxt true: full rewriting, with a prover that proves no premises.
|
|
12
|
+
// The atomize rules apply newest first, as Object_Logic keeps them.
|
|
13
|
+
const atomizePrems = (limits: Limits, rules: readonly Thm[]) => {
|
|
14
|
+
const context = makeSimpContext(limits, rules);
|
|
21
15
|
const atomize = paramsConv(
|
|
22
16
|
premsConv((term) =>
|
|
23
17
|
rewriteCterm({ simprem: true, useprem: false, mutsimp: false }, simpleProver, context, term),
|
|
24
18
|
),
|
|
25
19
|
);
|
|
20
|
+
return (term: Term) => (hasMetaPrems(term) ? atomize(term) : reflexive(term));
|
|
21
|
+
};
|
|
22
|
+
|
|
23
|
+
export const flatRule = (limits: Limits, rules: readonly Thm[], rule: Thm) =>
|
|
24
|
+
fconvRule(premsConv(atomizePrems(limits, rules)), rule);
|
|
25
|
+
|
|
26
|
+
export const atomizePremsTac = (limits: Limits, rules: readonly Thm[]): GoalTactic => {
|
|
27
|
+
const atomize = atomizePrems(limits, rules);
|
|
26
28
|
return (index) => (state) => {
|
|
27
29
|
try {
|
|
28
|
-
return singleSeq(
|
|
29
|
-
gconvRule((term) => (hasMetaPrems(term) ? atomize(term) : reflexive(term)), index, state),
|
|
30
|
-
);
|
|
30
|
+
return singleSeq(gconvRule(atomize, index, state));
|
|
31
31
|
} catch (error) {
|
|
32
|
-
// CONVERSION fails on THM, CTERM, TERM and TYPE.
|
|
33
32
|
if (
|
|
34
33
|
error instanceof TlaIsabelleError &&
|
|
35
34
|
(error.exception === "THM" || error.exception === "TERM" || error.exception === "TYPE")
|
|
@@ -1,12 +1,6 @@
|
|
|
1
|
-
// Ported from Isabelle2025's Pure/pattern.ML and Pure/more_pattern.ML. Copyright (c) 1986-2025
|
|
2
|
-
// University of Cambridge, Technische Universitaet Muenchen, and contributors, see LICENSE.
|
|
3
|
-
//
|
|
4
|
-
// Unification and matching of higher-order patterns. Isabelle signals failure with the
|
|
5
|
-
// exceptions Unif, Pattern and MATCH; here they stay inside this module and the exported
|
|
6
|
-
// functions return undefined instead.
|
|
7
|
-
|
|
8
1
|
import { TlaIsabelleError } from "../../../errors";
|
|
9
2
|
import { aeconv, genvar, headNorm, lookup, lookup1, update, type Envir, type TEnv } from "./envir";
|
|
3
|
+
import type { Binder } from "./logic";
|
|
10
4
|
import { hasKey, indexnameOrd, updateTable } from "./table";
|
|
11
5
|
import {
|
|
12
6
|
eqTyp,
|
|
@@ -32,11 +26,6 @@ class Unif {}
|
|
|
32
26
|
class NotPattern {}
|
|
33
27
|
class Match {}
|
|
34
28
|
|
|
35
|
-
interface Binder {
|
|
36
|
-
name: string;
|
|
37
|
-
type: Typ;
|
|
38
|
-
}
|
|
39
|
-
|
|
40
29
|
const occurs = (variable: Var, term: Term, envir: Envir): boolean => {
|
|
41
30
|
const visit = (current: Term): boolean => {
|
|
42
31
|
if ((flagsOf(current) & HAS_VAR) === 0) return false;
|
|
@@ -156,7 +145,6 @@ const mkNewHnf = (
|
|
|
156
145
|
return update(variable, mkHnf(binders, indexes, fresh, args), updated);
|
|
157
146
|
};
|
|
158
147
|
|
|
159
|
-
// downto0 (is, n): whether is is [n, n - 1, ..., 0].
|
|
160
148
|
const isDownto0 = (indexes: readonly number[], count: number) =>
|
|
161
149
|
indexes.length === count + 1 && indexes.every((index, position) => index === count - position);
|
|
162
150
|
|
|
@@ -306,7 +294,6 @@ const flexflex2 = (
|
|
|
306
294
|
: assign(rightVar, rightIndexes, leftVar, leftIndexes);
|
|
307
295
|
};
|
|
308
296
|
|
|
309
|
-
// Pattern.unify_types: undefined where Isabelle raises Unif.
|
|
310
297
|
export const unifyTypesEnvir = (left: Typ, right: Typ, envir: Envir): Envir | undefined => {
|
|
311
298
|
if (eqTyp(left, right)) return envir;
|
|
312
299
|
const tyenv = unifyTypes(right, left, envir.tyenv);
|
|
@@ -420,7 +407,6 @@ type PatternUnifyResult =
|
|
|
420
407
|
| { kind: "clash" }
|
|
421
408
|
| { kind: "not a pattern" };
|
|
422
409
|
|
|
423
|
-
// Pattern.unify: distinguishes a clash (Unif) from terms outside the pattern fragment (Pattern).
|
|
424
410
|
export const unifyPattern = (left: Term, right: Term, envir: Envir): PatternUnifyResult => {
|
|
425
411
|
try {
|
|
426
412
|
return { kind: "unified", envir: unif([], left, right, envir) };
|
|
@@ -595,22 +581,18 @@ const catchMatch = (run: () => MatchEnv): MatchEnv | undefined => {
|
|
|
595
581
|
}
|
|
596
582
|
};
|
|
597
583
|
|
|
598
|
-
// Pattern.match: undefined where Isabelle raises MATCH.
|
|
599
584
|
export const matchPattern = (pattern: Term, object: Term, env: MatchEnv): MatchEnv | undefined =>
|
|
600
585
|
catchMatch(() => higherOrderMatch(pattern, object, env));
|
|
601
586
|
|
|
602
|
-
// Pattern.first_order_match
|
|
603
587
|
export const firstOrderMatchPattern = (
|
|
604
588
|
pattern: Term,
|
|
605
589
|
object: Term,
|
|
606
590
|
env: MatchEnv,
|
|
607
591
|
): MatchEnv | undefined => catchMatch(() => firstOrderMatch(pattern, object, env));
|
|
608
592
|
|
|
609
|
-
// Pattern.matches
|
|
610
593
|
export const matches = (pattern: Term, object: Term, tyenv: TyEnv, tenv: TEnv) =>
|
|
611
594
|
matchPattern(pattern, object, { tyenv, tenv }) !== undefined;
|
|
612
595
|
|
|
613
|
-
// Pattern.pattern
|
|
614
596
|
export const isPattern = (term: Term): boolean => {
|
|
615
597
|
if (term.kind === "Abs") return isPattern(term.body);
|
|
616
598
|
const [head, args] = stripComb(term);
|
|
@@ -622,7 +604,6 @@ export const isPattern = (term: Term): boolean => {
|
|
|
622
604
|
return args.every(isPattern);
|
|
623
605
|
};
|
|
624
606
|
|
|
625
|
-
// Pattern.first_order
|
|
626
607
|
export const isFirstOrder = (term: Term): boolean => {
|
|
627
608
|
if (term.kind === "Abs") return isFirstOrder(term.body);
|
|
628
609
|
if (term.kind === "App")
|
|
@@ -1,30 +1,24 @@
|
|
|
1
|
-
// Ported from Isabelle2025's Pure/raw_simplifier.ML, the simpset and its rewrite rules. Copyright
|
|
2
|
-
// (c) 1986-2025 University of Cambridge, Technische Universitaet Muenchen, and contributors, see
|
|
3
|
-
// LICENSE.
|
|
4
|
-
//
|
|
5
|
-
// Isabelle/TLA+ declares no congruence procedures, so the simpset leaves them out.
|
|
6
|
-
|
|
7
1
|
import { TlaIsabelleError } from "../../../errors";
|
|
8
|
-
import { etaContract } from "./envir";
|
|
2
|
+
import { emptyTEnv, etaContract } from "./envir";
|
|
9
3
|
import { symmetricThm } from "./drule";
|
|
10
4
|
import { destEquals, isEquals, occs, stripImpConcl, stripImpPrems } from "./logic";
|
|
11
5
|
import { emptyNet, insertNet, keyOfTerm, type Net } from "./net";
|
|
12
6
|
import { isFirstOrder, isPattern, matches } from "./pattern";
|
|
13
|
-
import { emptyTable, type Table } from "./table";
|
|
14
|
-
import { emptyTEnv } from "./envir";
|
|
7
|
+
import { emptyTable, stringOrd, type Table } from "./table";
|
|
15
8
|
import { emptyTyEnv } from "./type";
|
|
16
9
|
import {
|
|
17
10
|
aconv,
|
|
18
11
|
existsSubterm,
|
|
19
12
|
existsType,
|
|
20
13
|
foldVars,
|
|
14
|
+
eqTerm,
|
|
21
15
|
eqTyp,
|
|
22
16
|
headOf,
|
|
23
17
|
type Term,
|
|
24
18
|
type Typ,
|
|
25
19
|
type Var,
|
|
26
20
|
} from "./term";
|
|
27
|
-
import { rs, type Thm } from "./thm";
|
|
21
|
+
import { catchThm, rs, type Thm } from "./thm";
|
|
28
22
|
import { eqThmProp, noTac, type GoalTactic } from "./tactical";
|
|
29
23
|
import type { Limits } from "./interrupt";
|
|
30
24
|
|
|
@@ -75,8 +69,6 @@ export interface Simpset {
|
|
|
75
69
|
readonly safeSolvers: readonly Solver[];
|
|
76
70
|
}
|
|
77
71
|
|
|
78
|
-
// The part of an Isabelle proof context that the simplifier reads: the simpset, the time limits,
|
|
79
|
-
// and the counter that names the free variables standing for bound ones.
|
|
80
72
|
export interface SimpContext {
|
|
81
73
|
readonly limits: Limits;
|
|
82
74
|
readonly simpset: Simpset;
|
|
@@ -94,9 +86,10 @@ export const congName = (term: Term): CongName | undefined =>
|
|
|
94
86
|
? { isConst: false, name: term.name }
|
|
95
87
|
: undefined;
|
|
96
88
|
|
|
97
|
-
const varsOf = (term: Term)
|
|
89
|
+
export const varsOf = (term: Term): Var[] =>
|
|
90
|
+
foldVars((atom, result: Var[]) => [...result, atom], term, []);
|
|
98
91
|
|
|
99
|
-
const hasVar = (vars: readonly Var[], variable: Var) =>
|
|
92
|
+
export const hasVar = (vars: readonly Var[], variable: Var) =>
|
|
100
93
|
vars.some(
|
|
101
94
|
(other) =>
|
|
102
95
|
other.name === variable.name &&
|
|
@@ -116,8 +109,6 @@ const hasNewTVar = (type: Typ, keys: ReadonlySet<string>): boolean => {
|
|
|
116
109
|
return false;
|
|
117
110
|
};
|
|
118
111
|
|
|
119
|
-
// rewrite_rule_extra_vars: whether the right-hand sides have variables outside the left-hand side
|
|
120
|
-
// and the premises.
|
|
121
112
|
const rewriteRuleExtraVars = (prems: readonly Term[], elhs: Term, erhss: readonly Term[]) => {
|
|
122
113
|
const terms = [elhs, ...prems];
|
|
123
114
|
const vars = terms.flatMap(varsOf);
|
|
@@ -151,36 +142,7 @@ const vperm = (left: Term, right: Term): boolean => {
|
|
|
151
142
|
if (left.kind === "Abs" && right.kind === "Abs") return vperm(left.body, right.body);
|
|
152
143
|
if (left.kind === "App" && right.kind === "App")
|
|
153
144
|
return vperm(left.fun, right.fun) && vperm(left.arg, right.arg);
|
|
154
|
-
return
|
|
155
|
-
};
|
|
156
|
-
|
|
157
|
-
const aconvExact = (left: Term, right: Term): boolean => {
|
|
158
|
-
if (left.kind !== right.kind) return false;
|
|
159
|
-
switch (left.kind) {
|
|
160
|
-
case "Const":
|
|
161
|
-
case "Free":
|
|
162
|
-
return right.kind === left.kind && left.name === right.name && eqTyp(left.type, right.type);
|
|
163
|
-
case "Var":
|
|
164
|
-
return (
|
|
165
|
-
right.kind === "Var" &&
|
|
166
|
-
left.name === right.name &&
|
|
167
|
-
left.index === right.index &&
|
|
168
|
-
eqTyp(left.type, right.type)
|
|
169
|
-
);
|
|
170
|
-
case "Bound":
|
|
171
|
-
return right.kind === "Bound" && left.index === right.index;
|
|
172
|
-
case "Abs":
|
|
173
|
-
return (
|
|
174
|
-
right.kind === "Abs" &&
|
|
175
|
-
left.name === right.name &&
|
|
176
|
-
eqTyp(left.type, right.type) &&
|
|
177
|
-
aconvExact(left.body, right.body)
|
|
178
|
-
);
|
|
179
|
-
case "App":
|
|
180
|
-
return (
|
|
181
|
-
right.kind === "App" && aconvExact(left.fun, right.fun) && aconvExact(left.arg, right.arg)
|
|
182
|
-
);
|
|
183
|
-
}
|
|
145
|
+
return eqTerm(left, right);
|
|
184
146
|
};
|
|
185
147
|
|
|
186
148
|
const isVarPerm = (left: Term, right: Term) => {
|
|
@@ -212,7 +174,7 @@ const decompSimp = (thm: Thm): Decomposed => {
|
|
|
212
174
|
return { prems, lhs, elhs, rhs, perm };
|
|
213
175
|
};
|
|
214
176
|
|
|
215
|
-
interface RawRrule {
|
|
177
|
+
export interface RawRrule {
|
|
216
178
|
readonly thm: Thm;
|
|
217
179
|
readonly lhs: Term;
|
|
218
180
|
readonly elhs: Term;
|
|
@@ -249,7 +211,6 @@ const mkRrule = (context: SimpContext, thm: Thm): RawRrule[] => {
|
|
|
249
211
|
return rruleEqTrue(context, thm, decomposed.lhs, decomposed.elhs, decomposed.rhs, thm);
|
|
250
212
|
};
|
|
251
213
|
|
|
252
|
-
// default_reorient: catches looping rules and stupid orientations.
|
|
253
214
|
const defaultReorient = (prems: readonly Term[], lhs: Term, rhs: Term) =>
|
|
254
215
|
rewriteRuleExtraVars(prems, lhs, [rhs]) ||
|
|
255
216
|
headOf(lhs).kind === "Var" ||
|
|
@@ -264,20 +225,12 @@ const orientRrule = (context: SimpContext, thm: Thm): RawRrule[] => {
|
|
|
264
225
|
return rruleEqTrue(context, thm, decomposed.lhs, decomposed.elhs, decomposed.rhs, thm);
|
|
265
226
|
if (defaultReorient(decomposed.prems, decomposed.rhs, decomposed.lhs))
|
|
266
227
|
return mkEqTrue(context, thm);
|
|
267
|
-
const symmetric = (() =>
|
|
268
|
-
try {
|
|
269
|
-
return rs(thm, symmetricThm);
|
|
270
|
-
} catch (error) {
|
|
271
|
-
if (error instanceof TlaIsabelleError && error.exception === "THM") return undefined;
|
|
272
|
-
throw error;
|
|
273
|
-
}
|
|
274
|
-
})();
|
|
228
|
+
const symmetric = catchThm(() => rs(thm, symmetricThm));
|
|
275
229
|
if (symmetric === undefined) return [];
|
|
276
230
|
const flipped = decompSimp(symmetric);
|
|
277
231
|
return rruleEqTrue(context, symmetric, flipped.lhs, flipped.elhs, flipped.rhs, thm);
|
|
278
232
|
};
|
|
279
233
|
|
|
280
|
-
// extract_safe_rrules: the rewrite rules of an assumption, oriented to avoid loops.
|
|
281
234
|
export const extractSafeRrules = (context: SimpContext, thm: Thm): RawRrule[] =>
|
|
282
235
|
context.simpset.mkRews.mk(thm, context).flatMap((rew) => orientRrule(context, rew));
|
|
283
236
|
|
|
@@ -295,7 +248,6 @@ export const addSimps = (context: SimpContext, thms: readonly Thm[]): Simpset =>
|
|
|
295
248
|
.flatMap((rew) => mkRrule(context, rew))
|
|
296
249
|
.reduce((simpset, raw) => insertRrule(raw, simpset), context.simpset);
|
|
297
250
|
|
|
298
|
-
// mk_procrule: the rewrite rule a simplification procedure proves.
|
|
299
251
|
export const mkProcrule = (thm: Thm): Rrule[] => {
|
|
300
252
|
const decomposed = decompSimp(thm);
|
|
301
253
|
if (rewriteRuleExtraVars(decomposed.prems, decomposed.lhs, [decomposed.rhs])) return [];
|
|
@@ -307,7 +259,6 @@ export const addPrems = (thms: readonly Thm[], simpset: Simpset): Simpset => ({
|
|
|
307
259
|
prems: [...thms, ...simpset.prems],
|
|
308
260
|
});
|
|
309
261
|
|
|
310
|
-
// Rebuilds a rule net from Net.entries, as the reference simpset lists them.
|
|
311
262
|
export const rulesFromEntries = (thms: readonly Thm[]): Net<Rrule> =>
|
|
312
263
|
thms.reduceRight<Net<Rrule>>((net, thm) => {
|
|
313
264
|
const decomposed = decompSimp(thm);
|
|
@@ -315,11 +266,8 @@ export const rulesFromEntries = (thms: readonly Thm[]): Net<Rrule> =>
|
|
|
315
266
|
return insertNet(() => false, keyOfTerm(rrule.elhs), rrule, net) ?? net;
|
|
316
267
|
}, emptyNet);
|
|
317
268
|
|
|
318
|
-
export const emptyCongs: Table<string, Thm> = emptyTable(
|
|
319
|
-
left === right ? 0 : left < right ? -1 : 1,
|
|
320
|
-
);
|
|
269
|
+
export const emptyCongs: Table<string, Thm> = emptyTable(stringOrd);
|
|
321
270
|
|
|
322
|
-
// empty_ss: rewrites with meta-equalities only, and solves no subgoal.
|
|
323
271
|
export const emptySimpset: Simpset = {
|
|
324
272
|
rules: emptyNet,
|
|
325
273
|
prems: [],
|
|
@@ -336,3 +284,8 @@ export const emptySimpset: Simpset = {
|
|
|
336
284
|
unsafeSolvers: [],
|
|
337
285
|
safeSolvers: [],
|
|
338
286
|
};
|
|
287
|
+
|
|
288
|
+
export const makeSimpContext = (limits: Limits, rules: readonly Thm[]): SimpContext => {
|
|
289
|
+
const empty = { limits, simpset: emptySimpset, bounds: 0 };
|
|
290
|
+
return { ...empty, simpset: addSimps(empty, rules) };
|
|
291
|
+
};
|