tla-ts 0.0.10-dev.63a6693bd → 0.0.10-dev.7a3bb1545

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 (538) hide show
  1. package/README.md +2 -1
  2. package/dist/compile.cjs +3 -3
  3. package/dist/compile.js +1 -1
  4. package/dist/deciders.cjs +41 -37
  5. package/dist/deciders.js +58 -54
  6. package/dist/index.cjs +1 -1
  7. package/dist/index.d.cts +4 -1
  8. package/dist/index.d.ts +4 -1
  9. package/dist/index.js +1 -1
  10. package/dist/parallel-worker.cjs +1 -1
  11. package/dist/parallel-worker.js +1 -1
  12. package/dist/prove-worker.cjs +1 -1
  13. package/dist/prove-worker.js +1 -1
  14. package/dist/prove.cjs +2682 -426
  15. package/dist/prove.js +2679 -423
  16. package/dist/run.cjs +43 -42
  17. package/dist/run.js +45 -44
  18. package/dist/tlapm.cjs +1 -1
  19. package/dist/tlapm.js +2 -2
  20. package/dist/transfer.cjs +43 -40
  21. package/dist/transfer.js +43 -40
  22. package/dist/worker.cjs +7 -7
  23. package/dist/worker.js +7 -7
  24. package/package.json +1 -1
  25. package/src/ast.ts +3 -3
  26. package/src/bags.ts +46 -28
  27. package/src/check-trace.ts +2 -16
  28. package/src/check.ts +336 -88
  29. package/src/cli/runtime-invariants.ts +20 -56
  30. package/src/cli/tlapm.ts +424 -62
  31. package/src/cli/tlc-arguments.ts +2 -2
  32. package/src/cli/tlc-output.ts +4 -5
  33. package/src/cli/tlc-usage.ts +0 -1
  34. package/src/cli/tlc.ts +26 -7
  35. package/src/dependencies.ts +23 -2
  36. package/src/dfid.ts +9 -2
  37. package/src/environment.ts +27 -5
  38. package/src/errors.ts +30 -3
  39. package/src/evaluate.ts +9 -3
  40. package/src/exit-codes.ts +5 -2
  41. package/src/instances.ts +1 -1
  42. package/src/levels.ts +3 -2
  43. package/src/lexer.ts +5 -3
  44. package/src/liveness-checker.ts +572 -204
  45. package/src/liveness.ts +47 -32
  46. package/src/obligations/action.ts +10 -6
  47. package/src/obligations/anonymize.ts +33 -14
  48. package/src/obligations/enabled-axioms.ts +218 -0
  49. package/src/obligations/equality.ts +1 -3
  50. package/src/obligations/expression.ts +18 -6
  51. package/src/obligations/format.ts +0 -2
  52. package/src/obligations/generate.ts +22 -17
  53. package/src/obligations/index.ts +36 -6
  54. package/src/obligations/levels.ts +24 -11
  55. package/src/obligations/module.ts +1 -3
  56. package/src/obligations/normalize.ts +24 -13
  57. package/src/obligations/operators.ts +0 -2
  58. package/src/obligations/pragma.ts +53 -16
  59. package/src/obligations/printer.ts +43 -13
  60. package/src/obligations/proof.ts +3 -2
  61. package/src/obligations/regroup.ts +0 -2
  62. package/src/obligations/simplify.ts +17 -7
  63. package/src/obligations/source.ts +71 -17
  64. package/src/obligations/subexpression.ts +45 -18
  65. package/src/obligations/substitution.ts +1 -3
  66. package/src/obligations/temporal.ts +0 -2
  67. package/src/obligations/tuples.ts +0 -2
  68. package/src/parallel-worker.ts +8 -2
  69. package/src/parallel.ts +7 -2
  70. package/src/parser.ts +633 -186
  71. package/src/pretty-print.ts +1 -1
  72. package/src/prover/deciders.ts +11 -8
  73. package/src/prover/isabelle/decide.ts +3 -25
  74. package/src/prover/isabelle/encode.ts +71 -41
  75. package/src/prover/isabelle/isar/attrib.ts +250 -0
  76. package/src/prover/isabelle/isar/context.ts +335 -0
  77. package/src/prover/isabelle/isar/induct.ts +382 -0
  78. package/src/prover/isabelle/isar/inner-syntax.ts +149 -3
  79. package/src/prover/isabelle/isar/method.ts +506 -198
  80. package/src/prover/isabelle/isar/proof.ts +570 -14
  81. package/src/prover/isabelle/isar/rule-cases.ts +226 -0
  82. package/src/prover/isabelle/isar/theory.ts +479 -69
  83. package/src/prover/isabelle/isar/toplevel.ts +331 -0
  84. package/src/prover/isabelle/isar/type-check.ts +83 -8
  85. package/src/prover/isabelle/provers/blast/blast.ts +0 -2
  86. package/src/prover/isabelle/provers/blast/branch.ts +0 -2
  87. package/src/prover/isabelle/provers/blast/prove.ts +0 -2
  88. package/src/prover/isabelle/provers/blast/rules.ts +0 -2
  89. package/src/prover/isabelle/provers/blast/state.ts +0 -2
  90. package/src/prover/isabelle/provers/blast/term.ts +0 -2
  91. package/src/prover/isabelle/provers/clasimp.ts +1 -3
  92. package/src/prover/isabelle/provers/classical.ts +45 -20
  93. package/src/prover/isabelle/provers/hypsubst.ts +2 -4
  94. package/src/prover/isabelle/pure/bicompose.ts +0 -2
  95. package/src/prover/isabelle/pure/consts.ts +0 -2
  96. package/src/prover/isabelle/pure/conv.ts +0 -2
  97. package/src/prover/isabelle/pure/drule.ts +63 -4
  98. package/src/prover/isabelle/pure/envir.ts +0 -2
  99. package/src/prover/isabelle/pure/goal.ts +1 -3
  100. package/src/prover/isabelle/pure/logic.ts +0 -2
  101. package/src/prover/isabelle/pure/name.ts +0 -2
  102. package/src/prover/isabelle/pure/net.ts +0 -2
  103. package/src/prover/isabelle/pure/object-logic.ts +13 -7
  104. package/src/prover/isabelle/pure/pattern.ts +0 -2
  105. package/src/prover/isabelle/pure/raw-simplifier.ts +0 -2
  106. package/src/prover/isabelle/pure/rewriter.ts +1 -8
  107. package/src/prover/isabelle/pure/search.ts +0 -2
  108. package/src/prover/isabelle/pure/seq.ts +0 -2
  109. package/src/prover/isabelle/pure/simplifier.ts +26 -7
  110. package/src/prover/isabelle/pure/table.ts +0 -2
  111. package/src/prover/isabelle/pure/tactic.ts +0 -2
  112. package/src/prover/isabelle/pure/tactical.ts +0 -2
  113. package/src/prover/isabelle/pure/term-ord.ts +0 -2
  114. package/src/prover/isabelle/pure/term.ts +0 -2
  115. package/src/prover/isabelle/pure/thm.ts +0 -2
  116. package/src/prover/isabelle/pure/type.ts +0 -2
  117. package/src/prover/isabelle/pure/unify.ts +0 -2
  118. package/src/prover/isabelle/pure/variable.ts +0 -2
  119. package/src/prover/isabelle/tla/classical-setup.ts +1 -2
  120. package/src/prover/isabelle/tla/context.ts +51 -9
  121. package/src/prover/isabelle/tla/logic-data.ts +1 -1
  122. package/src/prover/isabelle/tla/logic.ts +40 -1
  123. package/src/prover/isabelle/tla/simpdata.ts +0 -2
  124. package/src/prover/isabelle/tools/intuitionistic.ts +28 -12
  125. package/src/prover/ocaml.ts +4 -1
  126. package/src/prover/prep/action.ts +19 -12
  127. package/src/prover/prep/enabled-axioms.ts +11 -2
  128. package/src/prover/prep/methods.ts +159 -50
  129. package/src/prover/prep/normalize.ts +38 -9
  130. package/src/prover/prove.ts +343 -65
  131. package/src/prover/ptl/decide.ts +95 -50
  132. package/src/prover/ptl/encode.ts +2 -3
  133. package/src/prover/ptl/tableau.ts +28 -2
  134. package/src/prover/smt/arithmetic.ts +310 -0
  135. package/src/prover/smt/axioms.ts +12 -8
  136. package/src/prover/smt/context.ts +42 -6
  137. package/src/prover/smt/data.ts +191 -84
  138. package/src/prover/smt/encode.ts +122 -43
  139. package/src/prover/smt/extensionality.ts +5 -3
  140. package/src/prover/smt/flatten.ts +4 -6
  141. package/src/prover/smt/format.ts +28 -4
  142. package/src/prover/smt/instances.ts +7 -1
  143. package/src/prover/smt/layout.ts +91 -0
  144. package/src/prover/smt/rewrite.ts +483 -116
  145. package/src/prover/smt/simplify.ts +441 -0
  146. package/src/prover/smt/solver/ackermannize-bv-tactic.ts +61 -0
  147. package/src/prover/smt/solver/ackr-helper.ts +179 -0
  148. package/src/prover/smt/solver/ackr-model-converter.ts +105 -0
  149. package/src/prover/smt/solver/act-cache.ts +0 -1
  150. package/src/prover/smt/solver/add-bounds-tactic.ts +59 -0
  151. package/src/prover/smt/solver/aig-tactic.ts +52 -0
  152. package/src/prover/smt/solver/aig.ts +889 -0
  153. package/src/prover/smt/solver/arith-rewriter.ts +613 -6
  154. package/src/prover/smt/solver/arith-terms.ts +121 -0
  155. package/src/prover/smt/solver/array-decl-plugin.ts +175 -0
  156. package/src/prover/smt/solver/array-rewriter.ts +309 -0
  157. package/src/prover/smt/solver/asserted-formulas.ts +93 -15
  158. package/src/prover/smt/solver/ast-lt.ts +165 -11
  159. package/src/prover/smt/solver/ast-util.ts +160 -2
  160. package/src/prover/smt/solver/ast.ts +1448 -41
  161. package/src/prover/smt/solver/auf-solver.ts +0 -1
  162. package/src/prover/smt/solver/bit-blast-tactic.ts +582 -0
  163. package/src/prover/smt/solver/bit-blaster.ts +871 -0
  164. package/src/prover/smt/solver/bound-manager.ts +196 -0
  165. package/src/prover/smt/solver/bound-simplifier.ts +600 -0
  166. package/src/prover/smt/solver/bv-bound-chk.ts +492 -0
  167. package/src/prover/smt/solver/bv-decl-plugin.ts +338 -0
  168. package/src/prover/smt/solver/bv-divrem-bounds.ts +95 -0
  169. package/src/prover/smt/solver/bv-rewriter.ts +1901 -0
  170. package/src/prover/smt/solver/bv1-blast.ts +214 -0
  171. package/src/prover/smt/solver/bv2fpa-converter.ts +174 -0
  172. package/src/prover/smt/solver/bv2int-rewriter.ts +544 -0
  173. package/src/prover/smt/solver/bv2real-rewriter.ts +533 -0
  174. package/src/prover/smt/solver/card2bv.ts +109 -0
  175. package/src/prover/smt/solver/case-split-queue.ts +0 -2
  176. package/src/prover/smt/solver/cg-table.ts +39 -25
  177. package/src/prover/smt/solver/check-logic.ts +330 -0
  178. package/src/prover/smt/solver/clause.ts +0 -1
  179. package/src/prover/smt/solver/cofactor-elim-term-ite.ts +278 -0
  180. package/src/prover/smt/solver/conflict-resolution.ts +78 -2
  181. package/src/prover/smt/solver/context.ts +533 -114
  182. package/src/prover/smt/solver/ctx-simplify.ts +21 -12
  183. package/src/prover/smt/solver/ctx-solver-simplify.ts +122 -0
  184. package/src/prover/smt/solver/datatype-decl-plugin.ts +572 -0
  185. package/src/prover/smt/solver/datatype-rewriter.ts +82 -0
  186. package/src/prover/smt/solver/demodulator.ts +786 -0
  187. package/src/prover/smt/solver/dependent-expr-state.ts +81 -0
  188. package/src/prover/smt/solver/der.ts +38 -10
  189. package/src/prover/smt/solver/diff-neq.ts +205 -0
  190. package/src/prover/smt/solver/distribute-forall.ts +57 -0
  191. package/src/prover/smt/solver/dom-simplify.ts +511 -0
  192. package/src/prover/smt/solver/dt2bv-tactic.ts +260 -0
  193. package/src/prover/smt/solver/dyn-ack.ts +0 -1
  194. package/src/prover/smt/solver/e-matching.ts +6 -7
  195. package/src/prover/smt/solver/elim-small-bv-tactic.ts +129 -0
  196. package/src/prover/smt/solver/elim-uncnstr.ts +542 -0
  197. package/src/prover/smt/solver/enode.ts +100 -3
  198. package/src/prover/smt/solver/eq2bv-tactic.ts +218 -0
  199. package/src/prover/smt/solver/euf/arith-axioms.ts +403 -0
  200. package/src/prover/smt/solver/euf/arith-internalize.ts +653 -0
  201. package/src/prover/smt/solver/euf/arith-solver.ts +889 -0
  202. package/src/prover/smt/solver/euf/array-axioms.ts +527 -0
  203. package/src/prover/smt/solver/euf/array-internalize.ts +428 -0
  204. package/src/prover/smt/solver/euf/array-solver.ts +306 -0
  205. package/src/prover/smt/solver/euf/bv-ackerman.ts +162 -0
  206. package/src/prover/smt/solver/euf/bv-internalize.ts +748 -0
  207. package/src/prover/smt/solver/euf/bv-solver.ts +449 -0
  208. package/src/prover/smt/solver/euf/dt-solver.ts +618 -0
  209. package/src/prover/smt/solver/euf/egraph.ts +901 -0
  210. package/src/prover/smt/solver/euf/euf-solver.ts +1204 -0
  211. package/src/prover/smt/solver/euf/fpa-solver.ts +317 -0
  212. package/src/prover/smt/solver/euf/mam.ts +1046 -0
  213. package/src/prover/smt/solver/euf/q-ematch.ts +829 -0
  214. package/src/prover/smt/solver/euf/q-mbi.ts +587 -0
  215. package/src/prover/smt/solver/euf/q-model-fixer.ts +296 -0
  216. package/src/prover/smt/solver/euf/q-solver.ts +361 -0
  217. package/src/prover/smt/solver/euf/th-solver.ts +328 -0
  218. package/src/prover/smt/solver/euf/th-solvers.ts +30 -0
  219. package/src/prover/smt/solver/expr-ref.ts +0 -1
  220. package/src/prover/smt/solver/expr-safe-replace.ts +26 -2
  221. package/src/prover/smt/solver/expr2polynomial.ts +271 -0
  222. package/src/prover/smt/solver/factor.ts +163 -0
  223. package/src/prover/smt/solver/fd-solver.ts +267 -0
  224. package/src/prover/smt/solver/fingerprints.ts +15 -15
  225. package/src/prover/smt/solver/fix-dl-var.ts +147 -0
  226. package/src/prover/smt/solver/flat-literals.ts +0 -1
  227. package/src/prover/smt/solver/fm-tactic.ts +884 -0
  228. package/src/prover/smt/solver/fpa-decl-plugin.ts +618 -0
  229. package/src/prover/smt/solver/fpa-rewriter.ts +639 -0
  230. package/src/prover/smt/solver/fpa2bv-converter.ts +2251 -0
  231. package/src/prover/smt/solver/fpa2bv-rewriter.ts +348 -0
  232. package/src/prover/smt/solver/fpa2bv-tactic.ts +73 -0
  233. package/src/prover/smt/solver/goal.ts +177 -15
  234. package/src/prover/smt/solver/goal2nlsat.ts +216 -0
  235. package/src/prover/smt/solver/guard-set.ts +219 -0
  236. package/src/prover/smt/solver/hash.ts +0 -1
  237. package/src/prover/smt/solver/hashtable.ts +30 -16
  238. package/src/prover/smt/solver/inf-eps.ts +63 -0
  239. package/src/prover/smt/solver/inj-axiom.ts +101 -0
  240. package/src/prover/smt/solver/internalizer.ts +109 -36
  241. package/src/prover/smt/solver/lackr.ts +381 -0
  242. package/src/prover/smt/solver/lbool.ts +0 -1
  243. package/src/prover/smt/solver/lia2card.ts +268 -0
  244. package/src/prover/smt/solver/lia2pb.ts +154 -0
  245. package/src/prover/smt/solver/literal.ts +0 -1
  246. package/src/prover/smt/solver/logic-tactics.ts +345 -0
  247. package/src/prover/smt/solver/lp/bound-propagator.ts +0 -1
  248. package/src/prover/smt/solver/lp/constraints.ts +0 -1
  249. package/src/prover/smt/solver/lp/containers.ts +7 -2
  250. package/src/prover/smt/solver/lp/core-solver.ts +18 -3
  251. package/src/prover/smt/solver/lp/cross-nested.ts +1 -4
  252. package/src/prover/smt/solver/lp/dep-intervals.ts +0 -3
  253. package/src/prover/smt/solver/lp/dependency.ts +0 -2
  254. package/src/prover/smt/solver/lp/dioph-eq.ts +0 -2
  255. package/src/prover/smt/solver/lp/explanation.ts +0 -1
  256. package/src/prover/smt/solver/lp/gomory.ts +0 -1
  257. package/src/prover/smt/solver/lp/hnf-cutter.ts +0 -1
  258. package/src/prover/smt/solver/lp/hnf.ts +0 -3
  259. package/src/prover/smt/solver/lp/int-cube.ts +3 -4
  260. package/src/prover/smt/solver/lp/int-solver.ts +0 -2
  261. package/src/prover/smt/solver/lp/lar-solver.ts +40 -4
  262. package/src/prover/smt/solver/lp/lar-term.ts +0 -1
  263. package/src/prover/smt/solver/lp/lp-settings.ts +0 -1
  264. package/src/prover/smt/solver/lp/maximize-term.ts +59 -10
  265. package/src/prover/smt/solver/lp/nex-creator.ts +3 -3
  266. package/src/prover/smt/solver/lp/nex.ts +2 -2
  267. package/src/prover/smt/solver/lp/nla-backoff.ts +0 -2
  268. package/src/prover/smt/solver/lp/nla-basics.ts +46 -3
  269. package/src/prover/smt/solver/lp/nla-core.ts +66 -11
  270. package/src/prover/smt/solver/lp/nla-divisions.ts +0 -2
  271. package/src/prover/smt/solver/lp/nla-emonics.ts +0 -1
  272. package/src/prover/smt/solver/lp/nla-factorization.ts +0 -1
  273. package/src/prover/smt/solver/lp/nla-grobner.ts +167 -85
  274. package/src/prover/smt/solver/lp/nla-horner.ts +0 -2
  275. package/src/prover/smt/solver/lp/nla-intervals.ts +0 -1
  276. package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +0 -2
  277. package/src/prover/smt/solver/lp/nla-monotone.ts +0 -1
  278. package/src/prover/smt/solver/lp/nla-order.ts +0 -2
  279. package/src/prover/smt/solver/lp/nla-patcher.ts +0 -1
  280. package/src/prover/smt/solver/lp/nla-powers.ts +220 -0
  281. package/src/prover/smt/solver/lp/nla-tangents.ts +0 -2
  282. package/src/prover/smt/solver/lp/nla-throttle.ts +0 -1
  283. package/src/prover/smt/solver/lp/nla-transcendentals.ts +324 -0
  284. package/src/prover/smt/solver/lp/nla-types.ts +0 -2
  285. package/src/prover/smt/solver/lp/nla-var-eqs.ts +0 -1
  286. package/src/prover/smt/solver/lp/nra-solver.ts +163 -99
  287. package/src/prover/smt/solver/lp/numeric-pair.ts +0 -1
  288. package/src/prover/smt/solver/lp/pdd-interval.ts +6 -3
  289. package/src/prover/smt/solver/lp/pdd-simplifier.ts +60 -21
  290. package/src/prover/smt/solver/lp/pdd-solver.ts +72 -41
  291. package/src/prover/smt/solver/lp/pdd.ts +725 -290
  292. package/src/prover/smt/solver/lp/random-updater.ts +0 -2
  293. package/src/prover/smt/solver/lp/static-matrix.ts +0 -1
  294. package/src/prover/smt/solver/lp/union-find.ts +7 -2
  295. package/src/prover/smt/solver/macro-finder.ts +530 -0
  296. package/src/prover/smt/solver/mam-compiler.ts +118 -88
  297. package/src/prover/smt/solver/mam-interpreter.ts +0 -1
  298. package/src/prover/smt/solver/max-bv-sharing-tactic.ts +17 -0
  299. package/src/prover/smt/solver/max-cliques.ts +105 -0
  300. package/src/prover/smt/solver/maxcore.ts +309 -0
  301. package/src/prover/smt/solver/maximize-ac-sharing.ts +8 -6
  302. package/src/prover/smt/solver/maxlex.ts +115 -0
  303. package/src/prover/smt/solver/maxsmt-base.ts +105 -0
  304. package/src/prover/smt/solver/maxsmt.ts +92 -0
  305. package/src/prover/smt/solver/mbp/mbp-arith.ts +467 -0
  306. package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +101 -0
  307. package/src/prover/smt/solver/mbp/mbp-plugin.ts +287 -0
  308. package/src/prover/smt/solver/mbp/mbp-qel.ts +48 -0
  309. package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +271 -0
  310. package/src/prover/smt/solver/mbp/mbp-term-graph.ts +606 -0
  311. package/src/prover/smt/solver/model-based-opt.ts +844 -0
  312. package/src/prover/smt/solver/model-checker.ts +17 -26
  313. package/src/prover/smt/solver/model-evaluator.ts +188 -12
  314. package/src/prover/smt/solver/model-finder.ts +0 -1
  315. package/src/prover/smt/solver/model-generator.ts +59 -30
  316. package/src/prover/smt/solver/model-macro-solver.ts +38 -27
  317. package/src/prover/smt/solver/model-printer.ts +214 -0
  318. package/src/prover/smt/solver/mpf.ts +709 -0
  319. package/src/prover/smt/solver/mus.ts +50 -0
  320. package/src/prover/smt/solver/muz/dl-context.ts +410 -0
  321. package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +97 -0
  322. package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +167 -0
  323. package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +125 -0
  324. package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +299 -0
  325. package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +455 -0
  326. package/src/prover/smt/solver/muz/dl-mk-slice.ts +340 -0
  327. package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +163 -0
  328. package/src/prover/smt/solver/muz/dl-rule-set.ts +273 -0
  329. package/src/prover/smt/solver/muz/dl-rule-transformer.ts +123 -0
  330. package/src/prover/smt/solver/muz/dl-rule.ts +496 -0
  331. package/src/prover/smt/solver/muz/hnf.ts +201 -0
  332. package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +176 -0
  333. package/src/prover/smt/solver/muz/horn-tactic.ts +201 -0
  334. package/src/prover/smt/solver/muz/rule-properties.ts +337 -0
  335. package/src/prover/smt/solver/muz/spacer-context.ts +1404 -0
  336. package/src/prover/smt/solver/muz/spacer-dl-interface.ts +52 -0
  337. package/src/prover/smt/solver/muz/spacer-generalizers.ts +241 -0
  338. package/src/prover/smt/solver/muz/spacer-manager.ts +127 -0
  339. package/src/prover/smt/solver/muz/spacer-pdr.ts +219 -0
  340. package/src/prover/smt/solver/muz/spacer-prop-solver.ts +333 -0
  341. package/src/prover/smt/solver/muz/spacer-util.ts +282 -0
  342. package/src/prover/smt/solver/muz/substitution.ts +203 -0
  343. package/src/prover/smt/solver/nla2bv-tactic.ts +285 -0
  344. package/src/prover/smt/solver/nlqsat.ts +484 -0
  345. package/src/prover/smt/solver/nlsat/algebraic.ts +305 -88
  346. package/src/prover/smt/solver/nlsat/atoms.ts +52 -35
  347. package/src/prover/smt/solver/nlsat/evaluator.ts +0 -1
  348. package/src/prover/smt/solver/nlsat/explain.ts +424 -211
  349. package/src/prover/smt/solver/nlsat/interval-set.ts +1 -2
  350. package/src/prover/smt/solver/nlsat/levelwise.ts +460 -241
  351. package/src/prover/smt/solver/nlsat/mpbq.ts +45 -1
  352. package/src/prover/smt/solver/nlsat/polynomial.ts +2366 -683
  353. package/src/prover/smt/solver/nlsat/solver.ts +282 -69
  354. package/src/prover/smt/solver/nlsat/transcendental-eval.ts +310 -0
  355. package/src/prover/smt/solver/nlsat/transcendentals.ts +391 -0
  356. package/src/prover/smt/solver/nlsat/types.ts +0 -2
  357. package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +8 -7
  358. package/src/prover/smt/solver/nlsat/upolynomial.ts +41 -20
  359. package/src/prover/smt/solver/nlsat-tactic.ts +82 -0
  360. package/src/prover/smt/solver/nnf.ts +105 -23
  361. package/src/prover/smt/solver/normalize-bounds.ts +53 -0
  362. package/src/prover/smt/solver/occf.ts +97 -0
  363. package/src/prover/smt/solver/opt-context.ts +792 -0
  364. package/src/prover/smt/solver/opt-nlsat.ts +386 -0
  365. package/src/prover/smt/solver/opt-pareto.ts +282 -0
  366. package/src/prover/smt/solver/opt-preprocess.ts +101 -0
  367. package/src/prover/smt/solver/opt-solver.ts +311 -0
  368. package/src/prover/smt/solver/opt-value.ts +55 -0
  369. package/src/prover/smt/solver/optsmt.ts +692 -0
  370. package/src/prover/smt/solver/parallel-tactic.ts +299 -0
  371. package/src/prover/smt/solver/pattern-inference.ts +19 -11
  372. package/src/prover/smt/solver/pb-rewriter.ts +281 -0
  373. package/src/prover/smt/solver/pb2bv-tactic.ts +540 -0
  374. package/src/prover/smt/solver/poly-rewriter.ts +202 -57
  375. package/src/prover/smt/solver/probes.ts +511 -0
  376. package/src/prover/smt/solver/propagate-values.ts +37 -21
  377. package/src/prover/smt/solver/proto-model.ts +650 -17
  378. package/src/prover/smt/solver/pull-quant.ts +28 -12
  379. package/src/prover/smt/solver/purify-arith.ts +632 -0
  380. package/src/prover/smt/solver/qe-arith-plugin.ts +1096 -0
  381. package/src/prover/smt/solver/qe-lite-der.ts +2 -3
  382. package/src/prover/smt/solver/qe-lite-fm.ts +3 -4
  383. package/src/prover/smt/solver/qe-lite.ts +37 -17
  384. package/src/prover/smt/solver/qe-mbp.ts +270 -0
  385. package/src/prover/smt/solver/qe.ts +1499 -0
  386. package/src/prover/smt/solver/qel.ts +25 -0
  387. package/src/prover/smt/solver/qi-queue.ts +0 -1
  388. package/src/prover/smt/solver/qsat.ts +814 -0
  389. package/src/prover/smt/solver/quant-hoist.ts +196 -0
  390. package/src/prover/smt/solver/quant-tactics.ts +16 -56
  391. package/src/prover/smt/solver/quantifier-analyzer.ts +9 -10
  392. package/src/prover/smt/solver/quantifier-manager.ts +25 -24
  393. package/src/prover/smt/solver/quasi-macros.ts +243 -0
  394. package/src/prover/smt/solver/random-gen.ts +0 -1
  395. package/src/prover/smt/solver/rational.ts +45 -1
  396. package/src/prover/smt/solver/recfun-decl-plugin.ts +262 -0
  397. package/src/prover/smt/solver/recfun-rewriter.ts +107 -0
  398. package/src/prover/smt/solver/reduce-args.ts +225 -0
  399. package/src/prover/smt/solver/reduce-bv-size.ts +119 -0
  400. package/src/prover/smt/solver/ref-vector.ts +0 -1
  401. package/src/prover/smt/solver/relevancy.ts +1 -2
  402. package/src/prover/smt/solver/rewriter-tpl.ts +77 -10
  403. package/src/prover/smt/solver/rewriter.ts +475 -36
  404. package/src/prover/smt/solver/rlimit.ts +38 -2
  405. package/src/prover/smt/solver/sat/asymm-branch.ts +325 -0
  406. package/src/prover/smt/solver/sat/big.ts +177 -0
  407. package/src/prover/smt/solver/sat/clause-use-list.ts +71 -0
  408. package/src/prover/smt/solver/sat/clause.ts +203 -0
  409. package/src/prover/smt/solver/sat/cleaner.ts +94 -0
  410. package/src/prover/smt/solver/sat/config.ts +122 -0
  411. package/src/prover/smt/solver/sat/consequences.ts +203 -0
  412. package/src/prover/smt/solver/sat/elim-eqs.ts +142 -0
  413. package/src/prover/smt/solver/sat/goal2sat.ts +526 -0
  414. package/src/prover/smt/solver/sat/inc-sat-solver.ts +378 -0
  415. package/src/prover/smt/solver/sat/model-converter.ts +136 -0
  416. package/src/prover/smt/solver/sat/pb-constraint.ts +261 -0
  417. package/src/prover/smt/solver/sat/pb-solver.ts +1577 -0
  418. package/src/prover/smt/solver/sat/probing.ts +170 -0
  419. package/src/prover/smt/solver/sat/sat-tactic.ts +44 -0
  420. package/src/prover/smt/solver/sat/sat2goal.ts +165 -0
  421. package/src/prover/smt/solver/sat/scc.ts +142 -0
  422. package/src/prover/smt/solver/sat/simplifier.ts +1618 -0
  423. package/src/prover/smt/solver/sat/solver.ts +2105 -0
  424. package/src/prover/smt/solver/sat/var-queue.ts +117 -0
  425. package/src/prover/smt/solver/sat/watch-list.ts +140 -0
  426. package/src/prover/smt/solver/search-tree.ts +284 -0
  427. package/src/prover/smt/solver/seq-axioms.ts +995 -0
  428. package/src/prover/smt/solver/seq-decl-plugin.ts +819 -0
  429. package/src/prover/smt/solver/seq-derive.ts +1298 -0
  430. package/src/prover/smt/solver/seq-eq-approx.ts +236 -0
  431. package/src/prover/smt/solver/seq-eq-solver.ts +439 -0
  432. package/src/prover/smt/solver/seq-factory.ts +89 -0
  433. package/src/prover/smt/solver/seq-monadic.ts +730 -0
  434. package/src/prover/smt/solver/seq-range-predicate.ts +235 -0
  435. package/src/prover/smt/solver/seq-re-rewriter.ts +1171 -0
  436. package/src/prover/smt/solver/seq-re-util.ts +758 -0
  437. package/src/prover/smt/solver/seq-regex-bisim.ts +144 -0
  438. package/src/prover/smt/solver/seq-regex-live.ts +200 -0
  439. package/src/prover/smt/solver/seq-rewriter.ts +2404 -0
  440. package/src/prover/smt/solver/seq-skolem.ts +294 -0
  441. package/src/prover/smt/solver/seq-subset.ts +165 -0
  442. package/src/prover/smt/solver/seq-view-witness.ts +353 -0
  443. package/src/prover/smt/solver/smt-consequences.ts +297 -0
  444. package/src/prover/smt/solver/smt-kernel.ts +90 -0
  445. package/src/prover/smt/solver/smt-logics.ts +66 -0
  446. package/src/prover/smt/solver/smt-setup.ts +496 -0
  447. package/src/prover/smt/solver/smt2-printer.ts +765 -0
  448. package/src/prover/smt/solver/smtlib-parser.ts +3154 -326
  449. package/src/prover/smt/solver/smtlib-script.ts +1702 -0
  450. package/src/prover/smt/solver/solve-eqs.ts +923 -0
  451. package/src/prover/smt/solver/solver.ts +113 -22
  452. package/src/prover/smt/solver/static-features.ts +314 -0
  453. package/src/prover/smt/solver/sticky-generations.ts +0 -1
  454. package/src/prover/smt/solver/tactic.ts +1995 -0
  455. package/src/prover/smt/solver/term-enumeration.ts +205 -0
  456. package/src/prover/smt/solver/theory-array.ts +1240 -0
  457. package/src/prover/smt/solver/theory-bv.ts +1200 -0
  458. package/src/prover/smt/solver/theory-char.ts +355 -0
  459. package/src/prover/smt/solver/theory-datatype.ts +598 -0
  460. package/src/prover/smt/solver/theory-finite-set.ts +30 -0
  461. package/src/prover/smt/solver/theory-fpa.ts +389 -0
  462. package/src/prover/smt/solver/theory-lra-axioms.ts +53 -2
  463. package/src/prover/smt/solver/theory-lra-bounds.ts +31 -5
  464. package/src/prover/smt/solver/theory-lra-final-check.ts +56 -71
  465. package/src/prover/smt/solver/theory-lra-internalize.ts +89 -11
  466. package/src/prover/smt/solver/theory-lra-model.ts +20 -35
  467. package/src/prover/smt/solver/theory-lra-propagate.ts +24 -28
  468. package/src/prover/smt/solver/theory-lra-state.ts +6 -22
  469. package/src/prover/smt/solver/theory-lra.ts +188 -2
  470. package/src/prover/smt/solver/theory-pb.ts +933 -0
  471. package/src/prover/smt/solver/theory-polymorphism.ts +58 -0
  472. package/src/prover/smt/solver/theory-recfun.ts +307 -0
  473. package/src/prover/smt/solver/theory-seq-regex.ts +867 -0
  474. package/src/prover/smt/solver/theory-seq-solve.ts +1373 -0
  475. package/src/prover/smt/solver/theory-seq-state.ts +852 -0
  476. package/src/prover/smt/solver/theory-seq.ts +961 -0
  477. package/src/prover/smt/solver/theory.ts +189 -0
  478. package/src/prover/smt/solver/tseitin-cnf.ts +485 -0
  479. package/src/prover/smt/solver/var-subst.ts +36 -14
  480. package/src/prover/smt/table.ts +3 -2
  481. package/src/prover/smt/types.ts +146 -0
  482. package/src/prover/tlapm/cache.ts +29 -8
  483. package/src/prover/tlapm-library.ts +3208 -0
  484. package/src/prover/verdict.ts +2 -0
  485. package/src/prover/zenon/decide.ts +10 -7
  486. package/src/prover/zenon/encode.ts +0 -2
  487. package/src/prover/zenon/eqrel.ts +0 -2
  488. package/src/prover/zenon/equality-rules.ts +24 -2
  489. package/src/prover/zenon/expr.ts +21 -2
  490. package/src/prover/zenon/index-table.ts +7 -4
  491. package/src/prover/zenon/isar-case.ts +1 -3
  492. package/src/prover/zenon/isar.ts +2 -4
  493. package/src/prover/zenon/llproof.ts +0 -2
  494. package/src/prover/zenon/mltoll.ts +0 -2
  495. package/src/prover/zenon/node.ts +20 -5
  496. package/src/prover/zenon/parse.ts +6 -2
  497. package/src/prover/zenon/phrase.ts +1 -3
  498. package/src/prover/zenon/proof.ts +0 -2
  499. package/src/prover/zenon/propositional-rules.ts +0 -2
  500. package/src/prover/zenon/rules.ts +2 -3
  501. package/src/prover/zenon/search.ts +7 -5
  502. package/src/prover/zenon/tla/functions.ts +0 -2
  503. package/src/prover/zenon/tla/llproof.ts +0 -2
  504. package/src/prover/zenon/tla/records.ts +0 -2
  505. package/src/prover/zenon/tla/rewrites.ts +0 -2
  506. package/src/prover/zenon/tla/sets.ts +7 -8
  507. package/src/prover/zenon/tla/terms.ts +0 -2
  508. package/src/prover/zenon/tla/tla.ts +0 -2
  509. package/src/resolve.ts +72 -36
  510. package/src/runtime.ts +6 -0
  511. package/src/sany/generation.ts +1 -13
  512. package/src/sany/generator-definitions.ts +1 -1
  513. package/src/sany/generator-expressions.ts +9 -17
  514. package/src/sany/generator-proofs.ts +1 -1
  515. package/src/sany/generator.ts +1 -1
  516. package/src/sany/levels.ts +0 -2
  517. package/src/sany/linter.ts +0 -2
  518. package/src/search.ts +198 -45
  519. package/src/simulate.ts +3 -0
  520. package/src/standard-definitions.ts +4 -0
  521. package/src/state-graph.ts +0 -2
  522. package/src/subexpressions.ts +4 -2
  523. package/src/successors.ts +1 -1
  524. package/src/symmetry.ts +2 -2
  525. package/src/tableau.ts +2 -2
  526. package/src/tlc/fingerprint.ts +81 -9
  527. package/src/tlc/jar-data.ts +12 -0
  528. package/src/tlc/order.ts +14 -3
  529. package/src/tlc/summary.ts +29 -14
  530. package/src/tlc/tlcext-operators.ts +61 -16
  531. package/src/tlc/trace-spec.ts +2 -3
  532. package/src/typed-tier.ts +6541 -0
  533. package/src/typescript/types.ts +2 -2
  534. package/src/values.ts +1 -1
  535. package/src/prover/isabelle/isar/statement.ts +0 -52
  536. package/src/prover/smt/solver/z3-license.txt +0 -10
  537. package/src/prover/tlaps-module.ts +0 -510
  538. package/src/prover/zenon/LICENSE +0 -32
@@ -1,10 +1,12 @@
1
- // Ported from Z3 (src/util/rlimit.h, src/util/rlimit.cpp, src/util/memory_manager.cpp), MIT license, see z3-license.txt.
2
1
  import type { GCProfiler } from "node:v8";
3
2
  import { SmtCanceledError } from "../../../errors";
4
3
 
5
4
  export class ResourceLimit {
6
5
  count = 0;
6
+ isSuspended = false;
7
7
  private isCanceled = false;
8
+ private limit = Infinity;
9
+ private limits: number[] = [];
8
10
  private profiler: GCProfiler | null = null;
9
11
 
10
12
  constructor(
@@ -22,7 +24,41 @@ export class ResourceLimit {
22
24
  this.isCanceled = true;
23
25
  this.release();
24
26
  }
25
- return !this.isCanceled;
27
+ return this.isSuspended || (!this.isCanceled && this.count <= this.limit);
28
+ }
29
+
30
+ isExhausted() {
31
+ return !this.isSuspended && (this.isCanceled || this.count > this.limit);
32
+ }
33
+
34
+ push(delta: number) {
35
+ this.limits.push(this.limit);
36
+ this.limit = Math.min(delta === 0 ? Infinity : this.count + delta, this.limit);
37
+ this.isCanceled = false;
38
+ }
39
+
40
+ pop() {
41
+ this.count = Math.min(this.count, this.limit);
42
+ this.limit = this.limits.pop() ?? Infinity;
43
+ this.isCanceled = false;
44
+ }
45
+
46
+ pushChild(child: ResourceLimit) {
47
+ child.limit = Math.min(child.limit, this.limit - Math.min(this.limit, this.count));
48
+ child.count = 0;
49
+ child.deadline = this.deadline;
50
+ child.signal = this.signal;
51
+ }
52
+
53
+ popChild(child: ResourceLimit) {
54
+ this.count += child.count;
55
+ child.count = 0;
56
+ child.release();
57
+ }
58
+
59
+ restart(deadline: number) {
60
+ this.deadline = deadline;
61
+ this.isCanceled = false;
26
62
  }
27
63
 
28
64
  checkpoint() {
@@ -0,0 +1,325 @@
1
+ import { L_FALSE, L_TRUE, L_UNDEF } from "../lbool";
2
+ import { RandomGen } from "../random-gen";
3
+ import { Big } from "./big";
4
+ import { UINT_MAX } from "./clause";
5
+ import { getBool, getNumber, type SatParams } from "./config";
6
+ import type { Solver } from "./solver";
7
+
8
+ export class AsymmBranch {
9
+ private counter = 0;
10
+ private rand = new RandomGen(0);
11
+ private calls = 0;
12
+ private touchIndex = 0;
13
+ private isEnabled: boolean;
14
+ private rounds: number;
15
+ private delay: number;
16
+ private isSampled: boolean;
17
+ private isAll: boolean;
18
+ private limit: number;
19
+ private elimLiterals = 0;
20
+ private tr = 0;
21
+ private pos: number[] = [];
22
+ private neg: number[] = [];
23
+ private toDelete: number[] = [];
24
+ private isScopedDeleted = false;
25
+
26
+ constructor(
27
+ private solver: Solver,
28
+ params: SatParams,
29
+ ) {
30
+ this.isEnabled = getBool(params, "asymm_branch", true);
31
+ this.rounds = getNumber(params, "asymm_branch.rounds", 2);
32
+ this.delay = getNumber(params, "asymm_branch.delay", 1);
33
+ this.isSampled = getBool(params, "asymm_branch.sampled", true);
34
+ this.limit = Math.min(getNumber(params, "asymm_branch.limit", 100000000), UINT_MAX);
35
+ this.isAll = getBool(params, "asymm_branch.all", false);
36
+ }
37
+
38
+ initSearch() {
39
+ this.calls = 0;
40
+ }
41
+
42
+ dec(count: number) {
43
+ this.counter -= count;
44
+ }
45
+
46
+ private processBig(big: Big, isLearned: boolean) {
47
+ const solver = this.solver;
48
+ const elim0 = this.elimLiterals;
49
+ for (let round = 0; round < this.rounds; round++) {
50
+ const elim = this.elimLiterals + this.tr;
51
+ big.init(solver, isLearned);
52
+ this.processClauses(big, solver.clauses);
53
+ this.processClauses(big, solver.learned);
54
+ this.tr += big.reduceTr(solver);
55
+ solver.propagate(false);
56
+ if (solver.isInconsistent) break;
57
+ if (this.elimLiterals + this.tr - elim === 0) break;
58
+ }
59
+ return this.elimLiterals > elim0;
60
+ }
61
+
62
+ private processClauses(big: Big | undefined, clauses: number[]) {
63
+ const solver = this.solver;
64
+ const limit = -this.limit;
65
+ clauses.sort((first, second) => solver.arena.size[second] - solver.arena.size[first]);
66
+ this.counter -= clauses.length;
67
+ let next = 0;
68
+ let index = 0;
69
+ try {
70
+ for (; index < clauses.length; index++) {
71
+ const clause = clauses[index];
72
+ if (solver.isInconsistent) {
73
+ for (; index < clauses.length; index++) clauses[next++] = clauses[index];
74
+ break;
75
+ }
76
+ if (this.counter < limit || solver.arena.wasRemoved(clause)) {
77
+ clauses[next++] = clause;
78
+ continue;
79
+ }
80
+ solver.checkpoint();
81
+ if (big === undefined ? !this.processClause(clause) : !this.processSampled(big, clause))
82
+ continue;
83
+ clauses[next++] = clause;
84
+ }
85
+ clauses.length = next;
86
+ } catch (error) {
87
+ for (; index < clauses.length; index++) clauses[next++] = clauses[index];
88
+ clauses.length = next;
89
+ this.counter = -this.counter;
90
+ throw error;
91
+ }
92
+ }
93
+
94
+ run(isForced: boolean) {
95
+ const solver = this.solver;
96
+ this.calls++;
97
+ if (this.calls <= this.delay) return;
98
+ if (!this.isEnabled && !this.isAll && !this.isSampled) return;
99
+ solver.propagate(false);
100
+ if (solver.isInconsistent) return;
101
+ if (!isForced && this.counter > 0) {
102
+ this.counter = Math.trunc(this.counter / 100);
103
+ return;
104
+ }
105
+ const savedPhase = solver.phase.slice();
106
+ const wasProbing = solver.isProbing;
107
+ solver.isProbing = true;
108
+ let isChanged = true;
109
+ try {
110
+ for (let count = 0; isChanged && count < 2; count++) {
111
+ isChanged = false;
112
+ solver.touchIndex++;
113
+ if (this.isSampled && this.processBig(new Big(solver.rand), true)) isChanged = true;
114
+ if (this.isSampled && this.processBig(new Big(solver.rand), false)) isChanged = true;
115
+ if (this.isEnabled) {
116
+ this.counter = 0;
117
+ const elim = this.elimLiterals;
118
+ this.processClauses(undefined, solver.clauses);
119
+ solver.propagate(false);
120
+ if (this.elimLiterals > elim) isChanged = true;
121
+ this.counter = -this.counter;
122
+ }
123
+ this.touchIndex = solver.touchIndex;
124
+ }
125
+ } finally {
126
+ solver.isProbing = wasProbing;
127
+ }
128
+ for (let index = 0; index < savedPhase.length; index++) solver.phase[index] = savedPhase[index];
129
+ this.limit = Math.min(2 * this.limit, UINT_MAX);
130
+ }
131
+
132
+ private processAll(clause: number) {
133
+ this.detachScoped(clause);
134
+ try {
135
+ for (let index = this.solver.arena.size[clause]; index-- > 0;) {
136
+ const newSize = this.flipLiteralAt(clause, index);
137
+ if (newSize !== -1) return this.cleanup(clause, index, newSize);
138
+ }
139
+ return true;
140
+ } finally {
141
+ this.attachScoped(clause);
142
+ }
143
+ }
144
+
145
+ private sort(big: Big, clause: number) {
146
+ const arena = this.solver.arena;
147
+ this.pos.length = 0;
148
+ this.neg.length = 0;
149
+ for (let index = 0; index < arena.size[clause]; index++) {
150
+ const lit = arena.get(clause, index);
151
+ this.pos.push(lit);
152
+ this.neg.push(lit ^ 1);
153
+ }
154
+ this.pos.sort((first, second) => big.left[first] - big.left[second]);
155
+ this.neg.sort((first, second) => big.left[first] - big.left[second]);
156
+ }
157
+
158
+ private isHiddenTautology(big: Big) {
159
+ const pos = this.pos;
160
+ const neg = this.neg;
161
+ let posIndex = 0;
162
+ let negIndex = 0;
163
+ let posLit = pos[posIndex++];
164
+ let negLit = neg[negIndex++];
165
+ for (;;) {
166
+ if (big.left[negLit] > big.left[posLit]) {
167
+ if (posIndex === pos.length) return false;
168
+ posLit = pos[posIndex++];
169
+ } else if (
170
+ big.right[negLit] < big.right[posLit] ||
171
+ (pos.length === 2 && (posLit === (negLit ^ 1) || big.parent[posLit] === negLit))
172
+ ) {
173
+ if (negIndex === neg.length) return false;
174
+ negLit = neg[negIndex++];
175
+ } else return true;
176
+ }
177
+ }
178
+
179
+ private collectHiddenLiterals(big: Big) {
180
+ const toDelete = this.toDelete;
181
+ toDelete.length = 0;
182
+ let right = big.right[this.pos[this.pos.length - 1]];
183
+ for (let index = this.pos.length - 1; index-- > 0;) {
184
+ const lit = this.pos[index];
185
+ const litRight = big.right[lit];
186
+ if (litRight > right) toDelete.push(lit);
187
+ else right = litRight;
188
+ }
189
+ if (toDelete.length > 0) return;
190
+ right = big.right[this.neg[0]];
191
+ for (let index = 1; index < this.neg.length; index++) {
192
+ const lit = this.neg[index];
193
+ const litRight = big.right[lit];
194
+ if (right > litRight) toDelete.push(lit ^ 1);
195
+ else right = litRight;
196
+ }
197
+ }
198
+
199
+ private eliminateHiddenLiterals(big: Big, clause: number) {
200
+ const solver = this.solver;
201
+ const arena = solver.arena;
202
+ this.collectHiddenLiterals(big);
203
+ if (this.toDelete.length === 0) return true;
204
+ let next = 0;
205
+ for (let index = 0; index < arena.size[clause]; index++) {
206
+ const lit = arena.get(clause, index);
207
+ const value = solver.value(lit);
208
+ if (value === L_TRUE) {
209
+ this.delScoped(clause);
210
+ return false;
211
+ }
212
+ if (value === L_FALSE || this.toDelete.includes(lit)) continue;
213
+ if (index !== next) arena.swap(clause, index, next);
214
+ next++;
215
+ }
216
+ return this.reAttach(clause, next);
217
+ }
218
+
219
+ private propagateLiteral(lit: number) {
220
+ const solver = this.solver;
221
+ if (solver.touched[lit >> 1] < this.touchIndex) return false;
222
+ solver.assignScoped(lit);
223
+ solver.propagate(false);
224
+ return solver.isInconsistent;
225
+ }
226
+
227
+ private flipLiteralAt(clause: number, flipIndex: number) {
228
+ const solver = this.solver;
229
+ const size = solver.arena.size[clause];
230
+ let isConflict = false;
231
+ let index = 0;
232
+ solver.push();
233
+ for (; !isConflict && index < size; index++) {
234
+ if (index === flipIndex) continue;
235
+ isConflict = this.propagateLiteral(solver.arena.get(clause, index) ^ 1);
236
+ }
237
+ if (!isConflict) isConflict = this.propagateLiteral(solver.arena.get(clause, flipIndex));
238
+ solver.pop(1);
239
+ return isConflict ? index : -1;
240
+ }
241
+
242
+ private cleanup(clause: number, skipIndex: number, newSize: number) {
243
+ const solver = this.solver;
244
+ const arena = solver.arena;
245
+ let next = 0;
246
+ for (let index = 0; index < newSize; index++) {
247
+ if (index === skipIndex || solver.value(arena.get(clause, index)) !== L_UNDEF) continue;
248
+ if (index !== next) arena.swap(clause, index, next);
249
+ next++;
250
+ }
251
+ return this.reAttach(clause, next);
252
+ }
253
+
254
+ private reAttach(clause: number, newSize: number) {
255
+ const solver = this.solver;
256
+ const arena = solver.arena;
257
+ this.elimLiterals += arena.size[clause] - newSize;
258
+ switch (newSize) {
259
+ case 0:
260
+ solver.setConflict();
261
+ return false;
262
+ case 1:
263
+ solver.assignUnit(arena.get(clause, 0));
264
+ solver.propagate(false);
265
+ this.delScoped(clause);
266
+ return false;
267
+ case 2:
268
+ solver.mkBinClause(arena.get(clause, 0), arena.get(clause, 1), arena.isLearned(clause));
269
+ if (solver.trail.length > solver.qhead) solver.propagate(false);
270
+ this.delScoped(clause);
271
+ return false;
272
+ default:
273
+ solver.shrink(clause, arena.size[clause], newSize);
274
+ return true;
275
+ }
276
+ }
277
+
278
+ private detachScoped(clause: number) {
279
+ this.isScopedDeleted = false;
280
+ if (!this.solver.arena.isFrozen(clause)) this.solver.detachClause(clause);
281
+ }
282
+
283
+ private attachScoped(clause: number) {
284
+ if (!this.isScopedDeleted && !this.solver.arena.isFrozen(clause))
285
+ this.solver.attachClause(clause);
286
+ }
287
+
288
+ private delScoped(clause: number) {
289
+ if (this.isScopedDeleted) return;
290
+ this.solver.delClause(clause);
291
+ this.isScopedDeleted = true;
292
+ }
293
+
294
+ private processSampled(big: Big, clause: number) {
295
+ this.detachScoped(clause);
296
+ try {
297
+ this.sort(big, clause);
298
+ return this.isHiddenTautology(big) || this.eliminateHiddenLiterals(big, clause);
299
+ } finally {
300
+ this.attachScoped(clause);
301
+ }
302
+ }
303
+
304
+ private processClause(clause: number) {
305
+ const solver = this.solver;
306
+ const arena = solver.arena;
307
+ const size = arena.size[clause];
308
+ for (let index = 0; index < size; index++)
309
+ if (solver.value(arena.get(clause, index)) === L_TRUE) {
310
+ solver.detachClause(clause);
311
+ solver.delClause(clause);
312
+ return false;
313
+ }
314
+ this.counter -= size;
315
+ if (this.isAll) return this.processAll(clause);
316
+ this.detachScoped(clause);
317
+ try {
318
+ const flipIndex = this.rand.next() % size;
319
+ const newSize = this.flipLiteralAt(clause, flipIndex);
320
+ return newSize === -1 || this.cleanup(clause, flipIndex, newSize);
321
+ } finally {
322
+ this.attachScoped(clause);
323
+ }
324
+ }
325
+ }
@@ -0,0 +1,177 @@
1
+ import type { RandomGen } from "../random-gen";
2
+ import { NULL_LITERAL } from "./clause";
3
+ import type { Solver } from "./solver";
4
+ import { mkBinaryWatch } from "./watch-list";
5
+
6
+ export class Big {
7
+ private isLearned = false;
8
+ left = new Int32Array(0);
9
+ right = new Int32Array(0);
10
+ parent = new Int32Array(0);
11
+ private dagStart = new Int32Array(1);
12
+ private dag = new Int32Array(0);
13
+ private delBin: number[][] = [];
14
+
15
+ constructor(private rand: RandomGen) {}
16
+
17
+ private shuffle(array: Int32Array, start: number, end: number) {
18
+ for (let count = end - start; count-- > 0;) {
19
+ const other = start + (this.rand.next() % (count + 1));
20
+ const value = array[start + count];
21
+ array[start + count] = array[other];
22
+ array[other] = value;
23
+ }
24
+ }
25
+
26
+ init(solver: Solver, isLearned: boolean) {
27
+ this.isLearned = isLearned;
28
+ const numLits = 2 * solver.numVars();
29
+ const isEdge = (lit: number, index: number) =>
30
+ solver.getWlist(lit).isBinary(index) && (isLearned || !solver.getWlist(lit).isLearned(index));
31
+ const dagStart = new Int32Array(numLits + 1);
32
+ for (let lit = 0; lit < numLits; lit++) {
33
+ dagStart[lit + 1] = dagStart[lit];
34
+ if (solver.wasEliminated(lit >> 1)) continue;
35
+ for (let index = 0; index < solver.getWlist(lit).size; index++)
36
+ if (isEdge(lit, index)) dagStart[lit + 1]++;
37
+ }
38
+ const dag = new Int32Array(dagStart[numLits]);
39
+ const isRoot = new Uint8Array(numLits).fill(1);
40
+ for (let lit = 0; lit < numLits; lit++) {
41
+ if (solver.wasEliminated(lit >> 1)) continue;
42
+ const wlist = solver.getWlist(lit);
43
+ let next = dagStart[lit];
44
+ for (let index = 0; index < wlist.size; index++) {
45
+ if (!isEdge(lit, index)) continue;
46
+ const other = wlist.getLiteral(index);
47
+ isRoot[other] = 0;
48
+ dag[next++] = other;
49
+ }
50
+ }
51
+ for (let lit = 0; lit < numLits; lit++) this.shuffle(dag, dagStart[lit], dagStart[lit + 1]);
52
+ this.dagStart = dagStart;
53
+ this.dag = dag;
54
+ this.initDfsNum(numLits, isRoot);
55
+ }
56
+
57
+ private initDfsNum(numLits: number, isRoot: Uint8Array) {
58
+ const left = new Int32Array(numLits);
59
+ const right = new Int32Array(numLits).fill(-1);
60
+ const parent = new Int32Array(numLits);
61
+ for (let lit = 0; lit < numLits; lit++) parent[lit] = lit;
62
+ const todo = new Int32Array(numLits + this.dag.length + 1);
63
+ const todoParents = new Int32Array(todo.length);
64
+ let top = 0;
65
+ for (let lit = 0; lit < numLits; lit++)
66
+ if (isRoot[lit] === 1) {
67
+ todoParents[top] = NULL_LITERAL;
68
+ todo[top++] = lit;
69
+ }
70
+ for (let count = top; count-- > 0;) {
71
+ const other = this.rand.next() % (count + 1);
72
+ const child = todo[count];
73
+ const childParent = todoParents[count];
74
+ todo[count] = todo[other];
75
+ todoParents[count] = todoParents[other];
76
+ todo[other] = child;
77
+ todoParents[other] = childParent;
78
+ }
79
+ let dfsNum = 0;
80
+ while (top > 0) {
81
+ const lit = todo[top - 1];
82
+ if (left[lit] > 0) {
83
+ if (right[lit] < 0) right[lit] = ++dfsNum;
84
+ top--;
85
+ continue;
86
+ }
87
+ left[lit] = ++dfsNum;
88
+ if (todoParents[top - 1] !== NULL_LITERAL) parent[lit] = todoParents[top - 1];
89
+ for (let index = this.dagStart[lit]; index < this.dagStart[lit + 1]; index++) {
90
+ const other = this.dag[index];
91
+ if (left[other] !== 0) continue;
92
+ todoParents[top] = lit;
93
+ todo[top++] = other;
94
+ }
95
+ }
96
+ for (let lit = 0; lit < numLits; lit++)
97
+ if (right[lit] < 0) {
98
+ left[lit] = ++dfsNum;
99
+ right[lit] = ++dfsNum;
100
+ }
101
+ this.left = left;
102
+ this.right = right;
103
+ this.parent = parent;
104
+ }
105
+
106
+ private isInDel(first: number, second: number) {
107
+ return first > second
108
+ ? this.delBin[second].includes(first)
109
+ : this.delBin[first].includes(second);
110
+ }
111
+
112
+ private addDel(first: number, second: number) {
113
+ if (first > second) this.delBin[second].push(first);
114
+ else this.delBin[first].push(second);
115
+ }
116
+
117
+ reduceTr(solver: Solver) {
118
+ let numElim = 0;
119
+ this.delBin = Array.from({ length: solver.watches.length }, () => []);
120
+ for (let lit = 0; lit < solver.watches.length; lit++) {
121
+ if (solver.isInconsistent) break;
122
+ const wlist = solver.watches[lit];
123
+ const size = wlist.size;
124
+ let next = 0;
125
+ for (let index = 0; index < size; index++) {
126
+ if (wlist.isBinary(index) && (!this.isLearned || wlist.isLearned(index))) {
127
+ const other = wlist.getLiteral(index);
128
+ const otherParent = this.parent[other];
129
+ if (lit !== otherParent && (lit ^ 1) !== otherParent && this.isSafeReach(lit, other)) {
130
+ numElim++;
131
+ this.addDel(lit ^ 1, other);
132
+ solver.mc.elimStack = [];
133
+ if (wlist.findBinary(other ^ 1) !== -1) solver.assignUnit(lit ^ 1);
134
+ solver.getWlist(other ^ 1).erase(lit ^ 1, mkBinaryWatch(wlist.isLearned(index)));
135
+ continue;
136
+ }
137
+ }
138
+ wlist.copy(next++, index);
139
+ }
140
+ wlist.setEnd(next);
141
+ }
142
+ solver.propagate(false);
143
+ return numElim;
144
+ }
145
+
146
+ private isReaching(from: number, to: number) {
147
+ return this.left[from] < this.left[to] && this.right[to] < this.right[from];
148
+ }
149
+
150
+ private isSafeReach(from: number, to: number) {
151
+ if (!this.isReaching(from, to)) return false;
152
+ for (let lit = from; lit !== to;) {
153
+ const next = this.next(lit, to);
154
+ if (this.isInDel(lit ^ 1, next)) return false;
155
+ if (next === (to ^ 1)) return false;
156
+ lit = next;
157
+ }
158
+ return true;
159
+ }
160
+
161
+ private next(from: number, to: number) {
162
+ let result = NULL_LITERAL;
163
+ let left = this.right[from];
164
+ for (let index = this.dagStart[from]; index < this.dagStart[from + 1]; index++) {
165
+ const lit = this.dag[index];
166
+ if (
167
+ this.isReaching(from, lit) &&
168
+ (lit === to || this.isReaching(lit, to)) &&
169
+ this.left[lit] < left
170
+ ) {
171
+ left = this.left[lit];
172
+ result = lit;
173
+ }
174
+ }
175
+ return result;
176
+ }
177
+ }
@@ -0,0 +1,71 @@
1
+ import { type ClauseArena, NULL_LITERAL } from "./clause";
2
+
3
+ export class UseList {
4
+ private clauses: number[][];
5
+ size: Int32Array;
6
+ private numRedundant: Int32Array;
7
+
8
+ constructor(
9
+ private arena: ClauseArena,
10
+ numVars: number,
11
+ ) {
12
+ this.clauses = Array.from({ length: 2 * numVars }, () => []);
13
+ this.size = new Int32Array(2 * numVars);
14
+ this.numRedundant = new Int32Array(2 * numVars);
15
+ }
16
+
17
+ numIrredundant(lit: number) {
18
+ return this.size[lit] - this.numRedundant[lit];
19
+ }
20
+
21
+ get(lit: number) {
22
+ const arena = this.arena;
23
+ const list = this.clauses[lit];
24
+ let next = 0;
25
+ for (const clause of list) if (!arena.wasRemoved(clause)) list[next++] = clause;
26
+ list.length = next;
27
+ return list;
28
+ }
29
+
30
+ insert(clause: number) {
31
+ const arena = this.arena;
32
+ const isLearned = arena.isLearned(clause);
33
+ for (let index = 0; index < arena.size[clause]; index++) {
34
+ const lit = arena.get(clause, index);
35
+ this.clauses[lit].push(clause);
36
+ this.size[lit]++;
37
+ if (isLearned) this.numRedundant[lit]++;
38
+ }
39
+ }
40
+
41
+ block(clause: number) {
42
+ const arena = this.arena;
43
+ for (let index = 0; index < arena.size[clause]; index++)
44
+ this.numRedundant[arena.get(clause, index)]++;
45
+ }
46
+
47
+ erase(clause: number, exceptLit = NULL_LITERAL) {
48
+ const arena = this.arena;
49
+ const isLearned = arena.isLearned(clause);
50
+ for (let index = 0; index < arena.size[clause]; index++) {
51
+ const lit = arena.get(clause, index);
52
+ if (lit === exceptLit) continue;
53
+ this.size[lit]--;
54
+ if (isLearned) this.numRedundant[lit]--;
55
+ }
56
+ }
57
+
58
+ eraseNotRemoved(lit: number, clause: number) {
59
+ const list = this.clauses[lit];
60
+ const position = list.indexOf(clause);
61
+ if (position !== -1) list.splice(position, 1);
62
+ this.size[lit]--;
63
+ if (this.arena.isLearned(clause)) this.numRedundant[lit]--;
64
+ }
65
+
66
+ reset(lit: number) {
67
+ this.clauses[lit] = [];
68
+ this.size[lit] = 0;
69
+ this.numRedundant[lit] = 0;
70
+ }
71
+ }