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
|
@@ -0,0 +1,310 @@
|
|
|
1
|
+
// Z3 evaluates with the platform's libm, and V8's Math functions can differ from it in the last
|
|
2
|
+
// bit.
|
|
3
|
+
import {
|
|
4
|
+
OP_ACOS,
|
|
5
|
+
OP_ACOSH,
|
|
6
|
+
OP_ASIN,
|
|
7
|
+
OP_ASINH,
|
|
8
|
+
OP_ATAN,
|
|
9
|
+
OP_ATANH,
|
|
10
|
+
OP_COS,
|
|
11
|
+
OP_COSH,
|
|
12
|
+
OP_EXP,
|
|
13
|
+
OP_LOG,
|
|
14
|
+
OP_SIN,
|
|
15
|
+
OP_SINH,
|
|
16
|
+
OP_TAN,
|
|
17
|
+
OP_TANH,
|
|
18
|
+
} from "../ast";
|
|
19
|
+
import { Rational } from "../rational";
|
|
20
|
+
|
|
21
|
+
export type TranscendentalOp =
|
|
22
|
+
| "sin"
|
|
23
|
+
| "cos"
|
|
24
|
+
| "tan"
|
|
25
|
+
| "asin"
|
|
26
|
+
| "acos"
|
|
27
|
+
| "atan"
|
|
28
|
+
| "sinh"
|
|
29
|
+
| "cosh"
|
|
30
|
+
| "tanh"
|
|
31
|
+
| "asinh"
|
|
32
|
+
| "acosh"
|
|
33
|
+
| "atanh"
|
|
34
|
+
| "exp"
|
|
35
|
+
| "log";
|
|
36
|
+
|
|
37
|
+
export const TRANSCENDENTAL_OPS = new Map<number, TranscendentalOp>([
|
|
38
|
+
[OP_SIN, "sin"],
|
|
39
|
+
[OP_COS, "cos"],
|
|
40
|
+
[OP_TAN, "tan"],
|
|
41
|
+
[OP_SINH, "sinh"],
|
|
42
|
+
[OP_COSH, "cosh"],
|
|
43
|
+
[OP_TANH, "tanh"],
|
|
44
|
+
[OP_ASIN, "asin"],
|
|
45
|
+
[OP_ACOS, "acos"],
|
|
46
|
+
[OP_ATAN, "atan"],
|
|
47
|
+
[OP_ASINH, "asinh"],
|
|
48
|
+
[OP_ACOSH, "acosh"],
|
|
49
|
+
[OP_ATANH, "atanh"],
|
|
50
|
+
[OP_EXP, "exp"],
|
|
51
|
+
[OP_LOG, "log"],
|
|
52
|
+
]);
|
|
53
|
+
|
|
54
|
+
const EVALUATORS: Record<TranscendentalOp, (value: number) => number> = {
|
|
55
|
+
sin: Math.sin,
|
|
56
|
+
cos: Math.cos,
|
|
57
|
+
tan: Math.tan,
|
|
58
|
+
asin: Math.asin,
|
|
59
|
+
acos: Math.acos,
|
|
60
|
+
atan: Math.atan,
|
|
61
|
+
sinh: Math.sinh,
|
|
62
|
+
cosh: Math.cosh,
|
|
63
|
+
tanh: Math.tanh,
|
|
64
|
+
asinh: Math.asinh,
|
|
65
|
+
acosh: Math.acosh,
|
|
66
|
+
atanh: Math.atanh,
|
|
67
|
+
exp: Math.exp,
|
|
68
|
+
log: Math.log,
|
|
69
|
+
};
|
|
70
|
+
|
|
71
|
+
// pi/2 and pi rounded outward by more than a double's rounding error.
|
|
72
|
+
export const PI_2_UPPER = Rational.fromDouble(1.5707963267948968);
|
|
73
|
+
export const PI_UPPER = Rational.fromDouble(3.1415926535897936);
|
|
74
|
+
|
|
75
|
+
// A rational bracket of pi, tight to about 1e-14.
|
|
76
|
+
export const PI_LOWER_BRACKET = Rational.of(314159265358979n, 10n ** 14n);
|
|
77
|
+
export const PI_UPPER_BRACKET = Rational.of(314159265358980n, 10n ** 14n);
|
|
78
|
+
|
|
79
|
+
const SAFETY = 64 * Number.EPSILON;
|
|
80
|
+
// Near a pole or the boundary of the domain, where the derivative blows up.
|
|
81
|
+
const BOUNDARY_SAFETY = 4096 * Number.EPSILON;
|
|
82
|
+
|
|
83
|
+
export const evalTranscendental = (op: TranscendentalOp, value: number) => EVALUATORS[op](value);
|
|
84
|
+
|
|
85
|
+
// A conservative bound on the round-off of evaluating op at value in double precision.
|
|
86
|
+
export const getErrorBound = (op: TranscendentalOp, value: number, result: number) => {
|
|
87
|
+
switch (op) {
|
|
88
|
+
case "sin":
|
|
89
|
+
case "cos":
|
|
90
|
+
case "atan":
|
|
91
|
+
case "tanh":
|
|
92
|
+
case "asinh":
|
|
93
|
+
return SAFETY * Math.max(1, Math.abs(value));
|
|
94
|
+
case "sinh":
|
|
95
|
+
case "cosh":
|
|
96
|
+
case "exp":
|
|
97
|
+
return SAFETY * Math.max(1, Math.abs(result));
|
|
98
|
+
default:
|
|
99
|
+
return BOUNDARY_SAFETY * Math.max(1, Math.abs(value), Math.abs(result));
|
|
100
|
+
}
|
|
101
|
+
};
|
|
102
|
+
|
|
103
|
+
const getNextAfter = (from: number, to: number) => {
|
|
104
|
+
if (from === to) return to;
|
|
105
|
+
if (from === 0) return to > 0 ? Number.MIN_VALUE : -Number.MIN_VALUE;
|
|
106
|
+
const view = new DataView(new ArrayBuffer(8));
|
|
107
|
+
view.setFloat64(0, from);
|
|
108
|
+
const bits = view.getBigUint64(0);
|
|
109
|
+
// The bits of a double grow with its magnitude.
|
|
110
|
+
const isGrowing = from > 0 ? from < to : from > to;
|
|
111
|
+
view.setBigUint64(0, isGrowing ? bits + 1n : bits - 1n);
|
|
112
|
+
return view.getFloat64(0);
|
|
113
|
+
};
|
|
114
|
+
|
|
115
|
+
// Whether some integer k puts phase + k * period in [low, high]. It can only err toward true.
|
|
116
|
+
const containsMultipleOf = (low: number, high: number, phase: number, period: number) =>
|
|
117
|
+
low <= high && phase + Math.ceil((low - phase) / period) * period <= high;
|
|
118
|
+
|
|
119
|
+
// An enclosure of op over [low, high] that accounts for an extremum of sin, cos or cosh inside
|
|
120
|
+
// it. Undefined when an endpoint or its value is not finite, or a pole of tan is strictly inside.
|
|
121
|
+
// Z3 does not check the endpoints, and converts an infinite one to a rational with undefined
|
|
122
|
+
// behavior.
|
|
123
|
+
export const getWideIntervalEval = (op: TranscendentalOp, low: number, high: number) => {
|
|
124
|
+
if (!(low <= high) || !Number.isFinite(low) || !Number.isFinite(high)) return undefined;
|
|
125
|
+
const lowValue = evalTranscendental(op, low);
|
|
126
|
+
const highValue = evalTranscendental(op, high);
|
|
127
|
+
if (!Number.isFinite(lowValue) || !Number.isFinite(highValue)) return undefined;
|
|
128
|
+
let lowest = Math.min(lowValue, highValue);
|
|
129
|
+
let highest = Math.max(lowValue, highValue);
|
|
130
|
+
const pi = Math.PI;
|
|
131
|
+
const twoPi = 2 * pi;
|
|
132
|
+
if (op === "sin") {
|
|
133
|
+
if (containsMultipleOf(low, high, pi / 2, twoPi)) highest = 1;
|
|
134
|
+
if (containsMultipleOf(low, high, -pi / 2, twoPi)) lowest = -1;
|
|
135
|
+
} else if (op === "cos") {
|
|
136
|
+
if (containsMultipleOf(low, high, 0, twoPi)) highest = 1;
|
|
137
|
+
if (containsMultipleOf(low, high, pi, twoPi)) lowest = -1;
|
|
138
|
+
} else if (op === "tan") {
|
|
139
|
+
if (containsMultipleOf(getNextAfter(low, high), getNextAfter(high, low), pi / 2, pi))
|
|
140
|
+
return undefined;
|
|
141
|
+
} else if (op === "cosh" && low <= 0 && 0 <= high) lowest = 1;
|
|
142
|
+
const slack = Math.max(getErrorBound(op, low, lowValue), getErrorBound(op, high, highValue));
|
|
143
|
+
return { low: lowest - slack, high: highest + slack };
|
|
144
|
+
};
|
|
145
|
+
|
|
146
|
+
const min = (first: Rational, second: Rational) => (second.compare(first) < 0 ? second : first);
|
|
147
|
+
const max = (first: Rational, second: Rational) => (first.compare(second) < 0 ? second : first);
|
|
148
|
+
|
|
149
|
+
// The partial sums of a series over a common denominator, since reducing every partial sum of
|
|
150
|
+
// dozens of terms costs a gcd of numbers thousands of bits long.
|
|
151
|
+
class Series {
|
|
152
|
+
private den: bigint;
|
|
153
|
+
private sum = 0n;
|
|
154
|
+
private term: bigint;
|
|
155
|
+
|
|
156
|
+
constructor(term: Rational) {
|
|
157
|
+
this.term = term.num;
|
|
158
|
+
this.den = term.den;
|
|
159
|
+
}
|
|
160
|
+
|
|
161
|
+
get value() {
|
|
162
|
+
return Rational.of(this.sum, this.den);
|
|
163
|
+
}
|
|
164
|
+
|
|
165
|
+
get lastTerm() {
|
|
166
|
+
return Rational.of(this.term, this.den);
|
|
167
|
+
}
|
|
168
|
+
|
|
169
|
+
// Adds sign * term / divisor.
|
|
170
|
+
add(sign = 1n, divisor = 1n) {
|
|
171
|
+
this.sum = this.sum * divisor + sign * this.term;
|
|
172
|
+
this.term *= divisor;
|
|
173
|
+
this.den *= divisor;
|
|
174
|
+
}
|
|
175
|
+
|
|
176
|
+
// Multiplies the term by num / den, where den > 0.
|
|
177
|
+
scale(num: bigint, den: bigint) {
|
|
178
|
+
this.term *= num;
|
|
179
|
+
this.sum *= den;
|
|
180
|
+
this.den *= den;
|
|
181
|
+
}
|
|
182
|
+
}
|
|
183
|
+
|
|
184
|
+
// Of the partial sums after each of numTerms terms, the bracket is the last two.
|
|
185
|
+
const getLastTwoSums = (series: Series, numTerms: number, step: (index: number) => void) => {
|
|
186
|
+
for (let index = 0; index < numTerms - 1; index++) step(index);
|
|
187
|
+
const previous = series.value;
|
|
188
|
+
step(numTerms - 1);
|
|
189
|
+
const last = series.value;
|
|
190
|
+
return { low: min(previous, last), high: max(previous, last) };
|
|
191
|
+
};
|
|
192
|
+
|
|
193
|
+
// The Maclaurin series of exp is alternating for x <= 0 once n + 1 >= |x|, so consecutive partial
|
|
194
|
+
// sums from there bracket it. For x > 0 a geometric series bounds the omitted tail.
|
|
195
|
+
export const getExpTaylorBracket = (value: Rational) => {
|
|
196
|
+
const numTerms = 40;
|
|
197
|
+
const series = new Series(Rational.one);
|
|
198
|
+
const step = (index: number) => {
|
|
199
|
+
series.add();
|
|
200
|
+
series.scale(value.num, value.den * BigInt(index + 1));
|
|
201
|
+
};
|
|
202
|
+
if (!value.isPositive() && value.compare(Rational.of(BigInt(-numTerms))) > 0)
|
|
203
|
+
return getLastTwoSums(series, numTerms, step);
|
|
204
|
+
if (value.isPositive() && value.compare(Rational.of(BigInt(numTerms + 1))) < 0) {
|
|
205
|
+
for (let index = 0; index < numTerms; index++) step(index);
|
|
206
|
+
const ratio = value.div(Rational.of(BigInt(numTerms + 1)));
|
|
207
|
+
const sum = series.value;
|
|
208
|
+
return { low: sum, high: sum.add(series.lastTerm.div(Rational.one.sub(ratio))) };
|
|
209
|
+
}
|
|
210
|
+
return undefined;
|
|
211
|
+
};
|
|
212
|
+
|
|
213
|
+
// The Mercator series of log(1 + u) alternates for u in [0, 1].
|
|
214
|
+
export const getLogTaylorBracket = (value: Rational) => {
|
|
215
|
+
if (value.compare(Rational.one) < 0 || value.compare(Rational.of(2n)) > 0) return undefined;
|
|
216
|
+
const offset = value.sub(Rational.one);
|
|
217
|
+
const series = new Series(offset);
|
|
218
|
+
return getLastTwoSums(series, 60, (index) => {
|
|
219
|
+
series.add(index % 2 === 0 ? 1n : -1n);
|
|
220
|
+
series.scale(offset.num * BigInt(index + 1), offset.den * BigInt(index + 2));
|
|
221
|
+
});
|
|
222
|
+
};
|
|
223
|
+
|
|
224
|
+
// The Maclaurin series of atan alternates for |x| <= 1.
|
|
225
|
+
export const getAtanTaylorBracket = (value: Rational) => {
|
|
226
|
+
if (value.compare(Rational.minusOne) < 0 || value.compare(Rational.one) > 0) return undefined;
|
|
227
|
+
const series = new Series(value);
|
|
228
|
+
const square = value.mul(value);
|
|
229
|
+
return getLastTwoSums(series, 40, (index) => {
|
|
230
|
+
series.add(1n, BigInt(2 * index + 1));
|
|
231
|
+
series.scale(-square.num, square.den);
|
|
232
|
+
});
|
|
233
|
+
};
|
|
234
|
+
|
|
235
|
+
// The terms (-1)^k x^(2k+b) / (2k+b)! of sin (b = 1) and cos (b = 0) shrink once x^2 <= (2k+b+1) *
|
|
236
|
+
// (2k+b+2), and then keep shrinking, so consecutive partial sums from there bracket the value.
|
|
237
|
+
// Undefined when that takes more than the term budget.
|
|
238
|
+
const getSinCosTaylorBracketAt = (value: Rational, basePower: number) => {
|
|
239
|
+
const numTerms = 60;
|
|
240
|
+
const square = value.mul(value);
|
|
241
|
+
const getGrowth = (index: number) => {
|
|
242
|
+
const power = BigInt(2 * index + basePower);
|
|
243
|
+
return (power + 1n) * (power + 2n);
|
|
244
|
+
};
|
|
245
|
+
let start = 0;
|
|
246
|
+
while (start < numTerms && square.compare(Rational.of(getGrowth(start))) > 0) start++;
|
|
247
|
+
if (start >= numTerms) return undefined;
|
|
248
|
+
const series = new Series(basePower === 0 ? Rational.one : value);
|
|
249
|
+
return getLastTwoSums(series, numTerms, (index) => {
|
|
250
|
+
series.add();
|
|
251
|
+
series.scale(-square.num, square.den * getGrowth(index));
|
|
252
|
+
});
|
|
253
|
+
};
|
|
254
|
+
|
|
255
|
+
// Whether phase + k * period may fall in [low, high] for some integer k, where phase and period are
|
|
256
|
+
// only known up to brackets. A maybe counts as yes, and so does a range too wide to scan.
|
|
257
|
+
const containsPeriodicPoint = (
|
|
258
|
+
low: Rational,
|
|
259
|
+
high: Rational,
|
|
260
|
+
phaseLow: Rational,
|
|
261
|
+
phaseHigh: Rational,
|
|
262
|
+
periodLow: Rational,
|
|
263
|
+
periodHigh: Rational,
|
|
264
|
+
) => {
|
|
265
|
+
const first = low.sub(phaseHigh).div(periodLow).floor().sub(Rational.one);
|
|
266
|
+
const last = high.sub(phaseLow).div(periodLow).ceil().add(Rational.one);
|
|
267
|
+
if (last.sub(first).compare(Rational.of(1000n)) > 0) return true;
|
|
268
|
+
for (let index = first; index.compare(last) <= 0; index = index.add(Rational.one)) {
|
|
269
|
+
const candidates = [
|
|
270
|
+
phaseLow.add(index.mul(periodLow)),
|
|
271
|
+
phaseHigh.add(index.mul(periodHigh)),
|
|
272
|
+
phaseLow.add(index.mul(periodHigh)),
|
|
273
|
+
phaseHigh.add(index.mul(periodLow)),
|
|
274
|
+
];
|
|
275
|
+
const positionLow = candidates.reduce(min);
|
|
276
|
+
const positionHigh = candidates.reduce(max);
|
|
277
|
+
if (positionLow.compare(high) <= 0 && positionHigh.compare(low) >= 0) return true;
|
|
278
|
+
}
|
|
279
|
+
return false;
|
|
280
|
+
};
|
|
281
|
+
|
|
282
|
+
// An exact enclosure of sin or cos over [low, high], clamped to the extremal value when a
|
|
283
|
+
// multiple of pi / 2 or pi may fall inside it.
|
|
284
|
+
export const getSinCosTaylorBracket = (op: "sin" | "cos", low: Rational, high: Rational) => {
|
|
285
|
+
const basePower = op === "sin" ? 1 : 0;
|
|
286
|
+
const lowBracket = getSinCosTaylorBracketAt(low, basePower);
|
|
287
|
+
const highBracket = lowBracket && getSinCosTaylorBracketAt(high, basePower);
|
|
288
|
+
if (lowBracket === undefined || highBracket === undefined) return undefined;
|
|
289
|
+
let result = {
|
|
290
|
+
low: min(lowBracket.low, highBracket.low),
|
|
291
|
+
high: max(lowBracket.high, highBracket.high),
|
|
292
|
+
};
|
|
293
|
+
const two = Rational.of(2n);
|
|
294
|
+
const periodLow = two.mul(PI_LOWER_BRACKET);
|
|
295
|
+
const periodHigh = two.mul(PI_UPPER_BRACKET);
|
|
296
|
+
const [maxPhaseLow, maxPhaseHigh, minPhaseLow, minPhaseHigh] =
|
|
297
|
+
op === "sin"
|
|
298
|
+
? [
|
|
299
|
+
PI_LOWER_BRACKET.div(two),
|
|
300
|
+
PI_UPPER_BRACKET.div(two),
|
|
301
|
+
PI_UPPER_BRACKET.div(two).neg(),
|
|
302
|
+
PI_LOWER_BRACKET.div(two).neg(),
|
|
303
|
+
]
|
|
304
|
+
: [Rational.zero, Rational.zero, PI_LOWER_BRACKET, PI_UPPER_BRACKET];
|
|
305
|
+
if (containsPeriodicPoint(low, high, maxPhaseLow, maxPhaseHigh, periodLow, periodHigh))
|
|
306
|
+
result = { ...result, high: max(result.high, Rational.one) };
|
|
307
|
+
if (containsPeriodicPoint(low, high, minPhaseLow, minPhaseHigh, periodLow, periodHigh))
|
|
308
|
+
result = { ...result, low: min(result.low, Rational.minusOne) };
|
|
309
|
+
return result;
|
|
310
|
+
};
|
|
@@ -0,0 +1,367 @@
|
|
|
1
|
+
import { getLcm, Rational } from "../rational";
|
|
2
|
+
import { Anum } from "./algebraic";
|
|
3
|
+
import { NULL_VAR } from "./polynomial";
|
|
4
|
+
import type { NlsatSolver } from "./solver";
|
|
5
|
+
import {
|
|
6
|
+
getAtanTaylorBracket,
|
|
7
|
+
getExpTaylorBracket,
|
|
8
|
+
getLogTaylorBracket,
|
|
9
|
+
getSinCosTaylorBracket,
|
|
10
|
+
getWideIntervalEval,
|
|
11
|
+
PI_2_UPPER,
|
|
12
|
+
PI_LOWER_BRACKET,
|
|
13
|
+
PI_UPPER,
|
|
14
|
+
PI_UPPER_BRACKET,
|
|
15
|
+
type TranscendentalOp,
|
|
16
|
+
} from "./transcendental-eval";
|
|
17
|
+
|
|
18
|
+
interface App {
|
|
19
|
+
op: TranscendentalOp;
|
|
20
|
+
arg: number;
|
|
21
|
+
val: number;
|
|
22
|
+
// Refinements in a row, each of which widens the box the next one excludes.
|
|
23
|
+
retries: number;
|
|
24
|
+
}
|
|
25
|
+
|
|
26
|
+
interface Atan2App {
|
|
27
|
+
y: number;
|
|
28
|
+
x: number;
|
|
29
|
+
val: number;
|
|
30
|
+
retries: number;
|
|
31
|
+
}
|
|
32
|
+
|
|
33
|
+
const TWO = Rational.of(2n);
|
|
34
|
+
|
|
35
|
+
// A box around the witness rather than the point alone, so that converging toward a point where
|
|
36
|
+
// the function touches an axiom takes logarithmically many rounds.
|
|
37
|
+
const getExclusionDelta = (scale: Rational, retries: number) =>
|
|
38
|
+
Rational.of(1n << BigInt(Math.min(retries, 30)), 1000000n).mul(scale);
|
|
39
|
+
|
|
40
|
+
export class NlsatTranscendentals {
|
|
41
|
+
private apps: App[] = [];
|
|
42
|
+
private atan2Apps: Atan2App[] = [];
|
|
43
|
+
private hasPi = false;
|
|
44
|
+
|
|
45
|
+
constructor(private solver: NlsatSolver) {}
|
|
46
|
+
|
|
47
|
+
get isEmpty() {
|
|
48
|
+
return this.apps.length === 0 && this.atan2Apps.length === 0;
|
|
49
|
+
}
|
|
50
|
+
|
|
51
|
+
private mkBoundLiteral(variable: number, kind: "LT" | "GT", bound: Rational) {
|
|
52
|
+
const polynomial = this.solver.pm.mkLinear([bound.den], [variable], -bound.num);
|
|
53
|
+
return this.solver.mkIneqLiteral(kind, [polynomial], [false]);
|
|
54
|
+
}
|
|
55
|
+
|
|
56
|
+
// first * firstCoeff + second * secondCoeff kind bound.
|
|
57
|
+
private mkLinearLiteral(
|
|
58
|
+
first: number,
|
|
59
|
+
firstCoeff: Rational,
|
|
60
|
+
second: number,
|
|
61
|
+
secondCoeff: Rational,
|
|
62
|
+
kind: "LT" | "GT",
|
|
63
|
+
bound: Rational,
|
|
64
|
+
) {
|
|
65
|
+
const den = Rational.of(getLcm(firstCoeff.den, getLcm(secondCoeff.den, bound.den)));
|
|
66
|
+
const polynomial = this.solver.pm.mkLinear(
|
|
67
|
+
[firstCoeff.mul(den).num, secondCoeff.mul(den).num],
|
|
68
|
+
[first, second],
|
|
69
|
+
bound.mul(den).neg().num,
|
|
70
|
+
);
|
|
71
|
+
return this.solver.mkIneqLiteral(kind, [polynomial], [false]);
|
|
72
|
+
}
|
|
73
|
+
|
|
74
|
+
private mkClause(literals: readonly number[]) {
|
|
75
|
+
this.solver.mkExternalClause(literals, null);
|
|
76
|
+
}
|
|
77
|
+
|
|
78
|
+
private compare(anum: Anum, value: Rational) {
|
|
79
|
+
return this.solver.am.compare(anum, new Anum(value));
|
|
80
|
+
}
|
|
81
|
+
|
|
82
|
+
private isPos(anum: Anum) {
|
|
83
|
+
return !this.solver.am.isZero(anum) && !this.solver.am.isNeg(anum);
|
|
84
|
+
}
|
|
85
|
+
|
|
86
|
+
add(op: TranscendentalOp, arg: number, val: number) {
|
|
87
|
+
this.apps.push({ op, arg, val, retries: 0 });
|
|
88
|
+
this.addGlobalAxioms(op, arg, val);
|
|
89
|
+
this.addRangeAxioms(op, val);
|
|
90
|
+
this.addIdentityAxioms(op, arg, val);
|
|
91
|
+
}
|
|
92
|
+
|
|
93
|
+
addPi(val: number) {
|
|
94
|
+
if (val === NULL_VAR || this.hasPi) return;
|
|
95
|
+
this.hasPi = true;
|
|
96
|
+
const lower = this.mkBoundLiteral(val, "LT", PI_LOWER_BRACKET) ^ 1;
|
|
97
|
+
const upper = this.mkBoundLiteral(val, "GT", PI_UPPER_BRACKET) ^ 1;
|
|
98
|
+
this.mkClause([lower]);
|
|
99
|
+
this.mkClause([upper]);
|
|
100
|
+
}
|
|
101
|
+
|
|
102
|
+
addAtan2(y: number, x: number, val: number) {
|
|
103
|
+
if (y === NULL_VAR || x === NULL_VAR || val === NULL_VAR) return;
|
|
104
|
+
this.atan2Apps.push({ y, x, val, retries: 0 });
|
|
105
|
+
this.addBounds(val, PI_UPPER.neg(), PI_UPPER);
|
|
106
|
+
}
|
|
107
|
+
|
|
108
|
+
private addBounds(val: number, lower: Rational, upper: Rational) {
|
|
109
|
+
const belowUpper = this.mkBoundLiteral(val, "GT", upper) ^ 1;
|
|
110
|
+
const aboveLower = this.mkBoundLiteral(val, "LT", lower) ^ 1;
|
|
111
|
+
this.mkClause([belowUpper]);
|
|
112
|
+
this.mkClause([aboveLower]);
|
|
113
|
+
}
|
|
114
|
+
|
|
115
|
+
// The tangent lines exp(x) >= 1 + x and log(x) <= x - 1 hold on the whole domain.
|
|
116
|
+
private addGlobalAxioms(op: TranscendentalOp, arg: number, val: number) {
|
|
117
|
+
if (op === "exp") {
|
|
118
|
+
this.mkClause([
|
|
119
|
+
this.mkLinearLiteral(val, Rational.one, arg, Rational.minusOne, "LT", Rational.one) ^ 1,
|
|
120
|
+
]);
|
|
121
|
+
this.mkClause([
|
|
122
|
+
this.mkBoundLiteral(arg, "LT", Rational.zero) ^ 1,
|
|
123
|
+
this.mkBoundLiteral(val, "LT", Rational.one),
|
|
124
|
+
]);
|
|
125
|
+
} else if (op === "log")
|
|
126
|
+
this.mkClause([
|
|
127
|
+
this.mkBoundLiteral(arg, "GT", Rational.zero) ^ 1,
|
|
128
|
+
this.mkLinearLiteral(val, Rational.one, arg, Rational.minusOne, "GT", Rational.minusOne) ^
|
|
129
|
+
1,
|
|
130
|
+
]);
|
|
131
|
+
}
|
|
132
|
+
|
|
133
|
+
private addRangeAxioms(op: TranscendentalOp, val: number) {
|
|
134
|
+
if (op === "sin" || op === "cos") this.addBounds(val, Rational.minusOne, Rational.one);
|
|
135
|
+
else if (op === "tanh") {
|
|
136
|
+
const aboveLower = this.mkBoundLiteral(val, "GT", Rational.minusOne);
|
|
137
|
+
const belowUpper = this.mkBoundLiteral(val, "LT", Rational.one);
|
|
138
|
+
this.mkClause([aboveLower]);
|
|
139
|
+
this.mkClause([belowUpper]);
|
|
140
|
+
} else if (op === "cosh") this.mkClause([this.mkBoundLiteral(val, "LT", Rational.one) ^ 1]);
|
|
141
|
+
else if (op === "acosh") this.mkClause([this.mkBoundLiteral(val, "LT", Rational.zero) ^ 1]);
|
|
142
|
+
else if (op === "asin") this.addBounds(val, PI_2_UPPER.neg(), PI_2_UPPER);
|
|
143
|
+
else if (op === "acos") this.addBounds(val, Rational.zero, PI_UPPER);
|
|
144
|
+
}
|
|
145
|
+
|
|
146
|
+
// sin^2 + cos^2 = 1, cosh^2 - sinh^2 = 1 and cosh^2 (1 - tanh^2) = 1 for applications to the
|
|
147
|
+
// same argument.
|
|
148
|
+
private addIdentityAxioms(op: TranscendentalOp, arg: number, val: number) {
|
|
149
|
+
for (const other of this.apps.slice(0, -1)) {
|
|
150
|
+
if (other.arg !== arg) continue;
|
|
151
|
+
const pair = `${op} ${other.op}`;
|
|
152
|
+
if (pair === "sin cos") this.addIdentityAxiom("sin", val, other.val);
|
|
153
|
+
else if (pair === "cos sin") this.addIdentityAxiom("sin", other.val, val);
|
|
154
|
+
else if (pair === "sinh cosh") this.addIdentityAxiom("sinh", other.val, val);
|
|
155
|
+
else if (pair === "cosh sinh") this.addIdentityAxiom("sinh", val, other.val);
|
|
156
|
+
else if (pair === "tanh cosh") this.addIdentityAxiom("tanh", other.val, val);
|
|
157
|
+
else if (pair === "cosh tanh") this.addIdentityAxiom("tanh", val, other.val);
|
|
158
|
+
}
|
|
159
|
+
}
|
|
160
|
+
|
|
161
|
+
private addIdentityAxiom(kind: "sin" | "sinh" | "tanh", first: number, second: number) {
|
|
162
|
+
const pm = this.solver.pm;
|
|
163
|
+
const firstSquare = pm.mul(pm.mkVar(first), pm.mkVar(first));
|
|
164
|
+
const secondSquare = pm.mul(pm.mkVar(second), pm.mkVar(second));
|
|
165
|
+
const one = pm.mkConst(1n);
|
|
166
|
+
const equation =
|
|
167
|
+
kind === "sin"
|
|
168
|
+
? pm.sub(pm.add(firstSquare, secondSquare), one)
|
|
169
|
+
: kind === "sinh"
|
|
170
|
+
? pm.sub(pm.sub(firstSquare, secondSquare), one)
|
|
171
|
+
: pm.sub(pm.sub(firstSquare, pm.mul(firstSquare, secondSquare)), one);
|
|
172
|
+
this.mkClause([this.solver.mkIneqLiteral("EQ", [equation], [false])]);
|
|
173
|
+
}
|
|
174
|
+
|
|
175
|
+
// Exact Taylor brackets: exp, log and atan are increasing where their series apply, and the
|
|
176
|
+
// bracket of sin and cos accounts for an extremum inside the box.
|
|
177
|
+
private getExactBracket(op: TranscendentalOp, low: Rational, high: Rational) {
|
|
178
|
+
if (op === "sin" || op === "cos") return getSinCosTaylorBracket(op, low, high);
|
|
179
|
+
const getBracket =
|
|
180
|
+
op === "exp"
|
|
181
|
+
? getExpTaylorBracket
|
|
182
|
+
: op === "log"
|
|
183
|
+
? getLogTaylorBracket
|
|
184
|
+
: op === "atan"
|
|
185
|
+
? getAtanTaylorBracket
|
|
186
|
+
: undefined;
|
|
187
|
+
const lowBracket = getBracket?.(low);
|
|
188
|
+
const highBracket = lowBracket && getBracket?.(high);
|
|
189
|
+
if (lowBracket === undefined || highBracket === undefined) return undefined;
|
|
190
|
+
return { low: lowBracket.low, high: highBracket.high };
|
|
191
|
+
}
|
|
192
|
+
|
|
193
|
+
// Excludes the box [low, high] of arg unless val lies in [valLow, valHigh].
|
|
194
|
+
private excludeBox(app: App, low: Rational, high: Rational, valLow: Rational, valHigh: Rational) {
|
|
195
|
+
const value = this.solver.getValue(app.val);
|
|
196
|
+
if (this.compare(value, valLow) >= 0 && this.compare(value, valHigh) <= 0) {
|
|
197
|
+
app.retries = 0;
|
|
198
|
+
return false;
|
|
199
|
+
}
|
|
200
|
+
this.mkClause([
|
|
201
|
+
this.mkBoundLiteral(app.arg, "LT", low),
|
|
202
|
+
this.mkBoundLiteral(app.arg, "GT", high),
|
|
203
|
+
this.compare(value, valLow) < 0
|
|
204
|
+
? this.mkBoundLiteral(app.val, "LT", valLow) ^ 1
|
|
205
|
+
: this.mkBoundLiteral(app.val, "GT", valHigh) ^ 1,
|
|
206
|
+
]);
|
|
207
|
+
app.retries++;
|
|
208
|
+
return true;
|
|
209
|
+
}
|
|
210
|
+
|
|
211
|
+
private refineApp(app: App) {
|
|
212
|
+
const [low, high] = this.solver.am.getInterval(this.solver.getValue(app.arg), 64);
|
|
213
|
+
const middle = low.add(high).div(TWO).abs();
|
|
214
|
+
const delta = getExclusionDelta(
|
|
215
|
+
middle.compare(Rational.one) > 0 ? middle : Rational.one,
|
|
216
|
+
app.retries,
|
|
217
|
+
);
|
|
218
|
+
const wideLow = low.sub(delta);
|
|
219
|
+
const wideHigh = high.add(delta);
|
|
220
|
+
const exact = this.getExactBracket(app.op, wideLow, wideHigh);
|
|
221
|
+
if (exact !== undefined) return this.excludeBox(app, wideLow, wideHigh, exact.low, exact.high);
|
|
222
|
+
const wide = { low: wideLow.toDouble(), high: wideHigh.toDouble() };
|
|
223
|
+
const wideEnclosure = getWideIntervalEval(app.op, wide.low, wide.high);
|
|
224
|
+
const box = wideEnclosure === undefined ? { low: low.toDouble(), high: high.toDouble() } : wide;
|
|
225
|
+
const enclosure = wideEnclosure ?? getWideIntervalEval(app.op, box.low, box.high);
|
|
226
|
+
if (enclosure === undefined) return false;
|
|
227
|
+
return this.excludeBox(
|
|
228
|
+
app,
|
|
229
|
+
Rational.fromDouble(box.low),
|
|
230
|
+
Rational.fromDouble(box.high),
|
|
231
|
+
Rational.fromDouble(enclosure.low),
|
|
232
|
+
Rational.fromDouble(enclosure.high),
|
|
233
|
+
);
|
|
234
|
+
}
|
|
235
|
+
|
|
236
|
+
// atan2(y, x) has the sign of y, and lies in the range of the open quadrant of a box around (y,
|
|
237
|
+
// x). A box that crosses an axis may span the branch cut, so it is left alone.
|
|
238
|
+
private refineAtan2(app: Atan2App) {
|
|
239
|
+
const solver = this.solver;
|
|
240
|
+
const am = solver.am;
|
|
241
|
+
const yValue = solver.getValue(app.y);
|
|
242
|
+
const value = solver.getValue(app.val);
|
|
243
|
+
if (this.isPos(yValue) && !this.isPos(value)) {
|
|
244
|
+
this.mkClause([
|
|
245
|
+
this.mkBoundLiteral(app.y, "GT", Rational.zero) ^ 1,
|
|
246
|
+
this.mkBoundLiteral(app.val, "GT", Rational.zero),
|
|
247
|
+
]);
|
|
248
|
+
return true;
|
|
249
|
+
}
|
|
250
|
+
if (am.isNeg(yValue) && !am.isNeg(value)) {
|
|
251
|
+
this.mkClause([
|
|
252
|
+
this.mkBoundLiteral(app.y, "LT", Rational.zero) ^ 1,
|
|
253
|
+
this.mkBoundLiteral(app.val, "LT", Rational.zero),
|
|
254
|
+
]);
|
|
255
|
+
return true;
|
|
256
|
+
}
|
|
257
|
+
const [yLow, yHigh] = am.getInterval(yValue, 64);
|
|
258
|
+
const [xLow, xHigh] = am.getInterval(solver.getValue(app.x), 64);
|
|
259
|
+
const scale = [yLow.add(yHigh), xLow.add(xHigh)]
|
|
260
|
+
.map((sum) => sum.div(TWO).abs())
|
|
261
|
+
.reduce((first, second) => (first.compare(second) < 0 ? second : first), Rational.one);
|
|
262
|
+
const delta = getExclusionDelta(scale, app.retries);
|
|
263
|
+
const yWideLow = yLow.sub(delta);
|
|
264
|
+
const yWideHigh = yHigh.add(delta);
|
|
265
|
+
const xWideLow = xLow.sub(delta);
|
|
266
|
+
const xWideHigh = xHigh.add(delta);
|
|
267
|
+
const halfLow = PI_LOWER_BRACKET.div(TWO);
|
|
268
|
+
const halfHigh = PI_UPPER_BRACKET.div(TWO);
|
|
269
|
+
const range =
|
|
270
|
+
yWideLow.isPositive() && xWideLow.isPositive()
|
|
271
|
+
? { lower: Rational.zero, upper: halfHigh }
|
|
272
|
+
: yWideLow.isPositive() && xWideHigh.isNegative()
|
|
273
|
+
? { lower: halfLow, upper: PI_UPPER_BRACKET }
|
|
274
|
+
: yWideHigh.isNegative() && xWideHigh.isNegative()
|
|
275
|
+
? { lower: PI_UPPER_BRACKET.neg(), upper: halfLow.neg() }
|
|
276
|
+
: yWideHigh.isNegative() && xWideLow.isPositive()
|
|
277
|
+
? { lower: halfHigh.neg(), upper: Rational.zero }
|
|
278
|
+
: undefined;
|
|
279
|
+
if (range === undefined) return false;
|
|
280
|
+
const isBelow = this.compare(value, range.lower) < 0;
|
|
281
|
+
if (!isBelow && this.compare(value, range.upper) <= 0) return false;
|
|
282
|
+
this.mkClause([
|
|
283
|
+
this.mkBoundLiteral(app.y, "LT", yWideLow),
|
|
284
|
+
this.mkBoundLiteral(app.y, "GT", yWideHigh),
|
|
285
|
+
this.mkBoundLiteral(app.x, "LT", xWideLow),
|
|
286
|
+
this.mkBoundLiteral(app.x, "GT", xWideHigh),
|
|
287
|
+
isBelow
|
|
288
|
+
? this.mkBoundLiteral(app.val, "LT", range.lower) ^ 1
|
|
289
|
+
: this.mkBoundLiteral(app.val, "GT", range.upper) ^ 1,
|
|
290
|
+
]);
|
|
291
|
+
app.retries++;
|
|
292
|
+
return true;
|
|
293
|
+
}
|
|
294
|
+
|
|
295
|
+
// exp is increasing, and so is log on positive arguments.
|
|
296
|
+
private refineMonotonicityPair(first: App, second: App) {
|
|
297
|
+
const solver = this.solver;
|
|
298
|
+
const am = solver.am;
|
|
299
|
+
const firstArg = solver.getValue(first.arg);
|
|
300
|
+
const secondArg = solver.getValue(second.arg);
|
|
301
|
+
if (first.op === "log" && (!this.isPos(firstArg) || !this.isPos(secondArg))) return false;
|
|
302
|
+
const firstVal = solver.getValue(first.val);
|
|
303
|
+
const secondVal = solver.getValue(second.val);
|
|
304
|
+
const isFirstLess = am.compare(firstArg, secondArg) < 0 && am.compare(firstVal, secondVal) >= 0;
|
|
305
|
+
const isSecondLess =
|
|
306
|
+
!isFirstLess && am.compare(secondArg, firstArg) < 0 && am.compare(secondVal, firstVal) >= 0;
|
|
307
|
+
if (!isFirstLess && !isSecondLess) return false;
|
|
308
|
+
const kind = isFirstLess ? "LT" : "GT";
|
|
309
|
+
const domain =
|
|
310
|
+
first.op === "log"
|
|
311
|
+
? [
|
|
312
|
+
this.mkBoundLiteral(first.arg, "GT", Rational.zero) ^ 1,
|
|
313
|
+
this.mkBoundLiteral(second.arg, "GT", Rational.zero) ^ 1,
|
|
314
|
+
]
|
|
315
|
+
: [];
|
|
316
|
+
const args = this.mkLinearLiteral(
|
|
317
|
+
first.arg,
|
|
318
|
+
Rational.one,
|
|
319
|
+
second.arg,
|
|
320
|
+
Rational.minusOne,
|
|
321
|
+
kind,
|
|
322
|
+
Rational.zero,
|
|
323
|
+
);
|
|
324
|
+
const vals = this.mkLinearLiteral(
|
|
325
|
+
first.val,
|
|
326
|
+
Rational.one,
|
|
327
|
+
second.val,
|
|
328
|
+
Rational.minusOne,
|
|
329
|
+
kind,
|
|
330
|
+
Rational.zero,
|
|
331
|
+
);
|
|
332
|
+
this.mkClause([...domain, args ^ 1, vals]);
|
|
333
|
+
return true;
|
|
334
|
+
}
|
|
335
|
+
|
|
336
|
+
private refineMonotonicity() {
|
|
337
|
+
let isAdded = false;
|
|
338
|
+
for (const [index, first] of this.apps.entries()) {
|
|
339
|
+
if (first.op !== "exp" && first.op !== "log") continue;
|
|
340
|
+
for (const second of this.apps.slice(index + 1))
|
|
341
|
+
if (second.op === first.op && this.refineMonotonicityPair(first, second)) isAdded = true;
|
|
342
|
+
}
|
|
343
|
+
return isAdded;
|
|
344
|
+
}
|
|
345
|
+
|
|
346
|
+
// Called when the search finds a model: adds a clause for each application the model violates.
|
|
347
|
+
refine() {
|
|
348
|
+
let isAdded = false;
|
|
349
|
+
for (const app of this.apps) if (this.refineApp(app)) isAdded = true;
|
|
350
|
+
for (const app of this.atan2Apps) if (this.refineAtan2(app)) isAdded = true;
|
|
351
|
+
if (this.refineMonotonicity()) isAdded = true;
|
|
352
|
+
return isAdded;
|
|
353
|
+
}
|
|
354
|
+
|
|
355
|
+
// The variables live outside polynomials, so a reorder of the solver renames them here.
|
|
356
|
+
rename(permutation: readonly number[]) {
|
|
357
|
+
for (const app of this.apps) {
|
|
358
|
+
app.arg = permutation[app.arg];
|
|
359
|
+
app.val = permutation[app.val];
|
|
360
|
+
}
|
|
361
|
+
for (const app of this.atan2Apps) {
|
|
362
|
+
app.y = permutation[app.y];
|
|
363
|
+
app.x = permutation[app.x];
|
|
364
|
+
app.val = permutation[app.val];
|
|
365
|
+
}
|
|
366
|
+
}
|
|
367
|
+
}
|
|
@@ -1,6 +1,3 @@
|
|
|
1
|
-
// Ported from Z3 (src/math/polynomial/upolynomial_factorization{.cpp,_int.h}, the factorization
|
|
2
|
-
// in src/math/polynomial/upolynomial.cpp, src/util/prime_generator.cpp and mpz_manager::root),
|
|
3
|
-
// MIT license, see z3-license.txt.
|
|
4
1
|
import { type Upolynomial, UpolynomialManager } from "./upolynomial";
|
|
5
2
|
|
|
6
3
|
const UINT_MAX = 4294967295;
|
|
@@ -23,7 +20,7 @@ export interface UpolynomialFactors {
|
|
|
23
20
|
degrees: number[];
|
|
24
21
|
}
|
|
25
22
|
|
|
26
|
-
const mkFactors = (): UpolynomialFactors => ({ constant: 1n, factors: [], degrees: [] });
|
|
23
|
+
export const mkFactors = (): UpolynomialFactors => ({ constant: 1n, factors: [], degrees: [] });
|
|
27
24
|
|
|
28
25
|
const getTotalFactors = (fs: UpolynomialFactors) =>
|
|
29
26
|
fs.degrees.reduce((total, degree) => total + degree, 0);
|