tla-ts 0.0.9 → 0.0.10-dev.63a6693bd
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 +29 -1
- package/dist/compile.cjs +23 -0
- package/dist/compile.js +23 -0
- package/dist/deciders.cjs +29 -29
- package/dist/deciders.js +42 -42
- package/dist/index.cjs +1 -1
- package/dist/index.d.cts +106 -10
- package/dist/index.d.ts +106 -10
- package/dist/index.js +1 -1
- package/dist/parallel-worker.cjs +1 -1
- package/dist/parallel-worker.js +1 -1
- package/dist/prove-worker.cjs +1 -1
- package/dist/prove-worker.js +1 -1
- package/dist/prove.cjs +117 -37
- package/dist/prove.js +116 -36
- package/dist/run.cjs +143 -31
- package/dist/run.js +143 -31
- package/dist/tlapm.cjs +2 -2
- package/dist/tlapm.js +2 -2
- package/dist/transfer.cjs +129 -104
- package/dist/transfer.js +129 -104
- package/dist/worker.cjs +7 -7
- package/dist/worker.js +7 -7
- package/package.json +3 -1
- package/src/ast.ts +48 -62
- package/src/bags.ts +99 -102
- package/src/builtins.ts +28 -75
- package/src/bundled-modules.ts +1 -8
- package/src/check-failure.ts +116 -0
- package/src/check-trace.ts +282 -0
- package/src/check.ts +599 -754
- package/src/cli/options.ts +12 -32
- package/src/cli/run.ts +0 -2
- package/src/cli/runtime-invariants.ts +136 -0
- package/src/cli/shared.ts +19 -12
- package/src/cli/tlapm.ts +14 -25
- package/src/cli/tlc-arguments.ts +652 -0
- package/src/cli/tlc-output.ts +687 -0
- package/src/cli/tlc-usage.ts +361 -0
- package/src/cli/tlc.ts +309 -658
- package/src/cli/typescript.ts +23 -0
- package/src/cli/xml-exporter.ts +27 -49
- package/src/cli.ts +0 -1
- package/src/codegen.ts +196 -74
- package/src/config.ts +140 -109
- package/src/coverage.ts +830 -0
- package/src/dependencies.ts +14 -53
- package/src/dfid.ts +618 -0
- package/src/environment-config.ts +315 -0
- package/src/environment.ts +169 -335
- package/src/errors.ts +71 -55
- package/src/evaluate.ts +598 -340
- package/src/exit-codes.ts +37 -3
- package/src/fingerprints.ts +75 -11
- package/src/index.ts +3 -0
- package/src/instances.ts +126 -21
- package/src/java-hash.ts +7 -0
- package/src/java-overrides.ts +4 -19
- package/src/json-reader.ts +455 -0
- package/src/json.ts +252 -139
- package/src/levels.ts +46 -58
- package/src/lexer.ts +80 -100
- package/src/liveness-checker.ts +103 -153
- package/src/liveness.ts +150 -109
- package/src/obligations/action.ts +8 -39
- package/src/obligations/anonymize.ts +88 -82
- package/src/obligations/equality.ts +1 -1
- package/src/obligations/expression.ts +20 -21
- package/src/obligations/format.ts +1 -9
- package/src/obligations/generate.ts +46 -49
- package/src/obligations/index.ts +2 -13
- package/src/obligations/levels.ts +4 -8
- package/src/obligations/module.ts +28 -53
- package/src/obligations/normalize.ts +7 -25
- package/src/obligations/operators.ts +1 -2
- package/src/obligations/pragma.ts +1 -10
- package/src/obligations/printer.ts +47 -46
- package/src/obligations/proof.ts +1 -5
- package/src/obligations/regroup.ts +1 -4
- package/src/obligations/simplify.ts +42 -58
- package/src/obligations/source.ts +48 -78
- package/src/obligations/subexpression.ts +5 -11
- package/src/obligations/substitution.ts +1 -3
- package/src/obligations/temporal.ts +13 -19
- package/src/obligations/tuples.ts +3 -9
- package/src/parallel-worker.ts +30 -60
- package/src/parallel.ts +57 -71
- package/src/parser.ts +584 -316
- 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 +3 -7
- package/src/prover/first-order.ts +0 -11
- package/src/prover/isabelle/decide.ts +0 -6
- package/src/prover/isabelle/encode.ts +11 -23
- package/src/prover/isabelle/isar/inner-syntax.ts +114 -115
- package/src/prover/isabelle/isar/method.ts +29 -53
- package/src/prover/isabelle/isar/proof.ts +1 -10
- package/src/prover/isabelle/isar/statement.ts +1 -6
- package/src/prover/isabelle/isar/theory.ts +26 -36
- package/src/prover/isabelle/isar/type-check.ts +17 -31
- package/src/prover/isabelle/provers/blast/blast.ts +17 -104
- package/src/prover/isabelle/provers/blast/branch.ts +1 -32
- package/src/prover/isabelle/provers/blast/prove.ts +1 -35
- package/src/prover/isabelle/provers/blast/rules.ts +6 -44
- package/src/prover/isabelle/provers/blast/state.ts +2 -28
- package/src/prover/isabelle/provers/blast/term.ts +9 -36
- package/src/prover/isabelle/provers/clasimp.ts +1 -13
- package/src/prover/isabelle/provers/classical.ts +14 -42
- package/src/prover/isabelle/provers/hypsubst.ts +28 -51
- package/src/prover/isabelle/pure/bicompose.ts +25 -38
- package/src/prover/isabelle/pure/consts.ts +1 -7
- package/src/prover/isabelle/pure/conv.ts +3 -17
- package/src/prover/isabelle/pure/drule.ts +33 -42
- package/src/prover/isabelle/pure/envir.ts +3 -52
- package/src/prover/isabelle/pure/goal.ts +1 -7
- 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 +2 -15
- package/src/prover/isabelle/pure/name.ts +2 -9
- package/src/prover/isabelle/pure/net.ts +3 -59
- package/src/prover/isabelle/pure/object-logic.ts +3 -10
- package/src/prover/isabelle/pure/pattern.ts +2 -19
- package/src/prover/isabelle/pure/raw-simplifier.ts +17 -62
- package/src/prover/isabelle/pure/rewriter.ts +31 -67
- package/src/prover/isabelle/pure/search.ts +3 -10
- package/src/prover/isabelle/pure/seq.ts +1 -10
- package/src/prover/isabelle/pure/simplifier.ts +4 -12
- package/src/prover/isabelle/pure/table.ts +3 -32
- package/src/prover/isabelle/pure/tactic.ts +12 -22
- package/src/prover/isabelle/pure/tactical.ts +48 -47
- package/src/prover/isabelle/pure/term-ord.ts +2 -6
- package/src/prover/isabelle/pure/term.ts +2 -43
- package/src/prover/isabelle/pure/thm.ts +27 -47
- package/src/prover/isabelle/pure/type.ts +2 -15
- package/src/prover/isabelle/pure/unify.ts +20 -30
- package/src/prover/isabelle/pure/variable.ts +3 -7
- package/src/prover/isabelle/tla/classical-setup.ts +17 -24
- package/src/prover/isabelle/tla/context.ts +15 -18
- package/src/prover/isabelle/tla/logic.ts +14 -32
- package/src/prover/isabelle/tla/simpdata.ts +46 -43
- package/src/prover/isabelle/tools/intuitionistic.ts +1 -10
- package/src/prover/ocaml.ts +0 -6
- package/src/prover/prep/action.ts +14 -54
- package/src/prover/prep/enabled-axioms.ts +12 -19
- package/src/prover/prep/fingerprint.ts +2 -21
- package/src/prover/prep/level-comparison.ts +8 -12
- package/src/prover/prep/md5.ts +0 -2
- package/src/prover/prep/methods.ts +33 -39
- package/src/prover/prep/normalize.ts +4 -28
- package/src/prover/prove-worker.ts +0 -2
- package/src/prover/prove.ts +87 -100
- package/src/prover/ptl/decide.ts +7 -12
- package/src/prover/ptl/encode.ts +14 -36
- package/src/prover/ptl/sat.ts +24 -32
- package/src/prover/ptl/tableau.ts +12 -26
- package/src/prover/smt/axioms.ts +0 -7
- package/src/prover/smt/context.ts +20 -28
- package/src/prover/smt/data.ts +433 -424
- package/src/prover/smt/encode.ts +43 -52
- package/src/prover/smt/extensionality.ts +0 -10
- package/src/prover/smt/flatten.ts +3 -22
- package/src/prover/smt/format.ts +5 -10
- package/src/prover/smt/instances.ts +0 -10
- package/src/prover/smt/rewrite.ts +663 -667
- package/src/prover/smt/solver/act-cache.ts +0 -15
- package/src/prover/smt/solver/arith-rewriter.ts +3 -48
- package/src/prover/smt/solver/array.ts +1 -3
- package/src/prover/smt/solver/asserted-formulas.ts +1 -43
- package/src/prover/smt/solver/ast-lt.ts +1 -11
- package/src/prover/smt/solver/ast-util.ts +1 -6
- package/src/prover/smt/solver/ast.ts +1 -165
- package/src/prover/smt/solver/auf-solver.ts +8 -44
- package/src/prover/smt/solver/case-split-queue.ts +1 -9
- package/src/prover/smt/solver/cg-table.ts +1 -18
- package/src/prover/smt/solver/clause.ts +1 -27
- package/src/prover/smt/solver/conflict-resolution.ts +0 -9
- package/src/prover/smt/solver/context.ts +7 -64
- package/src/prover/smt/solver/ctx-simplify.ts +14 -41
- package/src/prover/smt/solver/der.ts +2 -21
- package/src/prover/smt/solver/dyn-ack.ts +1 -11
- package/src/prover/smt/solver/e-matching.ts +4 -35
- package/src/prover/smt/solver/enode.ts +1 -21
- package/src/prover/smt/solver/expr-ref.ts +1 -5
- package/src/prover/smt/solver/expr-safe-replace.ts +1 -6
- package/src/prover/smt/solver/fingerprints.ts +1 -12
- package/src/prover/smt/solver/flat-literals.ts +1 -9
- package/src/prover/smt/solver/goal.ts +2 -14
- package/src/prover/smt/solver/hash.ts +0 -8
- package/src/prover/smt/solver/hashtable.ts +1 -12
- package/src/prover/smt/solver/internalizer.ts +7 -100
- package/src/prover/smt/solver/lbool.ts +1 -2
- package/src/prover/smt/solver/literal.ts +0 -3
- package/src/prover/smt/solver/lp/bound-propagator.ts +8 -26
- package/src/prover/smt/solver/lp/constraints.ts +2 -8
- package/src/prover/smt/solver/lp/containers.ts +12 -30
- package/src/prover/smt/solver/lp/core-solver.ts +10 -31
- package/src/prover/smt/solver/lp/cross-nested.ts +6 -20
- package/src/prover/smt/solver/lp/dep-intervals.ts +7 -22
- package/src/prover/smt/solver/lp/dependency.ts +1 -4
- package/src/prover/smt/solver/lp/dioph-eq.ts +9 -102
- package/src/prover/smt/solver/lp/explanation.ts +1 -6
- package/src/prover/smt/solver/lp/gomory.ts +9 -22
- package/src/prover/smt/solver/lp/hnf-cutter.ts +17 -23
- package/src/prover/smt/solver/lp/hnf.ts +11 -26
- package/src/prover/smt/solver/lp/int-cube.ts +15 -36
- package/src/prover/smt/solver/lp/int-solver.ts +4 -34
- package/src/prover/smt/solver/lp/lar-solver.ts +32 -81
- package/src/prover/smt/solver/lp/lar-term.ts +1 -5
- package/src/prover/smt/solver/lp/lp-settings.ts +1 -14
- package/src/prover/smt/solver/lp/maximize-term.ts +20 -45
- package/src/prover/smt/solver/lp/nex-creator.ts +5 -28
- package/src/prover/smt/solver/lp/nex.ts +1 -6
- package/src/prover/smt/solver/lp/nla-backoff.ts +1 -4
- package/src/prover/smt/solver/lp/nla-basics.ts +5 -30
- package/src/prover/smt/solver/lp/nla-core.ts +36 -135
- package/src/prover/smt/solver/lp/nla-divisions.ts +32 -42
- package/src/prover/smt/solver/lp/nla-emonics.ts +4 -21
- package/src/prover/smt/solver/lp/nla-factorization.ts +1 -4
- package/src/prover/smt/solver/lp/nla-grobner.ts +15 -69
- package/src/prover/smt/solver/lp/nla-horner.ts +3 -11
- package/src/prover/smt/solver/lp/nla-intervals.ts +2 -12
- package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +16 -41
- package/src/prover/smt/solver/lp/nla-monotone.ts +2 -6
- package/src/prover/smt/solver/lp/nla-order.ts +2 -13
- package/src/prover/smt/solver/lp/nla-patcher.ts +4 -7
- package/src/prover/smt/solver/lp/nla-tangents.ts +1 -9
- package/src/prover/smt/solver/lp/nla-throttle.ts +1 -6
- package/src/prover/smt/solver/lp/nla-types.ts +1 -11
- package/src/prover/smt/solver/lp/nla-var-eqs.ts +4 -25
- package/src/prover/smt/solver/lp/nra-solver.ts +5 -52
- package/src/prover/smt/solver/lp/numeric-pair.ts +1 -4
- package/src/prover/smt/solver/lp/pdd-interval.ts +1 -3
- package/src/prover/smt/solver/lp/pdd-simplifier.ts +2 -14
- package/src/prover/smt/solver/lp/pdd-solver.ts +4 -33
- package/src/prover/smt/solver/lp/pdd.ts +7 -70
- package/src/prover/smt/solver/lp/random-updater.ts +1 -8
- package/src/prover/smt/solver/lp/static-matrix.ts +9 -19
- package/src/prover/smt/solver/lp/union-find.ts +1 -6
- package/src/prover/smt/solver/mam-compiler.ts +18 -58
- package/src/prover/smt/solver/mam-interpreter.ts +1 -21
- package/src/prover/smt/solver/maximize-ac-sharing.ts +2 -17
- package/src/prover/smt/solver/model-checker.ts +3 -37
- package/src/prover/smt/solver/model-evaluator.ts +3 -29
- package/src/prover/smt/solver/model-finder.ts +15 -32
- package/src/prover/smt/solver/model-generator.ts +1 -12
- package/src/prover/smt/solver/model-macro-solver.ts +23 -88
- package/src/prover/smt/solver/nlsat/algebraic.ts +63 -159
- package/src/prover/smt/solver/nlsat/atoms.ts +25 -23
- package/src/prover/smt/solver/nlsat/evaluator.ts +17 -22
- package/src/prover/smt/solver/nlsat/explain.ts +10 -69
- package/src/prover/smt/solver/nlsat/interval-set.ts +9 -50
- package/src/prover/smt/solver/nlsat/levelwise.ts +49 -135
- package/src/prover/smt/solver/nlsat/mpbq.ts +3 -14
- package/src/prover/smt/solver/nlsat/polynomial.ts +29 -159
- package/src/prover/smt/solver/nlsat/solver.ts +18 -90
- package/src/prover/smt/solver/nlsat/types.ts +1 -8
- package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +2 -45
- package/src/prover/smt/solver/nlsat/upolynomial.ts +11 -92
- package/src/prover/smt/solver/nnf.ts +3 -38
- package/src/prover/smt/solver/pattern-inference.ts +2 -15
- package/src/prover/smt/solver/poly-rewriter.ts +3 -23
- package/src/prover/smt/solver/propagate-values.ts +1 -10
- package/src/prover/smt/solver/proto-model.ts +3 -52
- package/src/prover/smt/solver/pull-quant.ts +1 -12
- package/src/prover/smt/solver/qe-lite-der.ts +1 -29
- package/src/prover/smt/solver/qe-lite-fm.ts +2 -25
- package/src/prover/smt/solver/qe-lite.ts +3 -33
- package/src/prover/smt/solver/qi-queue.ts +1 -16
- package/src/prover/smt/solver/quant-tactics.ts +5 -22
- package/src/prover/smt/solver/quantifier-analyzer.ts +27 -47
- package/src/prover/smt/solver/quantifier-manager.ts +2 -13
- package/src/prover/smt/solver/random-gen.ts +1 -2
- package/src/prover/smt/solver/rational.ts +1 -8
- package/src/prover/smt/solver/ref-vector.ts +1 -6
- package/src/prover/smt/solver/relevancy.ts +2 -15
- package/src/prover/smt/solver/rewriter-tpl.ts +3 -147
- package/src/prover/smt/solver/rewriter.ts +3 -85
- package/src/prover/smt/solver/rlimit.ts +2 -20
- package/src/prover/smt/solver/smtlib-parser.ts +80 -131
- package/src/prover/smt/solver/solver.ts +23 -34
- package/src/prover/smt/solver/sort.ts +1 -5
- package/src/prover/smt/solver/sticky-generations.ts +0 -5
- package/src/prover/smt/solver/theory-lra-axioms.ts +3 -24
- package/src/prover/smt/solver/theory-lra-bounds.ts +1 -7
- package/src/prover/smt/solver/theory-lra-final-check.ts +4 -22
- package/src/prover/smt/solver/theory-lra-internalize.ts +6 -43
- package/src/prover/smt/solver/theory-lra-model.ts +4 -19
- package/src/prover/smt/solver/theory-lra-propagate.ts +1 -15
- package/src/prover/smt/solver/theory-lra-state.ts +3 -8
- package/src/prover/smt/solver/theory-lra.ts +1 -8
- package/src/prover/smt/solver/var-subst.ts +2 -26
- package/src/prover/smt/table.ts +0 -8
- package/src/prover/tlapm/cache.ts +45 -40
- package/src/prover/tlapm/ocaml-marshal.ts +19 -21
- package/src/prover/tlapm/tlapm.ts +21 -20
- package/src/prover/verdict.ts +7 -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 +0 -12
- package/src/prover/zenon/encode.ts +1 -8
- package/src/prover/zenon/eqrel.ts +2 -13
- package/src/prover/zenon/equality-rules.ts +0 -4
- package/src/prover/zenon/expr.ts +8 -26
- package/src/prover/zenon/index-table.ts +26 -57
- package/src/prover/zenon/isar-case.ts +9 -19
- package/src/prover/zenon/isar.ts +36 -64
- package/src/prover/zenon/limits.ts +0 -4
- package/src/prover/zenon/llproof.ts +2 -20
- package/src/prover/zenon/mltoll.ts +66 -104
- package/src/prover/zenon/node.ts +1 -11
- package/src/prover/zenon/ocaml.ts +1 -17
- package/src/prover/zenon/parse.ts +4 -12
- package/src/prover/zenon/phrase.ts +1 -11
- package/src/prover/zenon/proof.ts +0 -9
- package/src/prover/zenon/propositional-rules.ts +0 -5
- package/src/prover/zenon/rules.ts +2 -6
- package/src/prover/zenon/search.ts +5 -31
- package/src/prover/zenon/tla/functions.ts +59 -31
- package/src/prover/zenon/tla/llproof.ts +67 -76
- package/src/prover/zenon/tla/records.ts +57 -33
- package/src/prover/zenon/tla/rewrites.ts +12 -19
- package/src/prover/zenon/tla/sets.ts +83 -53
- package/src/prover/zenon/tla/terms.ts +0 -6
- package/src/prover/zenon/tla/tla.ts +66 -64
- package/src/randomization.ts +81 -35
- package/src/resolve.ts +67 -184
- package/src/runtime.ts +22 -22
- package/src/sany/builtins.ts +2 -5
- package/src/sany/generation.ts +394 -0
- package/src/sany/generator-def-entries.ts +210 -0
- package/src/sany/generator-definitions.ts +686 -0
- package/src/sany/generator-expressions.ts +1100 -0
- package/src/sany/generator-proofs.ts +662 -0
- package/src/sany/generator.ts +191 -2764
- package/src/sany/levels.ts +6 -34
- package/src/sany/lexer.ts +58 -77
- package/src/sany/linter.ts +1 -9
- package/src/sany/modules.ts +1 -5
- package/src/sany/nodes.ts +5 -43
- package/src/sany/parse-error.ts +39 -117
- package/src/sany/report.ts +32 -69
- package/src/sany/selectors.ts +49 -76
- package/src/sany/source.ts +1 -17
- package/src/sany/xml.ts +35 -117
- package/src/search.ts +541 -163
- package/src/simulate.ts +709 -0
- package/src/spec-description.ts +192 -100
- package/src/standard-definitions.ts +0 -4
- package/src/standard-modules.ts +264 -95
- package/src/state-graph.ts +52 -31
- package/src/subexpressions.ts +69 -52
- package/src/substitution-levels.ts +7 -7
- package/src/successors.ts +266 -99
- package/src/symmetry.ts +33 -25
- package/src/tableau.ts +27 -24
- package/src/tlc/fingerprint.ts +183 -67
- package/src/tlc/jar-data.ts +112 -6
- package/src/tlc/messages.ts +125 -54
- package/src/tlc/order.ts +39 -69
- package/src/tlc/random.ts +37 -49
- package/src/tlc/replay.ts +553 -228
- package/src/tlc/summary.ts +36 -47
- package/src/tlc/tlc-operators.ts +78 -44
- package/src/tlc/tlcext-operators.ts +139 -122
- package/src/tlc/trace-spec.ts +249 -0
- package/src/tlc/value-stream.ts +139 -0
- package/src/tlc/version.ts +1 -4
- package/src/transfer.ts +22 -25
- package/src/typescript/actions.ts +479 -0
- package/src/typescript/collections.ts +614 -0
- package/src/typescript/compile.ts +63 -0
- package/src/typescript/context.ts +94 -0
- package/src/typescript/emit.ts +121 -0
- package/src/typescript/expressions.ts +496 -0
- package/src/typescript/formula.ts +154 -0
- package/src/typescript/functions.ts +284 -0
- package/src/typescript/model.ts +162 -0
- package/src/typescript/names.ts +114 -0
- package/src/typescript/program.ts +48 -0
- package/src/typescript/properties.ts +139 -0
- package/src/typescript/scope.ts +112 -0
- package/src/typescript/steps.ts +167 -0
- package/src/typescript/types.ts +171 -0
- package/src/values.ts +832 -484
- package/src/worker.ts +7 -8
|
@@ -1,50 +1,20 @@
|
|
|
1
1
|
// Ported from Z3 (src/math/polynomial/polynomial.{h,cpp}, src/math/polynomial/polynomial_cache.cpp),
|
|
2
|
-
// MIT license, see z3-license.txt.
|
|
3
|
-
// Z3's factorization: univariate through upolynomial-factorization, quadratics through the square
|
|
4
|
-
// root of the discriminant, and higher degrees through bivariate Hensel lifting. A polynomial keeps its monomials in the order Z3's som buffers
|
|
5
|
-
// produce, with a monomial of maximal degree in the maximal variable first, because factorization
|
|
6
|
-
// breaks ties on the order in which variables occur.
|
|
7
|
-
//
|
|
8
|
-
// Deviations from Z3, which only change the order of equal results:
|
|
9
|
-
// - gcd computes with Z3's subresultant PRS (gcd_prs), not its modular algorithms (mod_gcd,
|
|
10
|
-
// uni_mod_gcd). Both return the same polynomial, normalized to a positive leading coefficient,
|
|
11
|
-
// but its monomials may come out in another order. Z3's modular gcd can also return a constant
|
|
12
|
-
// other than 1 for coprime primitive polynomials, gcd(2x - 3, 2x - 1) = 2
|
|
13
|
-
// (polynomial.cpp:4815), where this port returns 1. The callers in scope only test whether
|
|
14
|
-
// the gcd is constant.
|
|
15
|
-
// - Polynomial ids count up from zero. Z3 recycles the ids of deleted polynomials, so where nlsat
|
|
16
|
-
// breaks a tie between two root functions on their ids it may pick the other one. Matching Z3
|
|
17
|
-
// would take explicit reference counts at its roughly 490 polynomial_ref sites in polynomial,
|
|
18
|
-
// algebraic_numbers, explain, levelwise and nra, and every pm routine allocating the same
|
|
19
|
-
// temporaries as Z3's, not just returning the same result. Random differential tests hit such a
|
|
20
|
-
// tie in about 1 of 300 levelwise and 1 of 3,000 explain programs, and no corpus trace yet.
|
|
2
|
+
// MIT license, see z3-license.txt.
|
|
21
3
|
import { SmtInvariantError } from "../../../../errors";
|
|
22
4
|
import { getGcd, Rational } from "../rational";
|
|
23
|
-
import { UpolynomialManager } from "./upolynomial";
|
|
5
|
+
import { floorDiv, UpolynomialManager } from "./upolynomial";
|
|
24
6
|
import {
|
|
25
7
|
DEFAULT_FACTOR_PARAMS,
|
|
26
8
|
factorSquareFree,
|
|
27
9
|
getExactSquareRoot,
|
|
28
|
-
|
|
10
|
+
mkFactors,
|
|
29
11
|
} from "./upolynomial-factorization";
|
|
30
12
|
|
|
31
13
|
export const NULL_VAR = -1;
|
|
32
14
|
|
|
33
|
-
// s_factor_eval_values and s_factor_primes: the points multivariate factorization evaluates the
|
|
34
|
-
// other variables at, and the primes it lifts modulo.
|
|
35
15
|
const FACTOR_EVAL_VALUES = [0n, 1n, -1n, 2n, -2n, 3n, -3n];
|
|
36
16
|
const FACTOR_PRIMES = [39103n, 104729n, 1000003n, 100000007n];
|
|
37
17
|
|
|
38
|
-
// mpz div: rounds toward minus infinity.
|
|
39
|
-
const floorDiv = (dividend: bigint, divisor: bigint) => {
|
|
40
|
-
const quotient = dividend / divisor;
|
|
41
|
-
return dividend % divisor !== 0n && dividend < 0n !== divisor < 0n ? quotient - 1n : quotient;
|
|
42
|
-
};
|
|
43
|
-
|
|
44
|
-
// Input outside what the port of nlsat supports so far: subresultants of polynomials of degree 2
|
|
45
|
-
// or more in the variable being projected. The nra solver answers unknown on it, which is always
|
|
46
|
-
// sound.
|
|
47
|
-
// The arithmetic t_eval evaluates in: rationals, intervals or algebraic numbers.
|
|
48
18
|
export interface ValueOps<T> {
|
|
49
19
|
fromInteger(value: bigint): T;
|
|
50
20
|
add(first: T, second: T): T;
|
|
@@ -65,7 +35,6 @@ const getMonomialKey = (vars: readonly number[], degrees: readonly number[]) =>
|
|
|
65
35
|
class Monomial {
|
|
66
36
|
readonly totalDegree: number;
|
|
67
37
|
|
|
68
|
-
// vars and degrees change only when the manager renames the variables.
|
|
69
38
|
constructor(
|
|
70
39
|
readonly id: number,
|
|
71
40
|
public vars: readonly number[],
|
|
@@ -93,7 +62,6 @@ class Monomial {
|
|
|
93
62
|
return index === -1 ? 0 : this.degrees[index];
|
|
94
63
|
}
|
|
95
64
|
|
|
96
|
-
// max_smaller_than: the largest variable of the monomial below x.
|
|
97
65
|
maxSmallerThan(variable: number) {
|
|
98
66
|
let result = NULL_VAR;
|
|
99
67
|
for (const current of this.vars) if (current < variable) result = current;
|
|
@@ -101,7 +69,6 @@ class Monomial {
|
|
|
101
69
|
}
|
|
102
70
|
}
|
|
103
71
|
|
|
104
|
-
// lex_compare: the biggest variable dominates, then its degree.
|
|
105
72
|
const lexCompare = (first: Monomial, second: Monomial) => {
|
|
106
73
|
if (first === second) return 0;
|
|
107
74
|
let firstIndex = first.size - 1;
|
|
@@ -131,7 +98,6 @@ const gradedLexCompare = (first: Monomial, second: Monomial) =>
|
|
|
131
98
|
? -1
|
|
132
99
|
: 1;
|
|
133
100
|
|
|
134
|
-
// po_gt: the order that puts a monomial with the maximal variable at its maximal degree first.
|
|
135
101
|
const isPoGreater = (first: Monomial, second: Monomial) => {
|
|
136
102
|
if (first.size === 0) return false;
|
|
137
103
|
if (second.size === 0) return true;
|
|
@@ -150,7 +116,6 @@ export class Polynomial {
|
|
|
150
116
|
this.makeFirstMaximal();
|
|
151
117
|
}
|
|
152
118
|
|
|
153
|
-
// make_first_maximal: a monomial with the maximal variable at its maximal degree first.
|
|
154
119
|
makeFirstMaximal() {
|
|
155
120
|
if (this.ms.length <= 1) return;
|
|
156
121
|
let maxPos = 0;
|
|
@@ -174,8 +139,7 @@ export class Polynomial {
|
|
|
174
139
|
this.ms[position] = monomial;
|
|
175
140
|
}
|
|
176
141
|
|
|
177
|
-
//
|
|
178
|
-
// hashes the polynomial.
|
|
142
|
+
// Z3 sorts in place whenever it hashes or evaluates the polynomial, so later reads see this order.
|
|
179
143
|
lexSort() {
|
|
180
144
|
if (this.isLexSorted) return;
|
|
181
145
|
this.isLexSorted = true;
|
|
@@ -190,7 +154,6 @@ export class Polynomial {
|
|
|
190
154
|
}
|
|
191
155
|
}
|
|
192
156
|
|
|
193
|
-
// graded_lex_max_pos
|
|
194
157
|
getGradedLexMaxPos() {
|
|
195
158
|
if (this.ms.length === 0) return -1;
|
|
196
159
|
let maxPos = 0;
|
|
@@ -214,8 +177,6 @@ export class Polynomial {
|
|
|
214
177
|
}
|
|
215
178
|
}
|
|
216
179
|
|
|
217
|
-
// som_buffer: a sum of monomials, each kept at the position where it first appeared. Zero entries
|
|
218
|
-
// stay until mk removes them.
|
|
219
180
|
class SomBuffer {
|
|
220
181
|
as: bigint[] = [];
|
|
221
182
|
ms: Monomial[] = [];
|
|
@@ -253,7 +214,6 @@ class SomBuffer {
|
|
|
253
214
|
}
|
|
254
215
|
}
|
|
255
216
|
|
|
256
|
-
// addmul: adds a*m*p.
|
|
257
217
|
addmul(coeff: bigint, monomial: Monomial, polynomial: Polynomial) {
|
|
258
218
|
if (coeff === 0n) return;
|
|
259
219
|
for (let index = 0; index < polynomial.size; index++) {
|
|
@@ -267,8 +227,7 @@ class SomBuffer {
|
|
|
267
227
|
}
|
|
268
228
|
}
|
|
269
229
|
|
|
270
|
-
//
|
|
271
|
-
// which keeps their monomials at new positions as Z3 does.
|
|
230
|
+
// Like Z3, zero entries of the other buffer are added too, which keeps their monomials' positions.
|
|
272
231
|
addmulBuffer(coeff: bigint, monomial: Monomial, buffer: SomBuffer) {
|
|
273
232
|
if (coeff === 0n) return;
|
|
274
233
|
for (let index = 0; index < buffer.ms.length; index++) {
|
|
@@ -291,7 +250,6 @@ class SomBuffer {
|
|
|
291
250
|
return maxPos;
|
|
292
251
|
}
|
|
293
252
|
|
|
294
|
-
// mk(normalize): the nonzero entries, divided by the gcd of their coefficients when normalizing.
|
|
295
253
|
mk(isNormalized = false) {
|
|
296
254
|
const as: bigint[] = [];
|
|
297
255
|
const ms: Monomial[] = [];
|
|
@@ -306,7 +264,6 @@ class SomBuffer {
|
|
|
306
264
|
}
|
|
307
265
|
}
|
|
308
266
|
|
|
309
|
-
// cheap_som_buffer: each monomial is added at most once, so it needs no position map.
|
|
310
267
|
class CheapSomBuffer {
|
|
311
268
|
private as: bigint[] = [];
|
|
312
269
|
private ms: Monomial[] = [];
|
|
@@ -358,8 +315,6 @@ export class PolynomialManager {
|
|
|
358
315
|
this.one = this.mkPolynomialCore([1n], [this.unit]);
|
|
359
316
|
}
|
|
360
317
|
|
|
361
|
-
// Monomials.
|
|
362
|
-
|
|
363
318
|
mkMonomial(vars: readonly number[], degrees: readonly number[]) {
|
|
364
319
|
const key = getMonomialKey(vars, degrees);
|
|
365
320
|
const existing = this.monomials.get(key);
|
|
@@ -369,10 +324,6 @@ export class PolynomialManager {
|
|
|
369
324
|
return monomial;
|
|
370
325
|
}
|
|
371
326
|
|
|
372
|
-
// rename: every variable x becomes permutation[x], in place in every monomial, as Z3 renames its
|
|
373
|
-
// monomial table. Z3 then moves a maximal monomial first in every live polynomial. Here that is
|
|
374
|
-
// the given polynomials, the ones nlsat keeps in its atoms. Others keep their order, which
|
|
375
|
-
// matches again once the order is restored.
|
|
376
327
|
rename(permutation: readonly number[], polynomials: Iterable<Polynomial>) {
|
|
377
328
|
const monomials = new Map<string, Monomial>();
|
|
378
329
|
for (const monomial of this.monomials.values()) {
|
|
@@ -390,7 +341,6 @@ export class PolynomialManager {
|
|
|
390
341
|
for (const polynomial of polynomials) polynomial.makeFirstMaximal();
|
|
391
342
|
}
|
|
392
343
|
|
|
393
|
-
// mk_monomial(x, k): x^k, the unit for k = 0.
|
|
394
344
|
mkPower(variable: number, power: number) {
|
|
395
345
|
return power === 0 ? this.unit : this.mkMonomial([variable], [power]);
|
|
396
346
|
}
|
|
@@ -419,7 +369,6 @@ export class PolynomialManager {
|
|
|
419
369
|
return this.mkMonomial(vars, degrees);
|
|
420
370
|
}
|
|
421
371
|
|
|
422
|
-
// div: m1/m2, or null when m2 does not divide m1.
|
|
423
372
|
divMonomials(first: Monomial, second: Monomial) {
|
|
424
373
|
const vars: number[] = [];
|
|
425
374
|
const degrees: number[] = [];
|
|
@@ -439,7 +388,6 @@ export class PolynomialManager {
|
|
|
439
388
|
return secondIndex < second.size ? null : this.mkMonomial(vars, degrees);
|
|
440
389
|
}
|
|
441
390
|
|
|
442
|
-
// div_x_k: m/x^k.
|
|
443
391
|
private divXk(monomial: Monomial, variable: number, power: number) {
|
|
444
392
|
const vars: number[] = [];
|
|
445
393
|
const degrees: number[] = [];
|
|
@@ -455,13 +403,10 @@ export class PolynomialManager {
|
|
|
455
403
|
return this.mkMonomial(vars, degrees);
|
|
456
404
|
}
|
|
457
405
|
|
|
458
|
-
// div_x: m with x removed.
|
|
459
406
|
private divX(monomial: Monomial, variable: number) {
|
|
460
407
|
return this.divXk(monomial, variable, monomial.degreeOf(variable));
|
|
461
408
|
}
|
|
462
409
|
|
|
463
|
-
// Construction.
|
|
464
|
-
|
|
465
410
|
mkPolynomialCore(as: bigint[], ms: Monomial[]) {
|
|
466
411
|
return new Polynomial(this.nextPolynomialId++, as, ms);
|
|
467
412
|
}
|
|
@@ -482,7 +427,6 @@ export class PolynomialManager {
|
|
|
482
427
|
return this.som.mk();
|
|
483
428
|
}
|
|
484
429
|
|
|
485
|
-
// mk_linear: sum of as[i]*xs[i] plus c.
|
|
486
430
|
mkLinear(as: readonly bigint[], vars: readonly number[], constant: bigint) {
|
|
487
431
|
const coeffs: bigint[] = [];
|
|
488
432
|
const ms: Monomial[] = [];
|
|
@@ -498,8 +442,6 @@ export class PolynomialManager {
|
|
|
498
442
|
return this.mkPolynomial(coeffs, ms);
|
|
499
443
|
}
|
|
500
444
|
|
|
501
|
-
// Queries.
|
|
502
|
-
|
|
503
445
|
isZero(polynomial: Polynomial) {
|
|
504
446
|
return polynomial.size === 0;
|
|
505
447
|
}
|
|
@@ -520,6 +462,15 @@ export class PolynomialManager {
|
|
|
520
462
|
return polynomial.size === 0 ? NULL_VAR : polynomial.ms[0].maxVar;
|
|
521
463
|
}
|
|
522
464
|
|
|
465
|
+
getMaxVarOfPolys(polynomials: readonly Polynomial[]) {
|
|
466
|
+
let result = NULL_VAR;
|
|
467
|
+
for (const polynomial of polynomials) {
|
|
468
|
+
const variable = this.maxVar(polynomial);
|
|
469
|
+
if (result === NULL_VAR || variable > result) result = variable;
|
|
470
|
+
}
|
|
471
|
+
return result;
|
|
472
|
+
}
|
|
473
|
+
|
|
523
474
|
degree(polynomial: Polynomial, variable: number) {
|
|
524
475
|
let result = 0;
|
|
525
476
|
for (const monomial of polynomial.ms) result = Math.max(result, monomial.degreeOf(variable));
|
|
@@ -532,7 +483,6 @@ export class PolynomialManager {
|
|
|
532
483
|
return result;
|
|
533
484
|
}
|
|
534
485
|
|
|
535
|
-
// eq: the same monomials with the same coefficients, in any order.
|
|
536
486
|
eq(first: Polynomial, second: Polynomial) {
|
|
537
487
|
if (first === second) return true;
|
|
538
488
|
if (first.size !== second.size) return false;
|
|
@@ -546,8 +496,6 @@ export class PolynomialManager {
|
|
|
546
496
|
return true;
|
|
547
497
|
}
|
|
548
498
|
|
|
549
|
-
// The key of the hash-consing table. It lexicographically sorts the polynomial in place, as Z3's
|
|
550
|
-
// hash does.
|
|
551
499
|
getKey(polynomial: Polynomial) {
|
|
552
500
|
polynomial.lexSort();
|
|
553
501
|
let key = "";
|
|
@@ -556,8 +504,6 @@ export class PolynomialManager {
|
|
|
556
504
|
return key;
|
|
557
505
|
}
|
|
558
506
|
|
|
559
|
-
// Arithmetic.
|
|
560
|
-
|
|
561
507
|
private addmul(firstCoeff: bigint, first: Polynomial, secondCoeff: bigint, second: Polynomial) {
|
|
562
508
|
this.som.reset();
|
|
563
509
|
this.som.addmul(firstCoeff, this.unit, first);
|
|
@@ -581,7 +527,6 @@ export class PolynomialManager {
|
|
|
581
527
|
return this.som.mk();
|
|
582
528
|
}
|
|
583
529
|
|
|
584
|
-
// mul(a, m, p): a*m*p.
|
|
585
530
|
mulTerm(coeff: bigint, monomial: Monomial, polynomial: Polynomial) {
|
|
586
531
|
if (coeff === 0n) return this.zero;
|
|
587
532
|
if (coeff === 1n && monomial === this.unit) return polynomial;
|
|
@@ -606,7 +551,6 @@ export class PolynomialManager {
|
|
|
606
551
|
return result;
|
|
607
552
|
}
|
|
608
553
|
|
|
609
|
-
// coeff: the coefficient of x^k, a polynomial in the other variables.
|
|
610
554
|
coeff(polynomial: Polynomial, variable: number, power: number) {
|
|
611
555
|
for (let index = 0; index < polynomial.size; index++) {
|
|
612
556
|
const monomial = polynomial.ms[index];
|
|
@@ -616,7 +560,6 @@ export class PolynomialManager {
|
|
|
616
560
|
return this.cheap.mk();
|
|
617
561
|
}
|
|
618
562
|
|
|
619
|
-
// const_coeff: the coefficient of x^k when it is a number, else null.
|
|
620
563
|
getConstCoeff(polynomial: Polynomial, variable: number, power: number) {
|
|
621
564
|
let result = 0n;
|
|
622
565
|
for (let index = 0; index < polynomial.size; index++) {
|
|
@@ -642,13 +585,11 @@ export class PolynomialManager {
|
|
|
642
585
|
return this.cheap.mk();
|
|
643
586
|
}
|
|
644
587
|
|
|
645
|
-
// flip_sign_if_lm_neg: negates p when its graded-lex leading coefficient is negative.
|
|
646
588
|
flipSignIfLmNeg(polynomial: Polynomial) {
|
|
647
589
|
if (polynomial.size === 0) return polynomial;
|
|
648
590
|
return polynomial.as[polynomial.getGradedLexMaxPos()] < 0n ? this.neg(polynomial) : polynomial;
|
|
649
591
|
}
|
|
650
592
|
|
|
651
|
-
// ic: the integer content, the gcd of the coefficients.
|
|
652
593
|
private getIc(polynomial: Polynomial) {
|
|
653
594
|
if (polynomial.size === 0) return 0n;
|
|
654
595
|
if (this.isConst(polynomial)) return polynomial.as[0];
|
|
@@ -660,7 +601,6 @@ export class PolynomialManager {
|
|
|
660
601
|
return result;
|
|
661
602
|
}
|
|
662
603
|
|
|
663
|
-
// ic(p, a, c): p = a*c, with the coefficients of c coprime.
|
|
664
604
|
private icWithContent(polynomial: Polynomial): [bigint, Polynomial] {
|
|
665
605
|
if (polynomial.size === 0) return [0n, polynomial];
|
|
666
606
|
if (this.isConst(polynomial)) return [polynomial.as[0], this.one];
|
|
@@ -672,7 +612,6 @@ export class PolynomialManager {
|
|
|
672
612
|
return [content, this.cheap.mk()];
|
|
673
613
|
}
|
|
674
614
|
|
|
675
|
-
// iccp: the integer content, the content and the primitive part of p with respect to x.
|
|
676
615
|
iccp(polynomial: Polynomial, variable: number): [bigint, Polynomial, Polynomial] {
|
|
677
616
|
if (polynomial.size === 0) return [0n, this.one, polynomial];
|
|
678
617
|
if (this.isConst(polynomial)) return [polynomial.as[0], this.one, this.one];
|
|
@@ -681,7 +620,6 @@ export class PolynomialManager {
|
|
|
681
620
|
const [integer, content] = this.icWithContent(polynomial);
|
|
682
621
|
return [integer, content, this.one];
|
|
683
622
|
}
|
|
684
|
-
// The quick filter: a power of x that occurs only as a pure power means the content is 1.
|
|
685
623
|
const filter = Array.from({ length: degree + 1 }, () => 0);
|
|
686
624
|
const powers: number[] = [];
|
|
687
625
|
for (const monomial of polynomial.ms) {
|
|
@@ -704,8 +642,6 @@ export class PolynomialManager {
|
|
|
704
642
|
return this.iccp(polynomial, variable)[2];
|
|
705
643
|
}
|
|
706
644
|
|
|
707
|
-
// square_free: the integer content times the square-free parts of the content and the primitive
|
|
708
|
-
// part in the maximal variable, or p itself when it is square-free.
|
|
709
645
|
squareFree(polynomial: Polynomial): Polynomial {
|
|
710
646
|
if (this.isConst(polynomial)) return polynomial;
|
|
711
647
|
const variable = this.maxVar(polynomial);
|
|
@@ -717,7 +653,6 @@ export class PolynomialManager {
|
|
|
717
653
|
return this.mul(this.mulConst(integer, squareFreeContent), squareFreePrimitive);
|
|
718
654
|
}
|
|
719
655
|
|
|
720
|
-
// normalize: p divided by the gcd of its coefficients.
|
|
721
656
|
normalize(polynomial: Polynomial) {
|
|
722
657
|
if (polynomial.size === 0) return polynomial;
|
|
723
658
|
let g = 0n;
|
|
@@ -728,13 +663,11 @@ export class PolynomialManager {
|
|
|
728
663
|
return this.cheap.mk();
|
|
729
664
|
}
|
|
730
665
|
|
|
731
|
-
// nonzero_const_coeff: whether the coefficient of x^k is a nonzero number.
|
|
732
666
|
isNonzeroConstCoeff(polynomial: Polynomial, variable: number, power: number) {
|
|
733
667
|
const coeff = this.getConstCoeff(polynomial, variable, power);
|
|
734
668
|
return coeff !== null && coeff !== 0n;
|
|
735
669
|
}
|
|
736
670
|
|
|
737
|
-
// exact_div: p/q, where q divides p.
|
|
738
671
|
exactDiv(polynomial: Polynomial, divisor: Polynomial) {
|
|
739
672
|
if (polynomial.size === 0) return polynomial;
|
|
740
673
|
const remainder = this.som;
|
|
@@ -759,8 +692,6 @@ export class PolynomialManager {
|
|
|
759
692
|
}
|
|
760
693
|
}
|
|
761
694
|
|
|
762
|
-
// exact_pseudo_division: Q and R with lc(q)^(deg(p) - deg(q) + 1) * p = Q*q + R. The
|
|
763
|
-
// quotient is only built when asked for, as in pseudo_division_core.
|
|
764
695
|
exactPseudoDivision(
|
|
765
696
|
polynomial: Polynomial,
|
|
766
697
|
divisor: Polynomial,
|
|
@@ -770,7 +701,6 @@ export class PolynomialManager {
|
|
|
770
701
|
return this.pseudoDivisionCore(polynomial, divisor, variable, true, isQuotient);
|
|
771
702
|
}
|
|
772
703
|
|
|
773
|
-
// pseudo_remainder: R with lc(q)^d * p = Q*q + R, where d counts the division steps.
|
|
774
704
|
pseudoRemainder(polynomial: Polynomial, divisor: Polynomial, variable: number) {
|
|
775
705
|
return this.pseudoDivisionCore(polynomial, divisor, variable, false, false);
|
|
776
706
|
}
|
|
@@ -835,7 +765,6 @@ export class PolynomialManager {
|
|
|
835
765
|
return this.exactPseudoDivision(polynomial, divisor, variable, false).remainder;
|
|
836
766
|
}
|
|
837
767
|
|
|
838
|
-
// The reduct of coeff(p, x, k, reduct): p without its x^k monomials.
|
|
839
768
|
reduct(polynomial: Polynomial, variable: number, power: number) {
|
|
840
769
|
for (let index = 0; index < polynomial.size; index++)
|
|
841
770
|
if (polynomial.ms[index].degreeOf(variable) !== power)
|
|
@@ -843,18 +772,24 @@ export class PolynomialManager {
|
|
|
843
772
|
return this.cheap.mk();
|
|
844
773
|
}
|
|
845
774
|
|
|
846
|
-
|
|
847
|
-
private getVarMaxDegrees(polynomial: Polynomial) {
|
|
775
|
+
private getMaxDegrees(polynomial: Polynomial) {
|
|
848
776
|
const degrees = new Map<number, number>();
|
|
849
777
|
for (const monomial of polynomial.ms)
|
|
850
778
|
for (let index = 0; index < monomial.size; index++) {
|
|
851
779
|
const variable = monomial.vars[index];
|
|
852
|
-
degrees
|
|
780
|
+
if (monomial.degrees[index] > (degrees.get(variable) ?? 0))
|
|
781
|
+
degrees.set(variable, monomial.degrees[index]);
|
|
853
782
|
}
|
|
854
|
-
return
|
|
783
|
+
return degrees;
|
|
784
|
+
}
|
|
785
|
+
|
|
786
|
+
private getVarMaxDegrees(polynomial: Polynomial) {
|
|
787
|
+
return [...this.getMaxDegrees(polynomial).entries()].sort(
|
|
788
|
+
(first, second) => first[0] - second[0],
|
|
789
|
+
);
|
|
855
790
|
}
|
|
856
791
|
|
|
857
|
-
//
|
|
792
|
+
// Deviation from Z3: subresultant PRS (gcd_prs), not mod_gcd, which can return 2 for coprime inputs (polynomial.cpp:4815).
|
|
858
793
|
gcd(first: Polynomial, second: Polynomial): Polynomial {
|
|
859
794
|
if (first.size === 0) return this.flipSignIfLmNeg(second);
|
|
860
795
|
if (second.size === 0) return this.flipSignIfLmNeg(first);
|
|
@@ -875,13 +810,11 @@ export class PolynomialManager {
|
|
|
875
810
|
return this.gcdPrs(first, second, firstDegrees[size - 1][0]);
|
|
876
811
|
}
|
|
877
812
|
|
|
878
|
-
// gcd_content: gcd(content(u, x), v).
|
|
879
813
|
private gcdContent(polynomial: Polynomial, variable: number, other: Polynomial) {
|
|
880
814
|
const [integer, content] = this.iccp(polynomial, variable);
|
|
881
815
|
return this.gcd(this.mulConst(integer, content), other);
|
|
882
816
|
}
|
|
883
817
|
|
|
884
|
-
// gcd_prs: Collins' subresultant polynomial remainder sequence.
|
|
885
818
|
private gcdPrs(first: Polynomial, second: Polynomial, variable: number) {
|
|
886
819
|
const [u, v] =
|
|
887
820
|
this.degree(first, variable) < this.degree(second, variable)
|
|
@@ -914,18 +847,10 @@ export class PolynomialManager {
|
|
|
914
847
|
}
|
|
915
848
|
}
|
|
916
849
|
|
|
917
|
-
// get_min_degree_var: the first variable, in order of occurrence, of minimal degree.
|
|
918
850
|
private getMinDegreeVar(polynomial: Polynomial) {
|
|
919
|
-
const degrees = new Map<number, number>();
|
|
920
|
-
for (const monomial of polynomial.ms)
|
|
921
|
-
for (let index = 0; index < monomial.size; index++) {
|
|
922
|
-
const variable = monomial.vars[index];
|
|
923
|
-
if (monomial.degrees[index] > (degrees.get(variable) ?? 0))
|
|
924
|
-
degrees.set(variable, monomial.degrees[index]);
|
|
925
|
-
}
|
|
926
851
|
let result = NULL_VAR;
|
|
927
852
|
let minDegree = Infinity;
|
|
928
|
-
for (const [variable, degree] of
|
|
853
|
+
for (const [variable, degree] of this.getMaxDegrees(polynomial))
|
|
929
854
|
if (degree < minDegree) {
|
|
930
855
|
result = variable;
|
|
931
856
|
minDegree = degree;
|
|
@@ -933,8 +858,6 @@ export class PolynomialManager {
|
|
|
933
858
|
return result;
|
|
934
859
|
}
|
|
935
860
|
|
|
936
|
-
// factor: the constant and the irreducible factors, each with its multiplicity. A square-free
|
|
937
|
-
// primitive part of degree 2 or more in its variable of minimal degree is out of scope.
|
|
938
861
|
factor(polynomial: Polynomial): Factors {
|
|
939
862
|
const result: Factors = { constant: 1n, factors: [], degrees: [] };
|
|
940
863
|
if (polynomial.size === 0) result.constant = 0n;
|
|
@@ -967,7 +890,6 @@ export class PolynomialManager {
|
|
|
967
890
|
}
|
|
968
891
|
}
|
|
969
892
|
|
|
970
|
-
// factor_sqf_pp: the factors of a primitive square-free p of positive degree in x.
|
|
971
893
|
private factorSqfPp(polynomial: Polynomial, variable: number, k: number, result: Factors) {
|
|
972
894
|
const degree = this.degree(polynomial, variable);
|
|
973
895
|
if (degree === 1) this.pushFactor(result, polynomial, k);
|
|
@@ -982,9 +904,6 @@ export class PolynomialManager {
|
|
|
982
904
|
result.degrees.push(k);
|
|
983
905
|
}
|
|
984
906
|
|
|
985
|
-
// to_numeral_vector: the coefficients of a univariate p by degree. Z3 normalizes p first but
|
|
986
|
-
// reads the coefficients of p itself.
|
|
987
|
-
// to_numeral_vector: a univariate p as its coefficients, low to high.
|
|
988
907
|
toCoeffs(polynomial: Polynomial) {
|
|
989
908
|
const coeffs = Array.from({ length: this.totalDegree(polynomial) + 1 }, () => 0n);
|
|
990
909
|
for (let index = 0; index < polynomial.size; index++)
|
|
@@ -992,17 +911,15 @@ export class PolynomialManager {
|
|
|
992
911
|
return this.um.set(coeffs);
|
|
993
912
|
}
|
|
994
913
|
|
|
995
|
-
// to_polynomial, mk_univariate: the monomials from the highest degree down.
|
|
996
914
|
fromCoeffs(coeffs: readonly bigint[], variable: number) {
|
|
997
915
|
for (let power = coeffs.length - 1; power >= 0; power--)
|
|
998
916
|
this.cheap.add(coeffs[power], this.mkPower(variable, power));
|
|
999
917
|
return this.cheap.mk();
|
|
1000
918
|
}
|
|
1001
919
|
|
|
1002
|
-
// factor_sqf_pp_univ
|
|
1003
920
|
private factorSqfPpUniv(polynomial: Polynomial, k: number, result: Factors) {
|
|
1004
921
|
const variable = this.maxVar(polynomial);
|
|
1005
|
-
const fs
|
|
922
|
+
const fs = mkFactors();
|
|
1006
923
|
factorSquareFree(this.um, this.toCoeffs(polynomial), fs, 1, DEFAULT_FACTOR_PARAMS);
|
|
1007
924
|
if (fs.factors.length === 1 && fs.degrees[0] === 1) {
|
|
1008
925
|
this.pushFactor(result, polynomial, k);
|
|
@@ -1013,8 +930,6 @@ export class PolynomialManager {
|
|
|
1013
930
|
if (fs.constant === -1n && k % 2 === 1) result.constant = -result.constant;
|
|
1014
931
|
}
|
|
1015
932
|
|
|
1016
|
-
// factor_2_sqf_pp: a*x^2 + b*x + c splits into the primitive parts of 2*a*x + b -/+ sqrt(disc)
|
|
1017
|
-
// when the discriminant b^2 - 4*a*c is a square.
|
|
1018
933
|
private factorQuadratic(polynomial: Polynomial, variable: number, k: number, result: Factors) {
|
|
1019
934
|
let a = this.coeff(polynomial, variable, 2);
|
|
1020
935
|
let b = this.coeff(polynomial, variable, 1);
|
|
@@ -1036,15 +951,12 @@ export class PolynomialManager {
|
|
|
1036
951
|
this.pushFactor(result, this.pp(this.add(linear, root), variable), k);
|
|
1037
952
|
}
|
|
1038
953
|
|
|
1039
|
-
// is_perfect_square for the monomial at a position: the square root of its coefficient when the
|
|
1040
|
-
// whole term is a square.
|
|
1041
954
|
private getTermSquareRoot(polynomial: Polynomial, position: number) {
|
|
1042
955
|
const monomial = polynomial.ms[position];
|
|
1043
956
|
if (monomial.degrees.some((degree) => degree % 2 === 1)) return null;
|
|
1044
957
|
return getExactSquareRoot(polynomial.as[position]);
|
|
1045
958
|
}
|
|
1046
959
|
|
|
1047
|
-
// sqrt: the square root of p with a positive graded-lex leading coefficient, or null.
|
|
1048
960
|
sqrt(polynomial: Polynomial) {
|
|
1049
961
|
if (polynomial.size === 0) return polynomial;
|
|
1050
962
|
if (this.getTermSquareRoot(polynomial, this.getGradedLexMinPos(polynomial)) === null)
|
|
@@ -1088,7 +1000,6 @@ export class PolynomialManager {
|
|
|
1088
1000
|
}
|
|
1089
1001
|
}
|
|
1090
1002
|
|
|
1091
|
-
// graded_lex_min_pos
|
|
1092
1003
|
private getGradedLexMinPos(polynomial: Polynomial) {
|
|
1093
1004
|
let minPos = 0;
|
|
1094
1005
|
for (let index = 1; index < polynomial.size; index++)
|
|
@@ -1096,8 +1007,6 @@ export class PolynomialManager {
|
|
|
1096
1007
|
return minPos;
|
|
1097
1008
|
}
|
|
1098
1009
|
|
|
1099
|
-
// vars: the variables of p in order of occurrence.
|
|
1100
|
-
// vars: the variables of p in the order they first occur.
|
|
1101
1010
|
getVars(polynomial: Polynomial) {
|
|
1102
1011
|
const vars: number[] = [];
|
|
1103
1012
|
for (const monomial of polynomial.ms)
|
|
@@ -1105,7 +1014,6 @@ export class PolynomialManager {
|
|
|
1105
1014
|
return vars;
|
|
1106
1015
|
}
|
|
1107
1016
|
|
|
1108
|
-
// substitute: p with each xs[i] replaced by the integer values[i].
|
|
1109
1017
|
substitute(polynomial: Polynomial, vars: readonly number[], values: readonly bigint[]) {
|
|
1110
1018
|
this.som.reset();
|
|
1111
1019
|
for (let index = 0; index < polynomial.size; index++) {
|
|
@@ -1125,7 +1033,6 @@ export class PolynomialManager {
|
|
|
1125
1033
|
return this.som.mk();
|
|
1126
1034
|
}
|
|
1127
1035
|
|
|
1128
|
-
// translate: p(x + v), by Horner on the coefficients of p in x.
|
|
1129
1036
|
translate(polynomial: Polynomial, variable: number, value: bigint) {
|
|
1130
1037
|
const degree = this.degree(polynomial, variable);
|
|
1131
1038
|
if (degree === 0 || value === 0n) return polynomial;
|
|
@@ -1146,18 +1053,8 @@ export class PolynomialManager {
|
|
|
1146
1053
|
return this.som.mk();
|
|
1147
1054
|
}
|
|
1148
1055
|
|
|
1149
|
-
// substitute(p, x2v): p with the rational values of its assigned variables, each term scaled by
|
|
1150
|
-
// the denominators to the maximal degree of their variable, and the content divided out. p itself
|
|
1151
|
-
// when it has no assigned variable.
|
|
1152
1056
|
substituteRational(polynomial: Polynomial, values: readonly (Rational | undefined)[]) {
|
|
1153
|
-
|
|
1154
|
-
const maxDegrees = new Map<number, number>();
|
|
1155
|
-
for (const monomial of polynomial.ms)
|
|
1156
|
-
for (let index = 0; index < monomial.size; index++) {
|
|
1157
|
-
const variable = monomial.vars[index];
|
|
1158
|
-
if (monomial.degrees[index] > (maxDegrees.get(variable) ?? 0))
|
|
1159
|
-
maxDegrees.set(variable, monomial.degrees[index]);
|
|
1160
|
-
}
|
|
1057
|
+
const maxDegrees = this.getMaxDegrees(polynomial);
|
|
1161
1058
|
if (![...maxDegrees.keys()].some((variable) => values[variable] !== undefined))
|
|
1162
1059
|
return polynomial;
|
|
1163
1060
|
this.som.reset();
|
|
@@ -1189,7 +1086,6 @@ export class PolynomialManager {
|
|
|
1189
1086
|
return this.som.mk(true);
|
|
1190
1087
|
}
|
|
1191
1088
|
|
|
1192
|
-
// muladd: p*q + a.
|
|
1193
1089
|
private muladd(first: Polynomial, second: Polynomial, constant: bigint) {
|
|
1194
1090
|
if (first.size === 0 || second.size === 0) return this.mkConst(constant);
|
|
1195
1091
|
this.som.reset();
|
|
@@ -1199,7 +1095,6 @@ export class PolynomialManager {
|
|
|
1199
1095
|
return this.som.mk();
|
|
1200
1096
|
}
|
|
1201
1097
|
|
|
1202
|
-
// compose: p(q) for a univariate p, by Horner.
|
|
1203
1098
|
private compose(polynomial: Polynomial, inner: Polynomial) {
|
|
1204
1099
|
if (this.isConst(polynomial)) return polynomial;
|
|
1205
1100
|
const variable = this.maxVar(polynomial);
|
|
@@ -1213,14 +1108,12 @@ export class PolynomialManager {
|
|
|
1213
1108
|
return result;
|
|
1214
1109
|
}
|
|
1215
1110
|
|
|
1216
|
-
// compose_x_minus_y: p(x - y) for a univariate p in x.
|
|
1217
1111
|
composeXMinusY(polynomial: Polynomial, variable: number) {
|
|
1218
1112
|
const x = this.maxVar(polynomial);
|
|
1219
1113
|
if (variable === x) return this.coeff(polynomial, x, 0);
|
|
1220
1114
|
return this.compose(polynomial, this.mkLinear([1n, -1n], [x, variable], 0n));
|
|
1221
1115
|
}
|
|
1222
1116
|
|
|
1223
|
-
// compose_x_div_y: y^n * p(x/y) for a univariate p in x of degree n.
|
|
1224
1117
|
composeXDivY(polynomial: Polynomial, variable: number) {
|
|
1225
1118
|
if (this.isConst(polynomial)) return polynomial;
|
|
1226
1119
|
const x = this.maxVar(polynomial);
|
|
@@ -1249,7 +1142,6 @@ export class PolynomialManager {
|
|
|
1249
1142
|
return this.cheap.mk();
|
|
1250
1143
|
}
|
|
1251
1144
|
|
|
1252
|
-
// resultant: Res(p, q) in x, by the subresultant PRS on the primitive parts, times the contents.
|
|
1253
1145
|
resultant(first: Polynomial, second: Polynomial, variable: number) {
|
|
1254
1146
|
if (first.size === 0 || second.size === 0) return this.zero;
|
|
1255
1147
|
if (this.isConst(first))
|
|
@@ -1302,10 +1194,6 @@ export class PolynomialManager {
|
|
|
1302
1194
|
return this.eq(polynomial, this.pp(polynomial, variable));
|
|
1303
1195
|
}
|
|
1304
1196
|
|
|
1305
|
-
// factor_n_sqf_pp, try_multivar_factor: reduces p to two variables by evaluating the others,
|
|
1306
|
-
// factors it at a point of the lifting variable, lifts a split of the univariate factors with
|
|
1307
|
-
// Hensel's lemma and keeps it when the lifted factors multiply back to p. Returns false when no
|
|
1308
|
-
// split lifts, leaving p unfactored.
|
|
1309
1197
|
private factorMultivariate(polynomial: Polynomial, x: number, k: number, result: Factors) {
|
|
1310
1198
|
const allVars = this.getVars(polynomial);
|
|
1311
1199
|
const mainVars = [
|
|
@@ -1347,7 +1235,7 @@ export class PolynomialManager {
|
|
|
1347
1235
|
if (!this.isUnivariate(univariate)) continue;
|
|
1348
1236
|
if (this.degree(univariate, mainVar) !== degMain) continue;
|
|
1349
1237
|
if (!this.isSquareFreeIn(univariate, mainVar)) continue;
|
|
1350
|
-
const univariateFs
|
|
1238
|
+
const univariateFs = mkFactors();
|
|
1351
1239
|
factorSquareFree(
|
|
1352
1240
|
this.um,
|
|
1353
1241
|
this.um.getPrimitive(this.toCoeffs(univariate)),
|
|
@@ -1415,7 +1303,6 @@ export class PolynomialManager {
|
|
|
1415
1303
|
return false;
|
|
1416
1304
|
}
|
|
1417
1305
|
|
|
1418
|
-
// The factors of a lifted part, splitting only linear and quadratic ones further.
|
|
1419
1306
|
private pushSmallFactor(polynomial: Polynomial, x: number, k: number, result: Factors) {
|
|
1420
1307
|
const degree = this.degree(polynomial, x);
|
|
1421
1308
|
if (degree === 2 && this.isPrimitive(polynomial, x) && this.isSquareFreeIn(polynomial, x))
|
|
@@ -1428,9 +1315,6 @@ export class PolynomialManager {
|
|
|
1428
1315
|
return polynomial.as[0] ?? 0n;
|
|
1429
1316
|
}
|
|
1430
1317
|
|
|
1431
|
-
// try_bivar_hensel_lift: lifts q(x, 0) = lc * h1 * h2 to q = F1 * F2 in Z_p[x][y] by linear
|
|
1432
|
-
// Hensel lifting on the coefficients of y, then reads F1 and F2 back over Z. Null when h1 and h2
|
|
1433
|
-
// are not coprime in Z_p, q is not bivariate, or the product of the lifted factors is not q.
|
|
1434
1318
|
private liftBivariate(
|
|
1435
1319
|
q: Polynomial,
|
|
1436
1320
|
x: number,
|
|
@@ -1486,9 +1370,6 @@ export class PolynomialManager {
|
|
|
1486
1370
|
return this.eq(this.mul(first, second), q) ? [first, second] : null;
|
|
1487
1371
|
}
|
|
1488
1372
|
|
|
1489
|
-
// psc_chain: the nonzero principal subresultant coefficients of p and q in x, the resultant
|
|
1490
|
-
// first, or [0] when there are none. psc_chain_optimized: Ducos's subresultant chain with
|
|
1491
|
-
// Lazard's dichotomous S_e.
|
|
1492
1373
|
pscChain(first: Polynomial, second: Polynomial, variable: number) {
|
|
1493
1374
|
const chain =
|
|
1494
1375
|
this.degree(first, variable) >= this.degree(second, variable)
|
|
@@ -1505,7 +1386,6 @@ export class PolynomialManager {
|
|
|
1505
1386
|
while (b.size > 0) {
|
|
1506
1387
|
const d = this.degree(a, x);
|
|
1507
1388
|
const e = this.degree(b, x);
|
|
1508
|
-
// b is S_{d-1}.
|
|
1509
1389
|
const principal = this.coeff(b, x, d - 1);
|
|
1510
1390
|
if (principal.size > 0) chain.push(principal);
|
|
1511
1391
|
let c = b;
|
|
@@ -1522,7 +1402,6 @@ export class PolynomialManager {
|
|
|
1522
1402
|
return chain;
|
|
1523
1403
|
}
|
|
1524
1404
|
|
|
1525
|
-
// Se_Lazard: S_e from S_{d-1} and lc(S_d) by dichotomous Lazard.
|
|
1526
1405
|
private getSeLazard(d: number, lcSd: Polynomial, sd1: Polynomial, x: number) {
|
|
1527
1406
|
let n = d - this.degree(sd1, x) - 1;
|
|
1528
1407
|
if (n === 0) return sd1;
|
|
@@ -1541,7 +1420,6 @@ export class PolynomialManager {
|
|
|
1541
1420
|
return this.exactDiv(this.mul(c, sd1), lcSd);
|
|
1542
1421
|
}
|
|
1543
1422
|
|
|
1544
|
-
// optimized_S_e_1: S_{e-1} from A = S_{d+1}, S_{d-1}, S_e and s = lc(S_d).
|
|
1545
1423
|
private getOptimizedSe1(
|
|
1546
1424
|
d: number,
|
|
1547
1425
|
e: number,
|
|
@@ -1573,10 +1451,6 @@ export class PolynomialManager {
|
|
|
1573
1451
|
return (d - e + 1) % 2 === 1 ? this.neg(result) : result;
|
|
1574
1452
|
}
|
|
1575
1453
|
|
|
1576
|
-
// Evaluation.
|
|
1577
|
-
|
|
1578
|
-
// t_eval: p at the values of its variables, by Horner on the lexicographically sorted monomials,
|
|
1579
|
-
// which sorts p in place as Z3 does.
|
|
1580
1454
|
evaluateWith<T>(polynomial: Polynomial, ops: ValueOps<T>, getValue: (variable: number) => T) {
|
|
1581
1455
|
if (polynomial.size === 0) return ops.fromInteger(0n);
|
|
1582
1456
|
if (this.isConst(polynomial)) return ops.fromInteger(polynomial.as[0]);
|
|
@@ -1591,7 +1465,6 @@ export class PolynomialManager {
|
|
|
1591
1465
|
);
|
|
1592
1466
|
}
|
|
1593
1467
|
|
|
1594
|
-
// t_eval_core: the monomials in [start, end), ignoring the variables above x.
|
|
1595
1468
|
private evaluateCore<T>(
|
|
1596
1469
|
polynomial: Polynomial,
|
|
1597
1470
|
ops: ValueOps<T>,
|
|
@@ -1647,7 +1520,6 @@ export class PolynomialManager {
|
|
|
1647
1520
|
return result;
|
|
1648
1521
|
}
|
|
1649
1522
|
|
|
1650
|
-
// max_smaller_than: the largest variable below x in the monomials in [start, end).
|
|
1651
1523
|
private maxSmallerThan(polynomial: Polynomial, start: number, end: number, x: number) {
|
|
1652
1524
|
let max = NULL_VAR;
|
|
1653
1525
|
for (let index = start; index < end; index++)
|
|
@@ -1669,7 +1541,6 @@ export class PolynomialManager {
|
|
|
1669
1541
|
}
|
|
1670
1542
|
}
|
|
1671
1543
|
|
|
1672
|
-
// polynomial::cache: hash-conses polynomials and memoizes their subresultants and factors.
|
|
1673
1544
|
export class PolynomialCache {
|
|
1674
1545
|
private table = new Map<string, Polynomial>();
|
|
1675
1546
|
private inCache = new Set<number>();
|
|
@@ -1710,7 +1581,6 @@ export class PolynomialCache {
|
|
|
1710
1581
|
return chain;
|
|
1711
1582
|
}
|
|
1712
1583
|
|
|
1713
|
-
// factor: the distinct factors, without the constant.
|
|
1714
1584
|
factor(polynomial: Polynomial) {
|
|
1715
1585
|
const unique = this.mkUnique(polynomial);
|
|
1716
1586
|
const cached = this.factorizations.get(unique.id);
|