tla-ts 0.0.9 → 0.0.10-dev.09e53c2a6
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/README.md +30 -1
- package/dist/compile.cjs +23 -0
- package/dist/compile.js +23 -0
- package/dist/deciders.cjs +41 -37
- package/dist/deciders.js +57 -53
- package/dist/index.cjs +1 -1
- package/dist/index.d.cts +109 -10
- package/dist/index.d.ts +109 -10
- package/dist/index.js +1 -1
- package/dist/parallel-worker.cjs +1 -1
- package/dist/parallel-worker.js +1 -1
- package/dist/prove-worker.cjs +1 -1
- package/dist/prove-worker.js +1 -1
- package/dist/prove.cjs +2746 -410
- package/dist/prove.js +2745 -409
- package/dist/run.cjs +146 -31
- package/dist/run.js +146 -31
- package/dist/tlapm.cjs +2 -2
- package/dist/tlapm.js +2 -2
- package/dist/transfer.cjs +132 -104
- package/dist/transfer.js +132 -104
- package/dist/worker.cjs +6 -6
- package/dist/worker.js +6 -6
- package/package.json +3 -1
- package/src/ast.ts +45 -59
- package/src/bags.ts +99 -102
- package/src/builtins.ts +28 -75
- package/src/bundled-modules.ts +1 -8
- package/src/check-failure.ts +116 -0
- package/src/check-trace.ts +282 -0
- package/src/check.ts +797 -782
- package/src/cli/options.ts +12 -32
- package/src/cli/run.ts +0 -2
- package/src/cli/runtime-invariants.ts +136 -0
- package/src/cli/shared.ts +19 -12
- package/src/cli/tlapm.ts +433 -82
- package/src/cli/tlc-arguments.ts +652 -0
- package/src/cli/tlc-output.ts +687 -0
- package/src/cli/tlc-usage.ts +360 -0
- package/src/cli/tlc.ts +323 -658
- package/src/cli/typescript.ts +23 -0
- package/src/cli/xml-exporter.ts +27 -49
- package/src/cli.ts +0 -1
- package/src/codegen.ts +196 -74
- package/src/config.ts +140 -109
- package/src/coverage.ts +830 -0
- package/src/dependencies.ts +36 -54
- package/src/dfid.ts +618 -0
- package/src/environment-config.ts +315 -0
- package/src/environment.ts +178 -339
- package/src/errors.ts +100 -57
- package/src/evaluate.ts +598 -340
- package/src/exit-codes.ts +38 -3
- package/src/fingerprints.ts +75 -11
- package/src/index.ts +3 -0
- package/src/instances.ts +126 -21
- package/src/java-hash.ts +7 -0
- package/src/java-overrides.ts +4 -19
- package/src/json-reader.ts +455 -0
- package/src/json.ts +252 -139
- package/src/levels.ts +46 -58
- package/src/lexer.ts +83 -101
- package/src/liveness-checker.ts +590 -311
- package/src/liveness.ts +180 -124
- package/src/obligations/action.ts +17 -44
- package/src/obligations/anonymize.ts +120 -95
- package/src/obligations/enabled-axioms.ts +218 -0
- package/src/obligations/equality.ts +1 -3
- package/src/obligations/expression.ts +37 -26
- package/src/obligations/format.ts +0 -10
- package/src/obligations/generate.ts +66 -64
- package/src/obligations/index.ts +38 -19
- package/src/obligations/levels.ts +27 -18
- package/src/obligations/module.ts +28 -55
- package/src/obligations/normalize.ts +30 -37
- package/src/obligations/operators.ts +0 -3
- package/src/obligations/pragma.ts +52 -24
- package/src/obligations/printer.ts +89 -58
- package/src/obligations/proof.ts +3 -6
- package/src/obligations/regroup.ts +0 -5
- package/src/obligations/simplify.ts +57 -63
- package/src/obligations/source.ts +119 -95
- package/src/obligations/subexpression.ts +49 -28
- package/src/obligations/substitution.ts +1 -5
- package/src/obligations/temporal.ts +12 -20
- package/src/obligations/tuples.ts +2 -10
- package/src/parallel-worker.ts +30 -60
- package/src/parallel.ts +59 -73
- package/src/parser.ts +1082 -399
- package/src/pcal/ast.ts +53 -86
- package/src/pcal/parse.ts +144 -219
- package/src/pcal/tokenize.ts +91 -131
- package/src/pcal/translate.ts +83 -130
- package/src/pcal/validate.ts +48 -68
- package/src/pretty-print.ts +7 -8
- package/src/prover/decide-pool.ts +8 -13
- package/src/prover/deciders.ts +12 -13
- package/src/prover/first-order.ts +0 -11
- package/src/prover/isabelle/decide.ts +3 -31
- package/src/prover/isabelle/encode.ts +82 -64
- package/src/prover/isabelle/isar/attrib.ts +250 -0
- package/src/prover/isabelle/isar/context.ts +335 -0
- package/src/prover/isabelle/isar/induct.ts +382 -0
- package/src/prover/isabelle/isar/inner-syntax.ts +262 -117
- package/src/prover/isabelle/isar/method.ts +510 -226
- package/src/prover/isabelle/isar/proof.ts +570 -23
- package/src/prover/isabelle/isar/rule-cases.ts +224 -0
- package/src/prover/isabelle/isar/theory.ts +488 -88
- package/src/prover/isabelle/isar/toplevel.ts +331 -0
- package/src/prover/isabelle/isar/type-check.ts +99 -38
- package/src/prover/isabelle/provers/blast/blast.ts +16 -105
- package/src/prover/isabelle/provers/blast/branch.ts +0 -33
- package/src/prover/isabelle/provers/blast/prove.ts +0 -36
- package/src/prover/isabelle/provers/blast/rules.ts +5 -45
- package/src/prover/isabelle/provers/blast/state.ts +1 -29
- package/src/prover/isabelle/provers/blast/term.ts +8 -37
- package/src/prover/isabelle/provers/clasimp.ts +0 -14
- package/src/prover/isabelle/provers/classical.ts +58 -61
- package/src/prover/isabelle/provers/hypsubst.ts +27 -52
- package/src/prover/isabelle/pure/bicompose.ts +24 -39
- package/src/prover/isabelle/pure/consts.ts +0 -8
- package/src/prover/isabelle/pure/conv.ts +2 -18
- package/src/prover/isabelle/pure/drule.ts +95 -45
- package/src/prover/isabelle/pure/envir.ts +2 -53
- package/src/prover/isabelle/pure/goal.ts +1 -9
- package/src/prover/isabelle/pure/interrupt.ts +0 -5
- package/src/prover/isabelle/pure/list.ts +0 -3
- package/src/prover/isabelle/pure/logic.ts +1 -16
- package/src/prover/isabelle/pure/name.ts +1 -10
- package/src/prover/isabelle/pure/net.ts +2 -60
- package/src/prover/isabelle/pure/object-logic.ts +15 -16
- package/src/prover/isabelle/pure/pattern.ts +1 -20
- package/src/prover/isabelle/pure/raw-simplifier.ts +16 -63
- package/src/prover/isabelle/pure/rewriter.ts +31 -74
- package/src/prover/isabelle/pure/search.ts +2 -11
- package/src/prover/isabelle/pure/seq.ts +0 -11
- package/src/prover/isabelle/pure/simplifier.ts +27 -16
- package/src/prover/isabelle/pure/table.ts +2 -33
- package/src/prover/isabelle/pure/tactic.ts +11 -23
- package/src/prover/isabelle/pure/tactical.ts +47 -48
- package/src/prover/isabelle/pure/term-ord.ts +1 -7
- package/src/prover/isabelle/pure/term.ts +1 -44
- package/src/prover/isabelle/pure/thm.ts +26 -48
- package/src/prover/isabelle/pure/type.ts +1 -16
- package/src/prover/isabelle/pure/unify.ts +19 -31
- package/src/prover/isabelle/pure/variable.ts +2 -8
- package/src/prover/isabelle/tla/classical-setup.ts +17 -25
- package/src/prover/isabelle/tla/context.ts +65 -26
- package/src/prover/isabelle/tla/logic-data.ts +1 -1
- package/src/prover/isabelle/tla/logic.ts +53 -32
- package/src/prover/isabelle/tla/simpdata.ts +45 -44
- package/src/prover/isabelle/tools/intuitionistic.ts +28 -21
- package/src/prover/ocaml.ts +4 -7
- package/src/prover/prep/action.ts +33 -66
- package/src/prover/prep/enabled-axioms.ts +22 -20
- package/src/prover/prep/fingerprint.ts +2 -21
- package/src/prover/prep/level-comparison.ts +8 -12
- package/src/prover/prep/md5.ts +0 -2
- package/src/prover/prep/methods.ts +189 -86
- package/src/prover/prep/normalize.ts +42 -37
- package/src/prover/prove-worker.ts +0 -2
- package/src/prover/prove.ts +398 -133
- package/src/prover/ptl/decide.ts +96 -56
- package/src/prover/ptl/encode.ts +15 -38
- package/src/prover/ptl/sat.ts +24 -32
- package/src/prover/ptl/tableau.ts +40 -28
- package/src/prover/smt/arithmetic.ts +310 -0
- package/src/prover/smt/axioms.ts +12 -15
- package/src/prover/smt/context.ts +60 -32
- package/src/prover/smt/data.ts +517 -401
- package/src/prover/smt/encode.ts +155 -85
- package/src/prover/smt/extensionality.ts +5 -13
- package/src/prover/smt/flatten.ts +7 -28
- package/src/prover/smt/format.ts +33 -14
- package/src/prover/smt/instances.ts +7 -11
- package/src/prover/smt/layout.ts +91 -0
- package/src/prover/smt/rewrite.ts +1026 -658
- package/src/prover/smt/simplify.ts +441 -0
- package/src/prover/smt/solver/ackermannize-bv-tactic.ts +61 -0
- package/src/prover/smt/solver/ackr-helper.ts +179 -0
- package/src/prover/smt/solver/ackr-model-converter.ts +105 -0
- package/src/prover/smt/solver/act-cache.ts +0 -16
- package/src/prover/smt/solver/add-bounds-tactic.ts +59 -0
- package/src/prover/smt/solver/aig-tactic.ts +52 -0
- package/src/prover/smt/solver/aig.ts +889 -0
- package/src/prover/smt/solver/arith-rewriter.ts +615 -53
- 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/array.ts +1 -3
- package/src/prover/smt/solver/asserted-formulas.ts +87 -58
- package/src/prover/smt/solver/ast-lt.ts +166 -22
- package/src/prover/smt/solver/ast-util.ts +160 -7
- package/src/prover/smt/solver/ast.ts +1424 -180
- package/src/prover/smt/solver/auf-solver.ts +7 -44
- 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 -10
- package/src/prover/smt/solver/cg-table.ts +39 -42
- package/src/prover/smt/solver/check-logic.ts +330 -0
- package/src/prover/smt/solver/clause.ts +0 -27
- package/src/prover/smt/solver/cofactor-elim-term-ite.ts +278 -0
- package/src/prover/smt/solver/conflict-resolution.ts +78 -11
- package/src/prover/smt/solver/context.ts +519 -175
- package/src/prover/smt/solver/ctx-simplify.ts +33 -50
- 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 +39 -30
- 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 -11
- package/src/prover/smt/solver/e-matching.ts +9 -41
- 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 -23
- package/src/prover/smt/solver/eq2bv-tactic.ts +218 -0
- package/src/prover/smt/solver/euf/arith-axioms.ts +403 -0
- package/src/prover/smt/solver/euf/arith-internalize.ts +653 -0
- package/src/prover/smt/solver/euf/arith-solver.ts +889 -0
- package/src/prover/smt/solver/euf/array-axioms.ts +527 -0
- package/src/prover/smt/solver/euf/array-internalize.ts +428 -0
- package/src/prover/smt/solver/euf/array-solver.ts +306 -0
- package/src/prover/smt/solver/euf/bv-ackerman.ts +162 -0
- package/src/prover/smt/solver/euf/bv-internalize.ts +748 -0
- package/src/prover/smt/solver/euf/bv-solver.ts +449 -0
- package/src/prover/smt/solver/euf/dt-solver.ts +618 -0
- package/src/prover/smt/solver/euf/egraph.ts +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 -5
- package/src/prover/smt/solver/expr-safe-replace.ts +26 -7
- 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 -26
- package/src/prover/smt/solver/fix-dl-var.ts +148 -0
- package/src/prover/smt/solver/flat-literals.ts +0 -9
- package/src/prover/smt/solver/fm-tactic.ts +884 -0
- package/src/prover/smt/solver/fpa-decl-plugin.ts +618 -0
- package/src/prover/smt/solver/fpa-rewriter.ts +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 +176 -28
- 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 -9
- package/src/prover/smt/solver/hashtable.ts +26 -23
- package/src/prover/smt/solver/inf-eps.ts +63 -0
- package/src/prover/smt/solver/inj-axiom.ts +101 -0
- package/src/prover/smt/solver/internalizer.ts +112 -132
- package/src/prover/smt/solver/lackr.ts +381 -0
- package/src/prover/smt/solver/lbool.ts +0 -2
- package/src/prover/smt/solver/lia2card.ts +268 -0
- package/src/prover/smt/solver/lia2pb.ts +154 -0
- package/src/prover/smt/solver/literal.ts +0 -4
- package/src/prover/smt/solver/logic-tactics.ts +345 -0
- package/src/prover/smt/solver/lp/bound-propagator.ts +7 -26
- package/src/prover/smt/solver/lp/constraints.ts +1 -8
- package/src/prover/smt/solver/lp/containers.ts +11 -30
- package/src/prover/smt/solver/lp/core-solver.ts +23 -29
- package/src/prover/smt/solver/lp/cross-nested.ts +5 -20
- package/src/prover/smt/solver/lp/dep-intervals.ts +6 -24
- package/src/prover/smt/solver/lp/dependency.ts +0 -5
- package/src/prover/smt/solver/lp/dioph-eq.ts +8 -103
- package/src/prover/smt/solver/lp/explanation.ts +0 -6
- package/src/prover/smt/solver/lp/gomory.ts +8 -22
- package/src/prover/smt/solver/lp/hnf-cutter.ts +16 -23
- package/src/prover/smt/solver/lp/hnf.ts +10 -28
- package/src/prover/smt/solver/lp/int-cube.ts +17 -39
- package/src/prover/smt/solver/lp/int-solver.ts +3 -35
- package/src/prover/smt/solver/lp/lar-solver.ts +69 -82
- package/src/prover/smt/solver/lp/lar-term.ts +0 -5
- package/src/prover/smt/solver/lp/lp-settings.ts +0 -14
- package/src/prover/smt/solver/lp/maximize-term.ts +76 -52
- package/src/prover/smt/solver/lp/nex-creator.ts +4 -28
- package/src/prover/smt/solver/lp/nex.ts +0 -6
- package/src/prover/smt/solver/lp/nla-backoff.ts +0 -5
- package/src/prover/smt/solver/lp/nla-basics.ts +48 -30
- package/src/prover/smt/solver/lp/nla-core.ts +91 -135
- package/src/prover/smt/solver/lp/nla-divisions.ts +31 -43
- package/src/prover/smt/solver/lp/nla-emonics.ts +3 -21
- package/src/prover/smt/solver/lp/nla-factorization.ts +0 -4
- package/src/prover/smt/solver/lp/nla-grobner.ts +22 -72
- package/src/prover/smt/solver/lp/nla-horner.ts +2 -12
- package/src/prover/smt/solver/lp/nla-intervals.ts +1 -12
- package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +15 -42
- package/src/prover/smt/solver/lp/nla-monotone.ts +1 -6
- package/src/prover/smt/solver/lp/nla-order.ts +0 -13
- package/src/prover/smt/solver/lp/nla-patcher.ts +3 -7
- package/src/prover/smt/solver/lp/nla-powers.ts +220 -0
- package/src/prover/smt/solver/lp/nla-tangents.ts +0 -10
- package/src/prover/smt/solver/lp/nla-throttle.ts +0 -6
- package/src/prover/smt/solver/lp/nla-transcendentals.ts +324 -0
- package/src/prover/smt/solver/lp/nla-types.ts +0 -12
- package/src/prover/smt/solver/lp/nla-var-eqs.ts +4 -26
- package/src/prover/smt/solver/lp/nra-solver.ts +123 -112
- package/src/prover/smt/solver/lp/numeric-pair.ts +0 -4
- package/src/prover/smt/solver/lp/pdd-interval.ts +0 -3
- package/src/prover/smt/solver/lp/pdd-simplifier.ts +1 -14
- package/src/prover/smt/solver/lp/pdd-solver.ts +2 -33
- package/src/prover/smt/solver/lp/pdd.ts +7 -70
- package/src/prover/smt/solver/lp/random-updater.ts +0 -9
- package/src/prover/smt/solver/lp/static-matrix.ts +8 -19
- package/src/prover/smt/solver/lp/union-find.ts +5 -5
- package/src/prover/smt/solver/macro-finder.ts +530 -0
- package/src/prover/smt/solver/mam-compiler.ts +129 -139
- package/src/prover/smt/solver/mam-interpreter.ts +0 -21
- package/src/prover/smt/solver/max-bv-sharing-tactic.ts +17 -0
- package/src/prover/smt/solver/max-cliques.ts +105 -0
- package/src/prover/smt/solver/maxcore.ts +309 -0
- package/src/prover/smt/solver/maximize-ac-sharing.ts +8 -21
- package/src/prover/smt/solver/maxlex.ts +115 -0
- package/src/prover/smt/solver/maxsmt-base.ts +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 +19 -62
- package/src/prover/smt/solver/model-evaluator.ts +190 -40
- package/src/prover/smt/solver/model-finder.ts +14 -32
- package/src/prover/smt/solver/model-generator.ts +56 -40
- package/src/prover/smt/solver/model-macro-solver.ts +60 -114
- package/src/prover/smt/solver/model-printer.ts +214 -0
- package/src/prover/smt/solver/mpf.ts +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 +177 -160
- package/src/prover/smt/solver/nlsat/atoms.ts +24 -24
- package/src/prover/smt/solver/nlsat/evaluator.ts +16 -22
- package/src/prover/smt/solver/nlsat/explain.ts +65 -69
- package/src/prover/smt/solver/nlsat/interval-set.ts +9 -51
- package/src/prover/smt/solver/nlsat/levelwise.ts +48 -135
- package/src/prover/smt/solver/nlsat/mpbq.ts +47 -14
- package/src/prover/smt/solver/nlsat/polynomial.ts +29 -161
- package/src/prover/smt/solver/nlsat/solver.ts +241 -110
- 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 -9
- package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +1 -47
- package/src/prover/smt/solver/nlsat/upolynomial.ts +10 -93
- package/src/prover/smt/solver/nlsat-tactic.ts +82 -0
- package/src/prover/smt/solver/nnf.ts +107 -60
- 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 +21 -26
- 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 +204 -79
- package/src/prover/smt/solver/probes.ts +512 -0
- package/src/prover/smt/solver/propagate-values.ts +37 -30
- package/src/prover/smt/solver/proto-model.ts +650 -66
- package/src/prover/smt/solver/pull-quant.ts +28 -23
- package/src/prover/smt/solver/purify-arith.ts +632 -0
- package/src/prover/smt/solver/qe-arith-plugin.ts +1098 -0
- package/src/prover/smt/solver/qe-lite-der.ts +2 -31
- package/src/prover/smt/solver/qe-lite-fm.ts +4 -28
- package/src/prover/smt/solver/qe-lite.ts +39 -49
- 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 -16
- 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 +17 -74
- package/src/prover/smt/solver/quantifier-analyzer.ts +26 -47
- package/src/prover/smt/solver/quantifier-manager.ts +8 -23
- package/src/prover/smt/solver/quasi-macros.ts +243 -0
- package/src/prover/smt/solver/random-gen.ts +0 -2
- package/src/prover/smt/solver/rational.ts +45 -8
- package/src/prover/smt/solver/recfun-decl-plugin.ts +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 -6
- package/src/prover/smt/solver/relevancy.ts +2 -16
- package/src/prover/smt/solver/rewriter-tpl.ts +52 -129
- package/src/prover/smt/solver/rewriter.ts +477 -120
- package/src/prover/smt/solver/rlimit.ts +39 -21
- 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 +3140 -365
- 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 +119 -39
- package/src/prover/smt/solver/sort.ts +1 -5
- package/src/prover/smt/solver/static-features.ts +314 -0
- package/src/prover/smt/solver/sticky-generations.ts +0 -6
- package/src/prover/smt/solver/tactic.ts +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 +55 -25
- package/src/prover/smt/solver/theory-lra-bounds.ts +31 -11
- package/src/prover/smt/solver/theory-lra-final-check.ts +59 -91
- package/src/prover/smt/solver/theory-lra-internalize.ts +94 -53
- package/src/prover/smt/solver/theory-lra-model.ts +23 -53
- package/src/prover/smt/solver/theory-lra-propagate.ts +24 -40
- package/src/prover/smt/solver/theory-lra-state.ts +6 -27
- package/src/prover/smt/solver/theory-lra.ts +188 -8
- 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 +37 -39
- package/src/prover/smt/table.ts +3 -10
- package/src/prover/smt/types.ts +146 -0
- package/src/prover/tlapm/cache.ts +67 -41
- package/src/prover/tlapm/ocaml-marshal.ts +19 -21
- package/src/prover/tlapm/tlapm.ts +21 -20
- package/src/prover/tlapm-library.ts +3208 -0
- package/src/prover/verdict.ts +9 -2
- package/src/prover/zenon/check/check.ts +1 -11
- package/src/prover/zenon/check/definitions.ts +5 -15
- package/src/prover/zenon/check/equality.ts +0 -8
- package/src/prover/zenon/check/functions.ts +0 -4
- package/src/prover/zenon/check/keys.ts +0 -7
- package/src/prover/zenon/check/propositional.ts +0 -3
- package/src/prover/zenon/check/records.ts +1 -6
- package/src/prover/zenon/check/relations.ts +2 -14
- package/src/prover/zenon/check/rewrites.ts +2 -21
- package/src/prover/zenon/check/sets.ts +40 -61
- package/src/prover/zenon/check/terms.ts +1 -19
- package/src/prover/zenon/check/tla.ts +0 -6
- package/src/prover/zenon/decide.ts +10 -19
- package/src/prover/zenon/encode.ts +0 -9
- package/src/prover/zenon/eqrel.ts +2 -15
- package/src/prover/zenon/equality-rules.ts +0 -6
- package/src/prover/zenon/expr.ts +8 -28
- package/src/prover/zenon/index-table.ts +26 -59
- package/src/prover/zenon/isar-case.ts +8 -20
- package/src/prover/zenon/isar.ts +35 -65
- package/src/prover/zenon/limits.ts +0 -4
- package/src/prover/zenon/llproof.ts +2 -22
- package/src/prover/zenon/mltoll.ts +66 -106
- package/src/prover/zenon/node.ts +20 -15
- package/src/prover/zenon/ocaml.ts +1 -17
- package/src/prover/zenon/parse.ts +9 -13
- package/src/prover/zenon/phrase.ts +1 -13
- package/src/prover/zenon/proof.ts +0 -11
- package/src/prover/zenon/propositional-rules.ts +0 -7
- package/src/prover/zenon/rules.ts +2 -8
- package/src/prover/zenon/search.ts +11 -35
- package/src/prover/zenon/tla/functions.ts +59 -33
- package/src/prover/zenon/tla/llproof.ts +67 -78
- package/src/prover/zenon/tla/records.ts +57 -35
- package/src/prover/zenon/tla/rewrites.ts +12 -21
- package/src/prover/zenon/tla/sets.ts +88 -59
- package/src/prover/zenon/tla/terms.ts +0 -8
- package/src/prover/zenon/tla/tla.ts +66 -66
- package/src/randomization.ts +81 -35
- package/src/resolve.ts +67 -185
- package/src/runtime.ts +26 -22
- package/src/sany/builtins.ts +2 -5
- 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 +191 -2764
- package/src/sany/levels.ts +5 -35
- package/src/sany/lexer.ts +58 -77
- package/src/sany/linter.ts +0 -10
- package/src/sany/modules.ts +1 -5
- package/src/sany/nodes.ts +5 -43
- package/src/sany/parse-error.ts +39 -117
- package/src/sany/report.ts +32 -69
- package/src/sany/selectors.ts +49 -76
- package/src/sany/source.ts +1 -17
- package/src/sany/xml.ts +35 -117
- package/src/search.ts +671 -169
- package/src/simulate.ts +712 -0
- package/src/spec-description.ts +192 -100
- package/src/standard-definitions.ts +4 -4
- package/src/standard-modules.ts +264 -95
- package/src/state-graph.ts +52 -33
- package/src/subexpressions.ts +69 -52
- package/src/substitution-levels.ts +7 -7
- package/src/successors.ts +267 -100
- package/src/symmetry.ts +35 -27
- package/src/tableau.ts +29 -26
- package/src/tlc/fingerprint.ts +267 -79
- package/src/tlc/jar-data.ts +112 -6
- package/src/tlc/messages.ts +125 -54
- package/src/tlc/order.ts +39 -69
- package/src/tlc/random.ts +37 -49
- package/src/tlc/replay.ts +553 -228
- package/src/tlc/summary.ts +64 -60
- package/src/tlc/tlc-operators.ts +78 -44
- package/src/tlc/tlcext-operators.ts +171 -122
- package/src/tlc/trace-spec.ts +249 -0
- package/src/tlc/value-stream.ts +139 -0
- package/src/tlc/version.ts +1 -4
- package/src/transfer.ts +22 -25
- package/src/typed-tier.ts +6535 -0
- package/src/typescript/actions.ts +479 -0
- package/src/typescript/collections.ts +614 -0
- package/src/typescript/compile.ts +63 -0
- package/src/typescript/context.ts +94 -0
- package/src/typescript/emit.ts +121 -0
- package/src/typescript/expressions.ts +496 -0
- package/src/typescript/formula.ts +154 -0
- package/src/typescript/functions.ts +284 -0
- package/src/typescript/model.ts +162 -0
- package/src/typescript/names.ts +114 -0
- package/src/typescript/program.ts +48 -0
- package/src/typescript/properties.ts +139 -0
- package/src/typescript/scope.ts +112 -0
- package/src/typescript/steps.ts +167 -0
- package/src/typescript/types.ts +171 -0
- package/src/values.ts +832 -484
- package/src/worker.ts +7 -8
- package/src/prover/isabelle/isar/statement.ts +0 -57
- package/src/prover/smt/solver/z3-license.txt +0 -10
- package/src/prover/tlaps-module.ts +0 -510
- package/src/prover/zenon/LICENSE +0 -32
|
@@ -1,7 +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. The tangent lemmas of nla: for a binary product whose value is
|
|
3
|
-
// wrong, the lines through the point of its factors' values and two planes tangent to z = xy that
|
|
4
|
-
// cut the point off.
|
|
5
1
|
import { Rational } from "../rational";
|
|
6
2
|
import { KIND_EQ, KIND_GE, KIND_GT, KIND_LE, KIND_LT, KIND_NE } from "./constraints";
|
|
7
3
|
import { LarTerm } from "./lar-term";
|
|
@@ -20,14 +16,11 @@ const mkPoint = (x: Rational, y: Rational): Point => ({ x, y });
|
|
|
20
16
|
|
|
21
17
|
const TWO = Rational.of(2n);
|
|
22
18
|
|
|
23
|
-
// tangent_imp: the lemmas for one monic and its binary factorization.
|
|
24
19
|
class TangentImp {
|
|
25
20
|
private a = mkPoint(Rational.zero, Rational.zero);
|
|
26
21
|
private b = mkPoint(Rational.zero, Rational.zero);
|
|
27
22
|
private readonly correctValue: Rational;
|
|
28
|
-
// Whether the wrong value is below the correct one.
|
|
29
23
|
private readonly isBelow: boolean;
|
|
30
|
-
// Whether the tangent points are strictly inside the bound box.
|
|
31
24
|
private isPlStrictInterior = true;
|
|
32
25
|
private readonly monicVar: number;
|
|
33
26
|
private readonly x: Factor;
|
|
@@ -154,7 +147,6 @@ class TangentImp {
|
|
|
154
147
|
this.explain(lemma);
|
|
155
148
|
}
|
|
156
149
|
|
|
157
|
-
// get_initial_points: two planes tangent to z = xy, at a and at b, that make a cut.
|
|
158
150
|
private getInitialPoints() {
|
|
159
151
|
const x = this.xy.x;
|
|
160
152
|
const y = this.xy.y;
|
|
@@ -170,7 +162,6 @@ class TangentImp {
|
|
|
170
162
|
this.b = mkPoint(x.add(delta), y.add(delta));
|
|
171
163
|
}
|
|
172
164
|
|
|
173
|
-
// push_point: the point moved away from xy, doubling the distance, while the plane still cuts.
|
|
174
165
|
private pushPoint(point: Point) {
|
|
175
166
|
let result = point;
|
|
176
167
|
let difference = mkPoint(point.x.sub(this.xy.x), point.y.sub(this.xy.y));
|
|
@@ -187,7 +178,6 @@ class TangentImp {
|
|
|
187
178
|
return point.x.mul(this.xy.y).add(point.y.mul(this.xy.x)).sub(point.x.mul(point.y));
|
|
188
179
|
}
|
|
189
180
|
|
|
190
|
-
// set_box_corners: McCormick points at the corners of the factors' bound box.
|
|
191
181
|
private setBoxCorners() {
|
|
192
182
|
const core = this.core;
|
|
193
183
|
const xVar = this.xVar;
|
|
@@ -1,6 +1,3 @@
|
|
|
1
|
-
// Ported from Z3 (src/math/lp/nla_throttle.h, src/math/lp/nla_throttle.cpp), MIT license, see
|
|
2
|
-
// z3-license.txt. The signatures of the lemmas nla has generated in the current scope, so that a
|
|
3
|
-
// pass does not generate the same lemma twice.
|
|
4
1
|
import type { Rational } from "../rational";
|
|
5
2
|
import type { LarSolver } from "./lar-solver";
|
|
6
3
|
import type { LpStats } from "./lp-settings";
|
|
@@ -23,8 +20,6 @@ export class NlaThrottle {
|
|
|
23
20
|
private stats: LpStats,
|
|
24
21
|
) {}
|
|
25
22
|
|
|
26
|
-
// insert_new: whether the signature, its 8 values padded with zeros, was seen, recording it when
|
|
27
|
-
// not.
|
|
28
23
|
private insertNew(values: number[]) {
|
|
29
24
|
const key = [...values, ...Array.from({ length: 8 - values.length }, () => 0)].join(",");
|
|
30
25
|
if (this.seen.has(key)) {
|
|
@@ -72,7 +67,6 @@ export class NlaThrottle {
|
|
|
72
67
|
return this.insertNew([kind, monicVar, xVar, yVar, isBelow ? 1 : 0, planeType]);
|
|
73
68
|
}
|
|
74
69
|
|
|
75
|
-
// The simplified tangent signature, without the plane type.
|
|
76
70
|
insertSimplifiedTangent(
|
|
77
71
|
kind: number,
|
|
78
72
|
monicVar: number,
|
|
@@ -0,0 +1,324 @@
|
|
|
1
|
+
import { Rational } from "../rational";
|
|
2
|
+
import {
|
|
3
|
+
evalTranscendental,
|
|
4
|
+
getErrorBound,
|
|
5
|
+
PI_2_UPPER,
|
|
6
|
+
PI_UPPER,
|
|
7
|
+
type TranscendentalOp,
|
|
8
|
+
} from "../nlsat/transcendental-eval";
|
|
9
|
+
import { type ConstraintKind, KIND_GE, KIND_GT, KIND_LE, KIND_LT } from "./constraints";
|
|
10
|
+
import { NULL_LPVAR } from "./lar-solver";
|
|
11
|
+
import { LarTerm } from "./lar-term";
|
|
12
|
+
import type { NlaCore } from "./nla-core";
|
|
13
|
+
import { LemmaBuilder, mkIneq } from "./nla-types";
|
|
14
|
+
|
|
15
|
+
export interface TranscendentalApp {
|
|
16
|
+
readonly op: TranscendentalOp;
|
|
17
|
+
readonly arg: number;
|
|
18
|
+
readonly val: number;
|
|
19
|
+
}
|
|
20
|
+
|
|
21
|
+
export interface Atan2App {
|
|
22
|
+
readonly y: number;
|
|
23
|
+
readonly x: number;
|
|
24
|
+
readonly val: number;
|
|
25
|
+
}
|
|
26
|
+
|
|
27
|
+
// atan2 has a branch cut where it jumps by 2 pi, so its error bound is generous.
|
|
28
|
+
const getAtan2ErrorBound = (value: number) => 4096 * Number.EPSILON * Math.max(1, Math.abs(value));
|
|
29
|
+
|
|
30
|
+
// Z3's arith.nl.transcendental_tolerance.
|
|
31
|
+
const TOLERANCE = 0.0000001;
|
|
32
|
+
|
|
33
|
+
const mkTerm = (first: number, firstCoeff: number, second: number, secondCoeff: number) =>
|
|
34
|
+
new LarTerm([
|
|
35
|
+
[first, Rational.fromNumber(firstCoeff)],
|
|
36
|
+
[second, Rational.fromNumber(secondCoeff)],
|
|
37
|
+
]);
|
|
38
|
+
|
|
39
|
+
// A cheap check of the applications of transcendental functions against the LP assignment. It adds
|
|
40
|
+
// exact range bounds and linear lemmas, and leaves the polynomial refinement to nlsat, which a
|
|
41
|
+
// value away from the function by more than round-off sends the problem to.
|
|
42
|
+
export class NlaTranscendentals {
|
|
43
|
+
readonly apps: TranscendentalApp[] = [];
|
|
44
|
+
readonly atan2Apps: Atan2App[] = [];
|
|
45
|
+
piVar = NULL_LPVAR;
|
|
46
|
+
numFailures = 0;
|
|
47
|
+
|
|
48
|
+
constructor(private core: NlaCore) {}
|
|
49
|
+
|
|
50
|
+
get isEmpty() {
|
|
51
|
+
return this.apps.length === 0 && this.atan2Apps.length === 0;
|
|
52
|
+
}
|
|
53
|
+
|
|
54
|
+
private addVarBound(column: number, kind: ConstraintKind, bound: Rational) {
|
|
55
|
+
const lra = this.core.lra;
|
|
56
|
+
lra.activate(lra.mkVarBound(column, kind, bound));
|
|
57
|
+
}
|
|
58
|
+
|
|
59
|
+
add(op: TranscendentalOp, arg: number, val: number) {
|
|
60
|
+
if (arg === NULL_LPVAR || val === NULL_LPVAR) return;
|
|
61
|
+
this.apps.push({ op, arg, val });
|
|
62
|
+
this.core.emons.trail.push(() => this.apps.pop());
|
|
63
|
+
this.addRangeAxioms(op, val);
|
|
64
|
+
}
|
|
65
|
+
|
|
66
|
+
addPi(val: number) {
|
|
67
|
+
if (val === NULL_LPVAR || this.piVar !== NULL_LPVAR) return;
|
|
68
|
+
this.core.emons.trail.push(() => {
|
|
69
|
+
this.piVar = NULL_LPVAR;
|
|
70
|
+
});
|
|
71
|
+
this.piVar = val;
|
|
72
|
+
this.addVarBound(val, KIND_GE, Rational.of(31415n, 10000n));
|
|
73
|
+
this.addVarBound(val, KIND_LE, Rational.of(31416n, 10000n));
|
|
74
|
+
}
|
|
75
|
+
|
|
76
|
+
addAtan2(y: number, x: number, val: number) {
|
|
77
|
+
if (y === NULL_LPVAR || x === NULL_LPVAR || val === NULL_LPVAR) return;
|
|
78
|
+
this.atan2Apps.push({ y, x, val });
|
|
79
|
+
this.core.emons.trail.push(() => this.atan2Apps.pop());
|
|
80
|
+
this.addVarBound(val, KIND_LE, PI_UPPER);
|
|
81
|
+
this.addVarBound(val, KIND_GE, PI_UPPER.neg());
|
|
82
|
+
}
|
|
83
|
+
|
|
84
|
+
private addRangeAxioms(op: TranscendentalOp, val: number) {
|
|
85
|
+
const addBounds = (
|
|
86
|
+
lowerKind: ConstraintKind,
|
|
87
|
+
lower: Rational,
|
|
88
|
+
upperKind: ConstraintKind,
|
|
89
|
+
upper: Rational,
|
|
90
|
+
) => {
|
|
91
|
+
this.addVarBound(val, upperKind, upper);
|
|
92
|
+
this.addVarBound(val, lowerKind, lower);
|
|
93
|
+
};
|
|
94
|
+
if (op === "sin" || op === "cos") addBounds(KIND_GE, Rational.minusOne, KIND_LE, Rational.one);
|
|
95
|
+
else if (op === "tanh") addBounds(KIND_GT, Rational.minusOne, KIND_LT, Rational.one);
|
|
96
|
+
else if (op === "cosh") this.addVarBound(val, KIND_GE, Rational.one);
|
|
97
|
+
else if (op === "acosh") this.addVarBound(val, KIND_GE, Rational.zero);
|
|
98
|
+
else if (op === "asin") addBounds(KIND_GE, PI_2_UPPER.neg(), KIND_LE, PI_2_UPPER);
|
|
99
|
+
else if (op === "atan") addBounds(KIND_GT, PI_2_UPPER.neg(), KIND_LT, PI_2_UPPER);
|
|
100
|
+
else if (op === "acos") addBounds(KIND_GE, Rational.zero, KIND_LE, PI_UPPER);
|
|
101
|
+
else if (op === "exp") this.addVarBound(val, KIND_GT, Rational.zero);
|
|
102
|
+
}
|
|
103
|
+
|
|
104
|
+
// sin, tanh and atan vanish at 0 and are 1-Lipschitz, so they stay below x for x >= 0 and above
|
|
105
|
+
// it for x <= 0.
|
|
106
|
+
private checkLinearMajorant(app: TranscendentalApp) {
|
|
107
|
+
if (app.op !== "sin" && app.op !== "tanh" && app.op !== "atan") return false;
|
|
108
|
+
const arg = this.core.val(app.arg);
|
|
109
|
+
const val = this.core.val(app.val);
|
|
110
|
+
const difference = mkTerm(app.val, 1, app.arg, -1);
|
|
111
|
+
if (!arg.isNegative() && val.compare(arg) > 0) {
|
|
112
|
+
new LemmaBuilder(this.core)
|
|
113
|
+
.addIneq(mkIneq(app.arg, KIND_LT, 0))
|
|
114
|
+
.addIneq(mkIneq(difference, KIND_LE, 0));
|
|
115
|
+
return true;
|
|
116
|
+
}
|
|
117
|
+
if (!arg.isPositive() && val.compare(arg) < 0) {
|
|
118
|
+
new LemmaBuilder(this.core)
|
|
119
|
+
.addIneq(mkIneq(app.arg, KIND_GT, 0))
|
|
120
|
+
.addIneq(mkIneq(difference, KIND_GE, 0));
|
|
121
|
+
return true;
|
|
122
|
+
}
|
|
123
|
+
return false;
|
|
124
|
+
}
|
|
125
|
+
|
|
126
|
+
// sin is positive on (0, pi) and negative on (-pi, 0), and cos is positive on (-pi/2, pi/2) and
|
|
127
|
+
// negative on (pi/2, 3pi/2), stated in terms of the pi column rather than its bounds.
|
|
128
|
+
private checkSignOnPiRange(app: TranscendentalApp) {
|
|
129
|
+
if (this.piVar === NULL_LPVAR || (app.op !== "sin" && app.op !== "cos")) return false;
|
|
130
|
+
const core = this.core;
|
|
131
|
+
const arg = core.val(app.arg);
|
|
132
|
+
const val = core.val(app.val);
|
|
133
|
+
const pi = core.val(this.piVar);
|
|
134
|
+
if (app.op === "sin") {
|
|
135
|
+
if (arg.isPositive() && arg.compare(pi) < 0 && !val.isPositive()) {
|
|
136
|
+
new LemmaBuilder(this.core)
|
|
137
|
+
.addIneq(mkIneq(app.arg, KIND_LE, 0))
|
|
138
|
+
.addIneq(mkIneq(mkTerm(app.arg, 1, this.piVar, -1), KIND_GE, 0))
|
|
139
|
+
.addIneq(mkIneq(app.val, KIND_GT, 0));
|
|
140
|
+
return true;
|
|
141
|
+
}
|
|
142
|
+
if (arg.isNegative() && arg.compare(pi.neg()) > 0 && !val.isNegative()) {
|
|
143
|
+
new LemmaBuilder(this.core)
|
|
144
|
+
.addIneq(mkIneq(app.arg, KIND_GE, 0))
|
|
145
|
+
.addIneq(mkIneq(mkTerm(app.arg, 1, this.piVar, 1), KIND_LE, 0))
|
|
146
|
+
.addIneq(mkIneq(app.val, KIND_LT, 0));
|
|
147
|
+
return true;
|
|
148
|
+
}
|
|
149
|
+
return false;
|
|
150
|
+
}
|
|
151
|
+
const twice = arg.mul(Rational.of(2n));
|
|
152
|
+
if (twice.compare(pi.neg()) > 0 && twice.compare(pi) < 0 && !val.isPositive()) {
|
|
153
|
+
new LemmaBuilder(this.core)
|
|
154
|
+
.addIneq(mkIneq(mkTerm(app.arg, 2, this.piVar, 1), KIND_LE, 0))
|
|
155
|
+
.addIneq(mkIneq(mkTerm(app.arg, 2, this.piVar, -1), KIND_GE, 0))
|
|
156
|
+
.addIneq(mkIneq(app.val, KIND_GT, 0));
|
|
157
|
+
return true;
|
|
158
|
+
}
|
|
159
|
+
if (twice.compare(pi) > 0 && twice.compare(pi.mul(Rational.of(3n))) < 0 && !val.isNegative()) {
|
|
160
|
+
new LemmaBuilder(this.core)
|
|
161
|
+
.addIneq(mkIneq(mkTerm(app.arg, 2, this.piVar, -1), KIND_LE, 0))
|
|
162
|
+
.addIneq(mkIneq(mkTerm(app.arg, 2, this.piVar, -3), KIND_GE, 0))
|
|
163
|
+
.addIneq(mkIneq(app.val, KIND_LT, 0));
|
|
164
|
+
return true;
|
|
165
|
+
}
|
|
166
|
+
return false;
|
|
167
|
+
}
|
|
168
|
+
|
|
169
|
+
// exp(x) >= 1 + x everywhere.
|
|
170
|
+
private checkExpLowerBound(app: TranscendentalApp) {
|
|
171
|
+
if (app.op !== "exp") return false;
|
|
172
|
+
const arg = this.core.val(app.arg);
|
|
173
|
+
if (this.core.val(app.val).compare(arg.add(Rational.one)) >= 0) return false;
|
|
174
|
+
new LemmaBuilder(this.core).addIneq(mkIneq(mkTerm(app.val, 1, app.arg, -1), KIND_GE, 1));
|
|
175
|
+
return true;
|
|
176
|
+
}
|
|
177
|
+
|
|
178
|
+
// log(x) <= x - 1 for x > 0.
|
|
179
|
+
private checkLogUpperBound(app: TranscendentalApp) {
|
|
180
|
+
if (app.op !== "log") return false;
|
|
181
|
+
const arg = this.core.val(app.arg);
|
|
182
|
+
if (!arg.isPositive() || this.core.val(app.val).compare(arg.sub(Rational.one)) <= 0)
|
|
183
|
+
return false;
|
|
184
|
+
new LemmaBuilder(this.core)
|
|
185
|
+
.addIneq(mkIneq(app.arg, KIND_LE, 0))
|
|
186
|
+
.addIneq(mkIneq(mkTerm(app.val, 1, app.arg, -1), KIND_LE, -1));
|
|
187
|
+
return true;
|
|
188
|
+
}
|
|
189
|
+
|
|
190
|
+
// x1 < x2 implies exp(x1) < exp(x2).
|
|
191
|
+
private checkExpMonotonicity(app: TranscendentalApp) {
|
|
192
|
+
if (app.op !== "exp") return false;
|
|
193
|
+
const core = this.core;
|
|
194
|
+
const arg = core.val(app.arg);
|
|
195
|
+
const val = core.val(app.val);
|
|
196
|
+
for (const other of this.apps) {
|
|
197
|
+
if (other.op !== "exp" || other.arg === app.arg) continue;
|
|
198
|
+
const otherArg = core.val(other.arg);
|
|
199
|
+
const otherVal = core.val(other.val);
|
|
200
|
+
if (arg.compare(otherArg) < 0 && val.compare(otherVal) >= 0) {
|
|
201
|
+
new LemmaBuilder(core)
|
|
202
|
+
.addIneq(mkIneq(mkTerm(app.arg, 1, other.arg, -1), KIND_GE, 0))
|
|
203
|
+
.addIneq(mkIneq(mkTerm(app.val, 1, other.val, -1), KIND_LT, 0));
|
|
204
|
+
return true;
|
|
205
|
+
}
|
|
206
|
+
if (arg.compare(otherArg) > 0 && val.compare(otherVal) <= 0) {
|
|
207
|
+
new LemmaBuilder(core)
|
|
208
|
+
.addIneq(mkIneq(mkTerm(app.arg, 1, other.arg, -1), KIND_LE, 0))
|
|
209
|
+
.addIneq(mkIneq(mkTerm(app.val, 1, other.val, -1), KIND_GT, 0));
|
|
210
|
+
return true;
|
|
211
|
+
}
|
|
212
|
+
}
|
|
213
|
+
return false;
|
|
214
|
+
}
|
|
215
|
+
|
|
216
|
+
// 0 < x1 < x2 implies log(x1) < log(x2).
|
|
217
|
+
private checkLogMonotonicity(app: TranscendentalApp) {
|
|
218
|
+
if (app.op !== "log") return false;
|
|
219
|
+
const core = this.core;
|
|
220
|
+
const arg = core.val(app.arg);
|
|
221
|
+
if (!arg.isPositive()) return false;
|
|
222
|
+
const val = core.val(app.val);
|
|
223
|
+
for (const other of this.apps) {
|
|
224
|
+
if (other.op !== "log" || other.arg === app.arg) continue;
|
|
225
|
+
const otherArg = core.val(other.arg);
|
|
226
|
+
if (!otherArg.isPositive()) continue;
|
|
227
|
+
const otherVal = core.val(other.val);
|
|
228
|
+
if (arg.compare(otherArg) < 0 && val.compare(otherVal) >= 0) {
|
|
229
|
+
new LemmaBuilder(core)
|
|
230
|
+
.addIneq(mkIneq(app.arg, KIND_LE, 0))
|
|
231
|
+
.addIneq(mkIneq(other.arg, KIND_LE, 0))
|
|
232
|
+
.addIneq(mkIneq(mkTerm(app.arg, 1, other.arg, -1), KIND_GE, 0))
|
|
233
|
+
.addIneq(mkIneq(mkTerm(app.val, 1, other.val, -1), KIND_LT, 0));
|
|
234
|
+
return true;
|
|
235
|
+
}
|
|
236
|
+
if (arg.compare(otherArg) > 0 && val.compare(otherVal) <= 0) {
|
|
237
|
+
new LemmaBuilder(core)
|
|
238
|
+
.addIneq(mkIneq(app.arg, KIND_LE, 0))
|
|
239
|
+
.addIneq(mkIneq(other.arg, KIND_LE, 0))
|
|
240
|
+
.addIneq(mkIneq(mkTerm(app.arg, 1, other.arg, -1), KIND_LE, 0))
|
|
241
|
+
.addIneq(mkIneq(mkTerm(app.val, 1, other.val, -1), KIND_GT, 0));
|
|
242
|
+
return true;
|
|
243
|
+
}
|
|
244
|
+
}
|
|
245
|
+
return false;
|
|
246
|
+
}
|
|
247
|
+
|
|
248
|
+
// A value away from the function by more than round-off is a failure, which only nlsat can
|
|
249
|
+
// settle. A value outside the domain is left to the rest of the solver.
|
|
250
|
+
private checkApp(app: TranscendentalApp) {
|
|
251
|
+
if (
|
|
252
|
+
this.checkLinearMajorant(app) ||
|
|
253
|
+
this.checkSignOnPiRange(app) ||
|
|
254
|
+
this.checkExpLowerBound(app) ||
|
|
255
|
+
this.checkExpMonotonicity(app) ||
|
|
256
|
+
this.checkLogUpperBound(app) ||
|
|
257
|
+
this.checkLogMonotonicity(app)
|
|
258
|
+
)
|
|
259
|
+
return true;
|
|
260
|
+
const arg = this.core.val(app.arg).toDouble();
|
|
261
|
+
const result = evalTranscendental(app.op, arg);
|
|
262
|
+
if (!Number.isFinite(result)) return false;
|
|
263
|
+
const distance = Math.abs(this.core.val(app.val).toDouble() - result);
|
|
264
|
+
if (distance > getErrorBound(app.op, arg, result)) this.numFailures++;
|
|
265
|
+
return false;
|
|
266
|
+
}
|
|
267
|
+
|
|
268
|
+
// sign(atan2(y, x)) = sign(y) for y != 0. Past that, a value away from atan2 by more than the
|
|
269
|
+
// tolerance splits on x.
|
|
270
|
+
private checkAtan2(app: Atan2App) {
|
|
271
|
+
const core = this.core;
|
|
272
|
+
const y = core.val(app.y);
|
|
273
|
+
const x = core.val(app.x);
|
|
274
|
+
const val = core.val(app.val);
|
|
275
|
+
if (y.isPositive() && !val.isPositive()) {
|
|
276
|
+
new LemmaBuilder(this.core)
|
|
277
|
+
.addIneq(mkIneq(app.y, KIND_LE, 0))
|
|
278
|
+
.addIneq(mkIneq(app.val, KIND_GT, 0));
|
|
279
|
+
return true;
|
|
280
|
+
}
|
|
281
|
+
if (y.isNegative() && !val.isNegative()) {
|
|
282
|
+
new LemmaBuilder(this.core)
|
|
283
|
+
.addIneq(mkIneq(app.y, KIND_GE, 0))
|
|
284
|
+
.addIneq(mkIneq(app.val, KIND_LT, 0));
|
|
285
|
+
return true;
|
|
286
|
+
}
|
|
287
|
+
const result = Math.atan2(y.toDouble(), x.toDouble());
|
|
288
|
+
if (!Number.isFinite(result)) return false;
|
|
289
|
+
const distance = Math.abs(val.toDouble() - result);
|
|
290
|
+
const error = getAtan2ErrorBound(result);
|
|
291
|
+
if (distance <= error) return false;
|
|
292
|
+
this.numFailures++;
|
|
293
|
+
if (distance <= error + TOLERANCE) return false;
|
|
294
|
+
core.literals.push(mkIneq(app.x, KIND_LE, x));
|
|
295
|
+
return true;
|
|
296
|
+
}
|
|
297
|
+
|
|
298
|
+
check() {
|
|
299
|
+
if (this.isEmpty || this.core.isUsingNraModel) return;
|
|
300
|
+
for (const app of this.apps) if (this.checkApp(app)) return;
|
|
301
|
+
for (const app of this.atan2Apps) if (this.checkAtan2(app)) return;
|
|
302
|
+
}
|
|
303
|
+
|
|
304
|
+
isNraModelValid() {
|
|
305
|
+
const core = this.core;
|
|
306
|
+
if (!core.isUsingNraModel) return false;
|
|
307
|
+
const getMiddle = (lpVar: number) => {
|
|
308
|
+
const [low, high] = core.nra.am.getInterval(core.nra.value(lpVar), 64);
|
|
309
|
+
return low.add(high).div(Rational.of(2n)).toDouble();
|
|
310
|
+
};
|
|
311
|
+
for (const app of this.apps) {
|
|
312
|
+
const arg = getMiddle(app.arg);
|
|
313
|
+
const result = evalTranscendental(app.op, arg);
|
|
314
|
+
if (!Number.isFinite(result)) continue;
|
|
315
|
+
if (Math.abs(getMiddle(app.val) - result) > getErrorBound(app.op, arg, result)) return false;
|
|
316
|
+
}
|
|
317
|
+
for (const app of this.atan2Apps) {
|
|
318
|
+
const result = Math.atan2(getMiddle(app.y), getMiddle(app.x));
|
|
319
|
+
if (!Number.isFinite(result)) continue;
|
|
320
|
+
if (Math.abs(getMiddle(app.val) - result) > getAtan2ErrorBound(result)) return false;
|
|
321
|
+
}
|
|
322
|
+
return true;
|
|
323
|
+
}
|
|
324
|
+
}
|
|
@@ -1,6 +1,3 @@
|
|
|
1
|
-
// Ported from Z3 (src/math/lp/nla_types.h, src/math/lp/nla_defs.h, src/math/lp/nla_common.h, and
|
|
2
|
-
// lemma_builder of src/math/lp/nla_core.cpp), MIT license, see z3-license.txt. The inequalities and
|
|
3
|
-
// lemmas that the nla passes make, and the builder that adds a lemma to the core.
|
|
4
1
|
import { Rational } from "../rational";
|
|
5
2
|
import { KIND_EQ, KIND_GE, KIND_GT, KIND_LE, KIND_LT, KIND_NE } from "./constraints";
|
|
6
3
|
import { Explanation } from "./explanation";
|
|
@@ -31,7 +28,6 @@ export const getRatSign = (value: Rational) =>
|
|
|
31
28
|
|
|
32
29
|
export const signToRat = (isNegated: boolean) => (isNegated ? Rational.minusOne : Rational.one);
|
|
33
30
|
|
|
34
|
-
// An ineq: term cmp rs.
|
|
35
31
|
export interface Ineq {
|
|
36
32
|
readonly cmp: number;
|
|
37
33
|
readonly term: LarTerm;
|
|
@@ -44,7 +40,6 @@ export const mkIneq = (term: LarTerm | number, cmp: number, rs: Rational | numbe
|
|
|
44
40
|
rs: typeof rs === "number" ? Rational.fromNumber(rs) : rs,
|
|
45
41
|
});
|
|
46
42
|
|
|
47
|
-
// A lemma: its explanation implies one of its inequalities, or false when it has none.
|
|
48
43
|
export interface Lemma {
|
|
49
44
|
readonly ineqs: Ineq[];
|
|
50
45
|
readonly expl: Explanation;
|
|
@@ -52,7 +47,6 @@ export interface Lemma {
|
|
|
52
47
|
|
|
53
48
|
export const isConflictLemma = (lemma: Lemma) => lemma.ineqs.length === 0 && !lemma.expl.isEmpty;
|
|
54
49
|
|
|
55
|
-
// lemma_builder: adds a lemma to the core and builds it in place.
|
|
56
50
|
export class LemmaBuilder {
|
|
57
51
|
private readonly lemma: Lemma = { ineqs: [], expl: new Explanation() };
|
|
58
52
|
|
|
@@ -60,11 +54,6 @@ export class LemmaBuilder {
|
|
|
60
54
|
core.lemmas.push(this.lemma);
|
|
61
55
|
}
|
|
62
56
|
|
|
63
|
-
get expl() {
|
|
64
|
-
return this.lemma.expl;
|
|
65
|
-
}
|
|
66
|
-
|
|
67
|
-
// |=: an inequality, unless the bounds already explain its negation away.
|
|
68
57
|
addIneq(ineq: Ineq) {
|
|
69
58
|
if (!this.core.explainIneq(this, ineq.term, ineq.cmp, ineq.rs)) this.lemma.ineqs.push(ineq);
|
|
70
59
|
return this;
|
|
@@ -75,7 +64,6 @@ export class LemmaBuilder {
|
|
|
75
64
|
return this;
|
|
76
65
|
}
|
|
77
66
|
|
|
78
|
-
// &= on a monic: the equivalences of its variables.
|
|
79
67
|
explainMonic(monic: Monic) {
|
|
80
68
|
for (const lpVar of monic.vars) this.explainVar(lpVar);
|
|
81
69
|
return this;
|
|
@@ -1,9 +1,6 @@
|
|
|
1
|
-
|
|
2
|
-
// Equivalences between signed lp variables, x = y or x = -y, with the bounds that justify them. A
|
|
3
|
-
// signed variable is the index 2 * var + sign.
|
|
4
|
-
import { Dependency } from "./dependency";
|
|
1
|
+
import type { Dependency } from "./dependency";
|
|
5
2
|
import type { Explanation } from "./explanation";
|
|
6
|
-
import { TrailStack, UnionFind, UnionFindHandler } from "./union-find";
|
|
3
|
+
import { TrailStack, UnionFind, type UnionFindHandler } from "./union-find";
|
|
7
4
|
import { shrink } from "../array";
|
|
8
5
|
|
|
9
6
|
export const mkSignedVar = (lpVar: number, isNegated: boolean) => lpVar * 2 + (isNegated ? 1 : 0);
|
|
@@ -11,7 +8,6 @@ export const getSignedVarVar = (signedVar: number) => signedVar >> 1;
|
|
|
11
8
|
export const isSignedVarNegated = (signedVar: number) => (signedVar & 1) === 1;
|
|
12
9
|
export const negateSignedVar = (signedVar: number) => signedVar ^ 1;
|
|
13
10
|
|
|
14
|
-
// An eq_justification: its dependencies up to the first null.
|
|
15
11
|
type EqJustification = Dependency[];
|
|
16
12
|
|
|
17
13
|
interface EqEdge {
|
|
@@ -25,7 +21,7 @@ interface VarFrame {
|
|
|
25
21
|
}
|
|
26
22
|
|
|
27
23
|
export class VarEqs {
|
|
28
|
-
readonly trail = new TrailStack();
|
|
24
|
+
private readonly trail = new TrailStack();
|
|
29
25
|
private eqTrail: [number, number][] = [];
|
|
30
26
|
private eqTrailScopes: number[] = [];
|
|
31
27
|
private eqs: EqEdge[][] = [];
|
|
@@ -56,7 +52,7 @@ export class VarEqs {
|
|
|
56
52
|
this.trail.popScope(count);
|
|
57
53
|
}
|
|
58
54
|
|
|
59
|
-
merge(v1: number, v2: number, justification: EqJustification) {
|
|
55
|
+
private merge(v1: number, v2: number, justification: EqJustification) {
|
|
60
56
|
if (v1 === v2 || getSignedVarVar(this.find(v1)) === getSignedVarVar(this.find(v2))) return;
|
|
61
57
|
const maxIndex = Math.max(v1, v2) + 2;
|
|
62
58
|
while (this.eqs.length < maxIndex) this.eqs.push([]);
|
|
@@ -86,11 +82,6 @@ export class VarEqs {
|
|
|
86
82
|
return this.find(mkSignedVar(lpVar, false));
|
|
87
83
|
}
|
|
88
84
|
|
|
89
|
-
isRoot(lpVar: number) {
|
|
90
|
-
return getSignedVarVar(this.findVar(lpVar)) === lpVar;
|
|
91
|
-
}
|
|
92
|
-
|
|
93
|
-
// explain_bfs: the justifications along a shortest path from v1 to v2.
|
|
94
85
|
explain(v1: number, v2: number, explanation: Explanation) {
|
|
95
86
|
if (v1 === v2) return;
|
|
96
87
|
const todo: VarFrame[] = [{ signedVar: v1, index: 0 }];
|
|
@@ -125,17 +116,4 @@ export class VarEqs {
|
|
|
125
116
|
const signedVar = mkSignedVar(lpVar, false);
|
|
126
117
|
this.explain(this.find(signedVar), signedVar, explanation);
|
|
127
118
|
}
|
|
128
|
-
|
|
129
|
-
// The members of the class of a signed variable, from the variable around the union-find cycle.
|
|
130
|
-
*getClass(signedVar: number) {
|
|
131
|
-
if (signedVar >= this.unionFind.numVars) {
|
|
132
|
-
yield signedVar;
|
|
133
|
-
return;
|
|
134
|
-
}
|
|
135
|
-
let current = signedVar;
|
|
136
|
-
do {
|
|
137
|
-
yield current;
|
|
138
|
-
current = this.unionFind.next(current);
|
|
139
|
-
} while (current !== signedVar);
|
|
140
|
-
}
|
|
141
119
|
}
|