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
package/src/prover/smt/data.ts
CHANGED
|
@@ -42,11 +42,15 @@ import {
|
|
|
42
42
|
SUBSET_EQ,
|
|
43
43
|
TAIL,
|
|
44
44
|
tla,
|
|
45
|
-
TRIG_EQ,
|
|
46
45
|
TT_IDV,
|
|
47
46
|
UNION,
|
|
48
47
|
} from "./format";
|
|
48
|
+
import { getUntypedSpec } from "./arithmetic";
|
|
49
|
+
import type { SmtEncoding } from "./rewrite";
|
|
49
50
|
import { axiom, type Axiom } from "./table";
|
|
51
|
+
import { getTypeKey, getTypeName, IDV, type Type } from "./types";
|
|
52
|
+
|
|
53
|
+
const SET_OF_IDV: Type = { kind: "Set", element: IDV };
|
|
50
54
|
|
|
51
55
|
export interface SymbolSpec {
|
|
52
56
|
declaration: string | undefined;
|
|
@@ -55,8 +59,11 @@ export interface SymbolSpec {
|
|
|
55
59
|
}
|
|
56
60
|
|
|
57
61
|
export interface CollectState {
|
|
62
|
+
encoding: SmtEncoding;
|
|
58
63
|
recordFields: Map<string, string[]>;
|
|
64
|
+
setTypes: Map<string, Type>;
|
|
59
65
|
strings: string[];
|
|
66
|
+
integers: string[];
|
|
60
67
|
isFunConstr: boolean;
|
|
61
68
|
isFunSet: boolean;
|
|
62
69
|
isExcept: boolean;
|
|
@@ -65,29 +72,375 @@ export interface CollectState {
|
|
|
65
72
|
anonymous: Map<string, number>;
|
|
66
73
|
}
|
|
67
74
|
|
|
75
|
+
const getOmittedDeclaration = (name: string) =>
|
|
76
|
+
`; omitted declaration of 'TLA__${name}' (second-order)`;
|
|
77
|
+
|
|
78
|
+
const getLiteralNames = (count: number) =>
|
|
79
|
+
Array.from({ length: count }, (_value, index) => `IntLit_${index + 1}`);
|
|
80
|
+
|
|
68
81
|
const SEQUENCE_DEPS = ["Mem", "Seq", "Len", "FunApp", "NatSet", "Cast_Int", "Proj_Int"];
|
|
69
82
|
|
|
83
|
+
const INT_EXP = tla("IntExp");
|
|
84
|
+
|
|
85
|
+
const SUB_SEQ_RANGE = `(${SUB_SEQ} s (${CAST_INT} x) (${CAST_INT} y))`;
|
|
86
|
+
|
|
87
|
+
const createSpec = (
|
|
88
|
+
declaration: string | undefined,
|
|
89
|
+
deps: string[],
|
|
90
|
+
axioms: Axiom[],
|
|
91
|
+
): SymbolSpec => ({ declaration, deps, axioms });
|
|
92
|
+
|
|
93
|
+
const declareSpec = (name: string, arity: number, deps: string[], axioms: Axiom[], sort = "Idv") =>
|
|
94
|
+
createSpec(declare(tla(name), arity, sort), deps, axioms);
|
|
95
|
+
|
|
96
|
+
const getSetOperationDef = (name: string, condition: string) =>
|
|
97
|
+
axiom(
|
|
98
|
+
`${name}Def`,
|
|
99
|
+
[],
|
|
100
|
+
`(forall ((a Idv) (b Idv) (x Idv)) (! (= (${MEM} x (${tla(name)} a b)) ${condition}) :pattern ((${MEM} x (${tla(name)} a b))) :pattern ((${MEM} x a) (${tla(name)} a b)) :pattern ((${MEM} x b) (${tla(name)} a b))))`,
|
|
101
|
+
);
|
|
102
|
+
|
|
103
|
+
const STATIC_SPECS = new Map(
|
|
104
|
+
Object.entries({
|
|
105
|
+
IntExp: declareSpec(
|
|
106
|
+
"IntExp",
|
|
107
|
+
2,
|
|
108
|
+
["Mem", "IntSet", "Cast_Int", "TIntLteq", "TIntLit_0", "TIntLit_1"],
|
|
109
|
+
[
|
|
110
|
+
axiom(
|
|
111
|
+
"IntExpTyping",
|
|
112
|
+
[],
|
|
113
|
+
`(forall ((x Idv) (y Idv)) (! (=> (and (${MEM} x ${INT_SET}) (${MEM} y ${INT_SET}) (${INT_LTEQ} (${CAST_INT} 0) y) (or (distinct x (${CAST_INT} 0)) (${INT_LTEQ} (${CAST_INT} 1) y))) (${MEM} (${INT_EXP} x y) ${INT_SET})) :pattern ((${INT_EXP} x y))))`,
|
|
114
|
+
),
|
|
115
|
+
],
|
|
116
|
+
),
|
|
117
|
+
Choose: createSpec(getOmittedDeclaration("Choose"), [], [axiom("ChooseDef", [], undefined)]),
|
|
118
|
+
SubsetEq: declareSpec(
|
|
119
|
+
"SubsetEq",
|
|
120
|
+
2,
|
|
121
|
+
["Mem"],
|
|
122
|
+
[
|
|
123
|
+
axiom(
|
|
124
|
+
"SubsetEqIntro",
|
|
125
|
+
[],
|
|
126
|
+
`(forall ((x Idv) (y Idv)) (! (=> (forall ((z Idv)) (=> (${MEM} z x) (${MEM} z y))) (${SUBSET_EQ} x y)) :pattern ((${SUBSET_EQ} x y))))`,
|
|
127
|
+
),
|
|
128
|
+
axiom(
|
|
129
|
+
"SubsetEqElim",
|
|
130
|
+
[],
|
|
131
|
+
`(forall ((x Idv) (y Idv) (z Idv)) (! (=> (and (${SUBSET_EQ} x y) (${MEM} z x)) (${MEM} z y)) :pattern ((${SUBSET_EQ} x y) (${MEM} z x))))`,
|
|
132
|
+
),
|
|
133
|
+
],
|
|
134
|
+
"Bool",
|
|
135
|
+
),
|
|
136
|
+
Union: declareSpec(
|
|
137
|
+
"Union",
|
|
138
|
+
1,
|
|
139
|
+
["Mem"],
|
|
140
|
+
[
|
|
141
|
+
axiom(
|
|
142
|
+
"UnionIntro",
|
|
143
|
+
[],
|
|
144
|
+
`(forall ((a Idv) (x Idv) (y Idv)) (! (=> (and (${MEM} y a) (${MEM} x y)) (${MEM} x (${UNION} a))) :pattern ((${MEM} y a) (${MEM} x (${UNION} a))) :pattern ((${MEM} x y) (${MEM} x (${UNION} a))) :pattern ((${MEM} y a) (${MEM} x y) (${UNION} a))))`,
|
|
145
|
+
),
|
|
146
|
+
axiom(
|
|
147
|
+
"UnionElim",
|
|
148
|
+
[],
|
|
149
|
+
`(forall ((a Idv) (x Idv)) (! (=> (${MEM} x (${UNION} a)) (exists ((y Idv)) (and (${MEM} y a) (${MEM} x y)))) :pattern ((${MEM} x (${UNION} a)))))`,
|
|
150
|
+
),
|
|
151
|
+
],
|
|
152
|
+
),
|
|
153
|
+
Subset: declareSpec(
|
|
154
|
+
"Subset",
|
|
155
|
+
1,
|
|
156
|
+
["Mem", "SubsetEq"],
|
|
157
|
+
[
|
|
158
|
+
axiom(
|
|
159
|
+
"SubsetDefAlt",
|
|
160
|
+
[],
|
|
161
|
+
`(forall ((a Idv) (x Idv)) (! (= (${MEM} x (${SUBSET} a)) (${SUBSET_EQ} x a)) :pattern ((${MEM} x (${SUBSET} a))) :pattern ((${SUBSET_EQ} x a) (${SUBSET} a))))`,
|
|
162
|
+
),
|
|
163
|
+
],
|
|
164
|
+
),
|
|
165
|
+
Cup: declareSpec(
|
|
166
|
+
"Cup",
|
|
167
|
+
2,
|
|
168
|
+
["Mem"],
|
|
169
|
+
[getSetOperationDef("Cup", `(or (${MEM} x a) (${MEM} x b))`)],
|
|
170
|
+
),
|
|
171
|
+
SetMinus: declareSpec(
|
|
172
|
+
"SetMinus",
|
|
173
|
+
2,
|
|
174
|
+
["Mem"],
|
|
175
|
+
[getSetOperationDef("SetMinus", `(and (${MEM} x a) (not (${MEM} x b)))`)],
|
|
176
|
+
),
|
|
177
|
+
NatSet: declareSpec(
|
|
178
|
+
"NatSet",
|
|
179
|
+
0,
|
|
180
|
+
["IntSet", "TIntLit_0", "Cast_Int", "IntLteq"],
|
|
181
|
+
[
|
|
182
|
+
axiom(
|
|
183
|
+
"NatSetDef",
|
|
184
|
+
[],
|
|
185
|
+
`(forall ((x Idv)) (! (= (${MEM} x ${NAT_SET}) (and (${MEM} x ${INT_SET}) (${INT_LTEQ} (${CAST_INT} 0) x))) :pattern ((${MEM} x ${NAT_SET}))))`,
|
|
186
|
+
),
|
|
187
|
+
],
|
|
188
|
+
),
|
|
189
|
+
IntRange: declareSpec(
|
|
190
|
+
"IntRange",
|
|
191
|
+
2,
|
|
192
|
+
["Mem", "IntSet", "IntLteq"],
|
|
193
|
+
[
|
|
194
|
+
axiom(
|
|
195
|
+
"IntRangeDef",
|
|
196
|
+
[],
|
|
197
|
+
`(forall ((a Idv) (b Idv) (x Idv)) (! (= (${MEM} x (${INT_RANGE} a b)) (and (${MEM} x ${INT_SET}) (${INT_LTEQ} a x) (${INT_LTEQ} x b))) :pattern ((${MEM} x (${INT_RANGE} a b)))))`,
|
|
198
|
+
),
|
|
199
|
+
],
|
|
200
|
+
),
|
|
201
|
+
FunIsafcn: declareSpec(
|
|
202
|
+
"FunIsafcn",
|
|
203
|
+
1,
|
|
204
|
+
["Mem", "FunDom", "FunFcn", "FunApp"],
|
|
205
|
+
[
|
|
206
|
+
axiom(
|
|
207
|
+
"FunExt",
|
|
208
|
+
[],
|
|
209
|
+
`(forall ((f Idv) (g Idv)) (! (=> (and (${FUN_ISAFCN} f) (${FUN_ISAFCN} g) (= (${FUN_DOM} f) (${FUN_DOM} g)) (forall ((x Idv)) (=> (${MEM} x (${FUN_DOM} f)) (= (${FUN_APP} f x) (${FUN_APP} g x))))) (= f g)) :pattern ((${FUN_ISAFCN} f) (${FUN_ISAFCN} g))))`,
|
|
210
|
+
),
|
|
211
|
+
],
|
|
212
|
+
"Bool",
|
|
213
|
+
),
|
|
214
|
+
FunDom: declareSpec("FunDom", 1, ["FunFcn"], [axiom("FunDomDef", [], undefined)]),
|
|
215
|
+
FunApp: declareSpec("FunApp", 2, ["Mem", "FunFcn"], [axiom("FunAppDef", [], undefined)]),
|
|
216
|
+
// tlapm labels SeqSetElim1 and SeqSetElim2 SetSetElim1 and SetSetElim2.
|
|
217
|
+
Seq: declareSpec(
|
|
218
|
+
"Seq",
|
|
219
|
+
1,
|
|
220
|
+
[
|
|
221
|
+
"Mem",
|
|
222
|
+
"Len",
|
|
223
|
+
"FunIsafcn",
|
|
224
|
+
"FunDom",
|
|
225
|
+
"FunApp",
|
|
226
|
+
"IntSet",
|
|
227
|
+
"NatSet",
|
|
228
|
+
"IntRange",
|
|
229
|
+
"Cast_Int",
|
|
230
|
+
"Proj_Int",
|
|
231
|
+
],
|
|
232
|
+
[
|
|
233
|
+
axiom(
|
|
234
|
+
"SeqSetIntro",
|
|
235
|
+
[],
|
|
236
|
+
`(forall ((a Idv) (s Idv)) (! (=> (and (${FUN_ISAFCN} s) (>= (${PROJ_INT} (${LEN} s)) 0) (forall ((i Idv)) (= (${MEM} i (${FUN_DOM} s)) (and (${MEM} i ${INT_SET}) (<= 1 (${PROJ_INT} i)) (<= (${PROJ_INT} i) (${PROJ_INT} (${LEN} s)))))) (forall ((i Int)) (=> (and (<= 1 i) (<= i (${PROJ_INT} (${LEN} s)))) (${MEM} (${FUN_APP} s (${CAST_INT} i)) a)))) (${MEM} s (${SEQ} a))) :pattern ((${MEM} s (${SEQ} a)))))`,
|
|
237
|
+
),
|
|
238
|
+
axiom(
|
|
239
|
+
"SeqSetElim1",
|
|
240
|
+
[],
|
|
241
|
+
`(forall ((a Idv) (s Idv)) (! (=> (${MEM} s (${SEQ} a)) (and (${FUN_ISAFCN} s) (${MEM} (${LEN} s) ${NAT_SET}) (= (${FUN_DOM} s) (${INT_RANGE} (${CAST_INT} 1) (${LEN} s))))) :pattern ((${MEM} s (${SEQ} a)))))`,
|
|
242
|
+
"SetSetElim1",
|
|
243
|
+
),
|
|
244
|
+
axiom(
|
|
245
|
+
"SeqSetElim2",
|
|
246
|
+
[],
|
|
247
|
+
`(forall ((a Idv) (s Idv) (i Int)) (! (=> (and (${MEM} s (${SEQ} a)) (<= 1 i) (<= i (${PROJ_INT} (${LEN} s)))) (${MEM} (${FUN_APP} s (${CAST_INT} i)) a)) :pattern ((${MEM} s (${SEQ} a)) (${FUN_APP} s (${CAST_INT} i)))))`,
|
|
248
|
+
"SetSetElim2",
|
|
249
|
+
),
|
|
250
|
+
],
|
|
251
|
+
),
|
|
252
|
+
Len: declareSpec(
|
|
253
|
+
"Len",
|
|
254
|
+
1,
|
|
255
|
+
["FunDom", "IntRange", "Cast_Int"],
|
|
256
|
+
[
|
|
257
|
+
axiom(
|
|
258
|
+
"SeqLenDef",
|
|
259
|
+
[],
|
|
260
|
+
`(forall ((s Idv) (z Int)) (=> (and (>= z 0) (= (${FUN_DOM} s) (${INT_RANGE} (${CAST_INT} 1) (${CAST_INT} z)))) (= (${LEN} s) (${CAST_INT} z))))`,
|
|
261
|
+
),
|
|
262
|
+
],
|
|
263
|
+
),
|
|
264
|
+
BSeq: declareSpec("BSeq", 1, [], []),
|
|
265
|
+
Cat: declareSpec("Cat", 2, SEQUENCE_DEPS, [
|
|
266
|
+
axiom(
|
|
267
|
+
"SeqCatTyping",
|
|
268
|
+
[],
|
|
269
|
+
`(forall ((a Idv) (s Idv) (t Idv)) (! (=> (and (${MEM} s (${SEQ} a)) (${MEM} t (${SEQ} a))) (${MEM} (${CAT} s t) (${SEQ} a))) :pattern ((${MEM} s (${SEQ} a)) (${CAT} s t)) :pattern ((${MEM} t (${SEQ} a)) (${CAT} s t))))`,
|
|
270
|
+
),
|
|
271
|
+
axiom(
|
|
272
|
+
"SeqCatLen",
|
|
273
|
+
[],
|
|
274
|
+
`(forall ((s Idv) (t Idv)) (! (=> (and (${MEM} (${LEN} s) ${NAT_SET}) (${MEM} (${LEN} t) ${NAT_SET})) (= (${LEN} (${CAT} s t)) (${CAST_INT} (+ (${PROJ_INT} (${LEN} s)) (${PROJ_INT} (${LEN} t)))))) :pattern ((${CAT} s t))))`,
|
|
275
|
+
),
|
|
276
|
+
axiom(
|
|
277
|
+
"SeqCatApp1",
|
|
278
|
+
[],
|
|
279
|
+
`(forall ((s Idv) (t Idv) (i Int)) (! (=> (and (${MEM} (${LEN} s) ${NAT_SET}) (${MEM} (${LEN} t) ${NAT_SET}) (<= 1 i) (<= i (${PROJ_INT} (${LEN} s)))) (= (${FUN_APP} (${CAT} s t) (${CAST_INT} i)) (${FUN_APP} s (${CAST_INT} i)))) :pattern ((${FUN_APP} (${CAT} s t) (${CAST_INT} i))) :pattern ((${CAT} s t) (${FUN_APP} s (${CAST_INT} i)))))`,
|
|
280
|
+
),
|
|
281
|
+
axiom(
|
|
282
|
+
"SeqCatApp2",
|
|
283
|
+
[],
|
|
284
|
+
`(forall ((s Idv) (t Idv) (i Int)) (! (=> (and (${MEM} (${LEN} s) ${NAT_SET}) (${MEM} (${LEN} t) ${NAT_SET}) (<= i (+ (${PROJ_INT} (${LEN} s)) (${PROJ_INT} (${LEN} t)))) (< (${PROJ_INT} (${LEN} s)) i)) (= (${FUN_APP} (${CAT} s t) (${CAST_INT} i)) (${FUN_APP} t (${CAST_INT} (- i (${PROJ_INT} (${LEN} s))))))) :pattern ((${FUN_APP} (${CAT} s t) (${CAST_INT} i)))))`,
|
|
285
|
+
),
|
|
286
|
+
]),
|
|
287
|
+
Append: declareSpec("Append", 2, SEQUENCE_DEPS, [
|
|
288
|
+
axiom(
|
|
289
|
+
"SeqAppendTyping",
|
|
290
|
+
[],
|
|
291
|
+
`(forall ((a Idv) (s Idv) (x Idv)) (! (=> (and (${MEM} s (${SEQ} a)) (${MEM} x a)) (${MEM} (${APPEND} s x) (${SEQ} a))) :pattern ((${MEM} s (${SEQ} a)) (${APPEND} s x))))`,
|
|
292
|
+
),
|
|
293
|
+
axiom(
|
|
294
|
+
"SeqAppendLen",
|
|
295
|
+
[],
|
|
296
|
+
`(forall ((s Idv) (x Idv)) (! (=> (${MEM} (${LEN} s) ${NAT_SET}) (= (${LEN} (${APPEND} s x)) (${CAST_INT} (+ (${PROJ_INT} (${LEN} s)) 1)))) :pattern ((${APPEND} s x))))`,
|
|
297
|
+
),
|
|
298
|
+
axiom(
|
|
299
|
+
"SeqAppendApp1",
|
|
300
|
+
[],
|
|
301
|
+
`(forall ((s Idv) (x Idv) (i Int)) (! (=> (and (${MEM} (${LEN} s) ${NAT_SET}) (<= 1 i) (<= i (${PROJ_INT} (${LEN} s)))) (= (${FUN_APP} (${APPEND} s x) (${CAST_INT} i)) (${FUN_APP} s (${CAST_INT} i)))) :pattern ((${FUN_APP} (${APPEND} s x) (${CAST_INT} i))) :pattern ((${APPEND} s x) (${FUN_APP} s (${CAST_INT} i)))))`,
|
|
302
|
+
),
|
|
303
|
+
axiom(
|
|
304
|
+
"SeqAppendApp2",
|
|
305
|
+
[],
|
|
306
|
+
`(forall ((s Idv) (x Idv)) (! (=> (${MEM} (${LEN} s) ${NAT_SET}) (= (${FUN_APP} (${APPEND} s x) (${CAST_INT} (+ (${PROJ_INT} (${LEN} s)) 1))) x)) :pattern ((${APPEND} s x))))`,
|
|
307
|
+
),
|
|
308
|
+
]),
|
|
309
|
+
Head: declareSpec(
|
|
310
|
+
"Head",
|
|
311
|
+
1,
|
|
312
|
+
["FunApp", "Cast_Int"],
|
|
313
|
+
[
|
|
314
|
+
axiom(
|
|
315
|
+
"SeqHeadDef",
|
|
316
|
+
[],
|
|
317
|
+
`(forall ((s Idv)) (! (= (${HEAD} s) (${FUN_APP} s (${CAST_INT} 1))) :pattern ((${HEAD} s))))`,
|
|
318
|
+
),
|
|
319
|
+
],
|
|
320
|
+
),
|
|
321
|
+
Tail: declareSpec("Tail", 1, SEQUENCE_DEPS, [
|
|
322
|
+
axiom(
|
|
323
|
+
"SeqTailTyping",
|
|
324
|
+
[],
|
|
325
|
+
`(forall ((a Idv) (s Idv)) (! (=> (and (${MEM} s (${SEQ} a)) (distinct (${PROJ_INT} (${LEN} s)) 0)) (${MEM} (${TAIL} s) (${SEQ} a))) :pattern ((${MEM} s (${SEQ} a)) (${TAIL} s))))`,
|
|
326
|
+
),
|
|
327
|
+
axiom(
|
|
328
|
+
"SeqTailLen",
|
|
329
|
+
[],
|
|
330
|
+
`(forall ((s Idv)) (! (=> (and (${MEM} (${LEN} s) ${NAT_SET}) (distinct (${PROJ_INT} (${LEN} s)) 0)) (= (${LEN} (${TAIL} s)) (${CAST_INT} (- (${PROJ_INT} (${LEN} s)) 1)))) :pattern ((${TAIL} s))))`,
|
|
331
|
+
),
|
|
332
|
+
axiom(
|
|
333
|
+
"SeqTailApp",
|
|
334
|
+
[],
|
|
335
|
+
`(forall ((s Idv) (i Int)) (! (=> (and (${MEM} (${LEN} s) ${NAT_SET}) (distinct (${PROJ_INT} (${LEN} s)) 0) (<= 1 i) (<= i (- (${PROJ_INT} (${LEN} s)) 1))) (= (${FUN_APP} (${TAIL} s) (${CAST_INT} i)) (${FUN_APP} s (${CAST_INT} (+ i 1))))) :pattern ((${FUN_APP} (${TAIL} s) (${CAST_INT} i)))))`,
|
|
336
|
+
),
|
|
337
|
+
]),
|
|
338
|
+
SubSeq: declareSpec(
|
|
339
|
+
"SubSeq",
|
|
340
|
+
3,
|
|
341
|
+
["Mem", "Seq", "Len", "FunApp", "IntSet", "Cast_Int", "Proj_Int"],
|
|
342
|
+
[
|
|
343
|
+
axiom(
|
|
344
|
+
"SeqSubseqTyping",
|
|
345
|
+
[],
|
|
346
|
+
`(forall ((a Idv) (s Idv) (x Int) (y Int)) (! (=> (or (< y x) (and (${MEM} s (${SEQ} a)) (<= 1 x) (<= y (${PROJ_INT} (${LEN} s))))) (${MEM} ${SUB_SEQ_RANGE} (${SEQ} a))) :pattern ((${MEM} s (${SEQ} a)) ${SUB_SEQ_RANGE})))`,
|
|
347
|
+
),
|
|
348
|
+
axiom(
|
|
349
|
+
"SeqSubseqLen",
|
|
350
|
+
[],
|
|
351
|
+
`(forall ((s Idv) (x Int) (y Int)) (! (and (=> (<= x (+ y 1)) (= (${LEN} ${SUB_SEQ_RANGE}) (${CAST_INT} (- (+ y 1) x)))) (=> (> x (+ y 1)) (= (${LEN} ${SUB_SEQ_RANGE}) (${CAST_INT} 0)))) :pattern (${SUB_SEQ_RANGE})))`,
|
|
352
|
+
),
|
|
353
|
+
axiom(
|
|
354
|
+
"SeqSubseqApp",
|
|
355
|
+
[],
|
|
356
|
+
`(forall ((s Idv) (x Int) (y Int) (z Int)) (! (=> (and (<= 1 x) (<= 1 z) (<= z (- (+ y 1) x))) (= (${FUN_APP} ${SUB_SEQ_RANGE} (${CAST_INT} z)) (${FUN_APP} s (${CAST_INT} (- (+ z x) 1))))) :pattern ((${FUN_APP} ${SUB_SEQ_RANGE} (${CAST_INT} z)))))`,
|
|
357
|
+
),
|
|
358
|
+
],
|
|
359
|
+
),
|
|
360
|
+
Cast_Int: createSpec(
|
|
361
|
+
declare(tla("Cast_Int"), 1, "Idv", "Int"),
|
|
362
|
+
["Mem", "IntSet", "Proj_Int"],
|
|
363
|
+
[
|
|
364
|
+
axiom(
|
|
365
|
+
"CastInjAlt",
|
|
366
|
+
["Int"],
|
|
367
|
+
`(forall ((x Int)) (! (= x (${PROJ_INT} (${CAST_INT} x))) :pattern ((${CAST_INT} x))))`,
|
|
368
|
+
),
|
|
369
|
+
axiom(
|
|
370
|
+
"TypeGuardIntro",
|
|
371
|
+
["Int"],
|
|
372
|
+
`(forall ((z Int)) (! (${MEM} (${CAST_INT} z) ${INT_SET}) :pattern ((${CAST_INT} z))))`,
|
|
373
|
+
),
|
|
374
|
+
axiom(
|
|
375
|
+
"TypeGuardElim",
|
|
376
|
+
["Int"],
|
|
377
|
+
`(forall ((x Idv)) (! (=> (${MEM} x ${INT_SET}) (= x (${CAST_INT} (${PROJ_INT} x)))) :pattern ((${MEM} x ${INT_SET}))))`,
|
|
378
|
+
),
|
|
379
|
+
],
|
|
380
|
+
),
|
|
381
|
+
Cast_Bool: createSpec(
|
|
382
|
+
declare(tla("Cast_Bool"), 1, "Idv", "Bool"),
|
|
383
|
+
["Mem", "BoolSet", "Tt_Idv"],
|
|
384
|
+
[
|
|
385
|
+
axiom(
|
|
386
|
+
"CastInjAlt",
|
|
387
|
+
["Bool"],
|
|
388
|
+
`(and (= (${CAST_BOOL} true) ${TT_IDV}) (distinct (${CAST_BOOL} false) ${TT_IDV}))`,
|
|
389
|
+
),
|
|
390
|
+
axiom(
|
|
391
|
+
"TypeGuardIntro",
|
|
392
|
+
["Bool"],
|
|
393
|
+
`(forall ((z Bool)) (! (${MEM} (${CAST_BOOL} z) ${BOOL_SET}) :pattern ((${CAST_BOOL} z))))`,
|
|
394
|
+
),
|
|
395
|
+
axiom(
|
|
396
|
+
"TypeGuardElim",
|
|
397
|
+
["Bool"],
|
|
398
|
+
`(forall ((x Idv)) (! (=> (${MEM} x ${BOOL_SET}) (or (= x (${CAST_BOOL} true)) (= x (${CAST_BOOL} false)))) :pattern ((${MEM} x ${BOOL_SET}))))`,
|
|
399
|
+
),
|
|
400
|
+
],
|
|
401
|
+
),
|
|
402
|
+
Proj_Int: createSpec(declare(tla("Proj_Int"), 1, "Int"), [], []),
|
|
403
|
+
SetExtTrigger: declareSpec("SetExtTrigger", 2, [], [], "Bool"),
|
|
404
|
+
IsSetOf: declareSpec("IsSetOf", 1, [], [], "Bool"),
|
|
405
|
+
BoolSet: declareSpec("BoolSet", 0, [], []),
|
|
406
|
+
StrSet: declareSpec("StrSet", 0, [], []),
|
|
407
|
+
IntSet: declareSpec("IntSet", 0, [], []),
|
|
408
|
+
Tt_Idv: declareSpec("Tt_Idv", 0, [], []),
|
|
409
|
+
TIntLteq: createSpec(undefined, ["IntLteq"], [getTyping("IntLteq")]),
|
|
410
|
+
TIntLt: createSpec(undefined, ["IntLteq"], [getTyping("IntLteq")]),
|
|
411
|
+
TIntGteq: createSpec(undefined, ["IntLteq"], [getTyping("IntLteq")]),
|
|
412
|
+
TIntGt: createSpec(undefined, ["IntLteq"], [getTyping("IntLteq")]),
|
|
413
|
+
TIntPlus: createSpec(undefined, ["IntPlus"], []),
|
|
414
|
+
TIntMinus: createSpec(undefined, ["IntMinus"], []),
|
|
415
|
+
TIntTimes: createSpec(undefined, ["IntTimes"], []),
|
|
416
|
+
TIntUminus: createSpec(undefined, ["IntUminus"], []),
|
|
417
|
+
}),
|
|
418
|
+
);
|
|
419
|
+
|
|
70
420
|
export const getSymbolSpec = (name: string, state: CollectState): SymbolSpec => {
|
|
71
|
-
const createSpec = (declaration: string | undefined, deps: string[], axioms: Axiom[]) => ({
|
|
72
|
-
declaration,
|
|
73
|
-
deps,
|
|
74
|
-
axioms,
|
|
75
|
-
});
|
|
76
421
|
const symbol = tla(name);
|
|
77
|
-
const declareSpec = (arity: number, deps: string[], axioms: Axiom[], sort = "Idv") =>
|
|
78
|
-
createSpec(declare(symbol, arity, sort), deps, axioms);
|
|
79
422
|
const enumeration = /^SetEnum_(\d+)$/.exec(name);
|
|
80
423
|
if (enumeration)
|
|
81
|
-
return declareSpec(
|
|
424
|
+
return declareSpec(
|
|
425
|
+
name,
|
|
426
|
+
Number(enumeration[1]),
|
|
427
|
+
["Mem"],
|
|
428
|
+
getEnumeration(Number(enumeration[1])),
|
|
429
|
+
);
|
|
82
430
|
const setOf = /^SetOf_(\d+)$/.exec(name);
|
|
83
431
|
if (setOf) {
|
|
84
432
|
const count = Number(setOf[1]);
|
|
433
|
+
const axioms = [
|
|
434
|
+
axiom("SetOfIntro", [count], undefined),
|
|
435
|
+
axiom("SetOfElim", [count], undefined),
|
|
436
|
+
];
|
|
437
|
+
if (!state.encoding.isSetExtensional)
|
|
438
|
+
return createSpec(getOmittedDeclaration(name), ["Mem"], axioms);
|
|
85
439
|
return createSpec(
|
|
86
|
-
|
|
440
|
+
getOmittedDeclaration(name),
|
|
87
441
|
["Mem", "IsSetOf"],
|
|
88
442
|
[
|
|
89
|
-
|
|
90
|
-
axiom("SetOfElim", [count], undefined),
|
|
443
|
+
...axioms,
|
|
91
444
|
axiom("AssertIsSetOf", [count], undefined),
|
|
92
445
|
axiom(
|
|
93
446
|
"CompareSetOfTrigger",
|
|
@@ -106,34 +459,120 @@ export const getSymbolSpec = (name: string, state: CollectState): SymbolSpec =>
|
|
|
106
459
|
);
|
|
107
460
|
state.strings.push(value);
|
|
108
461
|
return declareSpec(
|
|
462
|
+
name,
|
|
109
463
|
0,
|
|
110
464
|
["Mem", "StrSet"],
|
|
111
465
|
[axiom("StrLitIsstr", [value], `(${MEM} ${symbol} ${STR_SET})`), ...distinct],
|
|
112
466
|
);
|
|
113
467
|
}
|
|
468
|
+
const integer = /^IntLit_(\d+)$/.exec(name);
|
|
469
|
+
if (integer) {
|
|
470
|
+
const value = integer[1];
|
|
471
|
+
const distinct = state.integers.map((other) =>
|
|
472
|
+
axiom(
|
|
473
|
+
"IntLitDistinct",
|
|
474
|
+
[BigInt(other), BigInt(value)],
|
|
475
|
+
`(distinct ${tla(`IntLit_${other}`)} ${symbol})`,
|
|
476
|
+
),
|
|
477
|
+
);
|
|
478
|
+
state.integers.push(value);
|
|
479
|
+
const zero = tla("IntLit_0");
|
|
480
|
+
const isPositivityNeeded = value === "0" && !state.encoding.isArithmetic;
|
|
481
|
+
return declareSpec(
|
|
482
|
+
name,
|
|
483
|
+
0,
|
|
484
|
+
["Mem", "IntSet", "IntLit_0", "IntLteq", ...(isPositivityNeeded ? ["IntLit_1"] : [])],
|
|
485
|
+
[
|
|
486
|
+
axiom("IntLitIsint", [BigInt(value)], `(${MEM} ${symbol} ${INT_SET})`),
|
|
487
|
+
axiom(
|
|
488
|
+
"IntLitZeroCmp",
|
|
489
|
+
[BigInt(value)],
|
|
490
|
+
value === "0" ? `(${INT_LTEQ} ${symbol} ${zero})` : `(${INT_LTEQ} ${zero} ${symbol})`,
|
|
491
|
+
),
|
|
492
|
+
...distinct,
|
|
493
|
+
...(isPositivityNeeded
|
|
494
|
+
? [
|
|
495
|
+
axiom(
|
|
496
|
+
"NonNegIsPos",
|
|
497
|
+
[],
|
|
498
|
+
`(forall ((x Idv)) (! (=> (and (${INT_LTEQ} ${zero} x) (distinct ${zero} x)) (${INT_LTEQ} ${tla("IntLit_1")} x)) :pattern ((${INT_LTEQ} ${zero} x))))`,
|
|
499
|
+
),
|
|
500
|
+
]
|
|
501
|
+
: []),
|
|
502
|
+
],
|
|
503
|
+
);
|
|
504
|
+
}
|
|
114
505
|
const tuple = /^Tuple_(\d+)$/.exec(name);
|
|
115
506
|
if (tuple) {
|
|
116
507
|
const count = Number(tuple[1]);
|
|
117
508
|
state.tuples.push(count);
|
|
509
|
+
const indexes = state.encoding.isArithmetic
|
|
510
|
+
? ["Cast_Int"]
|
|
511
|
+
: count === 0
|
|
512
|
+
? ["IntLit_0"]
|
|
513
|
+
: getLiteralNames(count);
|
|
118
514
|
const deps =
|
|
119
515
|
count === 0
|
|
120
|
-
? ["FunIsafcn",
|
|
121
|
-
: ["FunIsafcn", "FunDom", "FunApp", `SetEnum_${count}`,
|
|
122
|
-
return declareSpec(
|
|
516
|
+
? ["FunIsafcn", ...indexes, "Seq", "Len"]
|
|
517
|
+
: ["FunIsafcn", "FunDom", "FunApp", `SetEnum_${count}`, ...indexes, "Mem", "Seq", "Len"];
|
|
518
|
+
return declareSpec(
|
|
519
|
+
name,
|
|
520
|
+
count,
|
|
521
|
+
deps,
|
|
522
|
+
getTupleAxioms(count, state.isExcept, state.encoding.isArithmetic),
|
|
523
|
+
);
|
|
123
524
|
}
|
|
124
525
|
const product = /^Product_(\d+)$/.exec(name);
|
|
125
526
|
if (product) {
|
|
126
527
|
const count = Number(product[1]);
|
|
127
528
|
return declareSpec(
|
|
529
|
+
name,
|
|
128
530
|
count,
|
|
129
|
-
[
|
|
130
|
-
|
|
531
|
+
[
|
|
532
|
+
"Mem",
|
|
533
|
+
`Tuple_${count}`,
|
|
534
|
+
"FunApp",
|
|
535
|
+
...(state.encoding.isArithmetic ? ["Cast_Int", "Proj_Int"] : getLiteralNames(count)),
|
|
536
|
+
],
|
|
537
|
+
getComponentSet(
|
|
538
|
+
"Product",
|
|
539
|
+
[count],
|
|
540
|
+
symbol,
|
|
541
|
+
tla(`Tuple_${count}`),
|
|
542
|
+
getIntegers(count, state.encoding.isArithmetic),
|
|
543
|
+
"t",
|
|
544
|
+
),
|
|
545
|
+
);
|
|
546
|
+
}
|
|
547
|
+
if (name.startsWith("TrigEq_")) {
|
|
548
|
+
const type = state.setTypes.get(name) ?? SET_OF_IDV;
|
|
549
|
+
const element = type.kind === "Set" ? type.element : IDV;
|
|
550
|
+
return declareSpec(
|
|
551
|
+
name,
|
|
552
|
+
2,
|
|
553
|
+
["SetExtTrigger"],
|
|
554
|
+
[
|
|
555
|
+
axiom(
|
|
556
|
+
"ExtTrigEqDef",
|
|
557
|
+
[getTypeKey(type)],
|
|
558
|
+
`(forall ((x Idv) (y Idv)) (! (= (${symbol} x y) (= x y)) :pattern ((${symbol} x y))))`,
|
|
559
|
+
`ExtTrigEqDef ${getTypeName(type)}`,
|
|
560
|
+
),
|
|
561
|
+
axiom(
|
|
562
|
+
"ExtTrigEqTrigger",
|
|
563
|
+
[getTypeKey(element)],
|
|
564
|
+
`(forall ((x Idv) (y Idv)) (! (${SET_EXT_TRIGGER} x y) :pattern ((${symbol} x y))))`,
|
|
565
|
+
`ExtTrigEqTrigger ${getTypeName(element)}`,
|
|
566
|
+
),
|
|
567
|
+
],
|
|
568
|
+
"Bool",
|
|
131
569
|
);
|
|
132
570
|
}
|
|
133
571
|
const fields = state.recordFields.get(name);
|
|
134
572
|
if (fields && name.startsWith("Record_")) {
|
|
135
573
|
state.records.push(fields);
|
|
136
574
|
return declareSpec(
|
|
575
|
+
name,
|
|
137
576
|
fields.length,
|
|
138
577
|
[
|
|
139
578
|
"FunIsafcn",
|
|
@@ -148,37 +587,31 @@ export const getSymbolSpec = (name: string, state: CollectState): SymbolSpec =>
|
|
|
148
587
|
if (fields && name.startsWith("RecordSet_")) {
|
|
149
588
|
const record = `Record_${fields.join("_")}`;
|
|
150
589
|
return declareSpec(
|
|
590
|
+
name,
|
|
151
591
|
fields.length,
|
|
152
592
|
["Mem", record, "FunApp", ...fields.map((field) => `StrLit_${field}`)],
|
|
153
593
|
getComponentSet("RecSet", [fields], symbol, tla(record), getFieldKeys(fields), "r"),
|
|
154
594
|
);
|
|
155
595
|
}
|
|
156
596
|
const anonymous = state.anonymous.get(name);
|
|
157
|
-
if (anonymous !== undefined) return declareSpec(anonymous, [], []);
|
|
597
|
+
if (anonymous !== undefined) return declareSpec(name, anonymous, [], []);
|
|
598
|
+
const untyped = state.encoding.isArithmetic ? undefined : getUntypedSpec(name);
|
|
599
|
+
if (untyped) return untyped;
|
|
600
|
+
const known = STATIC_SPECS.get(name);
|
|
601
|
+
if (known) return known;
|
|
158
602
|
const typed = TYPED_OPERATORS[name];
|
|
159
603
|
if (typed)
|
|
160
604
|
return declareSpec(
|
|
605
|
+
name,
|
|
161
606
|
typed[1],
|
|
162
607
|
["Cast_Int"],
|
|
163
608
|
[getTyping(name)],
|
|
164
609
|
name === "IntLteq" ? "Bool" : "Idv",
|
|
165
610
|
);
|
|
166
611
|
switch (name) {
|
|
167
|
-
case "IntExp":
|
|
168
|
-
return declareSpec(
|
|
169
|
-
2,
|
|
170
|
-
["Mem", "IntSet", "Cast_Int", "TIntLteq", "TIntLit_0", "TIntLit_1"],
|
|
171
|
-
[
|
|
172
|
-
axiom(
|
|
173
|
-
"IntExpTyping",
|
|
174
|
-
[],
|
|
175
|
-
`(forall ((x Idv) (y Idv)) (! (=> (and (${MEM} x ${INT_SET}) (${MEM} y ${INT_SET}) (or (distinct x (${CAST_INT} 0)) (${INT_LTEQ} (${CAST_INT} 1) y))) (${MEM} (${symbol} x y) ${INT_SET})) :pattern ((${symbol} x y))))`,
|
|
176
|
-
),
|
|
177
|
-
],
|
|
178
|
-
);
|
|
179
612
|
case "SelectSeq":
|
|
180
613
|
return createSpec(
|
|
181
|
-
|
|
614
|
+
getOmittedDeclaration(name),
|
|
182
615
|
[
|
|
183
616
|
"Mem",
|
|
184
617
|
"Seq",
|
|
@@ -189,7 +622,7 @@ export const getSymbolSpec = (name: string, state: CollectState): SymbolSpec =>
|
|
|
189
622
|
"IntSet",
|
|
190
623
|
"NatSet",
|
|
191
624
|
"Tuple_0",
|
|
192
|
-
"Proj_Int",
|
|
625
|
+
state.encoding.isArithmetic ? "Proj_Int" : "IntLteq",
|
|
193
626
|
],
|
|
194
627
|
[
|
|
195
628
|
axiom("SeqSelectseqTyping", [], undefined),
|
|
@@ -199,142 +632,55 @@ export const getSymbolSpec = (name: string, state: CollectState): SymbolSpec =>
|
|
|
199
632
|
axiom("SeqSelectseqAppend", [], undefined),
|
|
200
633
|
],
|
|
201
634
|
);
|
|
202
|
-
case "Choose":
|
|
203
|
-
return createSpec(undefined, [], [axiom("ChooseDef", [], undefined)]);
|
|
204
635
|
case "Mem":
|
|
205
636
|
return declareSpec(
|
|
637
|
+
name,
|
|
206
638
|
2,
|
|
207
|
-
["SetExtTrigger"],
|
|
208
|
-
|
|
209
|
-
|
|
210
|
-
|
|
211
|
-
|
|
212
|
-
|
|
213
|
-
|
|
214
|
-
|
|
639
|
+
state.encoding.isSetExtensional ? ["SetExtTrigger"] : [],
|
|
640
|
+
state.encoding.isSetExtensional
|
|
641
|
+
? [
|
|
642
|
+
axiom(
|
|
643
|
+
"SetExt",
|
|
644
|
+
[],
|
|
645
|
+
`(forall ((x Idv) (y Idv)) (! (=> (forall ((z Idv)) (= (${MEM} z x) (${MEM} z y))) (= x y)) :pattern ((${SET_EXT_TRIGGER} x y))))`,
|
|
646
|
+
),
|
|
647
|
+
]
|
|
648
|
+
: [],
|
|
215
649
|
"Bool",
|
|
216
650
|
);
|
|
217
|
-
case "SubsetEq":
|
|
218
|
-
return declareSpec(
|
|
219
|
-
2,
|
|
220
|
-
["Mem"],
|
|
221
|
-
[
|
|
222
|
-
axiom(
|
|
223
|
-
"SubsetEqIntro",
|
|
224
|
-
[],
|
|
225
|
-
`(forall ((x Idv) (y Idv)) (! (=> (forall ((z Idv)) (=> (${MEM} z x) (${MEM} z y))) (${SUBSET_EQ} x y)) :pattern ((${SUBSET_EQ} x y))))`,
|
|
226
|
-
),
|
|
227
|
-
axiom(
|
|
228
|
-
"SubsetEqElim",
|
|
229
|
-
[],
|
|
230
|
-
`(forall ((x Idv) (y Idv) (z Idv)) (! (=> (and (${SUBSET_EQ} x y) (${MEM} z x)) (${MEM} z y)) :pattern ((${SUBSET_EQ} x y) (${MEM} z x))))`,
|
|
231
|
-
),
|
|
232
|
-
],
|
|
233
|
-
"Bool",
|
|
234
|
-
);
|
|
235
|
-
case "Union":
|
|
236
|
-
return declareSpec(
|
|
237
|
-
1,
|
|
238
|
-
["Mem"],
|
|
239
|
-
[
|
|
240
|
-
axiom(
|
|
241
|
-
"UnionIntro",
|
|
242
|
-
[],
|
|
243
|
-
`(forall ((a Idv) (x Idv) (y Idv)) (! (=> (and (${MEM} y a) (${MEM} x y)) (${MEM} x (${UNION} a))) :pattern ((${MEM} y a) (${MEM} x (${UNION} a))) :pattern ((${MEM} x y) (${MEM} x (${UNION} a))) :pattern ((${MEM} y a) (${MEM} x y) (${UNION} a))))`,
|
|
244
|
-
),
|
|
245
|
-
axiom(
|
|
246
|
-
"UnionElim",
|
|
247
|
-
[],
|
|
248
|
-
`(forall ((a Idv) (x Idv)) (! (=> (${MEM} x (${UNION} a)) (exists ((y Idv)) (and (${MEM} y a) (${MEM} x y)))) :pattern ((${MEM} x (${UNION} a)))))`,
|
|
249
|
-
),
|
|
250
|
-
],
|
|
251
|
-
);
|
|
252
|
-
case "Subset":
|
|
253
|
-
return declareSpec(
|
|
254
|
-
1,
|
|
255
|
-
["Mem", "SubsetEq"],
|
|
256
|
-
[
|
|
257
|
-
axiom(
|
|
258
|
-
"SubsetDefAlt",
|
|
259
|
-
[],
|
|
260
|
-
`(forall ((a Idv) (x Idv)) (! (= (${MEM} x (${SUBSET} a)) (${SUBSET_EQ} x a)) :pattern ((${MEM} x (${SUBSET} a))) :pattern ((${SUBSET_EQ} x a) (${SUBSET} a))))`,
|
|
261
|
-
),
|
|
262
|
-
],
|
|
263
|
-
);
|
|
264
|
-
case "Cup":
|
|
265
651
|
case "Cap":
|
|
266
|
-
case "SetMinus": {
|
|
267
|
-
const condition =
|
|
268
|
-
name === "Cup"
|
|
269
|
-
? "(or (MEM x a) (MEM x b))"
|
|
270
|
-
: name === "Cap"
|
|
271
|
-
? "(and (MEM x a) (MEM x b))"
|
|
272
|
-
: "(and (MEM x a) (not (MEM x b)))";
|
|
273
|
-
const definition = axiom(
|
|
274
|
-
`${name}Def`,
|
|
275
|
-
[],
|
|
276
|
-
`(forall ((a Idv) (b Idv) (x Idv)) (! (= (${MEM} x (${symbol} a b)) ${condition.replaceAll("MEM", MEM)}) :pattern ((${MEM} x (${symbol} a b))) :pattern ((${MEM} x a) (${symbol} a b)) :pattern ((${MEM} x b) (${symbol} a b))))`,
|
|
277
|
-
);
|
|
278
|
-
if (name !== "Cap") return declareSpec(2, ["Mem"], [definition]);
|
|
279
652
|
return declareSpec(
|
|
653
|
+
name,
|
|
280
654
|
2,
|
|
281
|
-
["Mem", "SetEnum_0", "SetExtTrigger"],
|
|
655
|
+
["Mem", ...(state.encoding.isSetExtensional ? ["SetEnum_0", "SetExtTrigger"] : [])],
|
|
282
656
|
[
|
|
283
|
-
|
|
284
|
-
|
|
285
|
-
|
|
286
|
-
|
|
287
|
-
|
|
288
|
-
|
|
657
|
+
getSetOperationDef("Cap", `(and (${MEM} x a) (${MEM} x b))`),
|
|
658
|
+
...(state.encoding.isSetExtensional
|
|
659
|
+
? [
|
|
660
|
+
axiom(
|
|
661
|
+
"DisjointTrigger",
|
|
662
|
+
[],
|
|
663
|
+
`(forall ((x Idv) (y Idv)) (! (${SET_EXT_TRIGGER} (${CAP} x y) ${tla("SetEnum_0")}) :pattern ((${CAP} x y))))`,
|
|
664
|
+
),
|
|
665
|
+
]
|
|
666
|
+
: []),
|
|
289
667
|
],
|
|
290
668
|
);
|
|
291
|
-
}
|
|
292
669
|
case "SetSt":
|
|
293
670
|
return createSpec(
|
|
294
|
-
|
|
295
|
-
["Mem", "SetEnum_0", "SetExtTrigger"],
|
|
296
|
-
[axiom("SetStDef", [], undefined), axiom("EmptyComprehensionTrigger", [], undefined)],
|
|
297
|
-
);
|
|
298
|
-
case "NatSet":
|
|
299
|
-
return declareSpec(
|
|
300
|
-
0,
|
|
301
|
-
["IntSet", "TIntLit_0", "Cast_Int", "IntLteq"],
|
|
302
|
-
[
|
|
303
|
-
axiom(
|
|
304
|
-
"NatSetDef",
|
|
305
|
-
[],
|
|
306
|
-
`(forall ((x Idv)) (! (= (${MEM} x ${NAT_SET}) (and (${MEM} x ${INT_SET}) (${INT_LTEQ} (${CAST_INT} 0) x))) :pattern ((${MEM} x ${NAT_SET}))))`,
|
|
307
|
-
),
|
|
308
|
-
],
|
|
309
|
-
);
|
|
310
|
-
case "IntRange":
|
|
311
|
-
return declareSpec(
|
|
312
|
-
2,
|
|
313
|
-
["Mem", "IntSet", "IntLteq"],
|
|
671
|
+
getOmittedDeclaration(name),
|
|
672
|
+
["Mem", ...(state.encoding.isSetExtensional ? ["SetEnum_0", "SetExtTrigger"] : [])],
|
|
314
673
|
[
|
|
315
|
-
axiom(
|
|
316
|
-
|
|
317
|
-
[],
|
|
318
|
-
|
|
319
|
-
),
|
|
674
|
+
axiom("SetStDef", [], undefined),
|
|
675
|
+
...(state.encoding.isSetExtensional
|
|
676
|
+
? [axiom("EmptyComprehensionTrigger", [], undefined)]
|
|
677
|
+
: []),
|
|
320
678
|
],
|
|
321
679
|
);
|
|
322
|
-
case "FunIsafcn":
|
|
323
|
-
return declareSpec(
|
|
324
|
-
1,
|
|
325
|
-
["Mem", "FunDom", "FunFcn", "FunApp"],
|
|
326
|
-
[
|
|
327
|
-
axiom(
|
|
328
|
-
"FunExt",
|
|
329
|
-
[],
|
|
330
|
-
`(forall ((f Idv) (g Idv)) (! (=> (and (${FUN_ISAFCN} f) (${FUN_ISAFCN} g) (= (${FUN_DOM} f) (${FUN_DOM} g)) (forall ((x Idv)) (=> (${MEM} x (${FUN_DOM} f)) (= (${FUN_APP} f x) (${FUN_APP} g x))))) (= f g)) :pattern ((${FUN_ISAFCN} f) (${FUN_ISAFCN} g))))`,
|
|
331
|
-
),
|
|
332
|
-
],
|
|
333
|
-
"Bool",
|
|
334
|
-
);
|
|
335
680
|
case "FunSet":
|
|
336
681
|
state.isFunSet = true;
|
|
337
682
|
return declareSpec(
|
|
683
|
+
name,
|
|
338
684
|
2,
|
|
339
685
|
["Mem", "FunIsafcn", "FunDom", "FunApp"],
|
|
340
686
|
[
|
|
@@ -359,21 +705,18 @@ export const getSymbolSpec = (name: string, state: CollectState): SymbolSpec =>
|
|
|
359
705
|
case "FunFcn":
|
|
360
706
|
state.isFunConstr = true;
|
|
361
707
|
return createSpec(
|
|
362
|
-
|
|
708
|
+
getOmittedDeclaration(name),
|
|
363
709
|
["FunIsafcn"],
|
|
364
710
|
[
|
|
365
711
|
axiom("FunConstrIsafcn", [], undefined),
|
|
366
712
|
...(state.isFunSet ? [axiom("FunTyping", [], undefined)] : []),
|
|
367
713
|
],
|
|
368
714
|
);
|
|
369
|
-
case "FunDom":
|
|
370
|
-
return declareSpec(1, ["FunFcn"], [axiom("FunDomDef", [], undefined)]);
|
|
371
|
-
case "FunApp":
|
|
372
|
-
return declareSpec(2, ["Mem", "FunFcn"], [axiom("FunAppDef", [], undefined)]);
|
|
373
715
|
case "FunExcept": {
|
|
374
716
|
state.isExcept = true;
|
|
375
717
|
const updated = `(${FUN_EXCEPT} f x y)`;
|
|
376
718
|
return declareSpec(
|
|
719
|
+
name,
|
|
377
720
|
3,
|
|
378
721
|
["Mem", "FunIsafcn", "FunDom", "FunApp"],
|
|
379
722
|
[
|
|
@@ -397,235 +740,11 @@ export const getSymbolSpec = (name: string, state: CollectState): SymbolSpec =>
|
|
|
397
740
|
[],
|
|
398
741
|
`(forall ((f Idv) (x Idv) (y Idv) (z Idv)) (! (=> (${MEM} z (${FUN_DOM} f)) (and (=> (= z x) (= (${FUN_APP} ${updated} z) y)) (=> (distinct z x) (= (${FUN_APP} ${updated} z) (${FUN_APP} f z))))) :pattern ((${FUN_APP} ${updated} z)) :pattern (${updated} (${FUN_APP} f z))))`,
|
|
399
742
|
),
|
|
400
|
-
...state.tuples.flatMap(getTupleExcepts),
|
|
743
|
+
...state.tuples.flatMap((count) => getTupleExcepts(count, state.encoding.isArithmetic)),
|
|
401
744
|
...state.records.flatMap(getRecordExcepts),
|
|
402
745
|
],
|
|
403
746
|
);
|
|
404
747
|
}
|
|
405
|
-
// tlapm labels SeqSetElim1 and SeqSetElim2 SetSetElim1 and SetSetElim2.
|
|
406
|
-
case "Seq":
|
|
407
|
-
return declareSpec(
|
|
408
|
-
1,
|
|
409
|
-
[
|
|
410
|
-
"Mem",
|
|
411
|
-
"Len",
|
|
412
|
-
"FunIsafcn",
|
|
413
|
-
"FunDom",
|
|
414
|
-
"FunApp",
|
|
415
|
-
"IntSet",
|
|
416
|
-
"NatSet",
|
|
417
|
-
"IntRange",
|
|
418
|
-
"Cast_Int",
|
|
419
|
-
"Proj_Int",
|
|
420
|
-
],
|
|
421
|
-
[
|
|
422
|
-
axiom(
|
|
423
|
-
"SeqSetIntro",
|
|
424
|
-
[],
|
|
425
|
-
`(forall ((a Idv) (s Idv)) (! (=> (and (${FUN_ISAFCN} s) (>= (${PROJ_INT} (${LEN} s)) 0) (forall ((i Idv)) (= (${MEM} i (${FUN_DOM} s)) (and (${MEM} i ${INT_SET}) (<= 1 (${PROJ_INT} i)) (<= (${PROJ_INT} i) (${PROJ_INT} (${LEN} s)))))) (forall ((i Int)) (=> (and (<= 1 i) (<= i (${PROJ_INT} (${LEN} s)))) (${MEM} (${FUN_APP} s (${CAST_INT} i)) a)))) (${MEM} s (${SEQ} a))) :pattern ((${MEM} s (${SEQ} a)))))`,
|
|
426
|
-
),
|
|
427
|
-
axiom(
|
|
428
|
-
"SeqSetElim1",
|
|
429
|
-
[],
|
|
430
|
-
`(forall ((a Idv) (s Idv)) (! (=> (${MEM} s (${SEQ} a)) (and (${FUN_ISAFCN} s) (${MEM} (${LEN} s) ${NAT_SET}) (= (${FUN_DOM} s) (${INT_RANGE} (${CAST_INT} 1) (${LEN} s))))) :pattern ((${MEM} s (${SEQ} a)))))`,
|
|
431
|
-
"SetSetElim1",
|
|
432
|
-
),
|
|
433
|
-
axiom(
|
|
434
|
-
"SeqSetElim2",
|
|
435
|
-
[],
|
|
436
|
-
`(forall ((a Idv) (s Idv) (i Int)) (! (=> (and (${MEM} s (${SEQ} a)) (<= 1 i) (<= i (${PROJ_INT} (${LEN} s)))) (${MEM} (${FUN_APP} s (${CAST_INT} i)) a)) :pattern ((${MEM} s (${SEQ} a)) (${FUN_APP} s (${CAST_INT} i)))))`,
|
|
437
|
-
"SetSetElim2",
|
|
438
|
-
),
|
|
439
|
-
],
|
|
440
|
-
);
|
|
441
|
-
case "Len":
|
|
442
|
-
return declareSpec(
|
|
443
|
-
1,
|
|
444
|
-
["FunDom", "IntRange", "Cast_Int"],
|
|
445
|
-
[
|
|
446
|
-
axiom(
|
|
447
|
-
"SeqLenDef",
|
|
448
|
-
[],
|
|
449
|
-
`(forall ((s Idv) (z Int)) (=> (and (>= z 0) (= (${FUN_DOM} s) (${INT_RANGE} (${CAST_INT} 1) (${CAST_INT} z)))) (= (${LEN} s) (${CAST_INT} z))))`,
|
|
450
|
-
),
|
|
451
|
-
],
|
|
452
|
-
);
|
|
453
|
-
case "BSeq":
|
|
454
|
-
return declareSpec(1, [], []);
|
|
455
|
-
case "Cat":
|
|
456
|
-
return declareSpec(2, SEQUENCE_DEPS, [
|
|
457
|
-
axiom(
|
|
458
|
-
"SeqCatTyping",
|
|
459
|
-
[],
|
|
460
|
-
`(forall ((a Idv) (s Idv) (t Idv)) (! (=> (and (${MEM} s (${SEQ} a)) (${MEM} t (${SEQ} a))) (${MEM} (${CAT} s t) (${SEQ} a))) :pattern ((${MEM} s (${SEQ} a)) (${CAT} s t)) :pattern ((${MEM} t (${SEQ} a)) (${CAT} s t))))`,
|
|
461
|
-
),
|
|
462
|
-
axiom(
|
|
463
|
-
"SeqCatLen",
|
|
464
|
-
[],
|
|
465
|
-
`(forall ((s Idv) (t Idv)) (! (=> (and (${MEM} (${LEN} s) ${NAT_SET}) (${MEM} (${LEN} t) ${NAT_SET})) (= (${LEN} (${CAT} s t)) (${CAST_INT} (+ (${PROJ_INT} (${LEN} s)) (${PROJ_INT} (${LEN} t)))))) :pattern ((${CAT} s t))))`,
|
|
466
|
-
),
|
|
467
|
-
axiom(
|
|
468
|
-
"SeqCatApp1",
|
|
469
|
-
[],
|
|
470
|
-
`(forall ((s Idv) (t Idv) (i Int)) (! (=> (and (${MEM} (${LEN} s) ${NAT_SET}) (${MEM} (${LEN} t) ${NAT_SET}) (<= 1 i) (<= i (${PROJ_INT} (${LEN} s)))) (= (${FUN_APP} (${CAT} s t) (${CAST_INT} i)) (${FUN_APP} s (${CAST_INT} i)))) :pattern ((${FUN_APP} (${CAT} s t) (${CAST_INT} i))) :pattern ((${CAT} s t) (${FUN_APP} s (${CAST_INT} i)))))`,
|
|
471
|
-
),
|
|
472
|
-
axiom(
|
|
473
|
-
"SeqCatApp2",
|
|
474
|
-
[],
|
|
475
|
-
`(forall ((s Idv) (t Idv) (i Int)) (! (=> (and (${MEM} (${LEN} s) ${NAT_SET}) (${MEM} (${LEN} t) ${NAT_SET}) (<= i (+ (${PROJ_INT} (${LEN} s)) (${PROJ_INT} (${LEN} t)))) (< (${PROJ_INT} (${LEN} s)) i)) (= (${FUN_APP} (${CAT} s t) (${CAST_INT} i)) (${FUN_APP} t (${CAST_INT} (- i (${PROJ_INT} (${LEN} s))))))) :pattern ((${FUN_APP} (${CAT} s t) (${CAST_INT} i)))))`,
|
|
476
|
-
),
|
|
477
|
-
]);
|
|
478
|
-
case "Append":
|
|
479
|
-
return declareSpec(2, SEQUENCE_DEPS, [
|
|
480
|
-
axiom(
|
|
481
|
-
"SeqAppendTyping",
|
|
482
|
-
[],
|
|
483
|
-
`(forall ((a Idv) (s Idv) (x Idv)) (! (=> (and (${MEM} s (${SEQ} a)) (${MEM} x a)) (${MEM} (${APPEND} s x) (${SEQ} a))) :pattern ((${MEM} s (${SEQ} a)) (${APPEND} s x))))`,
|
|
484
|
-
),
|
|
485
|
-
axiom(
|
|
486
|
-
"SeqAppendLen",
|
|
487
|
-
[],
|
|
488
|
-
`(forall ((s Idv) (x Idv)) (! (=> (${MEM} (${LEN} s) ${NAT_SET}) (= (${LEN} (${APPEND} s x)) (${CAST_INT} (+ (${PROJ_INT} (${LEN} s)) 1)))) :pattern ((${APPEND} s x))))`,
|
|
489
|
-
),
|
|
490
|
-
axiom(
|
|
491
|
-
"SeqAppendApp1",
|
|
492
|
-
[],
|
|
493
|
-
`(forall ((s Idv) (x Idv) (i Int)) (! (=> (and (${MEM} (${LEN} s) ${NAT_SET}) (<= 1 i) (<= i (${PROJ_INT} (${LEN} s)))) (= (${FUN_APP} (${APPEND} s x) (${CAST_INT} i)) (${FUN_APP} s (${CAST_INT} i)))) :pattern ((${FUN_APP} (${APPEND} s x) (${CAST_INT} i))) :pattern ((${APPEND} s x) (${FUN_APP} s (${CAST_INT} i)))))`,
|
|
494
|
-
),
|
|
495
|
-
axiom(
|
|
496
|
-
"SeqAppendApp2",
|
|
497
|
-
[],
|
|
498
|
-
`(forall ((s Idv) (x Idv)) (! (=> (${MEM} (${LEN} s) ${NAT_SET}) (= (${FUN_APP} (${APPEND} s x) (${CAST_INT} (+ (${PROJ_INT} (${LEN} s)) 1))) x)) :pattern ((${APPEND} s x))))`,
|
|
499
|
-
),
|
|
500
|
-
]);
|
|
501
|
-
case "Head":
|
|
502
|
-
return declareSpec(
|
|
503
|
-
1,
|
|
504
|
-
["FunApp", "Cast_Int"],
|
|
505
|
-
[
|
|
506
|
-
axiom(
|
|
507
|
-
"SeqHeadDef",
|
|
508
|
-
[],
|
|
509
|
-
`(forall ((s Idv)) (! (= (${HEAD} s) (${FUN_APP} s (${CAST_INT} 1))) :pattern ((${HEAD} s))))`,
|
|
510
|
-
),
|
|
511
|
-
],
|
|
512
|
-
);
|
|
513
|
-
case "Tail":
|
|
514
|
-
return declareSpec(1, SEQUENCE_DEPS, [
|
|
515
|
-
axiom(
|
|
516
|
-
"SeqTailTyping",
|
|
517
|
-
[],
|
|
518
|
-
`(forall ((a Idv) (s Idv)) (! (=> (and (${MEM} s (${SEQ} a)) (distinct (${PROJ_INT} (${LEN} s)) 0)) (${MEM} (${TAIL} s) (${SEQ} a))) :pattern ((${MEM} s (${SEQ} a)) (${TAIL} s))))`,
|
|
519
|
-
),
|
|
520
|
-
axiom(
|
|
521
|
-
"SeqTailLen",
|
|
522
|
-
[],
|
|
523
|
-
`(forall ((s Idv)) (! (=> (and (${MEM} (${LEN} s) ${NAT_SET}) (distinct (${PROJ_INT} (${LEN} s)) 0)) (= (${LEN} (${TAIL} s)) (${CAST_INT} (- (${PROJ_INT} (${LEN} s)) 1)))) :pattern ((${TAIL} s))))`,
|
|
524
|
-
),
|
|
525
|
-
axiom(
|
|
526
|
-
"SeqTailApp",
|
|
527
|
-
[],
|
|
528
|
-
`(forall ((s Idv) (i Int)) (! (=> (and (${MEM} (${LEN} s) ${NAT_SET}) (distinct (${PROJ_INT} (${LEN} s)) 0) (<= 1 i) (<= i (- (${PROJ_INT} (${LEN} s)) 1))) (= (${FUN_APP} (${TAIL} s) (${CAST_INT} i)) (${FUN_APP} s (${CAST_INT} (+ i 1))))) :pattern ((${FUN_APP} (${TAIL} s) (${CAST_INT} i)))))`,
|
|
529
|
-
),
|
|
530
|
-
]);
|
|
531
|
-
case "SubSeq": {
|
|
532
|
-
const range = `(${SUB_SEQ} s (${CAST_INT} x) (${CAST_INT} y))`;
|
|
533
|
-
return declareSpec(
|
|
534
|
-
3,
|
|
535
|
-
["Mem", "Seq", "Len", "FunApp", "IntSet", "Cast_Int", "Proj_Int"],
|
|
536
|
-
[
|
|
537
|
-
axiom(
|
|
538
|
-
"SeqSubseqTyping",
|
|
539
|
-
[],
|
|
540
|
-
`(forall ((a Idv) (s Idv) (x Int) (y Int)) (! (=> (or (< y x) (and (${MEM} s (${SEQ} a)) (<= 1 x) (<= y (${PROJ_INT} (${LEN} s))))) (${MEM} ${range} (${SEQ} a))) :pattern ((${MEM} s (${SEQ} a)) ${range})))`,
|
|
541
|
-
),
|
|
542
|
-
axiom(
|
|
543
|
-
"SeqSubseqLen",
|
|
544
|
-
[],
|
|
545
|
-
`(forall ((s Idv) (x Int) (y Int)) (! (and (=> (<= x (+ y 1)) (= (${LEN} ${range}) (${CAST_INT} (- (+ y 1) x)))) (=> (> x (+ y 1)) (= (${LEN} ${range}) (${CAST_INT} 0)))) :pattern (${range})))`,
|
|
546
|
-
),
|
|
547
|
-
axiom(
|
|
548
|
-
"SeqSubseqApp",
|
|
549
|
-
[],
|
|
550
|
-
`(forall ((s Idv) (x Int) (y Int) (z Int)) (! (=> (and (<= 1 x) (<= 1 z) (<= z (- (+ y 1) x))) (= (${FUN_APP} ${range} (${CAST_INT} z)) (${FUN_APP} s (${CAST_INT} (- (+ z x) 1))))) :pattern ((${FUN_APP} ${range} (${CAST_INT} z)))))`,
|
|
551
|
-
),
|
|
552
|
-
],
|
|
553
|
-
);
|
|
554
|
-
}
|
|
555
|
-
case "Cast_Int":
|
|
556
|
-
return createSpec(
|
|
557
|
-
declare(symbol, 1, "Idv", "Int"),
|
|
558
|
-
["Mem", "IntSet", "Proj_Int"],
|
|
559
|
-
[
|
|
560
|
-
axiom(
|
|
561
|
-
"CastInjAlt",
|
|
562
|
-
["Int"],
|
|
563
|
-
`(forall ((x Int)) (! (= x (${PROJ_INT} (${CAST_INT} x))) :pattern ((${CAST_INT} x))))`,
|
|
564
|
-
),
|
|
565
|
-
axiom(
|
|
566
|
-
"TypeGuardIntro",
|
|
567
|
-
["Int"],
|
|
568
|
-
`(forall ((z Int)) (! (${MEM} (${CAST_INT} z) ${INT_SET}) :pattern ((${CAST_INT} z))))`,
|
|
569
|
-
),
|
|
570
|
-
axiom(
|
|
571
|
-
"TypeGuardElim",
|
|
572
|
-
["Int"],
|
|
573
|
-
`(forall ((x Idv)) (! (=> (${MEM} x ${INT_SET}) (= x (${CAST_INT} (${PROJ_INT} x)))) :pattern ((${MEM} x ${INT_SET}))))`,
|
|
574
|
-
),
|
|
575
|
-
],
|
|
576
|
-
);
|
|
577
|
-
case "Cast_Bool":
|
|
578
|
-
return createSpec(
|
|
579
|
-
declare(symbol, 1, "Idv", "Bool"),
|
|
580
|
-
["Mem", "BoolSet", "Tt_Idv"],
|
|
581
|
-
[
|
|
582
|
-
axiom(
|
|
583
|
-
"CastInjAlt",
|
|
584
|
-
["Bool"],
|
|
585
|
-
`(and (= (${CAST_BOOL} true) ${TT_IDV}) (distinct (${CAST_BOOL} false) ${TT_IDV}))`,
|
|
586
|
-
),
|
|
587
|
-
axiom(
|
|
588
|
-
"TypeGuardIntro",
|
|
589
|
-
["Bool"],
|
|
590
|
-
`(forall ((z Bool)) (! (${MEM} (${CAST_BOOL} z) ${BOOL_SET}) :pattern ((${CAST_BOOL} z))))`,
|
|
591
|
-
),
|
|
592
|
-
axiom(
|
|
593
|
-
"TypeGuardElim",
|
|
594
|
-
["Bool"],
|
|
595
|
-
`(forall ((x Idv)) (! (=> (${MEM} x ${BOOL_SET}) (or (= x (${CAST_BOOL} true)) (= x (${CAST_BOOL} false)))) :pattern ((${MEM} x ${BOOL_SET}))))`,
|
|
596
|
-
),
|
|
597
|
-
],
|
|
598
|
-
);
|
|
599
|
-
case "Proj_Int":
|
|
600
|
-
return createSpec(declare(symbol, 1, "Int"), [], []);
|
|
601
|
-
case "TrigEq_Set$Idv$":
|
|
602
|
-
return declareSpec(
|
|
603
|
-
2,
|
|
604
|
-
["SetExtTrigger"],
|
|
605
|
-
[
|
|
606
|
-
axiom(
|
|
607
|
-
"ExtTrigEqDef",
|
|
608
|
-
["Set$Idv$"],
|
|
609
|
-
`(forall ((x Idv) (y Idv)) (! (= (${TRIG_EQ} x y) (= x y)) :pattern ((${TRIG_EQ} x y))))`,
|
|
610
|
-
),
|
|
611
|
-
axiom(
|
|
612
|
-
"ExtTrigEqTrigger",
|
|
613
|
-
["Idv"],
|
|
614
|
-
`(forall ((x Idv) (y Idv)) (! (${SET_EXT_TRIGGER} x y) :pattern ((${TRIG_EQ} x y))))`,
|
|
615
|
-
),
|
|
616
|
-
],
|
|
617
|
-
"Bool",
|
|
618
|
-
);
|
|
619
|
-
case "SetExtTrigger":
|
|
620
|
-
case "IsSetOf":
|
|
621
|
-
return declareSpec(name === "IsSetOf" ? 1 : 2, [], [], "Bool");
|
|
622
|
-
case "BoolSet":
|
|
623
|
-
case "StrSet":
|
|
624
|
-
case "IntSet":
|
|
625
|
-
case "Tt_Idv":
|
|
626
|
-
return declareSpec(0, [], []);
|
|
627
|
-
case "TIntLteq":
|
|
628
|
-
return createSpec(undefined, ["IntLteq"], [getTyping("IntLteq")]);
|
|
629
748
|
default:
|
|
630
749
|
if (name.startsWith("TIntLit_")) return createSpec(undefined, [], []);
|
|
631
750
|
throw new TlaUnsupportedError(`the symbol ${name}`);
|