tla-ts 0.0.10-dev.f16792fed → 0.0.10-dev.f57f64938
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/README.md +2 -1
- package/dist/compile.cjs +6 -6
- package/dist/compile.js +10 -10
- package/dist/deciders.cjs +41 -37
- package/dist/deciders.js +57 -53
- package/dist/index.cjs +1 -1
- package/dist/index.d.cts +3 -0
- package/dist/index.d.ts +3 -0
- package/dist/index.js +1 -1
- package/dist/parallel-worker.cjs +1 -1
- package/dist/parallel-worker.js +1 -1
- package/dist/prove.cjs +2682 -426
- package/dist/prove.js +2681 -425
- package/dist/run.cjs +45 -42
- package/dist/run.js +47 -44
- package/dist/tlapm.cjs +2 -2
- package/dist/tlapm.js +2 -2
- package/dist/transfer.cjs +42 -39
- package/dist/transfer.js +42 -39
- package/dist/worker.cjs +7 -7
- package/dist/worker.js +7 -7
- package/package.json +1 -1
- package/src/ast.ts +41 -36
- package/src/builtins.ts +4 -13
- package/src/check-failure.ts +116 -0
- package/src/check-trace.ts +282 -0
- package/src/check.ts +353 -549
- package/src/cli/options.ts +6 -31
- package/src/cli/shared.ts +1 -1
- package/src/cli/tlapm.ts +433 -70
- package/src/cli/tlc-arguments.ts +222 -210
- package/src/cli/tlc-output.ts +687 -0
- package/src/cli/tlc-usage.ts +1 -2
- package/src/cli/tlc.ts +49 -702
- package/src/cli/xml-exporter.ts +23 -33
- package/src/codegen.ts +5 -10
- package/src/coverage.ts +0 -2
- package/src/dependencies.ts +30 -14
- package/src/dfid.ts +16 -16
- package/src/environment-config.ts +315 -0
- package/src/environment.ts +55 -338
- package/src/errors.ts +33 -5
- package/src/evaluate.ts +5 -4
- package/src/exit-codes.ts +1 -0
- package/src/fingerprints.ts +65 -1
- package/src/instances.ts +47 -10
- package/src/json.ts +4 -7
- package/src/levels.ts +39 -42
- package/src/lexer.ts +5 -3
- package/src/liveness-checker.ts +553 -237
- package/src/liveness.ts +94 -86
- package/src/obligations/action.ts +14 -17
- package/src/obligations/anonymize.ts +37 -16
- package/src/obligations/enabled-axioms.ts +218 -0
- package/src/obligations/equality.ts +1 -3
- package/src/obligations/expression.ts +36 -8
- package/src/obligations/format.ts +0 -2
- package/src/obligations/generate.ts +66 -54
- package/src/obligations/index.ts +38 -8
- package/src/obligations/levels.ts +24 -11
- package/src/obligations/module.ts +28 -41
- package/src/obligations/normalize.ts +26 -14
- package/src/obligations/operators.ts +0 -2
- package/src/obligations/pragma.ts +53 -16
- package/src/obligations/printer.ts +43 -13
- package/src/obligations/proof.ts +3 -2
- package/src/obligations/regroup.ts +0 -2
- package/src/obligations/simplify.ts +55 -50
- package/src/obligations/source.ts +118 -74
- package/src/obligations/subexpression.ts +45 -18
- package/src/obligations/substitution.ts +1 -3
- package/src/obligations/temporal.ts +5 -7
- package/src/obligations/tuples.ts +0 -2
- package/src/parallel-worker.ts +10 -30
- package/src/parallel.ts +24 -47
- package/src/parser.ts +580 -180
- package/src/pretty-print.ts +1 -1
- package/src/prover/decide-pool.ts +3 -3
- package/src/prover/deciders.ts +12 -9
- package/src/prover/isabelle/decide.ts +3 -25
- package/src/prover/isabelle/encode.ts +72 -42
- package/src/prover/isabelle/isar/attrib.ts +250 -0
- package/src/prover/isabelle/isar/context.ts +335 -0
- package/src/prover/isabelle/isar/induct.ts +382 -0
- package/src/prover/isabelle/isar/inner-syntax.ts +158 -7
- package/src/prover/isabelle/isar/method.ts +509 -212
- package/src/prover/isabelle/isar/proof.ts +570 -14
- package/src/prover/isabelle/isar/rule-cases.ts +224 -0
- package/src/prover/isabelle/isar/theory.ts +487 -76
- package/src/prover/isabelle/isar/toplevel.ts +331 -0
- package/src/prover/isabelle/isar/type-check.ts +89 -14
- package/src/prover/isabelle/provers/blast/blast.ts +7 -65
- package/src/prover/isabelle/provers/blast/branch.ts +0 -2
- package/src/prover/isabelle/provers/blast/prove.ts +0 -2
- package/src/prover/isabelle/provers/blast/rules.ts +0 -2
- package/src/prover/isabelle/provers/blast/state.ts +0 -2
- package/src/prover/isabelle/provers/blast/term.ts +0 -2
- package/src/prover/isabelle/provers/clasimp.ts +0 -2
- package/src/prover/isabelle/provers/classical.ts +45 -20
- package/src/prover/isabelle/provers/hypsubst.ts +17 -28
- package/src/prover/isabelle/pure/bicompose.ts +9 -27
- package/src/prover/isabelle/pure/consts.ts +0 -2
- package/src/prover/isabelle/pure/conv.ts +2 -10
- package/src/prover/isabelle/pure/drule.ts +72 -6
- package/src/prover/isabelle/pure/envir.ts +0 -2
- package/src/prover/isabelle/pure/goal.ts +1 -3
- package/src/prover/isabelle/pure/logic.ts +1 -3
- package/src/prover/isabelle/pure/name.ts +0 -2
- package/src/prover/isabelle/pure/net.ts +0 -2
- package/src/prover/isabelle/pure/object-logic.ts +13 -7
- package/src/prover/isabelle/pure/pattern.ts +0 -2
- package/src/prover/isabelle/pure/raw-simplifier.ts +4 -15
- package/src/prover/isabelle/pure/rewriter.ts +6 -17
- package/src/prover/isabelle/pure/search.ts +0 -2
- package/src/prover/isabelle/pure/seq.ts +0 -2
- package/src/prover/isabelle/pure/simplifier.ts +26 -7
- package/src/prover/isabelle/pure/table.ts +2 -3
- package/src/prover/isabelle/pure/tactic.ts +0 -2
- package/src/prover/isabelle/pure/tactical.ts +42 -37
- package/src/prover/isabelle/pure/term-ord.ts +0 -2
- package/src/prover/isabelle/pure/term.ts +0 -2
- package/src/prover/isabelle/pure/thm.ts +14 -13
- package/src/prover/isabelle/pure/type.ts +0 -2
- package/src/prover/isabelle/pure/unify.ts +0 -2
- package/src/prover/isabelle/pure/variable.ts +0 -2
- package/src/prover/isabelle/tla/classical-setup.ts +18 -16
- package/src/prover/isabelle/tla/context.ts +58 -11
- package/src/prover/isabelle/tla/logic-data.ts +1 -1
- package/src/prover/isabelle/tla/logic.ts +49 -21
- package/src/prover/isabelle/tla/simpdata.ts +1 -12
- package/src/prover/isabelle/tools/intuitionistic.ts +28 -12
- package/src/prover/ocaml.ts +4 -1
- package/src/prover/prep/action.ts +30 -31
- package/src/prover/prep/enabled-axioms.ts +11 -2
- package/src/prover/prep/fingerprint.ts +2 -5
- package/src/prover/prep/methods.ts +181 -51
- package/src/prover/prep/normalize.ts +38 -9
- package/src/prover/prove.ts +395 -94
- package/src/prover/ptl/decide.ts +95 -50
- package/src/prover/ptl/encode.ts +2 -3
- package/src/prover/ptl/tableau.ts +28 -2
- package/src/prover/smt/arithmetic.ts +310 -0
- package/src/prover/smt/axioms.ts +12 -8
- package/src/prover/smt/context.ts +43 -8
- package/src/prover/smt/data.ts +498 -379
- package/src/prover/smt/encode.ts +148 -57
- package/src/prover/smt/extensionality.ts +5 -3
- package/src/prover/smt/flatten.ts +4 -6
- package/src/prover/smt/format.ts +28 -4
- package/src/prover/smt/instances.ts +7 -1
- package/src/prover/smt/layout.ts +91 -0
- package/src/prover/smt/rewrite.ts +1021 -618
- package/src/prover/smt/simplify.ts +441 -0
- package/src/prover/smt/solver/ackermannize-bv-tactic.ts +61 -0
- package/src/prover/smt/solver/ackr-helper.ts +179 -0
- package/src/prover/smt/solver/ackr-model-converter.ts +105 -0
- package/src/prover/smt/solver/act-cache.ts +0 -1
- package/src/prover/smt/solver/add-bounds-tactic.ts +59 -0
- package/src/prover/smt/solver/aig-tactic.ts +52 -0
- package/src/prover/smt/solver/aig.ts +889 -0
- package/src/prover/smt/solver/arith-rewriter.ts +613 -6
- package/src/prover/smt/solver/arith-terms.ts +121 -0
- package/src/prover/smt/solver/array-decl-plugin.ts +175 -0
- package/src/prover/smt/solver/array-rewriter.ts +309 -0
- package/src/prover/smt/solver/asserted-formulas.ts +87 -16
- package/src/prover/smt/solver/ast-lt.ts +166 -12
- package/src/prover/smt/solver/ast-util.ts +160 -2
- package/src/prover/smt/solver/ast.ts +1427 -41
- package/src/prover/smt/solver/auf-solver.ts +2 -6
- package/src/prover/smt/solver/bit-blast-tactic.ts +582 -0
- package/src/prover/smt/solver/bit-blaster.ts +871 -0
- package/src/prover/smt/solver/bound-manager.ts +196 -0
- package/src/prover/smt/solver/bound-simplifier.ts +600 -0
- package/src/prover/smt/solver/bv-bound-chk.ts +492 -0
- package/src/prover/smt/solver/bv-decl-plugin.ts +338 -0
- package/src/prover/smt/solver/bv-divrem-bounds.ts +95 -0
- package/src/prover/smt/solver/bv-rewriter.ts +1901 -0
- package/src/prover/smt/solver/bv1-blast.ts +214 -0
- package/src/prover/smt/solver/bv2fpa-converter.ts +174 -0
- package/src/prover/smt/solver/bv2int-rewriter.ts +544 -0
- package/src/prover/smt/solver/bv2real-rewriter.ts +533 -0
- package/src/prover/smt/solver/card2bv.ts +110 -0
- package/src/prover/smt/solver/case-split-queue.ts +0 -2
- package/src/prover/smt/solver/cg-table.ts +39 -25
- package/src/prover/smt/solver/check-logic.ts +330 -0
- package/src/prover/smt/solver/clause.ts +0 -1
- package/src/prover/smt/solver/cofactor-elim-term-ite.ts +278 -0
- package/src/prover/smt/solver/conflict-resolution.ts +78 -2
- package/src/prover/smt/solver/context.ts +516 -115
- package/src/prover/smt/solver/ctx-simplify.ts +20 -10
- package/src/prover/smt/solver/ctx-solver-simplify.ts +122 -0
- package/src/prover/smt/solver/datatype-decl-plugin.ts +572 -0
- package/src/prover/smt/solver/datatype-rewriter.ts +82 -0
- package/src/prover/smt/solver/demodulator.ts +786 -0
- package/src/prover/smt/solver/dependent-expr-state.ts +81 -0
- package/src/prover/smt/solver/der.ts +38 -10
- package/src/prover/smt/solver/diff-neq.ts +206 -0
- package/src/prover/smt/solver/distribute-forall.ts +57 -0
- package/src/prover/smt/solver/dom-simplify.ts +511 -0
- package/src/prover/smt/solver/dt2bv-tactic.ts +260 -0
- package/src/prover/smt/solver/dyn-ack.ts +0 -1
- package/src/prover/smt/solver/e-matching.ts +7 -8
- package/src/prover/smt/solver/elim-small-bv-tactic.ts +129 -0
- package/src/prover/smt/solver/elim-uncnstr.ts +545 -0
- package/src/prover/smt/solver/enode.ts +100 -3
- package/src/prover/smt/solver/eq2bv-tactic.ts +218 -0
- package/src/prover/smt/solver/euf/arith-axioms.ts +403 -0
- package/src/prover/smt/solver/euf/arith-internalize.ts +653 -0
- package/src/prover/smt/solver/euf/arith-solver.ts +889 -0
- package/src/prover/smt/solver/euf/array-axioms.ts +527 -0
- package/src/prover/smt/solver/euf/array-internalize.ts +428 -0
- package/src/prover/smt/solver/euf/array-solver.ts +306 -0
- package/src/prover/smt/solver/euf/bv-ackerman.ts +162 -0
- package/src/prover/smt/solver/euf/bv-internalize.ts +748 -0
- package/src/prover/smt/solver/euf/bv-solver.ts +449 -0
- package/src/prover/smt/solver/euf/dt-solver.ts +618 -0
- package/src/prover/smt/solver/euf/egraph.ts +907 -0
- package/src/prover/smt/solver/euf/euf-solver.ts +1205 -0
- package/src/prover/smt/solver/euf/fpa-solver.ts +317 -0
- package/src/prover/smt/solver/euf/mam.ts +1050 -0
- package/src/prover/smt/solver/euf/q-ematch.ts +830 -0
- package/src/prover/smt/solver/euf/q-mbi.ts +587 -0
- package/src/prover/smt/solver/euf/q-model-fixer.ts +296 -0
- package/src/prover/smt/solver/euf/q-solver.ts +361 -0
- package/src/prover/smt/solver/euf/th-solver.ts +335 -0
- package/src/prover/smt/solver/euf/th-solvers.ts +30 -0
- package/src/prover/smt/solver/expr-ref.ts +0 -1
- package/src/prover/smt/solver/expr-safe-replace.ts +26 -2
- package/src/prover/smt/solver/expr2polynomial.ts +146 -0
- package/src/prover/smt/solver/factor.ts +141 -0
- package/src/prover/smt/solver/fd-solver.ts +265 -0
- package/src/prover/smt/solver/fingerprints.ts +15 -15
- package/src/prover/smt/solver/fix-dl-var.ts +148 -0
- package/src/prover/smt/solver/flat-literals.ts +0 -1
- package/src/prover/smt/solver/fm-tactic.ts +884 -0
- package/src/prover/smt/solver/fpa-decl-plugin.ts +618 -0
- package/src/prover/smt/solver/fpa-rewriter.ts +640 -0
- package/src/prover/smt/solver/fpa2bv-converter.ts +2249 -0
- package/src/prover/smt/solver/fpa2bv-rewriter.ts +348 -0
- package/src/prover/smt/solver/fpa2bv-tactic.ts +73 -0
- package/src/prover/smt/solver/goal.ts +175 -15
- package/src/prover/smt/solver/goal2nlsat.ts +189 -0
- package/src/prover/smt/solver/guard-set.ts +219 -0
- package/src/prover/smt/solver/hash.ts +0 -1
- package/src/prover/smt/solver/hashtable.ts +30 -16
- package/src/prover/smt/solver/inf-eps.ts +63 -0
- package/src/prover/smt/solver/inj-axiom.ts +101 -0
- package/src/prover/smt/solver/internalizer.ts +110 -38
- package/src/prover/smt/solver/lackr.ts +381 -0
- package/src/prover/smt/solver/lbool.ts +0 -1
- package/src/prover/smt/solver/lia2card.ts +268 -0
- package/src/prover/smt/solver/lia2pb.ts +154 -0
- package/src/prover/smt/solver/literal.ts +0 -1
- package/src/prover/smt/solver/logic-tactics.ts +345 -0
- package/src/prover/smt/solver/lp/bound-propagator.ts +0 -1
- package/src/prover/smt/solver/lp/constraints.ts +0 -1
- package/src/prover/smt/solver/lp/containers.ts +0 -1
- package/src/prover/smt/solver/lp/core-solver.ts +18 -3
- package/src/prover/smt/solver/lp/cross-nested.ts +0 -1
- package/src/prover/smt/solver/lp/dep-intervals.ts +0 -3
- package/src/prover/smt/solver/lp/dependency.ts +0 -2
- package/src/prover/smt/solver/lp/dioph-eq.ts +1 -10
- package/src/prover/smt/solver/lp/explanation.ts +0 -1
- package/src/prover/smt/solver/lp/gomory.ts +0 -1
- package/src/prover/smt/solver/lp/hnf-cutter.ts +1 -2
- package/src/prover/smt/solver/lp/hnf.ts +0 -3
- package/src/prover/smt/solver/lp/int-cube.ts +3 -4
- package/src/prover/smt/solver/lp/int-solver.ts +0 -2
- package/src/prover/smt/solver/lp/lar-solver.ts +40 -4
- package/src/prover/smt/solver/lp/lar-term.ts +0 -1
- package/src/prover/smt/solver/lp/lp-settings.ts +0 -1
- package/src/prover/smt/solver/lp/maximize-term.ts +59 -10
- package/src/prover/smt/solver/lp/nex-creator.ts +0 -1
- package/src/prover/smt/solver/lp/nex.ts +0 -1
- package/src/prover/smt/solver/lp/nla-backoff.ts +0 -2
- package/src/prover/smt/solver/lp/nla-basics.ts +0 -2
- package/src/prover/smt/solver/lp/nla-core.ts +42 -11
- package/src/prover/smt/solver/lp/nla-divisions.ts +0 -2
- package/src/prover/smt/solver/lp/nla-emonics.ts +0 -1
- package/src/prover/smt/solver/lp/nla-factorization.ts +0 -1
- package/src/prover/smt/solver/lp/nla-grobner.ts +9 -4
- package/src/prover/smt/solver/lp/nla-horner.ts +0 -2
- package/src/prover/smt/solver/lp/nla-intervals.ts +0 -1
- package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +0 -2
- package/src/prover/smt/solver/lp/nla-monotone.ts +0 -1
- package/src/prover/smt/solver/lp/nla-order.ts +0 -2
- package/src/prover/smt/solver/lp/nla-patcher.ts +0 -1
- package/src/prover/smt/solver/lp/nla-powers.ts +220 -0
- package/src/prover/smt/solver/lp/nla-tangents.ts +0 -2
- package/src/prover/smt/solver/lp/nla-throttle.ts +0 -1
- package/src/prover/smt/solver/lp/nla-transcendentals.ts +324 -0
- package/src/prover/smt/solver/lp/nla-types.ts +0 -2
- package/src/prover/smt/solver/lp/nla-var-eqs.ts +0 -1
- package/src/prover/smt/solver/lp/nra-solver.ts +25 -4
- package/src/prover/smt/solver/lp/numeric-pair.ts +0 -1
- package/src/prover/smt/solver/lp/pdd-interval.ts +0 -1
- package/src/prover/smt/solver/lp/pdd-simplifier.ts +0 -1
- package/src/prover/smt/solver/lp/pdd-solver.ts +0 -2
- package/src/prover/smt/solver/lp/pdd.ts +2 -2
- package/src/prover/smt/solver/lp/random-updater.ts +0 -2
- package/src/prover/smt/solver/lp/static-matrix.ts +0 -1
- package/src/prover/smt/solver/lp/union-find.ts +7 -2
- package/src/prover/smt/solver/macro-finder.ts +530 -0
- package/src/prover/smt/solver/mam-compiler.ts +122 -90
- package/src/prover/smt/solver/mam-interpreter.ts +0 -1
- package/src/prover/smt/solver/max-bv-sharing-tactic.ts +17 -0
- package/src/prover/smt/solver/max-cliques.ts +105 -0
- package/src/prover/smt/solver/maxcore.ts +309 -0
- package/src/prover/smt/solver/maximize-ac-sharing.ts +8 -6
- package/src/prover/smt/solver/maxlex.ts +115 -0
- package/src/prover/smt/solver/maxsmt-base.ts +105 -0
- package/src/prover/smt/solver/maxsmt.ts +92 -0
- package/src/prover/smt/solver/mbp/mbp-arith.ts +467 -0
- package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +101 -0
- package/src/prover/smt/solver/mbp/mbp-plugin.ts +287 -0
- package/src/prover/smt/solver/mbp/mbp-qel.ts +48 -0
- package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +271 -0
- package/src/prover/smt/solver/mbp/mbp-term-graph.ts +606 -0
- package/src/prover/smt/solver/model-based-opt.ts +844 -0
- package/src/prover/smt/solver/model-checker.ts +18 -27
- package/src/prover/smt/solver/model-evaluator.ts +188 -12
- package/src/prover/smt/solver/model-finder.ts +12 -18
- package/src/prover/smt/solver/model-generator.ts +56 -29
- package/src/prover/smt/solver/model-macro-solver.ts +49 -46
- package/src/prover/smt/solver/model-printer.ts +214 -0
- package/src/prover/smt/solver/mpf.ts +711 -0
- package/src/prover/smt/solver/mus.ts +51 -0
- package/src/prover/smt/solver/muz/dl-context.ts +404 -0
- package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +97 -0
- package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +167 -0
- package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +125 -0
- package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +299 -0
- package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +455 -0
- package/src/prover/smt/solver/muz/dl-mk-slice.ts +340 -0
- package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +163 -0
- package/src/prover/smt/solver/muz/dl-rule-set.ts +273 -0
- package/src/prover/smt/solver/muz/dl-rule-transformer.ts +123 -0
- package/src/prover/smt/solver/muz/dl-rule.ts +496 -0
- package/src/prover/smt/solver/muz/hnf.ts +201 -0
- package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +176 -0
- package/src/prover/smt/solver/muz/horn-tactic.ts +201 -0
- package/src/prover/smt/solver/muz/rule-properties.ts +337 -0
- package/src/prover/smt/solver/muz/spacer-context.ts +1406 -0
- package/src/prover/smt/solver/muz/spacer-dl-interface.ts +52 -0
- package/src/prover/smt/solver/muz/spacer-generalizers.ts +241 -0
- package/src/prover/smt/solver/muz/spacer-manager.ts +127 -0
- package/src/prover/smt/solver/muz/spacer-pdr.ts +218 -0
- package/src/prover/smt/solver/muz/spacer-prop-solver.ts +333 -0
- package/src/prover/smt/solver/muz/spacer-util.ts +282 -0
- package/src/prover/smt/solver/muz/substitution.ts +203 -0
- package/src/prover/smt/solver/nla2bv-tactic.ts +285 -0
- package/src/prover/smt/solver/nlqsat.ts +484 -0
- package/src/prover/smt/solver/nlsat/algebraic.ts +125 -12
- package/src/prover/smt/solver/nlsat/atoms.ts +20 -6
- package/src/prover/smt/solver/nlsat/evaluator.ts +0 -1
- package/src/prover/smt/solver/nlsat/explain.ts +63 -23
- package/src/prover/smt/solver/nlsat/interval-set.ts +1 -2
- package/src/prover/smt/solver/nlsat/levelwise.ts +3 -9
- package/src/prover/smt/solver/nlsat/mpbq.ts +45 -1
- package/src/prover/smt/solver/nlsat/polynomial.ts +13 -6
- package/src/prover/smt/solver/nlsat/solver.ts +234 -36
- package/src/prover/smt/solver/nlsat/transcendental-eval.ts +310 -0
- package/src/prover/smt/solver/nlsat/transcendentals.ts +367 -0
- package/src/prover/smt/solver/nlsat/types.ts +0 -2
- package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +1 -4
- package/src/prover/smt/solver/nlsat/upolynomial.ts +0 -2
- package/src/prover/smt/solver/nlsat-tactic.ts +82 -0
- package/src/prover/smt/solver/nnf.ts +105 -23
- package/src/prover/smt/solver/normalize-bounds.ts +53 -0
- package/src/prover/smt/solver/occf.ts +97 -0
- package/src/prover/smt/solver/opt-context.ts +787 -0
- package/src/prover/smt/solver/opt-nlsat.ts +375 -0
- package/src/prover/smt/solver/opt-pareto.ts +282 -0
- package/src/prover/smt/solver/opt-preprocess.ts +101 -0
- package/src/prover/smt/solver/opt-solver.ts +308 -0
- package/src/prover/smt/solver/opt-value.ts +55 -0
- package/src/prover/smt/solver/optsmt.ts +692 -0
- package/src/prover/smt/solver/parallel-tactic.ts +299 -0
- package/src/prover/smt/solver/pattern-inference.ts +19 -11
- package/src/prover/smt/solver/pb-rewriter.ts +284 -0
- package/src/prover/smt/solver/pb2bv-tactic.ts +540 -0
- package/src/prover/smt/solver/poly-rewriter.ts +202 -57
- package/src/prover/smt/solver/probes.ts +512 -0
- package/src/prover/smt/solver/propagate-values.ts +37 -21
- package/src/prover/smt/solver/proto-model.ts +648 -19
- package/src/prover/smt/solver/pull-quant.ts +28 -12
- package/src/prover/smt/solver/purify-arith.ts +632 -0
- package/src/prover/smt/solver/qe-arith-plugin.ts +1098 -0
- package/src/prover/smt/solver/qe-lite-der.ts +2 -3
- package/src/prover/smt/solver/qe-lite-fm.ts +3 -4
- package/src/prover/smt/solver/qe-lite.ts +37 -17
- package/src/prover/smt/solver/qe-mbp.ts +270 -0
- package/src/prover/smt/solver/qe.ts +1498 -0
- package/src/prover/smt/solver/qel.ts +25 -0
- package/src/prover/smt/solver/qi-queue.ts +0 -1
- package/src/prover/smt/solver/qsat.ts +814 -0
- package/src/prover/smt/solver/quant-hoist.ts +196 -0
- package/src/prover/smt/solver/quant-tactics.ts +16 -56
- package/src/prover/smt/solver/quantifier-analyzer.ts +19 -20
- package/src/prover/smt/solver/quantifier-manager.ts +8 -16
- package/src/prover/smt/solver/quasi-macros.ts +243 -0
- package/src/prover/smt/solver/random-gen.ts +0 -1
- package/src/prover/smt/solver/rational.ts +45 -1
- package/src/prover/smt/solver/recfun-decl-plugin.ts +261 -0
- package/src/prover/smt/solver/recfun-rewriter.ts +107 -0
- package/src/prover/smt/solver/reduce-args.ts +225 -0
- package/src/prover/smt/solver/reduce-bv-size.ts +119 -0
- package/src/prover/smt/solver/ref-vector.ts +0 -1
- package/src/prover/smt/solver/relevancy.ts +1 -2
- package/src/prover/smt/solver/rewriter-tpl.ts +77 -10
- package/src/prover/smt/solver/rewriter.ts +475 -36
- package/src/prover/smt/solver/rlimit.ts +25 -2
- package/src/prover/smt/solver/sat/asymm-branch.ts +325 -0
- package/src/prover/smt/solver/sat/big.ts +177 -0
- package/src/prover/smt/solver/sat/clause-use-list.ts +71 -0
- package/src/prover/smt/solver/sat/clause.ts +203 -0
- package/src/prover/smt/solver/sat/cleaner.ts +94 -0
- package/src/prover/smt/solver/sat/config.ts +122 -0
- package/src/prover/smt/solver/sat/consequences.ts +203 -0
- package/src/prover/smt/solver/sat/elim-eqs.ts +142 -0
- package/src/prover/smt/solver/sat/goal2sat.ts +526 -0
- package/src/prover/smt/solver/sat/inc-sat-solver.ts +378 -0
- package/src/prover/smt/solver/sat/model-converter.ts +136 -0
- package/src/prover/smt/solver/sat/pb-constraint.ts +261 -0
- package/src/prover/smt/solver/sat/pb-solver.ts +1577 -0
- package/src/prover/smt/solver/sat/probing.ts +170 -0
- package/src/prover/smt/solver/sat/sat-tactic.ts +43 -0
- package/src/prover/smt/solver/sat/sat2goal.ts +165 -0
- package/src/prover/smt/solver/sat/scc.ts +142 -0
- package/src/prover/smt/solver/sat/simplifier.ts +1618 -0
- package/src/prover/smt/solver/sat/solver.ts +2127 -0
- package/src/prover/smt/solver/sat/var-queue.ts +117 -0
- package/src/prover/smt/solver/sat/watch-list.ts +140 -0
- package/src/prover/smt/solver/search-tree.ts +284 -0
- package/src/prover/smt/solver/seq-axioms.ts +1010 -0
- package/src/prover/smt/solver/seq-decl-plugin.ts +819 -0
- package/src/prover/smt/solver/seq-derive.ts +1301 -0
- package/src/prover/smt/solver/seq-eq-approx.ts +236 -0
- package/src/prover/smt/solver/seq-eq-solver.ts +439 -0
- package/src/prover/smt/solver/seq-factory.ts +89 -0
- package/src/prover/smt/solver/seq-monadic.ts +728 -0
- package/src/prover/smt/solver/seq-range-predicate.ts +235 -0
- package/src/prover/smt/solver/seq-re-rewriter.ts +1170 -0
- package/src/prover/smt/solver/seq-re-util.ts +758 -0
- package/src/prover/smt/solver/seq-regex-bisim.ts +144 -0
- package/src/prover/smt/solver/seq-regex-live.ts +200 -0
- package/src/prover/smt/solver/seq-rewriter.ts +2402 -0
- package/src/prover/smt/solver/seq-skolem.ts +317 -0
- package/src/prover/smt/solver/seq-subset.ts +165 -0
- package/src/prover/smt/solver/seq-view-witness.ts +353 -0
- package/src/prover/smt/solver/smt-consequences.ts +297 -0
- package/src/prover/smt/solver/smt-kernel.ts +83 -0
- package/src/prover/smt/solver/smt-logics.ts +66 -0
- package/src/prover/smt/solver/smt-setup.ts +496 -0
- package/src/prover/smt/solver/smt2-printer.ts +765 -0
- package/src/prover/smt/solver/smtlib-parser.ts +3126 -316
- package/src/prover/smt/solver/smtlib-script.ts +1631 -0
- package/src/prover/smt/solver/solve-eqs.ts +929 -0
- package/src/prover/smt/solver/solver.ts +113 -22
- package/src/prover/smt/solver/static-features.ts +314 -0
- package/src/prover/smt/solver/sticky-generations.ts +0 -1
- package/src/prover/smt/solver/tactic.ts +1986 -0
- package/src/prover/smt/solver/term-enumeration.ts +205 -0
- package/src/prover/smt/solver/theory-array.ts +1240 -0
- package/src/prover/smt/solver/theory-bv.ts +1200 -0
- package/src/prover/smt/solver/theory-char.ts +355 -0
- package/src/prover/smt/solver/theory-datatype.ts +598 -0
- package/src/prover/smt/solver/theory-finite-set.ts +30 -0
- package/src/prover/smt/solver/theory-fpa.ts +389 -0
- package/src/prover/smt/solver/theory-lra-axioms.ts +53 -2
- package/src/prover/smt/solver/theory-lra-bounds.ts +31 -6
- package/src/prover/smt/solver/theory-lra-final-check.ts +56 -70
- package/src/prover/smt/solver/theory-lra-internalize.ts +86 -27
- package/src/prover/smt/solver/theory-lra-model.ts +20 -35
- package/src/prover/smt/solver/theory-lra-propagate.ts +24 -26
- package/src/prover/smt/solver/theory-lra-state.ts +6 -22
- package/src/prover/smt/solver/theory-lra.ts +188 -1
- package/src/prover/smt/solver/theory-pb.ts +934 -0
- package/src/prover/smt/solver/theory-polymorphism.ts +58 -0
- package/src/prover/smt/solver/theory-recfun.ts +307 -0
- package/src/prover/smt/solver/theory-seq-regex.ts +867 -0
- package/src/prover/smt/solver/theory-seq-solve.ts +1373 -0
- package/src/prover/smt/solver/theory-seq-state.ts +871 -0
- package/src/prover/smt/solver/theory-seq.ts +961 -0
- package/src/prover/smt/solver/theory.ts +189 -0
- package/src/prover/smt/solver/tseitin-cnf.ts +485 -0
- package/src/prover/smt/solver/var-subst.ts +36 -14
- package/src/prover/smt/table.ts +3 -2
- package/src/prover/smt/types.ts +146 -0
- package/src/prover/tlapm/cache.ts +50 -19
- package/src/prover/tlapm/tlapm.ts +15 -9
- package/src/prover/tlapm-library.ts +3208 -0
- package/src/prover/verdict.ts +9 -0
- package/src/prover/zenon/check/check.ts +1 -2
- package/src/prover/zenon/check/records.ts +1 -1
- package/src/prover/zenon/check/relations.ts +2 -1
- package/src/prover/zenon/check/rewrites.ts +2 -15
- package/src/prover/zenon/check/sets.ts +40 -58
- package/src/prover/zenon/check/terms.ts +1 -2
- package/src/prover/zenon/decide.ts +10 -7
- package/src/prover/zenon/encode.ts +0 -2
- package/src/prover/zenon/eqrel.ts +2 -2
- package/src/prover/zenon/equality-rules.ts +0 -2
- package/src/prover/zenon/expr.ts +7 -2
- package/src/prover/zenon/index-table.ts +9 -21
- package/src/prover/zenon/isar-case.ts +0 -2
- package/src/prover/zenon/isar.ts +35 -37
- package/src/prover/zenon/llproof.ts +2 -13
- package/src/prover/zenon/mltoll.ts +12 -30
- package/src/prover/zenon/node.ts +20 -5
- package/src/prover/zenon/parse.ts +9 -8
- package/src/prover/zenon/phrase.ts +0 -2
- package/src/prover/zenon/proof.ts +0 -2
- package/src/prover/zenon/propositional-rules.ts +0 -2
- package/src/prover/zenon/rules.ts +0 -2
- package/src/prover/zenon/search.ts +11 -19
- package/src/prover/zenon/tla/functions.ts +2 -4
- package/src/prover/zenon/tla/llproof.ts +9 -13
- package/src/prover/zenon/tla/records.ts +1 -8
- package/src/prover/zenon/tla/rewrites.ts +0 -2
- package/src/prover/zenon/tla/sets.ts +22 -22
- package/src/prover/zenon/tla/terms.ts +0 -2
- package/src/prover/zenon/tla/tla.ts +7 -8
- package/src/resolve.ts +56 -74
- package/src/runtime.ts +4 -0
- package/src/sany/generation.ts +394 -0
- package/src/sany/generator-def-entries.ts +210 -0
- package/src/sany/generator-definitions.ts +686 -0
- package/src/sany/generator-expressions.ts +1100 -0
- package/src/sany/generator-proofs.ts +662 -0
- package/src/sany/generator.ts +155 -2625
- package/src/sany/levels.ts +0 -2
- package/src/sany/lexer.ts +17 -16
- package/src/sany/linter.ts +0 -2
- package/src/sany/nodes.ts +2 -3
- package/src/sany/report.ts +3 -6
- package/src/sany/selectors.ts +35 -38
- package/src/sany/xml.ts +23 -55
- package/src/search.ts +205 -43
- package/src/simulate.ts +157 -133
- package/src/spec-description.ts +33 -48
- package/src/standard-definitions.ts +4 -0
- package/src/standard-modules.ts +16 -32
- package/src/state-graph.ts +0 -2
- package/src/substitution-levels.ts +5 -4
- package/src/successors.ts +6 -8
- package/src/symmetry.ts +2 -2
- package/src/tableau.ts +2 -2
- package/src/tlc/fingerprint.ts +81 -9
- package/src/tlc/messages.ts +20 -15
- package/src/tlc/random.ts +4 -4
- package/src/tlc/replay.ts +8 -15
- package/src/tlc/summary.ts +29 -14
- package/src/tlc/tlc-operators.ts +2 -3
- package/src/tlc/tlcext-operators.ts +44 -12
- package/src/tlc/trace-spec.ts +21 -40
- package/src/typed-tier.ts +6535 -0
- package/src/typescript/actions.ts +2 -4
- package/src/typescript/collections.ts +34 -20
- package/src/typescript/compile.ts +1 -3
- package/src/typescript/formula.ts +5 -3
- package/src/typescript/model.ts +4 -5
- package/src/typescript/steps.ts +20 -18
- package/src/values.ts +62 -152
- package/src/prover/isabelle/isar/statement.ts +0 -52
- package/src/prover/smt/solver/z3-license.txt +0 -10
- package/src/prover/tlaps-module.ts +0 -510
- package/src/prover/zenon/LICENSE +0 -32
|
@@ -1,13 +1,29 @@
|
|
|
1
|
-
// Ported from Z3 (src/ast/rewriter/arith_rewriter.cpp), MIT license, see z3-license.txt.
|
|
2
1
|
import {
|
|
2
|
+
FAMILY_ARITH,
|
|
3
|
+
KIND_APP,
|
|
4
|
+
OP_ACOS,
|
|
5
|
+
OP_ACOSH,
|
|
3
6
|
OP_ADD,
|
|
7
|
+
OP_ASIN,
|
|
8
|
+
OP_ASINH,
|
|
9
|
+
OP_ATAN,
|
|
10
|
+
OP_ATANH,
|
|
11
|
+
OP_COS,
|
|
12
|
+
OP_COSH,
|
|
13
|
+
OP_DIV,
|
|
4
14
|
OP_GE,
|
|
15
|
+
OP_PI,
|
|
16
|
+
OP_POWER,
|
|
17
|
+
OP_SIN,
|
|
18
|
+
OP_SINH,
|
|
19
|
+
OP_TAN,
|
|
5
20
|
OP_IDIV,
|
|
6
21
|
OP_ITE,
|
|
7
22
|
OP_LE,
|
|
8
23
|
OP_LT,
|
|
9
24
|
OP_MOD,
|
|
10
25
|
OP_MUL,
|
|
26
|
+
OP_SEQ_LENGTH,
|
|
11
27
|
OP_SUB,
|
|
12
28
|
OP_TO_INT,
|
|
13
29
|
OP_TO_REAL,
|
|
@@ -20,12 +36,17 @@ import { getEuclideanDiv, getEuclideanMod, getGcd, Rational } from "./rational";
|
|
|
20
36
|
import { type ArithRewriterOptions, PolyRewriter } from "./poly-rewriter";
|
|
21
37
|
import type { Rewrite } from "./rewriter-tpl";
|
|
22
38
|
import { shrink } from "./array";
|
|
39
|
+
import { Anum } from "./nlsat/algebraic";
|
|
23
40
|
|
|
24
41
|
export const KERNEL_ARITH_OPTIONS: ArithRewriterOptions = {
|
|
25
42
|
isSom: true,
|
|
26
43
|
isSortSums: true,
|
|
27
44
|
isArithIneqLhs: true,
|
|
28
45
|
isGcdRounding: true,
|
|
46
|
+
isAnumSimp: true,
|
|
47
|
+
isExpandPower: false,
|
|
48
|
+
isExpandTan: false,
|
|
49
|
+
maxDegree: 64,
|
|
29
50
|
};
|
|
30
51
|
|
|
31
52
|
export const TACTIC_ARITH_OPTIONS: ArithRewriterOptions = {
|
|
@@ -33,6 +54,18 @@ export const TACTIC_ARITH_OPTIONS: ArithRewriterOptions = {
|
|
|
33
54
|
isSortSums: false,
|
|
34
55
|
isArithIneqLhs: false,
|
|
35
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);
|
|
36
69
|
};
|
|
37
70
|
|
|
38
71
|
const getCeilDiv = (dividend: bigint, divisor: bigint) => -getEuclideanDiv(-dividend, divisor);
|
|
@@ -57,6 +90,7 @@ const getInverse = (kind: number) =>
|
|
|
57
90
|
|
|
58
91
|
export class ArithRewriter extends PolyRewriter {
|
|
59
92
|
private factors: number[] = [];
|
|
93
|
+
isEq2Ineq = false;
|
|
60
94
|
|
|
61
95
|
mkLe(left: number, right: number) {
|
|
62
96
|
return this.mkLeGeEq(left, right, KIND_LE);
|
|
@@ -75,6 +109,15 @@ export class ArithRewriter extends PolyRewriter {
|
|
|
75
109
|
}
|
|
76
110
|
|
|
77
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
|
+
);
|
|
78
121
|
if (!this.isArithTerm(left) && !this.isArithTerm(right)) return undefined;
|
|
79
122
|
return this.mkLeGeEq(left, right, KIND_EQ);
|
|
80
123
|
}
|
|
@@ -219,6 +262,31 @@ export class ArithRewriter extends PolyRewriter {
|
|
|
219
262
|
);
|
|
220
263
|
}
|
|
221
264
|
|
|
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
|
+
|
|
222
290
|
mkMod(left: number, right: number) {
|
|
223
291
|
const manager = this.manager;
|
|
224
292
|
this.currSort = SORT_INT;
|
|
@@ -349,8 +417,467 @@ export class ArithRewriter extends PolyRewriter {
|
|
|
349
417
|
);
|
|
350
418
|
}
|
|
351
419
|
|
|
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
|
+
|
|
352
872
|
mkDiv(left: number, right: number) {
|
|
353
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);
|
|
354
881
|
this.currSort = manager.sorts[left];
|
|
355
882
|
if (!manager.isNumeral(right) || this.getValue(right).isZero()) return undefined;
|
|
356
883
|
const divisor = this.getValue(right);
|
|
@@ -377,12 +904,10 @@ export class ArithRewriter extends PolyRewriter {
|
|
|
377
904
|
else if (manager.getOp(child) === OP_TO_REAL) intArgs.push(manager.getArg(child, 0));
|
|
378
905
|
else realArgs.push(child);
|
|
379
906
|
}
|
|
380
|
-
|
|
381
|
-
args.length === 1 ? args[0] : manager.mkApp(op, args, sort);
|
|
382
|
-
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);
|
|
383
908
|
if (intArgs.length === 0 || op !== OP_ADD) return undefined;
|
|
384
|
-
const intSum =
|
|
385
|
-
const realSum =
|
|
909
|
+
const intSum = manager.mkApp(OP_ADD, intArgs, SORT_INT);
|
|
910
|
+
const realSum = manager.mkApp(OP_ADD, realArgs, SORT_REAL);
|
|
386
911
|
return this.reduce(
|
|
387
912
|
manager.mkApp(OP_ADD, [intSum, manager.mkApp(OP_TO_INT, [realSum], SORT_INT)], SORT_INT),
|
|
388
913
|
3,
|
|
@@ -448,6 +973,7 @@ export class ArithRewriter extends PolyRewriter {
|
|
|
448
973
|
}
|
|
449
974
|
|
|
450
975
|
private isNonNegative(expr: number) {
|
|
976
|
+
if (this.isNonNegativeFactor(expr)) return true;
|
|
451
977
|
if (!this.isMul(expr)) return false;
|
|
452
978
|
const factors = this.factors;
|
|
453
979
|
shrink(factors, 0);
|
|
@@ -455,6 +981,7 @@ export class ArithRewriter extends PolyRewriter {
|
|
|
455
981
|
let isNegative = false;
|
|
456
982
|
let numFactors = 0;
|
|
457
983
|
for (const arg of factors) {
|
|
984
|
+
if (this.isNonNegativeFactor(arg)) continue;
|
|
458
985
|
if (!this.manager.isNumeral(arg)) factors[numFactors++] = arg;
|
|
459
986
|
else if (this.getValue(arg).isNegative()) isNegative = !isNegative;
|
|
460
987
|
}
|
|
@@ -478,6 +1005,21 @@ export class ArithRewriter extends PolyRewriter {
|
|
|
478
1005
|
return this.isSuccessor(firstOdd, secondOdd) || this.isSuccessor(secondOdd, firstOdd);
|
|
479
1006
|
}
|
|
480
1007
|
|
|
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
|
+
|
|
481
1023
|
private isSuccessor(base: number, sum: number) {
|
|
482
1024
|
if (!this.isAdd(sum)) return false;
|
|
483
1025
|
let offset = Rational.zero;
|
|
@@ -699,6 +1241,18 @@ export class ArithRewriter extends PolyRewriter {
|
|
|
699
1241
|
): number | Rewrite | undefined {
|
|
700
1242
|
const manager = this.manager;
|
|
701
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
|
+
);
|
|
702
1256
|
const setSide = (index: number, expr: number) => {
|
|
703
1257
|
manager.incRef(expr);
|
|
704
1258
|
if (index < sides.length) manager.decRef(sides[index]);
|
|
@@ -716,6 +1270,14 @@ export class ArithRewriter extends PolyRewriter {
|
|
|
716
1270
|
return this.isHolding(this.getValue(left), this.getValue(right), kind)
|
|
717
1271
|
? manager.trueExpr
|
|
718
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
|
+
}
|
|
719
1281
|
const separated = this.getSeparated(left, right, kind);
|
|
720
1282
|
if (separated !== undefined) return separated;
|
|
721
1283
|
const bound = this.getBound(left, right, kind) ?? this.getBound(right, left, getInverse(kind));
|
|
@@ -774,6 +1336,17 @@ export class ArithRewriter extends PolyRewriter {
|
|
|
774
1336
|
);
|
|
775
1337
|
}
|
|
776
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
|
+
}
|
|
777
1350
|
const isToIntRight = manager.getOp(right) === OP_TO_INT && manager.isNumeral(left);
|
|
778
1351
|
const toIntArg =
|
|
779
1352
|
manager.getOp(isToIntRight ? right : left) === OP_TO_INT
|
|
@@ -807,6 +1380,40 @@ export class ArithRewriter extends PolyRewriter {
|
|
|
807
1380
|
return this.factorLeGeEq(left, right, kind);
|
|
808
1381
|
}
|
|
809
1382
|
|
|
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
|
+
|
|
810
1417
|
private factorLeGeEq(left: number, right: number, kind: number) {
|
|
811
1418
|
if (!this.isZero(right)) return undefined;
|
|
812
1419
|
const factor = this.findNlFactor(left);
|