tla-ts 0.0.9 → 0.0.10-dev.094b9b512

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