tla-ts 0.0.3 → 0.0.4-dev.1a3acf6
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 +46 -115
- package/dist/cli.cjs +1 -1
- package/dist/cli.js +1 -1
- package/dist/deciders.cjs +366 -0
- package/dist/deciders.js +366 -0
- package/dist/index.cjs +1 -1
- package/dist/index.d.cts +194 -8
- package/dist/index.d.ts +194 -8
- package/dist/index.js +1 -1
- package/dist/parallel-worker.cjs +1 -4
- package/dist/parallel-worker.js +1 -4
- package/dist/prove-worker.cjs +9 -0
- package/dist/prove-worker.d.cts +9 -0
- package/dist/prove-worker.d.ts +9 -0
- package/dist/prove-worker.js +9 -0
- package/dist/prove.cjs +1006 -0
- package/dist/prove.js +1006 -0
- package/dist/run.cjs +45 -0
- package/dist/run.js +45 -0
- package/dist/tlapm.cjs +10 -0
- package/dist/tlapm.js +10 -0
- package/dist/transfer.cjs +1377 -18
- package/dist/transfer.js +1377 -18
- package/dist/worker.cjs +21 -0
- package/dist/worker.js +21 -0
- package/package.json +24 -11
- package/src/ast.ts +149 -8
- package/src/bags.ts +26 -30
- package/src/builtins.ts +45 -19
- package/src/bundled-modules.ts +3 -3
- package/src/check.ts +1182 -900
- package/src/cli/options.ts +109 -0
- package/src/cli/run.ts +63 -0
- package/src/cli/shared.ts +106 -0
- package/src/cli/tlapm.ts +374 -0
- package/src/cli/tlc.ts +941 -0
- package/src/cli/xml-exporter.ts +221 -0
- package/src/cli.ts +9 -2
- package/src/codegen.ts +112 -51
- package/src/config.ts +254 -181
- package/src/dependencies.ts +5 -7
- package/src/environment.ts +579 -184
- package/src/errors.ts +287 -4
- package/src/evaluate.ts +1095 -365
- package/src/exit-codes.ts +22 -43
- package/src/fingerprints.ts +49 -14
- package/src/index.ts +11 -0
- package/src/instances.ts +73 -60
- package/src/java-overrides.ts +183 -66
- package/src/json.ts +31 -36
- package/src/levels.ts +197 -54
- package/src/lexer.ts +127 -30
- package/src/liveness-checker.ts +894 -0
- package/src/liveness.ts +246 -596
- package/src/{obligation-action.ts → obligations/action.ts} +248 -74
- package/src/{obligation-anon.ts → obligations/anonymize.ts} +55 -57
- package/src/obligations/equality.ts +260 -0
- package/src/obligations/expression.ts +618 -0
- package/src/{obligation-format.ts → obligations/format.ts} +7 -8
- package/src/obligations/generate.ts +457 -0
- package/src/{obligations.ts → obligations/index.ts} +46 -32
- package/src/{obligation-levels.ts → obligations/levels.ts} +44 -40
- package/src/obligations/module.ts +445 -0
- package/src/obligations/normalize.ts +554 -0
- package/src/obligations/operators.ts +176 -0
- package/src/obligations/pragma.ts +195 -0
- package/src/{obligation-printer.ts → obligations/printer.ts} +65 -230
- package/src/{obligation-proof.ts → obligations/proof.ts} +7 -2
- package/src/obligations/regroup.ts +100 -0
- package/src/{obligation-generate.ts → obligations/simplify.ts} +130 -536
- package/src/{obligation-source.ts → obligations/source.ts} +174 -216
- package/src/{obligation-deref.ts → obligations/subexpression.ts} +84 -115
- package/src/obligations/substitution.ts +261 -0
- package/src/obligations/temporal.ts +321 -0
- package/src/{obligation-tuples.ts → obligations/tuples.ts} +38 -54
- package/src/parallel-worker.ts +184 -235
- package/src/parallel.ts +156 -91
- package/src/parser.ts +490 -188
- package/src/pcal/ast.ts +755 -0
- package/src/pcal/parse.ts +1487 -0
- package/src/pcal/tokenize.ts +487 -0
- package/src/pcal/translate.ts +1151 -0
- package/src/pcal/validate.ts +444 -0
- package/src/prover/decide-pool.ts +95 -0
- package/src/prover/deciders.ts +33 -0
- package/src/prover/first-order.ts +175 -0
- package/src/prover/isabelle/LICENSE +36 -0
- package/src/prover/isabelle/LICENSE-tlapm +26 -0
- package/src/prover/isabelle/decide.ts +44 -0
- package/src/prover/isabelle/encode.ts +445 -0
- package/src/prover/isabelle/isar/inner-syntax.ts +579 -0
- package/src/prover/isabelle/isar/method.ts +367 -0
- package/src/prover/isabelle/isar/proof.ts +28 -0
- package/src/prover/isabelle/isar/statement.ts +57 -0
- package/src/prover/isabelle/isar/theory.ts +192 -0
- package/src/prover/isabelle/isar/type-check.ts +278 -0
- package/src/prover/isabelle/provers/blast/blast.ts +258 -0
- package/src/prover/isabelle/provers/blast/branch.ts +322 -0
- package/src/prover/isabelle/provers/blast/prove.ts +347 -0
- package/src/prover/isabelle/provers/blast/rules.ts +330 -0
- package/src/prover/isabelle/provers/blast/state.ts +180 -0
- package/src/prover/isabelle/provers/blast/term.ts +546 -0
- package/src/prover/isabelle/provers/clasimp.ts +150 -0
- package/src/prover/isabelle/provers/classical.ts +389 -0
- package/src/prover/isabelle/provers/hypsubst.ts +433 -0
- package/src/prover/isabelle/pure/bicompose.ts +174 -0
- package/src/prover/isabelle/pure/consts.ts +32 -0
- package/src/prover/isabelle/pure/conv.ts +79 -0
- package/src/prover/isabelle/pure/drule.ts +264 -0
- package/src/prover/isabelle/pure/envir.ts +331 -0
- package/src/prover/isabelle/pure/goal.ts +53 -0
- package/src/prover/isabelle/pure/interrupt.ts +16 -0
- package/src/prover/isabelle/pure/list.ts +12 -0
- package/src/prover/isabelle/pure/logic.ts +330 -0
- package/src/prover/isabelle/pure/name.ts +98 -0
- package/src/prover/isabelle/pure/net.ts +215 -0
- package/src/prover/isabelle/pure/object-logic.ts +41 -0
- package/src/prover/isabelle/pure/pattern.ts +631 -0
- package/src/prover/isabelle/pure/raw-simplifier.ts +338 -0
- package/src/prover/isabelle/pure/rewriter.ts +602 -0
- package/src/prover/isabelle/pure/search.ts +68 -0
- package/src/prover/isabelle/pure/seq.ts +133 -0
- package/src/prover/isabelle/pure/simplifier.ts +106 -0
- package/src/prover/isabelle/pure/table.ts +201 -0
- package/src/prover/isabelle/pure/tactic.ts +168 -0
- package/src/prover/isabelle/pure/tactical.ts +264 -0
- package/src/prover/isabelle/pure/term-ord.ts +105 -0
- package/src/prover/isabelle/pure/term.ts +688 -0
- package/src/prover/isabelle/pure/thm.ts +783 -0
- package/src/prover/isabelle/pure/type.ts +121 -0
- package/src/prover/isabelle/pure/unify.ts +753 -0
- package/src/prover/isabelle/pure/variable.ts +25 -0
- package/src/prover/isabelle/tla/classical-setup.ts +101 -0
- package/src/prover/isabelle/tla/context.ts +74 -0
- package/src/prover/isabelle/tla/logic-data.ts +5 -0
- package/src/prover/isabelle/tla/logic.ts +215 -0
- package/src/prover/isabelle/tla/simpdata.ts +241 -0
- package/src/prover/isabelle/tools/intuitionistic.ts +132 -0
- package/src/prover/ocaml.ts +22 -0
- package/src/prover/prep/action.ts +508 -0
- package/src/prover/prep/enabled-axioms.ts +189 -0
- package/src/prover/prep/fingerprint.ts +388 -0
- package/src/prover/prep/level-comparison.ts +529 -0
- package/src/prover/prep/md5.ts +60 -0
- package/src/prover/prep/methods.ts +221 -0
- package/src/prover/prep/normalize.ts +309 -0
- package/src/prover/prove-worker.ts +22 -0
- package/src/prover/prove.ts +492 -0
- package/src/prover/ptl/decide.ts +68 -0
- package/src/prover/ptl/encode.ts +244 -0
- package/src/prover/ptl/sat.ts +151 -0
- package/src/prover/ptl/tableau.ts +276 -0
- package/src/prover/smt/axioms.ts +209 -0
- package/src/prover/smt/context.ts +108 -0
- package/src/prover/smt/data.ts +636 -0
- package/src/prover/smt/encode.ts +275 -0
- package/src/prover/smt/extensionality.ts +65 -0
- package/src/prover/smt/flatten.ts +112 -0
- package/src/prover/smt/format.ts +154 -0
- package/src/prover/smt/instances.ts +181 -0
- package/src/prover/smt/rewrite.ts +766 -0
- package/src/prover/smt/solver/act-cache.ts +265 -0
- package/src/prover/smt/solver/arith-rewriter.ts +962 -0
- package/src/prover/smt/solver/array.ts +22 -0
- package/src/prover/smt/solver/asserted-formulas.ts +469 -0
- package/src/prover/smt/solver/ast-lt.ts +157 -0
- package/src/prover/smt/solver/ast-util.ts +91 -0
- package/src/prover/smt/solver/ast.ts +1315 -0
- package/src/prover/smt/solver/auf-solver.ts +572 -0
- package/src/prover/smt/solver/case-split-queue.ts +178 -0
- package/src/prover/smt/solver/cg-table.ts +175 -0
- package/src/prover/smt/solver/clause.ts +276 -0
- package/src/prover/smt/solver/conflict-resolution.ts +343 -0
- package/src/prover/smt/solver/context.ts +1292 -0
- package/src/prover/smt/solver/ctx-simplify.ts +334 -0
- package/src/prover/smt/solver/der.ts +224 -0
- package/src/prover/smt/solver/dyn-ack.ts +141 -0
- package/src/prover/smt/solver/e-matching.ts +659 -0
- package/src/prover/smt/solver/enode.ts +259 -0
- package/src/prover/smt/solver/expr-ref.ts +21 -0
- package/src/prover/smt/solver/expr-safe-replace.ts +172 -0
- package/src/prover/smt/solver/fingerprints.ts +92 -0
- package/src/prover/smt/solver/flat-literals.ts +51 -0
- package/src/prover/smt/solver/goal.ts +138 -0
- package/src/prover/smt/solver/hash.ts +173 -0
- package/src/prover/smt/solver/hashtable.ts +166 -0
- package/src/prover/smt/solver/internalizer.ts +1381 -0
- package/src/prover/smt/solver/lbool.ts +5 -0
- package/src/prover/smt/solver/literal.ts +24 -0
- package/src/prover/smt/solver/lp/bound-propagator.ts +391 -0
- package/src/prover/smt/solver/lp/constraints.ts +78 -0
- package/src/prover/smt/solver/lp/containers.ts +296 -0
- package/src/prover/smt/solver/lp/core-solver.ts +504 -0
- package/src/prover/smt/solver/lp/cross-nested.ts +224 -0
- package/src/prover/smt/solver/lp/dep-intervals.ts +642 -0
- package/src/prover/smt/solver/lp/dependency.ts +51 -0
- package/src/prover/smt/solver/lp/dioph-eq.ts +1181 -0
- package/src/prover/smt/solver/lp/explanation.ts +46 -0
- package/src/prover/smt/solver/lp/gomory.ts +255 -0
- package/src/prover/smt/solver/lp/hnf-cutter.ts +125 -0
- package/src/prover/smt/solver/lp/hnf.ts +281 -0
- package/src/prover/smt/solver/lp/int-cube.ts +295 -0
- package/src/prover/smt/solver/lp/int-solver.ts +514 -0
- package/src/prover/smt/solver/lp/lar-solver.ts +816 -0
- package/src/prover/smt/solver/lp/lar-term.ts +62 -0
- package/src/prover/smt/solver/lp/lp-settings.ts +91 -0
- package/src/prover/smt/solver/lp/maximize-term.ts +347 -0
- package/src/prover/smt/solver/lp/nex-creator.ts +381 -0
- package/src/prover/smt/solver/lp/nex.ts +120 -0
- package/src/prover/smt/solver/lp/nla-backoff.ts +43 -0
- package/src/prover/smt/solver/lp/nla-basics.ts +398 -0
- package/src/prover/smt/solver/lp/nla-core.ts +968 -0
- package/src/prover/smt/solver/lp/nla-divisions.ts +332 -0
- package/src/prover/smt/solver/lp/nla-emonics.ts +373 -0
- package/src/prover/smt/solver/lp/nla-factorization.ts +30 -0
- package/src/prover/smt/solver/lp/nla-grobner.ts +904 -0
- package/src/prover/smt/solver/lp/nla-horner.ts +126 -0
- package/src/prover/smt/solver/lp/nla-intervals.ts +265 -0
- package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +715 -0
- package/src/prover/smt/solver/lp/nla-monotone.ts +59 -0
- package/src/prover/smt/solver/lp/nla-order.ts +307 -0
- package/src/prover/smt/solver/lp/nla-patcher.ts +112 -0
- package/src/prover/smt/solver/lp/nla-tangents.ts +251 -0
- package/src/prover/smt/solver/lp/nla-throttle.ts +85 -0
- package/src/prover/smt/solver/lp/nla-types.ts +124 -0
- package/src/prover/smt/solver/lp/nla-var-eqs.ts +141 -0
- package/src/prover/smt/solver/lp/nra-solver.ts +440 -0
- package/src/prover/smt/solver/lp/numeric-pair.ts +65 -0
- package/src/prover/smt/solver/lp/pdd-interval.ts +31 -0
- package/src/prover/smt/solver/lp/pdd-simplifier.ts +184 -0
- package/src/prover/smt/solver/lp/pdd-solver.ts +408 -0
- package/src/prover/smt/solver/lp/pdd.ts +971 -0
- package/src/prover/smt/solver/lp/random-updater.ts +138 -0
- package/src/prover/smt/solver/lp/static-matrix.ts +246 -0
- package/src/prover/smt/solver/lp/union-find.ts +96 -0
- package/src/prover/smt/solver/mam-compiler.ts +847 -0
- package/src/prover/smt/solver/mam-interpreter.ts +400 -0
- package/src/prover/smt/solver/maximize-ac-sharing.ts +118 -0
- package/src/prover/smt/solver/model-checker.ts +347 -0
- package/src/prover/smt/solver/model-evaluator.ts +262 -0
- package/src/prover/smt/solver/model-finder.ts +155 -0
- package/src/prover/smt/solver/model-generator.ts +97 -0
- package/src/prover/smt/solver/model-macro-solver.ts +728 -0
- package/src/prover/smt/solver/nlsat/algebraic.ts +1161 -0
- package/src/prover/smt/solver/nlsat/atoms.ts +238 -0
- package/src/prover/smt/solver/nlsat/evaluator.ts +303 -0
- package/src/prover/smt/solver/nlsat/explain.ts +607 -0
- package/src/prover/smt/solver/nlsat/interval-set.ts +351 -0
- package/src/prover/smt/solver/nlsat/levelwise.ts +737 -0
- package/src/prover/smt/solver/nlsat/mpbq.ts +161 -0
- package/src/prover/smt/solver/nlsat/polynomial.ts +1722 -0
- package/src/prover/smt/solver/nlsat/solver.ts +911 -0
- package/src/prover/smt/solver/nlsat/types.ts +43 -0
- package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +648 -0
- package/src/prover/smt/solver/nlsat/upolynomial.ts +996 -0
- package/src/prover/smt/solver/nnf.ts +469 -0
- package/src/prover/smt/solver/pattern-inference.ts +351 -0
- package/src/prover/smt/solver/poly-rewriter.ts +477 -0
- package/src/prover/smt/solver/propagate-values.ts +83 -0
- package/src/prover/smt/solver/proto-model.ts +551 -0
- package/src/prover/smt/solver/pull-quant.ts +139 -0
- package/src/prover/smt/solver/qe-lite-der.ts +526 -0
- package/src/prover/smt/solver/qe-lite-fm.ts +576 -0
- package/src/prover/smt/solver/qe-lite.ts +381 -0
- package/src/prover/smt/solver/qi-queue.ts +362 -0
- package/src/prover/smt/solver/quant-tactics.ts +117 -0
- package/src/prover/smt/solver/quantifier-analyzer.ts +562 -0
- package/src/prover/smt/solver/quantifier-manager.ts +186 -0
- package/src/prover/smt/solver/random-gen.ts +10 -0
- package/src/prover/smt/solver/rational.ts +165 -0
- package/src/prover/smt/solver/ref-vector.ts +62 -0
- package/src/prover/smt/solver/relevancy.ts +247 -0
- package/src/prover/smt/solver/rewriter-tpl.ts +1159 -0
- package/src/prover/smt/solver/rewriter.ts +843 -0
- package/src/prover/smt/solver/rlimit.ts +79 -0
- package/src/prover/smt/solver/smtlib-parser.ts +526 -0
- package/src/prover/smt/solver/solver.ts +71 -0
- package/src/prover/smt/solver/sort.ts +35 -0
- package/src/prover/smt/solver/sticky-generations.ts +69 -0
- package/src/prover/smt/solver/theory-lra-axioms.ts +340 -0
- package/src/prover/smt/solver/theory-lra-bounds.ts +226 -0
- package/src/prover/smt/solver/theory-lra-final-check.ts +252 -0
- package/src/prover/smt/solver/theory-lra-internalize.ts +476 -0
- package/src/prover/smt/solver/theory-lra-model.ts +243 -0
- package/src/prover/smt/solver/theory-lra-propagate.ts +405 -0
- package/src/prover/smt/solver/theory-lra-state.ts +43 -0
- package/src/prover/smt/solver/theory-lra.ts +56 -0
- package/src/prover/smt/solver/var-subst.ts +258 -0
- package/src/prover/smt/solver/z3-license.txt +10 -0
- package/src/prover/smt/table.ts +170 -0
- package/src/prover/tlapm/cache.ts +236 -0
- package/src/prover/tlapm/ocaml-marshal.ts +166 -0
- package/src/prover/tlapm/tlapm.ts +96 -0
- package/src/prover/tlaps-module.ts +510 -0
- package/src/prover/verdict.ts +13 -0
- package/src/prover/zenon/LICENSE +32 -0
- package/src/prover/zenon/check/check.ts +105 -0
- package/src/prover/zenon/check/definitions.ts +144 -0
- package/src/prover/zenon/check/equality.ts +182 -0
- package/src/prover/zenon/check/functions.ts +62 -0
- package/src/prover/zenon/check/keys.ts +125 -0
- package/src/prover/zenon/check/propositional.ts +104 -0
- package/src/prover/zenon/check/records.ts +188 -0
- package/src/prover/zenon/check/relations.ts +121 -0
- package/src/prover/zenon/check/rewrites.ts +224 -0
- package/src/prover/zenon/check/sets.ts +302 -0
- package/src/prover/zenon/check/terms.ts +127 -0
- package/src/prover/zenon/check/tla.ts +126 -0
- package/src/prover/zenon/decide.ts +107 -0
- package/src/prover/zenon/encode.ts +378 -0
- package/src/prover/zenon/eqrel.ts +300 -0
- package/src/prover/zenon/equality-rules.ts +435 -0
- package/src/prover/zenon/expr.ts +551 -0
- package/src/prover/zenon/index-table.ts +350 -0
- package/src/prover/zenon/isar-case.ts +513 -0
- package/src/prover/zenon/isar.ts +1249 -0
- package/src/prover/zenon/limits.ts +15 -0
- package/src/prover/zenon/llproof.ts +173 -0
- package/src/prover/zenon/mltoll.ts +1566 -0
- package/src/prover/zenon/node.ts +297 -0
- package/src/prover/zenon/ocaml.ts +169 -0
- package/src/prover/zenon/parse.ts +247 -0
- package/src/prover/zenon/phrase.ts +191 -0
- package/src/prover/zenon/proof.ts +198 -0
- package/src/prover/zenon/propositional-rules.ts +387 -0
- package/src/prover/zenon/rules.ts +94 -0
- package/src/prover/zenon/search.ts +288 -0
- package/src/prover/zenon/tla/functions.ts +151 -0
- package/src/prover/zenon/tla/llproof.ts +480 -0
- package/src/prover/zenon/tla/records.ts +225 -0
- package/src/prover/zenon/tla/rewrites.ts +447 -0
- package/src/prover/zenon/tla/sets.ts +304 -0
- package/src/prover/zenon/tla/terms.ts +162 -0
- package/src/prover/zenon/tla/tla.ts +506 -0
- package/src/randomization.ts +39 -27
- package/src/resolve.ts +1474 -426
- package/src/runtime.ts +25 -7
- package/src/sany/builtins.ts +147 -0
- package/src/sany/generator.ts +3111 -0
- package/src/sany/levels.ts +1205 -0
- package/src/sany/lexer.ts +544 -0
- package/src/sany/linter.ts +122 -0
- package/src/sany/modules.ts +1398 -0
- package/src/sany/nodes.ts +463 -0
- package/src/sany/parse-error.ts +2161 -0
- package/src/sany/report.ts +355 -0
- package/src/sany/selectors.ts +736 -0
- package/src/sany/source.ts +247 -0
- package/src/sany/xml.ts +1016 -0
- package/src/search.ts +969 -0
- package/src/spec-description.ts +66 -29
- package/src/{standard-levels.ts → standard-definitions.ts} +118 -2
- package/src/standard-modules.ts +215 -164
- package/src/state-graph.ts +181 -0
- package/src/subexpressions.ts +231 -171
- package/src/substitution-levels.ts +40 -19
- package/src/successors.ts +253 -125
- package/src/symmetry.ts +194 -54
- package/src/tableau.ts +60 -32
- package/src/tlc/fingerprint.ts +214 -0
- package/src/{tlc-modules.ts → tlc/jar-data.ts} +4 -0
- package/src/tlc/messages.ts +441 -0
- package/src/{tlc-order.ts → tlc/order.ts} +84 -16
- package/src/{tlc-random.ts → tlc/random.ts} +30 -189
- package/src/tlc/replay.ts +659 -0
- package/src/{tlc-summary.ts → tlc/summary.ts} +20 -5
- package/src/{tlc-module.ts → tlc/tlc-operators.ts} +59 -50
- package/src/{tlc-ext.ts → tlc/tlcext-operators.ts} +63 -45
- package/src/tlc/version.ts +19 -0
- package/src/transfer.ts +44 -32
- package/src/values.ts +843 -241
- package/src/worker.ts +62 -0
- package/dist/parallel.cjs +0 -12
- package/dist/parallel.js +0 -12
- package/dist/run-cli.cjs +0 -28
- package/dist/run-cli.js +0 -28
- package/src/canonical.ts +0 -39
- package/src/cli-options.ts +0 -58
- package/src/obligation-expression.ts +0 -1060
- package/src/obligation-module.ts +0 -1042
- package/src/run-cli.ts +0 -478
|
@@ -0,0 +1,398 @@
|
|
|
1
|
+
// Ported from Z3 (src/math/lp/nla_basics_lemmas.h, src/math/lp/nla_basics_lemmas.cpp), MIT
|
|
2
|
+
// license, see z3-license.txt. The basic lemmas of nla on monomials whose values are wrong: signs
|
|
3
|
+
// (-ab = (-a)b), zeros (xy = 0 iff x = 0 or y = 0), neutral factors (|xa| = |x| and x != 0 imply
|
|
4
|
+
// |a| = 1) and proportions (|xy| >= |y| when x != 0). Only the model-based lemmas are ported: with
|
|
5
|
+
// derived = true, basic_lemma returns after the sign lemma, so Z3 never reaches its derived
|
|
6
|
+
// zero and neutral lemmas.
|
|
7
|
+
import { Rational } from "../rational";
|
|
8
|
+
import { KIND_EQ, KIND_GE, KIND_GT, KIND_LE, KIND_LT, KIND_NE } from "./constraints";
|
|
9
|
+
import { LarTerm } from "./lar-term";
|
|
10
|
+
import { type NlaCore } from "./nla-core";
|
|
11
|
+
import { type Factorization } from "./nla-factorization";
|
|
12
|
+
import { getRatSign, LemmaBuilder, mkIneq, signToRat } from "./nla-types";
|
|
13
|
+
import type { Monic } from "./nla-emonics";
|
|
14
|
+
|
|
15
|
+
interface FactorValue {
|
|
16
|
+
variable: number;
|
|
17
|
+
value: Rational;
|
|
18
|
+
}
|
|
19
|
+
|
|
20
|
+
export class Basics {
|
|
21
|
+
constructor(private core: NlaCore) {}
|
|
22
|
+
|
|
23
|
+
basicLemma(isDerived: boolean) {
|
|
24
|
+
const core = this.core;
|
|
25
|
+
if (this.basicSignLemma(isDerived)) return;
|
|
26
|
+
if (isDerived) return;
|
|
27
|
+
const toRefine = core.toRefine;
|
|
28
|
+
const start = core.random();
|
|
29
|
+
const size = toRefine.size;
|
|
30
|
+
for (let index = 0; index < size; index++)
|
|
31
|
+
this.basicLemmaForMonModelBased(
|
|
32
|
+
core.emons.get(toRefine.elems[(index + start) % toRefine.size]),
|
|
33
|
+
);
|
|
34
|
+
}
|
|
35
|
+
|
|
36
|
+
// Signs.
|
|
37
|
+
|
|
38
|
+
private basicSignLemmaOnTwoMonics(first: Monic, second: Monic) {
|
|
39
|
+
const sign = signToRat(first.rsign !== second.rsign);
|
|
40
|
+
if (this.core.varVal(first).equals(this.core.varVal(second).mul(sign))) return false;
|
|
41
|
+
this.generateSignLemma(first, second, sign);
|
|
42
|
+
return true;
|
|
43
|
+
}
|
|
44
|
+
|
|
45
|
+
private generateZeroLemmas(monic: Monic) {
|
|
46
|
+
let sign = getRatSign(this.core.varVal(monic));
|
|
47
|
+
const fixedZeros: number[] = [];
|
|
48
|
+
const zeroVar = this.findBestZero(monic, fixedZeros);
|
|
49
|
+
let zeroPower = 0;
|
|
50
|
+
for (const lpVar of monic.vars) {
|
|
51
|
+
if (lpVar === zeroVar) {
|
|
52
|
+
zeroPower++;
|
|
53
|
+
continue;
|
|
54
|
+
}
|
|
55
|
+
sign = this.getNonStrictSign(lpVar, sign);
|
|
56
|
+
if (sign === 0) break;
|
|
57
|
+
}
|
|
58
|
+
if (sign !== 0 && zeroPower % 2 === 0) sign = 0;
|
|
59
|
+
if (sign === 0) this.addTrivialZeroLemma(zeroVar, monic);
|
|
60
|
+
else this.generateStrictCaseZeroLemma(monic, zeroVar, sign);
|
|
61
|
+
for (const lpVar of fixedZeros) this.addFixedZeroLemma(monic, lpVar);
|
|
62
|
+
}
|
|
63
|
+
|
|
64
|
+
// try_get_non_strict_sign_from_bounds and get_non_strict_sign: the sign times the sign of the
|
|
65
|
+
// variable, from its value or else its bounds, or 0.
|
|
66
|
+
private getNonStrictSign(lpVar: number, sign: number) {
|
|
67
|
+
const core = this.core;
|
|
68
|
+
const value = core.val(lpVar);
|
|
69
|
+
if (!value.isZero()) return sign * getRatSign(value);
|
|
70
|
+
if (core.hasLowerBound(lpVar) && !core.getLowerBound(lpVar).isNegative()) return sign;
|
|
71
|
+
if (core.hasUpperBound(lpVar) && !core.getUpperBound(lpVar).isPositive()) return -sign;
|
|
72
|
+
return 0;
|
|
73
|
+
}
|
|
74
|
+
|
|
75
|
+
private basicSignLemmaModelBasedOneMon(monic: Monic, productSign: number) {
|
|
76
|
+
if (productSign === 0) {
|
|
77
|
+
this.generateZeroLemmas(monic);
|
|
78
|
+
return;
|
|
79
|
+
}
|
|
80
|
+
const lemma = new LemmaBuilder(this.core);
|
|
81
|
+
for (const lpVar of monic.vars) this.negateStrictSign(lemma, lpVar);
|
|
82
|
+
lemma.addIneq(mkIneq(monic.variable, productSign === 1 ? KIND_GT : KIND_LT, 0));
|
|
83
|
+
}
|
|
84
|
+
|
|
85
|
+
private basicSignLemmaModelBased() {
|
|
86
|
+
const core = this.core;
|
|
87
|
+
const start = core.random();
|
|
88
|
+
const size = core.toRefine.size;
|
|
89
|
+
for (let index = size; index-- > 0;) {
|
|
90
|
+
const monic = core.emons.get(core.toRefine.elems[(start + index) % size]);
|
|
91
|
+
const productSign = core.getMonicSign(monic);
|
|
92
|
+
if (getRatSign(core.varVal(monic)) === productSign) continue;
|
|
93
|
+
this.basicSignLemmaModelBasedOneMon(monic, productSign);
|
|
94
|
+
if (core.done()) return true;
|
|
95
|
+
}
|
|
96
|
+
return core.lemmas.length > 0;
|
|
97
|
+
}
|
|
98
|
+
|
|
99
|
+
private basicSignLemmaOnMon(lpVar: number, explored: Set<number>) {
|
|
100
|
+
if (explored.has(lpVar)) return false;
|
|
101
|
+
explored.add(lpVar);
|
|
102
|
+
const core = this.core;
|
|
103
|
+
const monic = core.emons.get(lpVar);
|
|
104
|
+
for (const other of core.emons.getSignEquivMonics(monic))
|
|
105
|
+
if (
|
|
106
|
+
monic.variable !== other.variable &&
|
|
107
|
+
this.basicSignLemmaOnTwoMonics(monic, other) &&
|
|
108
|
+
core.done()
|
|
109
|
+
)
|
|
110
|
+
return true;
|
|
111
|
+
return false;
|
|
112
|
+
}
|
|
113
|
+
|
|
114
|
+
private basicSignLemma(isDerived: boolean) {
|
|
115
|
+
if (!isDerived) return this.basicSignLemmaModelBased();
|
|
116
|
+
const explored = new Set<number>();
|
|
117
|
+
for (const lpVar of this.core.toRefine.elems)
|
|
118
|
+
if (this.basicSignLemmaOnMon(lpVar, explored)) return true;
|
|
119
|
+
return false;
|
|
120
|
+
}
|
|
121
|
+
|
|
122
|
+
private generateSignLemma(first: Monic, second: Monic, sign: Rational) {
|
|
123
|
+
const lemma = new LemmaBuilder(this.core);
|
|
124
|
+
lemma.addIneq(
|
|
125
|
+
mkIneq(
|
|
126
|
+
new LarTerm([
|
|
127
|
+
[first.variable, Rational.one],
|
|
128
|
+
[second.variable, sign.neg()],
|
|
129
|
+
]),
|
|
130
|
+
KIND_EQ,
|
|
131
|
+
0,
|
|
132
|
+
),
|
|
133
|
+
);
|
|
134
|
+
lemma.explainMonic(first);
|
|
135
|
+
lemma.explainMonic(second);
|
|
136
|
+
}
|
|
137
|
+
|
|
138
|
+
// Zeros.
|
|
139
|
+
|
|
140
|
+
// find_best_zero: a variable of value 0, preferably with 0 inside its bounds, and the variables
|
|
141
|
+
// fixed to 0.
|
|
142
|
+
private findBestZero(monic: Monic, fixedZeros: number[]) {
|
|
143
|
+
const core = this.core;
|
|
144
|
+
let zeroVar = -1;
|
|
145
|
+
for (const lpVar of monic.vars) {
|
|
146
|
+
if (!core.val(lpVar).isZero()) continue;
|
|
147
|
+
if (core.varIsFixedToZero(lpVar)) fixedZeros.push(lpVar);
|
|
148
|
+
if (zeroVar === -1 || core.zeroIsAnInnerPointOfBounds(lpVar)) zeroVar = lpVar;
|
|
149
|
+
}
|
|
150
|
+
return zeroVar;
|
|
151
|
+
}
|
|
152
|
+
|
|
153
|
+
private addTrivialZeroLemma(zeroVar: number, monic: Monic) {
|
|
154
|
+
const lemma = new LemmaBuilder(this.core);
|
|
155
|
+
lemma.addIneq(mkIneq(zeroVar, KIND_NE, 0));
|
|
156
|
+
lemma.addIneq(mkIneq(monic.variable, KIND_EQ, 0));
|
|
157
|
+
}
|
|
158
|
+
|
|
159
|
+
private generateStrictCaseZeroLemma(monic: Monic, zeroVar: number, zeroSign: number) {
|
|
160
|
+
const lemma = new LemmaBuilder(this.core);
|
|
161
|
+
lemma.addIneq(mkIneq(zeroVar, zeroSign === 1 ? KIND_GT : KIND_LT, 0));
|
|
162
|
+
for (const lpVar of monic.vars) if (lpVar !== zeroVar) this.negateStrictSign(lemma, lpVar);
|
|
163
|
+
this.negateStrictSign(lemma, monic.variable);
|
|
164
|
+
}
|
|
165
|
+
|
|
166
|
+
private addFixedZeroLemma(monic: Monic, lpVar: number) {
|
|
167
|
+
const lemma = new LemmaBuilder(this.core);
|
|
168
|
+
lemma.explainFixed(lpVar);
|
|
169
|
+
lemma.addIneq(mkIneq(monic.variable, KIND_EQ, 0));
|
|
170
|
+
}
|
|
171
|
+
|
|
172
|
+
private negateStrictSign(lemma: LemmaBuilder, lpVar: number) {
|
|
173
|
+
const core = this.core;
|
|
174
|
+
const value = core.val(lpVar);
|
|
175
|
+
if (!value.isZero()) {
|
|
176
|
+
lemma.addIneq(mkIneq(lpVar, getRatSign(value) === 1 ? KIND_LE : KIND_GE, 0));
|
|
177
|
+
return;
|
|
178
|
+
}
|
|
179
|
+
if (core.hasLowerBound(lpVar) && !core.getLowerBound(lpVar).isNegative()) {
|
|
180
|
+
lemma.explainExistingLowerBound(lpVar);
|
|
181
|
+
lemma.addIneq(mkIneq(lpVar, KIND_GT, 0));
|
|
182
|
+
return;
|
|
183
|
+
}
|
|
184
|
+
lemma.explainExistingUpperBound(lpVar);
|
|
185
|
+
lemma.addIneq(mkIneq(lpVar, KIND_LT, 0));
|
|
186
|
+
}
|
|
187
|
+
|
|
188
|
+
// Model-based lemmas on the factorizations of a monic.
|
|
189
|
+
|
|
190
|
+
private basicLemmaForMonModelBased(rooted: Monic) {
|
|
191
|
+
const core = this.core;
|
|
192
|
+
const isZero = core.varVal(rooted).isZero();
|
|
193
|
+
for (const factorization of core.getFactorizations(rooted)) {
|
|
194
|
+
if (factorization.factors.length === 0) continue;
|
|
195
|
+
if (isZero) {
|
|
196
|
+
this.basicLemmaForMonZeroModelBased(rooted, factorization);
|
|
197
|
+
this.basicLemmaForMonNeutralModelBased(rooted, factorization);
|
|
198
|
+
continue;
|
|
199
|
+
}
|
|
200
|
+
this.basicLemmaForMonNonZeroModelBased(factorization);
|
|
201
|
+
this.basicLemmaForMonNeutralModelBased(rooted, factorization);
|
|
202
|
+
this.proportionLemmaModelBased(rooted, factorization);
|
|
203
|
+
}
|
|
204
|
+
}
|
|
205
|
+
|
|
206
|
+
// x != 0 or y = 0 => |xy| >= |y|
|
|
207
|
+
private proportionLemmaModelBased(rooted: Monic, factorization: Factorization) {
|
|
208
|
+
const core = this.core;
|
|
209
|
+
if (core.hasRealFactorization(factorization)) return;
|
|
210
|
+
const rootedValue = core.varVal(rooted).abs();
|
|
211
|
+
if (rootedValue.isZero()) return;
|
|
212
|
+
const factorIndex = factorization.factors.findIndex(
|
|
213
|
+
(factor) => core.valFactor(factor).abs().compare(rootedValue) > 0,
|
|
214
|
+
);
|
|
215
|
+
if (factorIndex !== -1) this.generatePl(rooted, factorization, factorIndex);
|
|
216
|
+
}
|
|
217
|
+
|
|
218
|
+
// sign_m*m < 0 or \/_{i != k} f_i = 0 or sign_m*m >= sign_k*f_k
|
|
219
|
+
private generatePlOnMon(monic: Monic, factorIndex: number) {
|
|
220
|
+
const core = this.core;
|
|
221
|
+
const lemma = new LemmaBuilder(core);
|
|
222
|
+
const monicVar = monic.variable;
|
|
223
|
+
const monicSign = Rational.fromNumber(getRatSign(core.val(monicVar)));
|
|
224
|
+
lemma.addIneq(mkIneq(new LarTerm([[monicVar, monicSign]]), KIND_LT, 0));
|
|
225
|
+
monic.vars.forEach((lpVar, index) => {
|
|
226
|
+
if (index !== factorIndex) {
|
|
227
|
+
lemma.addIneq(mkIneq(lpVar, KIND_EQ, 0));
|
|
228
|
+
return;
|
|
229
|
+
}
|
|
230
|
+
const varSign = Rational.fromNumber(getRatSign(core.val(lpVar)));
|
|
231
|
+
lemma.addIneq(
|
|
232
|
+
mkIneq(
|
|
233
|
+
new LarTerm([
|
|
234
|
+
[monicVar, monicSign],
|
|
235
|
+
[lpVar, varSign.neg()],
|
|
236
|
+
]),
|
|
237
|
+
KIND_GE,
|
|
238
|
+
0,
|
|
239
|
+
),
|
|
240
|
+
);
|
|
241
|
+
});
|
|
242
|
+
}
|
|
243
|
+
|
|
244
|
+
private generatePl(monic: Monic, factorization: Factorization, factorIndex: number) {
|
|
245
|
+
if (factorization.mon !== null) {
|
|
246
|
+
this.generatePlOnMon(monic, factorIndex);
|
|
247
|
+
return;
|
|
248
|
+
}
|
|
249
|
+
const core = this.core;
|
|
250
|
+
const lemma = new LemmaBuilder(core);
|
|
251
|
+
const monicSign = Rational.fromNumber(getRatSign(core.varVal(monic)));
|
|
252
|
+
const monicVar = monic.variable;
|
|
253
|
+
lemma.addIneq(mkIneq(new LarTerm([[monicVar, monicSign]]), KIND_LT, 0));
|
|
254
|
+
factorization.factors.forEach((factor, index) => {
|
|
255
|
+
if (index !== factorIndex) {
|
|
256
|
+
lemma.addIneq(mkIneq(factor.variable, KIND_EQ, 0));
|
|
257
|
+
return;
|
|
258
|
+
}
|
|
259
|
+
const varSign = Rational.fromNumber(getRatSign(core.val(factor.variable)));
|
|
260
|
+
lemma.addIneq(
|
|
261
|
+
mkIneq(
|
|
262
|
+
new LarTerm([
|
|
263
|
+
[monicVar, monicSign],
|
|
264
|
+
[factor.variable, varSign.neg()],
|
|
265
|
+
]),
|
|
266
|
+
KIND_GE,
|
|
267
|
+
0,
|
|
268
|
+
),
|
|
269
|
+
);
|
|
270
|
+
});
|
|
271
|
+
lemma.explainFactorization(factorization);
|
|
272
|
+
lemma.explainMonic(monic);
|
|
273
|
+
}
|
|
274
|
+
|
|
275
|
+
private isSeparatedFromZero(factorization: Factorization) {
|
|
276
|
+
const core = this.core;
|
|
277
|
+
return factorization.factors.every(
|
|
278
|
+
(factor) =>
|
|
279
|
+
core.varHasPositiveLowerBound(factor.variable) ||
|
|
280
|
+
core.varHasNegativeUpperBound(factor.variable),
|
|
281
|
+
);
|
|
282
|
+
}
|
|
283
|
+
|
|
284
|
+
// xy = 0 -> x = 0 or y = 0
|
|
285
|
+
private basicLemmaForMonZeroModelBased(rooted: Monic, factorization: Factorization) {
|
|
286
|
+
const lemma = new LemmaBuilder(this.core);
|
|
287
|
+
lemma.addIneq(mkIneq(rooted.variable, KIND_NE, 0));
|
|
288
|
+
if (!this.isSeparatedFromZero(factorization))
|
|
289
|
+
for (const factor of factorization.factors)
|
|
290
|
+
lemma.addIneq(mkIneq(factor.variable, KIND_EQ, 0));
|
|
291
|
+
else
|
|
292
|
+
for (const factor of factorization.factors)
|
|
293
|
+
lemma.explainVarSeparatedFromZero(factor.variable);
|
|
294
|
+
lemma.explainFactorization(factorization);
|
|
295
|
+
}
|
|
296
|
+
|
|
297
|
+
// /\_{j != i} f_j = val(f_j) => m = sign * f_i, or /\_j f_j = val(f_j) => m = sign, over the
|
|
298
|
+
// variables of a monic.
|
|
299
|
+
private basicLemmaForMonNeutralFromFactorsToMonicModelBasedFm(monic: Monic) {
|
|
300
|
+
const core = this.core;
|
|
301
|
+
const neutral = this.getNeutralNotOne(
|
|
302
|
+
monic,
|
|
303
|
+
monic.vars.map((lpVar) => ({ variable: lpVar, value: core.val(lpVar) })),
|
|
304
|
+
);
|
|
305
|
+
if (neutral === undefined) return;
|
|
306
|
+
const lemma = new LemmaBuilder(core);
|
|
307
|
+
for (const lpVar of monic.vars)
|
|
308
|
+
if (neutral.notOne !== lpVar) lemma.addIneq(mkIneq(lpVar, KIND_NE, core.val(lpVar)));
|
|
309
|
+
this.addNeutralConclusion(lemma, monic, neutral.notOne, neutral.sign);
|
|
310
|
+
}
|
|
311
|
+
|
|
312
|
+
private addNeutralConclusion(lemma: LemmaBuilder, monic: Monic, notOne: number, sign: Rational) {
|
|
313
|
+
if (notOne === -1) {
|
|
314
|
+
lemma.addIneq(mkIneq(monic.variable, KIND_EQ, sign));
|
|
315
|
+
return;
|
|
316
|
+
}
|
|
317
|
+
lemma.addIneq(
|
|
318
|
+
mkIneq(
|
|
319
|
+
new LarTerm([
|
|
320
|
+
[monic.variable, Rational.one],
|
|
321
|
+
[notOne, sign.neg()],
|
|
322
|
+
]),
|
|
323
|
+
KIND_EQ,
|
|
324
|
+
0,
|
|
325
|
+
),
|
|
326
|
+
);
|
|
327
|
+
}
|
|
328
|
+
|
|
329
|
+
// basic_lemma_for_mon_neutral_monic_to_factor_model_based tests `j == null_lpvar` for the factor
|
|
330
|
+
// equal to the monic in absolute value, which no factor's variable is, so it never makes a
|
|
331
|
+
// lemma (nla_basics_lemmas.cpp, the loop over f).
|
|
332
|
+
private basicLemmaForMonNeutralModelBased(rooted: Monic, factorization: Factorization) {
|
|
333
|
+
if (factorization.mon !== null)
|
|
334
|
+
this.basicLemmaForMonNeutralFromFactorsToMonicModelBasedFm(factorization.mon);
|
|
335
|
+
else this.basicLemmaForMonNeutralFromFactorsToMonicModelBased(rooted, factorization);
|
|
336
|
+
}
|
|
337
|
+
|
|
338
|
+
// can_create_lemma_for_mon_neutral_from_factors_to_monic_model_based: the one factor whose
|
|
339
|
+
// value is not +-1, or -1 when there is none, and the product of the other values, when the
|
|
340
|
+
// monic's value disagrees with them.
|
|
341
|
+
private getNeutralNotOne(monic: Monic, factors: FactorValue[]) {
|
|
342
|
+
let sign = Rational.one;
|
|
343
|
+
let notOne = -1;
|
|
344
|
+
for (const factor of factors) {
|
|
345
|
+
if (factor.value.equals(Rational.one)) continue;
|
|
346
|
+
if (factor.value.equals(Rational.minusOne)) {
|
|
347
|
+
sign = sign.neg();
|
|
348
|
+
continue;
|
|
349
|
+
}
|
|
350
|
+
if (notOne === -1) {
|
|
351
|
+
notOne = factor.variable;
|
|
352
|
+
continue;
|
|
353
|
+
}
|
|
354
|
+
return undefined;
|
|
355
|
+
}
|
|
356
|
+
const monicValue = this.core.varVal(monic);
|
|
357
|
+
if (notOne === -1 && monicValue.equals(sign)) return undefined;
|
|
358
|
+
if (notOne !== -1 && monicValue.equals(this.core.val(notOne).mul(sign))) return undefined;
|
|
359
|
+
return { notOne, sign };
|
|
360
|
+
}
|
|
361
|
+
|
|
362
|
+
private basicLemmaForMonNeutralFromFactorsToMonicModelBased(
|
|
363
|
+
monic: Monic,
|
|
364
|
+
factorization: Factorization,
|
|
365
|
+
) {
|
|
366
|
+
const core = this.core;
|
|
367
|
+
const neutral = this.getNeutralNotOne(
|
|
368
|
+
monic,
|
|
369
|
+
factorization.factors.map((factor) => ({
|
|
370
|
+
variable: factor.variable,
|
|
371
|
+
value: core.valFactor(factor),
|
|
372
|
+
})),
|
|
373
|
+
);
|
|
374
|
+
if (neutral === undefined) return;
|
|
375
|
+
if (factorization.factors.some((factor) => factor.isNegated)) return;
|
|
376
|
+
const lemma = new LemmaBuilder(core);
|
|
377
|
+
for (const factor of factorization.factors) {
|
|
378
|
+
if (neutral.notOne === factor.variable) continue;
|
|
379
|
+
lemma.addIneq(mkIneq(factor.variable, KIND_NE, core.val(factor.variable)));
|
|
380
|
+
}
|
|
381
|
+
this.addNeutralConclusion(lemma, monic, neutral.notOne, neutral.sign);
|
|
382
|
+
lemma.explainMonic(monic);
|
|
383
|
+
lemma.explainFactorization(factorization);
|
|
384
|
+
}
|
|
385
|
+
|
|
386
|
+
// x = 0 or y = 0 -> xy = 0
|
|
387
|
+
private basicLemmaForMonNonZeroModelBased(factorization: Factorization) {
|
|
388
|
+
const monic = factorization.mon;
|
|
389
|
+
if (monic === null) return;
|
|
390
|
+
const core = this.core;
|
|
391
|
+
const zero = factorization.factors.find((factor) => core.valFactor(factor).isZero());
|
|
392
|
+
if (zero === undefined) return;
|
|
393
|
+
const lemma = new LemmaBuilder(core);
|
|
394
|
+
lemma.addIneq(mkIneq(zero.variable, KIND_NE, 0));
|
|
395
|
+
lemma.addIneq(mkIneq(monic.variable, KIND_EQ, 0));
|
|
396
|
+
lemma.explainFactorization(factorization);
|
|
397
|
+
}
|
|
398
|
+
}
|