tla-ts 0.0.4-dev.0be9567 → 0.0.4-dev.2da24e1

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.
Files changed (312) hide show
  1. package/README.md +37 -126
  2. package/dist/deciders.cjs +366 -0
  3. package/dist/deciders.js +366 -0
  4. package/dist/index.cjs +1 -1
  5. package/dist/index.d.cts +33 -1
  6. package/dist/index.d.ts +33 -1
  7. package/dist/index.js +1 -1
  8. package/dist/parallel-worker.cjs +1 -4
  9. package/dist/parallel-worker.js +1 -4
  10. package/dist/prove-worker.cjs +9 -0
  11. package/dist/prove-worker.d.cts +9 -0
  12. package/dist/prove-worker.d.ts +9 -0
  13. package/dist/prove-worker.js +9 -0
  14. package/dist/prove.cjs +996 -0
  15. package/dist/prove.js +996 -0
  16. package/dist/run-cli.cjs +37 -47
  17. package/dist/run-cli.js +37 -47
  18. package/dist/tlapm.cjs +10 -0
  19. package/dist/tlapm.js +10 -0
  20. package/dist/transfer.cjs +38 -44
  21. package/dist/transfer.js +38 -44
  22. package/dist/worker.cjs +21 -0
  23. package/dist/worker.js +21 -0
  24. package/package.json +21 -12
  25. package/src/check.ts +1 -0
  26. package/src/errors.ts +86 -0
  27. package/src/evaluate.ts +54 -19
  28. package/src/index.ts +10 -0
  29. package/src/{obligation-action.ts → obligations/action.ts} +247 -69
  30. package/src/{obligation-anon.ts → obligations/anon.ts} +49 -47
  31. package/src/obligations/ctx.ts +64 -0
  32. package/src/{obligation-deref.ts → obligations/deref.ts} +51 -92
  33. package/src/{obligation-expression.ts → obligations/expression.ts} +117 -57
  34. package/src/{obligation-format.ts → obligations/format.ts} +7 -8
  35. package/src/{obligation-generate.ts → obligations/generate.ts} +170 -192
  36. package/src/{obligations.ts → obligations/index.ts} +32 -16
  37. package/src/{obligation-levels.ts → obligations/levels.ts} +26 -28
  38. package/src/{obligation-module.ts → obligations/module.ts} +113 -121
  39. package/src/obligations/pickle.ts +98 -0
  40. package/src/obligations/pragma.ts +189 -0
  41. package/src/{obligation-printer.ts → obligations/printer.ts} +22 -80
  42. package/src/{obligation-proof.ts → obligations/proof.ts} +7 -2
  43. package/src/{obligation-source.ts → obligations/source.ts} +154 -99
  44. package/src/obligations/temporal.ts +321 -0
  45. package/src/{obligation-tuples.ts → obligations/tuples.ts} +38 -54
  46. package/src/ocaml-marshal.ts +166 -0
  47. package/src/parallel-worker.ts +2 -18
  48. package/src/parallel.ts +10 -43
  49. package/src/prove/decide-pool.ts +95 -0
  50. package/src/prove/deciders.ts +33 -0
  51. package/src/prove/first-order.ts +78 -0
  52. package/src/prove/isabelle/LICENSE +36 -0
  53. package/src/prove/isabelle/LICENSE-tlapm +26 -0
  54. package/src/prove/isabelle/decide.ts +47 -0
  55. package/src/prove/isabelle/encode.ts +446 -0
  56. package/src/prove/isabelle/isar/inner-syntax.ts +579 -0
  57. package/src/prove/isabelle/isar/method.ts +367 -0
  58. package/src/prove/isabelle/isar/proof.ts +28 -0
  59. package/src/prove/isabelle/isar/statement.ts +57 -0
  60. package/src/prove/isabelle/isar/theory.ts +192 -0
  61. package/src/prove/isabelle/isar/type-check.ts +278 -0
  62. package/src/prove/isabelle/provers/blast/blast.ts +258 -0
  63. package/src/prove/isabelle/provers/blast/branch.ts +322 -0
  64. package/src/prove/isabelle/provers/blast/prove.ts +347 -0
  65. package/src/prove/isabelle/provers/blast/rules.ts +330 -0
  66. package/src/prove/isabelle/provers/blast/state.ts +180 -0
  67. package/src/prove/isabelle/provers/blast/term.ts +547 -0
  68. package/src/prove/isabelle/provers/clasimp.ts +150 -0
  69. package/src/prove/isabelle/provers/classical.ts +389 -0
  70. package/src/prove/isabelle/provers/hypsubst.ts +441 -0
  71. package/src/prove/isabelle/pure/bicompose.ts +174 -0
  72. package/src/prove/isabelle/pure/consts.ts +32 -0
  73. package/src/prove/isabelle/pure/conv.ts +79 -0
  74. package/src/prove/isabelle/pure/drule.ts +264 -0
  75. package/src/prove/isabelle/pure/envir.ts +363 -0
  76. package/src/prove/isabelle/pure/goal.ts +53 -0
  77. package/src/prove/isabelle/pure/interrupt.ts +16 -0
  78. package/src/prove/isabelle/pure/list.ts +12 -0
  79. package/src/prove/isabelle/pure/logic.ts +402 -0
  80. package/src/prove/isabelle/pure/name.ts +110 -0
  81. package/src/prove/isabelle/pure/net.ts +262 -0
  82. package/src/prove/isabelle/pure/object-logic.ts +41 -0
  83. package/src/prove/isabelle/pure/pattern.ts +650 -0
  84. package/src/prove/isabelle/pure/raw-simplifier.ts +353 -0
  85. package/src/prove/isabelle/pure/rewriter.ts +602 -0
  86. package/src/prove/isabelle/pure/search.ts +68 -0
  87. package/src/prove/isabelle/pure/seq.ts +156 -0
  88. package/src/prove/isabelle/pure/simplifier.ts +112 -0
  89. package/src/prove/isabelle/pure/table.ts +208 -0
  90. package/src/prove/isabelle/pure/tactic.ts +276 -0
  91. package/src/prove/isabelle/pure/tactical.ts +347 -0
  92. package/src/prove/isabelle/pure/term-ord.ts +159 -0
  93. package/src/prove/isabelle/pure/term.ts +808 -0
  94. package/src/prove/isabelle/pure/thm.ts +806 -0
  95. package/src/prove/isabelle/pure/type.ts +133 -0
  96. package/src/prove/isabelle/pure/unify.ts +753 -0
  97. package/src/prove/isabelle/pure/variable.ts +25 -0
  98. package/src/prove/isabelle/tla/classical-setup.ts +101 -0
  99. package/src/prove/isabelle/tla/context.ts +74 -0
  100. package/src/prove/isabelle/tla/logic-data.ts +5 -0
  101. package/src/prove/isabelle/tla/logic.ts +215 -0
  102. package/src/prove/isabelle/tla/simpdata.ts +241 -0
  103. package/src/prove/isabelle/tools/intuitionistic.ts +132 -0
  104. package/src/prove/ocaml.ts +22 -0
  105. package/src/prove/prep/action.ts +508 -0
  106. package/src/prove/prep/defs.ts +33 -0
  107. package/src/prove/prep/elab.ts +156 -0
  108. package/src/prove/prep/enabled-axioms.ts +189 -0
  109. package/src/prove/prep/enabled.ts +43 -0
  110. package/src/prove/prep/fingerprint.ts +388 -0
  111. package/src/prove/prep/flatten.ts +70 -0
  112. package/src/prove/prep/level-comparison.ts +529 -0
  113. package/src/prove/prep/md5.ts +67 -0
  114. package/src/prove/prep/pragma.ts +221 -0
  115. package/src/prove/prep/trivial.ts +22 -0
  116. package/src/prove/prove-worker.ts +22 -0
  117. package/src/prove/prove.ts +498 -0
  118. package/src/prove/ptl/decide.ts +68 -0
  119. package/src/prove/ptl/encode.ts +255 -0
  120. package/src/prove/ptl/sat.ts +151 -0
  121. package/src/prove/ptl/tableau.ts +276 -0
  122. package/src/prove/smt/axiomatize.ts +69 -0
  123. package/src/prove/smt/axioms.ts +209 -0
  124. package/src/prove/smt/context.ts +108 -0
  125. package/src/prove/smt/data.ts +636 -0
  126. package/src/prove/smt/encode.ts +164 -0
  127. package/src/prove/smt/extensionality.ts +65 -0
  128. package/src/prove/smt/flatten.ts +112 -0
  129. package/src/prove/smt/format.ts +154 -0
  130. package/src/prove/smt/instances.ts +181 -0
  131. package/src/prove/smt/rewrite.ts +772 -0
  132. package/src/prove/smt/simplify.ts +57 -0
  133. package/src/prove/smt/solver/act-cache.ts +265 -0
  134. package/src/prove/smt/solver/arith-rewriter.ts +962 -0
  135. package/src/prove/smt/solver/array.ts +22 -0
  136. package/src/prove/smt/solver/asserted-formulas.ts +469 -0
  137. package/src/prove/smt/solver/ast-lt.ts +157 -0
  138. package/src/prove/smt/solver/ast-util.ts +147 -0
  139. package/src/prove/smt/solver/ast.ts +1315 -0
  140. package/src/prove/smt/solver/auf-solver.ts +572 -0
  141. package/src/prove/smt/solver/case-split-queue.ts +178 -0
  142. package/src/prove/smt/solver/cg-table.ts +175 -0
  143. package/src/prove/smt/solver/clause.ts +276 -0
  144. package/src/prove/smt/solver/conflict-resolution.ts +343 -0
  145. package/src/prove/smt/solver/context.ts +1292 -0
  146. package/src/prove/smt/solver/ctx-simplify.ts +334 -0
  147. package/src/prove/smt/solver/der.ts +224 -0
  148. package/src/prove/smt/solver/dyn-ack.ts +141 -0
  149. package/src/prove/smt/solver/e-matching.ts +659 -0
  150. package/src/prove/smt/solver/enode.ts +259 -0
  151. package/src/prove/smt/solver/expr-ref.ts +21 -0
  152. package/src/prove/smt/solver/expr-safe-replace.ts +172 -0
  153. package/src/prove/smt/solver/fingerprints.ts +92 -0
  154. package/src/prove/smt/solver/flat-literals.ts +51 -0
  155. package/src/prove/smt/solver/goal.ts +138 -0
  156. package/src/prove/smt/solver/hash.ts +173 -0
  157. package/src/prove/smt/solver/hashtable.ts +166 -0
  158. package/src/prove/smt/solver/internalizer.ts +1381 -0
  159. package/src/prove/smt/solver/lbool.ts +5 -0
  160. package/src/prove/smt/solver/literal.ts +24 -0
  161. package/src/prove/smt/solver/lp/bound-propagator.ts +391 -0
  162. package/src/prove/smt/solver/lp/constraints.ts +78 -0
  163. package/src/prove/smt/solver/lp/containers.ts +296 -0
  164. package/src/prove/smt/solver/lp/core-solver.ts +504 -0
  165. package/src/prove/smt/solver/lp/cross-nested.ts +224 -0
  166. package/src/prove/smt/solver/lp/dep-intervals.ts +656 -0
  167. package/src/prove/smt/solver/lp/dependency.ts +51 -0
  168. package/src/prove/smt/solver/lp/dioph-eq.ts +1181 -0
  169. package/src/prove/smt/solver/lp/explanation.ts +46 -0
  170. package/src/prove/smt/solver/lp/gomory.ts +255 -0
  171. package/src/prove/smt/solver/lp/hnf-cutter.ts +125 -0
  172. package/src/prove/smt/solver/lp/hnf.ts +281 -0
  173. package/src/prove/smt/solver/lp/int-cube.ts +295 -0
  174. package/src/prove/smt/solver/lp/int-solver.ts +514 -0
  175. package/src/prove/smt/solver/lp/lar-solver.ts +816 -0
  176. package/src/prove/smt/solver/lp/lar-term.ts +62 -0
  177. package/src/prove/smt/solver/lp/lp-settings.ts +91 -0
  178. package/src/prove/smt/solver/lp/maximize-term.ts +347 -0
  179. package/src/prove/smt/solver/lp/nex-creator.ts +381 -0
  180. package/src/prove/smt/solver/lp/nex.ts +120 -0
  181. package/src/prove/smt/solver/lp/nla-backoff.ts +43 -0
  182. package/src/prove/smt/solver/lp/nla-basics.ts +398 -0
  183. package/src/prove/smt/solver/lp/nla-core.ts +968 -0
  184. package/src/prove/smt/solver/lp/nla-divisions.ts +332 -0
  185. package/src/prove/smt/solver/lp/nla-emonics.ts +373 -0
  186. package/src/prove/smt/solver/lp/nla-factorization.ts +30 -0
  187. package/src/prove/smt/solver/lp/nla-grobner.ts +904 -0
  188. package/src/prove/smt/solver/lp/nla-horner.ts +126 -0
  189. package/src/prove/smt/solver/lp/nla-intervals.ts +265 -0
  190. package/src/prove/smt/solver/lp/nla-monomial-bounds.ts +715 -0
  191. package/src/prove/smt/solver/lp/nla-monotone.ts +59 -0
  192. package/src/prove/smt/solver/lp/nla-order.ts +307 -0
  193. package/src/prove/smt/solver/lp/nla-patcher.ts +112 -0
  194. package/src/prove/smt/solver/lp/nla-tangents.ts +251 -0
  195. package/src/prove/smt/solver/lp/nla-throttle.ts +85 -0
  196. package/src/prove/smt/solver/lp/nla-types.ts +124 -0
  197. package/src/prove/smt/solver/lp/nla-var-eqs.ts +141 -0
  198. package/src/prove/smt/solver/lp/nra-solver.ts +440 -0
  199. package/src/prove/smt/solver/lp/numeric-pair.ts +65 -0
  200. package/src/prove/smt/solver/lp/pdd-interval.ts +31 -0
  201. package/src/prove/smt/solver/lp/pdd-simplifier.ts +184 -0
  202. package/src/prove/smt/solver/lp/pdd-solver.ts +408 -0
  203. package/src/prove/smt/solver/lp/pdd.ts +971 -0
  204. package/src/prove/smt/solver/lp/random-updater.ts +138 -0
  205. package/src/prove/smt/solver/lp/static-matrix.ts +246 -0
  206. package/src/prove/smt/solver/lp/union-find.ts +96 -0
  207. package/src/prove/smt/solver/mam-compiler.ts +847 -0
  208. package/src/prove/smt/solver/mam-interpreter.ts +400 -0
  209. package/src/prove/smt/solver/maximize-ac-sharing.ts +118 -0
  210. package/src/prove/smt/solver/model-checker.ts +347 -0
  211. package/src/prove/smt/solver/model-evaluator.ts +262 -0
  212. package/src/prove/smt/solver/model-finder.ts +155 -0
  213. package/src/prove/smt/solver/model-generator.ts +97 -0
  214. package/src/prove/smt/solver/model-macro-solver.ts +728 -0
  215. package/src/prove/smt/solver/nlsat/algebraic.ts +1161 -0
  216. package/src/prove/smt/solver/nlsat/atoms.ts +238 -0
  217. package/src/prove/smt/solver/nlsat/evaluator.ts +303 -0
  218. package/src/prove/smt/solver/nlsat/explain.ts +607 -0
  219. package/src/prove/smt/solver/nlsat/interval-set.ts +351 -0
  220. package/src/prove/smt/solver/nlsat/levelwise.ts +740 -0
  221. package/src/prove/smt/solver/nlsat/mpbq.ts +161 -0
  222. package/src/prove/smt/solver/nlsat/polynomial.ts +1722 -0
  223. package/src/prove/smt/solver/nlsat/solver.ts +911 -0
  224. package/src/prove/smt/solver/nlsat/types.ts +43 -0
  225. package/src/prove/smt/solver/nlsat/upolynomial-factorization.ts +648 -0
  226. package/src/prove/smt/solver/nlsat/upolynomial.ts +996 -0
  227. package/src/prove/smt/solver/nnf.ts +469 -0
  228. package/src/prove/smt/solver/pattern-inference.ts +351 -0
  229. package/src/prove/smt/solver/poly-rewriter.ts +477 -0
  230. package/src/prove/smt/solver/propagate-values.ts +83 -0
  231. package/src/prove/smt/solver/proto-model.ts +551 -0
  232. package/src/prove/smt/solver/pull-quant.ts +139 -0
  233. package/src/prove/smt/solver/qe-lite-der.ts +526 -0
  234. package/src/prove/smt/solver/qe-lite-fm.ts +576 -0
  235. package/src/prove/smt/solver/qe-lite.ts +381 -0
  236. package/src/prove/smt/solver/qi-queue.ts +362 -0
  237. package/src/prove/smt/solver/quant-tactics.ts +117 -0
  238. package/src/prove/smt/solver/quantifier-analyzer.ts +562 -0
  239. package/src/prove/smt/solver/quantifier-manager.ts +186 -0
  240. package/src/prove/smt/solver/random-gen.ts +10 -0
  241. package/src/prove/smt/solver/rational.ts +165 -0
  242. package/src/prove/smt/solver/ref-vector.ts +62 -0
  243. package/src/prove/smt/solver/relevancy.ts +247 -0
  244. package/src/prove/smt/solver/rewriter-tpl.ts +1159 -0
  245. package/src/prove/smt/solver/rewriter.ts +843 -0
  246. package/src/prove/smt/solver/rlimit.ts +79 -0
  247. package/src/prove/smt/solver/smtlib-parser.ts +526 -0
  248. package/src/prove/smt/solver/solver.ts +71 -0
  249. package/src/prove/smt/solver/sort.ts +35 -0
  250. package/src/prove/smt/solver/sticky-generations.ts +69 -0
  251. package/src/prove/smt/solver/theory-lra-axioms.ts +340 -0
  252. package/src/prove/smt/solver/theory-lra-bounds.ts +226 -0
  253. package/src/prove/smt/solver/theory-lra-final-check.ts +252 -0
  254. package/src/prove/smt/solver/theory-lra-internalize.ts +476 -0
  255. package/src/prove/smt/solver/theory-lra-model.ts +243 -0
  256. package/src/prove/smt/solver/theory-lra-propagate.ts +405 -0
  257. package/src/prove/smt/solver/theory-lra-state.ts +43 -0
  258. package/src/prove/smt/solver/theory-lra.ts +56 -0
  259. package/src/prove/smt/solver/var-subst.ts +258 -0
  260. package/src/prove/smt/solver/z3-license.txt +10 -0
  261. package/src/prove/smt/table.ts +170 -0
  262. package/src/prove/tlapm/tlapm.ts +96 -0
  263. package/src/prove/tlaps-module.ts +510 -0
  264. package/src/prove/verdict.ts +18 -0
  265. package/src/prove/zenon/LICENSE +32 -0
  266. package/src/prove/zenon/check/check.ts +105 -0
  267. package/src/prove/zenon/check/definitions.ts +144 -0
  268. package/src/prove/zenon/check/equality.ts +182 -0
  269. package/src/prove/zenon/check/functions.ts +62 -0
  270. package/src/prove/zenon/check/keys.ts +125 -0
  271. package/src/prove/zenon/check/propositional.ts +104 -0
  272. package/src/prove/zenon/check/records.ts +188 -0
  273. package/src/prove/zenon/check/relations.ts +121 -0
  274. package/src/prove/zenon/check/rewrites.ts +224 -0
  275. package/src/prove/zenon/check/sets.ts +302 -0
  276. package/src/prove/zenon/check/terms.ts +127 -0
  277. package/src/prove/zenon/check/tla.ts +126 -0
  278. package/src/prove/zenon/decide.ts +113 -0
  279. package/src/prove/zenon/encode.ts +379 -0
  280. package/src/prove/zenon/eqrel.ts +300 -0
  281. package/src/prove/zenon/equality-rules.ts +435 -0
  282. package/src/prove/zenon/expr.ts +551 -0
  283. package/src/prove/zenon/index-table.ts +350 -0
  284. package/src/prove/zenon/isar-case.ts +513 -0
  285. package/src/prove/zenon/isar.ts +1249 -0
  286. package/src/prove/zenon/limits.ts +15 -0
  287. package/src/prove/zenon/llproof.ts +173 -0
  288. package/src/prove/zenon/mltoll.ts +1566 -0
  289. package/src/prove/zenon/node.ts +297 -0
  290. package/src/prove/zenon/ocaml.ts +169 -0
  291. package/src/prove/zenon/parse.ts +247 -0
  292. package/src/prove/zenon/phrase.ts +191 -0
  293. package/src/prove/zenon/proof.ts +198 -0
  294. package/src/prove/zenon/propositional-rules.ts +387 -0
  295. package/src/prove/zenon/rules.ts +94 -0
  296. package/src/prove/zenon/search.ts +288 -0
  297. package/src/prove/zenon/tla/functions.ts +151 -0
  298. package/src/prove/zenon/tla/llproof.ts +480 -0
  299. package/src/prove/zenon/tla/records.ts +225 -0
  300. package/src/prove/zenon/tla/rewrites.ts +447 -0
  301. package/src/prove/zenon/tla/sets.ts +304 -0
  302. package/src/prove/zenon/tla/terms.ts +181 -0
  303. package/src/prove/zenon/tla/tla.ts +506 -0
  304. package/src/run-cli.ts +283 -81
  305. package/src/successors.ts +24 -5
  306. package/src/tlapm-cache.ts +236 -0
  307. package/src/tlc-random.ts +55 -32
  308. package/src/tlc-version.ts +8 -7
  309. package/src/values.ts +47 -4
  310. package/src/worker.ts +65 -0
  311. package/dist/parallel.cjs +0 -12
  312. package/dist/parallel.js +0 -12
@@ -0,0 +1,46 @@
1
+ // Ported from Z3 (src/math/lp/explanation.h), MIT license, see z3-license.txt. The constraints
2
+ // behind a conflict or a propagation: weighted pairs, or a set of constraint indices whose
3
+ // iteration order is the slot order of Z3's hashtable.
4
+ import { getIdentityHash, ObjMap } from "../hashtable";
5
+ import { Rational } from "../rational";
6
+ import { type Dependency, linearize } from "./dependency";
7
+
8
+ export class Explanation {
9
+ private pairs: [number, Rational][] = [];
10
+ private indices = new ObjMap<true>(getIdentityHash);
11
+
12
+ clear() {
13
+ this.pairs = [];
14
+ this.indices.clear();
15
+ }
16
+
17
+ addPair(constraint: number, coeff: Rational) {
18
+ this.pairs.push([constraint, coeff]);
19
+ }
20
+
21
+ push(constraint: number) {
22
+ this.indices.set(constraint, true);
23
+ }
24
+
25
+ // push_explanation: the constraints behind a dependency.
26
+ pushDependency(dep: Dependency) {
27
+ for (const constraint of linearize([dep])) this.push(constraint);
28
+ }
29
+
30
+ get isEmpty() {
31
+ return this.pairs.length === 0 && this.indices.size === 0;
32
+ }
33
+
34
+ // add_expl: the pairs of the other explanation, or its indices when it has no pairs.
35
+ addExplanation(other: Explanation) {
36
+ if (other.pairs.length === 0)
37
+ for (const constraint of other.indices.keys()) this.push(constraint);
38
+ else for (const pair of other.pairs) this.addPair(pair[0], pair[1]);
39
+ }
40
+
41
+ // The constraints, from the pairs when there are any and from the indices otherwise.
42
+ *[Symbol.iterator](): IterableIterator<number> {
43
+ if (this.pairs.length > 0) for (const pair of this.pairs) yield pair[0];
44
+ else yield* this.indices.keys();
45
+ }
46
+ }
@@ -0,0 +1,255 @@
1
+ // Ported from Z3 (src/math/lp/gomory.cpp), MIT license, see z3-license.txt. Gomory cuts: from the
2
+ // row of a fractional basic column whose non-basic columns sit at bounds, the inequality that every
3
+ // integer solution meets and the current solution violates.
4
+ import { Rational } from "../rational";
5
+ import { KIND_GE, KIND_LE } from "./constraints";
6
+ import { LP_CANCELLED } from "./core-solver";
7
+ import { type Dependency, mkJoin, mkLeaf } from "./dependency";
8
+ import type { IntSolver, LiaMove } from "./int-solver";
9
+ import { Impq } from "./numeric-pair";
10
+ import type { RowCell } from "./static-matrix";
11
+
12
+ const POLARITY_UNDEF = 0;
13
+ const POLARITY_MIN = 1;
14
+ const POLARITY_MAX = 2;
15
+ const POLARITY_MIXED = 3;
16
+
17
+ const HALF = Rational.of(1n, 2n);
18
+
19
+ const getFractionalPart = (value: Rational) => value.sub(value.floor());
20
+
21
+ interface Cut {
22
+ coeffs: [number, Rational][];
23
+ offset: Rational;
24
+ dep: Dependency;
25
+ }
26
+
27
+ // create_cut: the cut of one row, in the term and the offset of the integer solver.
28
+ class CutBuilder {
29
+ polarity = POLARITY_UNDEF;
30
+ offset = Rational.one;
31
+ dep: Dependency = null;
32
+ private f: Rational;
33
+ private oneMinusF: Rational;
34
+ private bigNumber = Rational.zero;
35
+ private isBigFound = false;
36
+
37
+ constructor(
38
+ private lia: IntSolver,
39
+ private infColumn: number,
40
+ private row: RowCell[],
41
+ ) {
42
+ this.f = getFractionalPart(lia.solver.getValue(infColumn).x);
43
+ this.oneMinusF = Rational.one.sub(this.f);
44
+ }
45
+
46
+ private setPolarity(polarity: number) {
47
+ if (this.polarity === POLARITY_MIXED) return;
48
+ if (this.polarity === POLARITY_UNDEF) this.polarity = polarity;
49
+ else if (this.polarity !== polarity) this.polarity = POLARITY_MIXED;
50
+ }
51
+
52
+ private setPolarityForInt(coeff: Rational, column: number) {
53
+ const isLower = this.lia.atLower(column);
54
+ const isUpper = !isLower && this.lia.atUpper(column);
55
+ const towardMax = coeff.isPositive() ? isLower : isUpper;
56
+ const towardMin = coeff.isPositive() ? isUpper : isLower;
57
+ this.setPolarity(towardMax ? POLARITY_MAX : towardMin ? POLARITY_MIN : POLARITY_MIXED);
58
+ }
59
+
60
+ private addMonomial(newA: Rational, column: number) {
61
+ this.lia.term.addMonomial(newA, column);
62
+ if (Rational.of(newA.num).compare(this.bigNumber) > 0) this.isBigFound = true;
63
+ }
64
+
65
+ // int_case_in_gomory_cut, with fj the fractional part of the negated coefficient.
66
+ private addIntCase(column: number, fj: Rational) {
67
+ const solver = this.lia.solver;
68
+ const oneMinusFj = Rational.one.sub(fj);
69
+ if (this.lia.atLower(column)) {
70
+ const newA =
71
+ fj.compare(this.oneMinusF) <= 0 ? fj.div(this.oneMinusF) : oneMinusFj.div(this.f);
72
+ this.offset = this.offset.add(newA.mul(solver.getLowerBound(column).x));
73
+ this.lia.explanation.pushDependency(solver.getLowerWitness(column));
74
+ this.addMonomial(newA, column);
75
+ return;
76
+ }
77
+ const newA = (fj.compare(this.f) <= 0 ? fj.div(this.f) : oneMinusFj.div(this.oneMinusF)).neg();
78
+ this.offset = this.offset.add(newA.mul(solver.getUpperBound(column).x));
79
+ this.lia.explanation.pushDependency(solver.getUpperWitness(column));
80
+ this.addMonomial(newA, column);
81
+ }
82
+
83
+ // real_case_in_gomory_cut, with a the negated coefficient.
84
+ private addRealCase(a: Rational, column: number) {
85
+ const solver = this.lia.solver;
86
+ const isLower = this.lia.atLower(column);
87
+ const isGrowing = a.isPositive() === isLower;
88
+ const newA = isGrowing ? a.div(this.oneMinusF) : a.neg().div(this.f);
89
+ this.setPolarity(isGrowing ? POLARITY_MIN : POLARITY_MAX);
90
+ const bound = isLower ? solver.getLowerBound(column) : solver.getUpperBound(column);
91
+ this.offset = this.offset.add(newA.mul(bound.x));
92
+ this.lia.explanation.pushDependency(
93
+ isLower ? solver.getLowerWitness(column) : solver.getUpperWitness(column),
94
+ );
95
+ this.addMonomial(newA, column);
96
+ }
97
+
98
+ cut(): LiaMove["kind"] | "cut" {
99
+ const lia = this.lia;
100
+ const solver = lia.solver;
101
+ lia.term.clear();
102
+ lia.explanation.clear();
103
+ let absMax = Rational.zero;
104
+ for (const cell of this.row) {
105
+ const value = cell.coeff.ceil().abs();
106
+ if (value.compare(absMax) > 0) absMax = value;
107
+ }
108
+ this.bigNumber = absMax.mul(absMax);
109
+ for (const cell of this.row) {
110
+ const column = cell.column;
111
+ if (column === this.infColumn) continue;
112
+ if (solver.isFixed(column)) {
113
+ this.lia.explanation.pushDependency(solver.getLowerWitness(column));
114
+ this.lia.explanation.pushDependency(solver.getUpperWitness(column));
115
+ continue;
116
+ }
117
+ if (!solver.isInt(column)) this.addRealCase(cell.coeff.neg(), column);
118
+ else {
119
+ if (!cell.coeff.isInt()) this.addIntCase(column, getFractionalPart(cell.coeff.neg()));
120
+ if (this.polarity !== POLARITY_MIXED) this.setPolarityForInt(cell.coeff, column);
121
+ }
122
+ if (this.isBigFound) return "undef";
123
+ }
124
+ if (lia.term.size === 0) return "conflict";
125
+ for (const constraint of lia.explanation) this.dep = mkJoin(mkLeaf(constraint), this.dep);
126
+ return "cut";
127
+ }
128
+ }
129
+
130
+ // get_gomory_score: the distance of the value of the column to the nearest integer.
131
+ const getGomoryScore = (lia: IntSolver, column: number) => {
132
+ const value = lia.solver.getValue(column).x;
133
+ const fraction = getFractionalPart(value);
134
+ return fraction.compare(HALF) <= 0 ? fraction : Rational.one.sub(fraction);
135
+ };
136
+
137
+ // is_gomory_cut_target: every other column of the row is integral with an integral coefficient,
138
+ // or sits at a bound without an infinitesimal.
139
+ const isGomoryCutTarget = (lia: IntSolver, column: number) => {
140
+ const solver = lia.solver;
141
+ for (const cell of solver.getRow(solver.core.heading[column])) {
142
+ if (cell.column === column) continue;
143
+ const value = solver.getValue(cell.column);
144
+ if (cell.coeff.isInt() && solver.isInt(cell.column) && value.isInt()) continue;
145
+ if (!lia.atBound(cell.column) || !value.y.isZero()) return false;
146
+ }
147
+ return true;
148
+ };
149
+
150
+ // gomory_select_int_infeasible_vars: up to the given number of target columns, drawn with a bias
151
+ // toward the values closest to integers.
152
+ const selectColumns = (lia: IntSolver, cutCount: number) => {
153
+ const solver = lia.solver;
154
+ const scores = new Map<number, Rational>();
155
+ const sorted: number[] = [];
156
+ for (const column of solver.core.basis) {
157
+ if (!lia.isColumnIntInf(column) || !isGomoryCutTarget(lia, column)) continue;
158
+ sorted.push(column);
159
+ scores.set(column, getGomoryScore(lia, column));
160
+ }
161
+ sorted.sort((first, second) => {
162
+ const byScore = (scores.get(first) ?? Rational.zero).compare(
163
+ scores.get(second) ?? Rational.zero,
164
+ );
165
+ if (byScore !== 0) return byScore;
166
+ return solver.getUsageInTerms(second) - solver.getUsageInTerms(first);
167
+ });
168
+ const selected: number[] = [];
169
+ for (let remaining = cutCount; remaining > 0 && sorted.length > 0; remaining--) {
170
+ const count = sorted.length;
171
+ const ratio = (solver.settings.getRandomNext() % count) / count;
172
+ const index = Math.floor(ratio * ratio * ratio * count);
173
+ selected.push(sorted[index]);
174
+ sorted.splice(index, 1);
175
+ }
176
+ return selected;
177
+ };
178
+
179
+ // add_deps: the bounds of the integer columns with integral coefficients, which the cut leaves
180
+ // out of its explanation.
181
+ const addDeps = (lia: IntSolver, dep: Dependency, row: RowCell[], basic: number) => {
182
+ const solver = lia.solver;
183
+ let result = dep;
184
+ for (const cell of row) {
185
+ const column = cell.column;
186
+ if (column === basic || solver.isFixed(column) || !solver.isInt(column)) continue;
187
+ if (!cell.coeff.isInt()) continue;
188
+ const witness = lia.atLower(column)
189
+ ? solver.getLowerWitness(column)
190
+ : solver.getUpperWitness(column);
191
+ result = mkJoin(witness, result);
192
+ }
193
+ return result;
194
+ };
195
+
196
+ // get_gomory_cuts: cuts for the selected rows. Cuts with big coefficients stay out unless the
197
+ // small ones alone leave the problem feasible.
198
+ export const getGomoryCuts = (lia: IntSolver, cutCount: number): LiaMove => {
199
+ const solver = lia.solver;
200
+ const bigCuts: Cut[] = [];
201
+ let hasSmallCut = false;
202
+ const addCut = (cut: Cut) => {
203
+ const column = solver.addTerm(cut.coeffs, -1);
204
+ solver.updateColumnTypeAndBound(column, KIND_GE, new Impq(cut.offset), cut.dep);
205
+ };
206
+ const isFeasible = () => {
207
+ solver.findFeasibleSolution();
208
+ if (solver.isFeasible() || solver.settings.isCanceled()) return true;
209
+ solver.getInfeasibilityExplanation(lia.explanation);
210
+ return false;
211
+ };
212
+ for (const column of selectColumns(lia, cutCount)) {
213
+ const row = solver.getRow(solver.core.heading[column]);
214
+ const builder = new CutBuilder(lia, column, row);
215
+ const result = builder.cut();
216
+ if (result === "conflict") return { kind: "conflict" };
217
+ if (result !== "cut") continue;
218
+ const value = solver.getValue(column).x;
219
+ if (builder.polarity === POLARITY_MAX)
220
+ solver.updateColumnTypeAndBound(
221
+ column,
222
+ KIND_LE,
223
+ new Impq(value.floor()),
224
+ addDeps(lia, builder.dep, row, column),
225
+ );
226
+ else if (builder.polarity === POLARITY_MIN)
227
+ solver.updateColumnTypeAndBound(
228
+ column,
229
+ KIND_GE,
230
+ new Impq(value.ceil()),
231
+ addDeps(lia, builder.dep, row, column),
232
+ );
233
+ const cut = { coeffs: [...lia.term.coeffs], offset: builder.offset, dep: builder.dep };
234
+ if (cut.coeffs.some((entry) => entry[1].isBig())) {
235
+ bigCuts.push(cut);
236
+ continue;
237
+ }
238
+ hasSmallCut = true;
239
+ addCut(cut);
240
+ if (solver.settings.isCanceled()) return { kind: "undef" };
241
+ }
242
+ if (bigCuts.length > 0) {
243
+ solver.push();
244
+ for (const cut of bigCuts) addCut(cut);
245
+ const isBigFeasible = isFeasible();
246
+ solver.pop(1);
247
+ if (!isBigFeasible) for (const cut of bigCuts) addCut(cut);
248
+ }
249
+ if (!isFeasible()) return { kind: "conflict" };
250
+ if (solver.status === LP_CANCELLED) return { kind: "undef" };
251
+ if (!solver.hasInfInt()) return { kind: "sat" };
252
+ if (hasSmallCut || bigCuts.length > 0) return { kind: "continue" };
253
+ solver.moveNonBasicColumnsToBounds();
254
+ return { kind: "undef" };
255
+ };
@@ -0,0 +1,125 @@
1
+ // Ported from Z3 (src/math/lp/hnf_cutter.cpp, and get_equality_and_right_side_for_term_on_current_x
2
+ // in src/math/lp/lar_solver.cpp), MIT license, see z3-license.txt. Cuts from proofs: the integer
3
+ // terms tight at the current solution form A x = b; with A in Hermite normal form H, a row of
4
+ // H^-1 b that is fractional gives a cut that every integer solution meets.
5
+ import { Rational } from "../rational";
6
+ import type { Dependency } from "./dependency";
7
+ import { GeneralMatrix, getDeterminantOfRectangularMatrix, getHermiteNormalForm } from "./hnf";
8
+ import type { IntSolver, LiaMove } from "./int-solver";
9
+ import type { LarTerm } from "./lar-term";
10
+
11
+ interface TightTerm {
12
+ term: LarTerm;
13
+ isUpper: boolean;
14
+ rightSide: Rational;
15
+ dep: Dependency;
16
+ }
17
+
18
+ // get_equality_and_right_side_for_term_on_current_x: the non-strict bound of an integer term that
19
+ // its current value meets, without infinitesimals.
20
+ const getTightTerm = (lia: IntSolver, term: LarTerm): TightTerm | undefined => {
21
+ const solver = lia.solver;
22
+ const column = term.column;
23
+ if (!solver.isInt(column)) return undefined;
24
+ let rightSide = Rational.zero;
25
+ for (const entry of term.coeffs) {
26
+ const value = solver.getValue(entry[0]);
27
+ if (!value.y.isZero()) return undefined;
28
+ rightSide = rightSide.add(value.x.mul(entry[1]));
29
+ }
30
+ const upperWitness = solver.getUpperWitness(column);
31
+ const upper = solver.getUpperBound(column);
32
+ if (upperWitness !== null && !upper.y.isNegative() && rightSide.equals(upper.x))
33
+ return { term, isUpper: true, rightSide, dep: upperWitness };
34
+ const lowerWitness = solver.getLowerWitness(column);
35
+ const lower = solver.getLowerBound(column);
36
+ if (lowerWitness !== null && !lower.y.isPositive() && rightSide.equals(lower.x))
37
+ return { term, isUpper: false, rightSide: rightSide.neg(), dep: lowerWitness };
38
+ return undefined;
39
+ };
40
+
41
+ // find_cut_row_index: a fractional entry, drawn uniformly by reservoir sampling.
42
+ const findCutRowIndex = (lia: IntSolver, values: Rational[]) => {
43
+ let result = -1;
44
+ let count = 0;
45
+ for (let index = 0; index < values.length; index++) {
46
+ if (values[index].isInt()) continue;
47
+ if (count === 0) {
48
+ count = 1;
49
+ result = index;
50
+ } else if (lia.solver.settings.getRandomNext() % ++count === 0) result = index;
51
+ }
52
+ return result;
53
+ };
54
+
55
+ // make_hnf_cut: the cut, in the term and the explanation of the integer solver.
56
+ export const makeHnfCut = (lia: IntSolver): LiaMove => {
57
+ const solver = lia.solver;
58
+ const settings = solver.settings;
59
+ const tightTerms: TightTerm[] = [];
60
+ const columns: number[] = [];
61
+ const localColumns = new Map<number, number>();
62
+ let absMax = Rational.zero;
63
+ for (const term of solver.terms) {
64
+ if (
65
+ tightTerms.length >= settings.limitOnRowsForHnfCutter ||
66
+ columns.length >= settings.limitOnColumnsForHnfCutter
67
+ )
68
+ continue;
69
+ const tight = getTightTerm(lia, term);
70
+ if (tight === undefined) continue;
71
+ tightTerms.push(tight);
72
+ for (const entry of term.coeffs) {
73
+ if (!localColumns.has(entry[0])) {
74
+ localColumns.set(entry[0], columns.length);
75
+ columns.push(entry[0]);
76
+ }
77
+ const magnitude = entry[1].ceil().abs();
78
+ if (magnitude.compare(absMax) > 0) absMax = magnitude;
79
+ }
80
+ }
81
+ if (columns.every((column) => solver.getValue(column).isInt())) return { kind: "undef" };
82
+ const matrix = new GeneralMatrix(tightTerms.length, columns.length);
83
+ tightTerms.forEach((tight, row) => {
84
+ const sign = tight.isUpper ? Rational.one : Rational.minusOne;
85
+ for (const entry of tight.term.coeffs)
86
+ matrix.data[row][localColumns.get(entry[0]) ?? 0] = sign.mul(entry[1]);
87
+ });
88
+ const basisRows: number[] = [];
89
+ const bigNumber = absMax.mul(absMax).mul(absMax);
90
+ const d = getDeterminantOfRectangularMatrix(matrix, basisRows, bigNumber);
91
+ if (d.compare(bigNumber) >= 0 || settings.isCanceled()) return { kind: "undef" };
92
+ const isFullRank = basisRows.length === tightTerms.length;
93
+ matrix.shrinkToRank(basisRows);
94
+ const deps = isFullRank
95
+ ? tightTerms.map((tight) => tight.dep)
96
+ : basisRows.map((row) => tightTerms[row].dep);
97
+ const h = getHermiteNormalForm(matrix, d, () => settings.isCanceled());
98
+ if (h === undefined) return { kind: "undef" };
99
+ const b = isFullRank
100
+ ? tightTerms.map((tight) => tight.rightSide)
101
+ : basisRows.map((row) => tightTerms[row].rightSide);
102
+ for (let i = 0; i < h.length; i++) {
103
+ for (let j = 0; j < i; j++) b[i] = b[i].sub(h[i][j].mul(b[j]));
104
+ b[i] = b[i].div(h[i][i]);
105
+ }
106
+ const cutRow = findCutRowIndex(lia, b);
107
+ if (cutRow === -1) return { kind: "undef" };
108
+ // get_ei_H_minus_1: the row cutRow of the inverse of H.
109
+ const inverseRow = Array.from({ length: matrix.getColumnCount() }, () => Rational.zero);
110
+ inverseRow[cutRow] = Rational.one.div(h[cutRow][cutRow]);
111
+ for (let k = cutRow - 1; k >= 0; k--) {
112
+ let sum = Rational.zero;
113
+ for (let l = k + 1; l <= cutRow; l++) sum = sum.add(h[l][k].mul(inverseRow[l]));
114
+ inverseRow[k] = sum.neg().div(h[k][k]);
115
+ }
116
+ for (let column = 0; column < matrix.getColumnCount(); column++) {
117
+ let coeff = Rational.zero;
118
+ for (let row = 0; row < matrix.getRowCount(); row++)
119
+ coeff = coeff.add(inverseRow[row].mul(matrix.get(row, column)));
120
+ if (!coeff.isZero()) lia.term.addMonomial(coeff, columns[column]);
121
+ }
122
+ lia.explanation.clear();
123
+ for (const dep of deps) lia.explanation.pushDependency(dep);
124
+ return { kind: "cut", offset: b[cutRow].floor(), isUpper: true };
125
+ };