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,15 +1,29 @@
|
|
|
1
|
-
// Ported from Z3 (src/ast/rewriter/arith_rewriter.cpp), MIT license, see z3-license.txt. Only
|
|
2
|
-
// linear arithmetic and nonlinear factoring are ported, without powers, algebraic numbers or
|
|
3
|
-
// hoisting, which tlapm's encoding does not produce.
|
|
4
1
|
import {
|
|
2
|
+
FAMILY_ARITH,
|
|
3
|
+
KIND_APP,
|
|
4
|
+
OP_ACOS,
|
|
5
|
+
OP_ACOSH,
|
|
5
6
|
OP_ADD,
|
|
7
|
+
OP_ASIN,
|
|
8
|
+
OP_ASINH,
|
|
9
|
+
OP_ATAN,
|
|
10
|
+
OP_ATANH,
|
|
11
|
+
OP_COS,
|
|
12
|
+
OP_COSH,
|
|
13
|
+
OP_DIV,
|
|
6
14
|
OP_GE,
|
|
15
|
+
OP_PI,
|
|
16
|
+
OP_POWER,
|
|
17
|
+
OP_SIN,
|
|
18
|
+
OP_SINH,
|
|
19
|
+
OP_TAN,
|
|
7
20
|
OP_IDIV,
|
|
8
21
|
OP_ITE,
|
|
9
22
|
OP_LE,
|
|
10
23
|
OP_LT,
|
|
11
24
|
OP_MOD,
|
|
12
25
|
OP_MUL,
|
|
26
|
+
OP_SEQ_LENGTH,
|
|
13
27
|
OP_SUB,
|
|
14
28
|
OP_TO_INT,
|
|
15
29
|
OP_TO_REAL,
|
|
@@ -22,33 +36,45 @@ import { getEuclideanDiv, getEuclideanMod, getGcd, Rational } from "./rational";
|
|
|
22
36
|
import { type ArithRewriterOptions, PolyRewriter } from "./poly-rewriter";
|
|
23
37
|
import type { Rewrite } from "./rewriter-tpl";
|
|
24
38
|
import { shrink } from "./array";
|
|
39
|
+
import { Anum } from "./nlsat/algebraic";
|
|
25
40
|
|
|
26
|
-
// The parameters that asserted_formulas gives the kernel's rewriter, which also simplifies instances.
|
|
27
41
|
export const KERNEL_ARITH_OPTIONS: ArithRewriterOptions = {
|
|
28
42
|
isSom: true,
|
|
29
43
|
isSortSums: true,
|
|
30
44
|
isArithIneqLhs: true,
|
|
31
45
|
isGcdRounding: true,
|
|
46
|
+
isAnumSimp: true,
|
|
47
|
+
isExpandPower: false,
|
|
48
|
+
isExpandTan: false,
|
|
49
|
+
maxDegree: 64,
|
|
32
50
|
};
|
|
33
51
|
|
|
34
|
-
// The defaults, which the simplify tactic uses.
|
|
35
52
|
export const TACTIC_ARITH_OPTIONS: ArithRewriterOptions = {
|
|
36
53
|
isSom: false,
|
|
37
54
|
isSortSums: false,
|
|
38
55
|
isArithIneqLhs: false,
|
|
39
56
|
isGcdRounding: false,
|
|
57
|
+
isAnumSimp: true,
|
|
58
|
+
isExpandPower: false,
|
|
59
|
+
isExpandTan: false,
|
|
60
|
+
maxDegree: 64,
|
|
61
|
+
};
|
|
62
|
+
|
|
63
|
+
const HALF = Rational.of(1n, 2n);
|
|
64
|
+
const TWO = Rational.of(2n);
|
|
65
|
+
|
|
66
|
+
const getHalfTurns = (k: Rational) => {
|
|
67
|
+
const floor = k.floor();
|
|
68
|
+
return Rational.of(getEuclideanMod(floor.num, 2n)).add(k).sub(floor);
|
|
40
69
|
};
|
|
41
70
|
|
|
42
|
-
// The ceiling of the quotient by a positive divisor.
|
|
43
71
|
const getCeilDiv = (dividend: bigint, divisor: bigint) => -getEuclideanDiv(-dividend, divisor);
|
|
44
72
|
|
|
45
|
-
// symmod: the remainder closest to zero, for a positive modulus.
|
|
46
73
|
const getSymmetricMod = (value: bigint, modulus: bigint) => {
|
|
47
74
|
const remainder = getEuclideanMod(value, modulus);
|
|
48
75
|
return 2n * remainder > modulus ? remainder - modulus : remainder;
|
|
49
76
|
};
|
|
50
77
|
|
|
51
|
-
// The running gcd of the coefficients of an atom's sides, and the number of their constants.
|
|
52
78
|
interface GcdState {
|
|
53
79
|
gcd: bigint;
|
|
54
80
|
isFirst: boolean;
|
|
@@ -63,8 +89,8 @@ const getInverse = (kind: number) =>
|
|
|
63
89
|
kind === KIND_LE ? KIND_GE : kind === KIND_GE ? KIND_LE : KIND_EQ;
|
|
64
90
|
|
|
65
91
|
export class ArithRewriter extends PolyRewriter {
|
|
66
|
-
// The buffer of isNonNegative's factors.
|
|
67
92
|
private factors: number[] = [];
|
|
93
|
+
isEq2Ineq = false;
|
|
68
94
|
|
|
69
95
|
mkLe(left: number, right: number) {
|
|
70
96
|
return this.mkLeGeEq(left, right, KIND_LE);
|
|
@@ -83,11 +109,19 @@ export class ArithRewriter extends PolyRewriter {
|
|
|
83
109
|
}
|
|
84
110
|
|
|
85
111
|
mkEq(left: number, right: number) {
|
|
112
|
+
const manager = this.manager;
|
|
113
|
+
if (this.isEq2Ineq)
|
|
114
|
+
return this.reduce(
|
|
115
|
+
manager.mkAnd([
|
|
116
|
+
manager.mkApp(OP_LE, [left, right], SORT_BOOL),
|
|
117
|
+
manager.mkApp(OP_GE, [left, right], SORT_BOOL),
|
|
118
|
+
]),
|
|
119
|
+
2,
|
|
120
|
+
);
|
|
86
121
|
if (!this.isArithTerm(left) && !this.isArithTerm(right)) return undefined;
|
|
87
122
|
return this.mkLeGeEq(left, right, KIND_EQ);
|
|
88
123
|
}
|
|
89
124
|
|
|
90
|
-
// mk_idiv_core and mk_mod_core: SMT-LIB integer division, whose remainder is non-negative.
|
|
91
125
|
private mkIdivApp(left: number, right: number) {
|
|
92
126
|
return this.manager.mkApp(OP_IDIV, [left, right], SORT_INT);
|
|
93
127
|
}
|
|
@@ -96,7 +130,6 @@ export class ArithRewriter extends PolyRewriter {
|
|
|
96
130
|
return this.manager.mkApp(OP_MOD, [left, right], SORT_INT);
|
|
97
131
|
}
|
|
98
132
|
|
|
99
|
-
// arith_util's mk_mul, which makes no product of one factor.
|
|
100
133
|
private mkFlatMulApp(args: number[]) {
|
|
101
134
|
return args.length === 1 ? args[0] : this.manager.mkApp(OP_MUL, args, SORT_INT);
|
|
102
135
|
}
|
|
@@ -105,7 +138,6 @@ export class ArithRewriter extends PolyRewriter {
|
|
|
105
138
|
return this.manager.mkApp(OP_ITE, [condition, thenExpr, elseExpr], SORT_INT);
|
|
106
139
|
}
|
|
107
140
|
|
|
108
|
-
// flat_mul: the factors of nested products, in Z3's order.
|
|
109
141
|
private getFlatMul(expr: number) {
|
|
110
142
|
const args = [expr];
|
|
111
143
|
for (let index = 0; index < args.length; index++) {
|
|
@@ -124,7 +156,6 @@ export class ArithRewriter extends PolyRewriter {
|
|
|
124
156
|
args.pop();
|
|
125
157
|
}
|
|
126
158
|
|
|
127
|
-
// remove_divisor: div ab ac is div b c when a is positive, and div -b -c when it is negative.
|
|
128
159
|
private removeDivisor(factor: number, dividend: number, divisor: number) {
|
|
129
160
|
const manager = this.manager;
|
|
130
161
|
const dividendArgs = this.getFlatMul(dividend);
|
|
@@ -150,7 +181,6 @@ export class ArithRewriter extends PolyRewriter {
|
|
|
150
181
|
);
|
|
151
182
|
}
|
|
152
183
|
|
|
153
|
-
// get_divides: div ab ac is div b c, and common numeral factors cancel.
|
|
154
184
|
private getDivides(dividend: number, divisor: number) {
|
|
155
185
|
const manager = this.manager;
|
|
156
186
|
const dividendArgs = this.getFlatMul(dividend);
|
|
@@ -168,8 +198,7 @@ export class ArithRewriter extends PolyRewriter {
|
|
|
168
198
|
}
|
|
169
199
|
for (const arg of divisorArgs) {
|
|
170
200
|
const value = manager.getNumeral(arg);
|
|
171
|
-
//
|
|
172
|
-
// check stores the -1 as the dividend's value.
|
|
201
|
+
// Z3 stores a common factor of -1 as the dividend's value, or (div (* -1 x) (* -1 y)) diverges.
|
|
173
202
|
if (marked.has(arg) && value !== -1n) return this.removeDivisor(arg, dividend, divisor);
|
|
174
203
|
if (marked.has(arg)) dividendValue = -1n;
|
|
175
204
|
if (value === undefined) continue;
|
|
@@ -189,7 +218,6 @@ export class ArithRewriter extends PolyRewriter {
|
|
|
189
218
|
);
|
|
190
219
|
}
|
|
191
220
|
|
|
192
|
-
// mk_idiv_core.
|
|
193
221
|
mkIdiv(left: number, right: number) {
|
|
194
222
|
const manager = this.manager;
|
|
195
223
|
this.currSort = SORT_INT;
|
|
@@ -234,7 +262,31 @@ export class ArithRewriter extends PolyRewriter {
|
|
|
234
262
|
);
|
|
235
263
|
}
|
|
236
264
|
|
|
237
|
-
|
|
265
|
+
mkRem(left: number, right: number) {
|
|
266
|
+
const manager = this.manager;
|
|
267
|
+
this.currSort = SORT_INT;
|
|
268
|
+
const dividend = manager.getNumeral(left);
|
|
269
|
+
const divisor = manager.getNumeral(right);
|
|
270
|
+
if (dividend !== undefined && divisor !== undefined && divisor !== 0n) {
|
|
271
|
+
const remainder = getEuclideanMod(dividend, divisor);
|
|
272
|
+
return manager.mkNumeral(divisor < 0n ? -remainder : remainder);
|
|
273
|
+
}
|
|
274
|
+
if (divisor === 1n) return manager.mkNumeral(0n);
|
|
275
|
+
if (divisor !== undefined && divisor !== 0n) {
|
|
276
|
+
if (this.isAdd(left) || this.isMul(left)) return undefined;
|
|
277
|
+
return divisor < 0n
|
|
278
|
+
? this.reduce(manager.mkApp(OP_UMINUS, [this.mkModApp(left, right)], SORT_INT), 2)
|
|
279
|
+
: this.reduce(this.mkModApp(left, right), 1);
|
|
280
|
+
}
|
|
281
|
+
if (!this.options.isElimRem) return undefined;
|
|
282
|
+
const mod = this.mkModApp(left, right);
|
|
283
|
+
const isNonnegative = manager.mkApp(OP_GE, [right, manager.mkNumeral(0n)], SORT_BOOL);
|
|
284
|
+
return this.reduce(
|
|
285
|
+
this.mkIntIte(isNonnegative, mod, manager.mkApp(OP_UMINUS, [mod], SORT_INT)),
|
|
286
|
+
3,
|
|
287
|
+
);
|
|
288
|
+
}
|
|
289
|
+
|
|
238
290
|
mkMod(left: number, right: number) {
|
|
239
291
|
const manager = this.manager;
|
|
240
292
|
this.currSort = SORT_INT;
|
|
@@ -246,7 +298,6 @@ export class ArithRewriter extends PolyRewriter {
|
|
|
246
298
|
const zero = manager.mkNumeral(0n);
|
|
247
299
|
if (left === right && divisor === undefined)
|
|
248
300
|
return this.mkIntIte(manager.mkEq(right, zero), this.mkModApp(zero, zero), zero);
|
|
249
|
-
// mod is idempotent on a nonzero modulus.
|
|
250
301
|
if (manager.getOp(left) === OP_MOD && manager.getArg(left, 1) === right) {
|
|
251
302
|
if (divisor !== undefined && divisor !== 0n) return left;
|
|
252
303
|
if (divisor === undefined)
|
|
@@ -259,7 +310,6 @@ export class ArithRewriter extends PolyRewriter {
|
|
|
259
310
|
2,
|
|
260
311
|
);
|
|
261
312
|
}
|
|
262
|
-
// Propagates mod inside a sum or product only if there is something to reduce.
|
|
263
313
|
if (divisor !== undefined && divisor > 0n && (this.isAdd(left) || this.isMul(left))) {
|
|
264
314
|
let isChanged = false;
|
|
265
315
|
const args = manager.mapArgs(left, (arg) => {
|
|
@@ -292,7 +342,6 @@ export class ArithRewriter extends PolyRewriter {
|
|
|
292
342
|
3,
|
|
293
343
|
);
|
|
294
344
|
}
|
|
295
|
-
// For a symbolic modulus, the summands that are multiples of it go: mod (a + k*y) y = mod a y.
|
|
296
345
|
if (divisor === undefined && this.isAdd(left)) {
|
|
297
346
|
const args: number[] = [];
|
|
298
347
|
for (let index = 0; index < manager.getNumArgs(left); index++) {
|
|
@@ -333,7 +382,6 @@ export class ArithRewriter extends PolyRewriter {
|
|
|
333
382
|
),
|
|
334
383
|
1,
|
|
335
384
|
);
|
|
336
|
-
// mod x -y = mod x y.
|
|
337
385
|
if (
|
|
338
386
|
this.isMul(right) &&
|
|
339
387
|
manager.getNumArgs(right) === 2 &&
|
|
@@ -369,9 +417,467 @@ export class ArithRewriter extends PolyRewriter {
|
|
|
369
417
|
);
|
|
370
418
|
}
|
|
371
419
|
|
|
372
|
-
|
|
420
|
+
override mkAddCore(args: number[]) {
|
|
421
|
+
if (!this.isAnumSimpTarget(args)) return super.mkAddCore(args);
|
|
422
|
+
const folded = this.foldAnums(args, true);
|
|
423
|
+
if (typeof folded === "number") return folded;
|
|
424
|
+
return super.mkAddCore(folded) ?? this.manager.mkApp(OP_ADD, folded, SORT_REAL);
|
|
425
|
+
}
|
|
426
|
+
|
|
427
|
+
override mkMul(args: number[]) {
|
|
428
|
+
if (!this.isAnumSimpTarget(args)) return super.mkMul(args);
|
|
429
|
+
const folded = this.foldAnums(args, false);
|
|
430
|
+
if (typeof folded === "number") return folded;
|
|
431
|
+
return super.mkMul(folded) ?? this.manager.mkApp(OP_MUL, folded, SORT_REAL);
|
|
432
|
+
}
|
|
433
|
+
|
|
434
|
+
private isSimpAlgebraic(expr: number) {
|
|
435
|
+
const manager = this.manager;
|
|
436
|
+
return (
|
|
437
|
+
manager.isAlgebraicNumeral(expr) &&
|
|
438
|
+
manager.am.degree(manager.getAlgebraicValue(expr)) <= this.options.maxDegree
|
|
439
|
+
);
|
|
440
|
+
}
|
|
441
|
+
|
|
442
|
+
private isAnumSimpTarget(args: number[]) {
|
|
443
|
+
if (!this.options.isAnumSimp) return false;
|
|
444
|
+
let numIrrational = 0;
|
|
445
|
+
let numRational = 0;
|
|
446
|
+
for (const arg of args) {
|
|
447
|
+
if (this.manager.isNumeral(arg)) {
|
|
448
|
+
numRational++;
|
|
449
|
+
if (numIrrational > 0) return true;
|
|
450
|
+
}
|
|
451
|
+
if (this.isSimpAlgebraic(arg)) {
|
|
452
|
+
numIrrational++;
|
|
453
|
+
if (numIrrational > 1 || numRational > 0) return true;
|
|
454
|
+
}
|
|
455
|
+
}
|
|
456
|
+
return false;
|
|
457
|
+
}
|
|
458
|
+
|
|
459
|
+
private foldAnums(args: number[], isAdd: boolean) {
|
|
460
|
+
const manager = this.manager;
|
|
461
|
+
const am = manager.am;
|
|
462
|
+
const identity = isAdd ? Rational.zero : Rational.one;
|
|
463
|
+
const combine = (first: Anum, second: Anum) =>
|
|
464
|
+
isAdd ? am.add(first, second) : am.mul(first, second);
|
|
465
|
+
let result = new Anum(identity);
|
|
466
|
+
const newArgs: number[] = [];
|
|
467
|
+
for (const arg of args) {
|
|
468
|
+
const degree = am.degree(result);
|
|
469
|
+
if (degree > 1 && degree > this.options.maxDegree) {
|
|
470
|
+
newArgs.push(manager.mkAlgebraicNumeral(result));
|
|
471
|
+
result = new Anum(identity);
|
|
472
|
+
}
|
|
473
|
+
if (manager.isNumeral(arg)) result = combine(result, new Anum(this.getValue(arg)));
|
|
474
|
+
else if (this.isSimpAlgebraic(arg)) result = combine(result, manager.getAlgebraicValue(arg));
|
|
475
|
+
else newArgs.push(arg);
|
|
476
|
+
}
|
|
477
|
+
if (newArgs.length === 0) return manager.mkAlgebraicNumeral(result);
|
|
478
|
+
newArgs.push(manager.mkAlgebraicNumeral(result));
|
|
479
|
+
return newArgs;
|
|
480
|
+
}
|
|
481
|
+
|
|
482
|
+
private getAlgebraicValue(expr: number): Anum | undefined {
|
|
483
|
+
const manager = this.manager;
|
|
484
|
+
const am = manager.am;
|
|
485
|
+
if (manager.isNumeral(expr)) return new Anum(this.getValue(expr));
|
|
486
|
+
if (manager.isAlgebraicNumeral(expr)) return am.copy(manager.getAlgebraicValue(expr));
|
|
487
|
+
const op = manager.getOp(expr);
|
|
488
|
+
if ((op !== OP_ADD && op !== OP_MUL) || manager.getNumArgs(expr) !== 2) return undefined;
|
|
489
|
+
const first = this.getAlgebraicValue(manager.getArg(expr, 0));
|
|
490
|
+
const second = first && this.getAlgebraicValue(manager.getArg(expr, 1));
|
|
491
|
+
if (first === undefined || second === undefined) return undefined;
|
|
492
|
+
return op === OP_ADD ? am.add(first, second) : am.mul(first, second);
|
|
493
|
+
}
|
|
494
|
+
|
|
495
|
+
private mkAnumDiv(left: number, right: number) {
|
|
496
|
+
const manager = this.manager;
|
|
497
|
+
const am = manager.am;
|
|
498
|
+
const isLeftAlgebraic = manager.isAlgebraicNumeral(left);
|
|
499
|
+
const isRightAlgebraic = manager.isAlgebraicNumeral(right);
|
|
500
|
+
if (isLeftAlgebraic && manager.isNumeral(right)) {
|
|
501
|
+
if (this.getValue(right).isZero()) return undefined;
|
|
502
|
+
return manager.mkAlgebraicNumeral(
|
|
503
|
+
am.div(manager.getAlgebraicValue(left), new Anum(this.getValue(right))),
|
|
504
|
+
);
|
|
505
|
+
}
|
|
506
|
+
if (isLeftAlgebraic && isRightAlgebraic) {
|
|
507
|
+
if (!this.isSimpAlgebraic(left) || !this.isSimpAlgebraic(right)) return undefined;
|
|
508
|
+
return manager.mkAlgebraicNumeral(
|
|
509
|
+
am.div(manager.getAlgebraicValue(left), manager.getAlgebraicValue(right)),
|
|
510
|
+
);
|
|
511
|
+
}
|
|
512
|
+
return manager.mkAlgebraicNumeral(
|
|
513
|
+
am.div(new Anum(this.getValue(left)), manager.getAlgebraicValue(right)),
|
|
514
|
+
);
|
|
515
|
+
}
|
|
516
|
+
|
|
517
|
+
private ensureReal(expr: number) {
|
|
518
|
+
const manager = this.manager;
|
|
519
|
+
return manager.isInt(expr) ? manager.mkApp(OP_TO_REAL, [expr], SORT_REAL) : expr;
|
|
520
|
+
}
|
|
521
|
+
|
|
522
|
+
private mkPowerApp(base: number, exponent: number) {
|
|
523
|
+
return this.manager.mkApp(OP_POWER, [base, exponent], SORT_REAL);
|
|
524
|
+
}
|
|
525
|
+
|
|
526
|
+
mkPower(base: number, exponent: number): number | Rewrite | undefined {
|
|
527
|
+
const manager = this.manager;
|
|
528
|
+
const maxDegree = this.options.maxDegree;
|
|
529
|
+
const x = manager.isNumeral(base) ? this.getValue(base) : undefined;
|
|
530
|
+
const y = manager.isNumeral(exponent) ? this.getValue(exponent) : undefined;
|
|
531
|
+
const isSmall = (value: Rational) =>
|
|
532
|
+
value.isInt() && value.num >= 0n && value.num <= BigInt(maxDegree);
|
|
533
|
+
if (x?.equals(Rational.one)) return manager.mkRealNumeral(x);
|
|
534
|
+
if (y?.equals(Rational.one)) return this.reduce(this.ensureReal(base), 1);
|
|
535
|
+
if (x !== undefined && y !== undefined) {
|
|
536
|
+
if (x.isZero() && y.isZero()) return undefined;
|
|
537
|
+
if (y.isZero()) return manager.mkRealNumeral(Rational.one);
|
|
538
|
+
if (x.isZero()) return manager.mkRealNumeral(x);
|
|
539
|
+
if (isSmall(y)) return manager.mkRealNumeral(x.pow(Number(y.num)));
|
|
540
|
+
if (isSmall(y.neg())) return manager.mkRealNumeral(Rational.one.div(x).pow(Number(-y.num)));
|
|
541
|
+
if (y.equals(Rational.minusOne)) return manager.mkRealNumeral(Rational.one.div(x));
|
|
542
|
+
}
|
|
543
|
+
if (manager.getOp(base) === OP_POWER && y !== undefined && y.isInt() && !y.isZero()) {
|
|
544
|
+
const innerExponent = manager.getArg(base, 1);
|
|
545
|
+
const inner = manager.isNumeral(innerExponent) ? this.getValue(innerExponent) : undefined;
|
|
546
|
+
if (inner !== undefined && inner.isInt() && inner.isPositive())
|
|
547
|
+
return this.reduce(
|
|
548
|
+
this.mkPowerApp(
|
|
549
|
+
this.ensureReal(manager.getArg(base, 0)),
|
|
550
|
+
manager.mkRealNumeral(y.mul(inner)),
|
|
551
|
+
),
|
|
552
|
+
2,
|
|
553
|
+
);
|
|
554
|
+
}
|
|
555
|
+
const mkZeroIte = (otherwise: number) =>
|
|
556
|
+
manager.mkApp(
|
|
557
|
+
OP_ITE,
|
|
558
|
+
[
|
|
559
|
+
manager.mkEq(base, manager.mkNumeralOfSort(Rational.zero, manager.sorts[base])),
|
|
560
|
+
manager.mkRealNumeral(Rational.zero),
|
|
561
|
+
otherwise,
|
|
562
|
+
],
|
|
563
|
+
SORT_REAL,
|
|
564
|
+
);
|
|
565
|
+
if (y?.equals(Rational.minusOne)) {
|
|
566
|
+
const one = manager.mkRealNumeral(Rational.one);
|
|
567
|
+
const quotient = manager.mkApp(OP_DIV, [one, this.ensureReal(base)], SORT_REAL);
|
|
568
|
+
return this.reduce(mkZeroIte(quotient), 2);
|
|
569
|
+
}
|
|
570
|
+
if (y?.isNegative()) {
|
|
571
|
+
const one = manager.mkRealNumeral(Rational.one);
|
|
572
|
+
const quotient = manager.mkApp(OP_DIV, [one, this.ensureReal(base)], SORT_REAL);
|
|
573
|
+
return this.reduce(mkZeroIte(this.mkPowerApp(quotient, manager.mkRealNumeral(y.neg()))), 3);
|
|
574
|
+
}
|
|
575
|
+
if (y !== undefined && !y.isInt() && y.num !== 1n) {
|
|
576
|
+
const root = this.mkPowerApp(
|
|
577
|
+
this.ensureReal(base),
|
|
578
|
+
manager.mkRealNumeral(Rational.of(1n, y.den)),
|
|
579
|
+
);
|
|
580
|
+
return this.reduce(this.mkPowerApp(root, manager.mkRealNumeral(Rational.of(y.num))), 3);
|
|
581
|
+
}
|
|
582
|
+
const isArithBase =
|
|
583
|
+
manager.kinds[base] === KIND_APP &&
|
|
584
|
+
manager.funcDecls[manager.decls[base]].family === FAMILY_ARITH;
|
|
585
|
+
if (
|
|
586
|
+
(this.options.isExpandPower || (this.options.isSom && isArithBase)) &&
|
|
587
|
+
y !== undefined &&
|
|
588
|
+
isSmall(y) &&
|
|
589
|
+
y.num > 1n
|
|
590
|
+
) {
|
|
591
|
+
const factors = Array.from({ length: Number(y.num) }, () => base);
|
|
592
|
+
return this.reduce(this.ensureReal(manager.mkApp(OP_MUL, factors, manager.sorts[base])), 2);
|
|
593
|
+
}
|
|
594
|
+
if (y === undefined || y.isZero()) return undefined;
|
|
595
|
+
const isIrrationalBase = manager.isAlgebraicNumeral(base);
|
|
596
|
+
if (x === undefined && !isIrrationalBase) return undefined;
|
|
597
|
+
const isNegativeExponent = y.isNegative();
|
|
598
|
+
const numerator = isNegativeExponent ? -y.num : y.num;
|
|
599
|
+
if (numerator > BigInt(maxDegree) || y.den > BigInt(maxDegree)) return undefined;
|
|
600
|
+
const am = manager.am;
|
|
601
|
+
const finish = (value: Anum) => {
|
|
602
|
+
if (isNegativeExponent) am.inv(value);
|
|
603
|
+
return manager.mkAlgebraicNumeral(value);
|
|
604
|
+
};
|
|
605
|
+
if (x !== undefined) {
|
|
606
|
+
const power = x.pow(Number(numerator));
|
|
607
|
+
if (power.isNegative() && y.den % 2n === 0n) return undefined;
|
|
608
|
+
const exact = power.root(Number(y.den));
|
|
609
|
+
if (exact !== undefined)
|
|
610
|
+
return manager.mkRealNumeral(isNegativeExponent ? Rational.one.div(exact) : exact);
|
|
611
|
+
if (!this.options.isAnumSimp) return undefined;
|
|
612
|
+
return finish(am.root(new Anum(power), Number(y.den)));
|
|
613
|
+
}
|
|
614
|
+
const value = manager.getAlgebraicValue(base);
|
|
615
|
+
if (!this.options.isAnumSimp || am.degree(value) > maxDegree) return undefined;
|
|
616
|
+
return finish(am.root(am.power(value, Number(numerator)), Number(y.den)));
|
|
617
|
+
}
|
|
618
|
+
|
|
619
|
+
private isPi(expr: number) {
|
|
620
|
+
return this.manager.getOp(expr) === OP_PI;
|
|
621
|
+
}
|
|
622
|
+
|
|
623
|
+
private isBinary(expr: number, op: number) {
|
|
624
|
+
const manager = this.manager;
|
|
625
|
+
return manager.getOp(expr) === op && manager.getNumArgs(expr) === 2;
|
|
626
|
+
}
|
|
627
|
+
|
|
628
|
+
private getPiMultiple(expr: number) {
|
|
629
|
+
const manager = this.manager;
|
|
630
|
+
if (this.isPi(expr)) return Rational.one;
|
|
631
|
+
if (!this.isBinary(expr, OP_MUL) || !this.isPi(manager.getArg(expr, 1))) return undefined;
|
|
632
|
+
const coefficient = manager.getArg(expr, 0);
|
|
633
|
+
return manager.isNumeral(coefficient) ? this.getValue(coefficient) : undefined;
|
|
634
|
+
}
|
|
635
|
+
|
|
636
|
+
private getPiOffset(expr: number) {
|
|
637
|
+
const manager = this.manager;
|
|
638
|
+
if (manager.getOp(expr) !== OP_ADD) return undefined;
|
|
639
|
+
for (let index = 0; index < manager.getNumArgs(expr); index++) {
|
|
640
|
+
const term = manager.getArg(expr, index);
|
|
641
|
+
const k = this.getPiMultiple(term);
|
|
642
|
+
if (k !== undefined) return { k, term };
|
|
643
|
+
}
|
|
644
|
+
return undefined;
|
|
645
|
+
}
|
|
646
|
+
|
|
647
|
+
private isPiTimesToReal(first: number, second: number) {
|
|
648
|
+
const manager = this.manager;
|
|
649
|
+
return (
|
|
650
|
+
(this.isPi(first) && manager.getOp(second) === OP_TO_REAL) ||
|
|
651
|
+
(manager.getOp(first) === OP_TO_REAL && this.isPi(second))
|
|
652
|
+
);
|
|
653
|
+
}
|
|
654
|
+
|
|
655
|
+
private isTwoPiInteger(expr: number) {
|
|
656
|
+
const manager = this.manager;
|
|
657
|
+
if (!this.isBinary(expr, OP_MUL)) return false;
|
|
658
|
+
const coefficient = manager.getArg(expr, 0);
|
|
659
|
+
const product = manager.getArg(expr, 1);
|
|
660
|
+
if (!manager.isNumeral(coefficient)) return false;
|
|
661
|
+
const k = this.getValue(coefficient);
|
|
662
|
+
return (
|
|
663
|
+
k.isInt() &&
|
|
664
|
+
getEuclideanMod(k.num, 2n) === 0n &&
|
|
665
|
+
this.isBinary(product, OP_MUL) &&
|
|
666
|
+
this.isPiTimesToReal(manager.getArg(product, 0), manager.getArg(product, 1))
|
|
667
|
+
);
|
|
668
|
+
}
|
|
669
|
+
|
|
670
|
+
private isPiInteger(expr: number) {
|
|
671
|
+
const manager = this.manager;
|
|
672
|
+
if (!this.isBinary(expr, OP_MUL)) return false;
|
|
673
|
+
const first = manager.getArg(expr, 0);
|
|
674
|
+
const second = manager.getArg(expr, 1);
|
|
675
|
+
if (!manager.isNumeral(first)) return this.isPiTimesToReal(first, second);
|
|
676
|
+
if (!this.getValue(first).isInt() || !this.isBinary(second, OP_MUL)) return false;
|
|
677
|
+
return this.isPiTimesToReal(manager.getArg(second, 0), manager.getArg(second, 1));
|
|
678
|
+
}
|
|
679
|
+
|
|
680
|
+
private findSummand(expr: number, isMatching: (term: number) => boolean) {
|
|
681
|
+
const manager = this.manager;
|
|
682
|
+
if (manager.getOp(expr) !== OP_ADD) return undefined;
|
|
683
|
+
for (let index = 0; index < manager.getNumArgs(expr); index++)
|
|
684
|
+
if (isMatching(manager.getArg(expr, index))) return manager.getArg(expr, index);
|
|
685
|
+
return undefined;
|
|
686
|
+
}
|
|
687
|
+
|
|
688
|
+
private mkReal(value: Rational) {
|
|
689
|
+
return this.manager.mkRealNumeral(value);
|
|
690
|
+
}
|
|
691
|
+
|
|
692
|
+
private mkRealApp(op: number, args: number[]) {
|
|
693
|
+
return this.manager.mkApp(op, args, SORT_REAL);
|
|
694
|
+
}
|
|
695
|
+
|
|
696
|
+
private mkSqrt(value: Rational) {
|
|
697
|
+
return this.mkPowerApp(this.mkReal(value), this.mkReal(HALF));
|
|
698
|
+
}
|
|
699
|
+
|
|
700
|
+
private mkSinValue(k: Rational) {
|
|
701
|
+
const turns = getHalfTurns(k);
|
|
702
|
+
const isNegative = turns.compare(Rational.one) >= 0;
|
|
703
|
+
const kPrime = isNegative ? turns.sub(Rational.one) : turns;
|
|
704
|
+
const mkSigned = (expr: number) => (isNegative ? this.mkRealApp(OP_UMINUS, [expr]) : expr);
|
|
705
|
+
const is = (num: bigint, den: bigint) => kPrime.equals(Rational.of(num, den));
|
|
706
|
+
if (kPrime.isZero() || kPrime.equals(Rational.one)) return this.mkReal(Rational.zero);
|
|
707
|
+
if (is(1n, 2n)) return this.mkReal(isNegative ? Rational.minusOne : Rational.one);
|
|
708
|
+
if (is(1n, 6n) || is(5n, 6n)) return this.mkReal(Rational.of(isNegative ? -1n : 1n, 2n));
|
|
709
|
+
if (is(1n, 4n) || is(3n, 4n)) return mkSigned(this.mkSqrt(HALF));
|
|
710
|
+
if (is(1n, 3n) || is(2n, 3n))
|
|
711
|
+
return mkSigned(this.mkRealApp(OP_DIV, [this.mkSqrt(Rational.of(3n)), this.mkReal(TWO)]));
|
|
712
|
+
const isLow = is(1n, 12n) || is(11n, 12n);
|
|
713
|
+
if (isLow || is(5n, 12n) || is(7n, 12n)) {
|
|
714
|
+
const six = this.mkSqrt(Rational.of(6n));
|
|
715
|
+
const two = this.mkSqrt(TWO);
|
|
716
|
+
const sum = this.mkRealApp(isLow ? OP_SUB : OP_ADD, [six, two]);
|
|
717
|
+
return mkSigned(this.mkRealApp(OP_DIV, [sum, this.mkReal(Rational.of(4n))]));
|
|
718
|
+
}
|
|
719
|
+
return undefined;
|
|
720
|
+
}
|
|
721
|
+
|
|
722
|
+
private mkWithoutTerm(op: number, arg: number, term: number, isNegated: boolean) {
|
|
723
|
+
const app = this.mkRealApp(op, [this.mkRealApp(OP_SUB, [arg, term])]);
|
|
724
|
+
return isNegated ? this.reduce(this.mkRealApp(OP_UMINUS, [app]), 3) : this.reduce(app, 2);
|
|
725
|
+
}
|
|
726
|
+
|
|
727
|
+
private mkSinCos(arg: number, isSin: boolean): number | Rewrite | undefined {
|
|
728
|
+
const manager = this.manager;
|
|
729
|
+
const op = manager.getOp(arg);
|
|
730
|
+
const inverse = manager.getNumArgs(arg) === 1 ? manager.getArg(arg, 0) : -1;
|
|
731
|
+
if (op === (isSin ? OP_ASIN : OP_ACOS)) return inverse;
|
|
732
|
+
if (isSin && op === OP_ACOS) {
|
|
733
|
+
const square = this.mkRealApp(OP_MUL, [inverse, inverse]);
|
|
734
|
+
const difference = this.mkRealApp(OP_SUB, [this.mkReal(Rational.one), square]);
|
|
735
|
+
return this.reduce(this.mkPowerApp(difference, this.mkReal(HALF)), Infinity);
|
|
736
|
+
}
|
|
737
|
+
if (manager.isNumeral(arg) && this.getValue(arg).isZero())
|
|
738
|
+
return isSin ? arg : this.mkReal(Rational.one);
|
|
739
|
+
const multiple = this.getPiMultiple(arg);
|
|
740
|
+
const value =
|
|
741
|
+
multiple === undefined ? undefined : this.mkSinValue(isSin ? multiple : multiple.add(HALF));
|
|
742
|
+
if (value !== undefined) return this.reduce(value, Infinity);
|
|
743
|
+
const offset = this.getPiOffset(arg);
|
|
744
|
+
if (offset !== undefined) {
|
|
745
|
+
const turns = getHalfTurns(offset.k);
|
|
746
|
+
const quarter = turns.isZero()
|
|
747
|
+
? 0
|
|
748
|
+
: turns.equals(HALF)
|
|
749
|
+
? 1
|
|
750
|
+
: turns.equals(Rational.one)
|
|
751
|
+
? 2
|
|
752
|
+
: turns.equals(Rational.of(3n, 2n))
|
|
753
|
+
? 3
|
|
754
|
+
: -1;
|
|
755
|
+
if (quarter !== -1) {
|
|
756
|
+
// sin(x + q pi/2) is sin, cos, -sin, -cos, and cos(x + q pi/2) is cos, -sin, -cos, sin.
|
|
757
|
+
const shifted = isSin ? quarter : quarter + 1;
|
|
758
|
+
return this.mkWithoutTerm(
|
|
759
|
+
shifted % 2 === 0 ? OP_SIN : OP_COS,
|
|
760
|
+
arg,
|
|
761
|
+
offset.term,
|
|
762
|
+
shifted % 4 >= 2,
|
|
763
|
+
);
|
|
764
|
+
}
|
|
765
|
+
}
|
|
766
|
+
const term = this.findSummand(arg, (summand) => this.isTwoPiInteger(summand));
|
|
767
|
+
if (term !== undefined) return this.mkWithoutTerm(isSin ? OP_SIN : OP_COS, arg, term, false);
|
|
768
|
+
return undefined;
|
|
769
|
+
}
|
|
770
|
+
|
|
771
|
+
mkSin(arg: number) {
|
|
772
|
+
return this.mkSinCos(arg, true);
|
|
773
|
+
}
|
|
774
|
+
|
|
775
|
+
mkCos(arg: number) {
|
|
776
|
+
return this.mkSinCos(arg, false);
|
|
777
|
+
}
|
|
778
|
+
|
|
779
|
+
mkTan(arg: number): number | Rewrite | undefined {
|
|
780
|
+
const manager = this.manager;
|
|
781
|
+
if (manager.getOp(arg) === OP_ATAN) return manager.getArg(arg, 0);
|
|
782
|
+
if (manager.isNumeral(arg) && this.getValue(arg).isZero()) return arg;
|
|
783
|
+
const expanded = this.mkTanCore(arg);
|
|
784
|
+
if (expanded !== undefined || !this.options.isExpandTan) return expanded;
|
|
785
|
+
return this.reduce(
|
|
786
|
+
this.mkRealApp(OP_DIV, [this.mkRealApp(OP_SIN, [arg]), this.mkRealApp(OP_COS, [arg])]),
|
|
787
|
+
2,
|
|
788
|
+
);
|
|
789
|
+
}
|
|
790
|
+
|
|
791
|
+
private mkTanCore(arg: number) {
|
|
792
|
+
const multiple = this.getPiMultiple(arg);
|
|
793
|
+
if (multiple !== undefined) {
|
|
794
|
+
const sine = this.mkSinValue(multiple);
|
|
795
|
+
if (sine === undefined) return undefined;
|
|
796
|
+
if (this.isZero(sine)) return sine;
|
|
797
|
+
const cosine = this.mkSinValue(multiple.add(HALF));
|
|
798
|
+
if (cosine === undefined || this.isZero(cosine)) return undefined;
|
|
799
|
+
return this.reduce(this.mkRealApp(OP_DIV, [sine, cosine]), Infinity);
|
|
800
|
+
}
|
|
801
|
+
const offset = this.getPiOffset(arg);
|
|
802
|
+
if (offset !== undefined && offset.k.isInt())
|
|
803
|
+
return this.mkWithoutTerm(OP_TAN, arg, offset.term, false);
|
|
804
|
+
const term = this.findSummand(arg, (summand) => this.isPiInteger(summand));
|
|
805
|
+
if (term !== undefined) return this.mkWithoutTerm(OP_TAN, arg, term, false);
|
|
806
|
+
return undefined;
|
|
807
|
+
}
|
|
808
|
+
|
|
809
|
+
private mkPiMultiple(num: bigint, den: bigint) {
|
|
810
|
+
return this.reduce(
|
|
811
|
+
this.mkRealApp(OP_MUL, [this.mkReal(Rational.of(num, den)), this.manager.piExpr]),
|
|
812
|
+
2,
|
|
813
|
+
);
|
|
814
|
+
}
|
|
815
|
+
|
|
816
|
+
// Like Z3, asin(-x) = -asin(x) even outside [-1, 1].
|
|
817
|
+
private mkNegated(op: number, arg: number) {
|
|
818
|
+
return this.reduce(this.mkRealApp(OP_UMINUS, [this.mkRealApp(op, [arg])]), 2);
|
|
819
|
+
}
|
|
820
|
+
|
|
821
|
+
mkAsin(arg: number) {
|
|
822
|
+
const manager = this.manager;
|
|
823
|
+
if (manager.isNumeral(arg)) {
|
|
824
|
+
const k = this.getValue(arg);
|
|
825
|
+
if (k.isZero()) return arg;
|
|
826
|
+
if (k.compare(Rational.minusOne) < 0) return this.mkNegated(OP_ASIN, this.mkReal(k.neg()));
|
|
827
|
+
if (k.compare(Rational.one) > 0) return undefined;
|
|
828
|
+
const sign = k.isNegative() ? -1n : 1n;
|
|
829
|
+
const magnitude = k.abs();
|
|
830
|
+
if (magnitude.equals(Rational.one)) return this.mkPiMultiple(sign, 2n);
|
|
831
|
+
if (magnitude.equals(HALF)) return this.mkPiMultiple(sign, 6n);
|
|
832
|
+
}
|
|
833
|
+
const negated = manager.getTimesMinusOneArg(arg);
|
|
834
|
+
return negated === undefined ? undefined : this.mkNegated(OP_ASIN, negated);
|
|
835
|
+
}
|
|
836
|
+
|
|
837
|
+
mkAcos(arg: number) {
|
|
838
|
+
const manager = this.manager;
|
|
839
|
+
if (!manager.isNumeral(arg)) return undefined;
|
|
840
|
+
const k = this.getValue(arg);
|
|
841
|
+
if (k.isZero()) return this.mkPiMultiple(1n, 2n);
|
|
842
|
+
if (k.equals(Rational.one)) return this.mkReal(Rational.zero);
|
|
843
|
+
if (k.equals(Rational.minusOne)) return manager.piExpr;
|
|
844
|
+
if (k.equals(HALF)) return this.mkPiMultiple(1n, 3n);
|
|
845
|
+
if (k.equals(HALF.neg())) return this.mkPiMultiple(2n, 3n);
|
|
846
|
+
return undefined;
|
|
847
|
+
}
|
|
848
|
+
|
|
849
|
+
mkAtan(arg: number) {
|
|
850
|
+
const manager = this.manager;
|
|
851
|
+
if (manager.isNumeral(arg)) {
|
|
852
|
+
const k = this.getValue(arg);
|
|
853
|
+
if (k.isZero()) return arg;
|
|
854
|
+
if (k.equals(Rational.one)) return this.mkPiMultiple(1n, 4n);
|
|
855
|
+
if (k.equals(Rational.minusOne)) return this.mkPiMultiple(-1n, 4n);
|
|
856
|
+
if (k.compare(Rational.minusOne) < 0) return this.mkNegated(OP_ATAN, this.mkReal(k.neg()));
|
|
857
|
+
return undefined;
|
|
858
|
+
}
|
|
859
|
+
const negated = manager.getTimesMinusOneArg(arg);
|
|
860
|
+
return negated === undefined ? undefined : this.mkNegated(OP_ATAN, negated);
|
|
861
|
+
}
|
|
862
|
+
|
|
863
|
+
mkHyperbolic(op: number, arg: number) {
|
|
864
|
+
const manager = this.manager;
|
|
865
|
+
const inverse = op === OP_SINH ? OP_ASINH : op === OP_COSH ? OP_ACOSH : OP_ATANH;
|
|
866
|
+
if (manager.getOp(arg) === inverse) return manager.getArg(arg, 0);
|
|
867
|
+
const negated = manager.getTimesMinusOneArg(arg);
|
|
868
|
+
if (negated === undefined) return undefined;
|
|
869
|
+
return op === OP_COSH ? this.mkRealApp(OP_COSH, [negated]) : this.mkNegated(op, negated);
|
|
870
|
+
}
|
|
871
|
+
|
|
373
872
|
mkDiv(left: number, right: number) {
|
|
374
873
|
const manager = this.manager;
|
|
874
|
+
if (
|
|
875
|
+
this.options.isAnumSimp &&
|
|
876
|
+
((manager.isAlgebraicNumeral(left) &&
|
|
877
|
+
(manager.isNumeral(right) || manager.isAlgebraicNumeral(right))) ||
|
|
878
|
+
(manager.isAlgebraicNumeral(right) && manager.isNumeral(left)))
|
|
879
|
+
)
|
|
880
|
+
return this.mkAnumDiv(left, right);
|
|
375
881
|
this.currSort = manager.sorts[left];
|
|
376
882
|
if (!manager.isNumeral(right) || this.getValue(right).isZero()) return undefined;
|
|
377
883
|
const divisor = this.getValue(right);
|
|
@@ -382,7 +888,6 @@ export class ArithRewriter extends PolyRewriter {
|
|
|
382
888
|
);
|
|
383
889
|
}
|
|
384
890
|
|
|
385
|
-
// mk_to_int_core: (to_int (+ 1.0 (to_real x) y)) is (+ 1 x (to_int y)).
|
|
386
891
|
mkToInt(arg: number) {
|
|
387
892
|
const manager = this.manager;
|
|
388
893
|
if (manager.isInt(arg)) return arg;
|
|
@@ -399,20 +904,16 @@ export class ArithRewriter extends PolyRewriter {
|
|
|
399
904
|
else if (manager.getOp(child) === OP_TO_REAL) intArgs.push(manager.getArg(child, 0));
|
|
400
905
|
else realArgs.push(child);
|
|
401
906
|
}
|
|
402
|
-
|
|
403
|
-
const mkSum = (args: number[], sort: number) =>
|
|
404
|
-
args.length === 1 ? args[0] : manager.mkApp(op, args, sort);
|
|
405
|
-
if (realArgs.length === 0) return this.reduce(mkSum(intArgs, SORT_INT), 1);
|
|
907
|
+
if (realArgs.length === 0) return this.reduce(manager.mkApp(op, intArgs, SORT_INT), 1);
|
|
406
908
|
if (intArgs.length === 0 || op !== OP_ADD) return undefined;
|
|
407
|
-
const intSum =
|
|
408
|
-
const realSum =
|
|
909
|
+
const intSum = manager.mkApp(OP_ADD, intArgs, SORT_INT);
|
|
910
|
+
const realSum = manager.mkApp(OP_ADD, realArgs, SORT_REAL);
|
|
409
911
|
return this.reduce(
|
|
410
912
|
manager.mkApp(OP_ADD, [intSum, manager.mkApp(OP_TO_INT, [realSum], SORT_INT)], SORT_INT),
|
|
411
913
|
3,
|
|
412
914
|
);
|
|
413
915
|
}
|
|
414
916
|
|
|
415
|
-
// mk_to_real_core, with push_to_real: to_real distributes over sums and products.
|
|
416
917
|
mkToReal(arg: number) {
|
|
417
918
|
const manager = this.manager;
|
|
418
919
|
if (manager.isNumeral(arg)) return manager.mkRealNumeral(this.getValue(arg));
|
|
@@ -429,8 +930,6 @@ export class ArithRewriter extends PolyRewriter {
|
|
|
429
930
|
);
|
|
430
931
|
}
|
|
431
932
|
|
|
432
|
-
// mk_is_int: a numeral is decided, and a term built from integers by sums and products is an
|
|
433
|
-
// integer. Any other term x is an integer when (to_real (to_int x)) is x.
|
|
434
933
|
mkIsInt(arg: number) {
|
|
435
934
|
const manager = this.manager;
|
|
436
935
|
if (manager.isNumeral(arg))
|
|
@@ -473,9 +972,8 @@ export class ArithRewriter extends PolyRewriter {
|
|
|
473
972
|
else result.push(expr);
|
|
474
973
|
}
|
|
475
974
|
|
|
476
|
-
// is_non_negative, without powers and sequences. It counts each factor's occurrences by scanning
|
|
477
|
-
// the factors, which are few, rather than by sorting them.
|
|
478
975
|
private isNonNegative(expr: number) {
|
|
976
|
+
if (this.isNonNegativeFactor(expr)) return true;
|
|
479
977
|
if (!this.isMul(expr)) return false;
|
|
480
978
|
const factors = this.factors;
|
|
481
979
|
shrink(factors, 0);
|
|
@@ -483,6 +981,7 @@ export class ArithRewriter extends PolyRewriter {
|
|
|
483
981
|
let isNegative = false;
|
|
484
982
|
let numFactors = 0;
|
|
485
983
|
for (const arg of factors) {
|
|
984
|
+
if (this.isNonNegativeFactor(arg)) continue;
|
|
486
985
|
if (!this.manager.isNumeral(arg)) factors[numFactors++] = arg;
|
|
487
986
|
else if (this.getValue(arg).isNegative()) isNegative = !isNegative;
|
|
488
987
|
}
|
|
@@ -502,13 +1001,25 @@ export class ArithRewriter extends PolyRewriter {
|
|
|
502
1001
|
else return false;
|
|
503
1002
|
}
|
|
504
1003
|
if (numOdd === 0) return true;
|
|
505
|
-
// x * (x + 1) >= 0 holds for an integer x, as no integer lies strictly between -1 and 0, but
|
|
506
|
-
// not for a real one.
|
|
507
1004
|
if (numOdd !== 2 || !this.manager.isInt(expr)) return false;
|
|
508
1005
|
return this.isSuccessor(firstOdd, secondOdd) || this.isSuccessor(secondOdd, firstOdd);
|
|
509
1006
|
}
|
|
510
1007
|
|
|
511
|
-
|
|
1008
|
+
private isNonNegativeFactor(expr: number) {
|
|
1009
|
+
const manager = this.manager;
|
|
1010
|
+
const op = manager.getOp(expr);
|
|
1011
|
+
if (op === OP_SEQ_LENGTH) return true;
|
|
1012
|
+
if (op !== OP_POWER) return false;
|
|
1013
|
+
const base = manager.getArg(expr, 0);
|
|
1014
|
+
const exponent = manager.getArg(expr, 1);
|
|
1015
|
+
if (manager.isNumeral(exponent) && manager.isInt(exponent)) {
|
|
1016
|
+
const value = this.getValue(exponent);
|
|
1017
|
+
if (value.isInt() && value.num >= 0n && value.num < 2n ** 32n && value.num % 2n === 0n)
|
|
1018
|
+
return true;
|
|
1019
|
+
}
|
|
1020
|
+
return manager.isNumeral(base) && this.getValue(base).isPositive();
|
|
1021
|
+
}
|
|
1022
|
+
|
|
512
1023
|
private isSuccessor(base: number, sum: number) {
|
|
513
1024
|
if (!this.isAdd(sum)) return false;
|
|
514
1025
|
let offset = Rational.zero;
|
|
@@ -553,7 +1064,6 @@ export class ArithRewriter extends PolyRewriter {
|
|
|
553
1064
|
);
|
|
554
1065
|
}
|
|
555
1066
|
|
|
556
|
-
// is_separated. Like narg, the last negated polynomial lives until is_separated returns.
|
|
557
1067
|
private getSeparated(left: number, right: number, kind: number) {
|
|
558
1068
|
const manager = this.manager;
|
|
559
1069
|
if (kind === KIND_EQ || !this.manager.isNumeral(right)) return undefined;
|
|
@@ -613,7 +1123,6 @@ export class ArithRewriter extends PolyRewriter {
|
|
|
613
1123
|
return this.reduce(manager.mkAnd(atoms), 2);
|
|
614
1124
|
}
|
|
615
1125
|
|
|
616
|
-
// is_bound.
|
|
617
1126
|
private getBound(inputLeft: number, inputRight: number, inputKind: number) {
|
|
618
1127
|
const manager = this.manager;
|
|
619
1128
|
if (
|
|
@@ -658,9 +1167,6 @@ export class ArithRewriter extends PolyRewriter {
|
|
|
658
1167
|
return undefined;
|
|
659
1168
|
}
|
|
660
1169
|
|
|
661
|
-
// div_polynomial: the quotient, with a reference the caller owns, or undefined when a constant is
|
|
662
|
-
// not divisible and the atom is an equality. new_args is an expr_ref_buffer, which Z3 releases
|
|
663
|
-
// first to last as it returns.
|
|
664
1170
|
private dividePolynomial(expr: number, divisor: bigint, rounding: "floor" | "ceil" | "none") {
|
|
665
1171
|
const manager = this.manager;
|
|
666
1172
|
const newArgs: number[] = [];
|
|
@@ -695,8 +1201,6 @@ export class ArithRewriter extends PolyRewriter {
|
|
|
695
1201
|
return quotient;
|
|
696
1202
|
}
|
|
697
1203
|
|
|
698
|
-
// get_coeffs_gcd: the gcd of the coefficients, or 0 when there is no monomial, and the number of
|
|
699
|
-
// non-zero constants.
|
|
700
1204
|
private getCoeffsGcd(expr: number, state: GcdState) {
|
|
701
1205
|
for (let index = 0; index < this.getNumMonomials(expr); index++) {
|
|
702
1206
|
const arg = this.getMonomial(expr, index);
|
|
@@ -721,7 +1225,6 @@ export class ArithRewriter extends PolyRewriter {
|
|
|
721
1225
|
: comparison === 0;
|
|
722
1226
|
}
|
|
723
1227
|
|
|
724
|
-
// mk_le_ge_eq_core. Z3 holds the rewritten sides, new_arg1 and new_arg2, until it returns.
|
|
725
1228
|
private mkLeGeEq(originalLeft: number, originalRight: number, kind: number) {
|
|
726
1229
|
const manager = this.manager;
|
|
727
1230
|
const sides: number[] = [];
|
|
@@ -738,6 +1241,18 @@ export class ArithRewriter extends PolyRewriter {
|
|
|
738
1241
|
): number | Rewrite | undefined {
|
|
739
1242
|
const manager = this.manager;
|
|
740
1243
|
this.currSort = manager.sorts[originalLeft];
|
|
1244
|
+
if (
|
|
1245
|
+
(this.isZero(originalLeft) && this.isReducePowerTarget(originalRight, kind === KIND_EQ)) ||
|
|
1246
|
+
(this.isZero(originalRight) && this.isReducePowerTarget(originalLeft, kind === KIND_EQ))
|
|
1247
|
+
)
|
|
1248
|
+
return this.reduce(
|
|
1249
|
+
this.mkAtom(
|
|
1250
|
+
this.reducePower(originalLeft, kind === KIND_EQ),
|
|
1251
|
+
this.reducePower(originalRight, kind === KIND_EQ),
|
|
1252
|
+
kind,
|
|
1253
|
+
),
|
|
1254
|
+
1,
|
|
1255
|
+
);
|
|
741
1256
|
const setSide = (index: number, expr: number) => {
|
|
742
1257
|
manager.incRef(expr);
|
|
743
1258
|
if (index < sides.length) manager.decRef(sides[index]);
|
|
@@ -755,6 +1270,14 @@ export class ArithRewriter extends PolyRewriter {
|
|
|
755
1270
|
return this.isHolding(this.getValue(left), this.getValue(right), kind)
|
|
756
1271
|
? manager.trueExpr
|
|
757
1272
|
: manager.falseExpr;
|
|
1273
|
+
const leftValue = this.options.isAnumSimp ? this.getAlgebraicValue(left) : undefined;
|
|
1274
|
+
const rightValue = leftValue && this.getAlgebraicValue(right);
|
|
1275
|
+
if (leftValue !== undefined && rightValue !== undefined) {
|
|
1276
|
+
const comparison = manager.am.compare(leftValue, rightValue);
|
|
1277
|
+
const isHolding =
|
|
1278
|
+
kind === KIND_LE ? comparison <= 0 : kind === KIND_GE ? comparison >= 0 : comparison === 0;
|
|
1279
|
+
return isHolding ? manager.trueExpr : manager.falseExpr;
|
|
1280
|
+
}
|
|
758
1281
|
const separated = this.getSeparated(left, right, kind);
|
|
759
1282
|
if (separated !== undefined) return separated;
|
|
760
1283
|
const bound = this.getBound(left, right, kind) ?? this.getBound(right, left, getInverse(kind));
|
|
@@ -791,8 +1314,7 @@ export class ArithRewriter extends PolyRewriter {
|
|
|
791
1314
|
const condition = manager.getArg(left, 0);
|
|
792
1315
|
const rightValue = this.getValue(right);
|
|
793
1316
|
const holds = (value: Rational) => this.isHolding(value, rightValue, kind);
|
|
794
|
-
// Z3 makes the negated condition
|
|
795
|
-
// conjunctions build an equality with arith_util::mk_eq but its disjunctions with m.mk_eq.
|
|
1317
|
+
// Z3 makes the negated condition even when unused, and only its conjunctions use arith_util::mk_eq.
|
|
796
1318
|
const mkConjunct = (other: number) =>
|
|
797
1319
|
kind === KIND_EQ ? this.mkArithEq(other, right) : this.mkAtom(other, right, kind);
|
|
798
1320
|
if (this.manager.isNumeral(manager.getArg(left, 1))) {
|
|
@@ -814,6 +1336,17 @@ export class ArithRewriter extends PolyRewriter {
|
|
|
814
1336
|
);
|
|
815
1337
|
}
|
|
816
1338
|
}
|
|
1339
|
+
if (manager.getOp(left) === OP_ITE && manager.getRefCount(left) === 1) {
|
|
1340
|
+
const thenAtom = this.mkAtom(manager.getArg(left, 1), right, kind);
|
|
1341
|
+
return this.reduce(
|
|
1342
|
+
manager.mkApp(
|
|
1343
|
+
OP_ITE,
|
|
1344
|
+
[manager.getArg(left, 0), thenAtom, this.mkAtom(manager.getArg(left, 2), right, kind)],
|
|
1345
|
+
SORT_BOOL,
|
|
1346
|
+
),
|
|
1347
|
+
2,
|
|
1348
|
+
);
|
|
1349
|
+
}
|
|
817
1350
|
const isToIntRight = manager.getOp(right) === OP_TO_INT && manager.isNumeral(left);
|
|
818
1351
|
const toIntArg =
|
|
819
1352
|
manager.getOp(isToIntRight ? right : left) === OP_TO_INT
|
|
@@ -847,7 +1380,40 @@ export class ArithRewriter extends PolyRewriter {
|
|
|
847
1380
|
return this.factorLeGeEq(left, right, kind);
|
|
848
1381
|
}
|
|
849
1382
|
|
|
850
|
-
|
|
1383
|
+
private getReducedPowerBase(expr: number, isEq: boolean) {
|
|
1384
|
+
const manager = this.manager;
|
|
1385
|
+
if (manager.getOp(expr) !== OP_POWER) return undefined;
|
|
1386
|
+
const exponent = manager.getArg(expr, 1);
|
|
1387
|
+
if (!manager.isNumeral(exponent)) return undefined;
|
|
1388
|
+
const k = this.getValue(exponent);
|
|
1389
|
+
return k.isInt() && k.compare(Rational.of(isEq ? 1n : 2n)) > 0 ? k : undefined;
|
|
1390
|
+
}
|
|
1391
|
+
|
|
1392
|
+
private getFactors(expr: number) {
|
|
1393
|
+
return this.isMul(expr) ? this.manager.getArgs(expr) : [expr];
|
|
1394
|
+
}
|
|
1395
|
+
|
|
1396
|
+
private isReducePowerTarget(expr: number, isEq: boolean) {
|
|
1397
|
+
return this.getFactors(expr).some(
|
|
1398
|
+
(factor) => this.getReducedPowerBase(factor, isEq) !== undefined,
|
|
1399
|
+
);
|
|
1400
|
+
}
|
|
1401
|
+
|
|
1402
|
+
// x^k = 0 has the roots of x, and x^k <= 0 those of x or of x^2 by the parity of k.
|
|
1403
|
+
private reducePower(expr: number, isEq: boolean) {
|
|
1404
|
+
const manager = this.manager;
|
|
1405
|
+
if (this.isZero(expr)) return expr;
|
|
1406
|
+
const factors = this.getFactors(expr).map((factor) => {
|
|
1407
|
+
const k = this.getReducedPowerBase(factor, isEq);
|
|
1408
|
+
if (k === undefined) return factor;
|
|
1409
|
+
const base = manager.getArg(factor, 0);
|
|
1410
|
+
return isEq || getEuclideanMod(k.num, 2n) === 1n
|
|
1411
|
+
? this.ensureReal(base)
|
|
1412
|
+
: this.mkPowerApp(this.ensureReal(base), manager.mkRealNumeral(TWO));
|
|
1413
|
+
});
|
|
1414
|
+
return factors.length === 1 ? factors[0] : manager.mkApp(OP_MUL, factors, SORT_REAL);
|
|
1415
|
+
}
|
|
1416
|
+
|
|
851
1417
|
private factorLeGeEq(left: number, right: number, kind: number) {
|
|
852
1418
|
if (!this.isZero(right)) return undefined;
|
|
853
1419
|
const factor = this.findNlFactor(left);
|
|
@@ -868,7 +1434,6 @@ export class ArithRewriter extends PolyRewriter {
|
|
|
868
1434
|
);
|
|
869
1435
|
}
|
|
870
1436
|
|
|
871
|
-
// arith_util::mk_eq: a numeral goes right, and otherwise the side with the smaller id goes left.
|
|
872
1437
|
private mkArithEq(left: number, right: number) {
|
|
873
1438
|
const manager = this.manager;
|
|
874
1439
|
const isSwapped =
|
|
@@ -881,7 +1446,6 @@ export class ArithRewriter extends PolyRewriter {
|
|
|
881
1446
|
return manager.mkEq(lhs, rhs);
|
|
882
1447
|
}
|
|
883
1448
|
|
|
884
|
-
// find_nl_factor: a factor of the first nonlinear product of a sum that divides every monomial.
|
|
885
1449
|
private findNlFactor(expr: number) {
|
|
886
1450
|
const sum = [expr];
|
|
887
1451
|
for (let index = 0; index < sum.length; index++) {
|
|
@@ -899,7 +1463,6 @@ export class ArithRewriter extends PolyRewriter {
|
|
|
899
1463
|
return undefined;
|
|
900
1464
|
}
|
|
901
1465
|
|
|
902
|
-
// get_nl_muls: the factors of a product that are not numerals.
|
|
903
1466
|
private getNlMuls(expr: number, muls: number[]) {
|
|
904
1467
|
if (this.isMul(expr))
|
|
905
1468
|
for (let index = 0; index < this.manager.getNumArgs(expr); index++)
|
|
@@ -918,7 +1481,6 @@ export class ArithRewriter extends PolyRewriter {
|
|
|
918
1481
|
return this.isMulFactor(factor, expr);
|
|
919
1482
|
}
|
|
920
1483
|
|
|
921
|
-
// remove_factor: the sum or product without one occurrence of the factor in each monomial.
|
|
922
1484
|
private removeNlFactor(factor: number, expr: number): number {
|
|
923
1485
|
const manager = this.manager;
|
|
924
1486
|
const sort = manager.sorts[expr];
|