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,15 +1,7 @@
1
- // Ported from Z3 (src/nlsat/nlsat_solver.cpp, src/nlsat/nlsat_justification.h), MIT license, see
2
- // z3-license.txt. The nlsat search of Jovanovic and de Moura: Boolean variables first, then the
3
- // arithmetic variables in order, each a stage. A stage assigns its variable outside the intervals
4
- // that the clauses watching it exclude, and a conflict learns the explanation of the excluded
5
- // line. Only Z3's default nlsat parameters are ported: lazy 0, simplify_conflicts, reorder and
6
- // randomize on, shuffle_vars, inline_vars, minimize_conflicts and check_lemmas off, seed 0. So
7
- // nlsat_simplify and the bounds of eliminated variables, which only inline_vars makes, are not
8
- // ported. Neither are what nra never uses: Boolean variables beyond true, transcendental
9
- // constraints, check(assumptions), check_limit, retract, and set_max_var, without which
10
- // select_witness never picks the maximal value. The search counts its steps against the resource
11
- // limit, but not the memory, which Z3 also bounds by max_memory.
12
- import { SmtCanceledError } from "../../../../errors";
1
+ // Of Z3's nlsat parameters only seed and factor are ported, so nlsat_simplify and the bounds of
2
+ // eliminated variables are not. The search counts its steps against the resource limit, but not the
3
+ // memory, which Z3 also bounds by max_memory.
4
+ import { SmtInvariantError } from "../../../../errors";
13
5
  import { L_FALSE, L_TRUE, L_UNDEF } from "../lbool";
14
6
  import { type Dependency, linearize, mkJoin, mkLeaf } from "../lp/dependency";
15
7
  import { RandomGen } from "../random-gen";
@@ -19,14 +11,19 @@ import { AlgebraicManager, Anum } from "./algebraic";
19
11
  import { AtomTable, FALSE_LITERAL, ScopedLiterals, TRUE_LITERAL } from "./atoms";
20
12
  import { Evaluator } from "./evaluator";
21
13
  import { Explain } from "./explain";
22
- import type { IntervalSet } from "./interval-set";
23
- import { NULL_VAR, type Polynomial, PolynomialCache, PolynomialManager } from "./polynomial";
24
- import { type Clause, type IneqAtom, type IneqKind, isIneqAtom } from "./types";
14
+ import type { IntervalSet, IntervalSetManager } from "./interval-set";
15
+ import {
16
+ NULL_VAR,
17
+ type Polynomial,
18
+ PolynomialCache,
19
+ PolynomialManager,
20
+ PolynomialRef,
21
+ } from "./polynomial";
22
+ import { NlsatTranscendentals } from "./transcendentals";
23
+ import { type Clause, type IneqAtom, type IneqKind, isIneqAtom, type RootKind } from "./types";
25
24
 
26
- // null_bool_var: past every Boolean variable.
27
25
  const NULL_BOOL_VAR = Infinity;
28
26
 
29
- // m_restart_threshold: the conflicts between two reorderings of the variables.
30
27
  const RESTART_THRESHOLD = 10000;
31
28
 
32
29
  type Justification =
@@ -44,30 +41,18 @@ type Trail =
44
41
  | { kind: "eq"; old: IneqAtom | null };
45
42
 
46
43
  export class NlsatSolver {
47
- readonly pm = new PolynomialManager();
48
- readonly am = new AlgebraicManager();
49
- private cache = new PolynomialCache(this.pm);
44
+ readonly pm: PolynomialManager;
45
+ readonly am: AlgebraicManager;
46
+ private cache: PolynomialCache;
50
47
  private bvalues: number[] = [];
51
48
  private levels: number[] = [];
52
49
  private justifications: (Justification | null)[] = [];
53
50
  private bwatches: Clause[][] = [];
54
51
  private isDead: boolean[] = [];
55
- private atoms = new AtomTable(this.pm, this.cache, {
56
- onMk: (boolVar) => {
57
- this.bvalues[boolVar] = L_UNDEF;
58
- this.levels[boolVar] = Infinity;
59
- this.justifications[boolVar] = null;
60
- this.bwatches[boolVar] = [];
61
- this.isDead[boolVar] = false;
62
- },
63
- onDelete: (boolVar) => {
64
- this.isDead[boolVar] = true;
65
- this.bvalues[boolVar] = L_UNDEF;
66
- },
67
- });
52
+ readonly atoms: AtomTable;
68
53
  private assignment: (Anum | undefined)[] = [];
69
- private evaluator = new Evaluator(this.pm, this.am, this.assignment);
70
- private ism = this.evaluator.ism;
54
+ private evaluator: Evaluator;
55
+ private ism: IntervalSetManager;
71
56
  private clauses: Clause[] = [];
72
57
  private learned: Clause[] = [];
73
58
  private nextClauseId = 0;
@@ -75,28 +60,25 @@ export class NlsatSolver {
75
60
  private watches: Clause[][] = [];
76
61
  private infeasible: (IntervalSet | null)[] = [];
77
62
  private var2eq: (IneqAtom | null)[] = [];
78
- // perm: internal to external variables. invPerm: external to internal.
79
63
  private perm: number[] = [];
80
64
  private invPerm: number[] = [];
81
- private explain = new Explain(this.pm, this.am, this.cache, {
82
- atoms: this.atoms,
83
- sample: this.assignment,
84
- getValue: (literal) => this.value(literal),
85
- var2eq: this.var2eq,
86
- });
65
+ readonly explain: Explain;
66
+ readonly transcendentals: NlsatTranscendentals;
87
67
  private bk = 0;
88
68
  private xk = NULL_VAR;
89
69
  private scopeLevel = 0;
90
70
  private trail: Trail[] = [];
91
71
  private marks: boolean[] = [];
92
72
  private markCount = 0;
93
- private lemma = new ScopedLiterals(this.atoms);
94
- private lazyClause = new ScopedLiterals(this.atoms);
73
+ private lemma: ScopedLiterals;
74
+ private lazyClause: ScopedLiterals;
95
75
  private lemmaAssumptions: Dependency = null;
96
76
  private randomSeed = 0;
97
77
  private isReordered = false;
98
- // max_conflicts: nra sets it before each check.
78
+ private maxVar = NULL_VAR;
79
+ private nextTag = 0;
99
80
  maxConflicts = Infinity;
81
+ isReordering = true;
100
82
  readonly stats = {
101
83
  conflicts: 0,
102
84
  restarts: 0,
@@ -106,22 +88,44 @@ export class NlsatSolver {
106
88
  irrationalAssignments: 0,
107
89
  };
108
90
 
109
- // m_rlimit: the steps of the search count against the limit, and against the budget of this
110
- // solver, which Z3 sets with a scoped_rlimit on a child limit.
111
- steps = 0;
112
-
113
- constructor(
114
- private limit: ResourceLimit | null = null,
115
- private budget = Infinity,
116
- ) {
117
- // mk_true_bvar: the clause [true], whose literal the first Boolean stage assigns.
91
+ constructor(private limit: ResourceLimit) {
92
+ this.pm = new PolynomialManager(limit);
93
+ this.am = new AlgebraicManager(limit);
94
+ this.cache = new PolynomialCache(this.pm);
95
+ this.atoms = new AtomTable(this.pm, this.cache, {
96
+ onMk: (boolVar) => {
97
+ this.bvalues[boolVar] = L_UNDEF;
98
+ this.levels[boolVar] = Infinity;
99
+ this.justifications[boolVar] = null;
100
+ this.bwatches[boolVar] = [];
101
+ this.isDead[boolVar] = false;
102
+ },
103
+ onDelete: (boolVar) => {
104
+ this.isDead[boolVar] = true;
105
+ this.bvalues[boolVar] = L_UNDEF;
106
+ },
107
+ });
108
+ this.evaluator = new Evaluator(this.pm, this.am, this.assignment);
109
+ this.ism = this.evaluator.ism;
110
+ this.explain = new Explain(this.pm, this.am, this.cache, {
111
+ atoms: this.atoms,
112
+ sample: this.assignment,
113
+ getValue: (literal) => this.value(literal),
114
+ var2eq: this.var2eq,
115
+ getNumVars: () => this.isInt.length,
116
+ reorder: (permutation) => this.reorder(permutation),
117
+ restoreOrder: () => this.restoreOrder(),
118
+ });
119
+ this.transcendentals = new NlsatTranscendentals(this);
120
+ this.lemma = new ScopedLiterals(this.atoms);
121
+ this.lazyClause = new ScopedLiterals(this.atoms);
118
122
  this.mkClause([TRUE_LITERAL], false, null);
119
123
  }
120
124
 
121
- private checkpoint() {
122
- this.steps++;
123
- if ((this.limit !== null && !this.limit.inc()) || this.steps > this.budget)
124
- throw new SmtCanceledError();
125
+ updtParams(seed: number, isFactoring: boolean) {
126
+ this.randomSeed = seed;
127
+ this.ism.setSeed(seed);
128
+ this.explain.isFactoring = isFactoring;
125
129
  }
126
130
 
127
131
  mkVar(isInt: boolean) {
@@ -143,32 +147,71 @@ export class NlsatSolver {
143
147
  return this.atoms.getAtom(literal);
144
148
  }
145
149
 
146
- // mk_external_clause: an input clause, which depends on assumption when it is not null.
150
+ mkBoolVar() {
151
+ return this.atoms.mkBoolVar();
152
+ }
153
+
154
+ mkRootAtom(kind: RootKind, variable: number, index: number, polynomial: Polynomial) {
155
+ return this.atoms.mkRootAtom(kind, variable, index, polynomial);
156
+ }
157
+
158
+ getBoolValue(boolVar: number) {
159
+ return this.bvalues[boolVar];
160
+ }
161
+
162
+ vars(literal: number) {
163
+ const atom = this.atoms.getAtom(literal);
164
+ if (atom === null) return [];
165
+ if (isIneqAtom(atom))
166
+ return atom.polynomials.flatMap((polynomial) => this.pm.getVars(polynomial));
167
+ return [...this.pm.getVars(atom.polynomial), atom.maxVar];
168
+ }
169
+
170
+ getRvalues() {
171
+ return this.assignment.map((value) => (value === undefined ? undefined : this.am.copy(value)));
172
+ }
173
+
174
+ setRvalues(values: readonly (Anum | undefined)[]) {
175
+ this.setAssignment(values);
176
+ }
177
+
178
+ getBvalues(boolVars: Iterable<number>) {
179
+ const values: number[] = [];
180
+ for (const boolVar of boolVars) {
181
+ while (values.length <= boolVar) values.push(L_UNDEF);
182
+ if (this.atoms.atoms[boolVar] === null) values[boolVar] = this.bvalues[boolVar];
183
+ }
184
+ return values;
185
+ }
186
+
187
+ setBvalues(values: readonly number[]) {
188
+ for (const [boolVar, value] of values.entries())
189
+ if (value !== L_UNDEF) this.bvalues[boolVar] = value;
190
+ }
191
+
192
+ setMaxVar(variable: number) {
193
+ this.maxVar = variable;
194
+ }
195
+
196
+ getMaxVarSup() {
197
+ if (this.maxVar === NULL_VAR || this.assignment[this.maxVar] === undefined) return null;
198
+ return this.ism.queryMaxInComplement(this.infeasible[this.maxVar]);
199
+ }
200
+
147
201
  mkExternalClause(literals: readonly number[], assumption: number | null) {
148
202
  this.mkClause(literals, false, assumption === null ? null : mkLeaf(assumption));
149
203
  }
150
204
 
151
- // value(x): the model's value of x, zero when unassigned.
152
205
  getValue(variable: number) {
153
206
  return this.assignment[variable] ?? new Anum(Rational.zero);
154
207
  }
155
208
 
156
- // get_core: the assumptions of the input clauses the last conflict depends on.
157
209
  getCore() {
158
210
  return linearize([this.lemmaAssumptions]);
159
211
  }
160
212
 
161
- private getMaxVar(clause: Clause) {
162
- let result = NULL_VAR;
163
- for (const literal of clause.literals) {
164
- const atom = this.atoms.getAtom(literal);
165
- if (atom !== null && (result === NULL_VAR || atom.maxVar > result)) result = atom.maxVar;
166
- }
167
- return result;
168
- }
169
-
170
213
  private getClauseDegree(clause: Clause) {
171
- if (this.getMaxVar(clause) === NULL_VAR) return 0;
214
+ if (this.atoms.getMaxVarOfLiterals(clause.literals) === NULL_VAR) return 0;
172
215
  let max = 0;
173
216
  for (const literal of clause.literals) {
174
217
  const atom = this.atoms.getAtom(literal);
@@ -177,8 +220,6 @@ export class NlsatSolver {
177
220
  return max;
178
221
  }
179
222
 
180
- // lit_lt: Boolean literals first, then by maximal variable, degree, inequalities before
181
- // equations, and index.
182
223
  private compareLiterals(first: number, second: number) {
183
224
  const firstAtom = this.atoms.getAtom(first);
184
225
  const secondAtom = this.atoms.getAtom(second);
@@ -197,7 +238,7 @@ export class NlsatSolver {
197
238
  }
198
239
 
199
240
  private mkClause(literals: readonly number[], isLearned: boolean, assumptions: Dependency) {
200
- const clause: Clause = {
241
+ const clause = {
201
242
  id: this.nextClauseId++,
202
243
  literals: literals.length === 0 ? [FALSE_LITERAL] : [...literals],
203
244
  isLearned,
@@ -212,13 +253,13 @@ export class NlsatSolver {
212
253
  }
213
254
 
214
255
  private addClauseToWatches(clause: Clause) {
215
- const variable = this.getMaxVar(clause);
256
+ const variable = this.atoms.getMaxVarOfLiterals(clause.literals);
216
257
  if (variable !== NULL_VAR) this.watches[variable].push(clause);
217
258
  else this.bwatches[Math.max(...clause.literals.map((literal) => literal >> 1))].push(clause);
218
259
  }
219
260
 
220
261
  private delClause(clause: Clause) {
221
- const variable = this.getMaxVar(clause);
262
+ const variable = this.atoms.getMaxVarOfLiterals(clause.literals);
222
263
  const watches =
223
264
  variable !== NULL_VAR
224
265
  ? this.watches[variable]
@@ -228,8 +269,6 @@ export class NlsatSolver {
228
269
  for (const literal of clause.literals) this.atoms.decRef(literal);
229
270
  }
230
271
 
231
- // Search.
232
-
233
272
  private unassignBoolVar(boolVar: number) {
234
273
  this.bvalues[boolVar] = L_UNDEF;
235
274
  this.levels[boolVar] = Infinity;
@@ -298,8 +337,7 @@ export class NlsatSolver {
298
337
  this.setLiteralToTrue(literal, DECISION);
299
338
  }
300
339
 
301
- // value: the assigned value, else the atom's value once its maximal variable is assigned.
302
- private value(literal: number) {
340
+ value(literal: number) {
303
341
  const assigned = this.getAssignedValue(literal);
304
342
  if (assigned !== L_UNDEF) return assigned;
305
343
  const atom = this.atoms.getAtom(literal);
@@ -326,7 +364,6 @@ export class NlsatSolver {
326
364
  return true;
327
365
  }
328
366
 
329
- // R_propagate: literal is true, because with the justifications of set it is infeasible.
330
367
  private propagate(literal: number, set: IntervalSet | null, isLiteralIncluded = true) {
331
368
  const justifications = this.ism.getJustifications(set);
332
369
  const literals = [...justifications.literals];
@@ -340,8 +377,6 @@ export class NlsatSolver {
340
377
  this.infeasible[this.xk] = this.ism.mkUnion(set, old);
341
378
  }
342
379
 
343
- // updt_eq: the equation of least degree that holds for the current variable, for the
344
- // explanation to simplify with.
345
380
  private updateEq(boolVar: number, justification: Justification) {
346
381
  if (this.bvalues[boolVar] !== L_TRUE) return;
347
382
  const atom = this.atoms.atoms[boolVar];
@@ -371,10 +406,12 @@ export class NlsatSolver {
371
406
  let selectedSet: IntervalSet | null = null;
372
407
  const xkSet = this.infeasible[this.xk];
373
408
  for (const [index, literal] of clause.literals.entries()) {
374
- this.checkpoint();
409
+ this.limit.checkpoint();
375
410
  if (this.value(literal) === L_FALSE) continue;
376
411
  if (this.value(literal) === L_TRUE) return true;
377
- const atom = this.atoms.getAtom(literal)!;
412
+ const atom = this.atoms.getAtom(literal);
413
+ if (atom === null)
414
+ throw new SmtInvariantError("a literal of an arithmetic clause has no atom");
378
415
  const set = this.evaluator.infeasibleIntervals(atom, (literal & 1) === 1, clause);
379
416
  if (set === null) {
380
417
  this.propagate(literal, null);
@@ -436,9 +473,11 @@ export class NlsatSolver {
436
473
  this.xk = this.xk === NULL_VAR ? 0 : this.xk + 1;
437
474
  }
438
475
 
439
- // select_witness: a value outside the infeasible intervals, at random among the candidates.
440
476
  private selectWitness() {
441
- const witness = this.ism.pickInComplement(this.infeasible[this.xk], true);
477
+ const set = this.infeasible[this.xk];
478
+ const witness =
479
+ (this.xk === this.maxVar ? this.ism.pickMaxInComplement(set) : null) ??
480
+ this.ism.pickInComplement(set, true);
442
481
  if (!this.am.isRational(witness)) this.stats.irrationalAssignments++;
443
482
  this.assignment[this.xk] = witness;
444
483
  }
@@ -455,7 +494,7 @@ export class NlsatSolver {
455
494
  } else this.newStage();
456
495
  if (this.bk === NULL_BOOL_VAR && this.xk >= this.isInt.length) return L_TRUE;
457
496
  while (true) {
458
- this.checkpoint();
497
+ this.limit.checkpoint();
459
498
  const conflict = this.processClauses(
460
499
  this.xk === NULL_VAR ? this.bwatches[this.bk] : this.watches[this.xk],
461
500
  );
@@ -472,12 +511,10 @@ export class NlsatSolver {
472
511
  }
473
512
  }
474
513
 
475
- // gc: drops the learned clauses that took no part in a conflict since the last collection,
476
- // once they outnumber the input clauses four to one.
477
514
  private gc() {
478
515
  if (this.learned.length <= 4 * this.clauses.length) return;
479
516
  this.resetWatches();
480
- this.atoms.reinitCache();
517
+ this.atoms.reinitCache(this.clauses, this.learned);
481
518
  let kept = 0;
482
519
  for (const [index, clause] of this.learned.entries()) {
483
520
  if (index - kept < this.clauses.length && clause.literals.length > 1 && !clause.isActive)
@@ -498,7 +535,6 @@ export class NlsatSolver {
498
535
  this.xk = NULL_VAR;
499
536
  }
500
537
 
501
- // do_reorder
502
538
  private reorderAtRestart() {
503
539
  this.undoToBase();
504
540
  this.stats.restarts++;
@@ -507,7 +543,6 @@ export class NlsatSolver {
507
543
  this.applyReorder();
508
544
  }
509
545
 
510
- // try_reorder
511
546
  private tryReorder() {
512
547
  this.gc();
513
548
  if (this.stats.restarts % 10 !== 0) return;
@@ -515,9 +550,6 @@ export class NlsatSolver {
515
550
  this.applyReorder();
516
551
  }
517
552
 
518
- // search_check: the search, again after each model that gives an integer variable a fraction,
519
- // with the lemma that the variable lies outside the open interval between the integers around
520
- // its value.
521
553
  private searchCheck() {
522
554
  this.stats.conflicts = 0;
523
555
  this.stats.restarts = 0;
@@ -542,15 +574,21 @@ export class NlsatSolver {
542
574
  }
543
575
  bounds.push([variable, lower]);
544
576
  }
545
- if (bounds.length === 0) return result;
577
+ if (bounds.length === 0) {
578
+ if (this.transcendentals.isEmpty || !this.transcendentals.refine()) return result;
579
+ this.initSearch();
580
+ continue;
581
+ }
546
582
  this.initSearch();
547
583
  for (const bound of bounds) {
584
+ const p = new PolynomialRef(this.pm);
548
585
  this.lemma.reset();
549
- const below = this.pm.mkLinear([1n], [bound[0]], -bound[1].num);
550
- this.lemma.push(this.mkIneqLiteral("GT", [below], [false]) ^ 1);
551
- const above = this.pm.mkLinear([1n], [bound[0]], -bound[1].num - 1n);
552
- this.lemma.push(this.mkIneqLiteral("LT", [above], [false]) ^ 1);
586
+ p.set(this.pm.mkLinear([1n], [bound[0]], -bound[1].num));
587
+ this.lemma.push(this.mkIneqLiteral("GT", [p.get()], [false]) ^ 1);
588
+ p.set(this.pm.mkLinear([1n], [bound[0]], -bound[1].num - 1n));
589
+ this.lemma.push(this.mkIneqLiteral("LT", [p.get()], [false]) ^ 1);
553
590
  this.mkClause(this.lemma.literals, true, null);
591
+ p.reset();
554
592
  }
555
593
  }
556
594
  }
@@ -563,8 +601,6 @@ export class NlsatSolver {
563
601
  this.assignment.length = 0;
564
602
  }
565
603
 
566
- // check: satisfiable, unsatisfiable or unknown once maxConflicts conflicts passed. The variables
567
- // are reordered for the search and restored after it.
568
604
  check() {
569
605
  this.initSearch();
570
606
  this.explain.isFullDimensional = this.clauses.every((clause) =>
@@ -578,6 +614,32 @@ export class NlsatSolver {
578
614
  return result;
579
615
  }
580
616
 
617
+ // Keeps in assumptions the ones in the core when unsatisfiable, and none otherwise.
618
+ checkAssumptions(assumptions: number[]) {
619
+ const tags = assumptions.map((literal) => {
620
+ const tag = --this.nextTag;
621
+ this.mkExternalClause([literal], tag);
622
+ return tag;
623
+ });
624
+ const result = this.check();
625
+ const core: number[] = [];
626
+ if (result === L_FALSE)
627
+ for (const tag of this.getCore()) {
628
+ const index = tags.indexOf(tag);
629
+ if (index !== -1) core.push(assumptions[index]);
630
+ }
631
+ const isKept = (clause: Clause) => {
632
+ const isFound = linearize([clause.assumptions]).some((tag) => tags.includes(tag));
633
+ if (isFound) this.delClause(clause);
634
+ return !isFound;
635
+ };
636
+ this.clauses = this.clauses.filter(isKept);
637
+ this.learned = this.learned.filter(isKept);
638
+ assumptions.length = 0;
639
+ assumptions.push(...core);
640
+ return result;
641
+ }
642
+
581
643
  private isFullDimensional(literal: number) {
582
644
  const atom = this.atoms.getAtom(literal);
583
645
  if (atom === null) return true;
@@ -593,7 +655,6 @@ export class NlsatSolver {
593
655
  }
594
656
  }
595
657
 
596
- // sort_clauses_by_degree
597
658
  private sortClausesByDegree(clauses: Clause[]) {
598
659
  if (clauses.length <= 1) return;
599
660
  const degrees = clauses.map((clause) => this.getClauseDegree(clause));
@@ -604,10 +665,112 @@ export class NlsatSolver {
604
665
  for (let index = 0; index < sorted.length; index++) clauses[index] = sorted[index];
605
666
  }
606
667
 
607
- // check(rvalues, clause): the assignment's verdict on the clauses. A falsified clause gives the
608
- // literal of least degree among the falsified clauses, and the lemma of the linear cell around
609
- // the assignment in which that literal stays false. Like Z3, only that case restores the
610
- // assignment.
668
+ private projectModel(cube: ScopedLiterals) {
669
+ const seen = new Set<number>();
670
+ for (const clause of this.clauses) {
671
+ this.limit.checkpoint();
672
+ const witness = clause.literals.find((literal) => this.value(literal) === L_TRUE);
673
+ if (witness === undefined) throw new SmtInvariantError("nlsat's model falsifies a clause");
674
+ if (this.atoms.getAtom(witness) === null || seen.has(witness >> 1)) continue;
675
+ seen.add(witness >> 1);
676
+ cube.push(witness);
677
+ }
678
+ // Strict sector bounds keep every point of the projection extensible.
679
+ this.explain.isFullDimensional = false;
680
+ const projected = new ScopedLiterals(this.atoms);
681
+ try {
682
+ for (let variable = this.isInt.length - 1; variable >= 1 && cube.size > 0; variable--) {
683
+ this.limit.checkpoint();
684
+ projected.reset();
685
+ this.explain.projectVariable(variable, cube.literals, projected);
686
+ [cube.literals, projected.literals] = [projected.literals, cube.literals];
687
+ }
688
+ } finally {
689
+ projected.reset();
690
+ }
691
+ }
692
+
693
+ private getCubeSup(cube: ScopedLiterals) {
694
+ let infeasible: IntervalSet | null = null;
695
+ for (const literal of cube.literals) {
696
+ const excluded = this.evaluator.infeasibleIntervals(
697
+ this.atoms.getAtom(literal)!,
698
+ (literal & 1) === 1,
699
+ null,
700
+ );
701
+ infeasible = this.ism.mkUnion(infeasible, excluded);
702
+ }
703
+ if (this.ism.isFull(infeasible))
704
+ throw new SmtInvariantError("nlsat's model projection is inconsistent");
705
+ return this.ism.queryMaxInComplement(infeasible);
706
+ }
707
+
708
+ checkLimit(variable: number, bound: Anum | null) {
709
+ if (variable !== 0 || this.invPerm[0] !== 0)
710
+ throw new SmtInvariantError("nlsat checks the limit of the first variable");
711
+ if (this.isInt.some(Boolean)) return L_UNDEF;
712
+ const limit = bound === null ? null : this.am.copy(bound);
713
+ const savedMaxVar = this.maxVar;
714
+ this.maxVar = variable;
715
+ const tag = --this.nextTag;
716
+ try {
717
+ if (limit !== null) {
718
+ const isRational = this.am.isRational(limit);
719
+ const p = new PolynomialRef(this.pm);
720
+ p.set(this.pm.toPolynomial(this.am.getPolynomial(limit), variable));
721
+ const upper = isRational
722
+ ? this.mkIneqLiteral("LT", [p.get()], [false])
723
+ : 2 * this.mkRootAtom("ROOT_LT", variable, this.am.getRootIndex(limit), p.get());
724
+ this.mkExternalClause([upper], tag);
725
+ p.reset();
726
+ }
727
+ while (true) {
728
+ this.limit.checkpoint();
729
+ const status = this.check();
730
+ if (status !== L_TRUE) return status;
731
+ const cube = new ScopedLiterals(this.atoms);
732
+ try {
733
+ this.projectModel(cube);
734
+ const sup = this.getCubeSup(cube);
735
+ if (
736
+ limit === null
737
+ ? sup === null
738
+ : sup !== null && !sup.isAttained && this.am.compare(sup.sup, limit) === 0
739
+ )
740
+ return L_TRUE;
741
+ this.mkExternalClause(
742
+ cube.literals.map((literal) => literal ^ 1),
743
+ tag,
744
+ );
745
+ } finally {
746
+ cube.reset();
747
+ }
748
+ }
749
+ } finally {
750
+ this.retract(tag);
751
+ this.maxVar = savedMaxVar;
752
+ }
753
+ }
754
+
755
+ retract(tag: number, maxLemmas = Infinity) {
756
+ this.initSearch();
757
+ this.explain.reset();
758
+ this.lemma.reset();
759
+ this.lazyClause.reset();
760
+ this.lemmaAssumptions = null;
761
+ const isKept = (clause: Clause) => {
762
+ const isFound = linearize([clause.assumptions]).includes(tag);
763
+ if (isFound) this.delClause(clause);
764
+ return !isFound;
765
+ };
766
+ this.clauses = this.clauses.filter(isKept);
767
+ this.learned = this.learned.filter(isKept);
768
+ if (this.learned.length <= maxLemmas) return;
769
+ this.learned.sort((first, second) => first.literals.length - second.literals.length);
770
+ for (const clause of this.learned.splice(maxLemmas).reverse()) this.delClause(clause);
771
+ }
772
+
773
+ // Like Z3, only a falsified clause restores the assignment.
611
774
  checkAssignment(values: readonly (Anum | undefined)[]) {
612
775
  const saved = this.assignment.map((value) =>
613
776
  value === undefined ? undefined : this.am.copy(value),
@@ -644,13 +807,11 @@ export class NlsatSolver {
644
807
  this.assignment[variable] = value === undefined ? undefined : this.am.copy(value);
645
808
  }
646
809
 
647
- // Conflict resolution.
648
-
649
810
  private processAntecedent(antecedent: number) {
650
- this.checkpoint();
811
+ this.limit.checkpoint();
651
812
  const boolVar = antecedent >> 1;
652
813
  if (this.getAssignedValue(antecedent) === L_UNDEF) {
653
- this.checkpoint();
814
+ this.limit.checkpoint();
654
815
  if (!this.marks[boolVar]) {
655
816
  this.marks[boolVar] = true;
656
817
  this.lemma.push(antecedent);
@@ -674,13 +835,11 @@ export class NlsatSolver {
674
835
  this.lemmaAssumptions = mkJoin(clause.assumptions, this.lemmaAssumptions);
675
836
  }
676
837
 
677
- // resolve_lazy_justification: the explanation of the excluded line, with the negations of the
678
- // literals that excluded it, as the clause to resolve with.
679
838
  private resolveLazyJustification(boolVar: number, literals: number[], clauses: Clause[]) {
680
839
  this.lazyClause.reset();
681
840
  this.explain.computeConflictExplanation(literals, this.lazyClause);
682
841
  for (const literal of literals) this.lazyClause.push(literal ^ 1);
683
- this.checkpoint();
842
+ this.limit.checkpoint();
684
843
  this.resolveLiterals(boolVar, this.lazyClause.literals);
685
844
  for (const clause of clauses)
686
845
  this.lemmaAssumptions = mkJoin(clause.assumptions, this.lemmaAssumptions);
@@ -690,7 +849,6 @@ export class NlsatSolver {
690
849
  for (const literal of this.lemma.literals) this.marks[literal >> 1] = false;
691
850
  }
692
851
 
693
- // scoped_reset_marks
694
852
  private releaseMarks() {
695
853
  if (this.markCount > 0) {
696
854
  this.markCount = 0;
@@ -698,7 +856,6 @@ export class NlsatSolver {
698
856
  } else this.resetMarks();
699
857
  }
700
858
 
701
- // resolve: learns a lemma from the conflict and backjumps. False when the lemma is empty.
702
859
  private resolve(conflict: Clause) {
703
860
  let conflictClause = conflict;
704
861
  while (true) {
@@ -717,15 +874,13 @@ export class NlsatSolver {
717
874
  }
718
875
  }
719
876
 
720
- // The body of resolve for one conflict: null for the empty lemma, true when the conflict clause
721
- // itself is the lemma and now propagates, else the learned clause.
722
877
  private learn(conflict: Clause): Clause | true | null {
723
878
  this.resolveClause(-1, conflict);
724
879
  let top = this.trail.length;
725
880
  let isDecision = false;
726
881
  while (true) {
727
882
  while (this.markCount > 0) {
728
- this.checkpoint();
883
+ this.limit.checkpoint();
729
884
  const entry = this.trail[top - 1];
730
885
  if (entry.kind === "assignment" && this.marks[entry.boolVar]) {
731
886
  const boolVar = entry.boolVar;
@@ -749,7 +904,6 @@ export class NlsatSolver {
749
904
  for (const literal of literals)
750
905
  if (this.getAssignedValue(literal) === L_FALSE)
751
906
  maxLevel = Math.max(maxLevel, this.levels[literal >> 1]);
752
- // remove_literals_from_lvl
753
907
  let kept = 0;
754
908
  for (const literal of literals) {
755
909
  const boolVar = literal >> 1;
@@ -771,18 +925,13 @@ export class NlsatSolver {
771
925
  this.resetMarks();
772
926
  const literals = this.lemma.literals;
773
927
  if (!isDecision) {
774
- let maxVar = NULL_VAR;
775
- for (const literal of literals) {
776
- const variable = this.atoms.getMaxVar(literal);
777
- if (variable !== NULL_VAR && (maxVar === NULL_VAR || variable > maxVar)) maxVar = variable;
778
- }
779
- this.undoUntilStage(maxVar);
928
+ this.undoUntilStage(this.atoms.getMaxVarOfLiterals(literals));
780
929
  return this.mkClause(literals, true, this.lemmaAssumptions);
781
930
  }
782
931
  if (literals.every((literal) => this.atoms.getAtom(literal) === null)) {
783
932
  const boolVar = literals[literals.length - 1] >> 1;
784
933
  this.undoUntil(() => this.bvalues[boolVar] !== L_UNDEF);
785
- } else this.undoUntilLevel(this.findNewLevel(literals));
934
+ } else this.undoUntilLevel(this.findNewLevelArithLemma(literals));
786
935
  if (
787
936
  literals.length === conflict.literals.length &&
788
937
  literals.every((literal, index) => literal === conflict.literals[index])
@@ -793,9 +942,7 @@ export class NlsatSolver {
793
942
  return this.mkClause(literals, true, this.lemmaAssumptions);
794
943
  }
795
944
 
796
- // find_new_level_arith_lemma: the highest level of a literal of the current stage other than the
797
- // last, else the level below the current one.
798
- private findNewLevel(literals: readonly number[]) {
945
+ private findNewLevelArithLemma(literals: readonly number[]) {
799
946
  let level = -1;
800
947
  for (const literal of literals.slice(0, -1))
801
948
  if (this.atoms.getMaxVar(literal) === this.xk)
@@ -803,17 +950,21 @@ export class NlsatSolver {
803
950
  return level === -1 ? this.scopeLevel - 1 : level;
804
951
  }
805
952
 
806
- // Variable order.
953
+ private isRootLiteral(literal: number) {
954
+ const atom = this.atoms.getAtom(literal);
955
+ return atom !== null && !isIneqAtom(atom);
956
+ }
807
957
 
808
958
  private canReorder() {
809
- return [...this.learned, ...this.clauses].every((clause) =>
810
- clause.literals.every(
811
- (literal) => this.atoms.getAtom(literal)?.kind.startsWith("ROOT") !== true,
812
- ),
959
+ return (
960
+ this.isReordering &&
961
+ this.maxVar === NULL_VAR &&
962
+ [...this.learned, ...this.clauses].every((clause) =>
963
+ clause.literals.every((literal) => !this.isRootLiteral(literal)),
964
+ )
813
965
  );
814
966
  }
815
967
 
816
- // apply_reorder
817
968
  private applyReorder() {
818
969
  this.isReordered = false;
819
970
  if (!this.canReorder()) return;
@@ -821,7 +972,6 @@ export class NlsatSolver {
821
972
  this.isReordered = true;
822
973
  }
823
974
 
824
- // heuristic_reorder: higher maximal degree first, then more occurrences, then a random order.
825
975
  private reorderHeuristically() {
826
976
  const count = this.isInt.length;
827
977
  const maxDegrees = Array.from({ length: count }, () => 0);
@@ -840,7 +990,6 @@ export class NlsatSolver {
840
990
  if (isIneqAtom(atom)) atom.polynomials.forEach(collect);
841
991
  else collect(atom.polynomial);
842
992
  }
843
- // init_shuffle
844
993
  const shuffle = Array.from({ length: count }, (_value, index) => index);
845
994
  const random = new RandomGen(++this.randomSeed);
846
995
  for (let index = count; index-- > 0;) {
@@ -858,17 +1007,14 @@ export class NlsatSolver {
858
1007
  this.reorder(permutation);
859
1008
  }
860
1009
 
861
- // reorder: renames each variable x to permutation[x], in the polynomials, the assignment and
862
- // the watches.
863
- private reorder(permutation: readonly number[]) {
1010
+ reorder(permutation: readonly number[]) {
864
1011
  let kept = 0;
865
1012
  for (const clause of this.learned) {
866
- if (clause.literals.some((literal) => this.atoms.getAtom(literal)?.kind.startsWith("ROOT")))
867
- this.delClause(clause);
1013
+ if (clause.literals.some((literal) => this.isRootLiteral(literal))) this.delClause(clause);
868
1014
  else this.learned[kept++] = clause;
869
1015
  }
870
1016
  this.learned.length = kept;
871
- this.atoms.reinitCache();
1017
+ this.atoms.reinitCache(this.clauses, this.learned);
872
1018
  this.resetWatches();
873
1019
  const assignment: (Anum | undefined)[] = [];
874
1020
  for (const [variable, value] of this.assignment.entries())
@@ -878,22 +1024,17 @@ export class NlsatSolver {
878
1024
  const invPerm = this.invPerm.map((variable) => permutation[variable]);
879
1025
  for (const [external, internal] of invPerm.entries()) this.perm[internal] = external;
880
1026
  const isInt = [...this.isInt];
881
- for (const [variable, flag] of isInt.entries()) this.isInt[permutation[variable]] = flag;
1027
+ for (const [variable, isIntVariable] of isInt.entries())
1028
+ this.isInt[permutation[variable]] = isIntVariable;
882
1029
  this.invPerm = invPerm;
883
- const polynomials = new Set<Polynomial>();
884
- for (const atom of this.atoms.atoms) {
885
- if (atom === null || atom === undefined) continue;
886
- if (isIneqAtom(atom)) for (const polynomial of atom.polynomials) polynomials.add(polynomial);
887
- else polynomials.add(atom.polynomial);
888
- }
889
- this.pm.rename(permutation, polynomials);
890
- this.atoms.reinitCache();
1030
+ this.pm.rename(permutation);
1031
+ this.transcendentals.rename(permutation);
1032
+ this.atoms.reinitCache(this.clauses, this.learned);
891
1033
  this.setAssignment(assignment);
892
1034
  this.reattachArithClauses(this.clauses);
893
1035
  this.reattachArithClauses(this.learned);
894
1036
  }
895
1037
 
896
- // restore_order
897
1038
  restoreOrder() {
898
1039
  this.reorder([...this.perm]);
899
1040
  }
@@ -904,7 +1045,7 @@ export class NlsatSolver {
904
1045
 
905
1046
  private reattachArithClauses(clauses: readonly Clause[]) {
906
1047
  for (const clause of clauses) {
907
- const variable = this.getMaxVar(clause);
1048
+ const variable = this.atoms.getMaxVarOfLiterals(clause.literals);
908
1049
  if (variable !== NULL_VAR) this.watches[variable].push(clause);
909
1050
  }
910
1051
  }