tla-ts 0.0.4-dev.0be9567 → 0.0.4-dev.2a873ee
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 +37 -126
- package/dist/deciders.cjs +366 -0
- package/dist/deciders.js +366 -0
- package/dist/index.cjs +1 -1
- package/dist/index.d.cts +33 -1
- package/dist/index.d.ts +33 -1
- 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 +996 -0
- package/dist/prove.js +996 -0
- package/dist/run-cli.cjs +37 -47
- package/dist/run-cli.js +37 -47
- package/dist/tlapm.cjs +10 -0
- package/dist/tlapm.js +10 -0
- package/dist/transfer.cjs +38 -44
- package/dist/transfer.js +38 -44
- package/dist/worker.cjs +21 -0
- package/dist/worker.js +21 -0
- package/package.json +21 -12
- package/src/ast.ts +2 -2
- package/src/check.ts +1 -0
- package/src/cli-options.ts +1 -1
- package/src/errors.ts +88 -29
- package/src/evaluate.ts +56 -21
- package/src/index.ts +10 -0
- package/src/live-check.ts +1 -1
- package/src/{obligation-action.ts → obligations/action.ts} +247 -69
- package/src/{obligation-anon.ts → obligations/anon.ts} +49 -47
- package/src/obligations/ctx.ts +64 -0
- package/src/{obligation-deref.ts → obligations/deref.ts} +51 -92
- package/src/{obligation-expression.ts → obligations/expression.ts} +117 -57
- package/src/{obligation-format.ts → obligations/format.ts} +7 -8
- package/src/{obligation-generate.ts → obligations/generate.ts} +170 -192
- package/src/{obligations.ts → obligations/index.ts} +32 -16
- package/src/{obligation-levels.ts → obligations/levels.ts} +26 -28
- package/src/{obligation-module.ts → obligations/module.ts} +113 -121
- package/src/obligations/pickle.ts +98 -0
- package/src/obligations/pragma.ts +189 -0
- package/src/{obligation-printer.ts → obligations/printer.ts} +22 -80
- package/src/{obligation-proof.ts → obligations/proof.ts} +7 -2
- package/src/{obligation-source.ts → obligations/source.ts} +154 -99
- package/src/obligations/temporal.ts +321 -0
- package/src/{obligation-tuples.ts → obligations/tuples.ts} +38 -54
- package/src/ocaml-marshal.ts +166 -0
- package/src/parallel-worker.ts +2 -18
- package/src/parallel.ts +10 -43
- package/src/prove/decide-pool.ts +95 -0
- package/src/prove/deciders.ts +33 -0
- package/src/prove/first-order.ts +78 -0
- package/src/prove/isabelle/LICENSE +36 -0
- package/src/prove/isabelle/LICENSE-tlapm +26 -0
- package/src/prove/isabelle/decide.ts +47 -0
- package/src/prove/isabelle/encode.ts +446 -0
- package/src/prove/isabelle/isar/inner-syntax.ts +579 -0
- package/src/prove/isabelle/isar/method.ts +367 -0
- package/src/prove/isabelle/isar/proof.ts +28 -0
- package/src/prove/isabelle/isar/statement.ts +57 -0
- package/src/prove/isabelle/isar/theory.ts +192 -0
- package/src/prove/isabelle/isar/type-check.ts +278 -0
- package/src/prove/isabelle/provers/blast/blast.ts +258 -0
- package/src/prove/isabelle/provers/blast/branch.ts +322 -0
- package/src/prove/isabelle/provers/blast/prove.ts +347 -0
- package/src/prove/isabelle/provers/blast/rules.ts +330 -0
- package/src/prove/isabelle/provers/blast/state.ts +180 -0
- package/src/prove/isabelle/provers/blast/term.ts +546 -0
- package/src/prove/isabelle/provers/clasimp.ts +150 -0
- package/src/prove/isabelle/provers/classical.ts +389 -0
- package/src/prove/isabelle/provers/hypsubst.ts +433 -0
- package/src/prove/isabelle/pure/bicompose.ts +174 -0
- package/src/prove/isabelle/pure/consts.ts +32 -0
- package/src/prove/isabelle/pure/conv.ts +79 -0
- package/src/prove/isabelle/pure/drule.ts +264 -0
- package/src/prove/isabelle/pure/envir.ts +331 -0
- package/src/prove/isabelle/pure/goal.ts +53 -0
- package/src/prove/isabelle/pure/interrupt.ts +16 -0
- package/src/prove/isabelle/pure/list.ts +12 -0
- package/src/prove/isabelle/pure/logic.ts +330 -0
- package/src/prove/isabelle/pure/name.ts +98 -0
- package/src/prove/isabelle/pure/net.ts +215 -0
- package/src/prove/isabelle/pure/object-logic.ts +41 -0
- package/src/prove/isabelle/pure/pattern.ts +631 -0
- package/src/prove/isabelle/pure/raw-simplifier.ts +338 -0
- package/src/prove/isabelle/pure/rewriter.ts +602 -0
- package/src/prove/isabelle/pure/search.ts +68 -0
- package/src/prove/isabelle/pure/seq.ts +133 -0
- package/src/prove/isabelle/pure/simplifier.ts +106 -0
- package/src/prove/isabelle/pure/table.ts +201 -0
- package/src/prove/isabelle/pure/tactic.ts +168 -0
- package/src/prove/isabelle/pure/tactical.ts +264 -0
- package/src/prove/isabelle/pure/term-ord.ts +105 -0
- package/src/prove/isabelle/pure/term.ts +688 -0
- package/src/prove/isabelle/pure/thm.ts +783 -0
- package/src/prove/isabelle/pure/type.ts +121 -0
- package/src/prove/isabelle/pure/unify.ts +753 -0
- package/src/prove/isabelle/pure/variable.ts +25 -0
- package/src/prove/isabelle/tla/classical-setup.ts +101 -0
- package/src/prove/isabelle/tla/context.ts +74 -0
- package/src/prove/isabelle/tla/logic-data.ts +5 -0
- package/src/prove/isabelle/tla/logic.ts +215 -0
- package/src/prove/isabelle/tla/simpdata.ts +241 -0
- package/src/prove/isabelle/tools/intuitionistic.ts +132 -0
- package/src/prove/ocaml.ts +22 -0
- package/src/prove/prep/action.ts +508 -0
- package/src/prove/prep/defs.ts +33 -0
- package/src/prove/prep/elab.ts +156 -0
- package/src/prove/prep/enabled-axioms.ts +189 -0
- package/src/prove/prep/enabled.ts +43 -0
- package/src/prove/prep/fingerprint.ts +388 -0
- package/src/prove/prep/flatten.ts +70 -0
- package/src/prove/prep/level-comparison.ts +529 -0
- package/src/prove/prep/md5.ts +67 -0
- package/src/prove/prep/pragma.ts +221 -0
- package/src/prove/prep/trivial.ts +22 -0
- package/src/prove/prove-worker.ts +22 -0
- package/src/prove/prove.ts +498 -0
- package/src/prove/ptl/decide.ts +68 -0
- package/src/prove/ptl/encode.ts +255 -0
- package/src/prove/ptl/sat.ts +151 -0
- package/src/prove/ptl/tableau.ts +276 -0
- package/src/prove/smt/axiomatize.ts +69 -0
- package/src/prove/smt/axioms.ts +209 -0
- package/src/prove/smt/context.ts +108 -0
- package/src/prove/smt/data.ts +636 -0
- package/src/prove/smt/encode.ts +164 -0
- package/src/prove/smt/extensionality.ts +65 -0
- package/src/prove/smt/flatten.ts +112 -0
- package/src/prove/smt/format.ts +154 -0
- package/src/prove/smt/instances.ts +181 -0
- package/src/prove/smt/rewrite.ts +772 -0
- package/src/prove/smt/simplify.ts +57 -0
- package/src/prove/smt/solver/act-cache.ts +265 -0
- package/src/prove/smt/solver/arith-rewriter.ts +962 -0
- package/src/prove/smt/solver/array.ts +22 -0
- package/src/prove/smt/solver/asserted-formulas.ts +469 -0
- package/src/prove/smt/solver/ast-lt.ts +157 -0
- package/src/prove/smt/solver/ast-util.ts +91 -0
- package/src/prove/smt/solver/ast.ts +1315 -0
- package/src/prove/smt/solver/auf-solver.ts +572 -0
- package/src/prove/smt/solver/case-split-queue.ts +178 -0
- package/src/prove/smt/solver/cg-table.ts +175 -0
- package/src/prove/smt/solver/clause.ts +276 -0
- package/src/prove/smt/solver/conflict-resolution.ts +343 -0
- package/src/prove/smt/solver/context.ts +1292 -0
- package/src/prove/smt/solver/ctx-simplify.ts +334 -0
- package/src/prove/smt/solver/der.ts +224 -0
- package/src/prove/smt/solver/dyn-ack.ts +141 -0
- package/src/prove/smt/solver/e-matching.ts +659 -0
- package/src/prove/smt/solver/enode.ts +259 -0
- package/src/prove/smt/solver/expr-ref.ts +21 -0
- package/src/prove/smt/solver/expr-safe-replace.ts +172 -0
- package/src/prove/smt/solver/fingerprints.ts +92 -0
- package/src/prove/smt/solver/flat-literals.ts +51 -0
- package/src/prove/smt/solver/goal.ts +138 -0
- package/src/prove/smt/solver/hash.ts +173 -0
- package/src/prove/smt/solver/hashtable.ts +166 -0
- package/src/prove/smt/solver/internalizer.ts +1381 -0
- package/src/prove/smt/solver/lbool.ts +5 -0
- package/src/prove/smt/solver/literal.ts +24 -0
- package/src/prove/smt/solver/lp/bound-propagator.ts +391 -0
- package/src/prove/smt/solver/lp/constraints.ts +78 -0
- package/src/prove/smt/solver/lp/containers.ts +296 -0
- package/src/prove/smt/solver/lp/core-solver.ts +504 -0
- package/src/prove/smt/solver/lp/cross-nested.ts +224 -0
- package/src/prove/smt/solver/lp/dep-intervals.ts +642 -0
- package/src/prove/smt/solver/lp/dependency.ts +51 -0
- package/src/prove/smt/solver/lp/dioph-eq.ts +1181 -0
- package/src/prove/smt/solver/lp/explanation.ts +46 -0
- package/src/prove/smt/solver/lp/gomory.ts +255 -0
- package/src/prove/smt/solver/lp/hnf-cutter.ts +125 -0
- package/src/prove/smt/solver/lp/hnf.ts +281 -0
- package/src/prove/smt/solver/lp/int-cube.ts +295 -0
- package/src/prove/smt/solver/lp/int-solver.ts +514 -0
- package/src/prove/smt/solver/lp/lar-solver.ts +816 -0
- package/src/prove/smt/solver/lp/lar-term.ts +62 -0
- package/src/prove/smt/solver/lp/lp-settings.ts +91 -0
- package/src/prove/smt/solver/lp/maximize-term.ts +347 -0
- package/src/prove/smt/solver/lp/nex-creator.ts +381 -0
- package/src/prove/smt/solver/lp/nex.ts +120 -0
- package/src/prove/smt/solver/lp/nla-backoff.ts +43 -0
- package/src/prove/smt/solver/lp/nla-basics.ts +398 -0
- package/src/prove/smt/solver/lp/nla-core.ts +968 -0
- package/src/prove/smt/solver/lp/nla-divisions.ts +332 -0
- package/src/prove/smt/solver/lp/nla-emonics.ts +373 -0
- package/src/prove/smt/solver/lp/nla-factorization.ts +30 -0
- package/src/prove/smt/solver/lp/nla-grobner.ts +904 -0
- package/src/prove/smt/solver/lp/nla-horner.ts +126 -0
- package/src/prove/smt/solver/lp/nla-intervals.ts +265 -0
- package/src/prove/smt/solver/lp/nla-monomial-bounds.ts +715 -0
- package/src/prove/smt/solver/lp/nla-monotone.ts +59 -0
- package/src/prove/smt/solver/lp/nla-order.ts +307 -0
- package/src/prove/smt/solver/lp/nla-patcher.ts +112 -0
- package/src/prove/smt/solver/lp/nla-tangents.ts +251 -0
- package/src/prove/smt/solver/lp/nla-throttle.ts +85 -0
- package/src/prove/smt/solver/lp/nla-types.ts +124 -0
- package/src/prove/smt/solver/lp/nla-var-eqs.ts +141 -0
- package/src/prove/smt/solver/lp/nra-solver.ts +440 -0
- package/src/prove/smt/solver/lp/numeric-pair.ts +65 -0
- package/src/prove/smt/solver/lp/pdd-interval.ts +31 -0
- package/src/prove/smt/solver/lp/pdd-simplifier.ts +184 -0
- package/src/prove/smt/solver/lp/pdd-solver.ts +408 -0
- package/src/prove/smt/solver/lp/pdd.ts +971 -0
- package/src/prove/smt/solver/lp/random-updater.ts +138 -0
- package/src/prove/smt/solver/lp/static-matrix.ts +246 -0
- package/src/prove/smt/solver/lp/union-find.ts +96 -0
- package/src/prove/smt/solver/mam-compiler.ts +847 -0
- package/src/prove/smt/solver/mam-interpreter.ts +400 -0
- package/src/prove/smt/solver/maximize-ac-sharing.ts +118 -0
- package/src/prove/smt/solver/model-checker.ts +347 -0
- package/src/prove/smt/solver/model-evaluator.ts +262 -0
- package/src/prove/smt/solver/model-finder.ts +155 -0
- package/src/prove/smt/solver/model-generator.ts +97 -0
- package/src/prove/smt/solver/model-macro-solver.ts +728 -0
- package/src/prove/smt/solver/nlsat/algebraic.ts +1161 -0
- package/src/prove/smt/solver/nlsat/atoms.ts +238 -0
- package/src/prove/smt/solver/nlsat/evaluator.ts +303 -0
- package/src/prove/smt/solver/nlsat/explain.ts +607 -0
- package/src/prove/smt/solver/nlsat/interval-set.ts +351 -0
- package/src/prove/smt/solver/nlsat/levelwise.ts +737 -0
- package/src/prove/smt/solver/nlsat/mpbq.ts +161 -0
- package/src/prove/smt/solver/nlsat/polynomial.ts +1722 -0
- package/src/prove/smt/solver/nlsat/solver.ts +911 -0
- package/src/prove/smt/solver/nlsat/types.ts +43 -0
- package/src/prove/smt/solver/nlsat/upolynomial-factorization.ts +648 -0
- package/src/prove/smt/solver/nlsat/upolynomial.ts +996 -0
- package/src/prove/smt/solver/nnf.ts +469 -0
- package/src/prove/smt/solver/pattern-inference.ts +351 -0
- package/src/prove/smt/solver/poly-rewriter.ts +477 -0
- package/src/prove/smt/solver/propagate-values.ts +83 -0
- package/src/prove/smt/solver/proto-model.ts +551 -0
- package/src/prove/smt/solver/pull-quant.ts +139 -0
- package/src/prove/smt/solver/qe-lite-der.ts +526 -0
- package/src/prove/smt/solver/qe-lite-fm.ts +576 -0
- package/src/prove/smt/solver/qe-lite.ts +381 -0
- package/src/prove/smt/solver/qi-queue.ts +362 -0
- package/src/prove/smt/solver/quant-tactics.ts +117 -0
- package/src/prove/smt/solver/quantifier-analyzer.ts +562 -0
- package/src/prove/smt/solver/quantifier-manager.ts +186 -0
- package/src/prove/smt/solver/random-gen.ts +10 -0
- package/src/prove/smt/solver/rational.ts +165 -0
- package/src/prove/smt/solver/ref-vector.ts +62 -0
- package/src/prove/smt/solver/relevancy.ts +247 -0
- package/src/prove/smt/solver/rewriter-tpl.ts +1159 -0
- package/src/prove/smt/solver/rewriter.ts +843 -0
- package/src/prove/smt/solver/rlimit.ts +79 -0
- package/src/prove/smt/solver/smtlib-parser.ts +526 -0
- package/src/prove/smt/solver/solver.ts +71 -0
- package/src/prove/smt/solver/sort.ts +35 -0
- package/src/prove/smt/solver/sticky-generations.ts +69 -0
- package/src/prove/smt/solver/theory-lra-axioms.ts +340 -0
- package/src/prove/smt/solver/theory-lra-bounds.ts +226 -0
- package/src/prove/smt/solver/theory-lra-final-check.ts +252 -0
- package/src/prove/smt/solver/theory-lra-internalize.ts +476 -0
- package/src/prove/smt/solver/theory-lra-model.ts +243 -0
- package/src/prove/smt/solver/theory-lra-propagate.ts +405 -0
- package/src/prove/smt/solver/theory-lra-state.ts +43 -0
- package/src/prove/smt/solver/theory-lra.ts +56 -0
- package/src/prove/smt/solver/var-subst.ts +258 -0
- package/src/prove/smt/solver/z3-license.txt +10 -0
- package/src/prove/smt/table.ts +170 -0
- package/src/prove/tlapm/tlapm.ts +96 -0
- package/src/prove/tlaps-module.ts +510 -0
- package/src/prove/verdict.ts +18 -0
- package/src/prove/zenon/LICENSE +32 -0
- package/src/prove/zenon/check/check.ts +105 -0
- package/src/prove/zenon/check/definitions.ts +144 -0
- package/src/prove/zenon/check/equality.ts +182 -0
- package/src/prove/zenon/check/functions.ts +62 -0
- package/src/prove/zenon/check/keys.ts +125 -0
- package/src/prove/zenon/check/propositional.ts +104 -0
- package/src/prove/zenon/check/records.ts +188 -0
- package/src/prove/zenon/check/relations.ts +121 -0
- package/src/prove/zenon/check/rewrites.ts +224 -0
- package/src/prove/zenon/check/sets.ts +302 -0
- package/src/prove/zenon/check/terms.ts +127 -0
- package/src/prove/zenon/check/tla.ts +126 -0
- package/src/prove/zenon/decide.ts +113 -0
- package/src/prove/zenon/encode.ts +379 -0
- package/src/prove/zenon/eqrel.ts +300 -0
- package/src/prove/zenon/equality-rules.ts +435 -0
- package/src/prove/zenon/expr.ts +551 -0
- package/src/prove/zenon/index-table.ts +350 -0
- package/src/prove/zenon/isar-case.ts +513 -0
- package/src/prove/zenon/isar.ts +1249 -0
- package/src/prove/zenon/limits.ts +15 -0
- package/src/prove/zenon/llproof.ts +173 -0
- package/src/prove/zenon/mltoll.ts +1566 -0
- package/src/prove/zenon/node.ts +297 -0
- package/src/prove/zenon/ocaml.ts +169 -0
- package/src/prove/zenon/parse.ts +247 -0
- package/src/prove/zenon/phrase.ts +191 -0
- package/src/prove/zenon/proof.ts +198 -0
- package/src/prove/zenon/propositional-rules.ts +387 -0
- package/src/prove/zenon/rules.ts +94 -0
- package/src/prove/zenon/search.ts +288 -0
- package/src/prove/zenon/tla/functions.ts +151 -0
- package/src/prove/zenon/tla/llproof.ts +480 -0
- package/src/prove/zenon/tla/records.ts +225 -0
- package/src/prove/zenon/tla/rewrites.ts +447 -0
- package/src/prove/zenon/tla/sets.ts +304 -0
- package/src/prove/zenon/tla/terms.ts +162 -0
- package/src/prove/zenon/tla/tla.ts +506 -0
- package/src/resolve.ts +1 -1
- package/src/run-cli.ts +283 -81
- package/src/sany-generator.ts +1 -1
- package/src/sany-report.ts +1 -1
- package/src/successors.ts +24 -5
- package/src/tlapm-cache.ts +236 -0
- package/src/tlc-random.ts +55 -32
- package/src/tlc-replay.ts +1 -1
- package/src/tlc-version.ts +8 -7
- package/src/values.ts +47 -4
- package/src/worker.ts +65 -0
- package/dist/parallel.cjs +0 -12
- package/dist/parallel.js +0 -12
- package/src/value-sources.ts +0 -29
|
@@ -0,0 +1,126 @@
|
|
|
1
|
+
// Ported from Z3 (src/math/lp/horner.h, src/math/lp/horner.cpp, and nexvar, create_sum_from_row,
|
|
2
|
+
// and add_deps_of_fixed from src/math/lp/nla_common.cpp), MIT license, see z3-license.txt. Horner
|
|
3
|
+
// lemmas: a tableau row is a sum that equals zero. Each cross-nested form of the row that
|
|
4
|
+
// intervals proves nonzero yields a conflict.
|
|
5
|
+
import { Rational } from "../rational";
|
|
6
|
+
import { CrossNested } from "./cross-nested";
|
|
7
|
+
import { type Dependency, mkJoin } from "./dependency";
|
|
8
|
+
import { type Nex, getDegree } from "./nex";
|
|
9
|
+
import { NexCreator } from "./nex-creator";
|
|
10
|
+
import { NLA_PARAMS, type NlaCore } from "./nla-core";
|
|
11
|
+
import type { RowCell } from "./static-matrix";
|
|
12
|
+
|
|
13
|
+
export class Horner {
|
|
14
|
+
private readonly nexCreator = new NexCreator();
|
|
15
|
+
// The joined bounds of the fixed variables that the row's sum replaced by their values.
|
|
16
|
+
private fixedDep: Dependency = null;
|
|
17
|
+
|
|
18
|
+
constructor(private readonly core: NlaCore) {}
|
|
19
|
+
|
|
20
|
+
hornerLemmas() {
|
|
21
|
+
if (!NLA_PARAMS.horner) return false;
|
|
22
|
+
const core = this.core;
|
|
23
|
+
if (core.toRefine.size === 0) {
|
|
24
|
+
core.isNlaSatisfied = true;
|
|
25
|
+
return false;
|
|
26
|
+
}
|
|
27
|
+
const matrix = core.lra.core.matrix;
|
|
28
|
+
const rowsToCheck = new Set<number>();
|
|
29
|
+
for (const lpVar of core.toRefine.elems)
|
|
30
|
+
for (const cell of matrix.columns[lpVar]) rowsToCheck.add(cell.row);
|
|
31
|
+
core.activeVarSet.clear();
|
|
32
|
+
const rows = [...rowsToCheck]
|
|
33
|
+
.sort((first, second) => first - second)
|
|
34
|
+
.filter((rowIndex) => this.rowIsInteresting(matrix.rows[rowIndex]));
|
|
35
|
+
const offset = core.random();
|
|
36
|
+
for (let index = 0; index < rows.length; index++)
|
|
37
|
+
if (this.lemmasOnRow(matrix.rows[rows[(index + offset) % rows.length]])) return true;
|
|
38
|
+
return false;
|
|
39
|
+
}
|
|
40
|
+
|
|
41
|
+
// row_is_interesting: whether two monomials of the row share a variable.
|
|
42
|
+
private rowIsInteresting(row: RowCell[]) {
|
|
43
|
+
if (row.length > NLA_PARAMS.hornerRowLengthLimit) return false;
|
|
44
|
+
const core = this.core;
|
|
45
|
+
core.activeVarSet.clear();
|
|
46
|
+
for (const cell of row) {
|
|
47
|
+
if (!core.isMonicVar(cell.column)) {
|
|
48
|
+
if (core.activeVarSet.has(cell.column)) return true;
|
|
49
|
+
core.activeVarSet.add(cell.column);
|
|
50
|
+
continue;
|
|
51
|
+
}
|
|
52
|
+
const vars = core.emons.get(cell.column).vars;
|
|
53
|
+
if (vars.some((lpVar) => core.activeVarSet.has(lpVar))) return true;
|
|
54
|
+
for (const lpVar of vars) core.activeVarSet.add(lpVar);
|
|
55
|
+
}
|
|
56
|
+
return false;
|
|
57
|
+
}
|
|
58
|
+
|
|
59
|
+
private lemmasOnRow(row: RowCell[]) {
|
|
60
|
+
const core = this.core;
|
|
61
|
+
core.activeVarSet.clear();
|
|
62
|
+
this.fixedDep = null;
|
|
63
|
+
const summands = row.map((cell) => this.nexvar(cell.coeff, cell.column));
|
|
64
|
+
const fixedDep = this.fixedDep;
|
|
65
|
+
this.setActiveVarsWeights();
|
|
66
|
+
const expr = this.nexCreator.simplify(this.nexCreator.mkSum(summands));
|
|
67
|
+
if (getDegree(expr) < 2 || expr.kind !== "sum") return false;
|
|
68
|
+
const crossNested = new CrossNested(
|
|
69
|
+
(form) => core.intervals.checkNex(form, fixedDep),
|
|
70
|
+
(lpVar) => core.varIsFixed(lpVar),
|
|
71
|
+
{ inc: () => !core.isCanceled() },
|
|
72
|
+
core.random(),
|
|
73
|
+
this.nexCreator,
|
|
74
|
+
);
|
|
75
|
+
crossNested.run(expr);
|
|
76
|
+
return crossNested.done();
|
|
77
|
+
}
|
|
78
|
+
|
|
79
|
+
// set_active_vars_weights: without the weights the comparisons of nex_creator are wrong.
|
|
80
|
+
private setActiveVarsWeights() {
|
|
81
|
+
this.nexCreator.setNumberOfVars(this.core.lra.getColumnCount());
|
|
82
|
+
for (const lpVar of this.core.activeVarSet.elems)
|
|
83
|
+
this.nexCreator.setVarWeight(lpVar, this.core.getVarWeight(lpVar));
|
|
84
|
+
}
|
|
85
|
+
|
|
86
|
+
// add_deps_of_fixed.
|
|
87
|
+
private addDepsOfFixed(lpVar: number) {
|
|
88
|
+
this.fixedDep = mkJoin(this.fixedDep, this.core.lra.getBoundWitnesses(lpVar));
|
|
89
|
+
}
|
|
90
|
+
|
|
91
|
+
// nexvar: coeff times the column, a product for a monic, where hornerSubsFixed replaces fixed
|
|
92
|
+
// variables by their values (1) or only those fixed to zero (2).
|
|
93
|
+
private nexvar(coeff: Rational, lpVar: number): Nex {
|
|
94
|
+
const core = this.core;
|
|
95
|
+
const creator = this.nexCreator;
|
|
96
|
+
const subsFixed: number = NLA_PARAMS.hornerSubsFixed;
|
|
97
|
+
if (subsFixed === 1 && core.varIsFixed(lpVar)) {
|
|
98
|
+
this.addDepsOfFixed(lpVar);
|
|
99
|
+
return creator.mkScalar(coeff.mul(core.lra.core.lowerBounds[lpVar].x));
|
|
100
|
+
}
|
|
101
|
+
if (subsFixed === 2 && core.varIsFixedToZero(lpVar)) {
|
|
102
|
+
this.addDepsOfFixed(lpVar);
|
|
103
|
+
return creator.mkScalar(Rational.zero);
|
|
104
|
+
}
|
|
105
|
+
if (!core.isMonicVar(lpVar)) {
|
|
106
|
+
core.activeVarSet.add(lpVar);
|
|
107
|
+
return creator.mkMul(creator.mkScalar(coeff), creator.mkVar(lpVar));
|
|
108
|
+
}
|
|
109
|
+
const factors: (Nex | Rational)[] = [coeff];
|
|
110
|
+
const initialDep = this.fixedDep;
|
|
111
|
+
for (const factorVar of core.emons.get(lpVar).vars) {
|
|
112
|
+
if (subsFixed === 1 && core.varIsFixed(factorVar)) {
|
|
113
|
+
this.addDepsOfFixed(factorVar);
|
|
114
|
+
factors.push(core.lra.core.lowerBounds[factorVar].x);
|
|
115
|
+
} else if (subsFixed === 2 && core.varIsFixedToZero(factorVar)) {
|
|
116
|
+
this.fixedDep = initialDep;
|
|
117
|
+
this.addDepsOfFixed(factorVar);
|
|
118
|
+
return creator.mkScalar(Rational.zero);
|
|
119
|
+
} else {
|
|
120
|
+
core.activeVarSet.add(factorVar);
|
|
121
|
+
factors.push(creator.mkVar(factorVar));
|
|
122
|
+
}
|
|
123
|
+
}
|
|
124
|
+
return creator.mkMul(...factors);
|
|
125
|
+
}
|
|
126
|
+
}
|
|
@@ -0,0 +1,265 @@
|
|
|
1
|
+
// Ported from Z3 (src/math/lp/nla_intervals.h, src/math/lp/nla_intervals.cpp), MIT license, see
|
|
2
|
+
// z3-license.txt. Evaluates a nex expression over the bounds of its variables. When the interval
|
|
3
|
+
// excludes zero, the expression cannot vanish, so the bounds behind the interval and the
|
|
4
|
+
// dependencies of the row conflict with the row's equation, and the conflict becomes a lemma.
|
|
5
|
+
import { Rational } from "../rational";
|
|
6
|
+
import {
|
|
7
|
+
type DepInterval,
|
|
8
|
+
type DepsMode,
|
|
9
|
+
add,
|
|
10
|
+
addScalar,
|
|
11
|
+
checkIntervalForConflictOnZero,
|
|
12
|
+
intersect,
|
|
13
|
+
isEmpty,
|
|
14
|
+
mkDepInterval,
|
|
15
|
+
mul,
|
|
16
|
+
mulScalar,
|
|
17
|
+
power,
|
|
18
|
+
separatedFromZero,
|
|
19
|
+
set,
|
|
20
|
+
setValue,
|
|
21
|
+
setZeroIntervalDepsForMult,
|
|
22
|
+
} from "./dep-intervals";
|
|
23
|
+
import { type Dependency, mkJoin, mkLeaf } from "./dependency";
|
|
24
|
+
import { Explanation } from "./explanation";
|
|
25
|
+
import { LarTerm } from "./lar-term";
|
|
26
|
+
import { type Nex, type NexMul, type NexSum, isALinearTerm, isElementary } from "./nex";
|
|
27
|
+
import { type NlaCore } from "./nla-core";
|
|
28
|
+
import { LemmaBuilder } from "./nla-types";
|
|
29
|
+
|
|
30
|
+
type ReportConflict = (explanation: Explanation) => void;
|
|
31
|
+
|
|
32
|
+
const mkExplanation = (constraints: number[]) => {
|
|
33
|
+
const explanation = new Explanation();
|
|
34
|
+
for (const constraint of constraints) explanation.push(constraint);
|
|
35
|
+
return explanation;
|
|
36
|
+
};
|
|
37
|
+
|
|
38
|
+
export class Intervals {
|
|
39
|
+
constructor(private readonly core: NlaCore) {}
|
|
40
|
+
|
|
41
|
+
// check_nex: whether the expression's interval excludes zero, in which case a lemma explains it.
|
|
42
|
+
checkNex(expr: Nex, initialDeps: Dependency) {
|
|
43
|
+
const report: ReportConflict = (explanation) =>
|
|
44
|
+
new LemmaBuilder(this.core).addExplanation(explanation);
|
|
45
|
+
const interval = mkDepInterval();
|
|
46
|
+
if (!this.intervalOfExpr(expr, 1, interval, "without-deps", report)) return true;
|
|
47
|
+
if (!separatedFromZero(interval)) return false;
|
|
48
|
+
const intervalWithDeps = mkDepInterval();
|
|
49
|
+
this.intervalOfExpr(expr, 1, intervalWithDeps, "with-deps", report);
|
|
50
|
+
checkIntervalForConflictOnZero(intervalWithDeps, initialDeps, (constraints) =>
|
|
51
|
+
report(mkExplanation(constraints)),
|
|
52
|
+
);
|
|
53
|
+
return true;
|
|
54
|
+
}
|
|
55
|
+
|
|
56
|
+
private hasZeroInterval(expr: Nex) {
|
|
57
|
+
return expr.kind === "var" && this.core.varIsFixedToZero(expr.variable);
|
|
58
|
+
}
|
|
59
|
+
|
|
60
|
+
private hasInfInterval(expr: Nex): boolean {
|
|
61
|
+
if (expr.kind === "var") return this.core.noBounds(expr.variable);
|
|
62
|
+
if (expr.kind === "mul") return this.mulHasInfInterval(expr);
|
|
63
|
+
if (expr.kind === "scalar") return false;
|
|
64
|
+
return expr.children.some((child) => this.hasInfInterval(child));
|
|
65
|
+
}
|
|
66
|
+
|
|
67
|
+
private mulHasInfInterval(mul: NexMul) {
|
|
68
|
+
let hasInf = false;
|
|
69
|
+
for (const child of mul.children) {
|
|
70
|
+
if (!isElementary(child.expr)) return false;
|
|
71
|
+
if (this.hasZeroInterval(child.expr)) return false;
|
|
72
|
+
hasInf ||= this.hasInfInterval(child.expr);
|
|
73
|
+
}
|
|
74
|
+
return hasInf;
|
|
75
|
+
}
|
|
76
|
+
|
|
77
|
+
// expression_to_normalized_term: the sum a*t + b, where t is the linear part divided by the
|
|
78
|
+
// coefficient of its smallest variable, which is a.
|
|
79
|
+
private expressionToNormalizedTerm(sum: NexSum) {
|
|
80
|
+
const pairs: [Rational, number][] = [];
|
|
81
|
+
let constant = Rational.zero;
|
|
82
|
+
let smallestVar = 0;
|
|
83
|
+
let coeffIndex = -1;
|
|
84
|
+
for (const child of sum.children) {
|
|
85
|
+
if (child.kind === "scalar") {
|
|
86
|
+
constant = constant.add(child.value);
|
|
87
|
+
continue;
|
|
88
|
+
}
|
|
89
|
+
if (child.kind === "mul") {
|
|
90
|
+
const first = child.children[0].expr;
|
|
91
|
+
if (first.kind === "var") pairs.push([child.coeff, first.variable]);
|
|
92
|
+
} else if (child.kind === "var") pairs.push([Rational.one, child.variable]);
|
|
93
|
+
if (pairs.length === 0) continue;
|
|
94
|
+
const last = pairs[pairs.length - 1];
|
|
95
|
+
if (pairs.length === 1 || smallestVar > last[1]) {
|
|
96
|
+
smallestVar = last[1];
|
|
97
|
+
coeffIndex = pairs.length - 1;
|
|
98
|
+
}
|
|
99
|
+
}
|
|
100
|
+
const coeff = pairs[coeffIndex][0];
|
|
101
|
+
const term = new LarTerm();
|
|
102
|
+
pairs.forEach((pair, index) => {
|
|
103
|
+
if (coeff.equals(Rational.one)) term.addMonomial(pair[0], pair[1]);
|
|
104
|
+
else if (index !== coeffIndex) term.addMonomial(pair[0].div(coeff), pair[1]);
|
|
105
|
+
else term.addMonomial(Rational.one, pair[1]);
|
|
106
|
+
});
|
|
107
|
+
return { term, coeff, constant };
|
|
108
|
+
}
|
|
109
|
+
|
|
110
|
+
setVarInterval(lpVar: number, interval: DepInterval, mode: DepsMode) {
|
|
111
|
+
const lra = this.core.lra;
|
|
112
|
+
const isColumn = lpVar < lra.columns.length;
|
|
113
|
+
const lowerDep = isColumn ? lra.getLowerWitness(lpVar) : null;
|
|
114
|
+
if (lowerDep !== null) {
|
|
115
|
+
const bound = lra.core.lowerBounds[lpVar];
|
|
116
|
+
interval.lower = bound.x;
|
|
117
|
+
interval.isLowerOpen = bound.y.isPositive();
|
|
118
|
+
interval.isLowerInf = false;
|
|
119
|
+
} else {
|
|
120
|
+
interval.isLowerOpen = true;
|
|
121
|
+
interval.isLowerInf = true;
|
|
122
|
+
}
|
|
123
|
+
if (mode === "with-deps") interval.lowerDep = lowerDep;
|
|
124
|
+
const upperDep = isColumn ? lra.getUpperWitness(lpVar) : null;
|
|
125
|
+
if (upperDep !== null) {
|
|
126
|
+
const bound = lra.core.upperBounds[lpVar];
|
|
127
|
+
interval.upper = bound.x;
|
|
128
|
+
interval.isUpperOpen = bound.y.isNegative();
|
|
129
|
+
interval.isUpperInf = false;
|
|
130
|
+
} else {
|
|
131
|
+
interval.isUpperOpen = true;
|
|
132
|
+
interval.isUpperInf = true;
|
|
133
|
+
}
|
|
134
|
+
if (mode === "with-deps") interval.upperDep = upperDep;
|
|
135
|
+
}
|
|
136
|
+
|
|
137
|
+
// interval_from_term: the interval of a linear sum from the bounds of the term column that
|
|
138
|
+
// equals it, or from an equivalence that fixes it.
|
|
139
|
+
private intervalFromTerm(sum: NexSum, interval: DepInterval, mode: DepsMode) {
|
|
140
|
+
const normalized = this.expressionToNormalizedTerm(sum);
|
|
141
|
+
const explanation = new Explanation();
|
|
142
|
+
if (this.core.explainByEquiv(normalized.term, explanation)) {
|
|
143
|
+
setValue(interval, normalized.constant);
|
|
144
|
+
if (mode === "with-deps") {
|
|
145
|
+
for (const constraint of explanation)
|
|
146
|
+
interval.lowerDep = mkJoin(interval.lowerDep, mkLeaf(constraint));
|
|
147
|
+
interval.upperDep = interval.lowerDep;
|
|
148
|
+
}
|
|
149
|
+
return true;
|
|
150
|
+
}
|
|
151
|
+
const found = this.core.lra.fetchNormalizedTermColumn(normalized.term);
|
|
152
|
+
if (found === undefined) return false;
|
|
153
|
+
this.setVarInterval(found.column, interval, mode);
|
|
154
|
+
const scaled = mkDepInterval();
|
|
155
|
+
mulScalar(normalized.coeff.div(found.coeff), interval, scaled, mode);
|
|
156
|
+
addScalar(normalized.constant, scaled);
|
|
157
|
+
set(interval, scaled, mode);
|
|
158
|
+
return true;
|
|
159
|
+
}
|
|
160
|
+
|
|
161
|
+
private intervalOfSumNoTerm(
|
|
162
|
+
sum: NexSum,
|
|
163
|
+
interval: DepInterval,
|
|
164
|
+
mode: DepsMode,
|
|
165
|
+
report: ReportConflict,
|
|
166
|
+
) {
|
|
167
|
+
if (this.hasInfInterval(sum)) return true;
|
|
168
|
+
if (!this.intervalOfExpr(sum.children[0], 1, interval, mode, report)) return false;
|
|
169
|
+
for (const child of sum.children.slice(1)) {
|
|
170
|
+
const childInterval = mkDepInterval();
|
|
171
|
+
if (!this.intervalOfExpr(child, 1, childInterval, mode, report)) return false;
|
|
172
|
+
const total = mkDepInterval();
|
|
173
|
+
add(interval, childInterval, total, mode);
|
|
174
|
+
set(interval, total, mode);
|
|
175
|
+
}
|
|
176
|
+
return true;
|
|
177
|
+
}
|
|
178
|
+
|
|
179
|
+
// conflict_u_l: whether first's upper bound is below second's lower bound. Like Z3, equal
|
|
180
|
+
// bounds conflict when either upper bound is open.
|
|
181
|
+
private conflictUpperLower(first: DepInterval, second: DepInterval) {
|
|
182
|
+
if (first.isUpperInf || second.isLowerInf) return false;
|
|
183
|
+
const comparison = first.upper.compare(second.lower);
|
|
184
|
+
if (comparison !== 0) return comparison < 0;
|
|
185
|
+
return first.isUpperOpen || second.isUpperOpen;
|
|
186
|
+
}
|
|
187
|
+
|
|
188
|
+
private intervalOfSum(
|
|
189
|
+
sum: NexSum,
|
|
190
|
+
interval: DepInterval,
|
|
191
|
+
mode: DepsMode,
|
|
192
|
+
report: ReportConflict,
|
|
193
|
+
) {
|
|
194
|
+
if (!this.intervalOfSumNoTerm(sum, interval, mode, report)) return false;
|
|
195
|
+
if (!isALinearTerm(sum)) return true;
|
|
196
|
+
const fromTerm = mkDepInterval();
|
|
197
|
+
if (!this.intervalFromTerm(sum, fromTerm, mode)) return true;
|
|
198
|
+
const intersection = mkDepInterval();
|
|
199
|
+
intersect(interval, fromTerm, intersection, mode);
|
|
200
|
+
if (!isEmpty(intersection)) {
|
|
201
|
+
set(interval, intersection, mode);
|
|
202
|
+
return true;
|
|
203
|
+
}
|
|
204
|
+
if (mode === "with-deps") {
|
|
205
|
+
const explanation = new Explanation();
|
|
206
|
+
const deps = this.conflictUpperLower(interval, fromTerm)
|
|
207
|
+
? [interval.upperDep, intersection.lowerDep]
|
|
208
|
+
: [intersection.upperDep, interval.lowerDep];
|
|
209
|
+
for (const dep of deps) explanation.pushDependency(dep);
|
|
210
|
+
report(explanation);
|
|
211
|
+
} else this.intervalOfSum(sum, mkDepInterval(), "with-deps", report);
|
|
212
|
+
return false;
|
|
213
|
+
}
|
|
214
|
+
|
|
215
|
+
private intervalOfMul(
|
|
216
|
+
monomial: NexMul,
|
|
217
|
+
interval: DepInterval,
|
|
218
|
+
mode: DepsMode,
|
|
219
|
+
report: ReportConflict,
|
|
220
|
+
) {
|
|
221
|
+
const zeroChild = monomial.children.find((child) => this.hasZeroInterval(child.expr));
|
|
222
|
+
if (zeroChild !== undefined) {
|
|
223
|
+
this.intervalOfExpr(zeroChild.expr, 1, interval, mode, report);
|
|
224
|
+
if (mode === "with-deps") setZeroIntervalDepsForMult(interval);
|
|
225
|
+
return true;
|
|
226
|
+
}
|
|
227
|
+
setValue(interval, monomial.coeff);
|
|
228
|
+
for (const child of monomial.children) {
|
|
229
|
+
const childInterval = mkDepInterval();
|
|
230
|
+
if (!this.intervalOfExpr(child.expr, child.power, childInterval, mode, report)) return false;
|
|
231
|
+
const product = mkDepInterval();
|
|
232
|
+
mul(interval, childInterval, product, mode);
|
|
233
|
+
set(interval, product, mode);
|
|
234
|
+
}
|
|
235
|
+
return true;
|
|
236
|
+
}
|
|
237
|
+
|
|
238
|
+
private toPower(interval: DepInterval, exponent: number, mode: DepsMode) {
|
|
239
|
+
if (exponent === 1) return;
|
|
240
|
+
const result = mkDepInterval();
|
|
241
|
+
power(interval, exponent, result, mode);
|
|
242
|
+
set(interval, result, mode);
|
|
243
|
+
}
|
|
244
|
+
|
|
245
|
+
// interval_of_expr: false when a sum met a conflict, which report received.
|
|
246
|
+
private intervalOfExpr(
|
|
247
|
+
expr: Nex,
|
|
248
|
+
exponent: number,
|
|
249
|
+
interval: DepInterval,
|
|
250
|
+
mode: DepsMode,
|
|
251
|
+
report: ReportConflict,
|
|
252
|
+
): boolean {
|
|
253
|
+
if (expr.kind === "scalar") {
|
|
254
|
+
setValue(interval, expr.value.pow(exponent));
|
|
255
|
+
return true;
|
|
256
|
+
}
|
|
257
|
+
if (expr.kind === "sum") {
|
|
258
|
+
if (!this.intervalOfSum(expr, interval, mode, report)) return false;
|
|
259
|
+
} else if (expr.kind === "mul") {
|
|
260
|
+
if (!this.intervalOfMul(expr, interval, mode, report)) return false;
|
|
261
|
+
} else this.setVarInterval(expr.variable, interval, mode);
|
|
262
|
+
this.toPower(interval, exponent, mode);
|
|
263
|
+
return true;
|
|
264
|
+
}
|
|
265
|
+
}
|