tla-ts 0.0.9 → 0.0.10-dev.09e53c2a6

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