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.
Files changed (381) hide show
  1. package/README.md +46 -115
  2. package/dist/cli.cjs +1 -1
  3. package/dist/cli.js +1 -1
  4. package/dist/deciders.cjs +366 -0
  5. package/dist/deciders.js +366 -0
  6. package/dist/index.cjs +1 -1
  7. package/dist/index.d.cts +194 -8
  8. package/dist/index.d.ts +194 -8
  9. package/dist/index.js +1 -1
  10. package/dist/parallel-worker.cjs +1 -4
  11. package/dist/parallel-worker.js +1 -4
  12. package/dist/prove-worker.cjs +9 -0
  13. package/dist/prove-worker.d.cts +9 -0
  14. package/dist/prove-worker.d.ts +9 -0
  15. package/dist/prove-worker.js +9 -0
  16. package/dist/prove.cjs +1006 -0
  17. package/dist/prove.js +1006 -0
  18. package/dist/run.cjs +45 -0
  19. package/dist/run.js +45 -0
  20. package/dist/tlapm.cjs +10 -0
  21. package/dist/tlapm.js +10 -0
  22. package/dist/transfer.cjs +1377 -18
  23. package/dist/transfer.js +1377 -18
  24. package/dist/worker.cjs +21 -0
  25. package/dist/worker.js +21 -0
  26. package/package.json +24 -11
  27. package/src/ast.ts +149 -8
  28. package/src/bags.ts +26 -30
  29. package/src/builtins.ts +45 -19
  30. package/src/bundled-modules.ts +3 -3
  31. package/src/check.ts +1182 -900
  32. package/src/cli/options.ts +109 -0
  33. package/src/cli/run.ts +63 -0
  34. package/src/cli/shared.ts +106 -0
  35. package/src/cli/tlapm.ts +374 -0
  36. package/src/cli/tlc.ts +941 -0
  37. package/src/cli/xml-exporter.ts +221 -0
  38. package/src/cli.ts +9 -2
  39. package/src/codegen.ts +112 -51
  40. package/src/config.ts +254 -181
  41. package/src/dependencies.ts +5 -7
  42. package/src/environment.ts +579 -184
  43. package/src/errors.ts +287 -4
  44. package/src/evaluate.ts +1095 -365
  45. package/src/exit-codes.ts +22 -43
  46. package/src/fingerprints.ts +49 -14
  47. package/src/index.ts +11 -0
  48. package/src/instances.ts +73 -60
  49. package/src/java-overrides.ts +183 -66
  50. package/src/json.ts +31 -36
  51. package/src/levels.ts +197 -54
  52. package/src/lexer.ts +127 -30
  53. package/src/liveness-checker.ts +894 -0
  54. package/src/liveness.ts +246 -596
  55. package/src/{obligation-action.ts → obligations/action.ts} +248 -74
  56. package/src/{obligation-anon.ts → obligations/anonymize.ts} +55 -57
  57. package/src/obligations/equality.ts +260 -0
  58. package/src/obligations/expression.ts +618 -0
  59. package/src/{obligation-format.ts → obligations/format.ts} +7 -8
  60. package/src/obligations/generate.ts +457 -0
  61. package/src/{obligations.ts → obligations/index.ts} +46 -32
  62. package/src/{obligation-levels.ts → obligations/levels.ts} +44 -40
  63. package/src/obligations/module.ts +445 -0
  64. package/src/obligations/normalize.ts +554 -0
  65. package/src/obligations/operators.ts +176 -0
  66. package/src/obligations/pragma.ts +195 -0
  67. package/src/{obligation-printer.ts → obligations/printer.ts} +65 -230
  68. package/src/{obligation-proof.ts → obligations/proof.ts} +7 -2
  69. package/src/obligations/regroup.ts +100 -0
  70. package/src/{obligation-generate.ts → obligations/simplify.ts} +130 -536
  71. package/src/{obligation-source.ts → obligations/source.ts} +174 -216
  72. package/src/{obligation-deref.ts → obligations/subexpression.ts} +84 -115
  73. package/src/obligations/substitution.ts +261 -0
  74. package/src/obligations/temporal.ts +321 -0
  75. package/src/{obligation-tuples.ts → obligations/tuples.ts} +38 -54
  76. package/src/parallel-worker.ts +184 -235
  77. package/src/parallel.ts +156 -91
  78. package/src/parser.ts +490 -188
  79. package/src/pcal/ast.ts +755 -0
  80. package/src/pcal/parse.ts +1487 -0
  81. package/src/pcal/tokenize.ts +487 -0
  82. package/src/pcal/translate.ts +1151 -0
  83. package/src/pcal/validate.ts +444 -0
  84. package/src/prover/decide-pool.ts +95 -0
  85. package/src/prover/deciders.ts +33 -0
  86. package/src/prover/first-order.ts +175 -0
  87. package/src/prover/isabelle/LICENSE +36 -0
  88. package/src/prover/isabelle/LICENSE-tlapm +26 -0
  89. package/src/prover/isabelle/decide.ts +44 -0
  90. package/src/prover/isabelle/encode.ts +445 -0
  91. package/src/prover/isabelle/isar/inner-syntax.ts +579 -0
  92. package/src/prover/isabelle/isar/method.ts +367 -0
  93. package/src/prover/isabelle/isar/proof.ts +28 -0
  94. package/src/prover/isabelle/isar/statement.ts +57 -0
  95. package/src/prover/isabelle/isar/theory.ts +192 -0
  96. package/src/prover/isabelle/isar/type-check.ts +278 -0
  97. package/src/prover/isabelle/provers/blast/blast.ts +258 -0
  98. package/src/prover/isabelle/provers/blast/branch.ts +322 -0
  99. package/src/prover/isabelle/provers/blast/prove.ts +347 -0
  100. package/src/prover/isabelle/provers/blast/rules.ts +330 -0
  101. package/src/prover/isabelle/provers/blast/state.ts +180 -0
  102. package/src/prover/isabelle/provers/blast/term.ts +546 -0
  103. package/src/prover/isabelle/provers/clasimp.ts +150 -0
  104. package/src/prover/isabelle/provers/classical.ts +389 -0
  105. package/src/prover/isabelle/provers/hypsubst.ts +433 -0
  106. package/src/prover/isabelle/pure/bicompose.ts +174 -0
  107. package/src/prover/isabelle/pure/consts.ts +32 -0
  108. package/src/prover/isabelle/pure/conv.ts +79 -0
  109. package/src/prover/isabelle/pure/drule.ts +264 -0
  110. package/src/prover/isabelle/pure/envir.ts +331 -0
  111. package/src/prover/isabelle/pure/goal.ts +53 -0
  112. package/src/prover/isabelle/pure/interrupt.ts +16 -0
  113. package/src/prover/isabelle/pure/list.ts +12 -0
  114. package/src/prover/isabelle/pure/logic.ts +330 -0
  115. package/src/prover/isabelle/pure/name.ts +98 -0
  116. package/src/prover/isabelle/pure/net.ts +215 -0
  117. package/src/prover/isabelle/pure/object-logic.ts +41 -0
  118. package/src/prover/isabelle/pure/pattern.ts +631 -0
  119. package/src/prover/isabelle/pure/raw-simplifier.ts +338 -0
  120. package/src/prover/isabelle/pure/rewriter.ts +602 -0
  121. package/src/prover/isabelle/pure/search.ts +68 -0
  122. package/src/prover/isabelle/pure/seq.ts +133 -0
  123. package/src/prover/isabelle/pure/simplifier.ts +106 -0
  124. package/src/prover/isabelle/pure/table.ts +201 -0
  125. package/src/prover/isabelle/pure/tactic.ts +168 -0
  126. package/src/prover/isabelle/pure/tactical.ts +264 -0
  127. package/src/prover/isabelle/pure/term-ord.ts +105 -0
  128. package/src/prover/isabelle/pure/term.ts +688 -0
  129. package/src/prover/isabelle/pure/thm.ts +783 -0
  130. package/src/prover/isabelle/pure/type.ts +121 -0
  131. package/src/prover/isabelle/pure/unify.ts +753 -0
  132. package/src/prover/isabelle/pure/variable.ts +25 -0
  133. package/src/prover/isabelle/tla/classical-setup.ts +101 -0
  134. package/src/prover/isabelle/tla/context.ts +74 -0
  135. package/src/prover/isabelle/tla/logic-data.ts +5 -0
  136. package/src/prover/isabelle/tla/logic.ts +215 -0
  137. package/src/prover/isabelle/tla/simpdata.ts +241 -0
  138. package/src/prover/isabelle/tools/intuitionistic.ts +132 -0
  139. package/src/prover/ocaml.ts +22 -0
  140. package/src/prover/prep/action.ts +508 -0
  141. package/src/prover/prep/enabled-axioms.ts +189 -0
  142. package/src/prover/prep/fingerprint.ts +388 -0
  143. package/src/prover/prep/level-comparison.ts +529 -0
  144. package/src/prover/prep/md5.ts +60 -0
  145. package/src/prover/prep/methods.ts +221 -0
  146. package/src/prover/prep/normalize.ts +309 -0
  147. package/src/prover/prove-worker.ts +22 -0
  148. package/src/prover/prove.ts +492 -0
  149. package/src/prover/ptl/decide.ts +68 -0
  150. package/src/prover/ptl/encode.ts +244 -0
  151. package/src/prover/ptl/sat.ts +151 -0
  152. package/src/prover/ptl/tableau.ts +276 -0
  153. package/src/prover/smt/axioms.ts +209 -0
  154. package/src/prover/smt/context.ts +108 -0
  155. package/src/prover/smt/data.ts +636 -0
  156. package/src/prover/smt/encode.ts +275 -0
  157. package/src/prover/smt/extensionality.ts +65 -0
  158. package/src/prover/smt/flatten.ts +112 -0
  159. package/src/prover/smt/format.ts +154 -0
  160. package/src/prover/smt/instances.ts +181 -0
  161. package/src/prover/smt/rewrite.ts +766 -0
  162. package/src/prover/smt/solver/act-cache.ts +265 -0
  163. package/src/prover/smt/solver/arith-rewriter.ts +962 -0
  164. package/src/prover/smt/solver/array.ts +22 -0
  165. package/src/prover/smt/solver/asserted-formulas.ts +469 -0
  166. package/src/prover/smt/solver/ast-lt.ts +157 -0
  167. package/src/prover/smt/solver/ast-util.ts +91 -0
  168. package/src/prover/smt/solver/ast.ts +1315 -0
  169. package/src/prover/smt/solver/auf-solver.ts +572 -0
  170. package/src/prover/smt/solver/case-split-queue.ts +178 -0
  171. package/src/prover/smt/solver/cg-table.ts +175 -0
  172. package/src/prover/smt/solver/clause.ts +276 -0
  173. package/src/prover/smt/solver/conflict-resolution.ts +343 -0
  174. package/src/prover/smt/solver/context.ts +1292 -0
  175. package/src/prover/smt/solver/ctx-simplify.ts +334 -0
  176. package/src/prover/smt/solver/der.ts +224 -0
  177. package/src/prover/smt/solver/dyn-ack.ts +141 -0
  178. package/src/prover/smt/solver/e-matching.ts +659 -0
  179. package/src/prover/smt/solver/enode.ts +259 -0
  180. package/src/prover/smt/solver/expr-ref.ts +21 -0
  181. package/src/prover/smt/solver/expr-safe-replace.ts +172 -0
  182. package/src/prover/smt/solver/fingerprints.ts +92 -0
  183. package/src/prover/smt/solver/flat-literals.ts +51 -0
  184. package/src/prover/smt/solver/goal.ts +138 -0
  185. package/src/prover/smt/solver/hash.ts +173 -0
  186. package/src/prover/smt/solver/hashtable.ts +166 -0
  187. package/src/prover/smt/solver/internalizer.ts +1381 -0
  188. package/src/prover/smt/solver/lbool.ts +5 -0
  189. package/src/prover/smt/solver/literal.ts +24 -0
  190. package/src/prover/smt/solver/lp/bound-propagator.ts +391 -0
  191. package/src/prover/smt/solver/lp/constraints.ts +78 -0
  192. package/src/prover/smt/solver/lp/containers.ts +296 -0
  193. package/src/prover/smt/solver/lp/core-solver.ts +504 -0
  194. package/src/prover/smt/solver/lp/cross-nested.ts +224 -0
  195. package/src/prover/smt/solver/lp/dep-intervals.ts +642 -0
  196. package/src/prover/smt/solver/lp/dependency.ts +51 -0
  197. package/src/prover/smt/solver/lp/dioph-eq.ts +1181 -0
  198. package/src/prover/smt/solver/lp/explanation.ts +46 -0
  199. package/src/prover/smt/solver/lp/gomory.ts +255 -0
  200. package/src/prover/smt/solver/lp/hnf-cutter.ts +125 -0
  201. package/src/prover/smt/solver/lp/hnf.ts +281 -0
  202. package/src/prover/smt/solver/lp/int-cube.ts +295 -0
  203. package/src/prover/smt/solver/lp/int-solver.ts +514 -0
  204. package/src/prover/smt/solver/lp/lar-solver.ts +816 -0
  205. package/src/prover/smt/solver/lp/lar-term.ts +62 -0
  206. package/src/prover/smt/solver/lp/lp-settings.ts +91 -0
  207. package/src/prover/smt/solver/lp/maximize-term.ts +347 -0
  208. package/src/prover/smt/solver/lp/nex-creator.ts +381 -0
  209. package/src/prover/smt/solver/lp/nex.ts +120 -0
  210. package/src/prover/smt/solver/lp/nla-backoff.ts +43 -0
  211. package/src/prover/smt/solver/lp/nla-basics.ts +398 -0
  212. package/src/prover/smt/solver/lp/nla-core.ts +968 -0
  213. package/src/prover/smt/solver/lp/nla-divisions.ts +332 -0
  214. package/src/prover/smt/solver/lp/nla-emonics.ts +373 -0
  215. package/src/prover/smt/solver/lp/nla-factorization.ts +30 -0
  216. package/src/prover/smt/solver/lp/nla-grobner.ts +904 -0
  217. package/src/prover/smt/solver/lp/nla-horner.ts +126 -0
  218. package/src/prover/smt/solver/lp/nla-intervals.ts +265 -0
  219. package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +715 -0
  220. package/src/prover/smt/solver/lp/nla-monotone.ts +59 -0
  221. package/src/prover/smt/solver/lp/nla-order.ts +307 -0
  222. package/src/prover/smt/solver/lp/nla-patcher.ts +112 -0
  223. package/src/prover/smt/solver/lp/nla-tangents.ts +251 -0
  224. package/src/prover/smt/solver/lp/nla-throttle.ts +85 -0
  225. package/src/prover/smt/solver/lp/nla-types.ts +124 -0
  226. package/src/prover/smt/solver/lp/nla-var-eqs.ts +141 -0
  227. package/src/prover/smt/solver/lp/nra-solver.ts +440 -0
  228. package/src/prover/smt/solver/lp/numeric-pair.ts +65 -0
  229. package/src/prover/smt/solver/lp/pdd-interval.ts +31 -0
  230. package/src/prover/smt/solver/lp/pdd-simplifier.ts +184 -0
  231. package/src/prover/smt/solver/lp/pdd-solver.ts +408 -0
  232. package/src/prover/smt/solver/lp/pdd.ts +971 -0
  233. package/src/prover/smt/solver/lp/random-updater.ts +138 -0
  234. package/src/prover/smt/solver/lp/static-matrix.ts +246 -0
  235. package/src/prover/smt/solver/lp/union-find.ts +96 -0
  236. package/src/prover/smt/solver/mam-compiler.ts +847 -0
  237. package/src/prover/smt/solver/mam-interpreter.ts +400 -0
  238. package/src/prover/smt/solver/maximize-ac-sharing.ts +118 -0
  239. package/src/prover/smt/solver/model-checker.ts +347 -0
  240. package/src/prover/smt/solver/model-evaluator.ts +262 -0
  241. package/src/prover/smt/solver/model-finder.ts +155 -0
  242. package/src/prover/smt/solver/model-generator.ts +97 -0
  243. package/src/prover/smt/solver/model-macro-solver.ts +728 -0
  244. package/src/prover/smt/solver/nlsat/algebraic.ts +1161 -0
  245. package/src/prover/smt/solver/nlsat/atoms.ts +238 -0
  246. package/src/prover/smt/solver/nlsat/evaluator.ts +303 -0
  247. package/src/prover/smt/solver/nlsat/explain.ts +607 -0
  248. package/src/prover/smt/solver/nlsat/interval-set.ts +351 -0
  249. package/src/prover/smt/solver/nlsat/levelwise.ts +737 -0
  250. package/src/prover/smt/solver/nlsat/mpbq.ts +161 -0
  251. package/src/prover/smt/solver/nlsat/polynomial.ts +1722 -0
  252. package/src/prover/smt/solver/nlsat/solver.ts +911 -0
  253. package/src/prover/smt/solver/nlsat/types.ts +43 -0
  254. package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +648 -0
  255. package/src/prover/smt/solver/nlsat/upolynomial.ts +996 -0
  256. package/src/prover/smt/solver/nnf.ts +469 -0
  257. package/src/prover/smt/solver/pattern-inference.ts +351 -0
  258. package/src/prover/smt/solver/poly-rewriter.ts +477 -0
  259. package/src/prover/smt/solver/propagate-values.ts +83 -0
  260. package/src/prover/smt/solver/proto-model.ts +551 -0
  261. package/src/prover/smt/solver/pull-quant.ts +139 -0
  262. package/src/prover/smt/solver/qe-lite-der.ts +526 -0
  263. package/src/prover/smt/solver/qe-lite-fm.ts +576 -0
  264. package/src/prover/smt/solver/qe-lite.ts +381 -0
  265. package/src/prover/smt/solver/qi-queue.ts +362 -0
  266. package/src/prover/smt/solver/quant-tactics.ts +117 -0
  267. package/src/prover/smt/solver/quantifier-analyzer.ts +562 -0
  268. package/src/prover/smt/solver/quantifier-manager.ts +186 -0
  269. package/src/prover/smt/solver/random-gen.ts +10 -0
  270. package/src/prover/smt/solver/rational.ts +165 -0
  271. package/src/prover/smt/solver/ref-vector.ts +62 -0
  272. package/src/prover/smt/solver/relevancy.ts +247 -0
  273. package/src/prover/smt/solver/rewriter-tpl.ts +1159 -0
  274. package/src/prover/smt/solver/rewriter.ts +843 -0
  275. package/src/prover/smt/solver/rlimit.ts +79 -0
  276. package/src/prover/smt/solver/smtlib-parser.ts +526 -0
  277. package/src/prover/smt/solver/solver.ts +71 -0
  278. package/src/prover/smt/solver/sort.ts +35 -0
  279. package/src/prover/smt/solver/sticky-generations.ts +69 -0
  280. package/src/prover/smt/solver/theory-lra-axioms.ts +340 -0
  281. package/src/prover/smt/solver/theory-lra-bounds.ts +226 -0
  282. package/src/prover/smt/solver/theory-lra-final-check.ts +252 -0
  283. package/src/prover/smt/solver/theory-lra-internalize.ts +476 -0
  284. package/src/prover/smt/solver/theory-lra-model.ts +243 -0
  285. package/src/prover/smt/solver/theory-lra-propagate.ts +405 -0
  286. package/src/prover/smt/solver/theory-lra-state.ts +43 -0
  287. package/src/prover/smt/solver/theory-lra.ts +56 -0
  288. package/src/prover/smt/solver/var-subst.ts +258 -0
  289. package/src/prover/smt/solver/z3-license.txt +10 -0
  290. package/src/prover/smt/table.ts +170 -0
  291. package/src/prover/tlapm/cache.ts +236 -0
  292. package/src/prover/tlapm/ocaml-marshal.ts +166 -0
  293. package/src/prover/tlapm/tlapm.ts +96 -0
  294. package/src/prover/tlaps-module.ts +510 -0
  295. package/src/prover/verdict.ts +13 -0
  296. package/src/prover/zenon/LICENSE +32 -0
  297. package/src/prover/zenon/check/check.ts +105 -0
  298. package/src/prover/zenon/check/definitions.ts +144 -0
  299. package/src/prover/zenon/check/equality.ts +182 -0
  300. package/src/prover/zenon/check/functions.ts +62 -0
  301. package/src/prover/zenon/check/keys.ts +125 -0
  302. package/src/prover/zenon/check/propositional.ts +104 -0
  303. package/src/prover/zenon/check/records.ts +188 -0
  304. package/src/prover/zenon/check/relations.ts +121 -0
  305. package/src/prover/zenon/check/rewrites.ts +224 -0
  306. package/src/prover/zenon/check/sets.ts +302 -0
  307. package/src/prover/zenon/check/terms.ts +127 -0
  308. package/src/prover/zenon/check/tla.ts +126 -0
  309. package/src/prover/zenon/decide.ts +107 -0
  310. package/src/prover/zenon/encode.ts +378 -0
  311. package/src/prover/zenon/eqrel.ts +300 -0
  312. package/src/prover/zenon/equality-rules.ts +435 -0
  313. package/src/prover/zenon/expr.ts +551 -0
  314. package/src/prover/zenon/index-table.ts +350 -0
  315. package/src/prover/zenon/isar-case.ts +513 -0
  316. package/src/prover/zenon/isar.ts +1249 -0
  317. package/src/prover/zenon/limits.ts +15 -0
  318. package/src/prover/zenon/llproof.ts +173 -0
  319. package/src/prover/zenon/mltoll.ts +1566 -0
  320. package/src/prover/zenon/node.ts +297 -0
  321. package/src/prover/zenon/ocaml.ts +169 -0
  322. package/src/prover/zenon/parse.ts +247 -0
  323. package/src/prover/zenon/phrase.ts +191 -0
  324. package/src/prover/zenon/proof.ts +198 -0
  325. package/src/prover/zenon/propositional-rules.ts +387 -0
  326. package/src/prover/zenon/rules.ts +94 -0
  327. package/src/prover/zenon/search.ts +288 -0
  328. package/src/prover/zenon/tla/functions.ts +151 -0
  329. package/src/prover/zenon/tla/llproof.ts +480 -0
  330. package/src/prover/zenon/tla/records.ts +225 -0
  331. package/src/prover/zenon/tla/rewrites.ts +447 -0
  332. package/src/prover/zenon/tla/sets.ts +304 -0
  333. package/src/prover/zenon/tla/terms.ts +162 -0
  334. package/src/prover/zenon/tla/tla.ts +506 -0
  335. package/src/randomization.ts +39 -27
  336. package/src/resolve.ts +1474 -426
  337. package/src/runtime.ts +25 -7
  338. package/src/sany/builtins.ts +147 -0
  339. package/src/sany/generator.ts +3111 -0
  340. package/src/sany/levels.ts +1205 -0
  341. package/src/sany/lexer.ts +544 -0
  342. package/src/sany/linter.ts +122 -0
  343. package/src/sany/modules.ts +1398 -0
  344. package/src/sany/nodes.ts +463 -0
  345. package/src/sany/parse-error.ts +2161 -0
  346. package/src/sany/report.ts +355 -0
  347. package/src/sany/selectors.ts +736 -0
  348. package/src/sany/source.ts +247 -0
  349. package/src/sany/xml.ts +1016 -0
  350. package/src/search.ts +969 -0
  351. package/src/spec-description.ts +66 -29
  352. package/src/{standard-levels.ts → standard-definitions.ts} +118 -2
  353. package/src/standard-modules.ts +215 -164
  354. package/src/state-graph.ts +181 -0
  355. package/src/subexpressions.ts +231 -171
  356. package/src/substitution-levels.ts +40 -19
  357. package/src/successors.ts +253 -125
  358. package/src/symmetry.ts +194 -54
  359. package/src/tableau.ts +60 -32
  360. package/src/tlc/fingerprint.ts +214 -0
  361. package/src/{tlc-modules.ts → tlc/jar-data.ts} +4 -0
  362. package/src/tlc/messages.ts +441 -0
  363. package/src/{tlc-order.ts → tlc/order.ts} +84 -16
  364. package/src/{tlc-random.ts → tlc/random.ts} +30 -189
  365. package/src/tlc/replay.ts +659 -0
  366. package/src/{tlc-summary.ts → tlc/summary.ts} +20 -5
  367. package/src/{tlc-module.ts → tlc/tlc-operators.ts} +59 -50
  368. package/src/{tlc-ext.ts → tlc/tlcext-operators.ts} +63 -45
  369. package/src/tlc/version.ts +19 -0
  370. package/src/transfer.ts +44 -32
  371. package/src/values.ts +843 -241
  372. package/src/worker.ts +62 -0
  373. package/dist/parallel.cjs +0 -12
  374. package/dist/parallel.js +0 -12
  375. package/dist/run-cli.cjs +0 -28
  376. package/dist/run-cli.js +0 -28
  377. package/src/canonical.ts +0 -39
  378. package/src/cli-options.ts +0 -58
  379. package/src/obligation-expression.ts +0 -1060
  380. package/src/obligation-module.ts +0 -1042
  381. package/src/run-cli.ts +0 -478
@@ -0,0 +1,251 @@
1
+ // Ported from Z3 (src/math/lp/nla_tangent_lemmas.h, src/math/lp/nla_tangent_lemmas.cpp), MIT
2
+ // license, see z3-license.txt. The tangent lemmas of nla: for a binary product whose value is
3
+ // wrong, the lines through the point of its factors' values and two planes tangent to z = xy that
4
+ // cut the point off.
5
+ import { Rational } from "../rational";
6
+ import { KIND_EQ, KIND_GE, KIND_GT, KIND_LE, KIND_LT, KIND_NE } from "./constraints";
7
+ import { LarTerm } from "./lar-term";
8
+ import { NLA_PARAMS, type NlaCore } from "./nla-core";
9
+ import { type Factor, type Factorization, getFactorSign } from "./nla-factorization";
10
+ import { LemmaBuilder, mkIneq } from "./nla-types";
11
+ import type { Monic } from "./nla-emonics";
12
+ import { THROTTLE_TANGENT_LEMMA } from "./nla-throttle";
13
+
14
+ interface Point {
15
+ readonly x: Rational;
16
+ readonly y: Rational;
17
+ }
18
+
19
+ const mkPoint = (x: Rational, y: Rational): Point => ({ x, y });
20
+
21
+ const TWO = Rational.of(2n);
22
+
23
+ // tangent_imp: the lemmas for one monic and its binary factorization.
24
+ class TangentImp {
25
+ private a = mkPoint(Rational.zero, Rational.zero);
26
+ private b = mkPoint(Rational.zero, Rational.zero);
27
+ private readonly correctValue: Rational;
28
+ // Whether the wrong value is below the correct one.
29
+ private readonly isBelow: boolean;
30
+ // Whether the tangent points are strictly inside the bound box.
31
+ private isPlStrictInterior = true;
32
+ private readonly monicVar: number;
33
+ private readonly x: Factor;
34
+ private readonly y: Factor;
35
+ private readonly xVar: number;
36
+ private readonly yVar: number;
37
+ private readonly isMon: boolean;
38
+
39
+ constructor(
40
+ private core: NlaCore,
41
+ private xy: Point,
42
+ private value: Rational,
43
+ private monic: Monic,
44
+ factorization: Factorization,
45
+ ) {
46
+ this.correctValue = xy.x.mul(xy.y);
47
+ this.isBelow = value.compare(this.correctValue) < 0;
48
+ this.monicVar = monic.variable;
49
+ this.x = factorization.factors[0];
50
+ this.y = factorization.factors[1];
51
+ this.xVar = this.x.variable;
52
+ this.yVar = this.y.variable;
53
+ this.isMon = factorization.mon !== null;
54
+ }
55
+
56
+ run() {
57
+ this.getPoints();
58
+ this.generateLine1();
59
+ this.generateLine2();
60
+ this.generatePlane(this.a);
61
+ this.generatePlane(this.b);
62
+ }
63
+
64
+ private explain(lemma: LemmaBuilder) {
65
+ if (this.isMon) return;
66
+ lemma.explainMonic(this.monic);
67
+ lemma.explainFactor(this.x);
68
+ lemma.explainFactor(this.y);
69
+ }
70
+
71
+ private generatePlane(plane: Point) {
72
+ const core = this.core;
73
+ if (
74
+ core.throttle.insertSimplifiedTangent(
75
+ THROTTLE_TANGENT_LEMMA,
76
+ this.monicVar,
77
+ this.xVar,
78
+ this.yVar,
79
+ this.isBelow,
80
+ )
81
+ )
82
+ return;
83
+ const lemma = new LemmaBuilder(core);
84
+ core.negateRelation(lemma, this.xVar, getFactorSign(this.x).mul(plane.x));
85
+ core.negateRelation(lemma, this.yVar, getFactorSign(this.y).mul(plane.y));
86
+ const term = new LarTerm();
87
+ term.addMonomial(getFactorSign(this.y).mul(plane.x).neg(), this.yVar);
88
+ term.addMonomial(getFactorSign(this.x).mul(plane.y).neg(), this.xVar);
89
+ term.addMonomial(Rational.one, this.monicVar);
90
+ const cmp = this.isBelow
91
+ ? this.isPlStrictInterior
92
+ ? KIND_GT
93
+ : KIND_GE
94
+ : this.isPlStrictInterior
95
+ ? KIND_LT
96
+ : KIND_LE;
97
+ lemma.addIneq(mkIneq(term, cmp, plane.x.mul(plane.y).neg()));
98
+ this.explain(lemma);
99
+ }
100
+
101
+ private generateLine1() {
102
+ const core = this.core;
103
+ if (
104
+ core.throttle.insertTangent(
105
+ THROTTLE_TANGENT_LEMMA,
106
+ this.monicVar,
107
+ this.xVar,
108
+ this.yVar,
109
+ this.isBelow,
110
+ 1,
111
+ )
112
+ )
113
+ return;
114
+ const lemma = new LemmaBuilder(core);
115
+ lemma.addIneq(mkIneq(this.xVar, KIND_NE, core.val(this.xVar)));
116
+ lemma.addIneq(
117
+ mkIneq(
118
+ new LarTerm([
119
+ [this.monicVar, Rational.one],
120
+ [this.yVar, getFactorSign(this.y).mul(this.xy.x).neg()],
121
+ ]),
122
+ KIND_EQ,
123
+ 0,
124
+ ),
125
+ );
126
+ this.explain(lemma);
127
+ }
128
+
129
+ private generateLine2() {
130
+ const core = this.core;
131
+ if (
132
+ core.throttle.insertTangent(
133
+ THROTTLE_TANGENT_LEMMA,
134
+ this.monicVar,
135
+ this.xVar,
136
+ this.yVar,
137
+ this.isBelow,
138
+ 2,
139
+ )
140
+ )
141
+ return;
142
+ const lemma = new LemmaBuilder(core);
143
+ lemma.addIneq(mkIneq(this.yVar, KIND_NE, core.val(this.yVar)));
144
+ lemma.addIneq(
145
+ mkIneq(
146
+ new LarTerm([
147
+ [this.monicVar, Rational.one],
148
+ [this.xVar, getFactorSign(this.x).mul(this.xy.y).neg()],
149
+ ]),
150
+ KIND_EQ,
151
+ 0,
152
+ ),
153
+ );
154
+ this.explain(lemma);
155
+ }
156
+
157
+ // get_initial_points: two planes tangent to z = xy, at a and at b, that make a cut.
158
+ private getInitialPoints() {
159
+ const x = this.xy.x;
160
+ const y = this.xy.y;
161
+ const isAllInts = this.value.isInt() && x.isInt() && y.isInt();
162
+ const difference = this.correctValue.sub(this.value).abs();
163
+ const delta = isAllInts || Rational.one.compare(difference) <= 0 ? Rational.one : difference;
164
+ if (!this.isBelow) {
165
+ this.a = mkPoint(x.sub(delta), y.add(delta));
166
+ this.b = mkPoint(x.add(delta), y.sub(delta));
167
+ return;
168
+ }
169
+ this.a = mkPoint(x.sub(delta), y.sub(delta));
170
+ this.b = mkPoint(x.add(delta), y.add(delta));
171
+ }
172
+
173
+ // push_point: the point moved away from xy, doubling the distance, while the plane still cuts.
174
+ private pushPoint(point: Point) {
175
+ let result = point;
176
+ let difference = mkPoint(point.x.sub(this.xy.x), point.y.sub(this.xy.y));
177
+ for (let steps = 10; steps > 0 && !this.core.done(); steps--) {
178
+ difference = mkPoint(difference.x.mul(TWO), difference.y.mul(TWO));
179
+ const candidate = mkPoint(this.xy.x.add(difference.x), this.xy.y.add(difference.y));
180
+ if (!this.isPlaneCorrectCut(candidate)) return result;
181
+ result = candidate;
182
+ }
183
+ return result;
184
+ }
185
+
186
+ private getTangPlane(point: Point) {
187
+ return point.x.mul(this.xy.y).add(point.y.mul(this.xy.x)).sub(point.x.mul(point.y));
188
+ }
189
+
190
+ // set_box_corners: McCormick points at the corners of the factors' bound box.
191
+ private setBoxCorners() {
192
+ const core = this.core;
193
+ const xVar = this.xVar;
194
+ const yVar = this.yVar;
195
+ if (!core.hasLowerBound(xVar) || !core.hasUpperBound(xVar)) return false;
196
+ if (!core.hasLowerBound(yVar) || !core.hasUpperBound(yVar)) return false;
197
+ const xLow = core.getLowerBound(xVar);
198
+ const xHigh = core.getUpperBound(xVar);
199
+ const yLow = core.getLowerBound(yVar);
200
+ const yHigh = core.getUpperBound(yVar);
201
+ if (xLow.equals(xHigh) || yLow.equals(yHigh)) return false;
202
+ const xValue = core.val(xVar);
203
+ const yValue = core.val(yVar);
204
+ if ([xLow, xHigh].some((bound) => bound.equals(xValue))) return false;
205
+ if ([yLow, yHigh].some((bound) => bound.equals(yValue))) return false;
206
+ if (this.isBelow) {
207
+ this.a = mkPoint(xLow, yLow);
208
+ this.b = mkPoint(xHigh, yHigh);
209
+ } else {
210
+ this.a = mkPoint(xLow, yHigh);
211
+ this.b = mkPoint(xHigh, yLow);
212
+ }
213
+ this.isPlStrictInterior = false;
214
+ return true;
215
+ }
216
+
217
+ private getPoints() {
218
+ if (NLA_PARAMS.tangentsBoxCorners && this.setBoxCorners()) return;
219
+ this.getInitialPoints();
220
+ this.a = this.pushPoint(this.a);
221
+ this.b = this.pushPoint(this.b);
222
+ }
223
+
224
+ private isPlaneCorrectCut(plane: Point) {
225
+ const sign = this.isBelow ? Rational.one : Rational.minusOne;
226
+ const tangPlane = this.getTangPlane(plane);
227
+ return (
228
+ this.correctValue.sub(tangPlane).mul(sign).isPositive() &&
229
+ !tangPlane.sub(this.value).mul(sign).isNegative()
230
+ );
231
+ }
232
+ }
233
+
234
+ export class Tangents {
235
+ constructor(private core: NlaCore) {}
236
+
237
+ tangentLemma() {
238
+ const core = this.core;
239
+ if (!NLA_PARAMS.tangents) return;
240
+ const found = core.findBfcToRefine();
241
+ if (found === undefined) return;
242
+ const factors = found.factorization.factors;
243
+ new TangentImp(
244
+ core,
245
+ mkPoint(core.valFactor(factors[0]), core.valFactor(factors[1])),
246
+ core.val(found.monic.variable),
247
+ found.monic,
248
+ found.factorization,
249
+ ).run();
250
+ }
251
+ }
@@ -0,0 +1,85 @@
1
+ // Ported from Z3 (src/math/lp/nla_throttle.h, src/math/lp/nla_throttle.cpp), MIT license, see
2
+ // z3-license.txt. The signatures of the lemmas nla has generated in the current scope, so that a
3
+ // pass does not generate the same lemma twice.
4
+ import type { Rational } from "../rational";
5
+ import type { LarSolver } from "./lar-solver";
6
+ import type { LpStats } from "./lp-settings";
7
+
8
+ export const THROTTLE_ORDER_LEMMA = 0;
9
+ export const THROTTLE_BINOMIAL_SIGN_LEMMA = 1;
10
+ export const THROTTLE_MONOTONE_LEMMA = 2;
11
+ export const THROTTLE_TANGENT_LEMMA = 3;
12
+
13
+ const packRationalSign = (value: Rational) =>
14
+ value.isPositive() ? 1 : value.isNegative() ? 255 : 0;
15
+
16
+ const normalizeSign = (sign: number) => (sign + 127) >>> 0;
17
+
18
+ export class NlaThrottle {
19
+ private seen = new Set<string>();
20
+
21
+ constructor(
22
+ private lra: LarSolver,
23
+ private stats: LpStats,
24
+ ) {}
25
+
26
+ // insert_new: whether the signature, its 8 values padded with zeros, was seen, recording it when
27
+ // not.
28
+ private insertNew(values: number[]) {
29
+ const key = [...values, ...Array.from({ length: 8 - values.length }, () => 0)].join(",");
30
+ if (this.seen.has(key)) {
31
+ this.stats.nlaThrottledLemmas++;
32
+ return true;
33
+ }
34
+ this.seen.add(key);
35
+ this.lra.pushTrail(() => this.seen.delete(key));
36
+ return false;
37
+ }
38
+
39
+ insertMonotone(kind: number, monicVar: number, isLt: boolean) {
40
+ return this.insertNew([kind, monicVar, isLt ? 1 : 0]);
41
+ }
42
+
43
+ insertBinomialSign(kind: number, xyVar: number, x: number, y: number, sign: number, sy: number) {
44
+ return this.insertNew([kind, xyVar, x, y, normalizeSign(sign), normalizeSign(sy)]);
45
+ }
46
+
47
+ insertOrder(
48
+ kind: number,
49
+ acVar: number,
50
+ a: number,
51
+ cSign: Rational,
52
+ c: number,
53
+ bdVar: number,
54
+ bVar: number,
55
+ dSign: Rational,
56
+ d: number,
57
+ abCmp: number,
58
+ ) {
59
+ const last =
60
+ ((packRationalSign(dSign) << 24) | ((d & 0xffff) << 8) | ((abCmp >>> 0) & 0xff)) >>> 0;
61
+ return this.insertNew([kind, acVar, a, packRationalSign(cSign), c, bdVar, bVar, last]);
62
+ }
63
+
64
+ insertTangent(
65
+ kind: number,
66
+ monicVar: number,
67
+ xVar: number,
68
+ yVar: number,
69
+ isBelow: boolean,
70
+ planeType: number,
71
+ ) {
72
+ return this.insertNew([kind, monicVar, xVar, yVar, isBelow ? 1 : 0, planeType]);
73
+ }
74
+
75
+ // The simplified tangent signature, without the plane type.
76
+ insertSimplifiedTangent(
77
+ kind: number,
78
+ monicVar: number,
79
+ xVar: number,
80
+ yVar: number,
81
+ isBelow: boolean,
82
+ ) {
83
+ return this.insertNew([kind, monicVar, xVar, yVar, isBelow ? 1 : 0]);
84
+ }
85
+ }
@@ -0,0 +1,124 @@
1
+ // Ported from Z3 (src/math/lp/nla_types.h, src/math/lp/nla_defs.h, src/math/lp/nla_common.h, and
2
+ // lemma_builder of src/math/lp/nla_core.cpp), MIT license, see z3-license.txt. The inequalities and
3
+ // lemmas that the nla passes make, and the builder that adds a lemma to the core.
4
+ import { Rational } from "../rational";
5
+ import { KIND_EQ, KIND_GE, KIND_GT, KIND_LE, KIND_LT, KIND_NE } from "./constraints";
6
+ import { Explanation } from "./explanation";
7
+ import { LarTerm } from "./lar-term";
8
+ import type { NlaCore } from "./nla-core";
9
+ import type { Monic } from "./nla-emonics";
10
+ import type { Factor, Factorization } from "./nla-factorization";
11
+
12
+ export const negateKind = (kind: number) => {
13
+ switch (kind) {
14
+ case KIND_LE:
15
+ return KIND_GT;
16
+ case KIND_LT:
17
+ return KIND_GE;
18
+ case KIND_GE:
19
+ return KIND_LT;
20
+ case KIND_GT:
21
+ return KIND_LE;
22
+ case KIND_EQ:
23
+ return KIND_NE;
24
+ default:
25
+ return KIND_EQ;
26
+ }
27
+ };
28
+
29
+ export const getRatSign = (value: Rational) =>
30
+ value.isPositive() ? 1 : value.isNegative() ? -1 : 0;
31
+
32
+ export const signToRat = (isNegated: boolean) => (isNegated ? Rational.minusOne : Rational.one);
33
+
34
+ // An ineq: term cmp rs.
35
+ export interface Ineq {
36
+ readonly cmp: number;
37
+ readonly term: LarTerm;
38
+ readonly rs: Rational;
39
+ }
40
+
41
+ export const mkIneq = (term: LarTerm | number, cmp: number, rs: Rational | number): Ineq => ({
42
+ cmp,
43
+ term: typeof term === "number" ? new LarTerm([[term, Rational.one]]) : term,
44
+ rs: typeof rs === "number" ? Rational.fromNumber(rs) : rs,
45
+ });
46
+
47
+ // A lemma: its explanation implies one of its inequalities, or false when it has none.
48
+ export interface Lemma {
49
+ readonly ineqs: Ineq[];
50
+ readonly expl: Explanation;
51
+ }
52
+
53
+ export const isConflictLemma = (lemma: Lemma) => lemma.ineqs.length === 0 && !lemma.expl.isEmpty;
54
+
55
+ // lemma_builder: adds a lemma to the core and builds it in place.
56
+ export class LemmaBuilder {
57
+ private readonly lemma: Lemma = { ineqs: [], expl: new Explanation() };
58
+
59
+ constructor(private core: NlaCore) {
60
+ core.lemmas.push(this.lemma);
61
+ }
62
+
63
+ get expl() {
64
+ return this.lemma.expl;
65
+ }
66
+
67
+ // |=: an inequality, unless the bounds already explain its negation away.
68
+ addIneq(ineq: Ineq) {
69
+ if (!this.core.explainIneq(this, ineq.term, ineq.cmp, ineq.rs)) this.lemma.ineqs.push(ineq);
70
+ return this;
71
+ }
72
+
73
+ addExplanation(explanation: Explanation) {
74
+ this.lemma.expl.addExplanation(explanation);
75
+ return this;
76
+ }
77
+
78
+ // &= on a monic: the equivalences of its variables.
79
+ explainMonic(monic: Monic) {
80
+ for (const lpVar of monic.vars) this.explainVar(lpVar);
81
+ return this;
82
+ }
83
+
84
+ explainFactor(factor: Factor) {
85
+ if (factor.isMon) this.explainMonic(this.core.emons.get(factor.variable));
86
+ else this.explainVar(factor.variable);
87
+ return this;
88
+ }
89
+
90
+ explainFactorization(factorization: Factorization) {
91
+ if (factorization.mon !== null) return this;
92
+ for (const factor of factorization.factors) this.explainFactor(factor);
93
+ return this;
94
+ }
95
+
96
+ explainVar(lpVar: number) {
97
+ this.core.varEqs.explainVar(lpVar, this.lemma.expl);
98
+ return this;
99
+ }
100
+
101
+ explainFixed(lpVar: number) {
102
+ this.explainExistingLowerBound(lpVar);
103
+ this.explainExistingUpperBound(lpVar);
104
+ return this;
105
+ }
106
+
107
+ explainVarSeparatedFromZero(lpVar: number) {
108
+ if (this.core.varHasNegativeUpperBound(lpVar)) this.explainExistingUpperBound(lpVar);
109
+ else this.explainExistingLowerBound(lpVar);
110
+ return this;
111
+ }
112
+
113
+ explainExistingLowerBound(lpVar: number) {
114
+ const explanation = new Explanation();
115
+ explanation.pushDependency(this.core.lra.getLowerWitness(lpVar));
116
+ return this.addExplanation(explanation);
117
+ }
118
+
119
+ explainExistingUpperBound(lpVar: number) {
120
+ const explanation = new Explanation();
121
+ explanation.pushDependency(this.core.lra.getUpperWitness(lpVar));
122
+ return this.addExplanation(explanation);
123
+ }
124
+ }
@@ -0,0 +1,141 @@
1
+ // Ported from Z3 (src/math/lp/var_eqs.h, src/math/lp/nla_defs.h), MIT license, see z3-license.txt.
2
+ // Equivalences between signed lp variables, x = y or x = -y, with the bounds that justify them. A
3
+ // signed variable is the index 2 * var + sign.
4
+ import { Dependency } from "./dependency";
5
+ import type { Explanation } from "./explanation";
6
+ import { TrailStack, UnionFind, UnionFindHandler } from "./union-find";
7
+ import { shrink } from "../array";
8
+
9
+ export const mkSignedVar = (lpVar: number, isNegated: boolean) => lpVar * 2 + (isNegated ? 1 : 0);
10
+ export const getSignedVarVar = (signedVar: number) => signedVar >> 1;
11
+ export const isSignedVarNegated = (signedVar: number) => (signedVar & 1) === 1;
12
+ export const negateSignedVar = (signedVar: number) => signedVar ^ 1;
13
+
14
+ // An eq_justification: its dependencies up to the first null.
15
+ type EqJustification = Dependency[];
16
+
17
+ interface EqEdge {
18
+ readonly signedVar: number;
19
+ readonly justification: EqJustification;
20
+ }
21
+
22
+ interface VarFrame {
23
+ readonly signedVar: number;
24
+ readonly index: number;
25
+ }
26
+
27
+ export class VarEqs {
28
+ readonly trail = new TrailStack();
29
+ private eqTrail: [number, number][] = [];
30
+ private eqTrailScopes: number[] = [];
31
+ private eqs: EqEdge[][] = [];
32
+ private isMarked: boolean[] = [];
33
+
34
+ private unionFind = new UnionFind(this.trail);
35
+
36
+ setMergeHandler(handler: UnionFindHandler) {
37
+ this.unionFind.handler = handler;
38
+ }
39
+
40
+ push() {
41
+ this.eqTrailScopes.push(this.eqTrail.length);
42
+ this.trail.pushScope();
43
+ }
44
+
45
+ pop(count: number) {
46
+ const size = this.eqTrailScopes[this.eqTrailScopes.length - count];
47
+ for (let index = this.eqTrail.length; index-- > size;) {
48
+ const pair = this.eqTrail[index];
49
+ this.eqs[pair[0]].pop();
50
+ this.eqs[pair[1]].pop();
51
+ this.eqs[negateSignedVar(pair[0])].pop();
52
+ this.eqs[negateSignedVar(pair[1])].pop();
53
+ }
54
+ shrink(this.eqTrail, size);
55
+ shrink(this.eqTrailScopes, this.eqTrailScopes.length - count);
56
+ this.trail.popScope(count);
57
+ }
58
+
59
+ merge(v1: number, v2: number, justification: EqJustification) {
60
+ if (v1 === v2 || getSignedVarVar(this.find(v1)) === getSignedVarVar(this.find(v2))) return;
61
+ const maxIndex = Math.max(v1, v2) + 2;
62
+ while (this.eqs.length < maxIndex) this.eqs.push([]);
63
+ while (this.unionFind.numVars <= maxIndex) this.unionFind.mkVar();
64
+ this.eqTrail.push([v1, v2]);
65
+ this.unionFind.merge(v1, v2);
66
+ this.unionFind.merge(negateSignedVar(v1), negateSignedVar(v2));
67
+ this.eqs[v1].push({ signedVar: v2, justification });
68
+ this.eqs[v2].push({ signedVar: v1, justification });
69
+ this.eqs[negateSignedVar(v1)].push({ signedVar: negateSignedVar(v2), justification });
70
+ this.eqs[negateSignedVar(v2)].push({ signedVar: negateSignedVar(v1), justification });
71
+ }
72
+
73
+ mergePlus(first: number, second: number, justification: EqJustification) {
74
+ this.merge(mkSignedVar(first, false), mkSignedVar(second, false), justification);
75
+ }
76
+
77
+ mergeMinus(first: number, second: number, justification: EqJustification) {
78
+ this.merge(mkSignedVar(first, false), mkSignedVar(second, true), justification);
79
+ }
80
+
81
+ find(signedVar: number) {
82
+ return signedVar >= this.unionFind.numVars ? signedVar : this.unionFind.find(signedVar);
83
+ }
84
+
85
+ findVar(lpVar: number) {
86
+ return this.find(mkSignedVar(lpVar, false));
87
+ }
88
+
89
+ isRoot(lpVar: number) {
90
+ return getSignedVarVar(this.findVar(lpVar)) === lpVar;
91
+ }
92
+
93
+ // explain_bfs: the justifications along a shortest path from v1 to v2.
94
+ explain(v1: number, v2: number, explanation: Explanation) {
95
+ if (v1 === v2) return;
96
+ const todo: VarFrame[] = [{ signedVar: v1, index: 0 }];
97
+ const justifications: EqJustification[] = [[]];
98
+ const markedTrail = [v1];
99
+ this.isMarked[v1] = true;
100
+ let head = 0;
101
+ for (; ; head++) {
102
+ const frame = todo[head];
103
+ if (frame.signedVar === v2) break;
104
+ const next = this.eqs[frame.signedVar];
105
+ for (let index = next.length; index-- > 0;) {
106
+ const edge = next[index];
107
+ if (this.isMarked[edge.signedVar]) continue;
108
+ todo.push({ signedVar: edge.signedVar, index: head });
109
+ justifications.push(edge.justification);
110
+ markedTrail.push(edge.signedVar);
111
+ this.isMarked[edge.signedVar] = true;
112
+ }
113
+ }
114
+ while (head !== 0) {
115
+ for (const dep of justifications[head]) {
116
+ if (dep === null) break;
117
+ explanation.pushDependency(dep);
118
+ }
119
+ head = todo[head].index;
120
+ }
121
+ for (const signedVar of markedTrail) this.isMarked[signedVar] = false;
122
+ }
123
+
124
+ explainVar(lpVar: number, explanation: Explanation) {
125
+ const signedVar = mkSignedVar(lpVar, false);
126
+ this.explain(this.find(signedVar), signedVar, explanation);
127
+ }
128
+
129
+ // The members of the class of a signed variable, from the variable around the union-find cycle.
130
+ *getClass(signedVar: number) {
131
+ if (signedVar >= this.unionFind.numVars) {
132
+ yield signedVar;
133
+ return;
134
+ }
135
+ let current = signedVar;
136
+ do {
137
+ yield current;
138
+ current = this.unionFind.next(current);
139
+ } while (current !== signedVar);
140
+ }
141
+ }