tla-ts 0.0.9 → 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 +30 -1
- package/dist/compile.cjs +23 -0
- package/dist/compile.js +23 -0
- package/dist/deciders.cjs +41 -37
- package/dist/deciders.js +48 -44
- package/dist/index.cjs +1 -1
- package/dist/index.d.cts +122 -12
- package/dist/index.d.ts +122 -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 +3 -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 +1156 -888
- 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 +330 -659
- package/src/cli/typescript.ts +23 -0
- package/src/cli/xml-exporter.ts +27 -49
- package/src/cli.ts +0 -1
- package/src/codegen.ts +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 +263 -370
- package/src/errors.ts +107 -57
- package/src/evaluate.ts +898 -369
- package/src/exit-codes.ts +63 -13
- package/src/fingerprints.ts +75 -11
- package/src/index.ts +3 -0
- package/src/instances.ts +137 -22
- 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 -322
- package/src/liveness.ts +230 -133
- 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 +36 -60
- package/src/parallel.ts +64 -73
- 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 +135 -40
- 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 +299 -108
- 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 +479 -0
- package/src/typescript/collections.ts +614 -0
- package/src/typescript/compile.ts +63 -0
- package/src/typescript/context.ts +94 -0
- package/src/typescript/emit.ts +121 -0
- package/src/typescript/expressions.ts +496 -0
- package/src/typescript/formula.ts +154 -0
- package/src/typescript/functions.ts +284 -0
- package/src/typescript/model.ts +162 -0
- package/src/typescript/names.ts +114 -0
- package/src/typescript/program.ts +48 -0
- package/src/typescript/properties.ts +139 -0
- package/src/typescript/scope.ts +112 -0
- package/src/typescript/steps.ts +167 -0
- package/src/typescript/types.ts +171 -0
- package/src/values.ts +945 -526
- 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
|
@@ -0,0 +1,24 @@
|
|
|
1
|
+
import type { Context } from "./context";
|
|
2
|
+
import { Theory } from "./theory";
|
|
3
|
+
|
|
4
|
+
export class TheoryWithoutTerms extends Theory {
|
|
5
|
+
constructor(
|
|
6
|
+
context: Context,
|
|
7
|
+
id: number,
|
|
8
|
+
readonly name: string,
|
|
9
|
+
) {
|
|
10
|
+
super(context, id);
|
|
11
|
+
}
|
|
12
|
+
|
|
13
|
+
internalizeAtom() {
|
|
14
|
+
return false;
|
|
15
|
+
}
|
|
16
|
+
|
|
17
|
+
internalizeTerm() {
|
|
18
|
+
return false;
|
|
19
|
+
}
|
|
20
|
+
|
|
21
|
+
newEqEh() {}
|
|
22
|
+
|
|
23
|
+
newDiseqEh() {}
|
|
24
|
+
}
|
|
@@ -0,0 +1,189 @@
|
|
|
1
|
+
import { shrink } from "./array";
|
|
2
|
+
import { type AstManager, OP_ITE } from "./ast";
|
|
3
|
+
import type { Context } from "./context";
|
|
4
|
+
import type { Enode } from "./enode";
|
|
5
|
+
import { type BoolVar, FALSE_LITERAL, type Literal, negate, TRUE_LITERAL } from "./literal";
|
|
6
|
+
import type { ProtoModel } from "./proto-model";
|
|
7
|
+
import { L_UNDEF } from "./lbool";
|
|
8
|
+
|
|
9
|
+
export const FC_DONE = 0;
|
|
10
|
+
export const FC_CONTINUE = 1;
|
|
11
|
+
export const FC_GIVEUP = 2;
|
|
12
|
+
|
|
13
|
+
export interface ExtraFreshValue {
|
|
14
|
+
sort: number;
|
|
15
|
+
value: number | undefined;
|
|
16
|
+
}
|
|
17
|
+
|
|
18
|
+
export interface DependentValue {
|
|
19
|
+
dependencies: (Enode | ExtraFreshValue)[];
|
|
20
|
+
mkValue: (values: number[]) => number;
|
|
21
|
+
}
|
|
22
|
+
|
|
23
|
+
export abstract class Theory {
|
|
24
|
+
abstract readonly name: string;
|
|
25
|
+
protected varEnodes: Enode[] = [];
|
|
26
|
+
private varEnodeLimits: number[] = [];
|
|
27
|
+
|
|
28
|
+
constructor(
|
|
29
|
+
protected context: Context,
|
|
30
|
+
readonly id: number,
|
|
31
|
+
) {}
|
|
32
|
+
|
|
33
|
+
protected get manager(): AstManager {
|
|
34
|
+
return this.context.manager;
|
|
35
|
+
}
|
|
36
|
+
|
|
37
|
+
getEnode(thVar: number) {
|
|
38
|
+
return this.varEnodes[thVar];
|
|
39
|
+
}
|
|
40
|
+
|
|
41
|
+
protected getExpr(thVar: number) {
|
|
42
|
+
return this.varEnodes[thVar].owner;
|
|
43
|
+
}
|
|
44
|
+
|
|
45
|
+
getNumVars() {
|
|
46
|
+
return this.varEnodes.length;
|
|
47
|
+
}
|
|
48
|
+
|
|
49
|
+
// The variable of the node itself, not one an equality moved to its list.
|
|
50
|
+
isAttachedToVar(node: Enode) {
|
|
51
|
+
const thVar = node.getThVar(this.id);
|
|
52
|
+
return thVar >= 0 && this.varEnodes[thVar] === node;
|
|
53
|
+
}
|
|
54
|
+
|
|
55
|
+
getThVar(node: Enode) {
|
|
56
|
+
return node.getThVar(this.id);
|
|
57
|
+
}
|
|
58
|
+
|
|
59
|
+
init() {}
|
|
60
|
+
|
|
61
|
+
protected mkEqLiteral(first: number, second: number, isGateContext: boolean): Literal {
|
|
62
|
+
if (first === second) return TRUE_LITERAL;
|
|
63
|
+
if (this.manager.areDistinct(first, second)) return FALSE_LITERAL;
|
|
64
|
+
const eq = this.context.mkEqAtom(first, second);
|
|
65
|
+
this.context.internalize(eq, isGateContext);
|
|
66
|
+
return this.context.getLiteral(eq);
|
|
67
|
+
}
|
|
68
|
+
|
|
69
|
+
protected mkLiteralOf(input: number): Literal {
|
|
70
|
+
const manager = this.manager;
|
|
71
|
+
const isNot = manager.isNot(input);
|
|
72
|
+
const expr = isNot ? manager.getArg(input, 0) : input;
|
|
73
|
+
if (!this.context.isEInternalized(expr)) this.context.internalize(expr, false);
|
|
74
|
+
const literal = this.context.getLiteral(expr);
|
|
75
|
+
this.context.markLiteralAsRelevant(literal);
|
|
76
|
+
return isNot ? negate(literal) : literal;
|
|
77
|
+
}
|
|
78
|
+
|
|
79
|
+
protected ensureEnodeOf(expr: number): Enode {
|
|
80
|
+
const context = this.context;
|
|
81
|
+
if (!context.isEInternalized(expr)) context.internalize(expr, false);
|
|
82
|
+
if (!this.manager.isBool(expr)) context.internalizeTerm(expr);
|
|
83
|
+
const node = context.getEnode(expr)!;
|
|
84
|
+
context.markAsRelevant(expr);
|
|
85
|
+
return node;
|
|
86
|
+
}
|
|
87
|
+
|
|
88
|
+
protected getIteValue(expr: number) {
|
|
89
|
+
const context = this.context;
|
|
90
|
+
const manager = this.manager;
|
|
91
|
+
let current = expr;
|
|
92
|
+
while (manager.getOp(current) === OP_ITE && context.isEInternalized(current)) {
|
|
93
|
+
const root = context.getEnode(current)?.root;
|
|
94
|
+
const thenExpr = manager.getArg(current, 1);
|
|
95
|
+
const elseExpr = manager.getArg(current, 2);
|
|
96
|
+
if (context.getEnode(thenExpr)?.root === root) current = thenExpr;
|
|
97
|
+
else if (context.getEnode(elseExpr)?.root === root) current = elseExpr;
|
|
98
|
+
else break;
|
|
99
|
+
}
|
|
100
|
+
return current;
|
|
101
|
+
}
|
|
102
|
+
|
|
103
|
+
abstract internalizeAtom(atom: number, isGateContext: boolean): boolean;
|
|
104
|
+
|
|
105
|
+
abstract internalizeTerm(term: number): boolean;
|
|
106
|
+
|
|
107
|
+
internalizeEqEh(_eq: number, _boolVar: BoolVar) {}
|
|
108
|
+
|
|
109
|
+
applySortCnstr(_node: Enode, _sort: number) {}
|
|
110
|
+
|
|
111
|
+
assignEh(_boolVar: BoolVar, _isTrue: boolean) {}
|
|
112
|
+
|
|
113
|
+
abstract newEqEh(first: number, second: number): void;
|
|
114
|
+
|
|
115
|
+
useDiseqs() {
|
|
116
|
+
return true;
|
|
117
|
+
}
|
|
118
|
+
|
|
119
|
+
abstract newDiseqEh(first: number, second: number): void;
|
|
120
|
+
|
|
121
|
+
relevantEh(_expr: number) {}
|
|
122
|
+
|
|
123
|
+
pushScopeEh() {
|
|
124
|
+
this.varEnodeLimits.push(this.varEnodes.length);
|
|
125
|
+
}
|
|
126
|
+
|
|
127
|
+
protected getOldNumVars(numScopes: number) {
|
|
128
|
+
return this.varEnodeLimits[this.varEnodeLimits.length - numScopes];
|
|
129
|
+
}
|
|
130
|
+
|
|
131
|
+
popScopeEh(numScopes: number) {
|
|
132
|
+
const newLevel = this.varEnodeLimits.length - numScopes;
|
|
133
|
+
shrink(this.varEnodes, this.varEnodeLimits[newLevel]);
|
|
134
|
+
shrink(this.varEnodeLimits, newLevel);
|
|
135
|
+
}
|
|
136
|
+
|
|
137
|
+
restartEh() {}
|
|
138
|
+
|
|
139
|
+
getPhase(_boolVar: BoolVar) {
|
|
140
|
+
return L_UNDEF;
|
|
141
|
+
}
|
|
142
|
+
|
|
143
|
+
initSearchEh() {}
|
|
144
|
+
|
|
145
|
+
finalCheckEh(_level: number) {
|
|
146
|
+
return FC_DONE;
|
|
147
|
+
}
|
|
148
|
+
|
|
149
|
+
numFinalCheckLevels() {
|
|
150
|
+
return 1;
|
|
151
|
+
}
|
|
152
|
+
|
|
153
|
+
isShared(_thVar: number) {
|
|
154
|
+
return false;
|
|
155
|
+
}
|
|
156
|
+
|
|
157
|
+
isBetaRedex(_parent: Enode, _node: Enode) {
|
|
158
|
+
return false;
|
|
159
|
+
}
|
|
160
|
+
|
|
161
|
+
canPropagate() {
|
|
162
|
+
return false;
|
|
163
|
+
}
|
|
164
|
+
|
|
165
|
+
propagate() {}
|
|
166
|
+
|
|
167
|
+
buildModels() {
|
|
168
|
+
return true;
|
|
169
|
+
}
|
|
170
|
+
|
|
171
|
+
initModel(_model: ProtoModel) {}
|
|
172
|
+
|
|
173
|
+
finalizeModel() {}
|
|
174
|
+
|
|
175
|
+
addTheoryAssumptions(_assumptions: number[]) {}
|
|
176
|
+
|
|
177
|
+
shouldResearch(_unsatCore: readonly number[]) {
|
|
178
|
+
return false;
|
|
179
|
+
}
|
|
180
|
+
|
|
181
|
+
// undefined stands for a fresh value of the sort.
|
|
182
|
+
mkValue(_node: Enode): number | DependentValue | undefined {
|
|
183
|
+
return undefined;
|
|
184
|
+
}
|
|
185
|
+
|
|
186
|
+
includeFuncInterp(_decl: number) {
|
|
187
|
+
return false;
|
|
188
|
+
}
|
|
189
|
+
}
|
|
@@ -0,0 +1,486 @@
|
|
|
1
|
+
import { SmtTacticError } from "../../../errors";
|
|
2
|
+
import {
|
|
3
|
+
type AstManager,
|
|
4
|
+
FAMILY_BASIC,
|
|
5
|
+
KIND_APP,
|
|
6
|
+
KIND_QUANTIFIER,
|
|
7
|
+
OP_AND,
|
|
8
|
+
OP_DISTINCT,
|
|
9
|
+
OP_EQ,
|
|
10
|
+
OP_IMPLIES,
|
|
11
|
+
OP_ITE,
|
|
12
|
+
OP_NOT,
|
|
13
|
+
OP_OR,
|
|
14
|
+
OP_XOR,
|
|
15
|
+
SORT_BOOL,
|
|
16
|
+
} from "./ast";
|
|
17
|
+
import type { Goal } from "./goal";
|
|
18
|
+
import { RefVector } from "./ref-vector";
|
|
19
|
+
import { Rewriter, TACTIC_REWRITER_OPTIONS } from "./rewriter";
|
|
20
|
+
|
|
21
|
+
const NO = 0;
|
|
22
|
+
const CONT = 1;
|
|
23
|
+
const DONE = 2;
|
|
24
|
+
const DISTRIBUTIVITY_BLOWUP = 32;
|
|
25
|
+
|
|
26
|
+
interface Frame {
|
|
27
|
+
expr: number;
|
|
28
|
+
isFirst: boolean;
|
|
29
|
+
}
|
|
30
|
+
|
|
31
|
+
const getSharedApps = (manager: AstManager, forms: readonly number[]) => {
|
|
32
|
+
const visited = new Set<number>();
|
|
33
|
+
const shared = new Set<number>();
|
|
34
|
+
const todo = [...forms];
|
|
35
|
+
for (let expr = todo.pop(); expr !== undefined; expr = todo.pop()) {
|
|
36
|
+
const kind = manager.kinds[expr];
|
|
37
|
+
if (kind !== KIND_QUANTIFIER && (kind !== KIND_APP || manager.getNumArgs(expr) === 0)) continue;
|
|
38
|
+
if (visited.has(expr)) {
|
|
39
|
+
shared.add(expr);
|
|
40
|
+
continue;
|
|
41
|
+
}
|
|
42
|
+
visited.add(expr);
|
|
43
|
+
if (kind === KIND_APP) manager.pushArgs(expr, todo);
|
|
44
|
+
}
|
|
45
|
+
return shared;
|
|
46
|
+
};
|
|
47
|
+
|
|
48
|
+
const getOrderedById = (manager: AstManager, first: number, second: number) =>
|
|
49
|
+
manager.ids[first] > manager.ids[second] ? [second, first] : [first, second];
|
|
50
|
+
|
|
51
|
+
const getProductNext = (sizes: readonly number[], iterator: number[]) => {
|
|
52
|
+
for (let index = 0; index < sizes.length; index++) {
|
|
53
|
+
iterator[index]++;
|
|
54
|
+
if (iterator[index] < sizes[index]) return true;
|
|
55
|
+
iterator[index] = 0;
|
|
56
|
+
}
|
|
57
|
+
return false;
|
|
58
|
+
};
|
|
59
|
+
|
|
60
|
+
export const tseitinCnf = (manager: AstManager, goal: Goal) => {
|
|
61
|
+
if (goal.isProofsEnabled) throw new SmtTacticError("tseitin-cnf does not support proofs");
|
|
62
|
+
const shared = getSharedApps(manager, goal.forms.items);
|
|
63
|
+
const rewriter = new Rewriter(manager, { ...TACTIC_REWRITER_OPTIONS, isFlatAndOr: false });
|
|
64
|
+
const pinned = new RefVector(manager);
|
|
65
|
+
const clauses = new RefVector(manager);
|
|
66
|
+
const cache = new Map<number, number>();
|
|
67
|
+
const freshDecls: number[] = [];
|
|
68
|
+
const frames: Frame[] = [];
|
|
69
|
+
const pin = (expr: number) => {
|
|
70
|
+
pinned.push(expr);
|
|
71
|
+
return expr;
|
|
72
|
+
};
|
|
73
|
+
|
|
74
|
+
const isShared = (expr: number) => shared.has(expr);
|
|
75
|
+
const isOp = (expr: number, op: number) =>
|
|
76
|
+
manager.kinds[expr] === KIND_APP && manager.getOp(expr) === op;
|
|
77
|
+
const isOrOf = (expr: number, count: number) =>
|
|
78
|
+
isOp(expr, OP_OR) && manager.getNumArgs(expr) === count;
|
|
79
|
+
const isIff = (expr: number) =>
|
|
80
|
+
isOp(expr, OP_EQ) && manager.sorts[manager.getArg(expr, 0)] === SORT_BOOL;
|
|
81
|
+
|
|
82
|
+
const inv = (expr: number) => {
|
|
83
|
+
if (manager.isTrue(expr)) return manager.falseExpr;
|
|
84
|
+
if (manager.isFalse(expr)) return manager.trueExpr;
|
|
85
|
+
if (manager.isNot(expr)) return manager.getArg(expr, 0);
|
|
86
|
+
return pin(manager.mkNot(expr));
|
|
87
|
+
};
|
|
88
|
+
|
|
89
|
+
const mkLit = (expr: number, isNeg: boolean) => (isNeg ? pin(manager.mkNot(expr)) : expr);
|
|
90
|
+
|
|
91
|
+
const getLit = (form: number, isNegated: boolean): number => {
|
|
92
|
+
let expr = form;
|
|
93
|
+
let isNeg = isNegated;
|
|
94
|
+
while (true) {
|
|
95
|
+
if (manager.kinds[expr] !== KIND_APP || manager.getNumArgs(expr) === 0)
|
|
96
|
+
return mkLit(expr, isNeg);
|
|
97
|
+
if (manager.getFamily(expr) !== FAMILY_BASIC) return mkLit(expr, isNeg);
|
|
98
|
+
const op = manager.getOp(expr);
|
|
99
|
+
if (op === OP_NOT) {
|
|
100
|
+
expr = manager.getArg(expr, 0);
|
|
101
|
+
isNeg = !isNeg;
|
|
102
|
+
continue;
|
|
103
|
+
}
|
|
104
|
+
if (op === OP_OR) return mkLit(cache.get(expr)!, isNeg);
|
|
105
|
+
if ((op === OP_ITE || op === OP_EQ) && manager.sorts[manager.getArg(expr, 1)] === SORT_BOOL)
|
|
106
|
+
return mkLit(cache.get(expr)!, isNeg);
|
|
107
|
+
return mkLit(expr, isNeg);
|
|
108
|
+
}
|
|
109
|
+
};
|
|
110
|
+
|
|
111
|
+
const visit = (form: number, isRoot = false) => {
|
|
112
|
+
let expr = form;
|
|
113
|
+
while (true) {
|
|
114
|
+
if (manager.kinds[expr] !== KIND_APP || cache.has(expr) || manager.getNumArgs(expr) === 0)
|
|
115
|
+
return true;
|
|
116
|
+
if (manager.getFamily(expr) !== FAMILY_BASIC) return true;
|
|
117
|
+
switch (manager.getOp(expr)) {
|
|
118
|
+
case OP_NOT:
|
|
119
|
+
if (isRoot) {
|
|
120
|
+
frames.push({ expr, isFirst: true });
|
|
121
|
+
return false;
|
|
122
|
+
}
|
|
123
|
+
expr = manager.getArg(expr, 0);
|
|
124
|
+
continue;
|
|
125
|
+
case OP_OR:
|
|
126
|
+
frames.push({ expr, isFirst: true });
|
|
127
|
+
return false;
|
|
128
|
+
case OP_ITE:
|
|
129
|
+
case OP_EQ:
|
|
130
|
+
if (manager.sorts[manager.getArg(expr, 1)] !== SORT_BOOL) return true;
|
|
131
|
+
frames.push({ expr, isFirst: true });
|
|
132
|
+
return false;
|
|
133
|
+
case OP_XOR:
|
|
134
|
+
case OP_IMPLIES:
|
|
135
|
+
case OP_DISTINCT:
|
|
136
|
+
case OP_AND:
|
|
137
|
+
throw new SmtTacticError(
|
|
138
|
+
"operator not supported, apply simplifier before invoking this strategy",
|
|
139
|
+
);
|
|
140
|
+
default:
|
|
141
|
+
return true;
|
|
142
|
+
}
|
|
143
|
+
}
|
|
144
|
+
};
|
|
145
|
+
|
|
146
|
+
const visitAll = (exprs: readonly number[]) =>
|
|
147
|
+
exprs.reduce((isVisited, expr) => visit(expr) && isVisited, true);
|
|
148
|
+
|
|
149
|
+
const mkClause = (literals: number[]) => clauses.push(pin(rewriter.mkOr(literals)));
|
|
150
|
+
|
|
151
|
+
const mkFresh = () => {
|
|
152
|
+
const fresh = manager.mkFreshConst(null, SORT_BOOL);
|
|
153
|
+
freshDecls.push(manager.decls[fresh]);
|
|
154
|
+
return pin(fresh);
|
|
155
|
+
};
|
|
156
|
+
|
|
157
|
+
const cacheResult = (expr: number, literal: number) => {
|
|
158
|
+
pinned.push(expr);
|
|
159
|
+
cache.set(expr, literal);
|
|
160
|
+
};
|
|
161
|
+
|
|
162
|
+
const getOr3And = (expr: number) => {
|
|
163
|
+
if (!isOrOf(expr, 3)) return null;
|
|
164
|
+
const ors: number[][] = [];
|
|
165
|
+
for (const arg of manager.getArgs(expr)) {
|
|
166
|
+
if (!manager.isNot(arg)) return null;
|
|
167
|
+
const inner = manager.getArg(arg, 0);
|
|
168
|
+
if (isShared(inner) || !isOrOf(inner, 2)) return null;
|
|
169
|
+
ors.push(getOrderedById(manager, manager.getArg(inner, 0), manager.getArg(inner, 1)));
|
|
170
|
+
}
|
|
171
|
+
const [[a1, a2], [b1, b2], [c1, c2]] = ors;
|
|
172
|
+
if (
|
|
173
|
+
(a1 === b1 && a2 === c1 && b2 === c2) ||
|
|
174
|
+
(a1 === b1 && a2 === c2 && b2 === c1) ||
|
|
175
|
+
(a1 === c1 && a2 === b1 && b2 === c2)
|
|
176
|
+
)
|
|
177
|
+
return [a1, a2, b2];
|
|
178
|
+
if (
|
|
179
|
+
(a1 === b2 && a2 === c2 && b1 === c1) ||
|
|
180
|
+
(a1 === c1 && a2 === b2 && b1 === c2) ||
|
|
181
|
+
(a1 === c2 && a2 === b2 && b1 === c1)
|
|
182
|
+
)
|
|
183
|
+
return [a1, a2, b1];
|
|
184
|
+
return null;
|
|
185
|
+
};
|
|
186
|
+
|
|
187
|
+
const getIff3 = (expr: number) => {
|
|
188
|
+
if (!isIff(expr)) return null;
|
|
189
|
+
const left = manager.getArg(expr, 0);
|
|
190
|
+
const right = manager.getArg(expr, 1);
|
|
191
|
+
if (!isShared(left) && isIff(left))
|
|
192
|
+
return [manager.getArg(left, 0), manager.getArg(left, 1), right];
|
|
193
|
+
if (!isShared(right) && isIff(right))
|
|
194
|
+
return [left, manager.getArg(right, 0), manager.getArg(right, 1)];
|
|
195
|
+
return null;
|
|
196
|
+
};
|
|
197
|
+
|
|
198
|
+
const matchOr3And = (expr: number, isFirst: boolean, isRoot: boolean) => {
|
|
199
|
+
const args = getOr3And(expr);
|
|
200
|
+
if (args === null) return NO;
|
|
201
|
+
if (isFirst && !visitAll(args)) return CONT;
|
|
202
|
+
const [nla, nlb, nlc] = args.map((arg) => getLit(arg, true));
|
|
203
|
+
if (isRoot) {
|
|
204
|
+
mkClause([nla, nlb]);
|
|
205
|
+
mkClause([nla, nlc]);
|
|
206
|
+
mkClause([nlb, nlc]);
|
|
207
|
+
return DONE;
|
|
208
|
+
}
|
|
209
|
+
const k = mkFresh();
|
|
210
|
+
const nk = pin(manager.mkNot(k));
|
|
211
|
+
mkClause([nk, nla, nlb]);
|
|
212
|
+
mkClause([nk, nla, nlc]);
|
|
213
|
+
mkClause([nk, nlb, nlc]);
|
|
214
|
+
const [la, lb, lc] = [nla, nlb, nlc].map(inv);
|
|
215
|
+
mkClause([k, la, lb]);
|
|
216
|
+
mkClause([k, la, lc]);
|
|
217
|
+
mkClause([k, lb, lc]);
|
|
218
|
+
cacheResult(expr, k);
|
|
219
|
+
return DONE;
|
|
220
|
+
};
|
|
221
|
+
|
|
222
|
+
const matchIff3 = (expr: number, isFirst: boolean, isRoot: boolean) => {
|
|
223
|
+
const args = getIff3(expr);
|
|
224
|
+
if (args === null) return NO;
|
|
225
|
+
if (isFirst && !visitAll(args)) return CONT;
|
|
226
|
+
const [la, lb, lc] = args.map((arg) => getLit(arg, false));
|
|
227
|
+
const [nla, nlb, nlc] = [la, lb, lc].map(inv);
|
|
228
|
+
if (isRoot) {
|
|
229
|
+
mkClause([la, lb, lc]);
|
|
230
|
+
mkClause([la, nlb, nlc]);
|
|
231
|
+
mkClause([nla, lb, nlc]);
|
|
232
|
+
mkClause([nla, nlb, lc]);
|
|
233
|
+
return DONE;
|
|
234
|
+
}
|
|
235
|
+
const k = mkFresh();
|
|
236
|
+
const nk = pin(manager.mkNot(k));
|
|
237
|
+
mkClause([nk, la, lb, lc]);
|
|
238
|
+
mkClause([nk, la, nlb, nlc]);
|
|
239
|
+
mkClause([nk, nla, lb, nlc]);
|
|
240
|
+
mkClause([nk, nla, nlb, lc]);
|
|
241
|
+
mkClause([k, nla, nlb, nlc]);
|
|
242
|
+
mkClause([k, nla, lb, lc]);
|
|
243
|
+
mkClause([k, la, nlb, lc]);
|
|
244
|
+
mkClause([k, la, lb, nlc]);
|
|
245
|
+
cacheResult(expr, k);
|
|
246
|
+
return DONE;
|
|
247
|
+
};
|
|
248
|
+
|
|
249
|
+
const matchIff = (expr: number, isFirst: boolean, isRoot: boolean) => {
|
|
250
|
+
if (!isIff(expr)) return NO;
|
|
251
|
+
const args = manager.getArgs(expr);
|
|
252
|
+
if (isFirst && !visitAll(args)) return CONT;
|
|
253
|
+
const [la, lb] = args.map((arg) => getLit(arg, false));
|
|
254
|
+
const nla = inv(la);
|
|
255
|
+
const nlb = inv(lb);
|
|
256
|
+
if (isRoot) {
|
|
257
|
+
mkClause([la, nlb]);
|
|
258
|
+
mkClause([nla, lb]);
|
|
259
|
+
return DONE;
|
|
260
|
+
}
|
|
261
|
+
const k = mkFresh();
|
|
262
|
+
const nk = pin(manager.mkNot(k));
|
|
263
|
+
mkClause([nk, la, nlb]);
|
|
264
|
+
mkClause([nk, nla, lb]);
|
|
265
|
+
mkClause([k, nla, nlb]);
|
|
266
|
+
mkClause([k, la, lb]);
|
|
267
|
+
cacheResult(expr, k);
|
|
268
|
+
return DONE;
|
|
269
|
+
};
|
|
270
|
+
|
|
271
|
+
const getIteChainStep = (ite: number) => {
|
|
272
|
+
const thenExpr = manager.getArg(ite, 1);
|
|
273
|
+
const elseExpr = manager.getArg(ite, 2);
|
|
274
|
+
if (isOp(thenExpr, OP_ITE) && !isShared(thenExpr)) return { next: thenExpr, isThen: true };
|
|
275
|
+
if (isOp(elseExpr, OP_ITE) && !isShared(elseExpr)) return { next: elseExpr, isThen: false };
|
|
276
|
+
return null;
|
|
277
|
+
};
|
|
278
|
+
|
|
279
|
+
const matchIte = (expr: number, isFirst: boolean, isRoot: boolean) => {
|
|
280
|
+
if (!isOp(expr, OP_ITE)) return NO;
|
|
281
|
+
if (isFirst) {
|
|
282
|
+
let isVisited = true;
|
|
283
|
+
let ite = expr;
|
|
284
|
+
while (true) {
|
|
285
|
+
isVisited = visit(manager.getArg(ite, 0)) && isVisited;
|
|
286
|
+
const step = getIteChainStep(ite);
|
|
287
|
+
if (step === null) {
|
|
288
|
+
isVisited = visit(manager.getArg(ite, 1)) && isVisited;
|
|
289
|
+
isVisited = visit(manager.getArg(ite, 2)) && isVisited;
|
|
290
|
+
break;
|
|
291
|
+
}
|
|
292
|
+
isVisited = visit(manager.getArg(ite, step.isThen ? 2 : 1)) && isVisited;
|
|
293
|
+
ite = step.next;
|
|
294
|
+
}
|
|
295
|
+
if (!isVisited) return CONT;
|
|
296
|
+
}
|
|
297
|
+
const context: number[] = [];
|
|
298
|
+
const exNegContext: number[] = [];
|
|
299
|
+
const exPosContext: number[] = [];
|
|
300
|
+
const k = isRoot ? -1 : mkFresh();
|
|
301
|
+
const nk = isRoot ? -1 : pin(manager.mkNot(k));
|
|
302
|
+
if (!isRoot) cacheResult(expr, k);
|
|
303
|
+
const mkIteClause = (literals: number[]) => mkClause([...context, ...literals]);
|
|
304
|
+
let ite = expr;
|
|
305
|
+
while (true) {
|
|
306
|
+
const la = getLit(manager.getArg(ite, 0), false);
|
|
307
|
+
const nla = inv(la);
|
|
308
|
+
const step = getIteChainStep(ite);
|
|
309
|
+
if (step !== null) {
|
|
310
|
+
const other = getLit(manager.getArg(ite, step.isThen ? 2 : 1), false);
|
|
311
|
+
const guard = step.isThen ? la : nla;
|
|
312
|
+
if (isRoot) mkIteClause([guard, other]);
|
|
313
|
+
else {
|
|
314
|
+
const nother = inv(other);
|
|
315
|
+
mkIteClause([guard, other, nk]);
|
|
316
|
+
mkIteClause([guard, nother, k]);
|
|
317
|
+
exNegContext.push(other);
|
|
318
|
+
exPosContext.push(nother);
|
|
319
|
+
}
|
|
320
|
+
context.push(step.isThen ? nla : la);
|
|
321
|
+
ite = step.next;
|
|
322
|
+
continue;
|
|
323
|
+
}
|
|
324
|
+
const lb = getLit(manager.getArg(ite, 1), false);
|
|
325
|
+
const lc = getLit(manager.getArg(ite, 2), false);
|
|
326
|
+
if (isRoot) {
|
|
327
|
+
mkIteClause([nla, lb]);
|
|
328
|
+
mkIteClause([la, lc]);
|
|
329
|
+
break;
|
|
330
|
+
}
|
|
331
|
+
const nlb = inv(lb);
|
|
332
|
+
const nlc = inv(lc);
|
|
333
|
+
mkIteClause([nla, lb, nk]);
|
|
334
|
+
mkIteClause([la, lc, nk]);
|
|
335
|
+
mkIteClause([nla, nlb, k]);
|
|
336
|
+
mkIteClause([la, nlc, k]);
|
|
337
|
+
mkIteClause([lb, lc, nk]);
|
|
338
|
+
mkIteClause([nlb, nlc, k]);
|
|
339
|
+
mkClause([...exNegContext, lb, lc, nk]);
|
|
340
|
+
mkClause([...exPosContext, nlb, nlc, k]);
|
|
341
|
+
break;
|
|
342
|
+
}
|
|
343
|
+
return DONE;
|
|
344
|
+
};
|
|
345
|
+
|
|
346
|
+
const matchAnd = (expr: number, isFirst: boolean, isRoot: boolean) => {
|
|
347
|
+
if (!isOp(expr, OP_AND)) return NO;
|
|
348
|
+
const args = manager.getArgs(expr);
|
|
349
|
+
if (isFirst && !visitAll(args)) return CONT;
|
|
350
|
+
if (isRoot) {
|
|
351
|
+
for (const arg of args) mkClause([getLit(arg, false)]);
|
|
352
|
+
return DONE;
|
|
353
|
+
}
|
|
354
|
+
const k = mkFresh();
|
|
355
|
+
const nk = pin(manager.mkNot(k));
|
|
356
|
+
cacheResult(expr, k);
|
|
357
|
+
const literals: number[] = [];
|
|
358
|
+
for (const arg of args) {
|
|
359
|
+
const literal = getLit(arg, false);
|
|
360
|
+
mkClause([nk, literal]);
|
|
361
|
+
literals.push(inv(literal));
|
|
362
|
+
}
|
|
363
|
+
mkClause([...literals, k]);
|
|
364
|
+
return DONE;
|
|
365
|
+
};
|
|
366
|
+
|
|
367
|
+
const getDistributed = (arg: number) => {
|
|
368
|
+
if (!manager.isNot(arg)) return null;
|
|
369
|
+
const inner = manager.getArg(arg, 0);
|
|
370
|
+
return isOp(inner, OP_OR) && !isShared(inner) ? inner : null;
|
|
371
|
+
};
|
|
372
|
+
|
|
373
|
+
const matchOr = (expr: number, isFirst: boolean, isRoot: boolean) => {
|
|
374
|
+
if (!isOp(expr, OP_OR)) return NO;
|
|
375
|
+
const args = manager.getArgs(expr);
|
|
376
|
+
const isExpanding = (count: number, blowup: number) =>
|
|
377
|
+
count < DISTRIBUTIVITY_BLOWUP &&
|
|
378
|
+
blowup * count < DISTRIBUTIVITY_BLOWUP &&
|
|
379
|
+
blowup < blowup * count;
|
|
380
|
+
if (isFirst) {
|
|
381
|
+
let isVisited = true;
|
|
382
|
+
let blowup = 1;
|
|
383
|
+
for (const arg of args) {
|
|
384
|
+
const inner = getDistributed(arg);
|
|
385
|
+
if (inner !== null && isExpanding(manager.getNumArgs(inner), blowup)) {
|
|
386
|
+
blowup *= manager.getNumArgs(inner);
|
|
387
|
+
isVisited = visitAll(manager.getArgs(inner)) && isVisited;
|
|
388
|
+
continue;
|
|
389
|
+
}
|
|
390
|
+
isVisited = visit(arg) && isVisited;
|
|
391
|
+
}
|
|
392
|
+
if (!isVisited) return CONT;
|
|
393
|
+
}
|
|
394
|
+
const k = isRoot ? -1 : mkFresh();
|
|
395
|
+
const nk = isRoot ? -1 : pin(manager.mkNot(k));
|
|
396
|
+
if (!isRoot) cacheResult(expr, k);
|
|
397
|
+
const isDistributing = args.some((arg) => {
|
|
398
|
+
const inner = getDistributed(arg);
|
|
399
|
+
return inner !== null && manager.getNumArgs(inner) < DISTRIBUTIVITY_BLOWUP;
|
|
400
|
+
});
|
|
401
|
+
if (!isDistributing) {
|
|
402
|
+
const literals = args.map((arg) => getLit(arg, false));
|
|
403
|
+
if (isRoot) mkClause(literals);
|
|
404
|
+
else {
|
|
405
|
+
for (const literal of literals) mkClause([inv(literal), k]);
|
|
406
|
+
mkClause([...literals, nk]);
|
|
407
|
+
}
|
|
408
|
+
return DONE;
|
|
409
|
+
}
|
|
410
|
+
const groups: number[][] = [];
|
|
411
|
+
let blowup = 1;
|
|
412
|
+
for (const arg of args) {
|
|
413
|
+
const inner = getDistributed(arg);
|
|
414
|
+
if (inner !== null && isExpanding(manager.getNumArgs(inner), blowup)) {
|
|
415
|
+
blowup *= manager.getNumArgs(inner);
|
|
416
|
+
const negated = manager.getArgs(inner).map((innerArg) => getLit(innerArg, true));
|
|
417
|
+
if (!isRoot) mkClause([...negated.map(inv), k]);
|
|
418
|
+
groups.push(negated);
|
|
419
|
+
continue;
|
|
420
|
+
}
|
|
421
|
+
const literal = getLit(arg, false);
|
|
422
|
+
if (!isRoot) mkClause([inv(literal), k]);
|
|
423
|
+
groups.push([literal]);
|
|
424
|
+
}
|
|
425
|
+
const sizes = groups.map((group) => group.length);
|
|
426
|
+
const iterator = sizes.map(() => 0);
|
|
427
|
+
do {
|
|
428
|
+
const literals = groups.map((group, index) => group[iterator[index]]);
|
|
429
|
+
mkClause(isRoot ? literals : [...literals, nk]);
|
|
430
|
+
} while (getProductNext(sizes, iterator));
|
|
431
|
+
return DONE;
|
|
432
|
+
};
|
|
433
|
+
|
|
434
|
+
const matchNot = (expr: number, isFirst: boolean, isRoot: boolean) => {
|
|
435
|
+
if (!manager.isNot(expr)) return NO;
|
|
436
|
+
const arg = manager.getArg(expr, 0);
|
|
437
|
+
if (isFirst && !visit(arg)) return CONT;
|
|
438
|
+
const nla = getLit(arg, true);
|
|
439
|
+
if (isRoot) mkClause([nla]);
|
|
440
|
+
return DONE;
|
|
441
|
+
};
|
|
442
|
+
|
|
443
|
+
const matchers = [matchOr3And, matchOr, matchAnd, matchIff3, matchIff, matchIte, matchNot];
|
|
444
|
+
|
|
445
|
+
const process = (root: number) => {
|
|
446
|
+
if (visit(root, true)) {
|
|
447
|
+
mkClause([getLit(root, false)]);
|
|
448
|
+
return;
|
|
449
|
+
}
|
|
450
|
+
while (frames.length > 0) {
|
|
451
|
+
manager.limit.checkpoint();
|
|
452
|
+
const frame = frames[frames.length - 1];
|
|
453
|
+
const isFirst = frame.isFirst;
|
|
454
|
+
frame.isFirst = false;
|
|
455
|
+
for (const match of matchers) {
|
|
456
|
+
const result = match(frame.expr, isFirst, frame.expr === root);
|
|
457
|
+
if (result === CONT) break;
|
|
458
|
+
if (result === DONE) {
|
|
459
|
+
frames.pop();
|
|
460
|
+
break;
|
|
461
|
+
}
|
|
462
|
+
}
|
|
463
|
+
}
|
|
464
|
+
};
|
|
465
|
+
|
|
466
|
+
try {
|
|
467
|
+
for (const form of goal.forms.items) process(form);
|
|
468
|
+
} catch (error) {
|
|
469
|
+
pinned.reset();
|
|
470
|
+
clauses.reset();
|
|
471
|
+
rewriter.release();
|
|
472
|
+
throw error;
|
|
473
|
+
}
|
|
474
|
+
goal.reset();
|
|
475
|
+
const added = new Set<number>();
|
|
476
|
+
for (const clause of clauses.items) {
|
|
477
|
+
if (added.has(clause)) continue;
|
|
478
|
+
added.add(clause);
|
|
479
|
+
goal.assert(clause);
|
|
480
|
+
}
|
|
481
|
+
for (const decl of freshDecls) goal.addConverter(decl);
|
|
482
|
+
goal.depth++;
|
|
483
|
+
clauses.reset();
|
|
484
|
+
pinned.reset();
|
|
485
|
+
rewriter.release();
|
|
486
|
+
};
|