tla-ts 0.0.10-dev.63a6693bd → 0.0.10-dev.6b2a6741a

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 (551) hide show
  1. package/README.md +2 -1
  2. package/dist/compile.cjs +3 -3
  3. package/dist/compile.js +1 -1
  4. package/dist/deciders.cjs +41 -37
  5. package/dist/deciders.js +45 -41
  6. package/dist/index.cjs +1 -1
  7. package/dist/index.d.cts +5 -1
  8. package/dist/index.d.ts +5 -1
  9. package/dist/index.js +1 -1
  10. package/dist/parallel-worker.cjs +1 -1
  11. package/dist/parallel-worker.js +1 -1
  12. package/dist/prove-worker.cjs +1 -1
  13. package/dist/prove-worker.js +1 -1
  14. package/dist/prove.cjs +2682 -426
  15. package/dist/prove.js +2679 -423
  16. package/dist/run.cjs +43 -42
  17. package/dist/run.js +44 -43
  18. package/dist/tlapm.cjs +1 -1
  19. package/dist/tlapm.js +1 -1
  20. package/dist/transfer.cjs +43 -40
  21. package/dist/transfer.js +43 -40
  22. package/dist/worker.cjs +7 -7
  23. package/dist/worker.js +7 -7
  24. package/package.json +1 -1
  25. package/src/ast.ts +4 -3
  26. package/src/bags.ts +46 -28
  27. package/src/check-trace.ts +2 -16
  28. package/src/check.ts +349 -91
  29. package/src/cli/runtime-invariants.ts +20 -56
  30. package/src/cli/tlapm.ts +424 -62
  31. package/src/cli/tlc-arguments.ts +2 -2
  32. package/src/cli/tlc-output.ts +4 -5
  33. package/src/cli/tlc-usage.ts +0 -1
  34. package/src/cli/tlc.ts +26 -7
  35. package/src/cli/xml-exporter.ts +1 -1
  36. package/src/codegen.ts +9 -5
  37. package/src/dependencies.ts +72 -11
  38. package/src/dfid.ts +9 -2
  39. package/src/environment.ts +65 -36
  40. package/src/errors.ts +38 -3
  41. package/src/evaluate.ts +92 -32
  42. package/src/exit-codes.ts +5 -2
  43. package/src/instances.ts +5 -5
  44. package/src/java-overrides.ts +2 -2
  45. package/src/levels.ts +138 -90
  46. package/src/lexer.ts +5 -3
  47. package/src/liveness-checker.ts +572 -204
  48. package/src/liveness.ts +47 -32
  49. package/src/obligations/action.ts +10 -6
  50. package/src/obligations/anonymize.ts +33 -14
  51. package/src/obligations/enabled-axioms.ts +218 -0
  52. package/src/obligations/equality.ts +1 -3
  53. package/src/obligations/expression.ts +18 -6
  54. package/src/obligations/format.ts +0 -2
  55. package/src/obligations/generate.ts +22 -17
  56. package/src/obligations/index.ts +37 -7
  57. package/src/obligations/levels.ts +24 -11
  58. package/src/obligations/module.ts +1 -3
  59. package/src/obligations/normalize.ts +25 -17
  60. package/src/obligations/operators.ts +0 -2
  61. package/src/obligations/pragma.ts +53 -16
  62. package/src/obligations/printer.ts +48 -18
  63. package/src/obligations/proof.ts +3 -2
  64. package/src/obligations/regroup.ts +0 -2
  65. package/src/obligations/simplify.ts +17 -7
  66. package/src/obligations/source.ts +71 -17
  67. package/src/obligations/subexpression.ts +45 -18
  68. package/src/obligations/substitution.ts +1 -3
  69. package/src/obligations/temporal.ts +0 -2
  70. package/src/obligations/tuples.ts +0 -2
  71. package/src/parallel-worker.ts +8 -2
  72. package/src/parallel.ts +7 -2
  73. package/src/parser.ts +664 -287
  74. package/src/pretty-print.ts +1 -1
  75. package/src/prover/deciders.ts +11 -8
  76. package/src/prover/isabelle/decide.ts +3 -25
  77. package/src/prover/isabelle/encode.ts +71 -41
  78. package/src/prover/isabelle/isar/attrib.ts +250 -0
  79. package/src/prover/isabelle/isar/context.ts +335 -0
  80. package/src/prover/isabelle/isar/induct.ts +382 -0
  81. package/src/prover/isabelle/isar/inner-syntax.ts +149 -3
  82. package/src/prover/isabelle/isar/method.ts +506 -198
  83. package/src/prover/isabelle/isar/proof.ts +570 -14
  84. package/src/prover/isabelle/isar/rule-cases.ts +226 -0
  85. package/src/prover/isabelle/isar/theory.ts +479 -69
  86. package/src/prover/isabelle/isar/toplevel.ts +331 -0
  87. package/src/prover/isabelle/isar/type-check.ts +83 -8
  88. package/src/prover/isabelle/provers/blast/blast.ts +0 -2
  89. package/src/prover/isabelle/provers/blast/branch.ts +0 -2
  90. package/src/prover/isabelle/provers/blast/prove.ts +0 -2
  91. package/src/prover/isabelle/provers/blast/rules.ts +0 -2
  92. package/src/prover/isabelle/provers/blast/state.ts +0 -2
  93. package/src/prover/isabelle/provers/blast/term.ts +0 -2
  94. package/src/prover/isabelle/provers/clasimp.ts +1 -3
  95. package/src/prover/isabelle/provers/classical.ts +45 -20
  96. package/src/prover/isabelle/provers/hypsubst.ts +2 -4
  97. package/src/prover/isabelle/pure/bicompose.ts +0 -2
  98. package/src/prover/isabelle/pure/consts.ts +0 -2
  99. package/src/prover/isabelle/pure/conv.ts +0 -2
  100. package/src/prover/isabelle/pure/drule.ts +63 -4
  101. package/src/prover/isabelle/pure/envir.ts +0 -2
  102. package/src/prover/isabelle/pure/goal.ts +1 -3
  103. package/src/prover/isabelle/pure/logic.ts +0 -2
  104. package/src/prover/isabelle/pure/name.ts +0 -2
  105. package/src/prover/isabelle/pure/net.ts +0 -2
  106. package/src/prover/isabelle/pure/object-logic.ts +13 -7
  107. package/src/prover/isabelle/pure/pattern.ts +0 -2
  108. package/src/prover/isabelle/pure/raw-simplifier.ts +0 -2
  109. package/src/prover/isabelle/pure/rewriter.ts +4 -11
  110. package/src/prover/isabelle/pure/search.ts +0 -2
  111. package/src/prover/isabelle/pure/seq.ts +0 -2
  112. package/src/prover/isabelle/pure/simplifier.ts +26 -7
  113. package/src/prover/isabelle/pure/table.ts +0 -2
  114. package/src/prover/isabelle/pure/tactic.ts +0 -2
  115. package/src/prover/isabelle/pure/tactical.ts +0 -2
  116. package/src/prover/isabelle/pure/term-ord.ts +0 -2
  117. package/src/prover/isabelle/pure/term.ts +3 -5
  118. package/src/prover/isabelle/pure/thm.ts +0 -2
  119. package/src/prover/isabelle/pure/type.ts +0 -2
  120. package/src/prover/isabelle/pure/unify.ts +0 -2
  121. package/src/prover/isabelle/pure/variable.ts +0 -2
  122. package/src/prover/isabelle/tla/classical-setup.ts +1 -2
  123. package/src/prover/isabelle/tla/context.ts +51 -9
  124. package/src/prover/isabelle/tla/logic-data.ts +1 -1
  125. package/src/prover/isabelle/tla/logic.ts +40 -1
  126. package/src/prover/isabelle/tla/simpdata.ts +0 -2
  127. package/src/prover/isabelle/tools/intuitionistic.ts +28 -12
  128. package/src/prover/ocaml.ts +4 -1
  129. package/src/prover/prep/action.ts +19 -12
  130. package/src/prover/prep/enabled-axioms.ts +11 -2
  131. package/src/prover/prep/md5.ts +26 -29
  132. package/src/prover/prep/methods.ts +159 -50
  133. package/src/prover/prep/normalize.ts +38 -9
  134. package/src/prover/prove.ts +343 -65
  135. package/src/prover/ptl/decide.ts +95 -50
  136. package/src/prover/ptl/encode.ts +2 -3
  137. package/src/prover/ptl/tableau.ts +28 -2
  138. package/src/prover/smt/arithmetic.ts +310 -0
  139. package/src/prover/smt/axioms.ts +12 -8
  140. package/src/prover/smt/context.ts +42 -6
  141. package/src/prover/smt/data.ts +191 -84
  142. package/src/prover/smt/encode.ts +122 -43
  143. package/src/prover/smt/extensionality.ts +5 -3
  144. package/src/prover/smt/flatten.ts +4 -6
  145. package/src/prover/smt/format.ts +28 -4
  146. package/src/prover/smt/instances.ts +7 -1
  147. package/src/prover/smt/layout.ts +91 -0
  148. package/src/prover/smt/rewrite.ts +483 -116
  149. package/src/prover/smt/simplify.ts +441 -0
  150. package/src/prover/smt/solver/ackermannize-bv-tactic.ts +61 -0
  151. package/src/prover/smt/solver/ackr-helper.ts +179 -0
  152. package/src/prover/smt/solver/ackr-model-converter.ts +105 -0
  153. package/src/prover/smt/solver/act-cache.ts +0 -1
  154. package/src/prover/smt/solver/add-bounds-tactic.ts +59 -0
  155. package/src/prover/smt/solver/aig-tactic.ts +52 -0
  156. package/src/prover/smt/solver/aig.ts +889 -0
  157. package/src/prover/smt/solver/arith-rewriter.ts +613 -6
  158. package/src/prover/smt/solver/arith-terms.ts +121 -0
  159. package/src/prover/smt/solver/array-decl-plugin.ts +175 -0
  160. package/src/prover/smt/solver/array-rewriter.ts +309 -0
  161. package/src/prover/smt/solver/asserted-formulas.ts +93 -15
  162. package/src/prover/smt/solver/ast-lt.ts +165 -11
  163. package/src/prover/smt/solver/ast-util.ts +160 -2
  164. package/src/prover/smt/solver/ast.ts +1449 -41
  165. package/src/prover/smt/solver/auf-solver.ts +0 -1
  166. package/src/prover/smt/solver/bit-blast-tactic.ts +582 -0
  167. package/src/prover/smt/solver/bit-blaster.ts +871 -0
  168. package/src/prover/smt/solver/bound-manager.ts +196 -0
  169. package/src/prover/smt/solver/bound-simplifier.ts +600 -0
  170. package/src/prover/smt/solver/bv-bound-chk.ts +492 -0
  171. package/src/prover/smt/solver/bv-decl-plugin.ts +341 -0
  172. package/src/prover/smt/solver/bv-divrem-bounds.ts +95 -0
  173. package/src/prover/smt/solver/bv-rewriter.ts +1901 -0
  174. package/src/prover/smt/solver/bv1-blast.ts +214 -0
  175. package/src/prover/smt/solver/bv2fpa-converter.ts +174 -0
  176. package/src/prover/smt/solver/bv2int-rewriter.ts +544 -0
  177. package/src/prover/smt/solver/bv2real-rewriter.ts +533 -0
  178. package/src/prover/smt/solver/card2bv.ts +109 -0
  179. package/src/prover/smt/solver/case-split-queue.ts +0 -2
  180. package/src/prover/smt/solver/cg-table.ts +39 -25
  181. package/src/prover/smt/solver/check-logic.ts +330 -0
  182. package/src/prover/smt/solver/clause.ts +0 -1
  183. package/src/prover/smt/solver/cofactor-elim-term-ite.ts +278 -0
  184. package/src/prover/smt/solver/conflict-resolution.ts +78 -2
  185. package/src/prover/smt/solver/context.ts +533 -114
  186. package/src/prover/smt/solver/ctx-simplify.ts +21 -12
  187. package/src/prover/smt/solver/ctx-solver-simplify.ts +122 -0
  188. package/src/prover/smt/solver/datatype-decl-plugin.ts +572 -0
  189. package/src/prover/smt/solver/datatype-rewriter.ts +82 -0
  190. package/src/prover/smt/solver/demodulator.ts +786 -0
  191. package/src/prover/smt/solver/dependent-expr-state.ts +81 -0
  192. package/src/prover/smt/solver/der.ts +38 -10
  193. package/src/prover/smt/solver/diff-neq.ts +205 -0
  194. package/src/prover/smt/solver/distribute-forall.ts +57 -0
  195. package/src/prover/smt/solver/dom-simplify.ts +511 -0
  196. package/src/prover/smt/solver/dt2bv-tactic.ts +260 -0
  197. package/src/prover/smt/solver/dyn-ack.ts +0 -1
  198. package/src/prover/smt/solver/e-matching.ts +6 -7
  199. package/src/prover/smt/solver/elim-small-bv-tactic.ts +129 -0
  200. package/src/prover/smt/solver/elim-uncnstr.ts +542 -0
  201. package/src/prover/smt/solver/enode.ts +100 -3
  202. package/src/prover/smt/solver/eq2bv-tactic.ts +218 -0
  203. package/src/prover/smt/solver/euf/arith-axioms.ts +403 -0
  204. package/src/prover/smt/solver/euf/arith-internalize.ts +653 -0
  205. package/src/prover/smt/solver/euf/arith-solver.ts +889 -0
  206. package/src/prover/smt/solver/euf/array-axioms.ts +527 -0
  207. package/src/prover/smt/solver/euf/array-internalize.ts +428 -0
  208. package/src/prover/smt/solver/euf/array-solver.ts +306 -0
  209. package/src/prover/smt/solver/euf/bv-ackerman.ts +162 -0
  210. package/src/prover/smt/solver/euf/bv-internalize.ts +748 -0
  211. package/src/prover/smt/solver/euf/bv-solver.ts +449 -0
  212. package/src/prover/smt/solver/euf/dt-solver.ts +618 -0
  213. package/src/prover/smt/solver/euf/egraph.ts +901 -0
  214. package/src/prover/smt/solver/euf/euf-solver.ts +1204 -0
  215. package/src/prover/smt/solver/euf/fpa-solver.ts +317 -0
  216. package/src/prover/smt/solver/euf/mam.ts +1046 -0
  217. package/src/prover/smt/solver/euf/q-ematch.ts +829 -0
  218. package/src/prover/smt/solver/euf/q-mbi.ts +587 -0
  219. package/src/prover/smt/solver/euf/q-model-fixer.ts +296 -0
  220. package/src/prover/smt/solver/euf/q-solver.ts +361 -0
  221. package/src/prover/smt/solver/euf/th-solver.ts +328 -0
  222. package/src/prover/smt/solver/euf/th-solvers.ts +30 -0
  223. package/src/prover/smt/solver/expr-ref.ts +0 -1
  224. package/src/prover/smt/solver/expr-safe-replace.ts +26 -2
  225. package/src/prover/smt/solver/expr2polynomial.ts +271 -0
  226. package/src/prover/smt/solver/factor.ts +163 -0
  227. package/src/prover/smt/solver/fd-solver.ts +267 -0
  228. package/src/prover/smt/solver/fingerprints.ts +15 -15
  229. package/src/prover/smt/solver/fix-dl-var.ts +147 -0
  230. package/src/prover/smt/solver/flat-literals.ts +0 -1
  231. package/src/prover/smt/solver/fm-tactic.ts +884 -0
  232. package/src/prover/smt/solver/fpa-decl-plugin.ts +618 -0
  233. package/src/prover/smt/solver/fpa-rewriter.ts +639 -0
  234. package/src/prover/smt/solver/fpa2bv-converter.ts +2251 -0
  235. package/src/prover/smt/solver/fpa2bv-rewriter.ts +349 -0
  236. package/src/prover/smt/solver/fpa2bv-tactic.ts +73 -0
  237. package/src/prover/smt/solver/goal.ts +177 -15
  238. package/src/prover/smt/solver/goal2nlsat.ts +216 -0
  239. package/src/prover/smt/solver/guard-set.ts +219 -0
  240. package/src/prover/smt/solver/hash.ts +0 -1
  241. package/src/prover/smt/solver/hashtable.ts +30 -16
  242. package/src/prover/smt/solver/inf-eps.ts +63 -0
  243. package/src/prover/smt/solver/inj-axiom.ts +101 -0
  244. package/src/prover/smt/solver/internalizer.ts +109 -36
  245. package/src/prover/smt/solver/lackr.ts +381 -0
  246. package/src/prover/smt/solver/lbool.ts +0 -1
  247. package/src/prover/smt/solver/lia2card.ts +268 -0
  248. package/src/prover/smt/solver/lia2pb.ts +154 -0
  249. package/src/prover/smt/solver/literal.ts +0 -1
  250. package/src/prover/smt/solver/logic-tactics.ts +345 -0
  251. package/src/prover/smt/solver/lp/bound-propagator.ts +0 -1
  252. package/src/prover/smt/solver/lp/constraints.ts +0 -1
  253. package/src/prover/smt/solver/lp/containers.ts +7 -2
  254. package/src/prover/smt/solver/lp/core-solver.ts +18 -3
  255. package/src/prover/smt/solver/lp/cross-nested.ts +1 -4
  256. package/src/prover/smt/solver/lp/dep-intervals.ts +0 -3
  257. package/src/prover/smt/solver/lp/dependency.ts +0 -2
  258. package/src/prover/smt/solver/lp/dioph-eq.ts +0 -2
  259. package/src/prover/smt/solver/lp/explanation.ts +0 -1
  260. package/src/prover/smt/solver/lp/gomory.ts +0 -1
  261. package/src/prover/smt/solver/lp/hnf-cutter.ts +0 -1
  262. package/src/prover/smt/solver/lp/hnf.ts +0 -3
  263. package/src/prover/smt/solver/lp/int-cube.ts +3 -4
  264. package/src/prover/smt/solver/lp/int-solver.ts +0 -2
  265. package/src/prover/smt/solver/lp/lar-solver.ts +40 -4
  266. package/src/prover/smt/solver/lp/lar-term.ts +0 -1
  267. package/src/prover/smt/solver/lp/lp-settings.ts +0 -1
  268. package/src/prover/smt/solver/lp/maximize-term.ts +59 -10
  269. package/src/prover/smt/solver/lp/nex-creator.ts +3 -3
  270. package/src/prover/smt/solver/lp/nex.ts +2 -2
  271. package/src/prover/smt/solver/lp/nla-backoff.ts +0 -2
  272. package/src/prover/smt/solver/lp/nla-basics.ts +46 -3
  273. package/src/prover/smt/solver/lp/nla-core.ts +66 -11
  274. package/src/prover/smt/solver/lp/nla-divisions.ts +0 -2
  275. package/src/prover/smt/solver/lp/nla-emonics.ts +0 -1
  276. package/src/prover/smt/solver/lp/nla-factorization.ts +0 -1
  277. package/src/prover/smt/solver/lp/nla-grobner.ts +167 -85
  278. package/src/prover/smt/solver/lp/nla-horner.ts +0 -2
  279. package/src/prover/smt/solver/lp/nla-intervals.ts +0 -1
  280. package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +0 -2
  281. package/src/prover/smt/solver/lp/nla-monotone.ts +0 -1
  282. package/src/prover/smt/solver/lp/nla-order.ts +0 -2
  283. package/src/prover/smt/solver/lp/nla-patcher.ts +0 -1
  284. package/src/prover/smt/solver/lp/nla-powers.ts +220 -0
  285. package/src/prover/smt/solver/lp/nla-tangents.ts +0 -2
  286. package/src/prover/smt/solver/lp/nla-throttle.ts +0 -1
  287. package/src/prover/smt/solver/lp/nla-transcendentals.ts +324 -0
  288. package/src/prover/smt/solver/lp/nla-types.ts +0 -2
  289. package/src/prover/smt/solver/lp/nla-var-eqs.ts +0 -1
  290. package/src/prover/smt/solver/lp/nra-solver.ts +163 -99
  291. package/src/prover/smt/solver/lp/numeric-pair.ts +0 -1
  292. package/src/prover/smt/solver/lp/pdd-interval.ts +6 -3
  293. package/src/prover/smt/solver/lp/pdd-simplifier.ts +60 -21
  294. package/src/prover/smt/solver/lp/pdd-solver.ts +72 -41
  295. package/src/prover/smt/solver/lp/pdd.ts +725 -290
  296. package/src/prover/smt/solver/lp/random-updater.ts +0 -2
  297. package/src/prover/smt/solver/lp/static-matrix.ts +0 -1
  298. package/src/prover/smt/solver/lp/union-find.ts +7 -2
  299. package/src/prover/smt/solver/macro-finder.ts +530 -0
  300. package/src/prover/smt/solver/mam-compiler.ts +118 -88
  301. package/src/prover/smt/solver/mam-interpreter.ts +0 -1
  302. package/src/prover/smt/solver/max-bv-sharing-tactic.ts +17 -0
  303. package/src/prover/smt/solver/max-cliques.ts +105 -0
  304. package/src/prover/smt/solver/maxcore.ts +309 -0
  305. package/src/prover/smt/solver/maximize-ac-sharing.ts +8 -6
  306. package/src/prover/smt/solver/maxlex.ts +115 -0
  307. package/src/prover/smt/solver/maxsmt-base.ts +105 -0
  308. package/src/prover/smt/solver/maxsmt.ts +92 -0
  309. package/src/prover/smt/solver/mbp/mbp-arith.ts +467 -0
  310. package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +101 -0
  311. package/src/prover/smt/solver/mbp/mbp-plugin.ts +287 -0
  312. package/src/prover/smt/solver/mbp/mbp-qel.ts +48 -0
  313. package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +271 -0
  314. package/src/prover/smt/solver/mbp/mbp-term-graph.ts +606 -0
  315. package/src/prover/smt/solver/model-based-opt.ts +844 -0
  316. package/src/prover/smt/solver/model-checker.ts +17 -26
  317. package/src/prover/smt/solver/model-evaluator.ts +188 -12
  318. package/src/prover/smt/solver/model-finder.ts +0 -1
  319. package/src/prover/smt/solver/model-generator.ts +59 -30
  320. package/src/prover/smt/solver/model-macro-solver.ts +38 -27
  321. package/src/prover/smt/solver/model-printer.ts +214 -0
  322. package/src/prover/smt/solver/mpf.ts +709 -0
  323. package/src/prover/smt/solver/mus.ts +50 -0
  324. package/src/prover/smt/solver/muz/dl-context.ts +410 -0
  325. package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +97 -0
  326. package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +167 -0
  327. package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +125 -0
  328. package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +299 -0
  329. package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +455 -0
  330. package/src/prover/smt/solver/muz/dl-mk-slice.ts +340 -0
  331. package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +163 -0
  332. package/src/prover/smt/solver/muz/dl-rule-set.ts +273 -0
  333. package/src/prover/smt/solver/muz/dl-rule-transformer.ts +123 -0
  334. package/src/prover/smt/solver/muz/dl-rule.ts +496 -0
  335. package/src/prover/smt/solver/muz/hnf.ts +201 -0
  336. package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +176 -0
  337. package/src/prover/smt/solver/muz/horn-tactic.ts +201 -0
  338. package/src/prover/smt/solver/muz/rule-properties.ts +337 -0
  339. package/src/prover/smt/solver/muz/spacer-context.ts +1404 -0
  340. package/src/prover/smt/solver/muz/spacer-dl-interface.ts +52 -0
  341. package/src/prover/smt/solver/muz/spacer-generalizers.ts +241 -0
  342. package/src/prover/smt/solver/muz/spacer-manager.ts +127 -0
  343. package/src/prover/smt/solver/muz/spacer-pdr.ts +219 -0
  344. package/src/prover/smt/solver/muz/spacer-prop-solver.ts +333 -0
  345. package/src/prover/smt/solver/muz/spacer-util.ts +282 -0
  346. package/src/prover/smt/solver/muz/substitution.ts +203 -0
  347. package/src/prover/smt/solver/nla2bv-tactic.ts +285 -0
  348. package/src/prover/smt/solver/nlqsat.ts +484 -0
  349. package/src/prover/smt/solver/nlsat/algebraic.ts +305 -88
  350. package/src/prover/smt/solver/nlsat/atoms.ts +52 -35
  351. package/src/prover/smt/solver/nlsat/evaluator.ts +0 -1
  352. package/src/prover/smt/solver/nlsat/explain.ts +424 -211
  353. package/src/prover/smt/solver/nlsat/interval-set.ts +1 -2
  354. package/src/prover/smt/solver/nlsat/levelwise.ts +460 -241
  355. package/src/prover/smt/solver/nlsat/mpbq.ts +45 -1
  356. package/src/prover/smt/solver/nlsat/polynomial.ts +2366 -683
  357. package/src/prover/smt/solver/nlsat/solver.ts +282 -69
  358. package/src/prover/smt/solver/nlsat/transcendental-eval.ts +310 -0
  359. package/src/prover/smt/solver/nlsat/transcendentals.ts +391 -0
  360. package/src/prover/smt/solver/nlsat/types.ts +0 -2
  361. package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +8 -7
  362. package/src/prover/smt/solver/nlsat/upolynomial.ts +41 -20
  363. package/src/prover/smt/solver/nlsat-tactic.ts +82 -0
  364. package/src/prover/smt/solver/nnf.ts +105 -23
  365. package/src/prover/smt/solver/normalize-bounds.ts +53 -0
  366. package/src/prover/smt/solver/occf.ts +97 -0
  367. package/src/prover/smt/solver/opt-context.ts +792 -0
  368. package/src/prover/smt/solver/opt-nlsat.ts +386 -0
  369. package/src/prover/smt/solver/opt-pareto.ts +282 -0
  370. package/src/prover/smt/solver/opt-preprocess.ts +101 -0
  371. package/src/prover/smt/solver/opt-solver.ts +311 -0
  372. package/src/prover/smt/solver/opt-value.ts +55 -0
  373. package/src/prover/smt/solver/optsmt.ts +692 -0
  374. package/src/prover/smt/solver/parallel-tactic.ts +299 -0
  375. package/src/prover/smt/solver/pattern-inference.ts +19 -11
  376. package/src/prover/smt/solver/pb-rewriter.ts +281 -0
  377. package/src/prover/smt/solver/pb2bv-tactic.ts +540 -0
  378. package/src/prover/smt/solver/poly-rewriter.ts +202 -57
  379. package/src/prover/smt/solver/probes.ts +511 -0
  380. package/src/prover/smt/solver/propagate-values.ts +37 -21
  381. package/src/prover/smt/solver/proto-model.ts +650 -17
  382. package/src/prover/smt/solver/pull-quant.ts +28 -12
  383. package/src/prover/smt/solver/purify-arith.ts +632 -0
  384. package/src/prover/smt/solver/qe-arith-plugin.ts +1096 -0
  385. package/src/prover/smt/solver/qe-lite-der.ts +2 -3
  386. package/src/prover/smt/solver/qe-lite-fm.ts +3 -4
  387. package/src/prover/smt/solver/qe-lite.ts +37 -17
  388. package/src/prover/smt/solver/qe-mbp.ts +270 -0
  389. package/src/prover/smt/solver/qe.ts +1499 -0
  390. package/src/prover/smt/solver/qel.ts +25 -0
  391. package/src/prover/smt/solver/qi-queue.ts +0 -1
  392. package/src/prover/smt/solver/qsat.ts +814 -0
  393. package/src/prover/smt/solver/quant-hoist.ts +196 -0
  394. package/src/prover/smt/solver/quant-tactics.ts +16 -56
  395. package/src/prover/smt/solver/quantifier-analyzer.ts +9 -10
  396. package/src/prover/smt/solver/quantifier-manager.ts +25 -24
  397. package/src/prover/smt/solver/quasi-macros.ts +243 -0
  398. package/src/prover/smt/solver/random-gen.ts +0 -1
  399. package/src/prover/smt/solver/rational.ts +45 -1
  400. package/src/prover/smt/solver/recfun-decl-plugin.ts +262 -0
  401. package/src/prover/smt/solver/recfun-rewriter.ts +107 -0
  402. package/src/prover/smt/solver/reduce-args.ts +225 -0
  403. package/src/prover/smt/solver/reduce-bv-size.ts +119 -0
  404. package/src/prover/smt/solver/ref-vector.ts +0 -1
  405. package/src/prover/smt/solver/relevancy.ts +1 -2
  406. package/src/prover/smt/solver/rewriter-tpl.ts +77 -10
  407. package/src/prover/smt/solver/rewriter.ts +475 -36
  408. package/src/prover/smt/solver/rlimit.ts +38 -2
  409. package/src/prover/smt/solver/sat/asymm-branch.ts +325 -0
  410. package/src/prover/smt/solver/sat/big.ts +177 -0
  411. package/src/prover/smt/solver/sat/clause-use-list.ts +71 -0
  412. package/src/prover/smt/solver/sat/clause.ts +203 -0
  413. package/src/prover/smt/solver/sat/cleaner.ts +94 -0
  414. package/src/prover/smt/solver/sat/config.ts +122 -0
  415. package/src/prover/smt/solver/sat/consequences.ts +203 -0
  416. package/src/prover/smt/solver/sat/elim-eqs.ts +142 -0
  417. package/src/prover/smt/solver/sat/goal2sat.ts +526 -0
  418. package/src/prover/smt/solver/sat/inc-sat-solver.ts +378 -0
  419. package/src/prover/smt/solver/sat/model-converter.ts +136 -0
  420. package/src/prover/smt/solver/sat/pb-constraint.ts +261 -0
  421. package/src/prover/smt/solver/sat/pb-solver.ts +1577 -0
  422. package/src/prover/smt/solver/sat/probing.ts +170 -0
  423. package/src/prover/smt/solver/sat/sat-tactic.ts +44 -0
  424. package/src/prover/smt/solver/sat/sat2goal.ts +165 -0
  425. package/src/prover/smt/solver/sat/scc.ts +142 -0
  426. package/src/prover/smt/solver/sat/simplifier.ts +1618 -0
  427. package/src/prover/smt/solver/sat/solver.ts +2105 -0
  428. package/src/prover/smt/solver/sat/var-queue.ts +117 -0
  429. package/src/prover/smt/solver/sat/watch-list.ts +140 -0
  430. package/src/prover/smt/solver/search-tree.ts +284 -0
  431. package/src/prover/smt/solver/seq-axioms.ts +995 -0
  432. package/src/prover/smt/solver/seq-decl-plugin.ts +819 -0
  433. package/src/prover/smt/solver/seq-derive.ts +1298 -0
  434. package/src/prover/smt/solver/seq-eq-approx.ts +236 -0
  435. package/src/prover/smt/solver/seq-eq-solver.ts +439 -0
  436. package/src/prover/smt/solver/seq-factory.ts +89 -0
  437. package/src/prover/smt/solver/seq-monadic.ts +730 -0
  438. package/src/prover/smt/solver/seq-range-predicate.ts +235 -0
  439. package/src/prover/smt/solver/seq-re-rewriter.ts +1171 -0
  440. package/src/prover/smt/solver/seq-re-util.ts +758 -0
  441. package/src/prover/smt/solver/seq-regex-bisim.ts +144 -0
  442. package/src/prover/smt/solver/seq-regex-live.ts +200 -0
  443. package/src/prover/smt/solver/seq-rewriter.ts +2404 -0
  444. package/src/prover/smt/solver/seq-skolem.ts +294 -0
  445. package/src/prover/smt/solver/seq-subset.ts +165 -0
  446. package/src/prover/smt/solver/seq-view-witness.ts +353 -0
  447. package/src/prover/smt/solver/smt-consequences.ts +297 -0
  448. package/src/prover/smt/solver/smt-kernel.ts +90 -0
  449. package/src/prover/smt/solver/smt-logics.ts +66 -0
  450. package/src/prover/smt/solver/smt-setup.ts +544 -0
  451. package/src/prover/smt/solver/smt2-printer.ts +765 -0
  452. package/src/prover/smt/solver/smtlib-parser.ts +3228 -327
  453. package/src/prover/smt/solver/smtlib-script.ts +1843 -0
  454. package/src/prover/smt/solver/solve-eqs.ts +923 -0
  455. package/src/prover/smt/solver/solver.ts +113 -22
  456. package/src/prover/smt/solver/static-features.ts +314 -0
  457. package/src/prover/smt/solver/sticky-generations.ts +0 -1
  458. package/src/prover/smt/solver/tactic.ts +2012 -0
  459. package/src/prover/smt/solver/term-enumeration.ts +205 -0
  460. package/src/prover/smt/solver/theory-array.ts +1240 -0
  461. package/src/prover/smt/solver/theory-bv.ts +1200 -0
  462. package/src/prover/smt/solver/theory-char.ts +355 -0
  463. package/src/prover/smt/solver/theory-datatype.ts +598 -0
  464. package/src/prover/smt/solver/theory-finite-set.ts +30 -0
  465. package/src/prover/smt/solver/theory-fpa.ts +389 -0
  466. package/src/prover/smt/solver/theory-lra-axioms.ts +53 -2
  467. package/src/prover/smt/solver/theory-lra-bounds.ts +31 -5
  468. package/src/prover/smt/solver/theory-lra-final-check.ts +56 -71
  469. package/src/prover/smt/solver/theory-lra-internalize.ts +89 -11
  470. package/src/prover/smt/solver/theory-lra-model.ts +20 -35
  471. package/src/prover/smt/solver/theory-lra-propagate.ts +24 -28
  472. package/src/prover/smt/solver/theory-lra-state.ts +6 -22
  473. package/src/prover/smt/solver/theory-lra.ts +188 -2
  474. package/src/prover/smt/solver/theory-pb.ts +933 -0
  475. package/src/prover/smt/solver/theory-polymorphism.ts +58 -0
  476. package/src/prover/smt/solver/theory-recfun.ts +307 -0
  477. package/src/prover/smt/solver/theory-seq-regex.ts +867 -0
  478. package/src/prover/smt/solver/theory-seq-solve.ts +1373 -0
  479. package/src/prover/smt/solver/theory-seq-state.ts +852 -0
  480. package/src/prover/smt/solver/theory-seq.ts +961 -0
  481. package/src/prover/smt/solver/theory.ts +189 -0
  482. package/src/prover/smt/solver/tseitin-cnf.ts +485 -0
  483. package/src/prover/smt/solver/var-subst.ts +36 -14
  484. package/src/prover/smt/table.ts +3 -2
  485. package/src/prover/smt/types.ts +146 -0
  486. package/src/prover/tlapm/cache.ts +37 -16
  487. package/src/prover/tlapm-library.ts +3208 -0
  488. package/src/prover/verdict.ts +2 -0
  489. package/src/prover/zenon/decide.ts +10 -7
  490. package/src/prover/zenon/encode.ts +0 -2
  491. package/src/prover/zenon/eqrel.ts +0 -2
  492. package/src/prover/zenon/equality-rules.ts +24 -2
  493. package/src/prover/zenon/expr.ts +21 -2
  494. package/src/prover/zenon/index-table.ts +7 -4
  495. package/src/prover/zenon/isar-case.ts +1 -3
  496. package/src/prover/zenon/isar.ts +2 -4
  497. package/src/prover/zenon/llproof.ts +0 -2
  498. package/src/prover/zenon/mltoll.ts +0 -2
  499. package/src/prover/zenon/node.ts +20 -5
  500. package/src/prover/zenon/parse.ts +6 -2
  501. package/src/prover/zenon/phrase.ts +1 -3
  502. package/src/prover/zenon/proof.ts +0 -2
  503. package/src/prover/zenon/propositional-rules.ts +0 -2
  504. package/src/prover/zenon/rules.ts +2 -3
  505. package/src/prover/zenon/search.ts +7 -5
  506. package/src/prover/zenon/tla/functions.ts +0 -2
  507. package/src/prover/zenon/tla/llproof.ts +0 -2
  508. package/src/prover/zenon/tla/records.ts +0 -2
  509. package/src/prover/zenon/tla/rewrites.ts +0 -2
  510. package/src/prover/zenon/tla/sets.ts +7 -8
  511. package/src/prover/zenon/tla/terms.ts +0 -2
  512. package/src/prover/zenon/tla/tla.ts +0 -2
  513. package/src/resolve.ts +625 -189
  514. package/src/runtime.ts +7 -1
  515. package/src/sany/builtins.ts +10 -10
  516. package/src/sany/generation.ts +2 -13
  517. package/src/sany/generator-definitions.ts +3 -1
  518. package/src/sany/generator-expressions.ts +36 -30
  519. package/src/sany/generator-proofs.ts +5 -3
  520. package/src/sany/generator.ts +2 -1
  521. package/src/sany/levels.ts +0 -2
  522. package/src/sany/lexer.ts +3 -3
  523. package/src/sany/linter.ts +0 -2
  524. package/src/sany/modules.ts +4 -2
  525. package/src/sany/nodes.ts +1 -1
  526. package/src/sany/selectors.ts +11 -6
  527. package/src/sany/xml.ts +2 -3
  528. package/src/search.ts +209 -56
  529. package/src/simulate.ts +3 -0
  530. package/src/spec-description.ts +2 -2
  531. package/src/standard-definitions.ts +4 -0
  532. package/src/state-graph.ts +0 -2
  533. package/src/subexpressions.ts +265 -94
  534. package/src/successors.ts +2 -1
  535. package/src/symmetry.ts +3 -3
  536. package/src/tableau.ts +2 -2
  537. package/src/tlc/fingerprint.ts +81 -9
  538. package/src/tlc/jar-data.ts +10 -0
  539. package/src/tlc/messages.ts +3 -3
  540. package/src/tlc/order.ts +14 -3
  541. package/src/tlc/summary.ts +29 -14
  542. package/src/tlc/tlc-operators.ts +3 -1
  543. package/src/tlc/tlcext-operators.ts +61 -16
  544. package/src/tlc/trace-spec.ts +5 -5
  545. package/src/typed-tier.ts +6541 -0
  546. package/src/typescript/types.ts +2 -2
  547. package/src/values.ts +46 -27
  548. package/src/prover/isabelle/isar/statement.ts +0 -52
  549. package/src/prover/smt/solver/z3-license.txt +0 -10
  550. package/src/prover/tlaps-module.ts +0 -510
  551. package/src/prover/zenon/LICENSE +0 -32
@@ -9,6 +9,8 @@ export const isBackend = (prover: string): prover is Backend =>
9
9
 
10
10
  export interface Decision {
11
11
  verdict: Verdict;
12
+ output?: string;
13
+ errorOutput?: string;
12
14
  timeUsedMs: number;
13
15
  }
14
16
 
@@ -1,7 +1,5 @@
1
- // Ported from Zenon's main.ml, as shipped in tlapm. Copyright 1997 INRIA, see LICENSE.
2
-
3
1
  import { TlaZenonError } from "../../errors";
4
- import type { DecideOptions } from "../verdict";
2
+ import type { DecideOptions, Decision } from "../verdict";
5
3
  import { checkProof } from "./check/check";
6
4
  import { createRelations } from "./eqrel";
7
5
  import { createExpressions } from "./expr";
@@ -87,9 +85,14 @@ export const runZenon = (text: string, options: DecideOptions): ZenonRun => {
87
85
  };
88
86
  };
89
87
 
90
- type ZenonDecision = { verdict: "unsat"; proof: string } | { verdict: "unknown" };
88
+ const FAILURE_ERRORS = new Map<ZenonRun["failure"], string>([
89
+ ["exhausted", "Zenon error: exhausted search space without finding a proof\n"],
90
+ ["memory limit", "Zenon error: could not find a proof within the memory size limit\n"],
91
+ ]);
91
92
 
92
- export const decideZenon = (text: string, options: DecideOptions): ZenonDecision => {
93
- const isar = runZenon(text, options).isar;
94
- return isar === undefined ? { verdict: "unknown" } : { verdict: "unsat", proof: isar };
93
+ export const decideZenon = (text: string, options: DecideOptions): Omit<Decision, "timeUsedMs"> => {
94
+ const run = runZenon(text, options);
95
+ return run.isar === undefined
96
+ ? { verdict: "unknown", errorOutput: FAILURE_ERRORS.get(run.failure) }
97
+ : { verdict: "unsat", output: run.isar };
95
98
  };
@@ -1,5 +1,3 @@
1
- // A port of tlapm's Backend.Zenon.
2
-
3
1
  import { TlapmBugError, TlaProverError, TlaUnsupportedError } from "../../errors";
4
2
  import { createContext, getBoundName, popNames, pushName } from "../../obligations/printer";
5
3
  import type { Bound, Builtin, Expr, Hyp, Sequent } from "../../obligations/expression";
@@ -1,5 +1,3 @@
1
- // Ported from Zenon's eqrel.ml, as shipped in tlapm. Copyright 2004 INRIA, see LICENSE.
2
-
3
1
  import { TRUE, type Expr, type Expressions } from "./expr";
4
2
 
5
3
  export type Direction = "left" | "right";
@@ -1,11 +1,10 @@
1
- // Ported from Zenon's prove.ml, as shipped in tlapm. Copyright 2002 INRIA, see LICENSE.
2
-
3
1
  import { TlaZenonError } from "../../errors";
4
2
  import {
5
3
  isApp,
6
4
  isNegatedRelation,
7
5
  isRelation,
8
6
  isMeta,
7
+ preunify,
9
8
  type Expr,
10
9
  type NegatedRelationExpr,
11
10
  type NotExpr,
@@ -206,6 +205,29 @@ export const addReflexivity: SearchRule = (context, queue, formula, goalness) =>
206
205
  return [queue, false];
207
206
  };
208
207
 
208
+ export const addPreunification: SearchRule = (context, queue, formula, goalness) => {
209
+ const matches =
210
+ formula.kind === "not" && formula.args[0].kind === "app"
211
+ ? context.index.getPositive(formula.args[0].symbol)
212
+ : formula.kind === "app"
213
+ ? context.index.getNegative(formula.symbol)
214
+ : undefined;
215
+ if (matches === undefined) return [queue, false];
216
+ let current = queue;
217
+ for (let matchIndex = matches.length - 1; matchIndex >= 0; matchIndex--) {
218
+ const pairs = preunify(matches[matchIndex], formula);
219
+ for (let pairIndex = 0; pairIndex < pairs.length; pairIndex++)
220
+ current = makeInstance(
221
+ context.exprs,
222
+ current,
223
+ pairs[pairIndex][0],
224
+ pairs[pairIndex][1],
225
+ Math.min(goalness, context.index.getGoalness(matches[matchIndex])),
226
+ );
227
+ }
228
+ return [current, false];
229
+ };
230
+
209
231
  export const addCongruence: SearchRule = (context, queue, formula, goalness) => {
210
232
  const exprs = context.exprs;
211
233
  if (formula.kind !== "not" || !isApp(formula.args[0], "=", 2)) return [queue, false];
@@ -1,5 +1,3 @@
1
- // Ported from Zenon's expr.ml, as shipped in tlapm. Copyright 2002 INRIA, see LICENSE.
2
-
3
1
  import { TlaZenonError } from "../../errors";
4
2
  import { combine, createHasher, toInt63, type Int63 } from "./ocaml";
5
3
 
@@ -243,6 +241,27 @@ export const compareExprs = (left: Expr, right: Expr): number => {
243
241
  return 0;
244
242
  };
245
243
 
244
+ const NO_PAIRS: readonly [Expr, Expr][] = [];
245
+
246
+ const xpreunify = (
247
+ accu: readonly [Expr, Expr][],
248
+ left: Expr,
249
+ right: Expr,
250
+ ): readonly [Expr, Expr][] | undefined => {
251
+ if (left === right) return accu;
252
+ if (left.kind === "app" && right.kind === "app" && left.symbol === right.symbol) {
253
+ let current: readonly [Expr, Expr][] | undefined = accu;
254
+ for (let index = 0; index < left.args.length && current !== undefined; index++)
255
+ current = xpreunify(current, left.args[index], right.args[index]);
256
+ return current;
257
+ }
258
+ if (left.kind === "meta") return [[left.args[0], right], ...accu];
259
+ if (right.kind === "meta") return [[right.args[0], left], ...accu];
260
+ return undefined;
261
+ };
262
+
263
+ export const preunify = (left: Expr, right: Expr) => xpreunify(NO_PAIRS, left, right) ?? NO_PAIRS;
264
+
246
265
  type Substitution = [Expr, Expr][];
247
266
 
248
267
  const lookup = (map: Substitution, variable: Expr) => map.find((pair) => pair[0] === variable)?.[1];
@@ -1,5 +1,3 @@
1
- // Ported from Zenon's index.ml, as shipped in tlapm. Copyright 2004 INRIA, see LICENSE.
2
-
3
1
  import {
4
2
  getStringName,
5
3
  isApp,
@@ -264,8 +262,11 @@ export const createIndex = (exprs: Expressions) => {
264
262
  const suspect = group[0];
265
263
  const count = suspect.records.length;
266
264
  const missing = [
267
- ...Array.from({ length: count - suspect.cursor }, (_, offset) => suspect.cursor + offset),
268
- ...Array.from({ length: suspect.cursor }, (_, offset) => offset),
265
+ ...Array.from(
266
+ { length: count - suspect.cursor },
267
+ (_value, offset) => suspect.cursor + offset,
268
+ ),
269
+ ...Array.from({ length: suspect.cursor }, (_value, offset) => offset),
269
270
  ].find((index) => !suspect.records[index].isPresent);
270
271
  if (missing === undefined) return suspect.proof;
271
272
  suspects = [group.slice(1), ...suspects.slice(1)];
@@ -282,6 +283,8 @@ export const createIndex = (exprs: Expressions) => {
282
283
  getGoalness,
283
284
  findPositive: (symbol: string) => withGoalness(getLatestFirst(positive, symbol)),
284
285
  findNegative: (symbol: string) => withGoalness(getLatestFirst(negative, symbol)),
286
+ getPositive: (symbol: string) => positive.get(symbol),
287
+ getNegative: (symbol: string) => negative.get(symbol),
285
288
  findEqualRight: (term: Expr) => getLatestFirst(equalLeftRight, term),
286
289
  findEqualLeft: (term: Expr) => getLatestFirst(equalRightLeft, term),
287
290
  findDisequalities: (term: Expr) => [
@@ -1,5 +1,3 @@
1
- // Ported from Zenon's isar_case.ml and enum.ml, as shipped in tlapm. Copyright 2009 INRIA, see LICENSE.
2
-
3
1
  import { TlaZenonError } from "../../errors";
4
2
 
5
3
  interface Lexeme {
@@ -131,7 +129,7 @@ const getInstance = (pieces: Piece[], getValue: (piece: Progression) => number)
131
129
  const expandPattern = (count: number, text: string, isReversed: boolean) => {
132
130
  const pattern = parsePattern(text);
133
131
  if (pattern === undefined) return undefined;
134
- const positions = Array.from({ length: count }, (_, position) =>
132
+ const positions = Array.from({ length: count }, (_value, position) =>
135
133
  isReversed ? count - 1 - position : position,
136
134
  );
137
135
  return positions
@@ -1,5 +1,3 @@
1
- // Ported from Zenon's lltoisar.ml and the -oisar path of main.ml, as shipped in tlapm. Copyright 2008 INRIA, see LICENSE.
2
-
3
1
  import { TlaZenonError } from "../../errors";
4
2
  import { FALSE, GOAL_NAME, TRUE, type BinderExpr, type Expr, type Expressions } from "./expr";
5
3
  import type { Relations } from "./eqrel";
@@ -58,7 +56,7 @@ const toBase26 = (number: number): string =>
58
56
  : `${toBase26(Math.floor(number / 26))}${String.fromCharCode(97 + (number % 26))}`;
59
57
 
60
58
  const getPairs = <Item>(items: Item[]): [Item, Item][] =>
61
- Array.from({ length: Math.floor(items.length / 2) }, (_, position) => [
59
+ Array.from({ length: Math.floor(items.length / 2) }, (_value, position) => [
62
60
  items[2 * position],
63
61
  items[2 * position + 1],
64
62
  ]);
@@ -369,7 +367,7 @@ export const printIsar = (proof: MlProof, context: IsarContext): string | undefi
369
367
  dict,
370
368
  formulas,
371
369
  subproof,
372
- (_, position) => `by (rule zenon_${lemma}_${position} [OF ${conclusionName}])\n`,
370
+ (_value, position) => `by (rule zenon_${lemma}_${position} [OF ${conclusionName}])\n`,
373
371
  );
374
372
  };
375
373
 
@@ -1,5 +1,3 @@
1
- // Ported from Zenon's llproof.ml, as shipped in tlapm. Copyright 2004 INRIA, see LICENSE.
2
-
3
1
  import { TlaZenonError } from "../../errors";
4
2
  import { FALSE, TRUE, type Expr, type Expressions } from "./expr";
5
3
 
@@ -1,5 +1,3 @@
1
- // Ported from Zenon's mltoll.ml, as shipped in tlapm. Copyright 2004 INRIA, see LICENSE.
2
-
3
1
  import { TlaZenonError } from "../../errors";
4
2
  import type { Direction, Origin, RelationProperty, Relations } from "./eqrel";
5
3
  import {
@@ -1,5 +1,3 @@
1
- // Ported from Zenon's node.ml and heap.ml, as shipped in tlapm. Copyright 2001-2004 INRIA, see LICENSE.
2
-
3
1
  import type { Expr } from "./expr";
4
2
  import type { Rule } from "./proof";
5
3
 
@@ -95,7 +93,9 @@ export interface Queue {
95
93
  instSize: List<[number, Heap]>;
96
94
  instFront: List<Node>;
97
95
  instBack: List<Node>;
98
- insertedCount: number;
96
+ // The OCaml words of the nodes inserted so far. Removed nodes still count, because the queues of
97
+ // the branches above keep them.
98
+ nodeWords: number;
99
99
  }
100
100
 
101
101
  const SMALL_INSTANCES = 16;
@@ -116,7 +116,7 @@ export const EMPTY_QUEUE: Queue = {
116
116
  instSize: undefined,
117
117
  instFront: undefined,
118
118
  instBack: undefined,
119
- insertedCount: 0,
119
+ nodeWords: 0,
120
120
  };
121
121
 
122
122
  const insertByGoalness = (list: List<[number, Heap]>, entry: Entry): List<[number, Heap]> => {
@@ -155,8 +155,23 @@ const canInstantiate = (meta: Expr, expression: Expr): boolean => {
155
155
  }
156
156
  };
157
157
 
158
+ // A list cell and a node record take 3 and 6 words, and each block has a header word.
159
+ const getNodeWords = (node: Node) => {
160
+ let words =
161
+ 3 +
162
+ 6 +
163
+ 3 * node.conclusions.length +
164
+ 1 +
165
+ node.rule.args.length +
166
+ (typeof node.priority === "object" ? 2 : 0) +
167
+ 1 +
168
+ node.branches.length;
169
+ for (const branch of node.branches) words += 3 * branch.length;
170
+ return words;
171
+ };
172
+
158
173
  export const insertNode = (previous: Queue, node: Node): Queue => {
159
- const queue = { ...previous, insertedCount: previous.insertedCount + 1 };
174
+ const queue = { ...previous, nodeWords: previous.nodeWords + getNodeWords(node) };
160
175
  const priority = node.priority;
161
176
  if (priority === "prop")
162
177
  return node.branches.length < 2
@@ -1,5 +1,3 @@
1
- // Ported from Zenon's lexzen.mll and parsezen.mly, as shipped in tlapm. Copyright 2005 INRIA, see LICENSE.
2
-
3
1
  import { TlaZenonError } from "../../errors";
4
2
  import {
5
3
  FALSE,
@@ -233,6 +231,12 @@ export const parseZenon = (exprs: Expressions, text: string): Phrase[] => {
233
231
  kind: "def",
234
232
  definition: { kind: "real", name, symbol, params, body },
235
233
  });
234
+ } else if (token.kind === "keyword" && token.text === "$sig") {
235
+ expect("ident");
236
+ expect("open");
237
+ while (isAt("string")) next();
238
+ expect("close");
239
+ expect("string");
236
240
  } else throw new TlaZenonError(`Zenon: line ${token.line}: unsupported phrase ${token.text}`);
237
241
  }
238
242
  return phrases;
@@ -1,5 +1,3 @@
1
- // Ported from Zenon's phrase.ml, as shipped in tlapm. Copyright 2004 INRIA, see LICENSE.
2
-
3
1
  import type { Expr } from "./expr";
4
2
  import type { Definition, Phrase } from "./parse";
5
3
 
@@ -169,7 +167,7 @@ export const separate = (predefined: string[], phrases: Phrase[]) => {
169
167
  ...definitions.slice(previous + 1),
170
168
  ];
171
169
  const dependencyIndex = dependencies.findIndex((candidate) => candidate[0] === symbol);
172
- dependencies = dependencies.filter((_, position) => position !== dependencyIndex);
170
+ dependencies = dependencies.filter((_value, position) => position !== dependencyIndex);
173
171
  multiple.unshift(symbol);
174
172
  hypotheses.unshift(hypothesis, { formula: removed.origin, goalness: removed.goalness });
175
173
  } else {
@@ -1,5 +1,3 @@
1
- // Ported from Zenon's mlproof.ml, as shipped in tlapm. Copyright 2004 INRIA, see LICENSE.
2
-
3
1
  import type { Expr } from "./expr";
4
2
  import type { Definition } from "./parse";
5
3
 
@@ -1,5 +1,3 @@
1
- // Ported from Zenon's prove.ml, as shipped in tlapm. Copyright 2002 INRIA, see LICENSE.
2
-
3
1
  import { getStringValue } from "./equality-rules";
4
2
  import { isApp, type Expr, type Expressions } from "./expr";
5
3
  import { insertNode, type Queue } from "./node";
@@ -1,9 +1,8 @@
1
- // Ported from Zenon's prove.ml, as shipped in tlapm. Copyright 2002 INRIA, see LICENSE.
2
-
3
1
  import type { Relations } from "./eqrel";
4
2
  import {
5
3
  addCongruence,
6
4
  addMatches,
5
+ addPreunification,
7
6
  addReflexivity,
8
7
  addStringEqualities,
9
8
  addSymmetricMatches,
@@ -59,7 +58,6 @@ const addExtensions: SearchRule = (context, queue, formula, goalness) => {
59
58
  return [insertAll(queue, result.nodes), result.isStopped];
60
59
  };
61
60
 
62
- // Deviation from Zenon: newnodes_preunif is left out because it never adds a node.
63
61
  const RULES: SearchRule[] = [
64
62
  addAbsurd,
65
63
  addClosure,
@@ -72,6 +70,7 @@ const RULES: SearchRule[] = [
72
70
  addGamma,
73
71
  addUnfold,
74
72
  addReflexivity,
73
+ addPreunification,
75
74
  addCongruence,
76
75
  addTransitivity,
77
76
  addSymmetricMatches,
@@ -1,5 +1,3 @@
1
- // Ported from Zenon's prove.ml, as shipped in tlapm. Copyright 2002 INRIA, see LICENSE.
2
-
3
1
  import { TlaZenonError } from "../../errors";
4
2
  import { difference, isApp, isDisjoint, isMeta, isRelation, union, type Expr } from "./expr";
5
3
  import { getLimitFailure, type Limits } from "./limits";
@@ -127,8 +125,12 @@ interface SearchStatistics {
127
125
 
128
126
  export type SearchFailure = "exhausted" | "time limit" | "memory limit" | "aborted";
129
127
 
130
- // Deviation from Zenon, which gives up at a 1 GB heap: its heap passes that with 1.9 million queued nodes.
131
- const MAX_QUEUED_NODES = 1_900_000;
128
+ // Zenon gives up once its heap passes 1 GB. Modeled as a 2M-word formula table, 20 words per formula
129
+ // created and 1.1 per word of queued nodes, the heap is within 8% of Zenon's past 600 MB on the corpus.
130
+ const getHeapWords = (context: SearchContext, queue: Queue) =>
131
+ 2_000_000 + 20 * context.exprs.getCreatedCount() + 1.1 * queue.nodeWords;
132
+
133
+ const MAX_HEAP_WORDS = 1_000_000_000 / 8;
132
134
 
133
135
  export const search = (
134
136
  context: SearchContext,
@@ -221,7 +223,7 @@ export const search = (
221
223
  for (;;) {
222
224
  const limitFailure = getLimitFailure(limits);
223
225
  if (limitFailure !== undefined) return limitFailure;
224
- if (queue.insertedCount > MAX_QUEUED_NODES) return "memory limit";
226
+ if (getHeapWords(context, queue) > MAX_HEAP_WORDS) return "memory limit";
225
227
  if (formIndex < forms.length) {
226
228
  const entry = forms[formIndex++];
227
229
  const formula = entry[0];
@@ -1,5 +1,3 @@
1
- // Ported from Zenon's ext_tla.ml, as shipped in tlapm. Copyright 2008 INRIA, see LICENSE.
2
-
3
1
  import { isApp } from "../expr";
4
2
  import type { Priority } from "../node";
5
3
  import { makeRule } from "../proof";
@@ -1,5 +1,3 @@
1
- // Ported from Zenon's ext_tla.ml, as shipped in tlapm. Copyright 2008 INRIA, see LICENSE.
2
-
3
1
  import { TlaZenonError } from "../../../errors";
4
2
  import { difference, union, type Expr, type Expressions } from "../expr";
5
3
  import type { Lemma, LlProof, LlRule } from "../llproof";
@@ -1,5 +1,3 @@
1
- // Ported from Zenon's ext_tla.ml, as shipped in tlapm. Copyright 2008 INRIA, see LICENSE.
2
-
3
1
  import { compareExprs, getStringName, isApp, type Expr } from "../expr";
4
2
  import { stableSort } from "../ocaml";
5
3
  import { makeRule } from "../proof";
@@ -1,5 +1,3 @@
1
- // Ported from Zenon's ext_tla.ml, as shipped in tlapm. Copyright 2008 INRIA, see LICENSE.
2
-
3
1
  import { TlaZenonError } from "../../../errors";
4
2
  import {
5
3
  FALSE,
@@ -1,5 +1,3 @@
1
- // Ported from Zenon's ext_tla.ml, as shipped in tlapm. Copyright 2008 INRIA, see LICENSE.
2
-
3
1
  import { isApp, type Expr } from "../expr";
4
2
  import { makeRule } from "../proof";
5
3
  import {
@@ -316,17 +314,18 @@ export const getSubsetNodes = (literal: Literal): Item[] | undefined => {
316
314
  ]);
317
315
  }
318
316
  if (isApp(right, "TLA.cap", 2)) {
319
- // Zenon builds the same subset twice here, from the second set.
320
- const subset = exprs.eapp("TLA.subseteq", [left, right.args[1]]);
317
+ // Deviation from Zenon: ext_tla.ml builds both subsets from the second set, which is unsound.
318
+ const first = exprs.eapp("TLA.subseteq", [left, right.args[0]]);
319
+ const second = exprs.eapp("TLA.subseteq", [left, right.args[1]]);
321
320
  return isNegated
322
321
  ? makeExtensionNode(
323
322
  literal,
324
323
  "arity",
325
- makeRule("not_subseteq_cap", [formula, exprs.enot(subset), exprs.enot(subset)]),
326
- [[exprs.enot(subset)], [exprs.enot(subset)]],
324
+ makeRule("not_subseteq_cap", [formula, exprs.enot(first), exprs.enot(second)]),
325
+ [[exprs.enot(first)], [exprs.enot(second)]],
327
326
  )
328
- : makeExtensionNode(literal, "arity", makeRule("subseteq_cap", [formula, subset, subset]), [
329
- [subset, subset],
327
+ : makeExtensionNode(literal, "arity", makeRule("subseteq_cap", [formula, first, second]), [
328
+ [first, second],
330
329
  ]);
331
330
  }
332
331
  }
@@ -1,5 +1,3 @@
1
- // Ported from Zenon's ext_tla.ml, as shipped in tlapm. Copyright 2008 INRIA, see LICENSE.
2
-
3
1
  import { TlaZenonError } from "../../../errors";
4
2
  import { isApp, isRelation, type Expr, type Expressions, type RelationExpr } from "../expr";
5
3
  import type { Index } from "../index-table";
@@ -1,5 +1,3 @@
1
- // Ported from Zenon's ext_tla.ml, as shipped in tlapm. Copyright 2008 INRIA, see LICENSE.
2
-
3
1
  import {
4
2
  FALSE,
5
3
  isApp,