tla-ts 0.0.9 → 0.0.10-dev.06b481ee0

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