tla-ts 0.0.10-dev.b4a856304 → 0.0.10-dev.d618a2d79

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 (586) hide show
  1. package/README.md +2 -1
  2. package/dist/compile.cjs +6 -6
  3. package/dist/compile.js +10 -10
  4. package/dist/deciders.cjs +41 -37
  5. package/dist/deciders.js +57 -53
  6. package/dist/index.cjs +1 -1
  7. package/dist/index.d.cts +37 -0
  8. package/dist/index.d.ts +37 -0
  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.cjs +2683 -427
  13. package/dist/prove.js +2681 -425
  14. package/dist/run.cjs +47 -44
  15. package/dist/run.js +47 -44
  16. package/dist/tlapm.cjs +2 -2
  17. package/dist/tlapm.js +2 -2
  18. package/dist/transfer.cjs +44 -41
  19. package/dist/transfer.js +44 -41
  20. package/dist/worker.cjs +7 -7
  21. package/dist/worker.js +7 -7
  22. package/package.json +1 -1
  23. package/src/ast.ts +41 -41
  24. package/src/bags.ts +2 -5
  25. package/src/builtins.ts +5 -21
  26. package/src/check-failure.ts +116 -0
  27. package/src/check-trace.ts +268 -0
  28. package/src/check.ts +474 -718
  29. package/src/cli/options.ts +6 -31
  30. package/src/cli/run.ts +0 -2
  31. package/src/cli/runtime-invariants.ts +8 -7
  32. package/src/cli/shared.ts +1 -5
  33. package/src/cli/tlapm.ts +433 -70
  34. package/src/cli/tlc-arguments.ts +244 -238
  35. package/src/cli/tlc-output.ts +687 -0
  36. package/src/cli/tlc-usage.ts +3 -5
  37. package/src/cli/tlc.ts +49 -702
  38. package/src/cli/xml-exporter.ts +23 -33
  39. package/src/codegen.ts +5 -10
  40. package/src/coverage.ts +3 -10
  41. package/src/dependencies.ts +30 -14
  42. package/src/dfid.ts +16 -16
  43. package/src/environment-config.ts +315 -0
  44. package/src/environment.ts +55 -338
  45. package/src/errors.ts +33 -5
  46. package/src/evaluate.ts +31 -106
  47. package/src/exit-codes.ts +2 -0
  48. package/src/fingerprints.ts +65 -1
  49. package/src/instances.ts +47 -10
  50. package/src/java-hash.ts +7 -0
  51. package/src/java-overrides.ts +4 -9
  52. package/src/json-reader.ts +1 -2
  53. package/src/json.ts +8 -18
  54. package/src/levels.ts +46 -57
  55. package/src/lexer.ts +76 -85
  56. package/src/liveness-checker.ts +616 -306
  57. package/src/liveness.ts +104 -120
  58. package/src/obligations/action.ts +14 -17
  59. package/src/obligations/anonymize.ts +37 -16
  60. package/src/obligations/enabled-axioms.ts +218 -0
  61. package/src/obligations/equality.ts +1 -3
  62. package/src/obligations/expression.ts +36 -8
  63. package/src/obligations/format.ts +0 -2
  64. package/src/obligations/generate.ts +66 -54
  65. package/src/obligations/index.ts +38 -8
  66. package/src/obligations/levels.ts +24 -11
  67. package/src/obligations/module.ts +28 -41
  68. package/src/obligations/normalize.ts +26 -14
  69. package/src/obligations/operators.ts +0 -2
  70. package/src/obligations/pragma.ts +53 -16
  71. package/src/obligations/printer.ts +43 -13
  72. package/src/obligations/proof.ts +3 -2
  73. package/src/obligations/regroup.ts +0 -2
  74. package/src/obligations/simplify.ts +55 -50
  75. package/src/obligations/source.ts +118 -74
  76. package/src/obligations/subexpression.ts +45 -18
  77. package/src/obligations/substitution.ts +1 -3
  78. package/src/obligations/temporal.ts +5 -7
  79. package/src/obligations/tuples.ts +0 -2
  80. package/src/parallel-worker.ts +10 -30
  81. package/src/parallel.ts +50 -80
  82. package/src/parser.ts +722 -385
  83. package/src/pcal/ast.ts +53 -65
  84. package/src/pcal/parse.ts +144 -191
  85. package/src/pcal/tokenize.ts +91 -115
  86. package/src/pcal/translate.ts +83 -98
  87. package/src/pcal/validate.ts +48 -50
  88. package/src/pretty-print.ts +7 -7
  89. package/src/prover/decide-pool.ts +3 -3
  90. package/src/prover/deciders.ts +12 -9
  91. package/src/prover/isabelle/decide.ts +3 -25
  92. package/src/prover/isabelle/encode.ts +72 -42
  93. package/src/prover/isabelle/isar/attrib.ts +250 -0
  94. package/src/prover/isabelle/isar/context.ts +335 -0
  95. package/src/prover/isabelle/isar/induct.ts +382 -0
  96. package/src/prover/isabelle/isar/inner-syntax.ts +158 -7
  97. package/src/prover/isabelle/isar/method.ts +509 -212
  98. package/src/prover/isabelle/isar/proof.ts +570 -14
  99. package/src/prover/isabelle/isar/rule-cases.ts +224 -0
  100. package/src/prover/isabelle/isar/theory.ts +487 -76
  101. package/src/prover/isabelle/isar/toplevel.ts +331 -0
  102. package/src/prover/isabelle/isar/type-check.ts +89 -14
  103. package/src/prover/isabelle/provers/blast/blast.ts +7 -65
  104. package/src/prover/isabelle/provers/blast/branch.ts +0 -2
  105. package/src/prover/isabelle/provers/blast/prove.ts +0 -2
  106. package/src/prover/isabelle/provers/blast/rules.ts +0 -2
  107. package/src/prover/isabelle/provers/blast/state.ts +0 -2
  108. package/src/prover/isabelle/provers/blast/term.ts +0 -2
  109. package/src/prover/isabelle/provers/clasimp.ts +0 -2
  110. package/src/prover/isabelle/provers/classical.ts +45 -20
  111. package/src/prover/isabelle/provers/hypsubst.ts +17 -28
  112. package/src/prover/isabelle/pure/bicompose.ts +9 -27
  113. package/src/prover/isabelle/pure/consts.ts +0 -2
  114. package/src/prover/isabelle/pure/conv.ts +2 -10
  115. package/src/prover/isabelle/pure/drule.ts +72 -6
  116. package/src/prover/isabelle/pure/envir.ts +0 -2
  117. package/src/prover/isabelle/pure/goal.ts +1 -3
  118. package/src/prover/isabelle/pure/logic.ts +1 -3
  119. package/src/prover/isabelle/pure/name.ts +0 -2
  120. package/src/prover/isabelle/pure/net.ts +0 -2
  121. package/src/prover/isabelle/pure/object-logic.ts +13 -7
  122. package/src/prover/isabelle/pure/pattern.ts +0 -2
  123. package/src/prover/isabelle/pure/raw-simplifier.ts +4 -15
  124. package/src/prover/isabelle/pure/rewriter.ts +6 -17
  125. package/src/prover/isabelle/pure/search.ts +0 -2
  126. package/src/prover/isabelle/pure/seq.ts +0 -2
  127. package/src/prover/isabelle/pure/simplifier.ts +26 -7
  128. package/src/prover/isabelle/pure/table.ts +2 -3
  129. package/src/prover/isabelle/pure/tactic.ts +0 -2
  130. package/src/prover/isabelle/pure/tactical.ts +42 -37
  131. package/src/prover/isabelle/pure/term-ord.ts +0 -2
  132. package/src/prover/isabelle/pure/term.ts +0 -2
  133. package/src/prover/isabelle/pure/thm.ts +14 -13
  134. package/src/prover/isabelle/pure/type.ts +0 -2
  135. package/src/prover/isabelle/pure/unify.ts +0 -2
  136. package/src/prover/isabelle/pure/variable.ts +0 -2
  137. package/src/prover/isabelle/tla/classical-setup.ts +18 -16
  138. package/src/prover/isabelle/tla/context.ts +58 -11
  139. package/src/prover/isabelle/tla/logic-data.ts +1 -1
  140. package/src/prover/isabelle/tla/logic.ts +49 -21
  141. package/src/prover/isabelle/tla/simpdata.ts +1 -12
  142. package/src/prover/isabelle/tools/intuitionistic.ts +28 -12
  143. package/src/prover/ocaml.ts +4 -1
  144. package/src/prover/prep/action.ts +30 -31
  145. package/src/prover/prep/enabled-axioms.ts +11 -2
  146. package/src/prover/prep/fingerprint.ts +2 -5
  147. package/src/prover/prep/methods.ts +181 -51
  148. package/src/prover/prep/normalize.ts +38 -9
  149. package/src/prover/prove.ts +395 -94
  150. package/src/prover/ptl/decide.ts +95 -50
  151. package/src/prover/ptl/encode.ts +2 -3
  152. package/src/prover/ptl/tableau.ts +28 -2
  153. package/src/prover/smt/arithmetic.ts +310 -0
  154. package/src/prover/smt/axioms.ts +12 -8
  155. package/src/prover/smt/context.ts +43 -8
  156. package/src/prover/smt/data.ts +498 -379
  157. package/src/prover/smt/encode.ts +148 -57
  158. package/src/prover/smt/extensionality.ts +5 -3
  159. package/src/prover/smt/flatten.ts +4 -6
  160. package/src/prover/smt/format.ts +28 -4
  161. package/src/prover/smt/instances.ts +7 -1
  162. package/src/prover/smt/layout.ts +91 -0
  163. package/src/prover/smt/rewrite.ts +1021 -618
  164. package/src/prover/smt/simplify.ts +441 -0
  165. package/src/prover/smt/solver/ackermannize-bv-tactic.ts +61 -0
  166. package/src/prover/smt/solver/ackr-helper.ts +179 -0
  167. package/src/prover/smt/solver/ackr-model-converter.ts +105 -0
  168. package/src/prover/smt/solver/act-cache.ts +0 -1
  169. package/src/prover/smt/solver/add-bounds-tactic.ts +59 -0
  170. package/src/prover/smt/solver/aig-tactic.ts +52 -0
  171. package/src/prover/smt/solver/aig.ts +889 -0
  172. package/src/prover/smt/solver/arith-rewriter.ts +613 -6
  173. package/src/prover/smt/solver/arith-terms.ts +121 -0
  174. package/src/prover/smt/solver/array-decl-plugin.ts +175 -0
  175. package/src/prover/smt/solver/array-rewriter.ts +309 -0
  176. package/src/prover/smt/solver/asserted-formulas.ts +87 -16
  177. package/src/prover/smt/solver/ast-lt.ts +166 -12
  178. package/src/prover/smt/solver/ast-util.ts +160 -2
  179. package/src/prover/smt/solver/ast.ts +1427 -41
  180. package/src/prover/smt/solver/auf-solver.ts +2 -6
  181. package/src/prover/smt/solver/bit-blast-tactic.ts +582 -0
  182. package/src/prover/smt/solver/bit-blaster.ts +871 -0
  183. package/src/prover/smt/solver/bound-manager.ts +196 -0
  184. package/src/prover/smt/solver/bound-simplifier.ts +600 -0
  185. package/src/prover/smt/solver/bv-bound-chk.ts +492 -0
  186. package/src/prover/smt/solver/bv-decl-plugin.ts +338 -0
  187. package/src/prover/smt/solver/bv-divrem-bounds.ts +95 -0
  188. package/src/prover/smt/solver/bv-rewriter.ts +1901 -0
  189. package/src/prover/smt/solver/bv1-blast.ts +214 -0
  190. package/src/prover/smt/solver/bv2fpa-converter.ts +174 -0
  191. package/src/prover/smt/solver/bv2int-rewriter.ts +544 -0
  192. package/src/prover/smt/solver/bv2real-rewriter.ts +533 -0
  193. package/src/prover/smt/solver/card2bv.ts +110 -0
  194. package/src/prover/smt/solver/case-split-queue.ts +0 -2
  195. package/src/prover/smt/solver/cg-table.ts +39 -25
  196. package/src/prover/smt/solver/check-logic.ts +330 -0
  197. package/src/prover/smt/solver/clause.ts +0 -1
  198. package/src/prover/smt/solver/cofactor-elim-term-ite.ts +278 -0
  199. package/src/prover/smt/solver/conflict-resolution.ts +78 -2
  200. package/src/prover/smt/solver/context.ts +516 -115
  201. package/src/prover/smt/solver/ctx-simplify.ts +20 -10
  202. package/src/prover/smt/solver/ctx-solver-simplify.ts +122 -0
  203. package/src/prover/smt/solver/datatype-decl-plugin.ts +572 -0
  204. package/src/prover/smt/solver/datatype-rewriter.ts +82 -0
  205. package/src/prover/smt/solver/demodulator.ts +786 -0
  206. package/src/prover/smt/solver/dependent-expr-state.ts +81 -0
  207. package/src/prover/smt/solver/der.ts +38 -10
  208. package/src/prover/smt/solver/diff-neq.ts +206 -0
  209. package/src/prover/smt/solver/distribute-forall.ts +57 -0
  210. package/src/prover/smt/solver/dom-simplify.ts +511 -0
  211. package/src/prover/smt/solver/dt2bv-tactic.ts +260 -0
  212. package/src/prover/smt/solver/dyn-ack.ts +0 -1
  213. package/src/prover/smt/solver/e-matching.ts +7 -8
  214. package/src/prover/smt/solver/elim-small-bv-tactic.ts +129 -0
  215. package/src/prover/smt/solver/elim-uncnstr.ts +545 -0
  216. package/src/prover/smt/solver/enode.ts +100 -3
  217. package/src/prover/smt/solver/eq2bv-tactic.ts +218 -0
  218. package/src/prover/smt/solver/euf/arith-axioms.ts +403 -0
  219. package/src/prover/smt/solver/euf/arith-internalize.ts +653 -0
  220. package/src/prover/smt/solver/euf/arith-solver.ts +889 -0
  221. package/src/prover/smt/solver/euf/array-axioms.ts +527 -0
  222. package/src/prover/smt/solver/euf/array-internalize.ts +428 -0
  223. package/src/prover/smt/solver/euf/array-solver.ts +306 -0
  224. package/src/prover/smt/solver/euf/bv-ackerman.ts +162 -0
  225. package/src/prover/smt/solver/euf/bv-internalize.ts +748 -0
  226. package/src/prover/smt/solver/euf/bv-solver.ts +449 -0
  227. package/src/prover/smt/solver/euf/dt-solver.ts +618 -0
  228. package/src/prover/smt/solver/euf/egraph.ts +908 -0
  229. package/src/prover/smt/solver/euf/euf-solver.ts +1205 -0
  230. package/src/prover/smt/solver/euf/fpa-solver.ts +317 -0
  231. package/src/prover/smt/solver/euf/mam.ts +1050 -0
  232. package/src/prover/smt/solver/euf/q-ematch.ts +830 -0
  233. package/src/prover/smt/solver/euf/q-mbi.ts +587 -0
  234. package/src/prover/smt/solver/euf/q-model-fixer.ts +296 -0
  235. package/src/prover/smt/solver/euf/q-solver.ts +361 -0
  236. package/src/prover/smt/solver/euf/th-solver.ts +335 -0
  237. package/src/prover/smt/solver/euf/th-solvers.ts +30 -0
  238. package/src/prover/smt/solver/expr-ref.ts +0 -1
  239. package/src/prover/smt/solver/expr-safe-replace.ts +26 -2
  240. package/src/prover/smt/solver/expr2polynomial.ts +146 -0
  241. package/src/prover/smt/solver/factor.ts +141 -0
  242. package/src/prover/smt/solver/fd-solver.ts +265 -0
  243. package/src/prover/smt/solver/fingerprints.ts +15 -15
  244. package/src/prover/smt/solver/fix-dl-var.ts +148 -0
  245. package/src/prover/smt/solver/flat-literals.ts +0 -1
  246. package/src/prover/smt/solver/fm-tactic.ts +884 -0
  247. package/src/prover/smt/solver/fpa-decl-plugin.ts +618 -0
  248. package/src/prover/smt/solver/fpa-rewriter.ts +640 -0
  249. package/src/prover/smt/solver/fpa2bv-converter.ts +2249 -0
  250. package/src/prover/smt/solver/fpa2bv-rewriter.ts +348 -0
  251. package/src/prover/smt/solver/fpa2bv-tactic.ts +73 -0
  252. package/src/prover/smt/solver/goal.ts +175 -15
  253. package/src/prover/smt/solver/goal2nlsat.ts +189 -0
  254. package/src/prover/smt/solver/guard-set.ts +219 -0
  255. package/src/prover/smt/solver/hash.ts +0 -1
  256. package/src/prover/smt/solver/hashtable.ts +30 -16
  257. package/src/prover/smt/solver/inf-eps.ts +63 -0
  258. package/src/prover/smt/solver/inj-axiom.ts +101 -0
  259. package/src/prover/smt/solver/internalizer.ts +110 -38
  260. package/src/prover/smt/solver/lackr.ts +381 -0
  261. package/src/prover/smt/solver/lbool.ts +0 -1
  262. package/src/prover/smt/solver/lia2card.ts +268 -0
  263. package/src/prover/smt/solver/lia2pb.ts +154 -0
  264. package/src/prover/smt/solver/literal.ts +0 -1
  265. package/src/prover/smt/solver/logic-tactics.ts +345 -0
  266. package/src/prover/smt/solver/lp/bound-propagator.ts +0 -1
  267. package/src/prover/smt/solver/lp/constraints.ts +0 -1
  268. package/src/prover/smt/solver/lp/containers.ts +7 -2
  269. package/src/prover/smt/solver/lp/core-solver.ts +18 -3
  270. package/src/prover/smt/solver/lp/cross-nested.ts +1 -4
  271. package/src/prover/smt/solver/lp/dep-intervals.ts +0 -3
  272. package/src/prover/smt/solver/lp/dependency.ts +0 -2
  273. package/src/prover/smt/solver/lp/dioph-eq.ts +1 -10
  274. package/src/prover/smt/solver/lp/explanation.ts +0 -1
  275. package/src/prover/smt/solver/lp/gomory.ts +0 -1
  276. package/src/prover/smt/solver/lp/hnf-cutter.ts +1 -2
  277. package/src/prover/smt/solver/lp/hnf.ts +0 -3
  278. package/src/prover/smt/solver/lp/int-cube.ts +3 -4
  279. package/src/prover/smt/solver/lp/int-solver.ts +0 -2
  280. package/src/prover/smt/solver/lp/lar-solver.ts +40 -4
  281. package/src/prover/smt/solver/lp/lar-term.ts +0 -1
  282. package/src/prover/smt/solver/lp/lp-settings.ts +0 -1
  283. package/src/prover/smt/solver/lp/maximize-term.ts +59 -10
  284. package/src/prover/smt/solver/lp/nex-creator.ts +3 -3
  285. package/src/prover/smt/solver/lp/nex.ts +2 -2
  286. package/src/prover/smt/solver/lp/nla-backoff.ts +0 -2
  287. package/src/prover/smt/solver/lp/nla-basics.ts +46 -3
  288. package/src/prover/smt/solver/lp/nla-core.ts +67 -16
  289. package/src/prover/smt/solver/lp/nla-divisions.ts +0 -2
  290. package/src/prover/smt/solver/lp/nla-emonics.ts +0 -1
  291. package/src/prover/smt/solver/lp/nla-factorization.ts +0 -1
  292. package/src/prover/smt/solver/lp/nla-grobner.ts +9 -5
  293. package/src/prover/smt/solver/lp/nla-horner.ts +0 -2
  294. package/src/prover/smt/solver/lp/nla-intervals.ts +0 -1
  295. package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +0 -2
  296. package/src/prover/smt/solver/lp/nla-monotone.ts +0 -1
  297. package/src/prover/smt/solver/lp/nla-order.ts +0 -2
  298. package/src/prover/smt/solver/lp/nla-patcher.ts +0 -1
  299. package/src/prover/smt/solver/lp/nla-powers.ts +220 -0
  300. package/src/prover/smt/solver/lp/nla-tangents.ts +0 -2
  301. package/src/prover/smt/solver/lp/nla-throttle.ts +0 -1
  302. package/src/prover/smt/solver/lp/nla-transcendentals.ts +324 -0
  303. package/src/prover/smt/solver/lp/nla-types.ts +0 -2
  304. package/src/prover/smt/solver/lp/nla-var-eqs.ts +0 -1
  305. package/src/prover/smt/solver/lp/nra-solver.ts +122 -64
  306. package/src/prover/smt/solver/lp/numeric-pair.ts +0 -1
  307. package/src/prover/smt/solver/lp/pdd-interval.ts +0 -1
  308. package/src/prover/smt/solver/lp/pdd-simplifier.ts +0 -1
  309. package/src/prover/smt/solver/lp/pdd-solver.ts +0 -2
  310. package/src/prover/smt/solver/lp/pdd.ts +2 -2
  311. package/src/prover/smt/solver/lp/random-updater.ts +0 -2
  312. package/src/prover/smt/solver/lp/static-matrix.ts +0 -1
  313. package/src/prover/smt/solver/lp/union-find.ts +7 -2
  314. package/src/prover/smt/solver/macro-finder.ts +530 -0
  315. package/src/prover/smt/solver/mam-compiler.ts +122 -90
  316. package/src/prover/smt/solver/mam-interpreter.ts +0 -1
  317. package/src/prover/smt/solver/max-bv-sharing-tactic.ts +17 -0
  318. package/src/prover/smt/solver/max-cliques.ts +105 -0
  319. package/src/prover/smt/solver/maxcore.ts +309 -0
  320. package/src/prover/smt/solver/maximize-ac-sharing.ts +8 -6
  321. package/src/prover/smt/solver/maxlex.ts +115 -0
  322. package/src/prover/smt/solver/maxsmt-base.ts +105 -0
  323. package/src/prover/smt/solver/maxsmt.ts +92 -0
  324. package/src/prover/smt/solver/mbp/mbp-arith.ts +467 -0
  325. package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +101 -0
  326. package/src/prover/smt/solver/mbp/mbp-plugin.ts +287 -0
  327. package/src/prover/smt/solver/mbp/mbp-qel.ts +48 -0
  328. package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +271 -0
  329. package/src/prover/smt/solver/mbp/mbp-term-graph.ts +606 -0
  330. package/src/prover/smt/solver/model-based-opt.ts +844 -0
  331. package/src/prover/smt/solver/model-checker.ts +18 -27
  332. package/src/prover/smt/solver/model-evaluator.ts +188 -12
  333. package/src/prover/smt/solver/model-finder.ts +12 -18
  334. package/src/prover/smt/solver/model-generator.ts +56 -29
  335. package/src/prover/smt/solver/model-macro-solver.ts +49 -46
  336. package/src/prover/smt/solver/model-printer.ts +214 -0
  337. package/src/prover/smt/solver/mpf.ts +711 -0
  338. package/src/prover/smt/solver/mus.ts +51 -0
  339. package/src/prover/smt/solver/muz/dl-context.ts +404 -0
  340. package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +97 -0
  341. package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +167 -0
  342. package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +125 -0
  343. package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +299 -0
  344. package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +455 -0
  345. package/src/prover/smt/solver/muz/dl-mk-slice.ts +340 -0
  346. package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +163 -0
  347. package/src/prover/smt/solver/muz/dl-rule-set.ts +273 -0
  348. package/src/prover/smt/solver/muz/dl-rule-transformer.ts +123 -0
  349. package/src/prover/smt/solver/muz/dl-rule.ts +496 -0
  350. package/src/prover/smt/solver/muz/hnf.ts +201 -0
  351. package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +176 -0
  352. package/src/prover/smt/solver/muz/horn-tactic.ts +201 -0
  353. package/src/prover/smt/solver/muz/rule-properties.ts +337 -0
  354. package/src/prover/smt/solver/muz/spacer-context.ts +1406 -0
  355. package/src/prover/smt/solver/muz/spacer-dl-interface.ts +52 -0
  356. package/src/prover/smt/solver/muz/spacer-generalizers.ts +241 -0
  357. package/src/prover/smt/solver/muz/spacer-manager.ts +127 -0
  358. package/src/prover/smt/solver/muz/spacer-pdr.ts +218 -0
  359. package/src/prover/smt/solver/muz/spacer-prop-solver.ts +333 -0
  360. package/src/prover/smt/solver/muz/spacer-util.ts +282 -0
  361. package/src/prover/smt/solver/muz/substitution.ts +203 -0
  362. package/src/prover/smt/solver/nla2bv-tactic.ts +285 -0
  363. package/src/prover/smt/solver/nlqsat.ts +484 -0
  364. package/src/prover/smt/solver/nlsat/algebraic.ts +125 -12
  365. package/src/prover/smt/solver/nlsat/atoms.ts +20 -6
  366. package/src/prover/smt/solver/nlsat/evaluator.ts +0 -1
  367. package/src/prover/smt/solver/nlsat/explain.ts +63 -23
  368. package/src/prover/smt/solver/nlsat/interval-set.ts +1 -2
  369. package/src/prover/smt/solver/nlsat/levelwise.ts +3 -9
  370. package/src/prover/smt/solver/nlsat/mpbq.ts +45 -1
  371. package/src/prover/smt/solver/nlsat/polynomial.ts +13 -6
  372. package/src/prover/smt/solver/nlsat/solver.ts +236 -45
  373. package/src/prover/smt/solver/nlsat/transcendental-eval.ts +310 -0
  374. package/src/prover/smt/solver/nlsat/transcendentals.ts +367 -0
  375. package/src/prover/smt/solver/nlsat/types.ts +0 -2
  376. package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +1 -4
  377. package/src/prover/smt/solver/nlsat/upolynomial.ts +0 -2
  378. package/src/prover/smt/solver/nlsat-tactic.ts +82 -0
  379. package/src/prover/smt/solver/nnf.ts +105 -23
  380. package/src/prover/smt/solver/normalize-bounds.ts +53 -0
  381. package/src/prover/smt/solver/occf.ts +97 -0
  382. package/src/prover/smt/solver/opt-context.ts +787 -0
  383. package/src/prover/smt/solver/opt-nlsat.ts +375 -0
  384. package/src/prover/smt/solver/opt-pareto.ts +282 -0
  385. package/src/prover/smt/solver/opt-preprocess.ts +101 -0
  386. package/src/prover/smt/solver/opt-solver.ts +308 -0
  387. package/src/prover/smt/solver/opt-value.ts +55 -0
  388. package/src/prover/smt/solver/optsmt.ts +692 -0
  389. package/src/prover/smt/solver/parallel-tactic.ts +299 -0
  390. package/src/prover/smt/solver/pattern-inference.ts +19 -11
  391. package/src/prover/smt/solver/pb-rewriter.ts +284 -0
  392. package/src/prover/smt/solver/pb2bv-tactic.ts +540 -0
  393. package/src/prover/smt/solver/poly-rewriter.ts +202 -57
  394. package/src/prover/smt/solver/probes.ts +512 -0
  395. package/src/prover/smt/solver/propagate-values.ts +37 -21
  396. package/src/prover/smt/solver/proto-model.ts +648 -19
  397. package/src/prover/smt/solver/pull-quant.ts +28 -12
  398. package/src/prover/smt/solver/purify-arith.ts +632 -0
  399. package/src/prover/smt/solver/qe-arith-plugin.ts +1098 -0
  400. package/src/prover/smt/solver/qe-lite-der.ts +2 -3
  401. package/src/prover/smt/solver/qe-lite-fm.ts +3 -4
  402. package/src/prover/smt/solver/qe-lite.ts +37 -17
  403. package/src/prover/smt/solver/qe-mbp.ts +270 -0
  404. package/src/prover/smt/solver/qe.ts +1498 -0
  405. package/src/prover/smt/solver/qel.ts +25 -0
  406. package/src/prover/smt/solver/qi-queue.ts +0 -1
  407. package/src/prover/smt/solver/qsat.ts +814 -0
  408. package/src/prover/smt/solver/quant-hoist.ts +196 -0
  409. package/src/prover/smt/solver/quant-tactics.ts +16 -56
  410. package/src/prover/smt/solver/quantifier-analyzer.ts +19 -20
  411. package/src/prover/smt/solver/quantifier-manager.ts +8 -16
  412. package/src/prover/smt/solver/quasi-macros.ts +243 -0
  413. package/src/prover/smt/solver/random-gen.ts +0 -1
  414. package/src/prover/smt/solver/rational.ts +45 -1
  415. package/src/prover/smt/solver/recfun-decl-plugin.ts +261 -0
  416. package/src/prover/smt/solver/recfun-rewriter.ts +107 -0
  417. package/src/prover/smt/solver/reduce-args.ts +225 -0
  418. package/src/prover/smt/solver/reduce-bv-size.ts +119 -0
  419. package/src/prover/smt/solver/ref-vector.ts +0 -1
  420. package/src/prover/smt/solver/relevancy.ts +1 -2
  421. package/src/prover/smt/solver/rewriter-tpl.ts +77 -10
  422. package/src/prover/smt/solver/rewriter.ts +475 -36
  423. package/src/prover/smt/solver/rlimit.ts +38 -2
  424. package/src/prover/smt/solver/sat/asymm-branch.ts +325 -0
  425. package/src/prover/smt/solver/sat/big.ts +177 -0
  426. package/src/prover/smt/solver/sat/clause-use-list.ts +71 -0
  427. package/src/prover/smt/solver/sat/clause.ts +203 -0
  428. package/src/prover/smt/solver/sat/cleaner.ts +94 -0
  429. package/src/prover/smt/solver/sat/config.ts +122 -0
  430. package/src/prover/smt/solver/sat/consequences.ts +203 -0
  431. package/src/prover/smt/solver/sat/elim-eqs.ts +142 -0
  432. package/src/prover/smt/solver/sat/goal2sat.ts +526 -0
  433. package/src/prover/smt/solver/sat/inc-sat-solver.ts +378 -0
  434. package/src/prover/smt/solver/sat/model-converter.ts +136 -0
  435. package/src/prover/smt/solver/sat/pb-constraint.ts +261 -0
  436. package/src/prover/smt/solver/sat/pb-solver.ts +1577 -0
  437. package/src/prover/smt/solver/sat/probing.ts +170 -0
  438. package/src/prover/smt/solver/sat/sat-tactic.ts +43 -0
  439. package/src/prover/smt/solver/sat/sat2goal.ts +165 -0
  440. package/src/prover/smt/solver/sat/scc.ts +142 -0
  441. package/src/prover/smt/solver/sat/simplifier.ts +1618 -0
  442. package/src/prover/smt/solver/sat/solver.ts +2127 -0
  443. package/src/prover/smt/solver/sat/var-queue.ts +117 -0
  444. package/src/prover/smt/solver/sat/watch-list.ts +140 -0
  445. package/src/prover/smt/solver/search-tree.ts +284 -0
  446. package/src/prover/smt/solver/seq-axioms.ts +1010 -0
  447. package/src/prover/smt/solver/seq-decl-plugin.ts +819 -0
  448. package/src/prover/smt/solver/seq-derive.ts +1298 -0
  449. package/src/prover/smt/solver/seq-eq-approx.ts +236 -0
  450. package/src/prover/smt/solver/seq-eq-solver.ts +439 -0
  451. package/src/prover/smt/solver/seq-factory.ts +89 -0
  452. package/src/prover/smt/solver/seq-monadic.ts +728 -0
  453. package/src/prover/smt/solver/seq-range-predicate.ts +235 -0
  454. package/src/prover/smt/solver/seq-re-rewriter.ts +1170 -0
  455. package/src/prover/smt/solver/seq-re-util.ts +758 -0
  456. package/src/prover/smt/solver/seq-regex-bisim.ts +144 -0
  457. package/src/prover/smt/solver/seq-regex-live.ts +200 -0
  458. package/src/prover/smt/solver/seq-rewriter.ts +2402 -0
  459. package/src/prover/smt/solver/seq-skolem.ts +317 -0
  460. package/src/prover/smt/solver/seq-subset.ts +165 -0
  461. package/src/prover/smt/solver/seq-view-witness.ts +353 -0
  462. package/src/prover/smt/solver/smt-consequences.ts +297 -0
  463. package/src/prover/smt/solver/smt-kernel.ts +83 -0
  464. package/src/prover/smt/solver/smt-logics.ts +66 -0
  465. package/src/prover/smt/solver/smt-setup.ts +496 -0
  466. package/src/prover/smt/solver/smt2-printer.ts +765 -0
  467. package/src/prover/smt/solver/smtlib-parser.ts +3126 -316
  468. package/src/prover/smt/solver/smtlib-script.ts +1631 -0
  469. package/src/prover/smt/solver/solve-eqs.ts +929 -0
  470. package/src/prover/smt/solver/solver.ts +113 -22
  471. package/src/prover/smt/solver/static-features.ts +314 -0
  472. package/src/prover/smt/solver/sticky-generations.ts +0 -1
  473. package/src/prover/smt/solver/tactic.ts +1986 -0
  474. package/src/prover/smt/solver/term-enumeration.ts +205 -0
  475. package/src/prover/smt/solver/theory-array.ts +1240 -0
  476. package/src/prover/smt/solver/theory-bv.ts +1200 -0
  477. package/src/prover/smt/solver/theory-char.ts +355 -0
  478. package/src/prover/smt/solver/theory-datatype.ts +598 -0
  479. package/src/prover/smt/solver/theory-finite-set.ts +30 -0
  480. package/src/prover/smt/solver/theory-fpa.ts +389 -0
  481. package/src/prover/smt/solver/theory-lra-axioms.ts +53 -2
  482. package/src/prover/smt/solver/theory-lra-bounds.ts +31 -6
  483. package/src/prover/smt/solver/theory-lra-final-check.ts +56 -70
  484. package/src/prover/smt/solver/theory-lra-internalize.ts +94 -27
  485. package/src/prover/smt/solver/theory-lra-model.ts +20 -35
  486. package/src/prover/smt/solver/theory-lra-propagate.ts +24 -26
  487. package/src/prover/smt/solver/theory-lra-state.ts +6 -22
  488. package/src/prover/smt/solver/theory-lra.ts +188 -1
  489. package/src/prover/smt/solver/theory-pb.ts +934 -0
  490. package/src/prover/smt/solver/theory-polymorphism.ts +58 -0
  491. package/src/prover/smt/solver/theory-recfun.ts +307 -0
  492. package/src/prover/smt/solver/theory-seq-regex.ts +867 -0
  493. package/src/prover/smt/solver/theory-seq-solve.ts +1373 -0
  494. package/src/prover/smt/solver/theory-seq-state.ts +871 -0
  495. package/src/prover/smt/solver/theory-seq.ts +961 -0
  496. package/src/prover/smt/solver/theory.ts +189 -0
  497. package/src/prover/smt/solver/tseitin-cnf.ts +485 -0
  498. package/src/prover/smt/solver/var-subst.ts +36 -14
  499. package/src/prover/smt/table.ts +3 -2
  500. package/src/prover/smt/types.ts +146 -0
  501. package/src/prover/tlapm/cache.ts +50 -19
  502. package/src/prover/tlapm/tlapm.ts +15 -9
  503. package/src/prover/tlapm-library.ts +3208 -0
  504. package/src/prover/verdict.ts +9 -0
  505. package/src/prover/zenon/check/check.ts +1 -2
  506. package/src/prover/zenon/check/records.ts +1 -1
  507. package/src/prover/zenon/check/relations.ts +2 -1
  508. package/src/prover/zenon/check/rewrites.ts +2 -15
  509. package/src/prover/zenon/check/sets.ts +40 -58
  510. package/src/prover/zenon/check/terms.ts +1 -2
  511. package/src/prover/zenon/decide.ts +10 -7
  512. package/src/prover/zenon/encode.ts +0 -2
  513. package/src/prover/zenon/eqrel.ts +2 -2
  514. package/src/prover/zenon/equality-rules.ts +24 -2
  515. package/src/prover/zenon/expr.ts +28 -2
  516. package/src/prover/zenon/index-table.ts +11 -21
  517. package/src/prover/zenon/isar-case.ts +0 -2
  518. package/src/prover/zenon/isar.ts +35 -37
  519. package/src/prover/zenon/llproof.ts +2 -13
  520. package/src/prover/zenon/mltoll.ts +12 -30
  521. package/src/prover/zenon/node.ts +20 -5
  522. package/src/prover/zenon/parse.ts +9 -8
  523. package/src/prover/zenon/phrase.ts +0 -2
  524. package/src/prover/zenon/proof.ts +0 -2
  525. package/src/prover/zenon/propositional-rules.ts +0 -2
  526. package/src/prover/zenon/rules.ts +2 -3
  527. package/src/prover/zenon/search.ts +11 -19
  528. package/src/prover/zenon/tla/functions.ts +2 -4
  529. package/src/prover/zenon/tla/llproof.ts +9 -13
  530. package/src/prover/zenon/tla/records.ts +1 -8
  531. package/src/prover/zenon/tla/rewrites.ts +0 -2
  532. package/src/prover/zenon/tla/sets.ts +22 -22
  533. package/src/prover/zenon/tla/terms.ts +0 -2
  534. package/src/prover/zenon/tla/tla.ts +7 -8
  535. package/src/randomization.ts +1 -4
  536. package/src/resolve.ts +67 -143
  537. package/src/runtime.ts +15 -18
  538. package/src/sany/builtins.ts +1 -3
  539. package/src/sany/generation.ts +394 -0
  540. package/src/sany/generator-def-entries.ts +210 -0
  541. package/src/sany/generator-definitions.ts +686 -0
  542. package/src/sany/generator-expressions.ts +1100 -0
  543. package/src/sany/generator-proofs.ts +662 -0
  544. package/src/sany/generator.ts +160 -2683
  545. package/src/sany/levels.ts +5 -11
  546. package/src/sany/lexer.ts +57 -60
  547. package/src/sany/linter.ts +0 -3
  548. package/src/sany/nodes.ts +6 -13
  549. package/src/sany/report.ts +3 -6
  550. package/src/sany/selectors.ts +35 -38
  551. package/src/sany/xml.ts +23 -55
  552. package/src/search.ts +206 -44
  553. package/src/simulate.ts +202 -184
  554. package/src/spec-description.ts +56 -82
  555. package/src/standard-definitions.ts +4 -3
  556. package/src/standard-modules.ts +17 -44
  557. package/src/state-graph.ts +3 -17
  558. package/src/subexpressions.ts +38 -47
  559. package/src/substitution-levels.ts +5 -4
  560. package/src/successors.ts +20 -43
  561. package/src/symmetry.ts +6 -21
  562. package/src/tableau.ts +2 -2
  563. package/src/tlc/fingerprint.ts +96 -30
  564. package/src/tlc/jar-data.ts +0 -1
  565. package/src/tlc/messages.ts +22 -36
  566. package/src/tlc/order.ts +22 -47
  567. package/src/tlc/random.ts +22 -34
  568. package/src/tlc/replay.ts +21 -48
  569. package/src/tlc/summary.ts +64 -58
  570. package/src/tlc/tlc-operators.ts +6 -17
  571. package/src/tlc/tlcext-operators.ts +54 -26
  572. package/src/tlc/trace-spec.ts +26 -51
  573. package/src/tlc/value-stream.ts +9 -13
  574. package/src/tlc/version.ts +0 -1
  575. package/src/typed-tier.ts +6535 -0
  576. package/src/typescript/actions.ts +2 -4
  577. package/src/typescript/collections.ts +34 -20
  578. package/src/typescript/compile.ts +1 -3
  579. package/src/typescript/formula.ts +5 -3
  580. package/src/typescript/model.ts +4 -5
  581. package/src/typescript/steps.ts +20 -18
  582. package/src/values.ts +136 -338
  583. package/src/prover/isabelle/isar/statement.ts +0 -52
  584. package/src/prover/smt/solver/z3-license.txt +0 -10
  585. package/src/prover/tlaps-module.ts +0 -510
  586. package/src/prover/zenon/LICENSE +0 -32
@@ -0,0 +1,830 @@
1
+ import { KIND_VAR, OP_DISTINCT, OP_EQ, QUANTIFIER_EXISTS, QUANTIFIER_FORALL } from "../ast";
2
+ import { flattenOrVector, mkNot } from "../ast-util";
3
+ import { PatternInferenceRw } from "../asserted-formulas";
4
+ import { L_FALSE, L_TRUE, L_UNDEF } from "../lbool";
5
+ import { DefinedNames, Nnf } from "../nnf";
6
+ import { PatternInference } from "../pattern-inference";
7
+ import { pullQuant } from "../pull-quant";
8
+ import { RefVector } from "../ref-vector";
9
+ import { VarSubst } from "../var-subst";
10
+ import { type Enode, getClass, NULL_THEORY_VAR } from "./egraph";
11
+ import type { EufSolver } from "./euf-solver";
12
+ import { getGroundSubterms, Mam } from "./mam";
13
+ import type { QSolver } from "./q-solver";
14
+
15
+ // q::lit: lhs = rhs, or lhs != rhs when sign is set.
16
+ export interface QLit {
17
+ readonly lhs: number;
18
+ readonly rhs: number;
19
+ readonly sign: boolean;
20
+ }
21
+
22
+ // q::binding: a match of a clause's quantifier, in a circular list of the clause's bindings.
23
+ export class Binding {
24
+ next: Binding = this;
25
+ prev: Binding = this;
26
+
27
+ constructor(
28
+ readonly clause: Clause,
29
+ readonly maxGeneration: number,
30
+ readonly nodes: readonly Enode[],
31
+ ) {}
32
+ }
33
+
34
+ export class Clause {
35
+ watch = 0;
36
+ bindings: Binding | null = null;
37
+
38
+ constructor(
39
+ readonly index: number,
40
+ readonly literal: number,
41
+ readonly lits: readonly QLit[],
42
+ readonly q: number,
43
+ readonly numDecls: number,
44
+ ) {}
45
+ }
46
+
47
+ // q::justification: the evidence for a propagation from a binding.
48
+ interface Justification {
49
+ readonly generation: number;
50
+ readonly explain: readonly number[];
51
+ readonly clause: Clause;
52
+ readonly binding: readonly Enode[];
53
+ }
54
+
55
+ const pushToFront = (clause: Clause, binding: Binding) => {
56
+ const list = clause.bindings;
57
+ if (list === null) {
58
+ clause.bindings = binding;
59
+ binding.next = binding;
60
+ binding.prev = binding;
61
+ return;
62
+ }
63
+ if (list === binding) return;
64
+ binding.prev.next = binding.next;
65
+ binding.next.prev = binding.prev;
66
+ list.prev.next = binding;
67
+ binding.prev = list.prev;
68
+ binding.next = list;
69
+ list.prev = binding;
70
+ clause.bindings = binding;
71
+ };
72
+
73
+ const removeFrom = (clause: Clause, binding: Binding) => {
74
+ const list = clause.bindings as Binding;
75
+ if (list.next === list) {
76
+ clause.bindings = null;
77
+ return;
78
+ }
79
+ if (list === binding) clause.bindings = binding.next;
80
+ binding.prev.next = binding.next;
81
+ binding.next.prev = binding.prev;
82
+ };
83
+
84
+ const detach = (binding: Binding) => {
85
+ binding.next = binding;
86
+ binding.prev = binding;
87
+ };
88
+
89
+ type EnodePair = readonly [Enode, Enode];
90
+
91
+ class Eval {
92
+ private evals = new Map<number, Enode | null>();
93
+ private indirectNodes: Enode[] = [];
94
+ private isFreezingSwap = false;
95
+ private diseqUndef: EnodePair | null = null;
96
+
97
+ constructor(private ctx: EufSolver) {}
98
+
99
+ get watch(): readonly Enode[] {
100
+ return this.indirectNodes;
101
+ }
102
+
103
+ evalClause(binding: readonly Enode[], clause: Clause, evidence: EnodePair[]) {
104
+ const result = this.evalClauseCore(binding, clause, evidence);
105
+ this.evals.clear();
106
+ this.diseqUndef = null;
107
+ return result;
108
+ }
109
+
110
+ private evalClauseCore(binding: readonly Enode[], clause: Clause, evidence: EnodePair[]) {
111
+ let idx = -1;
112
+ const size = clause.lits.length;
113
+ const numDecls = clause.numDecls;
114
+ this.indirectNodes = [];
115
+ for (let index = 0; index < size; index++) {
116
+ const litIndex = (index + clause.watch) % size;
117
+ const limit = this.indirectNodes.length;
118
+ const lit = clause.lits[litIndex];
119
+ const cmp = this.compare(numDecls, binding, lit.lhs, lit.rhs, evidence);
120
+ if (cmp === L_FALSE) {
121
+ this.indirectNodes.length = limit;
122
+ if (!lit.sign) continue;
123
+ clause.watch = litIndex;
124
+ return { value: L_TRUE, idx: -1 };
125
+ }
126
+ if (cmp === L_TRUE) {
127
+ this.indirectNodes.length = limit;
128
+ if (lit.sign) continue;
129
+ clause.watch = litIndex;
130
+ return { value: L_TRUE, idx: -1 };
131
+ }
132
+ if (idx !== -1) return { value: L_UNDEF, idx: -1 };
133
+ idx = litIndex;
134
+ }
135
+ if (idx === -1) return { value: L_FALSE, idx: -1 };
136
+ clause.watch = idx;
137
+ return { value: L_UNDEF, idx };
138
+ }
139
+
140
+ private compare(
141
+ numDecls: number,
142
+ binding: readonly Enode[],
143
+ inputS: number,
144
+ inputT: number,
145
+ evidence: EnodePair[],
146
+ ): number {
147
+ const manager = this.ctx.manager;
148
+ if (inputS === inputT) return L_TRUE;
149
+ if (manager.areDistinct(inputS, inputT)) return L_FALSE;
150
+ let sn = this.evalExpr(numDecls, binding, inputS, evidence);
151
+ let tn = this.evalExpr(numDecls, binding, inputT, evidence);
152
+ if (sn !== null && sn !== sn.root) {
153
+ evidence.push([sn, sn.root]);
154
+ sn = sn.root;
155
+ }
156
+ if (tn !== null && tn !== tn.root) {
157
+ evidence.push([tn, tn.root]);
158
+ tn = tn.root;
159
+ }
160
+ if (sn !== null && sn === tn) return L_TRUE;
161
+ const diseqUndef = this.diseqUndef;
162
+ if (sn !== null && diseqUndef !== null && sn === diseqUndef[0] && tn === diseqUndef[1])
163
+ return L_UNDEF;
164
+ if (sn !== null && tn !== null && this.ctx.egraph.areDiseq(sn, tn)) {
165
+ evidence.push([sn, tn]);
166
+ return L_FALSE;
167
+ }
168
+ if (sn !== null && tn !== null) {
169
+ this.diseqUndef = [sn, tn];
170
+ return L_UNDEF;
171
+ }
172
+ if (sn === null && tn === null)
173
+ return this.compareRec(numDecls, binding, inputS, inputT, evidence);
174
+ if (tn === null && this.isFreezingSwap) return L_UNDEF;
175
+ const wasFreezingSwap = this.isFreezingSwap;
176
+ this.isFreezingSwap = true;
177
+ const isSwapped = tn === null;
178
+ const node = (isSwapped ? sn : tn) as Enode;
179
+ const s = isSwapped ? inputT : inputS;
180
+ const size = evidence.length;
181
+ for (const member of getClass(node)) {
182
+ if (!member.isCgr) continue;
183
+ const cmp = this.compareRec(numDecls, binding, s, member.owner, evidence);
184
+ if (cmp !== L_UNDEF) {
185
+ evidence.push([member, node]);
186
+ this.isFreezingSwap = wasFreezingSwap;
187
+ return cmp;
188
+ }
189
+ evidence.length = size;
190
+ }
191
+ this.isFreezingSwap = wasFreezingSwap;
192
+ return L_UNDEF;
193
+ }
194
+
195
+ private compareRec(
196
+ numDecls: number,
197
+ binding: readonly Enode[],
198
+ s: number,
199
+ t: number,
200
+ evidence: EnodePair[],
201
+ ) {
202
+ const manager = this.ctx.manager;
203
+ if (
204
+ s === t ||
205
+ (manager.isAlgebraicNumeral(s) &&
206
+ manager.isAlgebraicNumeral(t) &&
207
+ manager.compareArithValues(s, t) === 0)
208
+ )
209
+ return L_TRUE;
210
+ if (manager.areDistinct(s, t)) return L_FALSE;
211
+ if (!manager.isApp(s) || !manager.isApp(t)) return L_UNDEF;
212
+ if (manager.decls[s] !== manager.decls[t]) return L_UNDEF;
213
+ if (manager.getNumArgs(s) !== manager.getNumArgs(t)) return L_UNDEF;
214
+ // No SMT-LIB declaration is injective in Z3, so a differing argument leaves the comparison open.
215
+ for (let index = manager.getNumArgs(s); index-- > 0;) {
216
+ const cmp = this.compare(
217
+ numDecls,
218
+ binding,
219
+ manager.getArg(s, index),
220
+ manager.getArg(t, index),
221
+ evidence,
222
+ );
223
+ if (cmp !== L_TRUE) return L_UNDEF;
224
+ }
225
+ return L_TRUE;
226
+ }
227
+
228
+ private evalExpr(
229
+ numDecls: number,
230
+ binding: readonly Enode[],
231
+ expr: number,
232
+ evidence: EnodePair[],
233
+ ) {
234
+ const ctx = this.ctx;
235
+ const manager = ctx.manager;
236
+ const evals = this.evals;
237
+ const cached = evals.get(expr);
238
+ if (cached !== undefined) return cached;
239
+ if (manager.isGroundApp(expr)) return ctx.egraph.find(expr) ?? null;
240
+ const todo = [expr];
241
+ while (todo.length > 0) {
242
+ const term = todo[todo.length - 1];
243
+ if (evals.has(term)) {
244
+ todo.pop();
245
+ continue;
246
+ }
247
+ if (
248
+ manager.isGroundApp(term) ||
249
+ (manager.hasQuantifierFlags[term] && manager.isGround(term))
250
+ ) {
251
+ const node = ctx.egraph.find(term) ?? null;
252
+ if (node === null) return null;
253
+ evals.set(term, node);
254
+ todo.pop();
255
+ continue;
256
+ }
257
+ if (manager.kinds[term] === KIND_VAR) {
258
+ const index = manager.values[term];
259
+ if (index >= numDecls) return null;
260
+ evals.set(term, binding[numDecls - 1 - index]);
261
+ todo.pop();
262
+ continue;
263
+ }
264
+ if (!manager.isApp(term)) return null;
265
+ const args: Enode[] = [];
266
+ for (const arg of manager.getArgs(term)) {
267
+ const evaluated = evals.get(arg);
268
+ if (evaluated !== undefined) args.push(evaluated as Enode);
269
+ else todo.push(arg);
270
+ }
271
+ if (args.length !== manager.getNumArgs(term)) continue;
272
+ const node = ctx.egraph.findCongruent(manager.decls[term], args);
273
+ if (node === undefined) return null;
274
+ for (let index = args.length; index-- > 0;) {
275
+ const first = args[index];
276
+ const second = node.getArg(index);
277
+ if (first === second) continue;
278
+ if (first.root !== second.root) return null;
279
+ evidence.push([first, second]);
280
+ }
281
+ this.indirectNodes.push(node);
282
+ evals.set(term, node);
283
+ todo.pop();
284
+ }
285
+ return evals.get(expr) ?? null;
286
+ }
287
+ }
288
+
289
+ const EAGER_COST_THRESHOLD = 10;
290
+ const LAZY_COST_THRESHOLD = 20;
291
+
292
+ interface QueueEntry {
293
+ readonly binding: Binding;
294
+ readonly cost: number;
295
+ isInstantiated: boolean;
296
+ }
297
+
298
+ // q::queue, with the default cost "(+ weight generation)" and new generation "cost".
299
+ class Queue {
300
+ private newEntries: QueueEntry[] = [];
301
+ private delayedEntries: QueueEntry[] = [];
302
+ private subst: VarSubst;
303
+
304
+ constructor(
305
+ private ematch: Ematch,
306
+ private ctx: EufSolver,
307
+ ) {
308
+ this.subst = new VarSubst(ctx.manager, true);
309
+ }
310
+
311
+ insert(binding: Binding) {
312
+ const cost = this.ctx.manager.getQuantifier(binding.clause.q).weight + binding.maxGeneration;
313
+ if (this.newEntries.length === 0) this.ctx.trail.push(() => (this.newEntries = []));
314
+ this.newEntries.push({ binding, cost, isInstantiated: false });
315
+ }
316
+
317
+ private instantiate(entry: QueueEntry) {
318
+ const ctx = this.ctx;
319
+ const manager = ctx.manager;
320
+ const binding = entry.binding;
321
+ entry.isInstantiated = true;
322
+ const generation = Math.max(binding.maxGeneration + 1, Math.trunc(entry.cost));
323
+ if (this.ematch.propagate(true, binding.nodes, generation, binding.clause).isDone) return;
324
+ const substituted = this.subst.apply(
325
+ manager.getQuantifier(binding.clause.q).body,
326
+ binding.nodes.map((node) => node.owner),
327
+ );
328
+ const instance = ctx.rewrite(substituted);
329
+ manager.decRef(substituted);
330
+ if (manager.isTrue(instance)) {
331
+ manager.decRef(instance);
332
+ return;
333
+ }
334
+ const outer = ctx.generation;
335
+ ctx.generation = generation;
336
+ const lit = ctx.mkLiteral(instance);
337
+ ctx.generation = outer;
338
+ manager.decRef(instance);
339
+ this.ematch.addInstantiation(binding.clause, binding, lit);
340
+ }
341
+
342
+ propagate() {
343
+ if (this.newEntries.length === 0) return false;
344
+ const manager = this.ctx.manager;
345
+ for (const entry of this.newEntries) {
346
+ if (!manager.limit.inc()) break;
347
+ const binding = entry.binding;
348
+ if (entry.cost <= EAGER_COST_THRESHOLD) this.instantiate(entry);
349
+ else if (this.ematch.evaluate(binding.nodes, binding.clause) === L_FALSE)
350
+ this.instantiate(entry);
351
+ else {
352
+ this.delayedEntries.push(entry);
353
+ this.ctx.trail.push(() => this.delayedEntries.pop());
354
+ }
355
+ }
356
+ this.newEntries = [];
357
+ return true;
358
+ }
359
+
360
+ lazyPropagate() {
361
+ if (this.delayedEntries.length === 0) return false;
362
+ let isInstantiated = false;
363
+ for (let index = 0; index < this.delayedEntries.length; index++) {
364
+ const entry = this.delayedEntries[index];
365
+ if (entry.isInstantiated || entry.cost > LAZY_COST_THRESHOLD) continue;
366
+ isInstantiated = true;
367
+ this.ctx.trail.push(() => (this.delayedEntries[index].isInstantiated = false));
368
+ this.instantiate(entry);
369
+ }
370
+ return isInstantiated;
371
+ }
372
+ }
373
+
374
+ const GENERATION_PROPAGATION_THRESHOLD = 3;
375
+
376
+ export class Ematch {
377
+ private eval: Eval;
378
+ private bindings = new Set<string>();
379
+ private queue: Queue;
380
+ private props: number[] = [];
381
+ private inferPatterns: PatternInferenceRw;
382
+ private mam: Mam;
383
+ private lazyMam: Mam | null = null;
384
+ readonly clauses: Clause[] = [];
385
+ private q2clauses = new Map<number, number>();
386
+ private watches = new Map<number, number[]>();
387
+ private isInQueueSet = false;
388
+ private nodeInQueue = new Set<number>();
389
+ private clauseInQueue = new Set<number>();
390
+ private qhead = 0;
391
+ private clauseQueue: number[] = [];
392
+ private evidence: EnodePair[] = [];
393
+ private names: DefinedNames;
394
+ private nnf: Nnf;
395
+ private subst: VarSubst;
396
+
397
+ constructor(
398
+ private ctx: EufSolver,
399
+ private qs: QSolver,
400
+ ) {
401
+ const manager = ctx.manager;
402
+ this.eval = new Eval(ctx);
403
+ this.queue = new Queue(this, ctx);
404
+ this.inferPatterns = new PatternInferenceRw(manager, new PatternInference(manager));
405
+ this.names = new DefinedNames(manager);
406
+ this.nnf = new Nnf(manager, this.names);
407
+ this.subst = new VarSubst(manager, true);
408
+ ctx.egraph.onMerge.push((root, other) => this.onMerge(root, other));
409
+ ctx.egraph.onMake = (node) => this.mam.addNode(node, false);
410
+ this.mam = new Mam(ctx, this.onBinding);
411
+ }
412
+
413
+ private ensureGroundEnodes(expr: number) {
414
+ for (const ground of getGroundSubterms(this.ctx.manager, expr)) this.qs.eInternalize(ground);
415
+ }
416
+
417
+ private ensureClauseGroundEnodes(clause: Clause) {
418
+ const manager = this.ctx.manager;
419
+ for (const pattern of manager.getQuantifier(clause.q).patterns)
420
+ this.ensureGroundEnodes(pattern);
421
+ for (const lit of clause.lits) {
422
+ this.ensureGroundEnodes(lit.lhs);
423
+ this.ensureGroundEnodes(lit.rhs);
424
+ }
425
+ }
426
+
427
+ // mk_justification: the explanation of the evidence, taken while it is created.
428
+ private mkJustification(generation: number, clause: Clause, binding: readonly Enode[]) {
429
+ const ctx = this.ctx;
430
+ const explain: number[] = [];
431
+ ctx.egraph.beginExplain();
432
+ for (const pair of this.evidence) {
433
+ if (pair[0].root === pair[1].root) ctx.egraph.explainEq(explain, pair[0], pair[1]);
434
+ else ctx.explainDiseq(explain, pair[0], pair[1]);
435
+ }
436
+ ctx.egraph.endExplain();
437
+ const justification: Justification = {
438
+ generation,
439
+ explain,
440
+ clause,
441
+ binding,
442
+ };
443
+ return ctx.mkConstraint(this.qs, justification);
444
+ }
445
+
446
+ getAntecedents(data: unknown, antecedents: number[]) {
447
+ const justification = data as Justification;
448
+ for (const payload of justification.explain) this.ctx.addExplain(payload);
449
+ antecedents.push(justification.clause.literal);
450
+ }
451
+
452
+ private nnfSkolem(quantifier: number) {
453
+ const manager = this.ctx.manager;
454
+ const definitions = new RefVector(manager);
455
+ const normalized = this.nnf.apply(quantifier, definitions);
456
+ const pulled = pullQuant(manager, normalized);
457
+ manager.decRef(normalized);
458
+ for (const definition of definitions.items) this.qs.addUnit(this.qs.mkLiteral(definition));
459
+ definitions.reset();
460
+ return pulled;
461
+ }
462
+
463
+ private onMerge(root: Enode, other: Enode) {
464
+ this.insertToPropagate(root.owner);
465
+ this.insertToPropagate(other.owner);
466
+ const otherWatches = this.watches.get(other.owner);
467
+ if (otherWatches !== undefined && otherWatches.length > 0) {
468
+ const rootWatches = this.getWatches(root.owner);
469
+ const size = rootWatches.length;
470
+ this.ctx.trail.push(() => (rootWatches.length = size));
471
+ rootWatches.push(...otherWatches);
472
+ }
473
+ this.mam.onMerge(root, other);
474
+ this.lazyMam?.onMerge(root, other);
475
+ }
476
+
477
+ private getWatches(expr: number) {
478
+ const existing = this.watches.get(expr);
479
+ if (existing !== undefined) return existing;
480
+ const created: number[] = [];
481
+ this.watches.set(expr, created);
482
+ return created;
483
+ }
484
+
485
+ private addWatch(node: Enode, clauseIndex: number) {
486
+ const watches = this.getWatches(node.root.owner);
487
+ const size = watches.length;
488
+ this.ctx.trail.push(() => (watches.length = size));
489
+ watches.push(clauseIndex);
490
+ }
491
+
492
+ private initWatch(expr: number, clauseIndex: number) {
493
+ const manager = this.ctx.manager;
494
+ const todo = [expr];
495
+ const marked = new Set<number>();
496
+ while (todo.length > 0) {
497
+ const term = todo.pop() as number;
498
+ if (marked.has(term)) continue;
499
+ marked.add(term);
500
+ if (manager.isGroundApp(term)) {
501
+ this.addWatch(this.ctx.egraph.find(term) as Enode, clauseIndex);
502
+ continue;
503
+ }
504
+ if (!manager.isApp(term)) continue;
505
+ todo.push(...manager.getArgs(term));
506
+ }
507
+ }
508
+
509
+ private initClauseWatch(clause: Clause) {
510
+ const manager = this.ctx.manager;
511
+ for (const lit of clause.lits) {
512
+ if (!manager.isGroundApp(lit.lhs)) this.initWatch(lit.lhs, clause.index);
513
+ if (!manager.isGroundApp(lit.rhs)) this.initWatch(lit.rhs, clause.index);
514
+ }
515
+ }
516
+
517
+ private getBindingKey(clause: Clause, nodes: readonly Enode[]) {
518
+ return `${clause.q}:${nodes.map((node) => node.owner).join(",")}`;
519
+ }
520
+
521
+ private allocBinding(clause: Clause, nodes: readonly Enode[], maxGeneration: number) {
522
+ if (this.bindings.has(this.getBindingKey(clause, nodes))) return null;
523
+ if (
524
+ this.bindings.has(
525
+ this.getBindingKey(
526
+ clause,
527
+ nodes.map((node) => node.root),
528
+ ),
529
+ )
530
+ )
531
+ return null;
532
+ const binding = new Binding(clause, maxGeneration, [...nodes]);
533
+ const key = this.getBindingKey(clause, binding.nodes);
534
+ this.bindings.add(key);
535
+ this.ctx.trail.push(() => this.bindings.delete(key));
536
+ return binding;
537
+ }
538
+
539
+ private onBinding = (
540
+ quantifier: number,
541
+ _pattern: number,
542
+ nodes: readonly Enode[],
543
+ maxGeneration: number,
544
+ ) => {
545
+ const clause = this.clauses[this.q2clauses.get(quantifier) as number];
546
+ const binding = this.allocBinding(clause, nodes, maxGeneration);
547
+ if (binding === null) return;
548
+ if (this.propagate(false, nodes, maxGeneration, clause).isDone) return;
549
+ pushToFront(clause, binding);
550
+ this.ctx.trail.push(() => {
551
+ removeFrom(clause, binding);
552
+ detach(binding);
553
+ });
554
+ };
555
+
556
+ // propagate(is_owned, ...): whether the binding needs no instantiation, and whether it
557
+ // propagated.
558
+ propagate(isOwned: boolean, binding: readonly Enode[], maxGeneration: number, clause: Clause) {
559
+ const ctx = this.ctx;
560
+ if (ctx.s.isInconsistent) return { isDone: true, isPropagated: false };
561
+ this.evidence = [];
562
+ const evaluated = this.eval.evalClause(binding, clause, this.evidence);
563
+ if (evaluated.value === L_TRUE) return { isDone: true, isPropagated: false };
564
+ if (evaluated.value === L_UNDEF && evaluated.idx === -1) {
565
+ for (const node of this.eval.watch) this.addWatch(node, clause.index);
566
+ for (let index = clause.numDecls; index-- > 0;) this.addWatch(binding[index], clause.index);
567
+ return { isDone: false, isPropagated: false };
568
+ }
569
+ if (evaluated.value === L_UNDEF && maxGeneration > GENERATION_PROPAGATION_THRESHOLD)
570
+ return { isDone: false, isPropagated: false };
571
+ const owned = isOwned ? binding : [...binding];
572
+ const justification = this.mkJustification(maxGeneration, clause, owned);
573
+ if (isOwned) this.propagateJustification(justification);
574
+ else this.props.push(justification);
575
+ return { isDone: true, isPropagated: true };
576
+ }
577
+
578
+ private propagateJustification(index: number) {
579
+ const justification = this.ctx.constraintData(index) as Justification;
580
+ const clause = justification.clause;
581
+ const lits = [clause.literal ^ 1];
582
+ for (const lit of clause.lits)
583
+ lits.push(this.instantiateLit(justification.generation, justification.binding, lit));
584
+ this.qs.addClause(lits);
585
+ }
586
+
587
+ private flushPropQueue() {
588
+ if (this.props.length === 0) return false;
589
+ for (let index = 0; index < this.props.length; index++)
590
+ this.propagateJustification(this.props[index]);
591
+ this.props = [];
592
+ return true;
593
+ }
594
+
595
+ addInstantiation(clause: Clause, binding: Binding, lit: number) {
596
+ this.evidence = [];
597
+ this.ctx.propagate(lit, this.mkJustification(binding.maxGeneration, clause, binding.nodes));
598
+ }
599
+
600
+ private instantiateLit(generation: number, binding: readonly Enode[], lit: QLit) {
601
+ const ctx = this.ctx;
602
+ const manager = ctx.manager;
603
+ const args = binding.map((node) => node.owner);
604
+ const outer = ctx.generation;
605
+ ctx.generation = generation + 1;
606
+ const sub = (expr: number) => {
607
+ const substituted = this.subst.apply(expr, args);
608
+ const result = ctx.mkLiteral(substituted);
609
+ manager.decRef(substituted);
610
+ return lit.sign ? result ^ 1 : result;
611
+ };
612
+ const result = (() => {
613
+ if (manager.isTrue(lit.rhs)) return sub(lit.lhs);
614
+ if (manager.isFalse(lit.rhs)) return sub(lit.lhs) ^ 1;
615
+ const eq = manager.mkEq(lit.lhs, lit.rhs);
616
+ manager.incRef(eq);
617
+ const eqLit = sub(eq);
618
+ manager.decRef(eq);
619
+ return eqLit;
620
+ })();
621
+ ctx.generation = outer;
622
+ return result;
623
+ }
624
+
625
+ private resetInQueue() {
626
+ if (this.isInQueueSet) return;
627
+ this.isInQueueSet = true;
628
+ this.ctx.trail.push(() => {
629
+ this.nodeInQueue.clear();
630
+ this.clauseInQueue.clear();
631
+ this.isInQueueSet = false;
632
+ });
633
+ }
634
+
635
+ private insertToPropagate(expr: number) {
636
+ this.resetInQueue();
637
+ if (this.nodeInQueue.has(expr)) return;
638
+ this.nodeInQueue.add(expr);
639
+ for (const index of this.watches.get(expr) ?? []) this.insertClauseInQueue(index);
640
+ }
641
+
642
+ private insertClauseInQueue(index: number) {
643
+ this.resetInQueue();
644
+ if (this.clauseInQueue.has(index)) return;
645
+ this.clauseInQueue.add(index);
646
+ this.clauseQueue.push(index);
647
+ this.ctx.trail.push(() => this.clauseQueue.pop());
648
+ }
649
+
650
+ // clausify: a basic clausifier, for a normalized quantifier.
651
+ private clausify(quantifier: number) {
652
+ const ctx = this.ctx;
653
+ const manager = ctx.manager;
654
+ const literal = ctx.mkLiteral(quantifier);
655
+ let q = this.qs.flatten(quantifier);
656
+ manager.incRef(q);
657
+ const isExists = manager.getQuantifier(q).kind === QUANTIFIER_EXISTS;
658
+ if (isExists) {
659
+ const data = manager.getQuantifier(q);
660
+ const body = mkNot(manager, data.body);
661
+ manager.incRef(body);
662
+ const updated = manager.mkQuantifier({ ...data, kind: QUANTIFIER_FORALL, body });
663
+ manager.incRef(updated);
664
+ manager.decRef(body);
665
+ manager.decRef(q);
666
+ q = updated;
667
+ }
668
+ const skolemized = this.nnfSkolem(q);
669
+ manager.decRef(q);
670
+ q = skolemized;
671
+ const ors = new RefVector(manager);
672
+ ors.push(manager.getQuantifier(q).body);
673
+ flattenOrVector(manager, ors);
674
+ const lits = ors.items.map((arg) => this.clausifyLiteral(arg));
675
+ ors.reset();
676
+ if (manager.getQuantifier(q).patterns.length === 0) {
677
+ const inferred = this.inferPatterns.rewrite(q);
678
+ manager.decRef(q);
679
+ q = inferred;
680
+ }
681
+ return new Clause(
682
+ this.clauses.length,
683
+ isExists ? literal ^ 1 : literal,
684
+ lits,
685
+ q,
686
+ manager.getQuantifier(q).sorts.length,
687
+ );
688
+ }
689
+
690
+ private clausifyLiteral(input: number): QLit {
691
+ const manager = this.ctx.manager;
692
+ const isNegated = manager.isNot(input);
693
+ const arg = isNegated ? manager.getArg(input, 0) : input;
694
+ const parts = (() => {
695
+ if (manager.getOp(arg) === OP_DISTINCT && manager.getNumArgs(arg) === 2)
696
+ return { lhs: manager.getArg(arg, 0), rhs: manager.getArg(arg, 1), sign: !isNegated };
697
+ if (!manager.isGroundApp(arg) && manager.getOp(arg) === OP_EQ)
698
+ return { lhs: manager.getArg(arg, 0), rhs: manager.getArg(arg, 1), sign: isNegated };
699
+ return { lhs: arg, rhs: isNegated ? manager.falseExpr : manager.trueExpr, sign: false };
700
+ })();
701
+ const isSwapped = manager.isTrue(parts.lhs) || manager.isFalse(parts.lhs);
702
+ const lhs = isSwapped ? parts.rhs : parts.lhs;
703
+ const rhs = isSwapped ? parts.lhs : parts.rhs;
704
+ const lit =
705
+ parts.sign && manager.isFalse(rhs)
706
+ ? { lhs, rhs: manager.trueExpr, sign: false }
707
+ : parts.sign && manager.isTrue(rhs)
708
+ ? { lhs, rhs: manager.falseExpr, sign: false }
709
+ : { lhs, rhs, sign: parts.sign };
710
+ manager.incRef(lit.lhs);
711
+ manager.incRef(lit.rhs);
712
+ return lit;
713
+ }
714
+
715
+ // attach_ground_pattern_terms: the ground subterms of patterns appear shared.
716
+ private attachGroundPatternTerms(pattern: number) {
717
+ for (const ground of getGroundSubterms(this.ctx.manager, pattern)) {
718
+ const node = this.ctx.egraph.find(ground) as Enode;
719
+ if (node.getThVar(this.qs.id) === NULL_THEORY_VAR) this.qs.mkVar(node);
720
+ }
721
+ }
722
+
723
+ private releaseClause(clause: Clause) {
724
+ const manager = this.ctx.manager;
725
+ for (const lit of clause.lits) {
726
+ manager.decRef(lit.lhs);
727
+ manager.decRef(lit.rhs);
728
+ }
729
+ manager.decRef(clause.q);
730
+ }
731
+
732
+ add(quantifier: number) {
733
+ const ctx = this.ctx;
734
+ const manager = ctx.manager;
735
+ const clause = this.clausify(quantifier);
736
+ const q = clause.q;
737
+ if (this.q2clauses.has(q)) {
738
+ this.releaseClause(clause);
739
+ return;
740
+ }
741
+ this.ensureClauseGroundEnodes(clause);
742
+ this.clauses.push(clause);
743
+ this.q2clauses.set(q, clause.index);
744
+ ctx.trail.push(() => {
745
+ const last = this.clauses.pop() as Clause;
746
+ this.q2clauses.delete(last.q);
747
+ this.releaseClause(last);
748
+ });
749
+ this.initClauseWatch(clause);
750
+ const patterns = manager.getQuantifier(q).patterns;
751
+ const hasUnaryPattern = patterns.some((pattern) => manager.getNumArgs(pattern) === 1);
752
+ const numEagerMultiPatterns = hasUnaryPattern ? 0 : 1;
753
+ let numMultiPatterns = 0;
754
+ for (const pattern of patterns) {
755
+ const isUnary = manager.getNumArgs(pattern) === 1;
756
+ if (!isUnary && numMultiPatterns >= numEagerMultiPatterns) {
757
+ this.lazyMam ??= new Mam(ctx, this.onBinding);
758
+ this.lazyMam.addPattern(q, pattern);
759
+ } else this.mam.addPattern(q, pattern);
760
+ this.attachGroundPatternTerms(pattern);
761
+ if (!isUnary) numMultiPatterns++;
762
+ }
763
+ }
764
+
765
+ unitPropagate() {
766
+ return this.propagateAll(false);
767
+ }
768
+
769
+ private propagateClause(clause: Clause, isFlushing: boolean) {
770
+ let isPropagated = false;
771
+ const toRemove: Binding[] = [];
772
+ const head = clause.bindings;
773
+ if (head === null) return false;
774
+ let binding = head;
775
+ do {
776
+ const result = this.propagate(true, binding.nodes, binding.maxGeneration, clause);
777
+ isPropagated ||= result.isPropagated;
778
+ if (result.isDone) toRemove.push(binding);
779
+ else if (isFlushing) {
780
+ this.queue.insert(binding);
781
+ toRemove.push(binding);
782
+ isPropagated = true;
783
+ }
784
+ binding = binding.next;
785
+ } while (binding !== clause.bindings);
786
+ for (const removed of toRemove) {
787
+ removeFrom(clause, removed);
788
+ detach(removed);
789
+ this.ctx.trail.push(() => pushToFront(clause, removed));
790
+ }
791
+ return isPropagated;
792
+ }
793
+
794
+ private propagateAll(isFlushing: boolean) {
795
+ const manager = this.ctx.manager;
796
+ this.mam.propagate();
797
+ let isPropagated = this.flushPropQueue();
798
+ if (isFlushing) {
799
+ for (const clause of this.clauses)
800
+ if (this.propagateClause(clause, isFlushing)) isPropagated = true;
801
+ } else {
802
+ if (this.qhead >= this.clauseQueue.length) return this.queue.propagate() || isPropagated;
803
+ const qhead = this.qhead;
804
+ this.ctx.trail.push(() => (this.qhead = qhead));
805
+ for (; this.qhead < this.clauseQueue.length && manager.limit.inc(); this.qhead++)
806
+ if (this.propagateClause(this.clauses[this.clauseQueue[this.qhead]], isFlushing))
807
+ isPropagated = true;
808
+ }
809
+ this.clauseInQueue.clear();
810
+ this.nodeInQueue.clear();
811
+ this.isInQueueSet = true;
812
+ if (this.queue.propagate()) isPropagated = true;
813
+ return isPropagated;
814
+ }
815
+
816
+ evaluate(binding: readonly Enode[], clause: Clause) {
817
+ this.evidence = [];
818
+ return this.eval.evalClause(binding, clause, this.evidence).value;
819
+ }
820
+
821
+ run() {
822
+ if (this.propagateAll(false)) return true;
823
+ this.lazyMam?.propagate();
824
+ if (this.propagateAll(false)) return true;
825
+ for (let index = 0; index < this.clauses.length; index++)
826
+ if (this.clauses[index].bindings !== null) this.insertClauseInQueue(index);
827
+ if (this.propagateAll(true)) return true;
828
+ return this.queue.lazyPropagate();
829
+ }
830
+ }