tla-ts 0.0.10-dev.63a6693bd → 0.0.10-dev.7a3bb1545
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 +3 -3
- package/dist/compile.js +1 -1
- package/dist/deciders.cjs +41 -37
- package/dist/deciders.js +58 -54
- package/dist/index.cjs +1 -1
- package/dist/index.d.cts +4 -1
- package/dist/index.d.ts +4 -1
- 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 +2682 -426
- package/dist/prove.js +2679 -423
- package/dist/run.cjs +43 -42
- package/dist/run.js +45 -44
- package/dist/tlapm.cjs +1 -1
- package/dist/tlapm.js +2 -2
- package/dist/transfer.cjs +43 -40
- package/dist/transfer.js +43 -40
- package/dist/worker.cjs +7 -7
- package/dist/worker.js +7 -7
- package/package.json +1 -1
- package/src/ast.ts +3 -3
- package/src/bags.ts +46 -28
- package/src/check-trace.ts +2 -16
- package/src/check.ts +336 -88
- package/src/cli/runtime-invariants.ts +20 -56
- package/src/cli/tlapm.ts +424 -62
- package/src/cli/tlc-arguments.ts +2 -2
- package/src/cli/tlc-output.ts +4 -5
- package/src/cli/tlc-usage.ts +0 -1
- package/src/cli/tlc.ts +26 -7
- package/src/dependencies.ts +23 -2
- package/src/dfid.ts +9 -2
- package/src/environment.ts +27 -5
- package/src/errors.ts +30 -3
- package/src/evaluate.ts +9 -3
- package/src/exit-codes.ts +5 -2
- package/src/instances.ts +1 -1
- package/src/levels.ts +3 -2
- package/src/lexer.ts +5 -3
- package/src/liveness-checker.ts +572 -204
- package/src/liveness.ts +47 -32
- package/src/obligations/action.ts +10 -6
- package/src/obligations/anonymize.ts +33 -14
- package/src/obligations/enabled-axioms.ts +218 -0
- package/src/obligations/equality.ts +1 -3
- package/src/obligations/expression.ts +18 -6
- package/src/obligations/format.ts +0 -2
- package/src/obligations/generate.ts +22 -17
- package/src/obligations/index.ts +36 -6
- package/src/obligations/levels.ts +24 -11
- package/src/obligations/module.ts +1 -3
- package/src/obligations/normalize.ts +24 -13
- package/src/obligations/operators.ts +0 -2
- package/src/obligations/pragma.ts +53 -16
- package/src/obligations/printer.ts +43 -13
- package/src/obligations/proof.ts +3 -2
- package/src/obligations/regroup.ts +0 -2
- package/src/obligations/simplify.ts +17 -7
- package/src/obligations/source.ts +71 -17
- package/src/obligations/subexpression.ts +45 -18
- package/src/obligations/substitution.ts +1 -3
- package/src/obligations/temporal.ts +0 -2
- package/src/obligations/tuples.ts +0 -2
- package/src/parallel-worker.ts +8 -2
- package/src/parallel.ts +7 -2
- package/src/parser.ts +633 -186
- package/src/pretty-print.ts +1 -1
- package/src/prover/deciders.ts +11 -8
- package/src/prover/isabelle/decide.ts +3 -25
- package/src/prover/isabelle/encode.ts +71 -41
- 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 +149 -3
- package/src/prover/isabelle/isar/method.ts +506 -198
- 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 +479 -69
- package/src/prover/isabelle/isar/toplevel.ts +331 -0
- package/src/prover/isabelle/isar/type-check.ts +83 -8
- package/src/prover/isabelle/provers/blast/blast.ts +0 -2
- 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 +2 -4
- package/src/prover/isabelle/pure/bicompose.ts +0 -2
- package/src/prover/isabelle/pure/consts.ts +0 -2
- package/src/prover/isabelle/pure/conv.ts +0 -2
- package/src/prover/isabelle/pure/drule.ts +63 -4
- 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 +0 -2
- 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 +0 -2
- package/src/prover/isabelle/pure/rewriter.ts +1 -8
- 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 +0 -2
- package/src/prover/isabelle/pure/tactic.ts +0 -2
- package/src/prover/isabelle/pure/tactical.ts +0 -2
- package/src/prover/isabelle/pure/term-ord.ts +0 -2
- package/src/prover/isabelle/pure/term.ts +0 -2
- package/src/prover/isabelle/pure/thm.ts +0 -2
- 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 +1 -2
- package/src/prover/isabelle/tla/context.ts +51 -9
- package/src/prover/isabelle/tla/logic-data.ts +1 -1
- package/src/prover/isabelle/tla/logic.ts +40 -1
- package/src/prover/isabelle/tla/simpdata.ts +0 -2
- package/src/prover/isabelle/tools/intuitionistic.ts +28 -12
- package/src/prover/ocaml.ts +4 -1
- package/src/prover/prep/action.ts +19 -12
- package/src/prover/prep/enabled-axioms.ts +11 -2
- package/src/prover/prep/methods.ts +159 -50
- package/src/prover/prep/normalize.ts +38 -9
- package/src/prover/prove.ts +343 -65
- 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 +42 -6
- package/src/prover/smt/data.ts +191 -84
- package/src/prover/smt/encode.ts +122 -43
- 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 +483 -116
- package/src/prover/smt/simplify.ts +441 -0
- package/src/prover/smt/solver/ackermannize-bv-tactic.ts +61 -0
- package/src/prover/smt/solver/ackr-helper.ts +179 -0
- package/src/prover/smt/solver/ackr-model-converter.ts +105 -0
- package/src/prover/smt/solver/act-cache.ts +0 -1
- package/src/prover/smt/solver/add-bounds-tactic.ts +59 -0
- package/src/prover/smt/solver/aig-tactic.ts +52 -0
- package/src/prover/smt/solver/aig.ts +889 -0
- package/src/prover/smt/solver/arith-rewriter.ts +613 -6
- package/src/prover/smt/solver/arith-terms.ts +121 -0
- package/src/prover/smt/solver/array-decl-plugin.ts +175 -0
- package/src/prover/smt/solver/array-rewriter.ts +309 -0
- package/src/prover/smt/solver/asserted-formulas.ts +93 -15
- 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 +1448 -41
- package/src/prover/smt/solver/auf-solver.ts +0 -1
- package/src/prover/smt/solver/bit-blast-tactic.ts +582 -0
- package/src/prover/smt/solver/bit-blaster.ts +871 -0
- package/src/prover/smt/solver/bound-manager.ts +196 -0
- package/src/prover/smt/solver/bound-simplifier.ts +600 -0
- package/src/prover/smt/solver/bv-bound-chk.ts +492 -0
- package/src/prover/smt/solver/bv-decl-plugin.ts +338 -0
- package/src/prover/smt/solver/bv-divrem-bounds.ts +95 -0
- package/src/prover/smt/solver/bv-rewriter.ts +1901 -0
- package/src/prover/smt/solver/bv1-blast.ts +214 -0
- package/src/prover/smt/solver/bv2fpa-converter.ts +174 -0
- package/src/prover/smt/solver/bv2int-rewriter.ts +544 -0
- package/src/prover/smt/solver/bv2real-rewriter.ts +533 -0
- package/src/prover/smt/solver/card2bv.ts +109 -0
- package/src/prover/smt/solver/case-split-queue.ts +0 -2
- package/src/prover/smt/solver/cg-table.ts +39 -25
- package/src/prover/smt/solver/check-logic.ts +330 -0
- package/src/prover/smt/solver/clause.ts +0 -1
- package/src/prover/smt/solver/cofactor-elim-term-ite.ts +278 -0
- package/src/prover/smt/solver/conflict-resolution.ts +78 -2
- package/src/prover/smt/solver/context.ts +533 -114
- package/src/prover/smt/solver/ctx-simplify.ts +21 -12
- package/src/prover/smt/solver/ctx-solver-simplify.ts +122 -0
- package/src/prover/smt/solver/datatype-decl-plugin.ts +572 -0
- package/src/prover/smt/solver/datatype-rewriter.ts +82 -0
- package/src/prover/smt/solver/demodulator.ts +786 -0
- package/src/prover/smt/solver/dependent-expr-state.ts +81 -0
- package/src/prover/smt/solver/der.ts +38 -10
- package/src/prover/smt/solver/diff-neq.ts +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 +260 -0
- package/src/prover/smt/solver/dyn-ack.ts +0 -1
- package/src/prover/smt/solver/e-matching.ts +6 -7
- package/src/prover/smt/solver/elim-small-bv-tactic.ts +129 -0
- package/src/prover/smt/solver/elim-uncnstr.ts +542 -0
- package/src/prover/smt/solver/enode.ts +100 -3
- package/src/prover/smt/solver/eq2bv-tactic.ts +218 -0
- package/src/prover/smt/solver/euf/arith-axioms.ts +403 -0
- package/src/prover/smt/solver/euf/arith-internalize.ts +653 -0
- package/src/prover/smt/solver/euf/arith-solver.ts +889 -0
- package/src/prover/smt/solver/euf/array-axioms.ts +527 -0
- package/src/prover/smt/solver/euf/array-internalize.ts +428 -0
- package/src/prover/smt/solver/euf/array-solver.ts +306 -0
- package/src/prover/smt/solver/euf/bv-ackerman.ts +162 -0
- package/src/prover/smt/solver/euf/bv-internalize.ts +748 -0
- package/src/prover/smt/solver/euf/bv-solver.ts +449 -0
- package/src/prover/smt/solver/euf/dt-solver.ts +618 -0
- package/src/prover/smt/solver/euf/egraph.ts +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 +267 -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 +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 +348 -0
- package/src/prover/smt/solver/fpa2bv-tactic.ts +73 -0
- package/src/prover/smt/solver/goal.ts +177 -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 +30 -16
- package/src/prover/smt/solver/inf-eps.ts +63 -0
- package/src/prover/smt/solver/inj-axiom.ts +101 -0
- package/src/prover/smt/solver/internalizer.ts +109 -36
- package/src/prover/smt/solver/lackr.ts +381 -0
- package/src/prover/smt/solver/lbool.ts +0 -1
- package/src/prover/smt/solver/lia2card.ts +268 -0
- package/src/prover/smt/solver/lia2pb.ts +154 -0
- package/src/prover/smt/solver/literal.ts +0 -1
- package/src/prover/smt/solver/logic-tactics.ts +345 -0
- package/src/prover/smt/solver/lp/bound-propagator.ts +0 -1
- package/src/prover/smt/solver/lp/constraints.ts +0 -1
- package/src/prover/smt/solver/lp/containers.ts +7 -2
- package/src/prover/smt/solver/lp/core-solver.ts +18 -3
- 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 +0 -2
- 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 +0 -1
- package/src/prover/smt/solver/lp/hnf.ts +0 -3
- package/src/prover/smt/solver/lp/int-cube.ts +3 -4
- package/src/prover/smt/solver/lp/int-solver.ts +0 -2
- package/src/prover/smt/solver/lp/lar-solver.ts +40 -4
- package/src/prover/smt/solver/lp/lar-term.ts +0 -1
- package/src/prover/smt/solver/lp/lp-settings.ts +0 -1
- package/src/prover/smt/solver/lp/maximize-term.ts +59 -10
- package/src/prover/smt/solver/lp/nex-creator.ts +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 +66 -11
- package/src/prover/smt/solver/lp/nla-divisions.ts +0 -2
- package/src/prover/smt/solver/lp/nla-emonics.ts +0 -1
- package/src/prover/smt/solver/lp/nla-factorization.ts +0 -1
- package/src/prover/smt/solver/lp/nla-grobner.ts +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 +118 -88
- package/src/prover/smt/solver/mam-interpreter.ts +0 -1
- package/src/prover/smt/solver/max-bv-sharing-tactic.ts +17 -0
- package/src/prover/smt/solver/max-cliques.ts +105 -0
- package/src/prover/smt/solver/maxcore.ts +309 -0
- package/src/prover/smt/solver/maximize-ac-sharing.ts +8 -6
- package/src/prover/smt/solver/maxlex.ts +115 -0
- package/src/prover/smt/solver/maxsmt-base.ts +105 -0
- package/src/prover/smt/solver/maxsmt.ts +92 -0
- package/src/prover/smt/solver/mbp/mbp-arith.ts +467 -0
- package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +101 -0
- package/src/prover/smt/solver/mbp/mbp-plugin.ts +287 -0
- package/src/prover/smt/solver/mbp/mbp-qel.ts +48 -0
- package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +271 -0
- package/src/prover/smt/solver/mbp/mbp-term-graph.ts +606 -0
- package/src/prover/smt/solver/model-based-opt.ts +844 -0
- package/src/prover/smt/solver/model-checker.ts +17 -26
- package/src/prover/smt/solver/model-evaluator.ts +188 -12
- package/src/prover/smt/solver/model-finder.ts +0 -1
- package/src/prover/smt/solver/model-generator.ts +59 -30
- package/src/prover/smt/solver/model-macro-solver.ts +38 -27
- 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 +410 -0
- package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +97 -0
- package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +167 -0
- package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +125 -0
- package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +299 -0
- package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +455 -0
- package/src/prover/smt/solver/muz/dl-mk-slice.ts +340 -0
- package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +163 -0
- package/src/prover/smt/solver/muz/dl-rule-set.ts +273 -0
- package/src/prover/smt/solver/muz/dl-rule-transformer.ts +123 -0
- package/src/prover/smt/solver/muz/dl-rule.ts +496 -0
- package/src/prover/smt/solver/muz/hnf.ts +201 -0
- package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +176 -0
- package/src/prover/smt/solver/muz/horn-tactic.ts +201 -0
- package/src/prover/smt/solver/muz/rule-properties.ts +337 -0
- package/src/prover/smt/solver/muz/spacer-context.ts +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 +305 -88
- package/src/prover/smt/solver/nlsat/atoms.ts +52 -35
- package/src/prover/smt/solver/nlsat/evaluator.ts +0 -1
- package/src/prover/smt/solver/nlsat/explain.ts +424 -211
- package/src/prover/smt/solver/nlsat/interval-set.ts +1 -2
- package/src/prover/smt/solver/nlsat/levelwise.ts +460 -241
- package/src/prover/smt/solver/nlsat/mpbq.ts +45 -1
- package/src/prover/smt/solver/nlsat/polynomial.ts +2366 -683
- package/src/prover/smt/solver/nlsat/solver.ts +282 -69
- 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 +8 -7
- 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 +105 -23
- package/src/prover/smt/solver/normalize-bounds.ts +53 -0
- package/src/prover/smt/solver/occf.ts +97 -0
- package/src/prover/smt/solver/opt-context.ts +792 -0
- package/src/prover/smt/solver/opt-nlsat.ts +386 -0
- package/src/prover/smt/solver/opt-pareto.ts +282 -0
- package/src/prover/smt/solver/opt-preprocess.ts +101 -0
- package/src/prover/smt/solver/opt-solver.ts +311 -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 +540 -0
- package/src/prover/smt/solver/poly-rewriter.ts +202 -57
- package/src/prover/smt/solver/probes.ts +511 -0
- package/src/prover/smt/solver/propagate-values.ts +37 -21
- package/src/prover/smt/solver/proto-model.ts +650 -17
- package/src/prover/smt/solver/pull-quant.ts +28 -12
- package/src/prover/smt/solver/purify-arith.ts +632 -0
- package/src/prover/smt/solver/qe-arith-plugin.ts +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 +37 -17
- 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 +814 -0
- package/src/prover/smt/solver/quant-hoist.ts +196 -0
- package/src/prover/smt/solver/quant-tactics.ts +16 -56
- package/src/prover/smt/solver/quantifier-analyzer.ts +9 -10
- package/src/prover/smt/solver/quantifier-manager.ts +25 -24
- 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 +77 -10
- package/src/prover/smt/solver/rewriter.ts +475 -36
- package/src/prover/smt/solver/rlimit.ts +38 -2
- package/src/prover/smt/solver/sat/asymm-branch.ts +325 -0
- package/src/prover/smt/solver/sat/big.ts +177 -0
- package/src/prover/smt/solver/sat/clause-use-list.ts +71 -0
- package/src/prover/smt/solver/sat/clause.ts +203 -0
- package/src/prover/smt/solver/sat/cleaner.ts +94 -0
- package/src/prover/smt/solver/sat/config.ts +122 -0
- package/src/prover/smt/solver/sat/consequences.ts +203 -0
- package/src/prover/smt/solver/sat/elim-eqs.ts +142 -0
- package/src/prover/smt/solver/sat/goal2sat.ts +526 -0
- package/src/prover/smt/solver/sat/inc-sat-solver.ts +378 -0
- package/src/prover/smt/solver/sat/model-converter.ts +136 -0
- package/src/prover/smt/solver/sat/pb-constraint.ts +261 -0
- package/src/prover/smt/solver/sat/pb-solver.ts +1577 -0
- package/src/prover/smt/solver/sat/probing.ts +170 -0
- package/src/prover/smt/solver/sat/sat-tactic.ts +44 -0
- package/src/prover/smt/solver/sat/sat2goal.ts +165 -0
- package/src/prover/smt/solver/sat/scc.ts +142 -0
- package/src/prover/smt/solver/sat/simplifier.ts +1618 -0
- package/src/prover/smt/solver/sat/solver.ts +2105 -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 +90 -0
- package/src/prover/smt/solver/smt-logics.ts +66 -0
- package/src/prover/smt/solver/smt-setup.ts +496 -0
- package/src/prover/smt/solver/smt2-printer.ts +765 -0
- package/src/prover/smt/solver/smtlib-parser.ts +3154 -326
- package/src/prover/smt/solver/smtlib-script.ts +1702 -0
- package/src/prover/smt/solver/solve-eqs.ts +923 -0
- package/src/prover/smt/solver/solver.ts +113 -22
- package/src/prover/smt/solver/static-features.ts +314 -0
- package/src/prover/smt/solver/sticky-generations.ts +0 -1
- package/src/prover/smt/solver/tactic.ts +1995 -0
- package/src/prover/smt/solver/term-enumeration.ts +205 -0
- package/src/prover/smt/solver/theory-array.ts +1240 -0
- package/src/prover/smt/solver/theory-bv.ts +1200 -0
- package/src/prover/smt/solver/theory-char.ts +355 -0
- package/src/prover/smt/solver/theory-datatype.ts +598 -0
- package/src/prover/smt/solver/theory-finite-set.ts +30 -0
- package/src/prover/smt/solver/theory-fpa.ts +389 -0
- package/src/prover/smt/solver/theory-lra-axioms.ts +53 -2
- package/src/prover/smt/solver/theory-lra-bounds.ts +31 -5
- package/src/prover/smt/solver/theory-lra-final-check.ts +56 -71
- package/src/prover/smt/solver/theory-lra-internalize.ts +89 -11
- package/src/prover/smt/solver/theory-lra-model.ts +20 -35
- package/src/prover/smt/solver/theory-lra-propagate.ts +24 -28
- package/src/prover/smt/solver/theory-lra-state.ts +6 -22
- package/src/prover/smt/solver/theory-lra.ts +188 -2
- package/src/prover/smt/solver/theory-pb.ts +933 -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.ts +189 -0
- package/src/prover/smt/solver/tseitin-cnf.ts +485 -0
- package/src/prover/smt/solver/var-subst.ts +36 -14
- package/src/prover/smt/table.ts +3 -2
- package/src/prover/smt/types.ts +146 -0
- package/src/prover/tlapm/cache.ts +29 -8
- package/src/prover/tlapm-library.ts +3208 -0
- package/src/prover/verdict.ts +2 -0
- package/src/prover/zenon/decide.ts +10 -7
- package/src/prover/zenon/encode.ts +0 -2
- package/src/prover/zenon/eqrel.ts +0 -2
- package/src/prover/zenon/equality-rules.ts +24 -2
- package/src/prover/zenon/expr.ts +21 -2
- package/src/prover/zenon/index-table.ts +7 -4
- package/src/prover/zenon/isar-case.ts +1 -3
- package/src/prover/zenon/isar.ts +2 -4
- package/src/prover/zenon/llproof.ts +0 -2
- package/src/prover/zenon/mltoll.ts +0 -2
- package/src/prover/zenon/node.ts +20 -5
- package/src/prover/zenon/parse.ts +6 -2
- 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 +7 -5
- package/src/prover/zenon/tla/functions.ts +0 -2
- package/src/prover/zenon/tla/llproof.ts +0 -2
- package/src/prover/zenon/tla/records.ts +0 -2
- package/src/prover/zenon/tla/rewrites.ts +0 -2
- package/src/prover/zenon/tla/sets.ts +7 -8
- package/src/prover/zenon/tla/terms.ts +0 -2
- package/src/prover/zenon/tla/tla.ts +0 -2
- package/src/resolve.ts +72 -36
- package/src/runtime.ts +6 -0
- package/src/sany/generation.ts +1 -13
- package/src/sany/generator-definitions.ts +1 -1
- package/src/sany/generator-expressions.ts +9 -17
- package/src/sany/generator-proofs.ts +1 -1
- package/src/sany/generator.ts +1 -1
- package/src/sany/levels.ts +0 -2
- package/src/sany/linter.ts +0 -2
- package/src/search.ts +198 -45
- package/src/simulate.ts +3 -0
- package/src/standard-definitions.ts +4 -0
- package/src/state-graph.ts +0 -2
- package/src/subexpressions.ts +4 -2
- package/src/successors.ts +1 -1
- package/src/symmetry.ts +2 -2
- package/src/tableau.ts +2 -2
- package/src/tlc/fingerprint.ts +81 -9
- package/src/tlc/jar-data.ts +12 -0
- package/src/tlc/order.ts +14 -3
- package/src/tlc/summary.ts +29 -14
- package/src/tlc/tlcext-operators.ts +61 -16
- package/src/tlc/trace-spec.ts +2 -3
- package/src/typed-tier.ts +6541 -0
- package/src/typescript/types.ts +2 -2
- package/src/values.ts +1 -1
- package/src/prover/isabelle/isar/statement.ts +0 -52
- package/src/prover/smt/solver/z3-license.txt +0 -10
- package/src/prover/tlaps-module.ts +0 -510
- package/src/prover/zenon/LICENSE +0 -32
|
@@ -1,5 +1,3 @@
|
|
|
1
|
-
// Ported from Z3 (src/math/lp/nla_grobner.h, src/math/lp/nla_grobner.cpp), MIT license, see z3-license.txt.
|
|
2
|
-
// Deviation from Z3: its nlsat conflict check (is_nla_conflict) is not ported.
|
|
3
1
|
import { PddMemoryOutError } from "../../../../errors";
|
|
4
2
|
import { getEuclideanMod, getGcd, getLcm, Rational } from "../rational";
|
|
5
3
|
import { KIND_EQ, KIND_GE, KIND_LE, KIND_LT, KIND_NE } from "./constraints";
|
|
@@ -97,9 +95,9 @@ const isPerfectSquareCross = (
|
|
|
97
95
|
};
|
|
98
96
|
|
|
99
97
|
export class Grobner {
|
|
100
|
-
private
|
|
101
|
-
private
|
|
102
|
-
private
|
|
98
|
+
private propagatesQuotients = false;
|
|
99
|
+
private hasGcdTest = false;
|
|
100
|
+
private expandsTerms = false;
|
|
103
101
|
private readonly manager: PddManager;
|
|
104
102
|
private readonly solver: PddSolver;
|
|
105
103
|
private readonly nexCreator = new NexCreator();
|
|
@@ -116,6 +114,12 @@ export class Grobner {
|
|
|
116
114
|
this.solver = new PddSolver(this.manager, () => core.isCanceled());
|
|
117
115
|
}
|
|
118
116
|
|
|
117
|
+
updateParams() {
|
|
118
|
+
this.propagatesQuotients = NLA_PARAMS.grobnerPropagateQuotients;
|
|
119
|
+
this.hasGcdTest = NLA_PARAMS.grobnerGcdTest;
|
|
120
|
+
this.expandsTerms = NLA_PARAMS.grobnerExpandTerms;
|
|
121
|
+
}
|
|
122
|
+
|
|
119
123
|
run() {
|
|
120
124
|
if (this.core.lra.getColumnCount() > 5000) return;
|
|
121
125
|
if (this.quota === 0) this.quota = NLA_PARAMS.grQ;
|
|
@@ -219,8 +223,12 @@ export class Grobner {
|
|
|
219
223
|
if (!poly.isOffset()) return false;
|
|
220
224
|
const variable = poly.var();
|
|
221
225
|
if (this.core.varIsFixed(variable)) return false;
|
|
222
|
-
const
|
|
223
|
-
const
|
|
226
|
+
const hi = poly.hi();
|
|
227
|
+
const coeff = hi.val();
|
|
228
|
+
hi.release();
|
|
229
|
+
const lo = poly.lo();
|
|
230
|
+
const offset = lo.val().neg();
|
|
231
|
+
lo.release();
|
|
224
232
|
const lcm = getRationalLcm(getDenominator(coeff), getDenominator(offset));
|
|
225
233
|
const ineq = mkIneq(new LarTerm([[variable, coeff.mul(lcm)]]), KIND_EQ, offset.mul(lcm));
|
|
226
234
|
return this.addLemmaUnlessHolds(equation, ineq);
|
|
@@ -234,31 +242,49 @@ export class Grobner {
|
|
|
234
242
|
|
|
235
243
|
private propagateFactorizationOf(equation: Equation) {
|
|
236
244
|
const factors = equation.poly.varFactors();
|
|
237
|
-
if (factors.vars.length === 0 || !factors.poly.isLinear())
|
|
245
|
+
if (factors.vars.length === 0 || !factors.poly.isLinear()) {
|
|
246
|
+
factors.poly.release();
|
|
247
|
+
return false;
|
|
248
|
+
}
|
|
238
249
|
const linear = this.linearToTerm(factors.poly);
|
|
239
250
|
const ineqs = factors.vars.map((variable) => mkIneq(variable, KIND_EQ, 0));
|
|
240
251
|
ineqs.push(mkIneq(linear.term, KIND_EQ, linear.offset.neg()));
|
|
241
|
-
if (ineqs.some((ineq) => this.core.ineqHolds(ineq)))
|
|
252
|
+
if (ineqs.some((ineq) => this.core.ineqHolds(ineq))) {
|
|
253
|
+
factors.poly.release();
|
|
254
|
+
return false;
|
|
255
|
+
}
|
|
242
256
|
const lemma = this.addDependencies(new LemmaBuilder(this.core), equation);
|
|
243
257
|
for (const ineq of ineqs) lemma.addIneq(ineq);
|
|
258
|
+
factors.poly.release();
|
|
244
259
|
return true;
|
|
245
260
|
}
|
|
246
261
|
|
|
247
262
|
private linearToTerm(poly: Pdd): LinearTerm {
|
|
263
|
+
const termPoly = poly.copy();
|
|
248
264
|
let lcm = Rational.one;
|
|
249
|
-
|
|
250
|
-
while (!
|
|
251
|
-
|
|
252
|
-
|
|
253
|
-
|
|
254
|
-
|
|
265
|
+
const lcmPoly = termPoly.copy();
|
|
266
|
+
while (!lcmPoly.isVal()) {
|
|
267
|
+
const hi = lcmPoly.hi();
|
|
268
|
+
lcm = getRationalLcm(lcm, getDenominator(hi.val()));
|
|
269
|
+
hi.release();
|
|
270
|
+
const lo = lcmPoly.lo();
|
|
271
|
+
lcmPoly.assign(lo);
|
|
272
|
+
lo.release();
|
|
273
|
+
}
|
|
274
|
+
lcm = getRationalLcm(getDenominator(lcmPoly.val()), lcm);
|
|
255
275
|
const term = new LarTerm();
|
|
256
|
-
|
|
257
|
-
|
|
258
|
-
term.addMonomial(lcm.mul(
|
|
259
|
-
|
|
276
|
+
while (!termPoly.isVal()) {
|
|
277
|
+
const hi = termPoly.hi();
|
|
278
|
+
term.addMonomial(lcm.mul(hi.val()), termPoly.var());
|
|
279
|
+
hi.release();
|
|
280
|
+
const lo = termPoly.lo();
|
|
281
|
+
termPoly.assign(lo);
|
|
282
|
+
lo.release();
|
|
260
283
|
}
|
|
261
|
-
|
|
284
|
+
const offset = lcm.mul(termPoly.val());
|
|
285
|
+
lcmPoly.release();
|
|
286
|
+
termPoly.release();
|
|
287
|
+
return { term, offset };
|
|
262
288
|
}
|
|
263
289
|
|
|
264
290
|
private getValue(poly: Pdd) {
|
|
@@ -273,42 +299,61 @@ export class Grobner {
|
|
|
273
299
|
}
|
|
274
300
|
|
|
275
301
|
private propagateGcdTestOf(equation: Equation) {
|
|
276
|
-
|
|
277
|
-
|
|
278
|
-
|
|
279
|
-
|
|
280
|
-
|
|
281
|
-
|
|
282
|
-
|
|
283
|
-
|
|
284
|
-
|
|
285
|
-
const failsGcdTest = (substituted: Pdd) => {
|
|
286
|
-
let gcd = Rational.zero;
|
|
287
|
-
let constant = Rational.zero;
|
|
288
|
-
for (const value of substituted.coefficients()) {
|
|
289
|
-
if (value.isConstant) {
|
|
290
|
-
constant = constant.add(value.coeff);
|
|
291
|
-
continue;
|
|
292
|
-
}
|
|
293
|
-
gcd = getRationalGcd(gcd, value.coeff);
|
|
294
|
-
if (gcd.equals(Rational.one)) return false;
|
|
295
|
-
}
|
|
296
|
-
return !constant.isZero() && !divides(gcd, constant);
|
|
297
|
-
};
|
|
298
|
-
for (const entry of powers) {
|
|
299
|
-
if (entry.degree > 4) continue;
|
|
300
|
-
const scaled = manager.mkVar(entry.var).mul(manager.mkVal(Rational.fromNumber(entry.degree)));
|
|
301
|
-
let isGcdFailing = true;
|
|
302
|
-
for (let residue = 0; isGcdFailing && residue < entry.degree; residue++) {
|
|
303
|
-
const replacement = scaled.add(manager.mkVal(Rational.fromNumber(residue)));
|
|
304
|
-
if (!failsGcdTest(poly.substPdd(entry.var, replacement))) isGcdFailing = false;
|
|
302
|
+
const poly = equation.poly.copy();
|
|
303
|
+
try {
|
|
304
|
+
if (poly.isLinear() || poly.isVal() || !this.isIntPoly(poly)) return false;
|
|
305
|
+
if (this.getValue(poly).isZero()) return false;
|
|
306
|
+
const powers = poly.getPowers();
|
|
307
|
+
if (powers.length === 0) return false;
|
|
308
|
+
let lcm = Rational.one;
|
|
309
|
+
for (const value of poly.coefficients()) {
|
|
310
|
+
lcm = getRationalLcm(lcm, getDenominator(value.coeff));
|
|
305
311
|
}
|
|
306
|
-
if (
|
|
307
|
-
|
|
308
|
-
|
|
312
|
+
if (!lcm.equals(Rational.one)) poly.mulAssign(lcm);
|
|
313
|
+
const manager = this.manager;
|
|
314
|
+
const failsGcdTest = (substituted: Pdd) => {
|
|
315
|
+
let gcd = Rational.zero;
|
|
316
|
+
let constant = Rational.zero;
|
|
317
|
+
for (const value of substituted.coefficients()) {
|
|
318
|
+
if (value.isConstant) {
|
|
319
|
+
constant = constant.add(value.coeff);
|
|
320
|
+
continue;
|
|
321
|
+
}
|
|
322
|
+
gcd = getRationalGcd(gcd, value.coeff);
|
|
323
|
+
if (gcd.equals(Rational.one)) return false;
|
|
324
|
+
}
|
|
325
|
+
return !constant.isZero() && !divides(gcd, constant);
|
|
326
|
+
};
|
|
327
|
+
for (const entry of powers) {
|
|
328
|
+
if (entry.degree > 4) continue;
|
|
329
|
+
const variable = manager.mkVar(entry.var);
|
|
330
|
+
const degree = manager.mkVal(Rational.fromNumber(entry.degree));
|
|
331
|
+
const scaled = variable.mul(degree);
|
|
332
|
+
degree.release();
|
|
333
|
+
variable.release();
|
|
334
|
+
try {
|
|
335
|
+
let isGcdFailing = true;
|
|
336
|
+
for (let residue = 0; isGcdFailing && residue < entry.degree; residue++) {
|
|
337
|
+
const residuePdd = manager.mkVal(Rational.fromNumber(residue));
|
|
338
|
+
const replacement = scaled.add(residuePdd);
|
|
339
|
+
residuePdd.release();
|
|
340
|
+
const substituted = poly.substPdd(entry.var, replacement);
|
|
341
|
+
if (!failsGcdTest(substituted)) isGcdFailing = false;
|
|
342
|
+
substituted.release();
|
|
343
|
+
replacement.release();
|
|
344
|
+
}
|
|
345
|
+
if (isGcdFailing) {
|
|
346
|
+
this.addDependencies(new LemmaBuilder(this.core), equation);
|
|
347
|
+
return true;
|
|
348
|
+
}
|
|
349
|
+
} finally {
|
|
350
|
+
scaled.release();
|
|
351
|
+
}
|
|
309
352
|
}
|
|
353
|
+
return false;
|
|
354
|
+
} finally {
|
|
355
|
+
poly.release();
|
|
310
356
|
}
|
|
311
|
-
return false;
|
|
312
357
|
}
|
|
313
358
|
|
|
314
359
|
private propagateQuotientsOf(equation: Equation) {
|
|
@@ -325,11 +370,18 @@ export class Grobner {
|
|
|
325
370
|
if (this.propagateModResidue(equation)) return true;
|
|
326
371
|
let isLemmaFound = false;
|
|
327
372
|
for (const variable of nlVars) {
|
|
328
|
-
const
|
|
329
|
-
|
|
330
|
-
|
|
331
|
-
|
|
332
|
-
|
|
373
|
+
const lc = this.manager.zero();
|
|
374
|
+
const rest = this.manager.zero();
|
|
375
|
+
poly.factor(variable, 1, lc, rest);
|
|
376
|
+
if (rest.isLinear()) {
|
|
377
|
+
if (!lcm.equals(Rational.one)) {
|
|
378
|
+
lc.mulAssign(lcm);
|
|
379
|
+
rest.mulAssign(lcm);
|
|
380
|
+
}
|
|
381
|
+
if (this.addQuotientLemma(equation, variable, lc, rest)) isLemmaFound = true;
|
|
382
|
+
}
|
|
383
|
+
rest.release();
|
|
384
|
+
lc.release();
|
|
333
385
|
}
|
|
334
386
|
return isLemmaFound;
|
|
335
387
|
}
|
|
@@ -743,28 +795,38 @@ export class Grobner {
|
|
|
743
795
|
}
|
|
744
796
|
|
|
745
797
|
private getTermPdd(term: LarTerm, ref: DepRef) {
|
|
746
|
-
|
|
747
|
-
for (const entry of term.coeffs)
|
|
798
|
+
const result = this.manager.mkVal(Rational.zero);
|
|
799
|
+
for (const entry of term.coeffs) {
|
|
800
|
+
const expr = this.getPddExpr(entry[1], entry[0], ref);
|
|
801
|
+
result.addAssign(expr);
|
|
802
|
+
expr.release();
|
|
803
|
+
}
|
|
748
804
|
return result;
|
|
749
805
|
}
|
|
750
806
|
|
|
751
807
|
private getPddExpr(coeff: Rational, lpVar: number, ref: DepRef) {
|
|
752
808
|
const core = this.core;
|
|
753
|
-
|
|
809
|
+
const result = this.manager.mkVal(coeff);
|
|
754
810
|
const vars = [lpVar];
|
|
755
811
|
const zeroRef = { dep: ref.dep };
|
|
756
812
|
for (let current = vars.pop(); current !== undefined; current = vars.pop()) {
|
|
757
813
|
if (NLA_PARAMS.grobnerSubsFixed > 0 && core.varIsFixedToZero(current)) {
|
|
758
|
-
|
|
814
|
+
const fixed = this.manager.mkVal(this.getValOfFixedVarWithDeps(current, zeroRef));
|
|
815
|
+
result.assign(fixed);
|
|
816
|
+
fixed.release();
|
|
759
817
|
ref.dep = zeroRef.dep;
|
|
760
818
|
return result;
|
|
761
819
|
}
|
|
762
820
|
if (NLA_PARAMS.grobnerSubsFixed === 1 && core.varIsFixed(current)) {
|
|
763
|
-
result
|
|
821
|
+
result.mulAssign(this.getValOfFixedVarWithDeps(current, ref));
|
|
764
822
|
} else if (this.expandsTerms && core.lra.hasTerm(current)) {
|
|
765
|
-
|
|
823
|
+
const termPdd = this.getTermPdd(core.lra.getTerm(current), ref);
|
|
824
|
+
result.mulAssign(termPdd);
|
|
825
|
+
termPdd.release();
|
|
766
826
|
} else if (!core.isMonicVar(current)) {
|
|
767
|
-
|
|
827
|
+
const variable = this.manager.mkVar(current);
|
|
828
|
+
result.mulAssign(variable);
|
|
829
|
+
variable.release();
|
|
768
830
|
} else {
|
|
769
831
|
vars.push(...core.emons.get(current).vars);
|
|
770
832
|
}
|
|
@@ -772,17 +834,20 @@ export class Grobner {
|
|
|
772
834
|
return result;
|
|
773
835
|
}
|
|
774
836
|
|
|
775
|
-
private getSolvedForm(poly: Pdd) {
|
|
837
|
+
private getSolvedForm(poly: Pdd, solution: Pdd) {
|
|
776
838
|
if (!poly.isLinear()) return null;
|
|
839
|
+
solution.assign(poly);
|
|
777
840
|
let numLo = 0;
|
|
778
841
|
let numHi = 0;
|
|
779
842
|
let lo = 0;
|
|
780
843
|
let hi = 0;
|
|
781
844
|
let loCoeff = Rational.zero;
|
|
782
845
|
let hiCoeff = Rational.zero;
|
|
783
|
-
|
|
784
|
-
const variable =
|
|
785
|
-
const
|
|
846
|
+
while (!solution.isVal()) {
|
|
847
|
+
const variable = solution.var();
|
|
848
|
+
const hiPoly = solution.hi();
|
|
849
|
+
const value = hiPoly.val();
|
|
850
|
+
hiPoly.release();
|
|
786
851
|
const type = this.core.lra.core.getColumnType(variable);
|
|
787
852
|
if (type === COLUMN_LOWER || type === COLUMN_UPPER) {
|
|
788
853
|
if (value.isPositive() === (type === COLUMN_LOWER)) {
|
|
@@ -798,51 +863,68 @@ export class Grobner {
|
|
|
798
863
|
return null;
|
|
799
864
|
}
|
|
800
865
|
if (numLo > 1 && numHi > 1) return null;
|
|
866
|
+
const loPoly = solution.lo();
|
|
867
|
+
solution.assign(loPoly);
|
|
868
|
+
loPoly.release();
|
|
801
869
|
}
|
|
802
870
|
const isLo = numLo === 1 && numHi > 1;
|
|
803
871
|
if (!isLo && !(numHi === 1 && numLo > 1)) return null;
|
|
804
872
|
const variable = isLo ? lo : hi;
|
|
805
873
|
const coeff = isLo ? loCoeff : hiCoeff;
|
|
806
|
-
const
|
|
807
|
-
|
|
808
|
-
|
|
809
|
-
|
|
810
|
-
|
|
874
|
+
const variablePdd = this.manager.mkVar(variable);
|
|
875
|
+
const scaled = variablePdd.mul(coeff);
|
|
876
|
+
const difference = scaled.sub(poly);
|
|
877
|
+
solution.assign(difference);
|
|
878
|
+
difference.release();
|
|
879
|
+
scaled.release();
|
|
880
|
+
variablePdd.release();
|
|
881
|
+
if (!coeff.equals(Rational.one)) solution.mulAssign(Rational.one.div(coeff));
|
|
882
|
+
return variable;
|
|
811
883
|
}
|
|
812
884
|
|
|
813
885
|
private addEq(poly: Pdd, dep: Dependency) {
|
|
814
|
-
const
|
|
815
|
-
const
|
|
816
|
-
|
|
817
|
-
|
|
886
|
+
const solution = this.manager.zero();
|
|
887
|
+
const simplifiedDep = this.solver.simplify(poly, dep);
|
|
888
|
+
const variable = this.getSolvedForm(poly, solution);
|
|
889
|
+
if (variable === null) this.solver.add(poly, simplifiedDep);
|
|
890
|
+
else this.solver.addSubst(variable, solution, simplifiedDep);
|
|
891
|
+
solution.release();
|
|
818
892
|
}
|
|
819
893
|
|
|
820
894
|
private addFixedMonic(lpVar: number) {
|
|
821
895
|
const ref: DepRef = { dep: null };
|
|
822
|
-
|
|
896
|
+
const product = this.manager.mkVal(Rational.one);
|
|
823
897
|
for (const factor of this.core.emons.get(lpVar).vars) {
|
|
824
|
-
|
|
898
|
+
const expr = this.getPddExpr(Rational.one, factor, ref);
|
|
899
|
+
product.mulAssign(expr);
|
|
900
|
+
expr.release();
|
|
825
901
|
}
|
|
826
|
-
product
|
|
902
|
+
product.subAssign(this.getValOfFixedVarWithDeps(lpVar, ref));
|
|
827
903
|
this.addEq(product, ref.dep);
|
|
904
|
+
product.release();
|
|
828
905
|
}
|
|
829
906
|
|
|
830
907
|
private addRow(row: RowCell[]) {
|
|
831
908
|
const ref: DepRef = { dep: null };
|
|
832
|
-
|
|
833
|
-
for (const cell of row)
|
|
909
|
+
const sum = this.manager.mkVal(Rational.zero);
|
|
910
|
+
for (const cell of row) {
|
|
911
|
+
const expr = this.getPddExpr(cell.coeff, cell.column, ref);
|
|
912
|
+
sum.addAssign(expr);
|
|
913
|
+
expr.release();
|
|
914
|
+
}
|
|
834
915
|
this.addEq(sum, ref.dep);
|
|
916
|
+
sum.release();
|
|
835
917
|
}
|
|
836
918
|
|
|
837
919
|
private setLevel2var() {
|
|
838
920
|
const core = this.core;
|
|
839
921
|
const count = core.lra.getColumnCount();
|
|
840
|
-
const weights = Array.from({ length: count }, (
|
|
922
|
+
const weights = Array.from({ length: count }, (_value, lpVar) => core.getVarWeight(lpVar));
|
|
841
923
|
for (let lpVar = 0; lpVar < count; lpVar++) {
|
|
842
924
|
if (!core.isMonicVar(lpVar) || !core.toRefine.has(lpVar)) continue;
|
|
843
925
|
for (const factor of core.emons.get(lpVar).vars) weights[factor] += 6;
|
|
844
926
|
}
|
|
845
|
-
const level2var = Array.from({ length: count }, (
|
|
927
|
+
const level2var = Array.from({ length: count }, (_value, lpVar) => lpVar).sort(
|
|
846
928
|
(first, second) => weights[first] - weights[second] || first - second,
|
|
847
929
|
);
|
|
848
930
|
this.manager.reset(level2var);
|
|
@@ -1,5 +1,3 @@
|
|
|
1
|
-
// Ported from Z3 (src/math/lp/horner.h, src/math/lp/horner.cpp, and nexvar, create_sum_from_row,
|
|
2
|
-
// and add_deps_of_fixed from src/math/lp/nla_common.cpp), MIT license, see z3-license.txt.
|
|
3
1
|
import { Rational } from "../rational";
|
|
4
2
|
import { CrossNested } from "./cross-nested";
|
|
5
3
|
import { type Dependency, mkJoin } from "./dependency";
|
|
@@ -1,5 +1,3 @@
|
|
|
1
|
-
// Ported from Z3 (src/math/lp/monomial_bounds.{h,cpp}, src/util/mpq.h root), MIT license, see
|
|
2
|
-
// z3-license.txt.
|
|
3
1
|
import { getLcm, Rational } from "../rational";
|
|
4
2
|
import { type ConstraintKind, KIND_EQ, KIND_GE, KIND_GT, KIND_LE, KIND_LT } from "./constraints";
|
|
5
3
|
import {
|
|
@@ -1,4 +1,3 @@
|
|
|
1
|
-
// Ported from Z3 (src/math/lp/nla_monotone_lemmas.h, src/math/lp/nla_monotone_lemmas.cpp), MIT license, see z3-license.txt.
|
|
2
1
|
import { Rational } from "../rational";
|
|
3
2
|
import { KIND_GE, KIND_GT, KIND_LE, KIND_LT } from "./constraints";
|
|
4
3
|
import { type NlaCore } from "./nla-core";
|
|
@@ -1,5 +1,3 @@
|
|
|
1
|
-
// Ported from Z3 (src/math/lp/nla_order_lemmas.h, src/math/lp/nla_order_lemmas.cpp), MIT license,
|
|
2
|
-
// see z3-license.txt.
|
|
3
1
|
import { Rational } from "../rational";
|
|
4
2
|
import { KIND_EQ, KIND_GE, KIND_GT, KIND_LE, KIND_LT, KIND_NE } from "./constraints";
|
|
5
3
|
import { LarTerm } from "./lar-term";
|
|
@@ -0,0 +1,220 @@
|
|
|
1
|
+
import { L_FALSE, L_TRUE, L_UNDEF } from "../lbool";
|
|
2
|
+
import { Anum } from "../nlsat/algebraic";
|
|
3
|
+
import { Rational } from "../rational";
|
|
4
|
+
import { KIND_EQ, KIND_GE, KIND_GT, KIND_LE, KIND_LT, KIND_NE } from "./constraints";
|
|
5
|
+
import { NULL_LPVAR } from "./lar-solver";
|
|
6
|
+
import { LarTerm } from "./lar-term";
|
|
7
|
+
import { type NlaCore } from "./nla-core";
|
|
8
|
+
import { LemmaBuilder, mkIneq } from "./nla-types";
|
|
9
|
+
|
|
10
|
+
const THREE = Rational.of(3n);
|
|
11
|
+
const MAX_UNSIGNED = 0xffffffffn;
|
|
12
|
+
|
|
13
|
+
const isUnsigned = (value: Rational) =>
|
|
14
|
+
value.isInt() && value.num >= 0n && value.num <= MAX_UNSIGNED;
|
|
15
|
+
|
|
16
|
+
// x != 0 => x^0 = 1
|
|
17
|
+
const xExp0 = (core: NlaCore, result: number, base: number, exponent: number) => {
|
|
18
|
+
const lemma = new LemmaBuilder(core);
|
|
19
|
+
lemma.addIneq(mkIneq(base, KIND_EQ, 0));
|
|
20
|
+
lemma.addIneq(mkIneq(exponent, KIND_NE, 0));
|
|
21
|
+
lemma.addIneq(mkIneq(result, KIND_EQ, 1));
|
|
22
|
+
return L_FALSE;
|
|
23
|
+
};
|
|
24
|
+
|
|
25
|
+
// y != 0 => 0^y = 0
|
|
26
|
+
const zeroExpY = (core: NlaCore, result: number, base: number, exponent: number) => {
|
|
27
|
+
const lemma = new LemmaBuilder(core);
|
|
28
|
+
lemma.addIneq(mkIneq(base, KIND_NE, 0));
|
|
29
|
+
lemma.addIneq(mkIneq(exponent, KIND_EQ, 0));
|
|
30
|
+
lemma.addIneq(mkIneq(result, KIND_EQ, 0));
|
|
31
|
+
return L_FALSE;
|
|
32
|
+
};
|
|
33
|
+
|
|
34
|
+
// x > 0 => x^y > 0
|
|
35
|
+
const xGt0 = (core: NlaCore, result: number, base: number) => {
|
|
36
|
+
const lemma = new LemmaBuilder(core);
|
|
37
|
+
lemma.addIneq(mkIneq(base, KIND_LE, 0));
|
|
38
|
+
lemma.addIneq(mkIneq(result, KIND_GT, 0));
|
|
39
|
+
return L_FALSE;
|
|
40
|
+
};
|
|
41
|
+
|
|
42
|
+
// x > 1, y < 0 => x^y < 1
|
|
43
|
+
const yLt1 = (core: NlaCore, result: number, base: number, exponent: number) => {
|
|
44
|
+
const lemma = new LemmaBuilder(core);
|
|
45
|
+
lemma.addIneq(mkIneq(base, KIND_LE, 1));
|
|
46
|
+
lemma.addIneq(mkIneq(exponent, KIND_GE, 0));
|
|
47
|
+
lemma.addIneq(mkIneq(result, KIND_LT, 1));
|
|
48
|
+
return L_FALSE;
|
|
49
|
+
};
|
|
50
|
+
|
|
51
|
+
// x > 1, y > 0 => x^y > 1
|
|
52
|
+
const yGt1 = (core: NlaCore, result: number, base: number, exponent: number) => {
|
|
53
|
+
const lemma = new LemmaBuilder(core);
|
|
54
|
+
lemma.addIneq(mkIneq(base, KIND_LE, 1));
|
|
55
|
+
lemma.addIneq(mkIneq(exponent, KIND_LE, 0));
|
|
56
|
+
lemma.addIneq(mkIneq(result, KIND_GT, 1));
|
|
57
|
+
return L_FALSE;
|
|
58
|
+
};
|
|
59
|
+
|
|
60
|
+
// x >= 3, y > 0 => x^y > ln(x)y + 1
|
|
61
|
+
const xGe3 = (core: NlaCore, result: number, base: number, exponent: number) => {
|
|
62
|
+
const lemma = new LemmaBuilder(core);
|
|
63
|
+
lemma.addIneq(mkIneq(base, KIND_LT, THREE));
|
|
64
|
+
lemma.addIneq(mkIneq(exponent, KIND_LE, 0));
|
|
65
|
+
lemma.addIneq(
|
|
66
|
+
mkIneq(
|
|
67
|
+
new LarTerm([
|
|
68
|
+
[result, Rational.one],
|
|
69
|
+
[exponent, Rational.minusOne],
|
|
70
|
+
]),
|
|
71
|
+
KIND_GT,
|
|
72
|
+
1,
|
|
73
|
+
),
|
|
74
|
+
);
|
|
75
|
+
return L_FALSE;
|
|
76
|
+
};
|
|
77
|
+
|
|
78
|
+
export const checkPower = (core: NlaCore, result: number, base: number, exponent: number) => {
|
|
79
|
+
if (base === NULL_LPVAR || exponent === NULL_LPVAR || result === NULL_LPVAR) return L_UNDEF;
|
|
80
|
+
const lra = core.lra;
|
|
81
|
+
const am = core.nra.am;
|
|
82
|
+
const values = core.isUsingNraModel
|
|
83
|
+
? [base, exponent, result].map((lpVar) => core.nra.value(lpVar))
|
|
84
|
+
: undefined;
|
|
85
|
+
if (
|
|
86
|
+
values === undefined &&
|
|
87
|
+
[base, exponent, result].some((lpVar) => !lra.getValue(lpVar).y.isZero())
|
|
88
|
+
)
|
|
89
|
+
return L_UNDEF;
|
|
90
|
+
const rationals =
|
|
91
|
+
values === undefined
|
|
92
|
+
? [core.val(base), core.val(exponent), core.val(result)]
|
|
93
|
+
: values.every((value) => am.isRational(value))
|
|
94
|
+
? values.map((value) => am.toRational(value))
|
|
95
|
+
: undefined;
|
|
96
|
+
if (rationals !== undefined) {
|
|
97
|
+
const baseValue = rationals[0];
|
|
98
|
+
const exponentValue = rationals[1];
|
|
99
|
+
const resultValue = rationals[2];
|
|
100
|
+
if (!baseValue.isZero() && exponentValue.isZero() && !resultValue.equals(Rational.one))
|
|
101
|
+
return xExp0(core, result, base, exponent);
|
|
102
|
+
if (baseValue.isZero() && !exponentValue.isZero() && !resultValue.isZero())
|
|
103
|
+
return zeroExpY(core, result, base, exponent);
|
|
104
|
+
if (baseValue.isPositive() && !resultValue.isPositive()) return xGt0(core, result, base);
|
|
105
|
+
if (
|
|
106
|
+
baseValue.compare(Rational.one) > 0 &&
|
|
107
|
+
exponentValue.isNegative() &&
|
|
108
|
+
resultValue.compare(Rational.one) >= 0
|
|
109
|
+
)
|
|
110
|
+
return yLt1(core, result, base, exponent);
|
|
111
|
+
if (
|
|
112
|
+
baseValue.compare(Rational.one) > 0 &&
|
|
113
|
+
exponentValue.isPositive() &&
|
|
114
|
+
resultValue.compare(Rational.one) <= 0
|
|
115
|
+
)
|
|
116
|
+
return yGt1(core, result, base, exponent);
|
|
117
|
+
if (
|
|
118
|
+
baseValue.compare(THREE) >= 0 &&
|
|
119
|
+
exponentValue.isPositive() &&
|
|
120
|
+
resultValue.compare(exponentValue.add(Rational.one)) <= 0
|
|
121
|
+
)
|
|
122
|
+
return xGe3(core, result, base, exponent);
|
|
123
|
+
if (baseValue.isPositive() && isUnsigned(exponentValue)) {
|
|
124
|
+
const powerValue = baseValue.pow(Number(exponentValue.num));
|
|
125
|
+
const comparison = resultValue.compare(powerValue);
|
|
126
|
+
if (comparison === 0) return L_TRUE;
|
|
127
|
+
if (core.random() % 2 === 0) {
|
|
128
|
+
const lemma = new LemmaBuilder(core);
|
|
129
|
+
lemma.addIneq(mkIneq(base, KIND_NE, baseValue));
|
|
130
|
+
lemma.addIneq(mkIneq(exponent, KIND_NE, exponentValue));
|
|
131
|
+
lemma.addIneq(mkIneq(result, KIND_EQ, powerValue));
|
|
132
|
+
return L_FALSE;
|
|
133
|
+
}
|
|
134
|
+
const isIncreasing = baseValue.compare(Rational.one) >= 0;
|
|
135
|
+
if (exponentValue.isPositive() && comparison < 0) {
|
|
136
|
+
const lemma = new LemmaBuilder(core);
|
|
137
|
+
lemma.addIneq(mkIneq(base, KIND_LT, baseValue));
|
|
138
|
+
lemma.addIneq(mkIneq(exponent, isIncreasing ? KIND_LT : KIND_GT, exponentValue));
|
|
139
|
+
if (!isIncreasing) lemma.addIneq(mkIneq(exponent, KIND_LT, 0));
|
|
140
|
+
lemma.addIneq(mkIneq(result, KIND_GE, powerValue));
|
|
141
|
+
return L_FALSE;
|
|
142
|
+
}
|
|
143
|
+
if (comparison > 0) {
|
|
144
|
+
const lemma = new LemmaBuilder(core);
|
|
145
|
+
lemma.addIneq(mkIneq(base, KIND_LE, 0));
|
|
146
|
+
lemma.addIneq(mkIneq(base, KIND_GT, baseValue));
|
|
147
|
+
lemma.addIneq(mkIneq(exponent, isIncreasing ? KIND_GT : KIND_LT, exponentValue));
|
|
148
|
+
if (isIncreasing) lemma.addIneq(mkIneq(exponent, KIND_LT, 0));
|
|
149
|
+
lemma.addIneq(mkIneq(result, KIND_LE, powerValue));
|
|
150
|
+
return L_FALSE;
|
|
151
|
+
}
|
|
152
|
+
}
|
|
153
|
+
if (baseValue.isPositive() && exponentValue.isPositive() && !exponentValue.isInt()) {
|
|
154
|
+
const num = exponentValue.num;
|
|
155
|
+
const den = exponentValue.den;
|
|
156
|
+
if (
|
|
157
|
+
num <= MAX_UNSIGNED &&
|
|
158
|
+
den <= MAX_UNSIGNED &&
|
|
159
|
+
resultValue.pow(Number(den)).equals(baseValue.pow(Number(num)))
|
|
160
|
+
)
|
|
161
|
+
return L_TRUE;
|
|
162
|
+
}
|
|
163
|
+
return L_UNDEF;
|
|
164
|
+
}
|
|
165
|
+
if (values === undefined) return L_UNDEF;
|
|
166
|
+
const baseValue = values[0];
|
|
167
|
+
const exponentValue = values[1];
|
|
168
|
+
const resultValue = values[2];
|
|
169
|
+
const zero = new Anum(Rational.zero);
|
|
170
|
+
const one = new Anum(Rational.one);
|
|
171
|
+
if (
|
|
172
|
+
am.compare(baseValue, zero) !== 0 &&
|
|
173
|
+
am.compare(exponentValue, zero) === 0 &&
|
|
174
|
+
am.compare(resultValue, one) !== 0
|
|
175
|
+
)
|
|
176
|
+
return xExp0(core, result, base, exponent);
|
|
177
|
+
if (
|
|
178
|
+
am.compare(baseValue, zero) === 0 &&
|
|
179
|
+
am.compare(exponentValue, zero) !== 0 &&
|
|
180
|
+
am.compare(resultValue, zero) !== 0
|
|
181
|
+
)
|
|
182
|
+
return zeroExpY(core, result, base, exponent);
|
|
183
|
+
if (am.compare(baseValue, zero) > 0 && am.compare(resultValue, zero) <= 0)
|
|
184
|
+
return xGt0(core, result, base);
|
|
185
|
+
if (
|
|
186
|
+
am.compare(baseValue, one) > 0 &&
|
|
187
|
+
am.compare(exponentValue, zero) < 0 &&
|
|
188
|
+
am.compare(resultValue, one) >= 0
|
|
189
|
+
)
|
|
190
|
+
return yLt1(core, result, base, exponent);
|
|
191
|
+
if (
|
|
192
|
+
am.compare(baseValue, one) > 0 &&
|
|
193
|
+
am.compare(exponentValue, zero) > 0 &&
|
|
194
|
+
am.compare(resultValue, one) <= 0
|
|
195
|
+
)
|
|
196
|
+
return yGt1(core, result, base, exponent);
|
|
197
|
+
if (
|
|
198
|
+
am.compare(baseValue, new Anum(THREE)) >= 0 &&
|
|
199
|
+
am.compare(exponentValue, zero) > 0 &&
|
|
200
|
+
am.compare(resultValue, am.add(exponentValue, one)) <= 0
|
|
201
|
+
)
|
|
202
|
+
return xGe3(core, result, base, exponent);
|
|
203
|
+
if (
|
|
204
|
+
am.compare(baseValue, zero) > 0 &&
|
|
205
|
+
am.compare(exponentValue, zero) > 0 &&
|
|
206
|
+
am.isRational(exponentValue)
|
|
207
|
+
) {
|
|
208
|
+
const exponentRational = am.toRational(exponentValue);
|
|
209
|
+
if (
|
|
210
|
+
exponentRational.num <= MAX_UNSIGNED &&
|
|
211
|
+
exponentRational.den <= MAX_UNSIGNED &&
|
|
212
|
+
am.compare(
|
|
213
|
+
am.power(resultValue, Number(exponentRational.den)),
|
|
214
|
+
am.power(baseValue, Number(exponentRational.num)),
|
|
215
|
+
) === 0
|
|
216
|
+
)
|
|
217
|
+
return L_TRUE;
|
|
218
|
+
}
|
|
219
|
+
return L_UNDEF;
|
|
220
|
+
};
|
|
@@ -1,5 +1,3 @@
|
|
|
1
|
-
// Ported from Z3 (src/math/lp/nla_tangent_lemmas.h, src/math/lp/nla_tangent_lemmas.cpp), MIT
|
|
2
|
-
// license, see z3-license.txt.
|
|
3
1
|
import { Rational } from "../rational";
|
|
4
2
|
import { KIND_EQ, KIND_GE, KIND_GT, KIND_LE, KIND_LT, KIND_NE } from "./constraints";
|
|
5
3
|
import { LarTerm } from "./lar-term";
|