tla-ts 0.0.10-dev.63a6693bd → 0.0.10-dev.6b2a6741a

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 (551) hide show
  1. package/README.md +2 -1
  2. package/dist/compile.cjs +3 -3
  3. package/dist/compile.js +1 -1
  4. package/dist/deciders.cjs +41 -37
  5. package/dist/deciders.js +45 -41
  6. package/dist/index.cjs +1 -1
  7. package/dist/index.d.cts +5 -1
  8. package/dist/index.d.ts +5 -1
  9. package/dist/index.js +1 -1
  10. package/dist/parallel-worker.cjs +1 -1
  11. package/dist/parallel-worker.js +1 -1
  12. package/dist/prove-worker.cjs +1 -1
  13. package/dist/prove-worker.js +1 -1
  14. package/dist/prove.cjs +2682 -426
  15. package/dist/prove.js +2679 -423
  16. package/dist/run.cjs +43 -42
  17. package/dist/run.js +44 -43
  18. package/dist/tlapm.cjs +1 -1
  19. package/dist/tlapm.js +1 -1
  20. package/dist/transfer.cjs +43 -40
  21. package/dist/transfer.js +43 -40
  22. package/dist/worker.cjs +7 -7
  23. package/dist/worker.js +7 -7
  24. package/package.json +1 -1
  25. package/src/ast.ts +4 -3
  26. package/src/bags.ts +46 -28
  27. package/src/check-trace.ts +2 -16
  28. package/src/check.ts +349 -91
  29. package/src/cli/runtime-invariants.ts +20 -56
  30. package/src/cli/tlapm.ts +424 -62
  31. package/src/cli/tlc-arguments.ts +2 -2
  32. package/src/cli/tlc-output.ts +4 -5
  33. package/src/cli/tlc-usage.ts +0 -1
  34. package/src/cli/tlc.ts +26 -7
  35. package/src/cli/xml-exporter.ts +1 -1
  36. package/src/codegen.ts +9 -5
  37. package/src/dependencies.ts +72 -11
  38. package/src/dfid.ts +9 -2
  39. package/src/environment.ts +65 -36
  40. package/src/errors.ts +38 -3
  41. package/src/evaluate.ts +92 -32
  42. package/src/exit-codes.ts +5 -2
  43. package/src/instances.ts +5 -5
  44. package/src/java-overrides.ts +2 -2
  45. package/src/levels.ts +138 -90
  46. package/src/lexer.ts +5 -3
  47. package/src/liveness-checker.ts +572 -204
  48. package/src/liveness.ts +47 -32
  49. package/src/obligations/action.ts +10 -6
  50. package/src/obligations/anonymize.ts +33 -14
  51. package/src/obligations/enabled-axioms.ts +218 -0
  52. package/src/obligations/equality.ts +1 -3
  53. package/src/obligations/expression.ts +18 -6
  54. package/src/obligations/format.ts +0 -2
  55. package/src/obligations/generate.ts +22 -17
  56. package/src/obligations/index.ts +37 -7
  57. package/src/obligations/levels.ts +24 -11
  58. package/src/obligations/module.ts +1 -3
  59. package/src/obligations/normalize.ts +25 -17
  60. package/src/obligations/operators.ts +0 -2
  61. package/src/obligations/pragma.ts +53 -16
  62. package/src/obligations/printer.ts +48 -18
  63. package/src/obligations/proof.ts +3 -2
  64. package/src/obligations/regroup.ts +0 -2
  65. package/src/obligations/simplify.ts +17 -7
  66. package/src/obligations/source.ts +71 -17
  67. package/src/obligations/subexpression.ts +45 -18
  68. package/src/obligations/substitution.ts +1 -3
  69. package/src/obligations/temporal.ts +0 -2
  70. package/src/obligations/tuples.ts +0 -2
  71. package/src/parallel-worker.ts +8 -2
  72. package/src/parallel.ts +7 -2
  73. package/src/parser.ts +664 -287
  74. package/src/pretty-print.ts +1 -1
  75. package/src/prover/deciders.ts +11 -8
  76. package/src/prover/isabelle/decide.ts +3 -25
  77. package/src/prover/isabelle/encode.ts +71 -41
  78. package/src/prover/isabelle/isar/attrib.ts +250 -0
  79. package/src/prover/isabelle/isar/context.ts +335 -0
  80. package/src/prover/isabelle/isar/induct.ts +382 -0
  81. package/src/prover/isabelle/isar/inner-syntax.ts +149 -3
  82. package/src/prover/isabelle/isar/method.ts +506 -198
  83. package/src/prover/isabelle/isar/proof.ts +570 -14
  84. package/src/prover/isabelle/isar/rule-cases.ts +226 -0
  85. package/src/prover/isabelle/isar/theory.ts +479 -69
  86. package/src/prover/isabelle/isar/toplevel.ts +331 -0
  87. package/src/prover/isabelle/isar/type-check.ts +83 -8
  88. package/src/prover/isabelle/provers/blast/blast.ts +0 -2
  89. package/src/prover/isabelle/provers/blast/branch.ts +0 -2
  90. package/src/prover/isabelle/provers/blast/prove.ts +0 -2
  91. package/src/prover/isabelle/provers/blast/rules.ts +0 -2
  92. package/src/prover/isabelle/provers/blast/state.ts +0 -2
  93. package/src/prover/isabelle/provers/blast/term.ts +0 -2
  94. package/src/prover/isabelle/provers/clasimp.ts +1 -3
  95. package/src/prover/isabelle/provers/classical.ts +45 -20
  96. package/src/prover/isabelle/provers/hypsubst.ts +2 -4
  97. package/src/prover/isabelle/pure/bicompose.ts +0 -2
  98. package/src/prover/isabelle/pure/consts.ts +0 -2
  99. package/src/prover/isabelle/pure/conv.ts +0 -2
  100. package/src/prover/isabelle/pure/drule.ts +63 -4
  101. package/src/prover/isabelle/pure/envir.ts +0 -2
  102. package/src/prover/isabelle/pure/goal.ts +1 -3
  103. package/src/prover/isabelle/pure/logic.ts +0 -2
  104. package/src/prover/isabelle/pure/name.ts +0 -2
  105. package/src/prover/isabelle/pure/net.ts +0 -2
  106. package/src/prover/isabelle/pure/object-logic.ts +13 -7
  107. package/src/prover/isabelle/pure/pattern.ts +0 -2
  108. package/src/prover/isabelle/pure/raw-simplifier.ts +0 -2
  109. package/src/prover/isabelle/pure/rewriter.ts +4 -11
  110. package/src/prover/isabelle/pure/search.ts +0 -2
  111. package/src/prover/isabelle/pure/seq.ts +0 -2
  112. package/src/prover/isabelle/pure/simplifier.ts +26 -7
  113. package/src/prover/isabelle/pure/table.ts +0 -2
  114. package/src/prover/isabelle/pure/tactic.ts +0 -2
  115. package/src/prover/isabelle/pure/tactical.ts +0 -2
  116. package/src/prover/isabelle/pure/term-ord.ts +0 -2
  117. package/src/prover/isabelle/pure/term.ts +3 -5
  118. package/src/prover/isabelle/pure/thm.ts +0 -2
  119. package/src/prover/isabelle/pure/type.ts +0 -2
  120. package/src/prover/isabelle/pure/unify.ts +0 -2
  121. package/src/prover/isabelle/pure/variable.ts +0 -2
  122. package/src/prover/isabelle/tla/classical-setup.ts +1 -2
  123. package/src/prover/isabelle/tla/context.ts +51 -9
  124. package/src/prover/isabelle/tla/logic-data.ts +1 -1
  125. package/src/prover/isabelle/tla/logic.ts +40 -1
  126. package/src/prover/isabelle/tla/simpdata.ts +0 -2
  127. package/src/prover/isabelle/tools/intuitionistic.ts +28 -12
  128. package/src/prover/ocaml.ts +4 -1
  129. package/src/prover/prep/action.ts +19 -12
  130. package/src/prover/prep/enabled-axioms.ts +11 -2
  131. package/src/prover/prep/md5.ts +26 -29
  132. package/src/prover/prep/methods.ts +159 -50
  133. package/src/prover/prep/normalize.ts +38 -9
  134. package/src/prover/prove.ts +343 -65
  135. package/src/prover/ptl/decide.ts +95 -50
  136. package/src/prover/ptl/encode.ts +2 -3
  137. package/src/prover/ptl/tableau.ts +28 -2
  138. package/src/prover/smt/arithmetic.ts +310 -0
  139. package/src/prover/smt/axioms.ts +12 -8
  140. package/src/prover/smt/context.ts +42 -6
  141. package/src/prover/smt/data.ts +191 -84
  142. package/src/prover/smt/encode.ts +122 -43
  143. package/src/prover/smt/extensionality.ts +5 -3
  144. package/src/prover/smt/flatten.ts +4 -6
  145. package/src/prover/smt/format.ts +28 -4
  146. package/src/prover/smt/instances.ts +7 -1
  147. package/src/prover/smt/layout.ts +91 -0
  148. package/src/prover/smt/rewrite.ts +483 -116
  149. package/src/prover/smt/simplify.ts +441 -0
  150. package/src/prover/smt/solver/ackermannize-bv-tactic.ts +61 -0
  151. package/src/prover/smt/solver/ackr-helper.ts +179 -0
  152. package/src/prover/smt/solver/ackr-model-converter.ts +105 -0
  153. package/src/prover/smt/solver/act-cache.ts +0 -1
  154. package/src/prover/smt/solver/add-bounds-tactic.ts +59 -0
  155. package/src/prover/smt/solver/aig-tactic.ts +52 -0
  156. package/src/prover/smt/solver/aig.ts +889 -0
  157. package/src/prover/smt/solver/arith-rewriter.ts +613 -6
  158. package/src/prover/smt/solver/arith-terms.ts +121 -0
  159. package/src/prover/smt/solver/array-decl-plugin.ts +175 -0
  160. package/src/prover/smt/solver/array-rewriter.ts +309 -0
  161. package/src/prover/smt/solver/asserted-formulas.ts +93 -15
  162. package/src/prover/smt/solver/ast-lt.ts +165 -11
  163. package/src/prover/smt/solver/ast-util.ts +160 -2
  164. package/src/prover/smt/solver/ast.ts +1449 -41
  165. package/src/prover/smt/solver/auf-solver.ts +0 -1
  166. package/src/prover/smt/solver/bit-blast-tactic.ts +582 -0
  167. package/src/prover/smt/solver/bit-blaster.ts +871 -0
  168. package/src/prover/smt/solver/bound-manager.ts +196 -0
  169. package/src/prover/smt/solver/bound-simplifier.ts +600 -0
  170. package/src/prover/smt/solver/bv-bound-chk.ts +492 -0
  171. package/src/prover/smt/solver/bv-decl-plugin.ts +341 -0
  172. package/src/prover/smt/solver/bv-divrem-bounds.ts +95 -0
  173. package/src/prover/smt/solver/bv-rewriter.ts +1901 -0
  174. package/src/prover/smt/solver/bv1-blast.ts +214 -0
  175. package/src/prover/smt/solver/bv2fpa-converter.ts +174 -0
  176. package/src/prover/smt/solver/bv2int-rewriter.ts +544 -0
  177. package/src/prover/smt/solver/bv2real-rewriter.ts +533 -0
  178. package/src/prover/smt/solver/card2bv.ts +109 -0
  179. package/src/prover/smt/solver/case-split-queue.ts +0 -2
  180. package/src/prover/smt/solver/cg-table.ts +39 -25
  181. package/src/prover/smt/solver/check-logic.ts +330 -0
  182. package/src/prover/smt/solver/clause.ts +0 -1
  183. package/src/prover/smt/solver/cofactor-elim-term-ite.ts +278 -0
  184. package/src/prover/smt/solver/conflict-resolution.ts +78 -2
  185. package/src/prover/smt/solver/context.ts +533 -114
  186. package/src/prover/smt/solver/ctx-simplify.ts +21 -12
  187. package/src/prover/smt/solver/ctx-solver-simplify.ts +122 -0
  188. package/src/prover/smt/solver/datatype-decl-plugin.ts +572 -0
  189. package/src/prover/smt/solver/datatype-rewriter.ts +82 -0
  190. package/src/prover/smt/solver/demodulator.ts +786 -0
  191. package/src/prover/smt/solver/dependent-expr-state.ts +81 -0
  192. package/src/prover/smt/solver/der.ts +38 -10
  193. package/src/prover/smt/solver/diff-neq.ts +205 -0
  194. package/src/prover/smt/solver/distribute-forall.ts +57 -0
  195. package/src/prover/smt/solver/dom-simplify.ts +511 -0
  196. package/src/prover/smt/solver/dt2bv-tactic.ts +260 -0
  197. package/src/prover/smt/solver/dyn-ack.ts +0 -1
  198. package/src/prover/smt/solver/e-matching.ts +6 -7
  199. package/src/prover/smt/solver/elim-small-bv-tactic.ts +129 -0
  200. package/src/prover/smt/solver/elim-uncnstr.ts +542 -0
  201. package/src/prover/smt/solver/enode.ts +100 -3
  202. package/src/prover/smt/solver/eq2bv-tactic.ts +218 -0
  203. package/src/prover/smt/solver/euf/arith-axioms.ts +403 -0
  204. package/src/prover/smt/solver/euf/arith-internalize.ts +653 -0
  205. package/src/prover/smt/solver/euf/arith-solver.ts +889 -0
  206. package/src/prover/smt/solver/euf/array-axioms.ts +527 -0
  207. package/src/prover/smt/solver/euf/array-internalize.ts +428 -0
  208. package/src/prover/smt/solver/euf/array-solver.ts +306 -0
  209. package/src/prover/smt/solver/euf/bv-ackerman.ts +162 -0
  210. package/src/prover/smt/solver/euf/bv-internalize.ts +748 -0
  211. package/src/prover/smt/solver/euf/bv-solver.ts +449 -0
  212. package/src/prover/smt/solver/euf/dt-solver.ts +618 -0
  213. package/src/prover/smt/solver/euf/egraph.ts +901 -0
  214. package/src/prover/smt/solver/euf/euf-solver.ts +1204 -0
  215. package/src/prover/smt/solver/euf/fpa-solver.ts +317 -0
  216. package/src/prover/smt/solver/euf/mam.ts +1046 -0
  217. package/src/prover/smt/solver/euf/q-ematch.ts +829 -0
  218. package/src/prover/smt/solver/euf/q-mbi.ts +587 -0
  219. package/src/prover/smt/solver/euf/q-model-fixer.ts +296 -0
  220. package/src/prover/smt/solver/euf/q-solver.ts +361 -0
  221. package/src/prover/smt/solver/euf/th-solver.ts +328 -0
  222. package/src/prover/smt/solver/euf/th-solvers.ts +30 -0
  223. package/src/prover/smt/solver/expr-ref.ts +0 -1
  224. package/src/prover/smt/solver/expr-safe-replace.ts +26 -2
  225. package/src/prover/smt/solver/expr2polynomial.ts +271 -0
  226. package/src/prover/smt/solver/factor.ts +163 -0
  227. package/src/prover/smt/solver/fd-solver.ts +267 -0
  228. package/src/prover/smt/solver/fingerprints.ts +15 -15
  229. package/src/prover/smt/solver/fix-dl-var.ts +147 -0
  230. package/src/prover/smt/solver/flat-literals.ts +0 -1
  231. package/src/prover/smt/solver/fm-tactic.ts +884 -0
  232. package/src/prover/smt/solver/fpa-decl-plugin.ts +618 -0
  233. package/src/prover/smt/solver/fpa-rewriter.ts +639 -0
  234. package/src/prover/smt/solver/fpa2bv-converter.ts +2251 -0
  235. package/src/prover/smt/solver/fpa2bv-rewriter.ts +349 -0
  236. package/src/prover/smt/solver/fpa2bv-tactic.ts +73 -0
  237. package/src/prover/smt/solver/goal.ts +177 -15
  238. package/src/prover/smt/solver/goal2nlsat.ts +216 -0
  239. package/src/prover/smt/solver/guard-set.ts +219 -0
  240. package/src/prover/smt/solver/hash.ts +0 -1
  241. package/src/prover/smt/solver/hashtable.ts +30 -16
  242. package/src/prover/smt/solver/inf-eps.ts +63 -0
  243. package/src/prover/smt/solver/inj-axiom.ts +101 -0
  244. package/src/prover/smt/solver/internalizer.ts +109 -36
  245. package/src/prover/smt/solver/lackr.ts +381 -0
  246. package/src/prover/smt/solver/lbool.ts +0 -1
  247. package/src/prover/smt/solver/lia2card.ts +268 -0
  248. package/src/prover/smt/solver/lia2pb.ts +154 -0
  249. package/src/prover/smt/solver/literal.ts +0 -1
  250. package/src/prover/smt/solver/logic-tactics.ts +345 -0
  251. package/src/prover/smt/solver/lp/bound-propagator.ts +0 -1
  252. package/src/prover/smt/solver/lp/constraints.ts +0 -1
  253. package/src/prover/smt/solver/lp/containers.ts +7 -2
  254. package/src/prover/smt/solver/lp/core-solver.ts +18 -3
  255. package/src/prover/smt/solver/lp/cross-nested.ts +1 -4
  256. package/src/prover/smt/solver/lp/dep-intervals.ts +0 -3
  257. package/src/prover/smt/solver/lp/dependency.ts +0 -2
  258. package/src/prover/smt/solver/lp/dioph-eq.ts +0 -2
  259. package/src/prover/smt/solver/lp/explanation.ts +0 -1
  260. package/src/prover/smt/solver/lp/gomory.ts +0 -1
  261. package/src/prover/smt/solver/lp/hnf-cutter.ts +0 -1
  262. package/src/prover/smt/solver/lp/hnf.ts +0 -3
  263. package/src/prover/smt/solver/lp/int-cube.ts +3 -4
  264. package/src/prover/smt/solver/lp/int-solver.ts +0 -2
  265. package/src/prover/smt/solver/lp/lar-solver.ts +40 -4
  266. package/src/prover/smt/solver/lp/lar-term.ts +0 -1
  267. package/src/prover/smt/solver/lp/lp-settings.ts +0 -1
  268. package/src/prover/smt/solver/lp/maximize-term.ts +59 -10
  269. package/src/prover/smt/solver/lp/nex-creator.ts +3 -3
  270. package/src/prover/smt/solver/lp/nex.ts +2 -2
  271. package/src/prover/smt/solver/lp/nla-backoff.ts +0 -2
  272. package/src/prover/smt/solver/lp/nla-basics.ts +46 -3
  273. package/src/prover/smt/solver/lp/nla-core.ts +66 -11
  274. package/src/prover/smt/solver/lp/nla-divisions.ts +0 -2
  275. package/src/prover/smt/solver/lp/nla-emonics.ts +0 -1
  276. package/src/prover/smt/solver/lp/nla-factorization.ts +0 -1
  277. package/src/prover/smt/solver/lp/nla-grobner.ts +167 -85
  278. package/src/prover/smt/solver/lp/nla-horner.ts +0 -2
  279. package/src/prover/smt/solver/lp/nla-intervals.ts +0 -1
  280. package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +0 -2
  281. package/src/prover/smt/solver/lp/nla-monotone.ts +0 -1
  282. package/src/prover/smt/solver/lp/nla-order.ts +0 -2
  283. package/src/prover/smt/solver/lp/nla-patcher.ts +0 -1
  284. package/src/prover/smt/solver/lp/nla-powers.ts +220 -0
  285. package/src/prover/smt/solver/lp/nla-tangents.ts +0 -2
  286. package/src/prover/smt/solver/lp/nla-throttle.ts +0 -1
  287. package/src/prover/smt/solver/lp/nla-transcendentals.ts +324 -0
  288. package/src/prover/smt/solver/lp/nla-types.ts +0 -2
  289. package/src/prover/smt/solver/lp/nla-var-eqs.ts +0 -1
  290. package/src/prover/smt/solver/lp/nra-solver.ts +163 -99
  291. package/src/prover/smt/solver/lp/numeric-pair.ts +0 -1
  292. package/src/prover/smt/solver/lp/pdd-interval.ts +6 -3
  293. package/src/prover/smt/solver/lp/pdd-simplifier.ts +60 -21
  294. package/src/prover/smt/solver/lp/pdd-solver.ts +72 -41
  295. package/src/prover/smt/solver/lp/pdd.ts +725 -290
  296. package/src/prover/smt/solver/lp/random-updater.ts +0 -2
  297. package/src/prover/smt/solver/lp/static-matrix.ts +0 -1
  298. package/src/prover/smt/solver/lp/union-find.ts +7 -2
  299. package/src/prover/smt/solver/macro-finder.ts +530 -0
  300. package/src/prover/smt/solver/mam-compiler.ts +118 -88
  301. package/src/prover/smt/solver/mam-interpreter.ts +0 -1
  302. package/src/prover/smt/solver/max-bv-sharing-tactic.ts +17 -0
  303. package/src/prover/smt/solver/max-cliques.ts +105 -0
  304. package/src/prover/smt/solver/maxcore.ts +309 -0
  305. package/src/prover/smt/solver/maximize-ac-sharing.ts +8 -6
  306. package/src/prover/smt/solver/maxlex.ts +115 -0
  307. package/src/prover/smt/solver/maxsmt-base.ts +105 -0
  308. package/src/prover/smt/solver/maxsmt.ts +92 -0
  309. package/src/prover/smt/solver/mbp/mbp-arith.ts +467 -0
  310. package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +101 -0
  311. package/src/prover/smt/solver/mbp/mbp-plugin.ts +287 -0
  312. package/src/prover/smt/solver/mbp/mbp-qel.ts +48 -0
  313. package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +271 -0
  314. package/src/prover/smt/solver/mbp/mbp-term-graph.ts +606 -0
  315. package/src/prover/smt/solver/model-based-opt.ts +844 -0
  316. package/src/prover/smt/solver/model-checker.ts +17 -26
  317. package/src/prover/smt/solver/model-evaluator.ts +188 -12
  318. package/src/prover/smt/solver/model-finder.ts +0 -1
  319. package/src/prover/smt/solver/model-generator.ts +59 -30
  320. package/src/prover/smt/solver/model-macro-solver.ts +38 -27
  321. package/src/prover/smt/solver/model-printer.ts +214 -0
  322. package/src/prover/smt/solver/mpf.ts +709 -0
  323. package/src/prover/smt/solver/mus.ts +50 -0
  324. package/src/prover/smt/solver/muz/dl-context.ts +410 -0
  325. package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +97 -0
  326. package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +167 -0
  327. package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +125 -0
  328. package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +299 -0
  329. package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +455 -0
  330. package/src/prover/smt/solver/muz/dl-mk-slice.ts +340 -0
  331. package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +163 -0
  332. package/src/prover/smt/solver/muz/dl-rule-set.ts +273 -0
  333. package/src/prover/smt/solver/muz/dl-rule-transformer.ts +123 -0
  334. package/src/prover/smt/solver/muz/dl-rule.ts +496 -0
  335. package/src/prover/smt/solver/muz/hnf.ts +201 -0
  336. package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +176 -0
  337. package/src/prover/smt/solver/muz/horn-tactic.ts +201 -0
  338. package/src/prover/smt/solver/muz/rule-properties.ts +337 -0
  339. package/src/prover/smt/solver/muz/spacer-context.ts +1404 -0
  340. package/src/prover/smt/solver/muz/spacer-dl-interface.ts +52 -0
  341. package/src/prover/smt/solver/muz/spacer-generalizers.ts +241 -0
  342. package/src/prover/smt/solver/muz/spacer-manager.ts +127 -0
  343. package/src/prover/smt/solver/muz/spacer-pdr.ts +219 -0
  344. package/src/prover/smt/solver/muz/spacer-prop-solver.ts +333 -0
  345. package/src/prover/smt/solver/muz/spacer-util.ts +282 -0
  346. package/src/prover/smt/solver/muz/substitution.ts +203 -0
  347. package/src/prover/smt/solver/nla2bv-tactic.ts +285 -0
  348. package/src/prover/smt/solver/nlqsat.ts +484 -0
  349. package/src/prover/smt/solver/nlsat/algebraic.ts +305 -88
  350. package/src/prover/smt/solver/nlsat/atoms.ts +52 -35
  351. package/src/prover/smt/solver/nlsat/evaluator.ts +0 -1
  352. package/src/prover/smt/solver/nlsat/explain.ts +424 -211
  353. package/src/prover/smt/solver/nlsat/interval-set.ts +1 -2
  354. package/src/prover/smt/solver/nlsat/levelwise.ts +460 -241
  355. package/src/prover/smt/solver/nlsat/mpbq.ts +45 -1
  356. package/src/prover/smt/solver/nlsat/polynomial.ts +2366 -683
  357. package/src/prover/smt/solver/nlsat/solver.ts +282 -69
  358. package/src/prover/smt/solver/nlsat/transcendental-eval.ts +310 -0
  359. package/src/prover/smt/solver/nlsat/transcendentals.ts +391 -0
  360. package/src/prover/smt/solver/nlsat/types.ts +0 -2
  361. package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +8 -7
  362. package/src/prover/smt/solver/nlsat/upolynomial.ts +41 -20
  363. package/src/prover/smt/solver/nlsat-tactic.ts +82 -0
  364. package/src/prover/smt/solver/nnf.ts +105 -23
  365. package/src/prover/smt/solver/normalize-bounds.ts +53 -0
  366. package/src/prover/smt/solver/occf.ts +97 -0
  367. package/src/prover/smt/solver/opt-context.ts +792 -0
  368. package/src/prover/smt/solver/opt-nlsat.ts +386 -0
  369. package/src/prover/smt/solver/opt-pareto.ts +282 -0
  370. package/src/prover/smt/solver/opt-preprocess.ts +101 -0
  371. package/src/prover/smt/solver/opt-solver.ts +311 -0
  372. package/src/prover/smt/solver/opt-value.ts +55 -0
  373. package/src/prover/smt/solver/optsmt.ts +692 -0
  374. package/src/prover/smt/solver/parallel-tactic.ts +299 -0
  375. package/src/prover/smt/solver/pattern-inference.ts +19 -11
  376. package/src/prover/smt/solver/pb-rewriter.ts +281 -0
  377. package/src/prover/smt/solver/pb2bv-tactic.ts +540 -0
  378. package/src/prover/smt/solver/poly-rewriter.ts +202 -57
  379. package/src/prover/smt/solver/probes.ts +511 -0
  380. package/src/prover/smt/solver/propagate-values.ts +37 -21
  381. package/src/prover/smt/solver/proto-model.ts +650 -17
  382. package/src/prover/smt/solver/pull-quant.ts +28 -12
  383. package/src/prover/smt/solver/purify-arith.ts +632 -0
  384. package/src/prover/smt/solver/qe-arith-plugin.ts +1096 -0
  385. package/src/prover/smt/solver/qe-lite-der.ts +2 -3
  386. package/src/prover/smt/solver/qe-lite-fm.ts +3 -4
  387. package/src/prover/smt/solver/qe-lite.ts +37 -17
  388. package/src/prover/smt/solver/qe-mbp.ts +270 -0
  389. package/src/prover/smt/solver/qe.ts +1499 -0
  390. package/src/prover/smt/solver/qel.ts +25 -0
  391. package/src/prover/smt/solver/qi-queue.ts +0 -1
  392. package/src/prover/smt/solver/qsat.ts +814 -0
  393. package/src/prover/smt/solver/quant-hoist.ts +196 -0
  394. package/src/prover/smt/solver/quant-tactics.ts +16 -56
  395. package/src/prover/smt/solver/quantifier-analyzer.ts +9 -10
  396. package/src/prover/smt/solver/quantifier-manager.ts +25 -24
  397. package/src/prover/smt/solver/quasi-macros.ts +243 -0
  398. package/src/prover/smt/solver/random-gen.ts +0 -1
  399. package/src/prover/smt/solver/rational.ts +45 -1
  400. package/src/prover/smt/solver/recfun-decl-plugin.ts +262 -0
  401. package/src/prover/smt/solver/recfun-rewriter.ts +107 -0
  402. package/src/prover/smt/solver/reduce-args.ts +225 -0
  403. package/src/prover/smt/solver/reduce-bv-size.ts +119 -0
  404. package/src/prover/smt/solver/ref-vector.ts +0 -1
  405. package/src/prover/smt/solver/relevancy.ts +1 -2
  406. package/src/prover/smt/solver/rewriter-tpl.ts +77 -10
  407. package/src/prover/smt/solver/rewriter.ts +475 -36
  408. package/src/prover/smt/solver/rlimit.ts +38 -2
  409. package/src/prover/smt/solver/sat/asymm-branch.ts +325 -0
  410. package/src/prover/smt/solver/sat/big.ts +177 -0
  411. package/src/prover/smt/solver/sat/clause-use-list.ts +71 -0
  412. package/src/prover/smt/solver/sat/clause.ts +203 -0
  413. package/src/prover/smt/solver/sat/cleaner.ts +94 -0
  414. package/src/prover/smt/solver/sat/config.ts +122 -0
  415. package/src/prover/smt/solver/sat/consequences.ts +203 -0
  416. package/src/prover/smt/solver/sat/elim-eqs.ts +142 -0
  417. package/src/prover/smt/solver/sat/goal2sat.ts +526 -0
  418. package/src/prover/smt/solver/sat/inc-sat-solver.ts +378 -0
  419. package/src/prover/smt/solver/sat/model-converter.ts +136 -0
  420. package/src/prover/smt/solver/sat/pb-constraint.ts +261 -0
  421. package/src/prover/smt/solver/sat/pb-solver.ts +1577 -0
  422. package/src/prover/smt/solver/sat/probing.ts +170 -0
  423. package/src/prover/smt/solver/sat/sat-tactic.ts +44 -0
  424. package/src/prover/smt/solver/sat/sat2goal.ts +165 -0
  425. package/src/prover/smt/solver/sat/scc.ts +142 -0
  426. package/src/prover/smt/solver/sat/simplifier.ts +1618 -0
  427. package/src/prover/smt/solver/sat/solver.ts +2105 -0
  428. package/src/prover/smt/solver/sat/var-queue.ts +117 -0
  429. package/src/prover/smt/solver/sat/watch-list.ts +140 -0
  430. package/src/prover/smt/solver/search-tree.ts +284 -0
  431. package/src/prover/smt/solver/seq-axioms.ts +995 -0
  432. package/src/prover/smt/solver/seq-decl-plugin.ts +819 -0
  433. package/src/prover/smt/solver/seq-derive.ts +1298 -0
  434. package/src/prover/smt/solver/seq-eq-approx.ts +236 -0
  435. package/src/prover/smt/solver/seq-eq-solver.ts +439 -0
  436. package/src/prover/smt/solver/seq-factory.ts +89 -0
  437. package/src/prover/smt/solver/seq-monadic.ts +730 -0
  438. package/src/prover/smt/solver/seq-range-predicate.ts +235 -0
  439. package/src/prover/smt/solver/seq-re-rewriter.ts +1171 -0
  440. package/src/prover/smt/solver/seq-re-util.ts +758 -0
  441. package/src/prover/smt/solver/seq-regex-bisim.ts +144 -0
  442. package/src/prover/smt/solver/seq-regex-live.ts +200 -0
  443. package/src/prover/smt/solver/seq-rewriter.ts +2404 -0
  444. package/src/prover/smt/solver/seq-skolem.ts +294 -0
  445. package/src/prover/smt/solver/seq-subset.ts +165 -0
  446. package/src/prover/smt/solver/seq-view-witness.ts +353 -0
  447. package/src/prover/smt/solver/smt-consequences.ts +297 -0
  448. package/src/prover/smt/solver/smt-kernel.ts +90 -0
  449. package/src/prover/smt/solver/smt-logics.ts +66 -0
  450. package/src/prover/smt/solver/smt-setup.ts +544 -0
  451. package/src/prover/smt/solver/smt2-printer.ts +765 -0
  452. package/src/prover/smt/solver/smtlib-parser.ts +3228 -327
  453. package/src/prover/smt/solver/smtlib-script.ts +1843 -0
  454. package/src/prover/smt/solver/solve-eqs.ts +923 -0
  455. package/src/prover/smt/solver/solver.ts +113 -22
  456. package/src/prover/smt/solver/static-features.ts +314 -0
  457. package/src/prover/smt/solver/sticky-generations.ts +0 -1
  458. package/src/prover/smt/solver/tactic.ts +2012 -0
  459. package/src/prover/smt/solver/term-enumeration.ts +205 -0
  460. package/src/prover/smt/solver/theory-array.ts +1240 -0
  461. package/src/prover/smt/solver/theory-bv.ts +1200 -0
  462. package/src/prover/smt/solver/theory-char.ts +355 -0
  463. package/src/prover/smt/solver/theory-datatype.ts +598 -0
  464. package/src/prover/smt/solver/theory-finite-set.ts +30 -0
  465. package/src/prover/smt/solver/theory-fpa.ts +389 -0
  466. package/src/prover/smt/solver/theory-lra-axioms.ts +53 -2
  467. package/src/prover/smt/solver/theory-lra-bounds.ts +31 -5
  468. package/src/prover/smt/solver/theory-lra-final-check.ts +56 -71
  469. package/src/prover/smt/solver/theory-lra-internalize.ts +89 -11
  470. package/src/prover/smt/solver/theory-lra-model.ts +20 -35
  471. package/src/prover/smt/solver/theory-lra-propagate.ts +24 -28
  472. package/src/prover/smt/solver/theory-lra-state.ts +6 -22
  473. package/src/prover/smt/solver/theory-lra.ts +188 -2
  474. package/src/prover/smt/solver/theory-pb.ts +933 -0
  475. package/src/prover/smt/solver/theory-polymorphism.ts +58 -0
  476. package/src/prover/smt/solver/theory-recfun.ts +307 -0
  477. package/src/prover/smt/solver/theory-seq-regex.ts +867 -0
  478. package/src/prover/smt/solver/theory-seq-solve.ts +1373 -0
  479. package/src/prover/smt/solver/theory-seq-state.ts +852 -0
  480. package/src/prover/smt/solver/theory-seq.ts +961 -0
  481. package/src/prover/smt/solver/theory.ts +189 -0
  482. package/src/prover/smt/solver/tseitin-cnf.ts +485 -0
  483. package/src/prover/smt/solver/var-subst.ts +36 -14
  484. package/src/prover/smt/table.ts +3 -2
  485. package/src/prover/smt/types.ts +146 -0
  486. package/src/prover/tlapm/cache.ts +37 -16
  487. package/src/prover/tlapm-library.ts +3208 -0
  488. package/src/prover/verdict.ts +2 -0
  489. package/src/prover/zenon/decide.ts +10 -7
  490. package/src/prover/zenon/encode.ts +0 -2
  491. package/src/prover/zenon/eqrel.ts +0 -2
  492. package/src/prover/zenon/equality-rules.ts +24 -2
  493. package/src/prover/zenon/expr.ts +21 -2
  494. package/src/prover/zenon/index-table.ts +7 -4
  495. package/src/prover/zenon/isar-case.ts +1 -3
  496. package/src/prover/zenon/isar.ts +2 -4
  497. package/src/prover/zenon/llproof.ts +0 -2
  498. package/src/prover/zenon/mltoll.ts +0 -2
  499. package/src/prover/zenon/node.ts +20 -5
  500. package/src/prover/zenon/parse.ts +6 -2
  501. package/src/prover/zenon/phrase.ts +1 -3
  502. package/src/prover/zenon/proof.ts +0 -2
  503. package/src/prover/zenon/propositional-rules.ts +0 -2
  504. package/src/prover/zenon/rules.ts +2 -3
  505. package/src/prover/zenon/search.ts +7 -5
  506. package/src/prover/zenon/tla/functions.ts +0 -2
  507. package/src/prover/zenon/tla/llproof.ts +0 -2
  508. package/src/prover/zenon/tla/records.ts +0 -2
  509. package/src/prover/zenon/tla/rewrites.ts +0 -2
  510. package/src/prover/zenon/tla/sets.ts +7 -8
  511. package/src/prover/zenon/tla/terms.ts +0 -2
  512. package/src/prover/zenon/tla/tla.ts +0 -2
  513. package/src/resolve.ts +625 -189
  514. package/src/runtime.ts +7 -1
  515. package/src/sany/builtins.ts +10 -10
  516. package/src/sany/generation.ts +2 -13
  517. package/src/sany/generator-definitions.ts +3 -1
  518. package/src/sany/generator-expressions.ts +36 -30
  519. package/src/sany/generator-proofs.ts +5 -3
  520. package/src/sany/generator.ts +2 -1
  521. package/src/sany/levels.ts +0 -2
  522. package/src/sany/lexer.ts +3 -3
  523. package/src/sany/linter.ts +0 -2
  524. package/src/sany/modules.ts +4 -2
  525. package/src/sany/nodes.ts +1 -1
  526. package/src/sany/selectors.ts +11 -6
  527. package/src/sany/xml.ts +2 -3
  528. package/src/search.ts +209 -56
  529. package/src/simulate.ts +3 -0
  530. package/src/spec-description.ts +2 -2
  531. package/src/standard-definitions.ts +4 -0
  532. package/src/state-graph.ts +0 -2
  533. package/src/subexpressions.ts +265 -94
  534. package/src/successors.ts +2 -1
  535. package/src/symmetry.ts +3 -3
  536. package/src/tableau.ts +2 -2
  537. package/src/tlc/fingerprint.ts +81 -9
  538. package/src/tlc/jar-data.ts +10 -0
  539. package/src/tlc/messages.ts +3 -3
  540. package/src/tlc/order.ts +14 -3
  541. package/src/tlc/summary.ts +29 -14
  542. package/src/tlc/tlc-operators.ts +3 -1
  543. package/src/tlc/tlcext-operators.ts +61 -16
  544. package/src/tlc/trace-spec.ts +5 -5
  545. package/src/typed-tier.ts +6541 -0
  546. package/src/typescript/types.ts +2 -2
  547. package/src/values.ts +46 -27
  548. package/src/prover/isabelle/isar/statement.ts +0 -52
  549. package/src/prover/smt/solver/z3-license.txt +0 -10
  550. package/src/prover/tlaps-module.ts +0 -510
  551. package/src/prover/zenon/LICENSE +0 -32
@@ -1,4 +1,3 @@
1
- // Ported from Z3 (src/nlsat/nlsat_explain.cpp), MIT license, see z3-license.txt.
2
1
  import type { AlgebraicManager, Anum } from "./algebraic";
3
2
  import {
4
3
  type AtomTable,
@@ -9,12 +8,14 @@ import {
9
8
  TRUE_BOOL_VAR,
10
9
  TRUE_LITERAL,
11
10
  } from "./atoms";
12
- import { getSingleCell, TodoSet } from "./levelwise";
11
+ import { type CellInterval, Levelwise, releaseIntervals, TodoSet } from "./levelwise";
13
12
  import {
14
13
  NULL_VAR,
15
14
  type Polynomial,
16
15
  type PolynomialCache,
17
16
  type PolynomialManager,
17
+ PolynomialRef,
18
+ PolynomialRefVector,
18
19
  } from "./polynomial";
19
20
  import { type IneqAtom, type IneqKind, type RootKind, isIneqAtom } from "./types";
20
21
 
@@ -23,6 +24,9 @@ interface ExplainContext {
23
24
  sample: (Anum | undefined)[];
24
25
  getValue: (literal: number) => number;
25
26
  var2eq: (IneqAtom | null)[];
27
+ getNumVars: () => number;
28
+ reorder: (permutation: readonly number[]) => void;
29
+ restoreOrder: () => void;
26
30
  }
27
31
 
28
32
  class AddAllCoeffsRestart {}
@@ -62,12 +66,17 @@ const getKindForSign = (sign: number): IneqKind => (sign === 0 ? "EQ" : sign < 0
62
66
  export class Explain {
63
67
  private result: ScopedLiterals | null = null;
64
68
  private added = new Set<number>();
69
+ private ps: PolynomialRefVector;
70
+ private factors: PolynomialRefVector;
71
+ private factorsSave: PolynomialRefVector;
65
72
  private todo: TodoSet;
66
- private lowerStagePolys: Polynomial[] = [];
67
73
  private core: ScopedLiterals;
74
+ private lowerStagePolys: PolynomialRefVector;
75
+ private lastLwsInputPolys: PolynomialRefVector;
68
76
  private isAddAllCoeffs = false;
69
77
 
70
78
  isFullDimensional = false;
79
+ isFactoring = true;
71
80
 
72
81
  constructor(
73
82
  private pm: PolynomialManager,
@@ -75,8 +84,13 @@ export class Explain {
75
84
  private cache: PolynomialCache,
76
85
  private context: ExplainContext,
77
86
  ) {
78
- this.todo = new TodoSet(pm, cache);
87
+ this.ps = new PolynomialRefVector(pm);
88
+ this.factors = new PolynomialRefVector(pm);
89
+ this.factorsSave = new PolynomialRefVector(pm);
90
+ this.todo = new TodoSet(cache, true);
79
91
  this.core = new ScopedLiterals(context.atoms);
92
+ this.lowerStagePolys = new PolynomialRefVector(pm);
93
+ this.lastLwsInputPolys = new PolynomialRefVector(pm);
80
94
  }
81
95
 
82
96
  private getSign(polynomial: Polynomial) {
@@ -98,16 +112,18 @@ export class Explain {
98
112
  this.result = null;
99
113
  }
100
114
 
101
- private collectPolys(literals: readonly number[]) {
102
- return literals.flatMap((literal) => {
103
- const atom = this.getAtom(literal);
104
- return isIneqAtom(atom) ? atom.polynomials : [atom.polynomial];
105
- });
115
+ reset() {
116
+ this.resetResult();
117
+ this.core.reset();
106
118
  }
107
119
 
108
- private addAssumption(kind: IneqKind, polynomial: Polynomial, isNeg = false) {
109
- const boolVar = this.context.atoms.mkIneqAtom(kind, [polynomial], [false]);
110
- this.addLiteral(2 * boolVar + (isNeg ? 0 : 1));
120
+ private collectPolys(literals: readonly number[], ps: PolynomialRefVector) {
121
+ ps.reset();
122
+ for (const literal of literals) {
123
+ const atom = this.getAtom(literal);
124
+ if (isIneqAtom(atom)) for (const polynomial of atom.polynomials) ps.push(polynomial);
125
+ else ps.push(atom.polynomial);
126
+ }
111
127
  }
112
128
 
113
129
  private findSectionRoot(polynomial: Polynomial, variable: number) {
@@ -125,100 +141,153 @@ export class Explain {
125
141
  }
126
142
 
127
143
  private addZeroAssumption(polynomial: Polynomial) {
128
- const squareFree = this.pm.squareFree(polynomial);
129
- if (this.pm.isConst(squareFree)) return;
130
- const variable = this.pm.maxVar(squareFree);
131
- const index = this.findSectionRoot(squareFree, variable);
132
- if (index !== null) this.addRootLiteral("ROOT_EQ", variable, index, squareFree);
144
+ const q = new PolynomialRef(this.pm);
145
+ try {
146
+ this.pm.squareFree(polynomial, q);
147
+ if (this.pm.isConst(q.get())) return;
148
+ const variable = this.pm.maxVar(q.get());
149
+ const index = this.findSectionRoot(q.get(), variable);
150
+ if (index !== null) this.addRootLiteral("ROOT_EQ", variable, index, q.get());
151
+ } finally {
152
+ q.reset();
153
+ }
133
154
  }
134
155
 
135
- private elimVanishing(polynomial: Polynomial) {
136
- let p = polynomial;
137
- let variable = this.pm.maxVar(p);
138
- let degree = this.pm.degree(p, variable);
139
- while (true) {
140
- if (this.pm.isConst(p)) return p;
141
- if (degree === 0) {
142
- variable = this.pm.maxVar(p);
143
- degree = this.pm.degree(p, variable);
144
- }
145
- if (this.pm.isNonzeroConstCoeff(p, variable, degree)) return p;
146
- // Z3's insert_fresh_factors_in_todo writes lc back without its vanishing coefficients.
147
- const lc = this.insertFreshFactorsInTodo(this.pm.coeff(p, variable, degree));
148
- const reduct = this.pm.reduct(p, variable, degree);
149
- if (!this.pm.isZero(lc) && this.getSign(lc) !== 0) return p;
150
- if (degree === 0) {
151
- if (this.isAddAllCoeffs) {
152
- this.addZeroAssumption(lc);
153
- return this.pm.zero;
156
+ private addAssumption(kind: IneqKind, polynomial: Polynomial, isNeg = false) {
157
+ const boolVar = this.context.atoms.mkIneqAtom(kind, [polynomial], [false]);
158
+ this.addLiteral(2 * boolVar + (isNeg ? 0 : 1));
159
+ }
160
+
161
+ private elimVanishing(p: PolynomialRef) {
162
+ const pm = this.pm;
163
+ let variable = pm.maxVar(p.get());
164
+ let degree = pm.degree(p.get(), variable);
165
+ const lc = new PolynomialRef(pm);
166
+ const reduct = new PolynomialRef(pm);
167
+ try {
168
+ while (true) {
169
+ if (pm.isConst(p.get())) return;
170
+ if (degree === 0) {
171
+ variable = pm.maxVar(p.get());
172
+ degree = pm.degree(p.get(), variable);
173
+ }
174
+ if (pm.isNonzeroConstCoeff(p.get(), variable, degree)) return;
175
+ lc.set(pm.coeffWithReduct(p.get(), variable, degree, reduct));
176
+ this.insertFreshFactorsInTodo(lc);
177
+ if (!pm.isZero(lc.get()) && this.getSign(lc.get()) !== 0) return;
178
+ if (degree === 0) {
179
+ p.set(pm.zero);
180
+ if (this.isAddAllCoeffs) {
181
+ this.addZeroAssumption(lc.get());
182
+ return;
183
+ }
184
+ this.isAddAllCoeffs = true;
185
+ throw new AddAllCoeffsRestart();
154
186
  }
155
- this.isAddAllCoeffs = true;
156
- throw new AddAllCoeffsRestart();
187
+ this.addZeroAssumption(lc.get());
188
+ degree--;
189
+ p.copy(reduct);
157
190
  }
158
- this.addZeroAssumption(lc);
159
- degree--;
160
- p = reduct;
191
+ } finally {
192
+ reduct.reset();
193
+ lc.reset();
161
194
  }
162
195
  }
163
196
 
164
- private elimVanishingAll(polynomials: readonly Polynomial[]) {
165
- return polynomials
166
- .map((polynomial) => this.elimVanishing(polynomial))
167
- .filter((polynomial) => !this.pm.isConst(polynomial));
197
+ private elimVanishingAll(ps: PolynomialRefVector) {
198
+ const size = ps.size;
199
+ const p = new PolynomialRef(this.pm);
200
+ try {
201
+ let kept = 0;
202
+ for (let index = 0; index < size; index++) {
203
+ p.set(ps.get(index));
204
+ this.elimVanishing(p);
205
+ if (!this.pm.isConst(p.get())) ps.set(kept++, p.get());
206
+ }
207
+ ps.shrink(kept);
208
+ } finally {
209
+ p.reset();
210
+ }
168
211
  }
169
212
 
170
- private insertFreshFactorsInTodo(polynomial: Polynomial) {
171
- if (this.pm.isConst(polynomial)) return polynomial;
172
- const p = this.elimVanishing(polynomial);
173
- if (this.pm.isConst(p)) return p;
174
- for (const factor of this.cache.factor(p)) {
175
- const reduced = this.elimVanishing(factor);
176
- if (!this.pm.isConst(reduced)) this.todo.insert(reduced);
213
+ private insertFreshFactorsInTodo(p: PolynomialRef) {
214
+ if (this.pm.isConst(p.get())) return;
215
+ this.elimVanishing(p);
216
+ if (this.pm.isConst(p.get())) return;
217
+ if (!this.isFactoring) {
218
+ this.todo.insert(p.get());
219
+ return;
220
+ }
221
+ const saved = this.factorsSave.size;
222
+ this.factorsSave.append(this.factors);
223
+ const f = new PolynomialRef(this.pm);
224
+ try {
225
+ this.cache.factor(p.get(), this.factors);
226
+ for (let index = 0; index < this.factors.size; index++) {
227
+ f.set(this.factors.get(index));
228
+ this.elimVanishing(f);
229
+ if (!this.pm.isConst(f.get())) this.todo.insert(f.get());
230
+ }
231
+ } finally {
232
+ f.reset();
233
+ this.factors.reset();
234
+ for (let index = saved; index < this.factorsSave.size; index++)
235
+ this.factors.push(this.factorsSave.get(index));
236
+ this.factorsSave.shrink(saved);
177
237
  }
178
- return p;
179
238
  }
180
239
 
181
240
  private normalizeLiteral(literal: number, max: number) {
182
241
  if (literal >> 1 === TRUE_BOOL_VAR) return literal;
183
242
  const atom = this.getAtom(literal);
184
243
  if (!isIneqAtom(atom)) return literal;
244
+ const pm = this.pm;
185
245
  const isNeg = (literal & 1) === 1;
186
- const polynomials: Polynomial[] = [];
246
+ const ps = new PolynomialRefVector(pm);
187
247
  const isEven: boolean[] = [];
188
- let atomSign = 1;
189
- let isNormalized = false;
190
- for (const [index, factor] of atom.polynomials.entries()) {
191
- const p = this.pm.maxVar(factor) === max ? this.elimVanishing(factor) : factor;
192
- if (this.pm.isConst(p) || this.pm.maxVar(p) < max) {
193
- const sign = this.getSign(p);
194
- if (!this.pm.isConst(p)) {
195
- this.lowerStagePolys.push(p);
196
- if (sign === 0) this.addAssumption("EQ", p);
197
- else if (atom.isEven[index]) this.addAssumption("EQ", p, true);
198
- else this.addAssumption(getKindForSign(sign), p);
248
+ const p = new PolynomialRef(pm);
249
+ try {
250
+ let atomSign = 1;
251
+ let isNormalized = false;
252
+ for (let index = 0; index < atom.polynomials.length; index++) {
253
+ p.set(atom.polynomials[index]);
254
+ if (pm.maxVar(p.get()) === max) this.elimVanishing(p);
255
+ if (pm.isConst(p.get()) || pm.maxVar(p.get()) < max) {
256
+ const sign = this.getSign(p.get());
257
+ if (!pm.isConst(p.get())) {
258
+ this.lowerStagePolys.push(p.get());
259
+ if (sign === 0) this.addAssumption("EQ", p.get());
260
+ else if (atom.isEven[index]) this.addAssumption("EQ", p.get(), true);
261
+ else this.addAssumption(getKindForSign(sign), p.get());
262
+ }
263
+ if (sign === 0) return (atom.kind === "EQ") !== isNeg ? TRUE_LITERAL : FALSE_LITERAL;
264
+ if (sign < 0 && !atom.isEven[index]) atomSign = -atomSign;
265
+ isNormalized = true;
266
+ continue;
199
267
  }
200
- if (sign === 0) return (atom.kind === "EQ") !== isNeg ? TRUE_LITERAL : FALSE_LITERAL;
201
- if (sign < 0 && !atom.isEven[index]) atomSign = -atomSign;
202
- isNormalized = true;
203
- continue;
268
+ if (p.get() !== atom.polynomials[index]) isNormalized = true;
269
+ isEven.push(atom.isEven[index]);
270
+ ps.push(p.get());
204
271
  }
205
- if (p !== factor) isNormalized = true;
206
- isEven.push(atom.isEven[index]);
207
- polynomials.push(p);
208
- }
209
- if (polynomials.length === 0) {
210
- const isTrue = atom.kind === "EQ" ? false : atom.kind === "LT" ? atomSign < 0 : atomSign > 0;
211
- return isTrue !== isNeg ? TRUE_LITERAL : FALSE_LITERAL;
272
+ if (ps.size === 0) {
273
+ const isTrue =
274
+ atom.kind === "EQ" ? false : atom.kind === "LT" ? atomSign < 0 : atomSign > 0;
275
+ return isTrue !== isNeg ? TRUE_LITERAL : FALSE_LITERAL;
276
+ }
277
+ if (!isNormalized) return literal;
278
+ const kind = atomSign < 0 ? flipKind(atom.kind) : atom.kind;
279
+ return this.context.atoms.mkIneqLiteral(kind, ps.items, isEven) ^ (isNeg ? 1 : 0);
280
+ } finally {
281
+ p.reset();
282
+ ps.reset();
212
283
  }
213
- if (!isNormalized) return literal;
214
- const kind = atomSign < 0 ? flipKind(atom.kind) : atom.kind;
215
- return this.context.atoms.mkIneqLiteral(kind, polynomials, isEven) ^ (isNeg ? 1 : 0);
216
284
  }
217
285
 
218
286
  private normalizeCore(core: ScopedLiterals, max: number) {
287
+ const size = core.size;
219
288
  let kept = 0;
220
- for (const literal of core.literals) {
221
- const normalized = this.normalizeLiteral(literal, max);
289
+ for (let index = 0; index < size; index++) {
290
+ const normalized = this.normalizeLiteral(core.literals[index], max);
222
291
  if (normalized === TRUE_LITERAL) continue;
223
292
  if (normalized === FALSE_LITERAL) {
224
293
  core.reset();
@@ -235,81 +304,93 @@ export class Explain {
235
304
  newLiteral.set(literal);
236
305
  return;
237
306
  }
307
+ const pm = this.pm;
238
308
  const isNeg = (literal & 1) === 1;
239
- const factors: Polynomial[] = [];
240
- const isEven: boolean[] = [];
241
309
  let atomSign = 1;
242
310
  let isModified = false;
311
+ const newFactors = new PolynomialRefVector(pm);
312
+ const newFactorsEven: boolean[] = [];
313
+ const newFactor = new PolynomialRef(pm);
243
314
  const addLcCondition = (steps: number, isFactorEven: boolean) => {
244
315
  if (info.isLcConst) return;
245
316
  if (steps % 2 === 0 || isFactorEven || atom.kind === "EQ") addLcDiseq(info);
246
317
  else addLcIneq(info);
247
318
  };
248
- for (const [index, factor] of atom.polynomials.entries()) {
249
- const isFactorEven = atom.isEven[index];
250
- if (this.pm.degree(factor, info.variable) < info.degree) {
251
- factors.push(factor);
252
- isEven.push(isFactorEven);
253
- continue;
319
+ try {
320
+ for (let index = 0; index < atom.polynomials.length; index++) {
321
+ const factor = atom.polynomials[index];
322
+ const isFactorEven = atom.isEven[index];
323
+ if (pm.degree(factor, info.variable) < info.degree) {
324
+ newFactors.push(factor);
325
+ newFactorsEven.push(isFactorEven);
326
+ continue;
327
+ }
328
+ isModified = true;
329
+ const steps = pm.pseudoRemainder(factor, info.eq, info.variable, newFactor);
330
+ if (steps % 2 === 1 && !isFactorEven && info.lcSign < 0) atomSign = -atomSign;
331
+ if (pm.isConst(newFactor.get())) {
332
+ const sign = this.getSign(newFactor.get());
333
+ if (sign === 0) {
334
+ newLiteral.set((atom.kind === "EQ") !== isNeg ? TRUE_LITERAL : FALSE_LITERAL);
335
+ if (!info.isLcConst) addLcDiseq(info);
336
+ return;
337
+ }
338
+ addLcCondition(steps, isFactorEven);
339
+ if (sign < 0 && !isFactorEven) atomSign = -atomSign;
340
+ continue;
341
+ }
342
+ newFactors.push(newFactor.get());
343
+ newFactorsEven.push(isFactorEven);
344
+ addLcCondition(steps, isFactorEven);
254
345
  }
255
- isModified = true;
256
- const division = this.pm.pseudoRemainder(factor, info.eq, info.variable);
257
- if (division.steps % 2 === 1 && !isFactorEven && info.lcSign < 0) atomSign = -atomSign;
258
- const remainder = division.remainder;
259
- if (!this.pm.isConst(remainder)) {
260
- factors.push(remainder);
261
- isEven.push(isFactorEven);
262
- addLcCondition(division.steps, isFactorEven);
263
- continue;
346
+ if (!isModified) {
347
+ newLiteral.set(literal);
348
+ return;
264
349
  }
265
- const sign = this.getSign(remainder);
266
- if (sign === 0) {
267
- newLiteral.set((atom.kind === "EQ") !== isNeg ? TRUE_LITERAL : FALSE_LITERAL);
268
- if (!info.isLcConst) addLcDiseq(info);
350
+ const kind = atomSign < 0 ? flipKind(atom.kind) : atom.kind;
351
+ newLiteral.set(
352
+ this.context.atoms.mkIneqLiteral(kind, newFactors.items, newFactorsEven) ^ (isNeg ? 1 : 0),
353
+ );
354
+ // Z3's null_var is the largest unsigned, so true and false never count as lower stage.
355
+ const maxVar = this.context.atoms.getMaxVar(newLiteral.literal);
356
+ if (maxVar === NULL_VAR || maxVar >= max) {
357
+ newLiteral.set(this.normalizeLiteral(newLiteral.literal, max));
269
358
  return;
270
359
  }
271
- addLcCondition(division.steps, isFactorEven);
272
- if (sign < 0 && !isFactorEven) atomSign = -atomSign;
273
- }
274
- if (!isModified) {
275
- newLiteral.set(literal);
276
- return;
277
- }
278
- const kind = atomSign < 0 ? flipKind(atom.kind) : atom.kind;
279
- newLiteral.set(this.context.atoms.mkIneqLiteral(kind, factors, isEven) ^ (isNeg ? 1 : 0));
280
- // Z3's null_var is the largest unsigned, so true and false never count as lower stage.
281
- const maxVar = this.context.atoms.getMaxVar(newLiteral.literal);
282
- if (maxVar === NULL_VAR || maxVar >= max) {
283
- newLiteral.set(this.normalizeLiteral(newLiteral.literal, max));
284
- return;
285
- }
286
- if (this.context.getValue(newLiteral.literal) === 1) {
287
- newLiteral.set(literal);
288
- return;
360
+ if (this.context.getValue(newLiteral.literal) === 1) {
361
+ newLiteral.set(literal);
362
+ return;
363
+ }
364
+ this.addLiteral(newLiteral.literal);
365
+ newLiteral.set(TRUE_LITERAL);
366
+ } finally {
367
+ newFactor.reset();
368
+ newFactors.reset();
289
369
  }
290
- this.addLiteral(newLiteral.literal);
291
- newLiteral.set(TRUE_LITERAL);
292
370
  }
293
371
 
294
372
  private simplifyWithEq(core: ScopedLiterals, eq: Polynomial, max: number) {
295
373
  const variable = this.pm.maxVar(eq);
296
374
  const degree = this.pm.degree(eq, variable);
297
- const lc = this.pm.coeff(eq, variable, degree);
298
- const info = {
299
- eq,
300
- variable,
301
- degree,
302
- lc,
303
- lcSign: this.getSign(lc),
304
- isLcConst: this.pm.isConst(lc),
305
- isLcAdded: false,
306
- isLcIneqAdded: false,
307
- };
375
+ const lcEq = new PolynomialRef(this.pm);
308
376
  const newLiteral = new ScopedLiteral(this.context.atoms);
309
377
  try {
378
+ lcEq.set(this.pm.coeff(eq, variable, degree));
379
+ const info = {
380
+ eq,
381
+ variable,
382
+ degree,
383
+ lc: lcEq.get(),
384
+ lcSign: this.getSign(lcEq.get()),
385
+ isLcConst: this.pm.isConst(lcEq.get()),
386
+ isLcAdded: false,
387
+ isLcIneqAdded: false,
388
+ };
389
+ const size = core.size;
310
390
  let isModified = false;
311
391
  let kept = 0;
312
- for (const literal of core.literals) {
392
+ for (let index = 0; index < size; index++) {
393
+ const literal = core.literals[index];
313
394
  newLiteral.set(TRUE_LITERAL);
314
395
  this.simplifyLiteral(literal, info, max, newLiteral);
315
396
  if (newLiteral.literal === literal) {
@@ -332,6 +413,7 @@ export class Explain {
332
413
  return isModified;
333
414
  } finally {
334
415
  newLiteral.set(TRUE_LITERAL);
416
+ lcEq.reset();
335
417
  }
336
418
  }
337
419
 
@@ -358,8 +440,7 @@ export class Explain {
358
440
  const atom = this.getAtom(literal);
359
441
  if (!isIneqAtom(atom)) continue;
360
442
  for (const factor of atom.polynomials) {
361
- const variables = new Set(factor.ms.flatMap((monomial) => [...monomial.vars]));
362
- for (const variable of variables) {
443
+ for (const variable of this.pm.getVars(factor)) {
363
444
  if (variable >= max) continue;
364
445
  const eq = this.context.var2eq[variable] ?? null;
365
446
  if (eq === null) continue;
@@ -387,122 +468,210 @@ export class Explain {
387
468
  }
388
469
 
389
470
  private addRootLiteral(kind: RootKind, variable: number, index: number, polynomial: Polynomial) {
390
- if (this.mkLinearRoot(kind, variable, polynomial)) return;
391
- if (this.mkQuadraticRoot(kind, variable, index, polynomial)) return;
392
- const boolVar = this.context.atoms.mkRootAtom(kind, variable, index, polynomial);
393
- this.addLiteral(2 * boolVar + 1);
471
+ const pr = new PolynomialRef(this.pm);
472
+ pr.set(polynomial);
473
+ try {
474
+ if (
475
+ this.mkLinearRoot(kind, variable, polynomial) ||
476
+ this.mkQuadraticRoot(kind, variable, index, polynomial)
477
+ )
478
+ return;
479
+ const boolVar = this.context.atoms.mkRootAtom(kind, variable, index, polynomial);
480
+ this.addLiteral(2 * boolVar + 1);
481
+ } finally {
482
+ pr.reset();
483
+ }
394
484
  }
395
485
 
396
486
  private mkLinearRoot(kind: RootKind, variable: number, polynomial: Polynomial) {
487
+ if (this.pm.degree(polynomial, variable) !== 1) return false;
397
488
  const coeff = this.pm.getConstCoeff(polynomial, variable, 1);
398
- if (this.pm.degree(polynomial, variable) !== 1 || coeff === null) return false;
489
+ if (coeff === null) return false;
399
490
  this.addLinearRoot(kind, polynomial, coeff < 0n);
400
491
  return true;
401
492
  }
402
493
 
403
- private addLinearRoot(kind: RootKind, polynomial: Polynomial, isNegated: boolean) {
404
- const ineq = ROOT_TO_INEQ[kind];
405
- this.addAssumption(ineq.kind, isNegated ? this.pm.neg(polynomial) : polynomial, ineq.isNeg);
406
- }
407
-
408
494
  private mkPlinearRoot(kind: RootKind, variable: number, polynomial: Polynomial) {
409
495
  if (this.pm.degree(polynomial, variable) !== 1) return false;
410
- const coeff = this.pm.coeff(polynomial, variable, 1);
411
- const sign = this.getSign(coeff);
412
- if (sign === 0) return false;
413
- this.ensureSign(coeff);
414
- this.addLinearRoot(kind, polynomial, sign < 0);
415
- return true;
496
+ const c = new PolynomialRef(this.pm);
497
+ try {
498
+ c.set(this.pm.coeff(polynomial, variable, 1));
499
+ const sign = this.getSign(c.get());
500
+ if (sign === 0) return false;
501
+ this.ensureSign(c);
502
+ this.addLinearRoot(kind, polynomial, sign < 0);
503
+ return true;
504
+ } finally {
505
+ c.reset();
506
+ }
416
507
  }
417
508
 
418
509
  private mkQuadraticRoot(kind: RootKind, variable: number, index: number, polynomial: Polynomial) {
419
- if (this.pm.degree(polynomial, variable) !== 2 || (index !== 1 && index !== 2)) return false;
420
- const a = this.pm.coeff(polynomial, variable, 2);
421
- const b = this.pm.coeff(polynomial, variable, 1);
422
- const c = this.pm.coeff(polynomial, variable, 0);
423
- const discriminant = this.pm.sub(this.pm.mul(b, b), this.pm.mul(this.pm.mulConst(4n, a), c));
424
- const y = this.pm.mkVar(variable);
425
- const derivative = this.pm.normalize(this.pm.add(this.pm.mul(this.pm.mulConst(2n, a), y), b));
426
- if (this.ensureSignQuad(discriminant) < 0) return false;
427
- if (this.ensureSignQuad(a) === 0)
428
- return this.mkPlinearRoot(kind, variable, this.pm.add(this.pm.mul(b, y), c));
429
- this.ensureSign(derivative);
430
- if (this.getSign(discriminant) > 0) this.ensureSign(polynomial);
431
- return true;
510
+ const pm = this.pm;
511
+ if (pm.degree(polynomial, variable) !== 2) return false;
512
+ if (index !== 1 && index !== 2) return false;
513
+ const a = new PolynomialRef(pm);
514
+ const b = new PolynomialRef(pm);
515
+ const c = new PolynomialRef(pm);
516
+ const q = new PolynomialRef(pm);
517
+ const pDiff = new PolynomialRef(pm);
518
+ const yy = new PolynomialRef(pm);
519
+ const pr = new PolynomialRef(pm);
520
+ const first = new PolynomialRef(pm);
521
+ const second = new PolynomialRef(pm);
522
+ const third = new PolynomialRef(pm);
523
+ try {
524
+ a.set(pm.coeff(polynomial, variable, 2));
525
+ b.set(pm.coeff(polynomial, variable, 1));
526
+ c.set(pm.coeff(polynomial, variable, 0));
527
+ first.set(pm.mul(b.get(), b.get()));
528
+ second.set(pm.mulConst(4n, a.get()));
529
+ third.set(pm.mul(second.get(), c.get()));
530
+ q.set(pm.sub(first.get(), third.get()));
531
+ third.reset();
532
+ second.reset();
533
+ first.reset();
534
+ yy.set(pm.mkVar(variable));
535
+ first.set(pm.mulConst(2n, a.get()));
536
+ second.set(pm.mul(first.get(), yy.get()));
537
+ pDiff.set(pm.add(second.get(), b.get()));
538
+ second.reset();
539
+ first.reset();
540
+ pDiff.set(pm.normalize(pDiff.get()));
541
+ const discriminantSign = this.ensureSignQuad(q);
542
+ if (discriminantSign < 0) return false;
543
+ if (this.ensureSignQuad(a) === 0) {
544
+ first.set(pm.mul(b.get(), yy.get()));
545
+ q.set(pm.add(first.get(), c.get()));
546
+ first.reset();
547
+ return this.mkPlinearRoot(kind, variable, q.get());
548
+ }
549
+ this.ensureSign(pDiff);
550
+ if (discriminantSign > 0) {
551
+ pr.set(polynomial);
552
+ this.ensureSign(pr);
553
+ }
554
+ return true;
555
+ } finally {
556
+ third.reset();
557
+ second.reset();
558
+ first.reset();
559
+ pr.reset();
560
+ yy.reset();
561
+ pDiff.reset();
562
+ q.reset();
563
+ c.reset();
564
+ b.reset();
565
+ a.reset();
566
+ }
432
567
  }
433
568
 
434
- private ensureSign(polynomial: Polynomial) {
435
- if (this.pm.isConst(polynomial)) return;
436
- this.addAssumption(getKindForSign(this.getSign(polynomial)), polynomial);
437
- this.insertFreshFactorsInTodo(polynomial);
569
+ private ensureSign(p: PolynomialRef) {
570
+ if (this.pm.isConst(p.get())) return;
571
+ this.addAssumption(getKindForSign(this.getSign(p.get())), p.get());
572
+ this.insertFreshFactorsInTodo(p);
438
573
  }
439
574
 
440
- private ensureSignQuad(polynomial: Polynomial) {
441
- const sign = this.getSign(polynomial);
442
- if (!this.pm.isConst(polynomial)) {
443
- this.addAssumption(getKindForSign(sign), polynomial);
444
- this.insertFreshFactorsInTodo(polynomial);
575
+ private ensureSignQuad(p: PolynomialRef) {
576
+ const sign = this.getSign(p.get());
577
+ if (!this.pm.isConst(p.get())) {
578
+ this.addAssumption(getKindForSign(sign), p.get());
579
+ this.insertFreshFactorsInTodo(p);
445
580
  }
446
581
  return sign;
447
582
  }
448
583
 
449
- private addCellLiterals(polynomials: readonly Polynomial[], maxVar: number, isLinear: boolean) {
450
- const cell = getSingleCell(
584
+ private addLinearRoot(kind: RootKind, polynomial: Polynomial, isNegated: boolean) {
585
+ const pPrime = new PolynomialRef(this.pm);
586
+ pPrime.set(polynomial);
587
+ if (isNegated) pPrime.set(this.pm.neg(pPrime.get()));
588
+ const ineq = ROOT_TO_INEQ[kind];
589
+ this.addAssumption(ineq.kind, pPrime.get(), ineq.isNeg);
590
+ pPrime.reset();
591
+ }
592
+
593
+ private levelwiseSingleCell(ps: PolynomialRefVector, maxVar: number, isLinear: boolean) {
594
+ this.lastLwsInputPolys.reset();
595
+ for (let index = 0; index < ps.size; index++) this.lastLwsInputPolys.push(ps.get(index));
596
+ const levelwise = new Levelwise(
451
597
  this.pm,
452
598
  this.am,
453
599
  this.cache,
454
- polynomials,
600
+ ps,
455
601
  maxVar,
456
602
  this.context.sample,
457
603
  isLinear,
458
604
  );
459
- const isFull = this.isFullDimensional;
460
- for (const interval of cell) {
461
- if (interval.isSection) {
462
- const lower = interval.lower!;
463
- this.addRootLiteral("ROOT_EQ", this.pm.maxVar(lower), interval.lowerIndex, lower);
464
- continue;
605
+ let cell: CellInterval[] = [];
606
+ try {
607
+ cell = levelwise.singleCell();
608
+ const isFull = this.isFullDimensional;
609
+ for (const interval of cell) {
610
+ if (interval.isSection) {
611
+ const lower = interval.lower.get();
612
+ this.addRootLiteral("ROOT_EQ", this.pm.maxVar(lower), interval.lowerIndex, lower);
613
+ continue;
614
+ }
615
+ const lower = interval.lower.getOrNull();
616
+ const upper = interval.upper.getOrNull();
617
+ if (lower !== null)
618
+ this.addRootLiteral(
619
+ isFull ? "ROOT_GE" : "ROOT_GT",
620
+ this.pm.maxVar(lower),
621
+ interval.lowerIndex,
622
+ lower,
623
+ );
624
+ if (upper !== null)
625
+ this.addRootLiteral(
626
+ isFull ? "ROOT_LE" : "ROOT_LT",
627
+ this.pm.maxVar(upper),
628
+ interval.upperIndex,
629
+ upper,
630
+ );
465
631
  }
466
- if (interval.lower !== null)
467
- this.addRootLiteral(
468
- isFull ? "ROOT_GE" : "ROOT_GT",
469
- this.pm.maxVar(interval.lower),
470
- interval.lowerIndex,
471
- interval.lower,
472
- );
473
- if (interval.upper !== null)
474
- this.addRootLiteral(
475
- isFull ? "ROOT_LE" : "ROOT_LT",
476
- this.pm.maxVar(interval.upper),
477
- interval.upperIndex,
478
- interval.upper,
479
- );
632
+ } finally {
633
+ releaseIntervals(cell);
634
+ levelwise.release();
480
635
  }
481
636
  }
482
637
 
483
- private project(polynomials: readonly Polynomial[], maxVar: number) {
484
- if (polynomials.length === 0) return;
638
+ private project(ps: PolynomialRefVector, maxVar: number) {
639
+ if (ps.size === 0) return;
485
640
  this.todo.reset();
486
- for (const polynomial of polynomials) this.insertFreshFactorsInTodo(polynomial);
487
- this.addCellLiterals([...this.todo.polynomials], maxVar, false);
641
+ const p = new PolynomialRef(this.pm);
642
+ try {
643
+ for (let index = 0; index < ps.size; index++) {
644
+ p.set(ps.get(index));
645
+ this.insertFreshFactorsInTodo(p);
646
+ p.reset();
647
+ }
648
+ } finally {
649
+ p.reset();
650
+ }
651
+ ps.reset();
652
+ for (const polynomial of this.todo.set.items) ps.push(polynomial);
653
+ this.levelwiseSingleCell(ps, maxVar, false);
488
654
  }
489
655
 
490
- private explainCore(literals: readonly number[]) {
656
+ private main(literals: readonly number[]) {
491
657
  if (literals.length === 0) return;
492
- const polynomials = [...this.collectPolys(literals), ...this.lowerStagePolys];
493
- const maxVar = this.pm.getMaxVarOfPolys(polynomials);
494
- this.project(this.elimVanishingAll(polynomials), maxVar);
658
+ this.collectPolys(literals, this.ps);
659
+ for (let index = 0; index < this.lowerStagePolys.size; index++)
660
+ this.ps.push(this.lowerStagePolys.get(index));
661
+ const maxVar = this.pm.getMaxVarOfPolys(this.ps.items);
662
+ this.elimVanishingAll(this.ps);
663
+ this.project(this.ps, maxVar);
495
664
  }
496
665
 
497
666
  private process(literals: readonly number[]) {
498
- this.lowerStagePolys = [];
667
+ this.lowerStagePolys.reset();
499
668
  const core = this.core;
500
669
  core.reset();
501
670
  for (const literal of literals) core.push(literal);
502
671
  const max = this.context.atoms.getMaxVarOfLiterals(literals);
503
672
  this.normalizeCore(core, max);
504
673
  this.simplifyCore(core, max);
505
- this.explainCore(core.literals);
674
+ this.main(core.literals);
506
675
  core.reset();
507
676
  }
508
677
 
@@ -534,13 +703,57 @@ export class Explain {
534
703
  }
535
704
  }
536
705
 
706
+ projectVariable(variable: number, literals: readonly number[], result: ScopedLiterals) {
707
+ const base = result.size;
708
+ while (true) {
709
+ let isReordered = false;
710
+ this.result = result;
711
+ try {
712
+ const kept: number[] = [];
713
+ for (const literal of literals) {
714
+ const atom = this.context.atoms.getAtom(literal);
715
+ const polynomials =
716
+ atom === null ? [] : isIneqAtom(atom) ? atom.polynomials : [atom.polynomial];
717
+ const isContaining =
718
+ (atom !== null && !isIneqAtom(atom) && atom.maxVar === variable) ||
719
+ polynomials.some((polynomial) => this.pm.getVars(polynomial).includes(variable));
720
+ if (isContaining) kept.push(literal);
721
+ else this.addLiteral(literal ^ 1);
722
+ }
723
+ this.collectPolys(kept, this.ps);
724
+ if (this.ps.size > 0) {
725
+ const maxVar = this.pm.getMaxVarOfPolys(this.ps.items);
726
+ if (maxVar !== variable) {
727
+ const renaming = Array.from({ length: this.context.getNumVars() }, (_value, index) =>
728
+ index === variable ? maxVar : index === maxVar ? variable : index,
729
+ );
730
+ this.context.reorder(renaming);
731
+ isReordered = true;
732
+ }
733
+ this.elimVanishingAll(this.ps);
734
+ this.project(this.ps, maxVar);
735
+ this.resetResult();
736
+ if (isReordered) this.context.restoreOrder();
737
+ }
738
+ break;
739
+ } catch (error) {
740
+ if (!(error instanceof AddAllCoeffsRestart)) throw error;
741
+ if (isReordered) this.context.restoreOrder();
742
+ result.shrink(base);
743
+ } finally {
744
+ this.resetResult();
745
+ }
746
+ }
747
+ for (let index = 0; index < result.size; index++) result.set(index, result.literals[index] ^ 1);
748
+ }
749
+
537
750
  computeLinearExplanation(literals: readonly number[], result: ScopedLiterals) {
538
751
  this.result = result;
539
- this.lowerStagePolys = [];
540
- const polynomials = this.collectPolys(literals);
541
752
  try {
542
- if (polynomials.length > 0)
543
- this.addCellLiterals(polynomials, this.pm.getMaxVarOfPolys(polynomials) + 1, true);
753
+ this.lowerStagePolys.reset();
754
+ this.collectPolys(literals, this.ps);
755
+ if (this.ps.size === 0) return;
756
+ this.levelwiseSingleCell(this.ps, this.pm.getMaxVarOfPolys(this.ps.items) + 1, true);
544
757
  } finally {
545
758
  this.resetResult();
546
759
  }