tla-ts 0.0.9 → 0.0.10-dev.06b481ee0
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 +48 -44
- package/dist/index.cjs +1 -1
- package/dist/index.d.cts +122 -12
- package/dist/index.d.ts +122 -12
- 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 +144 -31
- package/dist/run.js +144 -31
- package/dist/tlapm.cjs +2 -2
- package/dist/tlapm.js +2 -2
- package/dist/transfer.cjs +134 -104
- package/dist/transfer.js +134 -104
- package/dist/worker.cjs +7 -7
- package/dist/worker.js +7 -7
- package/package.json +3 -1
- package/src/ast.ts +56 -60
- package/src/bags.ts +128 -110
- package/src/builtins.ts +31 -77
- package/src/bundled-modules.ts +1 -8
- package/src/check-failure.ts +118 -0
- package/src/check-trace.ts +320 -0
- package/src/check.ts +1156 -888
- package/src/cli/options.ts +12 -32
- package/src/cli/run.ts +0 -2
- package/src/cli/runtime-invariants.ts +100 -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 +701 -0
- package/src/cli/tlc-usage.ts +360 -0
- package/src/cli/tlc.ts +330 -659
- 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 +217 -82
- package/src/config.ts +140 -109
- package/src/coverage.ts +1019 -0
- package/src/dependencies.ts +101 -66
- package/src/dfid.ts +683 -0
- package/src/environment-config.ts +315 -0
- package/src/environment.ts +263 -370
- package/src/errors.ts +107 -57
- package/src/evaluate.ts +898 -369
- package/src/exit-codes.ts +63 -13
- package/src/fingerprints.ts +75 -11
- package/src/index.ts +3 -0
- package/src/instances.ts +137 -22
- package/src/java-hash.ts +21 -0
- package/src/java-overrides.ts +6 -21
- package/src/json-reader.ts +455 -0
- package/src/json.ts +252 -139
- package/src/levels.ts +231 -154
- package/src/lexer.ts +83 -101
- package/src/liveness-checker.ts +743 -322
- package/src/liveness.ts +230 -133
- 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 +39 -20
- package/src/obligations/levels.ts +27 -18
- package/src/obligations/module.ts +28 -55
- package/src/obligations/normalize.ts +31 -41
- package/src/obligations/operators.ts +0 -3
- package/src/obligations/pragma.ts +52 -24
- package/src/obligations/printer.ts +94 -63
- 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 +121 -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 +36 -60
- package/src/parallel.ts +64 -73
- package/src/parser.ts +1184 -531
- 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 +226 -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 +1 -15
- package/src/prover/isabelle/provers/classical.ts +58 -61
- package/src/prover/isabelle/provers/hypsubst.ts +29 -54
- 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 +34 -77
- 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 +4 -47
- 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 +26 -31
- 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 +1021 -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 +626 -56
- 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 +319 -0
- package/src/prover/smt/solver/array.ts +1 -3
- package/src/prover/smt/solver/asserted-formulas.ts +241 -99
- package/src/prover/smt/solver/ast-lt.ts +165 -21
- package/src/prover/smt/solver/ast-util.ts +160 -7
- package/src/prover/smt/solver/ast.ts +1480 -184
- package/src/prover/smt/solver/auf-solver.ts +30 -56
- package/src/prover/smt/solver/bit-blast-tactic.ts +608 -0
- package/src/prover/smt/solver/bit-blaster.ts +871 -0
- package/src/prover/smt/solver/blast-term-ite.ts +47 -0
- package/src/prover/smt/solver/bound-manager.ts +196 -0
- package/src/prover/smt/solver/bound-simplifier.ts +598 -0
- package/src/prover/smt/solver/bv-bound-chk.ts +492 -0
- package/src/prover/smt/solver/bv-decl-plugin.ts +341 -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 +127 -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 +293 -0
- package/src/prover/smt/solver/conflict-resolution.ts +78 -11
- package/src/prover/smt/solver/context.ts +600 -187
- package/src/prover/smt/solver/ctx-simplify.ts +34 -52
- package/src/prover/smt/solver/ctx-solver-simplify.ts +122 -0
- package/src/prover/smt/solver/datatype-decl-plugin.ts +580 -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 +93 -0
- package/src/prover/smt/solver/der.ts +39 -30
- package/src/prover/smt/solver/diff-neq.ts +205 -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 +296 -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-bounds.ts +89 -0
- package/src/prover/smt/solver/elim-small-bv-tactic.ts +129 -0
- package/src/prover/smt/solver/elim-term-ite-tactic.ts +48 -0
- package/src/prover/smt/solver/elim-uncnstr.ts +542 -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 +901 -0
- package/src/prover/smt/solver/euf/euf-solver.ts +1204 -0
- package/src/prover/smt/solver/euf/fpa-solver.ts +317 -0
- package/src/prover/smt/solver/euf/mam.ts +1046 -0
- package/src/prover/smt/solver/euf/q-ematch.ts +829 -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 +328 -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 +271 -0
- package/src/prover/smt/solver/factor.ts +163 -0
- package/src/prover/smt/solver/fd-solver.ts +734 -0
- package/src/prover/smt/solver/fingerprints.ts +15 -26
- package/src/prover/smt/solver/fix-dl-var.ts +147 -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 +639 -0
- package/src/prover/smt/solver/fpa2bv-converter.ts +2251 -0
- package/src/prover/smt/solver/fpa2bv-rewriter.ts +349 -0
- package/src/prover/smt/solver/fpa2bv-tactic.ts +73 -0
- package/src/prover/smt/solver/goal.ts +179 -28
- package/src/prover/smt/solver/goal2nlsat.ts +216 -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 +30 -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 +113 -133
- 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 +355 -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 +18 -31
- package/src/prover/smt/solver/lp/core-solver.ts +35 -37
- package/src/prover/smt/solver/lp/cross-nested.ts +4 -21
- 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 +70 -83
- package/src/prover/smt/solver/lp/lar-term.ts +0 -5
- package/src/prover/smt/solver/lp/lp-settings.ts +6 -16
- package/src/prover/smt/solver/lp/maximize-term.ts +76 -52
- package/src/prover/smt/solver/lp/nex-creator.ts +7 -30
- package/src/prover/smt/solver/lp/nex.ts +2 -7
- 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 +92 -136
- 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 +177 -149
- 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 +164 -147
- package/src/prover/smt/solver/lp/numeric-pair.ts +0 -4
- package/src/prover/smt/solver/lp/pdd-interval.ts +6 -5
- package/src/prover/smt/solver/lp/pdd-simplifier.ts +61 -34
- package/src/prover/smt/solver/lp/pdd-solver.ts +74 -72
- package/src/prover/smt/solver/lp/pdd.ts +730 -358
- 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 +310 -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 +106 -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 +20 -63
- package/src/prover/smt/solver/model-evaluator.ts +192 -40
- package/src/prover/smt/solver/model-finder.ts +14 -32
- package/src/prover/smt/solver/model-generator.ts +104 -46
- 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 +709 -0
- package/src/prover/smt/solver/mus.ts +50 -0
- package/src/prover/smt/solver/muz/dl-context.ts +382 -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 +495 -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 +214 -0
- package/src/prover/smt/solver/muz/rule-properties.ts +359 -0
- package/src/prover/smt/solver/muz/spacer-context.ts +1404 -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 +219 -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 +357 -236
- package/src/prover/smt/solver/nlsat/atoms.ts +73 -54
- package/src/prover/smt/solver/nlsat/evaluator.ts +16 -22
- package/src/prover/smt/solver/nlsat/explain.ts +429 -275
- package/src/prover/smt/solver/nlsat/interval-set.ts +9 -51
- package/src/prover/smt/solver/nlsat/levelwise.ts +477 -344
- package/src/prover/smt/solver/nlsat/mpbq.ts +47 -14
- package/src/prover/smt/solver/nlsat/polynomial.ts +2385 -832
- package/src/prover/smt/solver/nlsat/solver.ts +297 -156
- package/src/prover/smt/solver/nlsat/transcendental-eval.ts +310 -0
- package/src/prover/smt/solver/nlsat/transcendentals.ts +391 -0
- package/src/prover/smt/solver/nlsat/types.ts +0 -9
- package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +9 -51
- package/src/prover/smt/solver/nlsat/upolynomial.ts +49 -109
- package/src/prover/smt/solver/nlsat-tactic.ts +82 -0
- package/src/prover/smt/solver/nnf.ts +112 -61
- 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 +801 -0
- package/src/prover/smt/solver/opt-nlsat.ts +386 -0
- package/src/prover/smt/solver/opt-pareto.ts +301 -0
- package/src/prover/smt/solver/opt-preprocess.ts +101 -0
- package/src/prover/smt/solver/opt-solver.ts +312 -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 +281 -0
- package/src/prover/smt/solver/pb2bv-tactic.ts +540 -0
- package/src/prover/smt/solver/poly-rewriter.ts +261 -79
- package/src/prover/smt/solver/probes.ts +577 -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/push-app-ite.ts +37 -0
- package/src/prover/smt/solver/qe-arith-plugin.ts +1096 -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 +41 -51
- package/src/prover/smt/solver/qe-mbp.ts +270 -0
- package/src/prover/smt/solver/qe.ts +1499 -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 +829 -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 +22 -32
- 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 +262 -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 +59 -135
- package/src/prover/smt/solver/rewriter.ts +507 -144
- package/src/prover/smt/solver/rlimit.ts +46 -24
- 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 +579 -0
- package/src/prover/smt/solver/sat/inc-sat-solver.ts +464 -0
- package/src/prover/smt/solver/sat/model-converter.ts +136 -0
- package/src/prover/smt/solver/sat/pb-constraint.ts +268 -0
- package/src/prover/smt/solver/sat/pb-solver.ts +1596 -0
- package/src/prover/smt/solver/sat/probing.ts +170 -0
- package/src/prover/smt/solver/sat/sat-tactic.ts +53 -0
- package/src/prover/smt/solver/sat/sat2goal.ts +189 -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 +2107 -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 +995 -0
- package/src/prover/smt/solver/seq-decl-plugin.ts +819 -0
- package/src/prover/smt/solver/seq-derive.ts +1298 -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 +730 -0
- package/src/prover/smt/solver/seq-range-predicate.ts +235 -0
- package/src/prover/smt/solver/seq-re-rewriter.ts +1171 -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 +2404 -0
- package/src/prover/smt/solver/seq-skolem.ts +294 -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 +124 -0
- package/src/prover/smt/solver/smt-logics.ts +66 -0
- package/src/prover/smt/solver/smt-setup.ts +589 -0
- package/src/prover/smt/solver/smt2-printer.ts +765 -0
- package/src/prover/smt/solver/smtlib-parser.ts +3546 -406
- package/src/prover/smt/solver/smtlib-script.ts +2134 -0
- package/src/prover/smt/solver/solve-eqs.ts +928 -0
- package/src/prover/smt/solver/solver.ts +135 -40
- 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 +2141 -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 +1210 -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 +60 -91
- package/src/prover/smt/solver/theory-lra-internalize.ts +96 -53
- package/src/prover/smt/solver/theory-lra-model.ts +23 -53
- package/src/prover/smt/solver/theory-lra-propagate.ts +34 -42
- package/src/prover/smt/solver/theory-lra-state.ts +7 -28
- package/src/prover/smt/solver/theory-lra.ts +189 -9
- package/src/prover/smt/solver/theory-pb.ts +951 -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 +852 -0
- package/src/prover/smt/solver/theory-seq.ts +961 -0
- package/src/prover/smt/solver/theory-without-terms.ts +24 -0
- package/src/prover/smt/solver/theory.ts +189 -0
- package/src/prover/smt/solver/tseitin-cnf.ts +486 -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 +74 -48
- 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 +24 -6
- package/src/prover/zenon/expr.ts +29 -28
- package/src/prover/zenon/index-table.ts +33 -61
- package/src/prover/zenon/isar-case.ts +9 -21
- package/src/prover/zenon/isar.ts +37 -67
- 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 +2 -14
- package/src/prover/zenon/proof.ts +0 -11
- package/src/prover/zenon/propositional-rules.ts +0 -7
- package/src/prover/zenon/rules.ts +3 -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 +1132 -430
- package/src/runtime.ts +33 -23
- package/src/sany/builtins.ts +11 -14
- package/src/sany/generation.ts +383 -0
- package/src/sany/generator-def-entries.ts +210 -0
- package/src/sany/generator-definitions.ts +688 -0
- package/src/sany/generator-expressions.ts +1108 -0
- package/src/sany/generator-proofs.ts +665 -0
- package/src/sany/generator.ts +192 -2764
- package/src/sany/levels.ts +5 -35
- package/src/sany/lexer.ts +61 -80
- package/src/sany/linter.ts +0 -10
- package/src/sany/modules.ts +5 -7
- package/src/sany/nodes.ts +6 -44
- package/src/sany/parse-error.ts +39 -117
- package/src/sany/report.ts +32 -69
- package/src/sany/selectors.ts +60 -82
- package/src/sany/source.ts +1 -17
- package/src/sany/xml.ts +37 -120
- package/src/search.ts +913 -227
- package/src/simulate.ts +765 -0
- package/src/spec-description.ts +198 -104
- package/src/standard-definitions.ts +4 -4
- package/src/standard-modules.ts +302 -99
- package/src/state-graph.ts +52 -33
- package/src/subexpressions.ts +578 -166
- package/src/substitution-levels.ts +7 -7
- package/src/successors.ts +299 -108
- package/src/symmetry.ts +37 -28
- package/src/tableau.ts +29 -26
- package/src/tlc/fingerprint.ts +267 -79
- package/src/tlc/jar-data.ts +122 -6
- package/src/tlc/messages.ts +127 -56
- package/src/tlc/order.ts +53 -72
- package/src/tlc/random.ts +38 -49
- package/src/tlc/replay.ts +579 -230
- package/src/tlc/summary.ts +64 -60
- package/src/tlc/tlc-operators.ts +83 -47
- package/src/tlc/tlcext-operators.ts +205 -127
- package/src/tlc/trace-spec.ts +235 -0
- package/src/tlc/value-stream.ts +139 -0
- package/src/tlc/version.ts +1 -4
- package/src/trace-liveness.ts +529 -0
- package/src/transfer.ts +22 -25
- package/src/typed-tier.ts +6556 -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 +945 -526
- 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,45 +1,32 @@
|
|
|
1
|
-
// Ported from Z3 (src/nlsat/levelwise.cpp, src/nlsat/nlsat_common.cpp,
|
|
2
|
-
// src/util/index_sort_with_mutations.h), MIT license, see z3-license.txt. The levelwise single cell
|
|
3
|
-
// construction: around the sample, for each variable below the top one, the interval of root
|
|
4
|
-
// functions in which the projected polynomials keep their signs and orders.
|
|
5
|
-
//
|
|
6
|
-
// Deviation: Z3 breaks two ties by polynomial id: between root functions of equal value and degree,
|
|
7
|
-
// and in the order of the arguments of a top-level resultant. Z3 recycles the ids of freed
|
|
8
|
-
// polynomials (id_gen in polynomial.cpp), so its ids depend on its reference counting. Here ids
|
|
9
|
-
// follow creation order. Either choice bounds a valid cell, but the bounding polynomial can be a
|
|
10
|
-
// different one with the same root, such as x0 for -x0. Differential tests count these as ties.
|
|
11
1
|
import { NlsatUnsupportedError } from "../../../../errors";
|
|
12
2
|
import { Rational } from "../rational";
|
|
13
|
-
import type
|
|
3
|
+
import { type AlgebraicManager, type Anum, mergeSortIndices } from "./algebraic";
|
|
14
4
|
import {
|
|
15
5
|
NULL_VAR,
|
|
16
6
|
type Polynomial,
|
|
17
7
|
type PolynomialCache,
|
|
18
8
|
type PolynomialManager,
|
|
9
|
+
PolynomialRef,
|
|
10
|
+
PolynomialRefVector,
|
|
19
11
|
} from "./polynomial";
|
|
20
12
|
|
|
21
|
-
|
|
22
|
-
|
|
23
|
-
|
|
24
|
-
|
|
25
|
-
|
|
26
|
-
|
|
27
|
-
upper: Polynomial | null;
|
|
28
|
-
upperIndex: number;
|
|
29
|
-
}
|
|
13
|
+
export class CellInterval {
|
|
14
|
+
isSection = false;
|
|
15
|
+
readonly lower: PolynomialRef;
|
|
16
|
+
lowerIndex = 0;
|
|
17
|
+
readonly upper: PolynomialRef;
|
|
18
|
+
upperIndex = 0;
|
|
30
19
|
|
|
31
|
-
|
|
32
|
-
|
|
33
|
-
|
|
34
|
-
|
|
35
|
-
isWitnessSubsDisc: boolean;
|
|
36
|
-
}
|
|
20
|
+
constructor(pm: PolynomialManager) {
|
|
21
|
+
this.lower = new PolynomialRef(pm);
|
|
22
|
+
this.upper = new PolynomialRef(pm);
|
|
23
|
+
}
|
|
37
24
|
|
|
38
|
-
|
|
39
|
-
|
|
40
|
-
|
|
41
|
-
|
|
42
|
-
}
|
|
25
|
+
release() {
|
|
26
|
+
this.upper.reset();
|
|
27
|
+
this.lower.reset();
|
|
28
|
+
}
|
|
29
|
+
}
|
|
43
30
|
|
|
44
31
|
interface RootFunction {
|
|
45
32
|
value: Anum;
|
|
@@ -51,137 +38,122 @@ interface RootFunction {
|
|
|
51
38
|
type ProjectionMode = "section" | "sector" | "spanningTree";
|
|
52
39
|
|
|
53
40
|
const UNSET = -1;
|
|
54
|
-
// m_side_mask: bit 0 for a root at or below the sample, bit 1 above, 3 for both.
|
|
55
41
|
const BOTH_SIDES = 3;
|
|
42
|
+
const SPANNING_TREE_THRESHOLD = 4;
|
|
56
43
|
|
|
57
|
-
|
|
58
|
-
|
|
59
|
-
const sortIndicesStably = (count: number, isLess: (first: number, second: number) => boolean) => {
|
|
60
|
-
let source = Array.from({ length: count }, (_, index) => index);
|
|
61
|
-
for (let width = 1; width < count; width *= 2) {
|
|
62
|
-
const target: number[] = [];
|
|
63
|
-
for (let low = 0; low < count; low += 2 * width) {
|
|
64
|
-
const middle = Math.min(low + width, count);
|
|
65
|
-
const high = Math.min(low + 2 * width, count);
|
|
66
|
-
let left = low;
|
|
67
|
-
let right = middle;
|
|
68
|
-
while (left < middle && right < high)
|
|
69
|
-
target.push(isLess(source[right], source[left]) ? source[right++] : source[left++]);
|
|
70
|
-
while (left < middle) target.push(source[left++]);
|
|
71
|
-
while (right < high) target.push(source[right++]);
|
|
72
|
-
}
|
|
73
|
-
source = target;
|
|
74
|
-
}
|
|
75
|
-
return source;
|
|
44
|
+
export const releaseIntervals = (intervals: readonly CellInterval[]) => {
|
|
45
|
+
for (let index = intervals.length; index-- > 0;) intervals[index].release();
|
|
76
46
|
};
|
|
77
47
|
|
|
78
|
-
// todo_set with canonicalization: the distinct primitive, sign-normalized polynomials still to
|
|
79
|
-
// project, in insertion order. A polynomial already in the cache goes in as it is.
|
|
80
48
|
export class TodoSet {
|
|
81
|
-
|
|
82
|
-
private inSet =
|
|
49
|
+
readonly set: PolynomialRefVector;
|
|
50
|
+
private inSet: boolean[] = [];
|
|
83
51
|
|
|
84
52
|
constructor(
|
|
85
|
-
private pm: PolynomialManager,
|
|
86
53
|
private cache: PolynomialCache,
|
|
87
|
-
|
|
54
|
+
private isCanonicalizing: boolean,
|
|
55
|
+
) {
|
|
56
|
+
this.set = new PolynomialRefVector(cache.pm);
|
|
57
|
+
}
|
|
88
58
|
|
|
89
59
|
get isEmpty() {
|
|
90
|
-
return this.
|
|
60
|
+
return this.set.size === 0;
|
|
91
61
|
}
|
|
92
62
|
|
|
93
63
|
reset() {
|
|
94
|
-
this.
|
|
95
|
-
this.
|
|
96
|
-
}
|
|
97
|
-
|
|
98
|
-
contains(polynomial: Polynomial) {
|
|
99
|
-
return this.inSet.has(polynomial.id);
|
|
64
|
+
for (const polynomial of this.set.items) this.inSet[polynomial.id] = false;
|
|
65
|
+
this.set.reset();
|
|
100
66
|
}
|
|
101
67
|
|
|
102
68
|
insert(polynomial: Polynomial) {
|
|
103
|
-
|
|
69
|
+
const pm = this.cache.pm;
|
|
70
|
+
if (this.inSet[polynomial.id] === true) return polynomial;
|
|
104
71
|
if (this.cache.contains(polynomial)) {
|
|
105
|
-
this.inSet
|
|
106
|
-
this.
|
|
72
|
+
this.inSet[polynomial.id] = true;
|
|
73
|
+
this.set.push(polynomial);
|
|
107
74
|
return polynomial;
|
|
108
75
|
}
|
|
109
|
-
const
|
|
110
|
-
|
|
111
|
-
|
|
112
|
-
|
|
113
|
-
|
|
114
|
-
|
|
115
|
-
|
|
116
|
-
|
|
76
|
+
const pinned = new PolynomialRef(pm);
|
|
77
|
+
let p = polynomial;
|
|
78
|
+
if (this.isCanonicalizing) {
|
|
79
|
+
if (!pm.isZero(p) && !pm.isConst(p)) {
|
|
80
|
+
pinned.move(pm.pp(p, pm.maxVar(p)));
|
|
81
|
+
p = pinned.get();
|
|
82
|
+
} else pinned.set(p);
|
|
83
|
+
p = pm.flipSignIfLmNeg(p);
|
|
84
|
+
pinned.set(p);
|
|
117
85
|
}
|
|
118
|
-
|
|
86
|
+
p = this.cache.mkUnique(p);
|
|
87
|
+
if (this.inSet[p.id] !== true) {
|
|
88
|
+
this.inSet[p.id] = true;
|
|
89
|
+
this.set.push(p);
|
|
90
|
+
}
|
|
91
|
+
pinned.reset();
|
|
92
|
+
return p;
|
|
119
93
|
}
|
|
120
94
|
|
|
121
95
|
getMaxVar() {
|
|
122
|
-
|
|
123
|
-
for (const polynomial of this.polynomials) {
|
|
124
|
-
const variable = this.pm.maxVar(polynomial);
|
|
125
|
-
if (result === NULL_VAR || variable > result) result = variable;
|
|
126
|
-
}
|
|
127
|
-
return result;
|
|
96
|
+
return this.cache.pm.getMaxVarOfPolys(this.set.items);
|
|
128
97
|
}
|
|
129
98
|
|
|
130
|
-
|
|
131
|
-
|
|
132
|
-
out.length = 0;
|
|
99
|
+
extractMaxPolys(out: PolynomialRefVector) {
|
|
100
|
+
out.reset();
|
|
133
101
|
const variable = this.getMaxVar();
|
|
134
102
|
this.extractPolysAtLevel(variable, out);
|
|
135
103
|
return variable;
|
|
136
104
|
}
|
|
137
105
|
|
|
138
|
-
|
|
139
|
-
|
|
140
|
-
|
|
141
|
-
for (
|
|
142
|
-
|
|
143
|
-
|
|
144
|
-
|
|
145
|
-
|
|
146
|
-
|
|
147
|
-
this.inSet.delete(polynomial.id);
|
|
106
|
+
extractPolysAtLevel(variable: number, out: PolynomialRefVector) {
|
|
107
|
+
const pm = this.cache.pm;
|
|
108
|
+
let kept = 0;
|
|
109
|
+
for (let index = 0; index < this.set.size; index++) {
|
|
110
|
+
const polynomial = this.set.get(index);
|
|
111
|
+
if (pm.maxVar(polynomial) === variable) {
|
|
112
|
+
out.push(polynomial);
|
|
113
|
+
this.inSet[polynomial.id] = false;
|
|
114
|
+
} else this.set.set(kept++, polynomial);
|
|
148
115
|
}
|
|
149
|
-
this.
|
|
116
|
+
this.set.shrink(kept);
|
|
150
117
|
}
|
|
151
118
|
}
|
|
152
119
|
|
|
153
|
-
class Levelwise {
|
|
154
|
-
|
|
155
|
-
private todo: TodoSet;
|
|
120
|
+
export class Levelwise {
|
|
121
|
+
readonly intervals: CellInterval[] = [];
|
|
156
122
|
private level = 0;
|
|
157
|
-
private levelPolys: Polynomial[] = [];
|
|
158
|
-
private witnesses: (Polynomial | null)[] = [];
|
|
159
|
-
private hasRoots: boolean[] = [];
|
|
160
|
-
private rootFunctions: RootFunction[] = [];
|
|
161
|
-
// m_rel.m_pairs: pairs of levelPolys indices, smaller first, iterated in order.
|
|
162
|
-
private pairs = new Map<string, [number, number]>();
|
|
163
|
-
private sideMask: number[] = [];
|
|
164
|
-
private isLcOmitted: boolean[] = [];
|
|
165
123
|
private lowerRf = UNSET;
|
|
166
124
|
private upperRf = UNSET;
|
|
125
|
+
private todo: TodoSet;
|
|
126
|
+
private levelPs: PolynomialRefVector;
|
|
127
|
+
private witnesses: PolynomialRef[] = [];
|
|
128
|
+
private polyHasRoots: boolean[] = [];
|
|
129
|
+
private pscTmp: PolynomialRefVector;
|
|
130
|
+
private sideMask: number[] = [];
|
|
131
|
+
private isLcOmitted: boolean[] = [];
|
|
132
|
+
private degInOrderGraph: number[] = [];
|
|
133
|
+
private rootFunctions: RootFunction[] = [];
|
|
134
|
+
private pairs = new Map<string, [number, number]>();
|
|
167
135
|
|
|
168
136
|
constructor(
|
|
169
137
|
private pm: PolynomialManager,
|
|
170
138
|
private am: AlgebraicManager,
|
|
171
139
|
private cache: PolynomialCache,
|
|
172
|
-
private
|
|
140
|
+
private polynomials: PolynomialRefVector,
|
|
173
141
|
private maxVar: number,
|
|
142
|
+
private sample: readonly (Anum | undefined)[],
|
|
174
143
|
private isLinear: boolean,
|
|
175
|
-
private params: LevelwiseParams,
|
|
176
144
|
) {
|
|
177
|
-
this.todo = new TodoSet(
|
|
178
|
-
this.
|
|
179
|
-
|
|
180
|
-
|
|
181
|
-
|
|
182
|
-
|
|
183
|
-
|
|
184
|
-
|
|
145
|
+
this.todo = new TodoSet(cache, true);
|
|
146
|
+
this.levelPs = new PolynomialRefVector(pm);
|
|
147
|
+
this.pscTmp = new PolynomialRefVector(pm);
|
|
148
|
+
for (let index = 0; index < maxVar; index++) this.intervals.push(new CellInterval(pm));
|
|
149
|
+
}
|
|
150
|
+
|
|
151
|
+
release() {
|
|
152
|
+
this.pscTmp.reset();
|
|
153
|
+
this.clearWitnesses();
|
|
154
|
+
this.levelPs.reset();
|
|
155
|
+
this.todo.set.reset();
|
|
156
|
+
releaseIntervals(this.intervals);
|
|
185
157
|
}
|
|
186
158
|
|
|
187
159
|
private getSign(polynomial: Polynomial) {
|
|
@@ -192,103 +164,200 @@ class Levelwise {
|
|
|
192
164
|
return this.sample.map((value, index) => (index === variable ? undefined : value));
|
|
193
165
|
}
|
|
194
166
|
|
|
195
|
-
private
|
|
196
|
-
|
|
197
|
-
|
|
198
|
-
|
|
199
|
-
|
|
200
|
-
|
|
201
|
-
|
|
202
|
-
|
|
203
|
-
for (
|
|
204
|
-
|
|
205
|
-
|
|
206
|
-
|
|
207
|
-
|
|
208
|
-
|
|
209
|
-
|
|
210
|
-
|
|
211
|
-
|
|
212
|
-
|
|
213
|
-
|
|
214
|
-
|
|
215
|
-
|
|
216
|
-
|
|
217
|
-
|
|
218
|
-
|
|
219
|
-
|
|
220
|
-
|
|
221
|
-
|
|
222
|
-
|
|
223
|
-
|
|
224
|
-
|
|
225
|
-
|
|
226
|
-
|
|
227
|
-
|
|
228
|
-
if (
|
|
229
|
-
|
|
230
|
-
|
|
231
|
-
|
|
232
|
-
|
|
167
|
+
private clearWitnesses() {
|
|
168
|
+
for (let index = this.witnesses.length; index-- > 0;) this.witnesses[index].reset();
|
|
169
|
+
this.witnesses = [];
|
|
170
|
+
}
|
|
171
|
+
|
|
172
|
+
private handleNullifiedPoly(p: Polynomial) {
|
|
173
|
+
const pm = this.pm;
|
|
174
|
+
const degree = pm.degree(p, this.level);
|
|
175
|
+
for (let power = 0; power <= degree; power++) {
|
|
176
|
+
const coeff = new PolynomialRef(pm);
|
|
177
|
+
coeff.set(pm.coeff(p, this.level, power));
|
|
178
|
+
if (!pm.isZero(coeff.get()) && !pm.isConst(coeff.get())) this.requestFactorized(coeff.get());
|
|
179
|
+
coeff.reset();
|
|
180
|
+
}
|
|
181
|
+
let curPolys = new PolynomialRefVector(pm);
|
|
182
|
+
let curMinVar: number[] = [];
|
|
183
|
+
curPolys.push(p);
|
|
184
|
+
curMinVar.push(0);
|
|
185
|
+
while (curPolys.size > 0) {
|
|
186
|
+
const nextPolys = new PolynomialRefVector(pm);
|
|
187
|
+
const nextMinVar: number[] = [];
|
|
188
|
+
for (let index = 0; index < curPolys.size; index++) {
|
|
189
|
+
const q = new PolynomialRef(pm);
|
|
190
|
+
q.set(curPolys.get(index));
|
|
191
|
+
const maxVar = pm.maxVar(q.get());
|
|
192
|
+
if (maxVar === NULL_VAR) {
|
|
193
|
+
q.reset();
|
|
194
|
+
continue;
|
|
195
|
+
}
|
|
196
|
+
for (let x = curMinVar[index]; x <= maxVar; x++) {
|
|
197
|
+
if (pm.degree(q.get(), x) === 0) continue;
|
|
198
|
+
const dq = new PolynomialRef(pm);
|
|
199
|
+
dq.set(pm.derivative(q.get(), x));
|
|
200
|
+
if (pm.isZero(dq.get()) || pm.isConst(dq.get())) {
|
|
201
|
+
dq.reset();
|
|
202
|
+
continue;
|
|
203
|
+
}
|
|
204
|
+
if (this.getSign(dq.get()) !== 0) {
|
|
205
|
+
this.requestFactorized(dq.get());
|
|
206
|
+
dq.reset();
|
|
207
|
+
q.reset();
|
|
208
|
+
nextPolys.reset();
|
|
209
|
+
curPolys.reset();
|
|
233
210
|
return;
|
|
234
211
|
}
|
|
235
|
-
|
|
212
|
+
nextPolys.push(dq.get());
|
|
213
|
+
nextMinVar.push(x);
|
|
214
|
+
dq.reset();
|
|
236
215
|
}
|
|
216
|
+
q.reset();
|
|
237
217
|
}
|
|
238
|
-
for (
|
|
239
|
-
|
|
218
|
+
for (let index = 0; index < nextPolys.size; index++) {
|
|
219
|
+
const dq = new PolynomialRef(pm);
|
|
220
|
+
dq.set(nextPolys.get(index));
|
|
221
|
+
this.requestFactorized(dq.get());
|
|
222
|
+
dq.reset();
|
|
223
|
+
}
|
|
224
|
+
curPolys.reset();
|
|
225
|
+
curPolys = nextPolys;
|
|
226
|
+
curMinVar = nextMinVar;
|
|
240
227
|
}
|
|
241
228
|
}
|
|
242
229
|
|
|
243
|
-
|
|
244
|
-
|
|
245
|
-
|
|
246
|
-
|
|
230
|
+
private resetInterval(interval: CellInterval) {
|
|
231
|
+
interval.isSection = false;
|
|
232
|
+
interval.lower.reset();
|
|
233
|
+
interval.upper.reset();
|
|
234
|
+
interval.lowerIndex = 0;
|
|
235
|
+
interval.upperIndex = 0;
|
|
236
|
+
}
|
|
237
|
+
|
|
238
|
+
private getFirstPsc(chain: PolynomialRefVector) {
|
|
239
|
+
const r = new PolynomialRef(this.pm);
|
|
240
|
+
for (let index = 0; index < chain.size; index++) {
|
|
241
|
+
r.set(chain.get(index));
|
|
242
|
+
if (this.pm.isZero(r.get())) continue;
|
|
243
|
+
if (this.pm.isConst(r.get())) {
|
|
244
|
+
r.reset();
|
|
245
|
+
return r;
|
|
246
|
+
}
|
|
247
|
+
return r;
|
|
248
|
+
}
|
|
249
|
+
r.reset();
|
|
250
|
+
return r;
|
|
251
|
+
}
|
|
252
|
+
|
|
253
|
+
private pscDiscriminant(pIn: Polynomial, x: number) {
|
|
254
|
+
const pm = this.pm;
|
|
255
|
+
if (pm.isZero(pIn) || pm.isConst(pIn) || pm.degree(pIn, x) < 2) return new PolynomialRef(pm);
|
|
256
|
+
const p = new PolynomialRef(pm);
|
|
257
|
+
p.set(pIn);
|
|
258
|
+
const d = new PolynomialRef(pm);
|
|
259
|
+
d.set(pm.derivative(p.get(), x));
|
|
260
|
+
const chain = this.pscTmp;
|
|
261
|
+
chain.reset();
|
|
262
|
+
this.cache.pscChain(p.get(), d.get(), x, chain);
|
|
263
|
+
const disc = this.getFirstPsc(chain);
|
|
264
|
+
d.reset();
|
|
265
|
+
p.reset();
|
|
266
|
+
return disc;
|
|
267
|
+
}
|
|
268
|
+
|
|
269
|
+
private pscResultant(a: Polynomial, b: Polynomial, x: number) {
|
|
270
|
+
const pa = new PolynomialRef(this.pm);
|
|
271
|
+
pa.set(a);
|
|
272
|
+
const pb = new PolynomialRef(this.pm);
|
|
273
|
+
pb.set(b);
|
|
274
|
+
const chain = this.pscTmp;
|
|
275
|
+
chain.reset();
|
|
276
|
+
this.cache.pscChain(pa.get(), pb.get(), x, chain);
|
|
277
|
+
const r = this.getFirstPsc(chain);
|
|
278
|
+
pb.reset();
|
|
279
|
+
pa.reset();
|
|
280
|
+
return r;
|
|
281
|
+
}
|
|
282
|
+
|
|
283
|
+
private requestFactorized(polynomial: Polynomial | null) {
|
|
284
|
+
const pm = this.pm;
|
|
285
|
+
if (polynomial === null || pm.isZero(polynomial) || pm.isConst(polynomial)) return;
|
|
286
|
+
const factors = new PolynomialRefVector(pm);
|
|
287
|
+
this.cache.factor(polynomial, factors);
|
|
288
|
+
for (let index = 0; index < factors.size; index++) {
|
|
289
|
+
const f = new PolynomialRef(pm);
|
|
290
|
+
f.set(factors.get(index));
|
|
291
|
+
if (!pm.isZero(f.get()) && !pm.isConst(f.get())) this.todo.insert(f.get());
|
|
292
|
+
f.reset();
|
|
293
|
+
}
|
|
294
|
+
factors.reset();
|
|
295
|
+
}
|
|
296
|
+
|
|
297
|
+
private chooseNonzeroCoeff(p: Polynomial, x: number) {
|
|
298
|
+
const pm = this.pm;
|
|
299
|
+
const degree = pm.degree(p, x);
|
|
300
|
+
const coeff = new PolynomialRef(pm);
|
|
247
301
|
for (let power = 0; power <= degree; power++) {
|
|
248
|
-
|
|
249
|
-
if (
|
|
302
|
+
coeff.set(pm.coeff(p, x, power));
|
|
303
|
+
if (pm.isZero(coeff.get())) continue;
|
|
304
|
+
if (pm.isConst(coeff.get())) return coeff;
|
|
250
305
|
}
|
|
251
|
-
|
|
306
|
+
const best = new PolynomialRef(pm);
|
|
307
|
+
let bestTotalDegree = 0;
|
|
308
|
+
let bestSize = 0;
|
|
309
|
+
let bestMaxVar = NULL_VAR;
|
|
252
310
|
for (let power = 0; power <= degree; power++) {
|
|
253
|
-
|
|
254
|
-
|
|
255
|
-
|
|
256
|
-
const
|
|
311
|
+
coeff.set(pm.coeff(p, x, power));
|
|
312
|
+
const current = coeff.get();
|
|
313
|
+
if (pm.isZero(current) || this.getSign(current) === 0) continue;
|
|
314
|
+
const totalDegree = pm.totalDegree(current);
|
|
315
|
+
const size = current.size;
|
|
316
|
+
const maxVar = pm.maxVar(current);
|
|
257
317
|
if (
|
|
258
|
-
best === null ||
|
|
259
|
-
totalDegree <
|
|
260
|
-
(totalDegree ===
|
|
261
|
-
(
|
|
262
|
-
(
|
|
263
|
-
)
|
|
264
|
-
best
|
|
318
|
+
best.getOrNull() === null ||
|
|
319
|
+
totalDegree < bestTotalDegree ||
|
|
320
|
+
(totalDegree === bestTotalDegree &&
|
|
321
|
+
(size < bestSize ||
|
|
322
|
+
(size === bestSize && (bestMaxVar === NULL_VAR || maxVar < bestMaxVar))))
|
|
323
|
+
) {
|
|
324
|
+
best.copy(coeff);
|
|
325
|
+
bestTotalDegree = totalDegree;
|
|
326
|
+
bestSize = size;
|
|
327
|
+
bestMaxVar = maxVar;
|
|
328
|
+
}
|
|
265
329
|
}
|
|
330
|
+
coeff.reset();
|
|
266
331
|
return best;
|
|
267
332
|
}
|
|
268
333
|
|
|
269
334
|
private addProjectionForPoly(
|
|
270
|
-
|
|
271
|
-
|
|
272
|
-
|
|
335
|
+
p: Polynomial,
|
|
336
|
+
x: number,
|
|
337
|
+
nonzeroCoeff: Polynomial | null,
|
|
273
338
|
isLcAdded: boolean,
|
|
274
339
|
isDiscAdded: boolean,
|
|
275
340
|
) {
|
|
276
|
-
|
|
341
|
+
const pm = this.pm;
|
|
342
|
+
let isNonzeroCoeffAdded = nonzeroCoeff !== null && !pm.isConst(nonzeroCoeff);
|
|
277
343
|
if (isLcAdded) {
|
|
278
|
-
const lc =
|
|
279
|
-
|
|
280
|
-
|
|
281
|
-
|
|
344
|
+
const lc = new PolynomialRef(pm);
|
|
345
|
+
lc.set(pm.coeff(p, x, pm.degree(p, x)));
|
|
346
|
+
this.requestFactorized(lc.get());
|
|
347
|
+
if (isNonzeroCoeffAdded && this.getSign(lc.get()) !== 0) isNonzeroCoeffAdded = false;
|
|
348
|
+
lc.reset();
|
|
282
349
|
}
|
|
283
350
|
if (isDiscAdded) {
|
|
284
|
-
const disc =
|
|
285
|
-
|
|
286
|
-
|
|
287
|
-
|
|
288
|
-
|
|
351
|
+
const disc = new PolynomialRef(pm);
|
|
352
|
+
disc.move(this.pscDiscriminant(p, x));
|
|
353
|
+
const value = disc.getOrNull();
|
|
354
|
+
if (value !== null) {
|
|
355
|
+
this.requestFactorized(value);
|
|
356
|
+
if (isNonzeroCoeffAdded && this.getSign(value) !== 0) isNonzeroCoeffAdded = false;
|
|
289
357
|
}
|
|
358
|
+
disc.reset();
|
|
290
359
|
}
|
|
291
|
-
if (
|
|
360
|
+
if (isNonzeroCoeffAdded) this.requestFactorized(nonzeroCoeff);
|
|
292
361
|
}
|
|
293
362
|
|
|
294
363
|
private addPair(first: number, second: number) {
|
|
@@ -310,33 +379,34 @@ class Levelwise {
|
|
|
310
379
|
|
|
311
380
|
private computeSideMask() {
|
|
312
381
|
if (this.lowerRf === UNSET) return;
|
|
313
|
-
while (this.sideMask.length < this.
|
|
382
|
+
while (this.sideMask.length < this.levelPs.size) this.sideMask.push(0);
|
|
314
383
|
this.rootFunctions.forEach((rootFunction, index) => {
|
|
315
384
|
this.sideMask[rootFunction.psIndex] |= index <= this.lowerRf ? 1 : 2;
|
|
316
385
|
});
|
|
317
386
|
}
|
|
318
387
|
|
|
319
|
-
private getBoundIndex(
|
|
320
|
-
return
|
|
388
|
+
private getBoundIndex(rootFunctionIndex: number) {
|
|
389
|
+
return rootFunctionIndex === UNSET ? UNSET : this.rootFunctions[rootFunctionIndex].psIndex;
|
|
390
|
+
}
|
|
391
|
+
|
|
392
|
+
private computeResultantGraphDegree() {
|
|
393
|
+
this.degInOrderGraph = Array.from({ length: this.levelPs.size }, () => 0);
|
|
394
|
+
for (const pair of this.pairs.values()) {
|
|
395
|
+
this.degInOrderGraph[pair[0]]++;
|
|
396
|
+
this.degInOrderGraph[pair[1]]++;
|
|
397
|
+
}
|
|
321
398
|
}
|
|
322
399
|
|
|
323
|
-
// compute_omit_lc_both_sides: by projective delineability, the leading coefficient of a
|
|
324
|
-
// polynomial with roots on both sides that does not bound the cell may be left out. With
|
|
325
|
-
// isLeafRequired, only for the leaves of the resultant graph.
|
|
326
400
|
private computeOmitLcBothSides(isLeafRequired: boolean) {
|
|
327
|
-
this.isLcOmitted = this.
|
|
401
|
+
this.isLcOmitted = Array.from({ length: this.levelPs.size }, () => false);
|
|
328
402
|
if (this.rootFunctions.length === 0 || this.pairs.size === 0 || this.sideMask.length === 0)
|
|
329
403
|
return;
|
|
330
|
-
|
|
331
|
-
for (const pair of this.pairs.values()) {
|
|
332
|
-
degrees[pair[0]]++;
|
|
333
|
-
degrees[pair[1]]++;
|
|
334
|
-
}
|
|
404
|
+
if (isLeafRequired) this.computeResultantGraphDegree();
|
|
335
405
|
const lowerBound = this.getBoundIndex(this.lowerRf);
|
|
336
406
|
const upperBound = this.getBoundIndex(this.upperRf);
|
|
337
|
-
for (let index = 0; index < this.
|
|
407
|
+
for (let index = 0; index < this.levelPs.size; index++) {
|
|
338
408
|
if (this.sideMask[index] !== BOTH_SIDES) continue;
|
|
339
|
-
if (isLeafRequired &&
|
|
409
|
+
if (isLeafRequired && this.degInOrderGraph[index] !== 1) continue;
|
|
340
410
|
if (index === lowerBound || index === upperBound) continue;
|
|
341
411
|
this.isLcOmitted[index] = true;
|
|
342
412
|
}
|
|
@@ -352,24 +422,24 @@ class Levelwise {
|
|
|
352
422
|
}
|
|
353
423
|
|
|
354
424
|
private fillRelationSection() {
|
|
425
|
+
if (this.rootFunctions.length === 0) return;
|
|
355
426
|
for (let index = 0; index < this.lowerRf; index++) this.addPair(index, this.lowerRf);
|
|
356
427
|
for (let index = this.lowerRf + 1; index < this.rootFunctions.length; index++)
|
|
357
428
|
this.addPair(this.lowerRf, index);
|
|
358
429
|
}
|
|
359
430
|
|
|
360
|
-
// build_both_side_spanning_tree: by the reaching orders lemma, in order of the lower root, each
|
|
361
|
-
// polynomial with roots on both sides is joined to the remaining one whose upper root is least.
|
|
362
431
|
private buildBothSideSpanningTree() {
|
|
363
|
-
const lowerRfs = this.
|
|
364
|
-
const upperRfs = this.
|
|
432
|
+
const lowerRfs = Array.from({ length: this.levelPs.size }, () => UNSET);
|
|
433
|
+
const upperRfs = Array.from({ length: this.levelPs.size }, () => UNSET);
|
|
365
434
|
for (let index = 0; index <= this.lowerRf; index++)
|
|
366
435
|
lowerRfs[this.rootFunctions[index].psIndex] = index;
|
|
367
436
|
for (let index = this.upperRf; index < this.rootFunctions.length; index++)
|
|
368
437
|
upperRfs[this.rootFunctions[index].psIndex] = index;
|
|
369
|
-
const both =
|
|
370
|
-
|
|
371
|
-
|
|
372
|
-
|
|
438
|
+
const both: { psIndex: number; lowerRf: number; upperRf: number }[] = [];
|
|
439
|
+
for (let psIndex = 0; psIndex < this.levelPs.size; psIndex++)
|
|
440
|
+
if (this.sideMask[psIndex] === BOTH_SIDES)
|
|
441
|
+
both.push({ psIndex, lowerRf: lowerRfs[psIndex], upperRf: upperRfs[psIndex] });
|
|
442
|
+
both.sort((first, second) => first.lowerRf - second.lowerRf);
|
|
373
443
|
for (let first = 0; first < both.length - 1; first++) {
|
|
374
444
|
let closest = first + 1;
|
|
375
445
|
for (let index = first + 2; index < both.length; index++)
|
|
@@ -380,13 +450,12 @@ class Levelwise {
|
|
|
380
450
|
|
|
381
451
|
private fillRelationSpanningTree() {
|
|
382
452
|
this.buildBothSideSpanningTree();
|
|
383
|
-
const isBoth = (
|
|
384
|
-
|
|
453
|
+
const isBoth = (rootFunctionIndex: number) =>
|
|
454
|
+
this.sideMask[this.rootFunctions[rootFunctionIndex].psIndex] === BOTH_SIDES;
|
|
385
455
|
for (let index = 0; index < this.lowerRf; index++)
|
|
386
456
|
if (!isBoth(index)) this.addPair(index, this.lowerRf);
|
|
387
457
|
for (let index = this.upperRf + 1; index < this.rootFunctions.length; index++)
|
|
388
458
|
if (!isBoth(index)) this.addPair(this.upperRf, index);
|
|
389
|
-
// connect_tree_extremes_to_bounds
|
|
390
459
|
let maxLowerBoth = UNSET;
|
|
391
460
|
for (let index = 0; index < this.lowerRf; index++) if (isBoth(index)) maxLowerBoth = index;
|
|
392
461
|
let minUpperBoth = UNSET;
|
|
@@ -400,30 +469,30 @@ class Levelwise {
|
|
|
400
469
|
this.addPair(this.lowerRf, this.upperRf);
|
|
401
470
|
}
|
|
402
471
|
|
|
403
|
-
// isolate_roots_around_sample: the roots of p closest to v, at or below it in lower and above
|
|
404
|
-
// it in upper, only the one at v for a section. Whether p has roots.
|
|
405
472
|
private isolateRootsAroundSample(
|
|
473
|
+
p: Polynomial,
|
|
406
474
|
psIndex: number,
|
|
407
475
|
value: Anum,
|
|
408
476
|
lower: RootFunction[],
|
|
409
477
|
upper: RootFunction[],
|
|
410
478
|
) {
|
|
411
|
-
const polynomial = this.levelPolys[psIndex];
|
|
412
479
|
const values = this.getValuesWithout(this.level);
|
|
413
|
-
const
|
|
480
|
+
const mkRootFunction = (root: Anum, index: number) => ({
|
|
414
481
|
value: this.am.copy(root),
|
|
415
|
-
polynomial,
|
|
482
|
+
polynomial: p,
|
|
416
483
|
index,
|
|
417
484
|
psIndex,
|
|
418
485
|
});
|
|
419
486
|
if (value.value instanceof Rational) {
|
|
420
|
-
const closest = this.am.isolateRootsClosest(this.pm,
|
|
487
|
+
const closest = this.am.isolateRootsClosest(this.pm, p, values, value.value);
|
|
421
488
|
closest.roots.forEach((root, index) => {
|
|
422
|
-
(this.am.compare(root, value) <= 0 ? lower : upper).push(
|
|
489
|
+
(this.am.compare(root, value) <= 0 ? lower : upper).push(
|
|
490
|
+
mkRootFunction(root, closest.indices[index]),
|
|
491
|
+
);
|
|
423
492
|
});
|
|
424
493
|
return closest.roots.length > 0;
|
|
425
494
|
}
|
|
426
|
-
const roots = this.am.isolateRoots(this.pm,
|
|
495
|
+
const roots = this.am.isolateRoots(this.pm, p, values);
|
|
427
496
|
let lowerIndex = UNSET;
|
|
428
497
|
let upperIndex = UNSET;
|
|
429
498
|
let isSection = false;
|
|
@@ -440,15 +509,13 @@ class Levelwise {
|
|
|
440
509
|
}
|
|
441
510
|
}
|
|
442
511
|
if (lowerIndex !== UNSET) {
|
|
443
|
-
lower.push(
|
|
512
|
+
lower.push(mkRootFunction(roots[lowerIndex], lowerIndex + 1));
|
|
444
513
|
if (isSection) return roots.length > 0;
|
|
445
514
|
}
|
|
446
|
-
if (upperIndex !== UNSET) upper.push(
|
|
515
|
+
if (upperIndex !== UNSET) upper.push(mkRootFunction(roots[upperIndex], upperIndex + 1));
|
|
447
516
|
return roots.length > 0;
|
|
448
517
|
}
|
|
449
518
|
|
|
450
|
-
// root_function_lt: by value, ties by degree, descending for the lower partition, whose last
|
|
451
|
-
// element bounds the cell, then by polynomial id.
|
|
452
519
|
private isRootFunctionLess(first: RootFunction, second: RootFunction, isDegreeDesc: boolean) {
|
|
453
520
|
if (first.polynomial === second.polynomial) return first.index < second.index;
|
|
454
521
|
const sign = this.am.compare(first.value, second.value);
|
|
@@ -461,7 +528,7 @@ class Levelwise {
|
|
|
461
528
|
}
|
|
462
529
|
|
|
463
530
|
private sortRootFunctions(rootFunctions: RootFunction[], isDegreeDesc: boolean) {
|
|
464
|
-
return
|
|
531
|
+
return mergeSortIndices(rootFunctions.length, (first, second) =>
|
|
465
532
|
this.isRootFunctionLess(rootFunctions[first], rootFunctions[second], isDegreeDesc),
|
|
466
533
|
).map((index) => rootFunctions[index]);
|
|
467
534
|
}
|
|
@@ -472,99 +539,115 @@ class Levelwise {
|
|
|
472
539
|
if (middle === 0) {
|
|
473
540
|
this.lowerRf = UNSET;
|
|
474
541
|
this.upperRf = 0;
|
|
475
|
-
interval.upper
|
|
542
|
+
interval.upper.set(rootFunctions[0].polynomial);
|
|
476
543
|
interval.upperIndex = rootFunctions[0].index;
|
|
477
544
|
return;
|
|
478
545
|
}
|
|
479
546
|
this.lowerRf = middle - 1;
|
|
480
547
|
const lower = rootFunctions[middle - 1];
|
|
481
|
-
interval.lower = lower.polynomial;
|
|
482
|
-
interval.lowerIndex = lower.index;
|
|
483
548
|
if (this.am.compare(lower.value, value) === 0) {
|
|
484
549
|
interval.isSection = true;
|
|
550
|
+
interval.lower.set(lower.polynomial);
|
|
551
|
+
interval.lowerIndex = lower.index;
|
|
485
552
|
this.upperRf = this.lowerRf;
|
|
486
553
|
return;
|
|
487
554
|
}
|
|
555
|
+
interval.lower.set(lower.polynomial);
|
|
556
|
+
interval.lowerIndex = lower.index;
|
|
488
557
|
if (middle < rootFunctions.length) {
|
|
489
558
|
this.upperRf = this.lowerRf + 1;
|
|
490
|
-
interval.upper
|
|
559
|
+
interval.upper.set(rootFunctions[middle].polynomial);
|
|
491
560
|
interval.upperIndex = rootFunctions[middle].index;
|
|
492
561
|
}
|
|
493
562
|
}
|
|
494
563
|
|
|
495
|
-
private addLinearPolyFromRoot(root: Anum, isLower: boolean) {
|
|
496
|
-
const
|
|
497
|
-
const
|
|
498
|
-
|
|
499
|
-
|
|
500
|
-
);
|
|
564
|
+
private addLinearPolyFromRoot(root: Anum, isLower: boolean, p: PolynomialRef) {
|
|
565
|
+
const pm = this.pm;
|
|
566
|
+
const value = this.am.toRational(root);
|
|
567
|
+
p.set(pm.mkVar(this.level));
|
|
568
|
+
const scaled = new PolynomialRef(pm);
|
|
569
|
+
scaled.set(pm.mulConst(value.den, p.get()));
|
|
570
|
+
const constant = new PolynomialRef(pm);
|
|
571
|
+
constant.set(pm.mkConst(value.num));
|
|
572
|
+
const difference = new PolynomialRef(pm);
|
|
573
|
+
difference.set(pm.sub(scaled.get(), constant.get()));
|
|
574
|
+
constant.reset();
|
|
575
|
+
p.move(difference);
|
|
576
|
+
scaled.reset();
|
|
501
577
|
const interval = this.intervals[this.level];
|
|
502
578
|
if (isLower) {
|
|
503
|
-
interval.lower
|
|
579
|
+
interval.lower.copy(p);
|
|
504
580
|
interval.lowerIndex = 1;
|
|
505
581
|
} else {
|
|
506
|
-
interval.upper
|
|
582
|
+
interval.upper.copy(p);
|
|
507
583
|
interval.upperIndex = 1;
|
|
508
584
|
}
|
|
509
|
-
this.
|
|
510
|
-
this.
|
|
511
|
-
this.
|
|
512
|
-
|
|
585
|
+
this.levelPs.push(p.get());
|
|
586
|
+
this.polyHasRoots.push(true);
|
|
587
|
+
const witness = this.chooseNonzeroCoeff(p.get(), this.level);
|
|
588
|
+
const copy = new PolynomialRef(pm);
|
|
589
|
+
copy.copy(witness);
|
|
590
|
+
this.witnesses.push(copy);
|
|
591
|
+
witness.reset();
|
|
513
592
|
}
|
|
514
593
|
|
|
515
|
-
// add_linear_approximations: bounds of degree 2 or more are replaced by linear polynomials
|
|
516
|
-
// whose roots lie between them and the sample, so the cell only shrinks.
|
|
517
594
|
private addLinearApproximations(value: Anum) {
|
|
595
|
+
const pLower = new PolynomialRef(this.pm);
|
|
596
|
+
const pUpper = new PolynomialRef(this.pm);
|
|
518
597
|
const interval = this.intervals[this.level];
|
|
519
598
|
const mkRootFunction = (polynomial: Polynomial, root: Anum) => ({
|
|
520
599
|
value: this.am.copy(root),
|
|
521
600
|
polynomial,
|
|
522
601
|
index: 1,
|
|
523
|
-
psIndex: this.
|
|
602
|
+
psIndex: this.levelPs.size - 1,
|
|
524
603
|
});
|
|
525
604
|
if (interval.isSection) {
|
|
526
605
|
if (!this.am.isRational(value))
|
|
527
|
-
// Z3's NOT_IMPLEMENTED_YET exits the process here.
|
|
528
606
|
throw new NlsatUnsupportedError("a linear cell around an irrational section");
|
|
529
|
-
if (this.pm.totalDegree(interval.lower
|
|
530
|
-
|
|
531
|
-
this.rootFunctions.splice(this.lowerRf, 0, mkRootFunction(
|
|
607
|
+
if (this.pm.totalDegree(interval.lower.get()) > 1) {
|
|
608
|
+
this.addLinearPolyFromRoot(value, true, pLower);
|
|
609
|
+
this.rootFunctions.splice(this.lowerRf, 0, mkRootFunction(pLower.get(), value));
|
|
532
610
|
}
|
|
611
|
+
pUpper.reset();
|
|
612
|
+
pLower.reset();
|
|
533
613
|
return;
|
|
534
614
|
}
|
|
535
|
-
|
|
615
|
+
const lower = interval.lower.getOrNull();
|
|
616
|
+
if (lower !== null && this.pm.totalDegree(lower) > 1) {
|
|
536
617
|
const between = this.am.select(this.rootFunctions[this.lowerRf].value, value);
|
|
537
|
-
|
|
538
|
-
this.rootFunctions.splice(this.lowerRf + 1, 0, mkRootFunction(
|
|
618
|
+
this.addLinearPolyFromRoot(between, true, pLower);
|
|
619
|
+
this.rootFunctions.splice(this.lowerRf + 1, 0, mkRootFunction(pLower.get(), between));
|
|
539
620
|
this.lowerRf++;
|
|
540
621
|
if (this.upperRf !== UNSET) this.upperRf++;
|
|
541
622
|
}
|
|
542
|
-
|
|
623
|
+
const upper = interval.upper.getOrNull();
|
|
624
|
+
if (upper !== null && this.pm.totalDegree(upper) > 1) {
|
|
543
625
|
const between = this.am.select(value, this.rootFunctions[this.upperRf].value);
|
|
544
|
-
|
|
545
|
-
this.rootFunctions.splice(this.upperRf, 0, mkRootFunction(
|
|
626
|
+
this.addLinearPolyFromRoot(between, false, pUpper);
|
|
627
|
+
this.rootFunctions.splice(this.upperRf, 0, mkRootFunction(pUpper.get(), between));
|
|
546
628
|
}
|
|
629
|
+
pUpper.reset();
|
|
630
|
+
pLower.reset();
|
|
547
631
|
}
|
|
548
632
|
|
|
549
|
-
// build_interval: the root functions around the sample, sorted, and the interval they bound.
|
|
550
633
|
private buildInterval() {
|
|
551
634
|
this.rootFunctions = [];
|
|
552
635
|
this.pairs.clear();
|
|
553
|
-
|
|
554
|
-
isSection: false,
|
|
555
|
-
lower: null,
|
|
556
|
-
lowerIndex: 0,
|
|
557
|
-
upper: null,
|
|
558
|
-
upperIndex: 0,
|
|
559
|
-
});
|
|
636
|
+
this.resetInterval(this.intervals[this.level]);
|
|
560
637
|
this.lowerRf = UNSET;
|
|
561
638
|
this.upperRf = UNSET;
|
|
562
639
|
const value = this.sample[this.level]!;
|
|
640
|
+
this.polyHasRoots = Array.from({ length: this.levelPs.size }, () => false);
|
|
563
641
|
const lower: RootFunction[] = [];
|
|
564
642
|
const upper: RootFunction[] = [];
|
|
565
|
-
|
|
566
|
-
this.isolateRootsAroundSample(
|
|
567
|
-
|
|
643
|
+
for (let index = 0; index < this.levelPs.size; index++)
|
|
644
|
+
this.polyHasRoots[index] = this.isolateRootsAroundSample(
|
|
645
|
+
this.levelPs.get(index),
|
|
646
|
+
index,
|
|
647
|
+
value,
|
|
648
|
+
lower,
|
|
649
|
+
upper,
|
|
650
|
+
);
|
|
568
651
|
if (lower.length === 0 && upper.length === 0) return false;
|
|
569
652
|
this.rootFunctions = [
|
|
570
653
|
...this.sortRootFunctions(lower, true),
|
|
@@ -577,24 +660,29 @@ class Levelwise {
|
|
|
577
660
|
}
|
|
578
661
|
|
|
579
662
|
private addRelationResultants() {
|
|
580
|
-
for (const pair of this.getSortedPairs())
|
|
581
|
-
this.
|
|
582
|
-
this.
|
|
663
|
+
for (const pair of this.getSortedPairs()) {
|
|
664
|
+
const res = this.pscResultant(
|
|
665
|
+
this.levelPs.get(pair[0]),
|
|
666
|
+
this.levelPs.get(pair[1]),
|
|
667
|
+
this.level,
|
|
583
668
|
);
|
|
669
|
+
this.requestFactorized(res.getOrNull());
|
|
670
|
+
res.reset();
|
|
671
|
+
}
|
|
584
672
|
}
|
|
585
673
|
|
|
586
|
-
// add_adjacent_root_resultants: at the top level, the resultants of the polynomials of adjacent
|
|
587
|
-
// roots.
|
|
588
674
|
private addAdjacentRootResultants() {
|
|
675
|
+
this.polyHasRoots = Array.from({ length: this.levelPs.size }, () => false);
|
|
589
676
|
const rootValues: { root: Anum; polynomial: Polynomial }[] = [];
|
|
590
677
|
const values = this.getValuesWithout(this.maxVar);
|
|
591
|
-
|
|
678
|
+
for (let index = 0; index < this.levelPs.size; index++) {
|
|
679
|
+
const polynomial = this.levelPs.get(index);
|
|
592
680
|
const roots = this.am.isolateRoots(this.pm, polynomial, values);
|
|
681
|
+
this.polyHasRoots[index] = roots.length > 0;
|
|
593
682
|
for (const root of roots) rootValues.push({ root: this.am.copy(root), polynomial });
|
|
594
|
-
|
|
595
|
-
});
|
|
683
|
+
}
|
|
596
684
|
if (rootValues.length < 2) return;
|
|
597
|
-
const order =
|
|
685
|
+
const order = mergeSortIndices(
|
|
598
686
|
rootValues.length,
|
|
599
687
|
(first, second) => this.am.compare(rootValues[first].root, rootValues[second].root) < 0,
|
|
600
688
|
);
|
|
@@ -607,50 +695,71 @@ class Levelwise {
|
|
|
607
695
|
const key = `${low.id},${high.id}`;
|
|
608
696
|
if (added.has(key)) continue;
|
|
609
697
|
added.add(key);
|
|
610
|
-
this.
|
|
698
|
+
const res = this.pscResultant(low, high, this.maxVar);
|
|
699
|
+
this.requestFactorized(res.getOrNull());
|
|
700
|
+
res.reset();
|
|
611
701
|
}
|
|
612
702
|
}
|
|
613
703
|
|
|
614
|
-
// Polynomials with roots keep their order by resultants with the section's polynomial. Those
|
|
615
|
-
// without need their leading coefficient and discriminant to stay without.
|
|
616
704
|
private addSectionProjections() {
|
|
617
|
-
const sectionPolynomial = this.intervals[this.level].lower;
|
|
705
|
+
const sectionPolynomial = this.intervals[this.level].lower.get();
|
|
618
706
|
const withRoots = new Set(this.rootFunctions.map((rootFunction) => rootFunction.psIndex));
|
|
619
|
-
this.
|
|
620
|
-
const
|
|
621
|
-
|
|
622
|
-
|
|
707
|
+
for (let index = 0; index < this.levelPs.size; index++) {
|
|
708
|
+
const p = new PolynomialRef(this.pm);
|
|
709
|
+
p.set(this.levelPs.get(index));
|
|
710
|
+
const witness = new PolynomialRef(this.pm);
|
|
711
|
+
witness.copy(this.witnesses[index]);
|
|
712
|
+
const isFull = this.levelPs.get(index) === sectionPolynomial || !withRoots.has(index);
|
|
713
|
+
this.addProjectionForPoly(p.get(), this.level, witness.getOrNull(), isFull, true);
|
|
714
|
+
witness.reset();
|
|
715
|
+
p.reset();
|
|
716
|
+
}
|
|
623
717
|
}
|
|
624
718
|
|
|
625
719
|
private addSectorProjections() {
|
|
626
|
-
|
|
720
|
+
const pm = this.pm;
|
|
721
|
+
for (let index = 0; index < this.levelPs.size; index++) {
|
|
722
|
+
const p = new PolynomialRef(pm);
|
|
723
|
+
p.set(this.levelPs.get(index));
|
|
724
|
+
const lc = new PolynomialRef(pm);
|
|
725
|
+
lc.set(pm.coeff(p.get(), this.level, pm.degree(p.get(), this.level)));
|
|
627
726
|
const isLcAdded = !(this.isLcOmitted[index] ?? false);
|
|
628
|
-
|
|
629
|
-
|
|
727
|
+
const witness = new PolynomialRef(pm);
|
|
728
|
+
witness.copy(this.witnesses[index]);
|
|
729
|
+
const value = witness.getOrNull();
|
|
630
730
|
if (
|
|
631
731
|
isLcAdded &&
|
|
632
|
-
|
|
633
|
-
!
|
|
634
|
-
|
|
635
|
-
this.getSign(
|
|
732
|
+
value !== null &&
|
|
733
|
+
!pm.isConst(value) &&
|
|
734
|
+
!pm.isZero(lc.get()) &&
|
|
735
|
+
this.getSign(lc.get()) !== 0
|
|
636
736
|
)
|
|
637
|
-
witness
|
|
638
|
-
this.addProjectionForPoly(
|
|
639
|
-
|
|
737
|
+
witness.reset();
|
|
738
|
+
this.addProjectionForPoly(p.get(), this.level, witness.getOrNull(), isLcAdded, true);
|
|
739
|
+
witness.reset();
|
|
740
|
+
lc.reset();
|
|
741
|
+
p.reset();
|
|
742
|
+
}
|
|
640
743
|
}
|
|
641
744
|
|
|
642
745
|
private shouldUseSpanningTree() {
|
|
643
|
-
if (this.params.spanningTreeThreshold < 2) return false;
|
|
644
746
|
if (this.rootFunctions.length < 4 || this.sideMask.length === 0) return false;
|
|
645
747
|
if (this.lowerRf === UNSET || this.upperRf === UNSET) return false;
|
|
646
748
|
if (this.getBoundIndex(this.lowerRf) === this.getBoundIndex(this.upperRf)) return false;
|
|
647
749
|
let bothCount = 0;
|
|
648
|
-
for (let index = 0; index < this.
|
|
649
|
-
if (this.sideMask[index] === BOTH_SIDES && ++bothCount >=
|
|
750
|
+
for (let index = 0; index < this.levelPs.size; index++)
|
|
751
|
+
if (this.sideMask[index] === BOTH_SIDES && ++bothCount >= SPANNING_TREE_THRESHOLD)
|
|
650
752
|
return true;
|
|
651
753
|
return false;
|
|
652
754
|
}
|
|
653
755
|
|
|
756
|
+
private clearLevelState() {
|
|
757
|
+
this.isLcOmitted = [];
|
|
758
|
+
this.pairs.clear();
|
|
759
|
+
this.sideMask = [];
|
|
760
|
+
this.degInOrderGraph = [];
|
|
761
|
+
}
|
|
762
|
+
|
|
654
763
|
private processLevelWithMode(mode: ProjectionMode, hasInterval: boolean) {
|
|
655
764
|
if (hasInterval) {
|
|
656
765
|
if (mode === "section") this.fillRelationSection();
|
|
@@ -666,72 +775,96 @@ class Levelwise {
|
|
|
666
775
|
this.addRelationResultants();
|
|
667
776
|
}
|
|
668
777
|
|
|
669
|
-
// collect_non_null_witnesses: a witness per polynomial, until handling the vanishing ones adds
|
|
670
|
-
// no more polynomials at this level.
|
|
671
778
|
private collectNonNullWitnesses() {
|
|
672
|
-
this.
|
|
673
|
-
for (let index = 0; index < this.
|
|
674
|
-
const
|
|
675
|
-
|
|
676
|
-
|
|
677
|
-
this.
|
|
678
|
-
|
|
679
|
-
|
|
779
|
+
this.clearWitnesses();
|
|
780
|
+
for (let index = 0; index < this.levelPs.size; index++) {
|
|
781
|
+
const p = new PolynomialRef(this.pm);
|
|
782
|
+
p.set(this.levelPs.get(index));
|
|
783
|
+
const witness = this.chooseNonzeroCoeff(p.get(), this.level);
|
|
784
|
+
if (witness.getOrNull() === null) this.handleNullifiedPoly(p.get());
|
|
785
|
+
const copy = new PolynomialRef(this.pm);
|
|
786
|
+
copy.copy(witness);
|
|
787
|
+
this.witnesses.push(copy);
|
|
788
|
+
if (index + 1 === this.levelPs.size) this.todo.extractPolysAtLevel(this.level, this.levelPs);
|
|
789
|
+
witness.reset();
|
|
790
|
+
p.reset();
|
|
680
791
|
}
|
|
681
792
|
}
|
|
682
793
|
|
|
683
794
|
private processLevel() {
|
|
684
|
-
this.
|
|
685
|
-
this.pairs.clear();
|
|
686
|
-
this.sideMask = [];
|
|
795
|
+
this.clearLevelState();
|
|
687
796
|
this.collectNonNullWitnesses();
|
|
688
797
|
const hasInterval = this.buildInterval();
|
|
689
|
-
|
|
690
|
-
|
|
691
|
-
|
|
692
|
-
|
|
693
|
-
|
|
694
|
-
|
|
798
|
+
this.processLevelWithMode(
|
|
799
|
+
this.intervals[this.level].isSection
|
|
800
|
+
? "section"
|
|
801
|
+
: this.shouldUseSpanningTree()
|
|
802
|
+
? "spanningTree"
|
|
803
|
+
: "sector",
|
|
804
|
+
hasInterval,
|
|
805
|
+
);
|
|
695
806
|
}
|
|
696
807
|
|
|
697
|
-
// The top level is projected out without an interval. By projective delineability, a
|
|
698
|
-
// polynomial without roots whose leading coefficient is nonzero needs only its discriminant.
|
|
699
808
|
private processTopLevel() {
|
|
809
|
+
const pm = this.pm;
|
|
700
810
|
this.collectNonNullWitnesses();
|
|
701
811
|
this.addAdjacentRootResultants();
|
|
702
|
-
this.
|
|
703
|
-
const
|
|
704
|
-
|
|
705
|
-
|
|
706
|
-
|
|
812
|
+
for (let index = 0; index < this.levelPs.size; index++) {
|
|
813
|
+
const p = new PolynomialRef(pm);
|
|
814
|
+
p.set(this.levelPs.get(index));
|
|
815
|
+
const lc = new PolynomialRef(pm);
|
|
816
|
+
lc.set(pm.coeff(p.get(), this.maxVar, pm.degree(p.get(), this.maxVar)));
|
|
817
|
+
let isLcAdded = true;
|
|
818
|
+
if (
|
|
819
|
+
!(this.polyHasRoots[index] ?? false) &&
|
|
820
|
+
!pm.isZero(lc.get()) &&
|
|
821
|
+
this.getSign(lc.get()) !== 0
|
|
822
|
+
) {
|
|
823
|
+
isLcAdded = false;
|
|
824
|
+
this.witnesses[index].reset();
|
|
825
|
+
}
|
|
826
|
+
this.addProjectionForPoly(
|
|
827
|
+
p.get(),
|
|
828
|
+
this.maxVar,
|
|
829
|
+
this.witnesses[index].getOrNull(),
|
|
830
|
+
isLcAdded,
|
|
831
|
+
true,
|
|
832
|
+
);
|
|
833
|
+
lc.reset();
|
|
834
|
+
p.reset();
|
|
835
|
+
}
|
|
836
|
+
}
|
|
837
|
+
|
|
838
|
+
private copyIntervals() {
|
|
839
|
+
return this.intervals.map((interval) => {
|
|
840
|
+
const copy = new CellInterval(this.pm);
|
|
841
|
+
copy.isSection = interval.isSection;
|
|
842
|
+
copy.lower.copy(interval.lower);
|
|
843
|
+
copy.lowerIndex = interval.lowerIndex;
|
|
844
|
+
copy.upper.copy(interval.upper);
|
|
845
|
+
copy.upperIndex = interval.upperIndex;
|
|
846
|
+
return copy;
|
|
707
847
|
});
|
|
708
848
|
}
|
|
709
849
|
|
|
710
|
-
singleCell(
|
|
711
|
-
if (this.maxVar === 0) return this.
|
|
712
|
-
|
|
713
|
-
|
|
850
|
+
singleCell() {
|
|
851
|
+
if (this.maxVar === 0) return this.copyIntervals();
|
|
852
|
+
this.todo.reset();
|
|
853
|
+
for (let index = 0; index < this.polynomials.size; index++) {
|
|
854
|
+
const p = new PolynomialRef(this.pm);
|
|
855
|
+
p.set(this.polynomials.get(index));
|
|
856
|
+
this.requestFactorized(p.get());
|
|
857
|
+
p.reset();
|
|
858
|
+
}
|
|
859
|
+
if (this.todo.isEmpty) return this.copyIntervals();
|
|
714
860
|
if (this.todo.getMaxVar() === this.maxVar) {
|
|
715
|
-
this.level = this.todo.extractMaxPolys(this.
|
|
861
|
+
this.level = this.todo.extractMaxPolys(this.levelPs);
|
|
716
862
|
this.processTopLevel();
|
|
717
863
|
}
|
|
718
864
|
while (!this.todo.isEmpty) {
|
|
719
|
-
this.level = this.todo.extractMaxPolys(this.
|
|
865
|
+
this.level = this.todo.extractMaxPolys(this.levelPs);
|
|
720
866
|
this.processLevel();
|
|
721
867
|
}
|
|
722
|
-
return this.
|
|
868
|
+
return this.copyIntervals();
|
|
723
869
|
}
|
|
724
870
|
}
|
|
725
|
-
|
|
726
|
-
// levelwise::single_cell: the cell intervals of the variables below maxVar around the sample.
|
|
727
|
-
// isLinear forces linear bounds, for check_assignment's explanations.
|
|
728
|
-
export const getSingleCell = (
|
|
729
|
-
pm: PolynomialManager,
|
|
730
|
-
am: AlgebraicManager,
|
|
731
|
-
cache: PolynomialCache,
|
|
732
|
-
polynomials: readonly Polynomial[],
|
|
733
|
-
maxVar: number,
|
|
734
|
-
sample: readonly (Anum | undefined)[],
|
|
735
|
-
isLinear: boolean,
|
|
736
|
-
params = DEFAULT_LEVELWISE_PARAMS,
|
|
737
|
-
) => new Levelwise(pm, am, cache, sample, maxVar, isLinear, params).singleCell(polynomials);
|