tla-ts 0.0.10-dev.f16792fed → 0.0.10-dev.f57f64938
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/README.md +2 -1
- package/dist/compile.cjs +6 -6
- package/dist/compile.js +10 -10
- package/dist/deciders.cjs +41 -37
- package/dist/deciders.js +57 -53
- package/dist/index.cjs +1 -1
- package/dist/index.d.cts +3 -0
- package/dist/index.d.ts +3 -0
- package/dist/index.js +1 -1
- package/dist/parallel-worker.cjs +1 -1
- package/dist/parallel-worker.js +1 -1
- package/dist/prove.cjs +2682 -426
- package/dist/prove.js +2681 -425
- package/dist/run.cjs +45 -42
- package/dist/run.js +47 -44
- package/dist/tlapm.cjs +2 -2
- package/dist/tlapm.js +2 -2
- package/dist/transfer.cjs +42 -39
- package/dist/transfer.js +42 -39
- package/dist/worker.cjs +7 -7
- package/dist/worker.js +7 -7
- package/package.json +1 -1
- package/src/ast.ts +41 -36
- package/src/builtins.ts +4 -13
- package/src/check-failure.ts +116 -0
- package/src/check-trace.ts +282 -0
- package/src/check.ts +353 -549
- package/src/cli/options.ts +6 -31
- package/src/cli/shared.ts +1 -1
- package/src/cli/tlapm.ts +433 -70
- package/src/cli/tlc-arguments.ts +222 -210
- package/src/cli/tlc-output.ts +687 -0
- package/src/cli/tlc-usage.ts +1 -2
- package/src/cli/tlc.ts +49 -702
- package/src/cli/xml-exporter.ts +23 -33
- package/src/codegen.ts +5 -10
- package/src/coverage.ts +0 -2
- package/src/dependencies.ts +30 -14
- package/src/dfid.ts +16 -16
- package/src/environment-config.ts +315 -0
- package/src/environment.ts +55 -338
- package/src/errors.ts +33 -5
- package/src/evaluate.ts +5 -4
- package/src/exit-codes.ts +1 -0
- package/src/fingerprints.ts +65 -1
- package/src/instances.ts +47 -10
- package/src/json.ts +4 -7
- package/src/levels.ts +39 -42
- package/src/lexer.ts +5 -3
- package/src/liveness-checker.ts +553 -237
- package/src/liveness.ts +94 -86
- package/src/obligations/action.ts +14 -17
- package/src/obligations/anonymize.ts +37 -16
- package/src/obligations/enabled-axioms.ts +218 -0
- package/src/obligations/equality.ts +1 -3
- package/src/obligations/expression.ts +36 -8
- package/src/obligations/format.ts +0 -2
- package/src/obligations/generate.ts +66 -54
- package/src/obligations/index.ts +38 -8
- package/src/obligations/levels.ts +24 -11
- package/src/obligations/module.ts +28 -41
- package/src/obligations/normalize.ts +26 -14
- 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 +55 -50
- package/src/obligations/source.ts +118 -74
- package/src/obligations/subexpression.ts +45 -18
- package/src/obligations/substitution.ts +1 -3
- package/src/obligations/temporal.ts +5 -7
- package/src/obligations/tuples.ts +0 -2
- package/src/parallel-worker.ts +10 -30
- package/src/parallel.ts +24 -47
- package/src/parser.ts +580 -180
- package/src/pretty-print.ts +1 -1
- package/src/prover/decide-pool.ts +3 -3
- package/src/prover/deciders.ts +12 -9
- package/src/prover/isabelle/decide.ts +3 -25
- package/src/prover/isabelle/encode.ts +72 -42
- package/src/prover/isabelle/isar/attrib.ts +250 -0
- package/src/prover/isabelle/isar/context.ts +335 -0
- package/src/prover/isabelle/isar/induct.ts +382 -0
- package/src/prover/isabelle/isar/inner-syntax.ts +158 -7
- package/src/prover/isabelle/isar/method.ts +509 -212
- package/src/prover/isabelle/isar/proof.ts +570 -14
- package/src/prover/isabelle/isar/rule-cases.ts +224 -0
- package/src/prover/isabelle/isar/theory.ts +487 -76
- package/src/prover/isabelle/isar/toplevel.ts +331 -0
- package/src/prover/isabelle/isar/type-check.ts +89 -14
- package/src/prover/isabelle/provers/blast/blast.ts +7 -65
- package/src/prover/isabelle/provers/blast/branch.ts +0 -2
- package/src/prover/isabelle/provers/blast/prove.ts +0 -2
- package/src/prover/isabelle/provers/blast/rules.ts +0 -2
- package/src/prover/isabelle/provers/blast/state.ts +0 -2
- package/src/prover/isabelle/provers/blast/term.ts +0 -2
- package/src/prover/isabelle/provers/clasimp.ts +0 -2
- package/src/prover/isabelle/provers/classical.ts +45 -20
- package/src/prover/isabelle/provers/hypsubst.ts +17 -28
- package/src/prover/isabelle/pure/bicompose.ts +9 -27
- package/src/prover/isabelle/pure/consts.ts +0 -2
- package/src/prover/isabelle/pure/conv.ts +2 -10
- package/src/prover/isabelle/pure/drule.ts +72 -6
- package/src/prover/isabelle/pure/envir.ts +0 -2
- package/src/prover/isabelle/pure/goal.ts +1 -3
- package/src/prover/isabelle/pure/logic.ts +1 -3
- package/src/prover/isabelle/pure/name.ts +0 -2
- package/src/prover/isabelle/pure/net.ts +0 -2
- package/src/prover/isabelle/pure/object-logic.ts +13 -7
- package/src/prover/isabelle/pure/pattern.ts +0 -2
- package/src/prover/isabelle/pure/raw-simplifier.ts +4 -15
- package/src/prover/isabelle/pure/rewriter.ts +6 -17
- package/src/prover/isabelle/pure/search.ts +0 -2
- package/src/prover/isabelle/pure/seq.ts +0 -2
- package/src/prover/isabelle/pure/simplifier.ts +26 -7
- package/src/prover/isabelle/pure/table.ts +2 -3
- package/src/prover/isabelle/pure/tactic.ts +0 -2
- package/src/prover/isabelle/pure/tactical.ts +42 -37
- package/src/prover/isabelle/pure/term-ord.ts +0 -2
- package/src/prover/isabelle/pure/term.ts +0 -2
- package/src/prover/isabelle/pure/thm.ts +14 -13
- package/src/prover/isabelle/pure/type.ts +0 -2
- package/src/prover/isabelle/pure/unify.ts +0 -2
- package/src/prover/isabelle/pure/variable.ts +0 -2
- package/src/prover/isabelle/tla/classical-setup.ts +18 -16
- package/src/prover/isabelle/tla/context.ts +58 -11
- package/src/prover/isabelle/tla/logic-data.ts +1 -1
- package/src/prover/isabelle/tla/logic.ts +49 -21
- package/src/prover/isabelle/tla/simpdata.ts +1 -12
- package/src/prover/isabelle/tools/intuitionistic.ts +28 -12
- package/src/prover/ocaml.ts +4 -1
- package/src/prover/prep/action.ts +30 -31
- package/src/prover/prep/enabled-axioms.ts +11 -2
- package/src/prover/prep/fingerprint.ts +2 -5
- package/src/prover/prep/methods.ts +181 -51
- package/src/prover/prep/normalize.ts +38 -9
- package/src/prover/prove.ts +395 -94
- package/src/prover/ptl/decide.ts +95 -50
- package/src/prover/ptl/encode.ts +2 -3
- package/src/prover/ptl/tableau.ts +28 -2
- package/src/prover/smt/arithmetic.ts +310 -0
- package/src/prover/smt/axioms.ts +12 -8
- package/src/prover/smt/context.ts +43 -8
- package/src/prover/smt/data.ts +498 -379
- package/src/prover/smt/encode.ts +148 -57
- package/src/prover/smt/extensionality.ts +5 -3
- package/src/prover/smt/flatten.ts +4 -6
- package/src/prover/smt/format.ts +28 -4
- package/src/prover/smt/instances.ts +7 -1
- package/src/prover/smt/layout.ts +91 -0
- package/src/prover/smt/rewrite.ts +1021 -618
- 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 +87 -16
- package/src/prover/smt/solver/ast-lt.ts +166 -12
- package/src/prover/smt/solver/ast-util.ts +160 -2
- package/src/prover/smt/solver/ast.ts +1427 -41
- package/src/prover/smt/solver/auf-solver.ts +2 -6
- 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 +110 -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 +516 -115
- package/src/prover/smt/solver/ctx-simplify.ts +20 -10
- 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 +206 -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 +7 -8
- package/src/prover/smt/solver/elim-small-bv-tactic.ts +129 -0
- package/src/prover/smt/solver/elim-uncnstr.ts +545 -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 +907 -0
- package/src/prover/smt/solver/euf/euf-solver.ts +1205 -0
- package/src/prover/smt/solver/euf/fpa-solver.ts +317 -0
- package/src/prover/smt/solver/euf/mam.ts +1050 -0
- package/src/prover/smt/solver/euf/q-ematch.ts +830 -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 +335 -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 +146 -0
- package/src/prover/smt/solver/factor.ts +141 -0
- package/src/prover/smt/solver/fd-solver.ts +265 -0
- package/src/prover/smt/solver/fingerprints.ts +15 -15
- package/src/prover/smt/solver/fix-dl-var.ts +148 -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 +640 -0
- package/src/prover/smt/solver/fpa2bv-converter.ts +2249 -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 +175 -15
- package/src/prover/smt/solver/goal2nlsat.ts +189 -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 +110 -38
- 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 +0 -1
- package/src/prover/smt/solver/lp/core-solver.ts +18 -3
- package/src/prover/smt/solver/lp/cross-nested.ts +0 -1
- package/src/prover/smt/solver/lp/dep-intervals.ts +0 -3
- package/src/prover/smt/solver/lp/dependency.ts +0 -2
- package/src/prover/smt/solver/lp/dioph-eq.ts +1 -10
- package/src/prover/smt/solver/lp/explanation.ts +0 -1
- package/src/prover/smt/solver/lp/gomory.ts +0 -1
- package/src/prover/smt/solver/lp/hnf-cutter.ts +1 -2
- package/src/prover/smt/solver/lp/hnf.ts +0 -3
- package/src/prover/smt/solver/lp/int-cube.ts +3 -4
- package/src/prover/smt/solver/lp/int-solver.ts +0 -2
- package/src/prover/smt/solver/lp/lar-solver.ts +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 +0 -1
- package/src/prover/smt/solver/lp/nex.ts +0 -1
- package/src/prover/smt/solver/lp/nla-backoff.ts +0 -2
- package/src/prover/smt/solver/lp/nla-basics.ts +0 -2
- package/src/prover/smt/solver/lp/nla-core.ts +42 -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 +9 -4
- 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 +25 -4
- package/src/prover/smt/solver/lp/numeric-pair.ts +0 -1
- package/src/prover/smt/solver/lp/pdd-interval.ts +0 -1
- package/src/prover/smt/solver/lp/pdd-simplifier.ts +0 -1
- package/src/prover/smt/solver/lp/pdd-solver.ts +0 -2
- package/src/prover/smt/solver/lp/pdd.ts +2 -2
- package/src/prover/smt/solver/lp/random-updater.ts +0 -2
- package/src/prover/smt/solver/lp/static-matrix.ts +0 -1
- package/src/prover/smt/solver/lp/union-find.ts +7 -2
- package/src/prover/smt/solver/macro-finder.ts +530 -0
- package/src/prover/smt/solver/mam-compiler.ts +122 -90
- package/src/prover/smt/solver/mam-interpreter.ts +0 -1
- package/src/prover/smt/solver/max-bv-sharing-tactic.ts +17 -0
- package/src/prover/smt/solver/max-cliques.ts +105 -0
- package/src/prover/smt/solver/maxcore.ts +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 +18 -27
- package/src/prover/smt/solver/model-evaluator.ts +188 -12
- package/src/prover/smt/solver/model-finder.ts +12 -18
- package/src/prover/smt/solver/model-generator.ts +56 -29
- package/src/prover/smt/solver/model-macro-solver.ts +49 -46
- package/src/prover/smt/solver/model-printer.ts +214 -0
- package/src/prover/smt/solver/mpf.ts +711 -0
- package/src/prover/smt/solver/mus.ts +51 -0
- package/src/prover/smt/solver/muz/dl-context.ts +404 -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 +1406 -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 +218 -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 +125 -12
- package/src/prover/smt/solver/nlsat/atoms.ts +20 -6
- package/src/prover/smt/solver/nlsat/evaluator.ts +0 -1
- package/src/prover/smt/solver/nlsat/explain.ts +63 -23
- package/src/prover/smt/solver/nlsat/interval-set.ts +1 -2
- package/src/prover/smt/solver/nlsat/levelwise.ts +3 -9
- package/src/prover/smt/solver/nlsat/mpbq.ts +45 -1
- package/src/prover/smt/solver/nlsat/polynomial.ts +13 -6
- package/src/prover/smt/solver/nlsat/solver.ts +234 -36
- package/src/prover/smt/solver/nlsat/transcendental-eval.ts +310 -0
- package/src/prover/smt/solver/nlsat/transcendentals.ts +367 -0
- package/src/prover/smt/solver/nlsat/types.ts +0 -2
- package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +1 -4
- package/src/prover/smt/solver/nlsat/upolynomial.ts +0 -2
- 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 +787 -0
- package/src/prover/smt/solver/opt-nlsat.ts +375 -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 +308 -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 +284 -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 +512 -0
- package/src/prover/smt/solver/propagate-values.ts +37 -21
- package/src/prover/smt/solver/proto-model.ts +648 -19
- package/src/prover/smt/solver/pull-quant.ts +28 -12
- package/src/prover/smt/solver/purify-arith.ts +632 -0
- package/src/prover/smt/solver/qe-arith-plugin.ts +1098 -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 +1498 -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 +19 -20
- package/src/prover/smt/solver/quantifier-manager.ts +8 -16
- 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 +261 -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 +25 -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 +43 -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 +2127 -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 +1010 -0
- package/src/prover/smt/solver/seq-decl-plugin.ts +819 -0
- package/src/prover/smt/solver/seq-derive.ts +1301 -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 +728 -0
- package/src/prover/smt/solver/seq-range-predicate.ts +235 -0
- package/src/prover/smt/solver/seq-re-rewriter.ts +1170 -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 +2402 -0
- package/src/prover/smt/solver/seq-skolem.ts +317 -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 +83 -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 +3126 -316
- package/src/prover/smt/solver/smtlib-script.ts +1631 -0
- package/src/prover/smt/solver/solve-eqs.ts +929 -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 +1986 -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 -6
- package/src/prover/smt/solver/theory-lra-final-check.ts +56 -70
- package/src/prover/smt/solver/theory-lra-internalize.ts +86 -27
- package/src/prover/smt/solver/theory-lra-model.ts +20 -35
- package/src/prover/smt/solver/theory-lra-propagate.ts +24 -26
- package/src/prover/smt/solver/theory-lra-state.ts +6 -22
- package/src/prover/smt/solver/theory-lra.ts +188 -1
- package/src/prover/smt/solver/theory-pb.ts +934 -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 +871 -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 +50 -19
- package/src/prover/tlapm/tlapm.ts +15 -9
- package/src/prover/tlapm-library.ts +3208 -0
- package/src/prover/verdict.ts +9 -0
- package/src/prover/zenon/check/check.ts +1 -2
- package/src/prover/zenon/check/records.ts +1 -1
- package/src/prover/zenon/check/relations.ts +2 -1
- package/src/prover/zenon/check/rewrites.ts +2 -15
- package/src/prover/zenon/check/sets.ts +40 -58
- package/src/prover/zenon/check/terms.ts +1 -2
- package/src/prover/zenon/decide.ts +10 -7
- package/src/prover/zenon/encode.ts +0 -2
- package/src/prover/zenon/eqrel.ts +2 -2
- package/src/prover/zenon/equality-rules.ts +0 -2
- package/src/prover/zenon/expr.ts +7 -2
- package/src/prover/zenon/index-table.ts +9 -21
- package/src/prover/zenon/isar-case.ts +0 -2
- package/src/prover/zenon/isar.ts +35 -37
- package/src/prover/zenon/llproof.ts +2 -13
- package/src/prover/zenon/mltoll.ts +12 -30
- package/src/prover/zenon/node.ts +20 -5
- package/src/prover/zenon/parse.ts +9 -8
- package/src/prover/zenon/phrase.ts +0 -2
- package/src/prover/zenon/proof.ts +0 -2
- package/src/prover/zenon/propositional-rules.ts +0 -2
- package/src/prover/zenon/rules.ts +0 -2
- package/src/prover/zenon/search.ts +11 -19
- package/src/prover/zenon/tla/functions.ts +2 -4
- package/src/prover/zenon/tla/llproof.ts +9 -13
- package/src/prover/zenon/tla/records.ts +1 -8
- package/src/prover/zenon/tla/rewrites.ts +0 -2
- package/src/prover/zenon/tla/sets.ts +22 -22
- package/src/prover/zenon/tla/terms.ts +0 -2
- package/src/prover/zenon/tla/tla.ts +7 -8
- package/src/resolve.ts +56 -74
- package/src/runtime.ts +4 -0
- package/src/sany/generation.ts +394 -0
- package/src/sany/generator-def-entries.ts +210 -0
- package/src/sany/generator-definitions.ts +686 -0
- package/src/sany/generator-expressions.ts +1100 -0
- package/src/sany/generator-proofs.ts +662 -0
- package/src/sany/generator.ts +155 -2625
- package/src/sany/levels.ts +0 -2
- package/src/sany/lexer.ts +17 -16
- package/src/sany/linter.ts +0 -2
- package/src/sany/nodes.ts +2 -3
- package/src/sany/report.ts +3 -6
- package/src/sany/selectors.ts +35 -38
- package/src/sany/xml.ts +23 -55
- package/src/search.ts +205 -43
- package/src/simulate.ts +157 -133
- package/src/spec-description.ts +33 -48
- package/src/standard-definitions.ts +4 -0
- package/src/standard-modules.ts +16 -32
- package/src/state-graph.ts +0 -2
- package/src/substitution-levels.ts +5 -4
- package/src/successors.ts +6 -8
- package/src/symmetry.ts +2 -2
- package/src/tableau.ts +2 -2
- package/src/tlc/fingerprint.ts +81 -9
- package/src/tlc/messages.ts +20 -15
- package/src/tlc/random.ts +4 -4
- package/src/tlc/replay.ts +8 -15
- package/src/tlc/summary.ts +29 -14
- package/src/tlc/tlc-operators.ts +2 -3
- package/src/tlc/tlcext-operators.ts +44 -12
- package/src/tlc/trace-spec.ts +21 -40
- package/src/typed-tier.ts +6535 -0
- package/src/typescript/actions.ts +2 -4
- package/src/typescript/collections.ts +34 -20
- package/src/typescript/compile.ts +1 -3
- package/src/typescript/formula.ts +5 -3
- package/src/typescript/model.ts +4 -5
- package/src/typescript/steps.ts +20 -18
- package/src/values.ts +62 -152
- 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,6 +1,3 @@
|
|
|
1
|
-
// Ported from Z3 (maximize_term and its helpers in src/math/lp/lar_solver.cpp, and the tableau part
|
|
2
|
-
// of src/math/lp/lp_primal_core_solver.h, src/math/lp/lp_primal_core_solver_def.h,
|
|
3
|
-
// src/math/lp/lp_primal_core_solver_tableau_def.h), MIT license, see z3-license.txt.
|
|
4
1
|
import { Rational } from "../rational";
|
|
5
2
|
import {
|
|
6
3
|
COLUMN_BOXED,
|
|
@@ -15,6 +12,7 @@ import {
|
|
|
15
12
|
LP_OPTIMAL,
|
|
16
13
|
LP_UNBOUNDED,
|
|
17
14
|
} from "./core-solver";
|
|
15
|
+
import { type Dependency, mkJoin } from "./dependency";
|
|
18
16
|
import type { LarSolver } from "./lar-solver";
|
|
19
17
|
import { LarTerm } from "./lar-term";
|
|
20
18
|
import { Impq } from "./numeric-pair";
|
|
@@ -304,19 +302,70 @@ const maximizeTermOnFeasibleRSolver = (solver: LarSolver, term: LarTerm) => {
|
|
|
304
302
|
core.reducedCosts = undefined;
|
|
305
303
|
const status = core.status;
|
|
306
304
|
core.status = LP_OPTIMAL;
|
|
307
|
-
return status === LP_UNBOUNDED || status === LP_CANCELLED
|
|
305
|
+
return status === LP_UNBOUNDED || status === LP_CANCELLED
|
|
306
|
+
? undefined
|
|
307
|
+
: { value: term.apply(core.x), reducedCosts };
|
|
308
308
|
};
|
|
309
309
|
|
|
310
|
-
|
|
310
|
+
// Every column with a positive reduced cost sits at its upper bound, and every column with a
|
|
311
|
+
// negative one at its lower bound, so those bounds prove the maximum.
|
|
312
|
+
const getDependenciesOfMaximum = (solver: LarSolver, reducedCosts: readonly Rational[]) => {
|
|
313
|
+
let dependency: Dependency = null;
|
|
314
|
+
for (const [column, reducedCost] of reducedCosts.entries()) {
|
|
315
|
+
if (reducedCost.isZero()) continue;
|
|
316
|
+
dependency = mkJoin(
|
|
317
|
+
dependency,
|
|
318
|
+
reducedCost.isPositive() ? solver.getUpperWitness(column) : solver.getLowerWitness(column),
|
|
319
|
+
);
|
|
320
|
+
}
|
|
321
|
+
return dependency;
|
|
322
|
+
};
|
|
323
|
+
|
|
324
|
+
// Integer columns that maximization left fractional move out of the basis, if they can.
|
|
325
|
+
const adjustIntegerColumns = (solver: LarSolver, term: LarTerm, previous: Impq, maximum: Impq) => {
|
|
326
|
+
const core = solver.core;
|
|
327
|
+
const restore = () => {
|
|
328
|
+
core.restoreX();
|
|
329
|
+
return { status: LP_FEASIBLE, value: previous };
|
|
330
|
+
};
|
|
331
|
+
let isChanged = false;
|
|
332
|
+
for (let column = 0; column < core.x.length; column++) {
|
|
333
|
+
if (!solver.isInt(column) || core.x[column].isInt()) continue;
|
|
334
|
+
if (solver.isBase(column) && !solver.removeFromBasis(column)) return restore();
|
|
335
|
+
if (!core.x[column].isInt()) return restore();
|
|
336
|
+
isChanged = true;
|
|
337
|
+
}
|
|
338
|
+
const changed = isChanged ? term.apply(core.x) : maximum;
|
|
339
|
+
const isWorse = changed.compare(previous) < 0;
|
|
340
|
+
if (isWorse) core.restoreX();
|
|
341
|
+
const value = isWorse ? previous : changed;
|
|
342
|
+
if (!value.equals(maximum)) return { status: LP_FEASIBLE, value };
|
|
343
|
+
solver.status = LP_OPTIMAL;
|
|
344
|
+
return { status: LP_OPTIMAL, value };
|
|
345
|
+
};
|
|
346
|
+
|
|
347
|
+
export const maximizeTerm = (
|
|
348
|
+
solver: LarSolver,
|
|
349
|
+
column: number,
|
|
350
|
+
isFixingIntCols = false,
|
|
351
|
+
isComputingDependencies = false,
|
|
352
|
+
) => {
|
|
311
353
|
const term = solver.hasTerm(column)
|
|
312
354
|
? solver.getTerm(column)
|
|
313
355
|
: new LarTerm([[column, Rational.one]]);
|
|
314
|
-
|
|
356
|
+
solver.core.backupX();
|
|
357
|
+
const previous = term.apply(solver.core.x);
|
|
315
358
|
const maximum = maximizeTermOnFeasibleRSolver(solver, term);
|
|
316
359
|
if (maximum === undefined) {
|
|
317
|
-
solver.core.
|
|
318
|
-
return
|
|
360
|
+
solver.core.restoreX();
|
|
361
|
+
return { status: LP_UNBOUNDED, value: Impq.zero, dependency: null };
|
|
319
362
|
}
|
|
320
|
-
|
|
321
|
-
|
|
363
|
+
const dependency = isComputingDependencies
|
|
364
|
+
? getDependenciesOfMaximum(solver, maximum.reducedCosts)
|
|
365
|
+
: null;
|
|
366
|
+
if (!isFixingIntCols) {
|
|
367
|
+
solver.status = LP_OPTIMAL;
|
|
368
|
+
return { status: LP_OPTIMAL, value: maximum.value, dependency };
|
|
369
|
+
}
|
|
370
|
+
return { ...adjustIntegerColumns(solver, term, previous, maximum.value), dependency };
|
|
322
371
|
};
|
|
@@ -1,5 +1,3 @@
|
|
|
1
|
-
// Ported from Z3 (src/math/lp/nla_basics_lemmas.h, src/math/lp/nla_basics_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";
|
|
@@ -1,4 +1,3 @@
|
|
|
1
|
-
// Ported from Z3 (src/math/lp/nla_core.h, src/math/lp/nla_core.cpp, src/math/lp/nla_common.cpp, src/math/lp/nla_explanations.cpp, src/math/lp/factorization.cpp, src/math/lp/factorization_factory_imp.cpp, src/math/lp/nla_solver.cpp), MIT license, see z3-license.txt.
|
|
2
1
|
import { L_FALSE, L_TRUE, L_UNDEF } from "../lbool";
|
|
3
2
|
import type { ResourceLimit } from "../rlimit";
|
|
4
3
|
import { Rational } from "../rational";
|
|
@@ -22,6 +21,7 @@ import { MonomialBounds } from "./nla-monomial-bounds";
|
|
|
22
21
|
import { Monotone } from "./nla-monotone";
|
|
23
22
|
import { Order } from "./nla-order";
|
|
24
23
|
import { Patcher } from "./nla-patcher";
|
|
24
|
+
import { checkPower } from "./nla-powers";
|
|
25
25
|
import { Tangents } from "./nla-tangents";
|
|
26
26
|
import { NlaThrottle } from "./nla-throttle";
|
|
27
27
|
import {
|
|
@@ -32,6 +32,7 @@ import {
|
|
|
32
32
|
mkIneq,
|
|
33
33
|
negateKind,
|
|
34
34
|
} from "./nla-types";
|
|
35
|
+
import { NlaTranscendentals } from "./nla-transcendentals";
|
|
35
36
|
import { NraSolver } from "./nra-solver";
|
|
36
37
|
import { getSignedVarVar, isSignedVarNegated, mkSignedVar, VarEqs } from "./nla-var-eqs";
|
|
37
38
|
|
|
@@ -143,6 +144,7 @@ export class NlaCore {
|
|
|
143
144
|
private readonly horner: Horner;
|
|
144
145
|
readonly grobner: Grobner;
|
|
145
146
|
readonly nra = new NraSolver(this);
|
|
147
|
+
readonly transcendentals = new NlaTranscendentals(this);
|
|
146
148
|
isUsingNraModel = false;
|
|
147
149
|
private nlsatBackoff: Backoff;
|
|
148
150
|
private checkAssignmentFailCount = 0;
|
|
@@ -174,10 +176,6 @@ export class NlaCore {
|
|
|
174
176
|
};
|
|
175
177
|
}
|
|
176
178
|
|
|
177
|
-
private get settings() {
|
|
178
|
-
return this.lra.settings;
|
|
179
|
-
}
|
|
180
|
-
|
|
181
179
|
get stats() {
|
|
182
180
|
return this.lra.settings.stats;
|
|
183
181
|
}
|
|
@@ -353,6 +351,7 @@ export class NlaCore {
|
|
|
353
351
|
}
|
|
354
352
|
|
|
355
353
|
hasRelevantMonomial() {
|
|
354
|
+
if (!this.transcendentals.isEmpty) return true;
|
|
356
355
|
return this.emons.monics.some((monic) => this.isRelevant(monic.variable));
|
|
357
356
|
}
|
|
358
357
|
|
|
@@ -552,11 +551,17 @@ export class NlaCore {
|
|
|
552
551
|
}
|
|
553
552
|
|
|
554
553
|
random() {
|
|
555
|
-
return this.settings.getRandomNext();
|
|
554
|
+
return this.lra.settings.getRandomNext();
|
|
556
555
|
}
|
|
557
556
|
|
|
558
557
|
isCanceled() {
|
|
559
|
-
return this.settings.isCanceled();
|
|
558
|
+
return this.lra.settings.isCanceled();
|
|
559
|
+
}
|
|
560
|
+
|
|
561
|
+
checkPower(result: number, base: number, exponent: number) {
|
|
562
|
+
this.clear();
|
|
563
|
+
if (this.lra.isFeasible()) this.lra.getRidOfInfEps();
|
|
564
|
+
return checkPower(this, result, base, exponent);
|
|
560
565
|
}
|
|
561
566
|
|
|
562
567
|
checkBoundedDivisions() {
|
|
@@ -661,7 +666,29 @@ export class NlaCore {
|
|
|
661
666
|
|
|
662
667
|
private onToRefineEmpty() {
|
|
663
668
|
this.squeezeSchedule.onNothingToRefine();
|
|
664
|
-
return
|
|
669
|
+
return this.checkTranscendentalsAndFinish();
|
|
670
|
+
}
|
|
671
|
+
|
|
672
|
+
// The applications of transcendental functions still need checking when the monomials hold. A
|
|
673
|
+
// failure of the check needs nlsat, and a model of nlsat that is not tight enough is unknown.
|
|
674
|
+
private checkTranscendentalsAndFinish() {
|
|
675
|
+
const transcendentals = this.transcendentals;
|
|
676
|
+
if (transcendentals.isEmpty) return L_TRUE;
|
|
677
|
+
const numFailures = transcendentals.numFailures;
|
|
678
|
+
transcendentals.check();
|
|
679
|
+
if (this.lemmas.length > 0 || this.literals.length > 0) return L_FALSE;
|
|
680
|
+
const isFailed = transcendentals.numFailures > numFailures;
|
|
681
|
+
let isRunningNlsat = this.shouldRunBoundedNlsat() && transcendentals.numFailures > 0;
|
|
682
|
+
if (isFailed && !isRunningNlsat) {
|
|
683
|
+
if (!NLA_PARAMS.nra) return L_UNDEF;
|
|
684
|
+
isRunningNlsat = true;
|
|
685
|
+
}
|
|
686
|
+
if (!isRunningNlsat) return L_TRUE;
|
|
687
|
+
const result = this.boundedNlsat();
|
|
688
|
+
if (result === L_FALSE) return L_FALSE;
|
|
689
|
+
if (result === L_TRUE && transcendentals.isNraModelValid()) return L_TRUE;
|
|
690
|
+
if (result === L_TRUE) this.setUseNraModel(false);
|
|
691
|
+
return L_UNDEF;
|
|
665
692
|
}
|
|
666
693
|
|
|
667
694
|
check(level: number) {
|
|
@@ -723,7 +750,8 @@ export class NlaCore {
|
|
|
723
750
|
);
|
|
724
751
|
if (this.isCanceled()) return L_UNDEF;
|
|
725
752
|
if (this.lemmas.length > 0 || this.literals.length > 0 || this.isCheckFeasible) return L_FALSE;
|
|
726
|
-
if (this.isNlaSatisfied) return
|
|
753
|
+
if (this.isNlaSatisfied) return this.checkTranscendentalsAndFinish();
|
|
754
|
+
if (hasNoEffect() && !this.transcendentals.isEmpty) this.transcendentals.check();
|
|
727
755
|
if (
|
|
728
756
|
hasNoEffect() &&
|
|
729
757
|
NLA_PARAMS.nraCheckAssignment &&
|
|
@@ -732,8 +760,7 @@ export class NlaCore {
|
|
|
732
760
|
result = this.nra.checkAssignment();
|
|
733
761
|
if (result !== L_TRUE) this.checkAssignmentFailCount++;
|
|
734
762
|
}
|
|
735
|
-
if (hasNoEffect() &&
|
|
736
|
-
result = this.boundedNlsat();
|
|
763
|
+
if (hasNoEffect() && this.shouldRunBoundedNlsat()) result = this.boundedNlsat();
|
|
737
764
|
if (hasNoEffect()) this.basics.basicLemma(true);
|
|
738
765
|
if (hasNoEffect() && isDelayingBounds) this.basics.basicLemma(false);
|
|
739
766
|
if (hasNoEffect() && isDelayingBounds) this.addBounds();
|
|
@@ -758,6 +785,10 @@ export class NlaCore {
|
|
|
758
785
|
return result;
|
|
759
786
|
}
|
|
760
787
|
|
|
788
|
+
private shouldRunBoundedNlsat() {
|
|
789
|
+
return NLA_PARAMS.nra && this.nlsatBackoff.shouldRun();
|
|
790
|
+
}
|
|
791
|
+
|
|
761
792
|
private boundedNlsat() {
|
|
762
793
|
const budget = 100000;
|
|
763
794
|
const result = this.nra.check(100, budget);
|
|
@@ -1,5 +1,3 @@
|
|
|
1
|
-
// Ported from Z3 (src/math/lp/nla_divisions.h, src/math/lp/nla_divisions.cpp), MIT license, see
|
|
2
|
-
// z3-license.txt.
|
|
3
1
|
import { getEuclideanDiv, Rational } from "../rational";
|
|
4
2
|
import { KIND_EQ, KIND_GE, KIND_GT, KIND_LE, KIND_LT, KIND_NE } from "./constraints";
|
|
5
3
|
import { NULL_LPVAR } from "./lar-solver";
|
|
@@ -1,4 +1,3 @@
|
|
|
1
|
-
// Ported from Z3 (src/math/lp/monic.h, src/math/lp/emonics.h, src/math/lp/emonics.cpp), MIT license, see z3-license.txt.
|
|
2
1
|
import { getSignedVarVar, isSignedVarNegated, negateSignedVar, type VarEqs } from "./nla-var-eqs";
|
|
3
2
|
import { TrailStack, UnionFind } from "./union-find";
|
|
4
3
|
|
|
@@ -1,4 +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
1
|
// Deviation from Z3: its nlsat conflict check (is_nla_conflict) is not ported.
|
|
3
2
|
import { PddMemoryOutError } from "../../../../errors";
|
|
4
3
|
import { getEuclideanMod, getGcd, getLcm, Rational } from "../rational";
|
|
@@ -97,9 +96,9 @@ const isPerfectSquareCross = (
|
|
|
97
96
|
};
|
|
98
97
|
|
|
99
98
|
export class Grobner {
|
|
100
|
-
private
|
|
101
|
-
private
|
|
102
|
-
private
|
|
99
|
+
private propagatesQuotients = false;
|
|
100
|
+
private hasGcdTest = false;
|
|
101
|
+
private expandsTerms = false;
|
|
103
102
|
private readonly manager: PddManager;
|
|
104
103
|
private readonly solver: PddSolver;
|
|
105
104
|
private readonly nexCreator = new NexCreator();
|
|
@@ -116,6 +115,12 @@ export class Grobner {
|
|
|
116
115
|
this.solver = new PddSolver(this.manager, () => core.isCanceled());
|
|
117
116
|
}
|
|
118
117
|
|
|
118
|
+
updateParams() {
|
|
119
|
+
this.propagatesQuotients = NLA_PARAMS.grobnerPropagateQuotients;
|
|
120
|
+
this.hasGcdTest = NLA_PARAMS.grobnerGcdTest;
|
|
121
|
+
this.expandsTerms = NLA_PARAMS.grobnerExpandTerms;
|
|
122
|
+
}
|
|
123
|
+
|
|
119
124
|
run() {
|
|
120
125
|
if (this.core.lra.getColumnCount() > 5000) return;
|
|
121
126
|
if (this.quota === 0) this.quota = NLA_PARAMS.grQ;
|
|
@@ -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";
|