tla-ts 0.0.10-dev.f16792fed → 0.0.10-dev.f57f64938

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 (568) hide show
  1. package/README.md +2 -1
  2. package/dist/compile.cjs +6 -6
  3. package/dist/compile.js +10 -10
  4. package/dist/deciders.cjs +41 -37
  5. package/dist/deciders.js +57 -53
  6. package/dist/index.cjs +1 -1
  7. package/dist/index.d.cts +3 -0
  8. package/dist/index.d.ts +3 -0
  9. package/dist/index.js +1 -1
  10. package/dist/parallel-worker.cjs +1 -1
  11. package/dist/parallel-worker.js +1 -1
  12. package/dist/prove.cjs +2682 -426
  13. package/dist/prove.js +2681 -425
  14. package/dist/run.cjs +45 -42
  15. package/dist/run.js +47 -44
  16. package/dist/tlapm.cjs +2 -2
  17. package/dist/tlapm.js +2 -2
  18. package/dist/transfer.cjs +42 -39
  19. package/dist/transfer.js +42 -39
  20. package/dist/worker.cjs +7 -7
  21. package/dist/worker.js +7 -7
  22. package/package.json +1 -1
  23. package/src/ast.ts +41 -36
  24. package/src/builtins.ts +4 -13
  25. package/src/check-failure.ts +116 -0
  26. package/src/check-trace.ts +282 -0
  27. package/src/check.ts +353 -549
  28. package/src/cli/options.ts +6 -31
  29. package/src/cli/shared.ts +1 -1
  30. package/src/cli/tlapm.ts +433 -70
  31. package/src/cli/tlc-arguments.ts +222 -210
  32. package/src/cli/tlc-output.ts +687 -0
  33. package/src/cli/tlc-usage.ts +1 -2
  34. package/src/cli/tlc.ts +49 -702
  35. package/src/cli/xml-exporter.ts +23 -33
  36. package/src/codegen.ts +5 -10
  37. package/src/coverage.ts +0 -2
  38. package/src/dependencies.ts +30 -14
  39. package/src/dfid.ts +16 -16
  40. package/src/environment-config.ts +315 -0
  41. package/src/environment.ts +55 -338
  42. package/src/errors.ts +33 -5
  43. package/src/evaluate.ts +5 -4
  44. package/src/exit-codes.ts +1 -0
  45. package/src/fingerprints.ts +65 -1
  46. package/src/instances.ts +47 -10
  47. package/src/json.ts +4 -7
  48. package/src/levels.ts +39 -42
  49. package/src/lexer.ts +5 -3
  50. package/src/liveness-checker.ts +553 -237
  51. package/src/liveness.ts +94 -86
  52. package/src/obligations/action.ts +14 -17
  53. package/src/obligations/anonymize.ts +37 -16
  54. package/src/obligations/enabled-axioms.ts +218 -0
  55. package/src/obligations/equality.ts +1 -3
  56. package/src/obligations/expression.ts +36 -8
  57. package/src/obligations/format.ts +0 -2
  58. package/src/obligations/generate.ts +66 -54
  59. package/src/obligations/index.ts +38 -8
  60. package/src/obligations/levels.ts +24 -11
  61. package/src/obligations/module.ts +28 -41
  62. package/src/obligations/normalize.ts +26 -14
  63. package/src/obligations/operators.ts +0 -2
  64. package/src/obligations/pragma.ts +53 -16
  65. package/src/obligations/printer.ts +43 -13
  66. package/src/obligations/proof.ts +3 -2
  67. package/src/obligations/regroup.ts +0 -2
  68. package/src/obligations/simplify.ts +55 -50
  69. package/src/obligations/source.ts +118 -74
  70. package/src/obligations/subexpression.ts +45 -18
  71. package/src/obligations/substitution.ts +1 -3
  72. package/src/obligations/temporal.ts +5 -7
  73. package/src/obligations/tuples.ts +0 -2
  74. package/src/parallel-worker.ts +10 -30
  75. package/src/parallel.ts +24 -47
  76. package/src/parser.ts +580 -180
  77. package/src/pretty-print.ts +1 -1
  78. package/src/prover/decide-pool.ts +3 -3
  79. package/src/prover/deciders.ts +12 -9
  80. package/src/prover/isabelle/decide.ts +3 -25
  81. package/src/prover/isabelle/encode.ts +72 -42
  82. package/src/prover/isabelle/isar/attrib.ts +250 -0
  83. package/src/prover/isabelle/isar/context.ts +335 -0
  84. package/src/prover/isabelle/isar/induct.ts +382 -0
  85. package/src/prover/isabelle/isar/inner-syntax.ts +158 -7
  86. package/src/prover/isabelle/isar/method.ts +509 -212
  87. package/src/prover/isabelle/isar/proof.ts +570 -14
  88. package/src/prover/isabelle/isar/rule-cases.ts +224 -0
  89. package/src/prover/isabelle/isar/theory.ts +487 -76
  90. package/src/prover/isabelle/isar/toplevel.ts +331 -0
  91. package/src/prover/isabelle/isar/type-check.ts +89 -14
  92. package/src/prover/isabelle/provers/blast/blast.ts +7 -65
  93. package/src/prover/isabelle/provers/blast/branch.ts +0 -2
  94. package/src/prover/isabelle/provers/blast/prove.ts +0 -2
  95. package/src/prover/isabelle/provers/blast/rules.ts +0 -2
  96. package/src/prover/isabelle/provers/blast/state.ts +0 -2
  97. package/src/prover/isabelle/provers/blast/term.ts +0 -2
  98. package/src/prover/isabelle/provers/clasimp.ts +0 -2
  99. package/src/prover/isabelle/provers/classical.ts +45 -20
  100. package/src/prover/isabelle/provers/hypsubst.ts +17 -28
  101. package/src/prover/isabelle/pure/bicompose.ts +9 -27
  102. package/src/prover/isabelle/pure/consts.ts +0 -2
  103. package/src/prover/isabelle/pure/conv.ts +2 -10
  104. package/src/prover/isabelle/pure/drule.ts +72 -6
  105. package/src/prover/isabelle/pure/envir.ts +0 -2
  106. package/src/prover/isabelle/pure/goal.ts +1 -3
  107. package/src/prover/isabelle/pure/logic.ts +1 -3
  108. package/src/prover/isabelle/pure/name.ts +0 -2
  109. package/src/prover/isabelle/pure/net.ts +0 -2
  110. package/src/prover/isabelle/pure/object-logic.ts +13 -7
  111. package/src/prover/isabelle/pure/pattern.ts +0 -2
  112. package/src/prover/isabelle/pure/raw-simplifier.ts +4 -15
  113. package/src/prover/isabelle/pure/rewriter.ts +6 -17
  114. package/src/prover/isabelle/pure/search.ts +0 -2
  115. package/src/prover/isabelle/pure/seq.ts +0 -2
  116. package/src/prover/isabelle/pure/simplifier.ts +26 -7
  117. package/src/prover/isabelle/pure/table.ts +2 -3
  118. package/src/prover/isabelle/pure/tactic.ts +0 -2
  119. package/src/prover/isabelle/pure/tactical.ts +42 -37
  120. package/src/prover/isabelle/pure/term-ord.ts +0 -2
  121. package/src/prover/isabelle/pure/term.ts +0 -2
  122. package/src/prover/isabelle/pure/thm.ts +14 -13
  123. package/src/prover/isabelle/pure/type.ts +0 -2
  124. package/src/prover/isabelle/pure/unify.ts +0 -2
  125. package/src/prover/isabelle/pure/variable.ts +0 -2
  126. package/src/prover/isabelle/tla/classical-setup.ts +18 -16
  127. package/src/prover/isabelle/tla/context.ts +58 -11
  128. package/src/prover/isabelle/tla/logic-data.ts +1 -1
  129. package/src/prover/isabelle/tla/logic.ts +49 -21
  130. package/src/prover/isabelle/tla/simpdata.ts +1 -12
  131. package/src/prover/isabelle/tools/intuitionistic.ts +28 -12
  132. package/src/prover/ocaml.ts +4 -1
  133. package/src/prover/prep/action.ts +30 -31
  134. package/src/prover/prep/enabled-axioms.ts +11 -2
  135. package/src/prover/prep/fingerprint.ts +2 -5
  136. package/src/prover/prep/methods.ts +181 -51
  137. package/src/prover/prep/normalize.ts +38 -9
  138. package/src/prover/prove.ts +395 -94
  139. package/src/prover/ptl/decide.ts +95 -50
  140. package/src/prover/ptl/encode.ts +2 -3
  141. package/src/prover/ptl/tableau.ts +28 -2
  142. package/src/prover/smt/arithmetic.ts +310 -0
  143. package/src/prover/smt/axioms.ts +12 -8
  144. package/src/prover/smt/context.ts +43 -8
  145. package/src/prover/smt/data.ts +498 -379
  146. package/src/prover/smt/encode.ts +148 -57
  147. package/src/prover/smt/extensionality.ts +5 -3
  148. package/src/prover/smt/flatten.ts +4 -6
  149. package/src/prover/smt/format.ts +28 -4
  150. package/src/prover/smt/instances.ts +7 -1
  151. package/src/prover/smt/layout.ts +91 -0
  152. package/src/prover/smt/rewrite.ts +1021 -618
  153. package/src/prover/smt/simplify.ts +441 -0
  154. package/src/prover/smt/solver/ackermannize-bv-tactic.ts +61 -0
  155. package/src/prover/smt/solver/ackr-helper.ts +179 -0
  156. package/src/prover/smt/solver/ackr-model-converter.ts +105 -0
  157. package/src/prover/smt/solver/act-cache.ts +0 -1
  158. package/src/prover/smt/solver/add-bounds-tactic.ts +59 -0
  159. package/src/prover/smt/solver/aig-tactic.ts +52 -0
  160. package/src/prover/smt/solver/aig.ts +889 -0
  161. package/src/prover/smt/solver/arith-rewriter.ts +613 -6
  162. package/src/prover/smt/solver/arith-terms.ts +121 -0
  163. package/src/prover/smt/solver/array-decl-plugin.ts +175 -0
  164. package/src/prover/smt/solver/array-rewriter.ts +309 -0
  165. package/src/prover/smt/solver/asserted-formulas.ts +87 -16
  166. package/src/prover/smt/solver/ast-lt.ts +166 -12
  167. package/src/prover/smt/solver/ast-util.ts +160 -2
  168. package/src/prover/smt/solver/ast.ts +1427 -41
  169. package/src/prover/smt/solver/auf-solver.ts +2 -6
  170. package/src/prover/smt/solver/bit-blast-tactic.ts +582 -0
  171. package/src/prover/smt/solver/bit-blaster.ts +871 -0
  172. package/src/prover/smt/solver/bound-manager.ts +196 -0
  173. package/src/prover/smt/solver/bound-simplifier.ts +600 -0
  174. package/src/prover/smt/solver/bv-bound-chk.ts +492 -0
  175. package/src/prover/smt/solver/bv-decl-plugin.ts +338 -0
  176. package/src/prover/smt/solver/bv-divrem-bounds.ts +95 -0
  177. package/src/prover/smt/solver/bv-rewriter.ts +1901 -0
  178. package/src/prover/smt/solver/bv1-blast.ts +214 -0
  179. package/src/prover/smt/solver/bv2fpa-converter.ts +174 -0
  180. package/src/prover/smt/solver/bv2int-rewriter.ts +544 -0
  181. package/src/prover/smt/solver/bv2real-rewriter.ts +533 -0
  182. package/src/prover/smt/solver/card2bv.ts +110 -0
  183. package/src/prover/smt/solver/case-split-queue.ts +0 -2
  184. package/src/prover/smt/solver/cg-table.ts +39 -25
  185. package/src/prover/smt/solver/check-logic.ts +330 -0
  186. package/src/prover/smt/solver/clause.ts +0 -1
  187. package/src/prover/smt/solver/cofactor-elim-term-ite.ts +278 -0
  188. package/src/prover/smt/solver/conflict-resolution.ts +78 -2
  189. package/src/prover/smt/solver/context.ts +516 -115
  190. package/src/prover/smt/solver/ctx-simplify.ts +20 -10
  191. package/src/prover/smt/solver/ctx-solver-simplify.ts +122 -0
  192. package/src/prover/smt/solver/datatype-decl-plugin.ts +572 -0
  193. package/src/prover/smt/solver/datatype-rewriter.ts +82 -0
  194. package/src/prover/smt/solver/demodulator.ts +786 -0
  195. package/src/prover/smt/solver/dependent-expr-state.ts +81 -0
  196. package/src/prover/smt/solver/der.ts +38 -10
  197. package/src/prover/smt/solver/diff-neq.ts +206 -0
  198. package/src/prover/smt/solver/distribute-forall.ts +57 -0
  199. package/src/prover/smt/solver/dom-simplify.ts +511 -0
  200. package/src/prover/smt/solver/dt2bv-tactic.ts +260 -0
  201. package/src/prover/smt/solver/dyn-ack.ts +0 -1
  202. package/src/prover/smt/solver/e-matching.ts +7 -8
  203. package/src/prover/smt/solver/elim-small-bv-tactic.ts +129 -0
  204. package/src/prover/smt/solver/elim-uncnstr.ts +545 -0
  205. package/src/prover/smt/solver/enode.ts +100 -3
  206. package/src/prover/smt/solver/eq2bv-tactic.ts +218 -0
  207. package/src/prover/smt/solver/euf/arith-axioms.ts +403 -0
  208. package/src/prover/smt/solver/euf/arith-internalize.ts +653 -0
  209. package/src/prover/smt/solver/euf/arith-solver.ts +889 -0
  210. package/src/prover/smt/solver/euf/array-axioms.ts +527 -0
  211. package/src/prover/smt/solver/euf/array-internalize.ts +428 -0
  212. package/src/prover/smt/solver/euf/array-solver.ts +306 -0
  213. package/src/prover/smt/solver/euf/bv-ackerman.ts +162 -0
  214. package/src/prover/smt/solver/euf/bv-internalize.ts +748 -0
  215. package/src/prover/smt/solver/euf/bv-solver.ts +449 -0
  216. package/src/prover/smt/solver/euf/dt-solver.ts +618 -0
  217. package/src/prover/smt/solver/euf/egraph.ts +907 -0
  218. package/src/prover/smt/solver/euf/euf-solver.ts +1205 -0
  219. package/src/prover/smt/solver/euf/fpa-solver.ts +317 -0
  220. package/src/prover/smt/solver/euf/mam.ts +1050 -0
  221. package/src/prover/smt/solver/euf/q-ematch.ts +830 -0
  222. package/src/prover/smt/solver/euf/q-mbi.ts +587 -0
  223. package/src/prover/smt/solver/euf/q-model-fixer.ts +296 -0
  224. package/src/prover/smt/solver/euf/q-solver.ts +361 -0
  225. package/src/prover/smt/solver/euf/th-solver.ts +335 -0
  226. package/src/prover/smt/solver/euf/th-solvers.ts +30 -0
  227. package/src/prover/smt/solver/expr-ref.ts +0 -1
  228. package/src/prover/smt/solver/expr-safe-replace.ts +26 -2
  229. package/src/prover/smt/solver/expr2polynomial.ts +146 -0
  230. package/src/prover/smt/solver/factor.ts +141 -0
  231. package/src/prover/smt/solver/fd-solver.ts +265 -0
  232. package/src/prover/smt/solver/fingerprints.ts +15 -15
  233. package/src/prover/smt/solver/fix-dl-var.ts +148 -0
  234. package/src/prover/smt/solver/flat-literals.ts +0 -1
  235. package/src/prover/smt/solver/fm-tactic.ts +884 -0
  236. package/src/prover/smt/solver/fpa-decl-plugin.ts +618 -0
  237. package/src/prover/smt/solver/fpa-rewriter.ts +640 -0
  238. package/src/prover/smt/solver/fpa2bv-converter.ts +2249 -0
  239. package/src/prover/smt/solver/fpa2bv-rewriter.ts +348 -0
  240. package/src/prover/smt/solver/fpa2bv-tactic.ts +73 -0
  241. package/src/prover/smt/solver/goal.ts +175 -15
  242. package/src/prover/smt/solver/goal2nlsat.ts +189 -0
  243. package/src/prover/smt/solver/guard-set.ts +219 -0
  244. package/src/prover/smt/solver/hash.ts +0 -1
  245. package/src/prover/smt/solver/hashtable.ts +30 -16
  246. package/src/prover/smt/solver/inf-eps.ts +63 -0
  247. package/src/prover/smt/solver/inj-axiom.ts +101 -0
  248. package/src/prover/smt/solver/internalizer.ts +110 -38
  249. package/src/prover/smt/solver/lackr.ts +381 -0
  250. package/src/prover/smt/solver/lbool.ts +0 -1
  251. package/src/prover/smt/solver/lia2card.ts +268 -0
  252. package/src/prover/smt/solver/lia2pb.ts +154 -0
  253. package/src/prover/smt/solver/literal.ts +0 -1
  254. package/src/prover/smt/solver/logic-tactics.ts +345 -0
  255. package/src/prover/smt/solver/lp/bound-propagator.ts +0 -1
  256. package/src/prover/smt/solver/lp/constraints.ts +0 -1
  257. package/src/prover/smt/solver/lp/containers.ts +0 -1
  258. package/src/prover/smt/solver/lp/core-solver.ts +18 -3
  259. package/src/prover/smt/solver/lp/cross-nested.ts +0 -1
  260. package/src/prover/smt/solver/lp/dep-intervals.ts +0 -3
  261. package/src/prover/smt/solver/lp/dependency.ts +0 -2
  262. package/src/prover/smt/solver/lp/dioph-eq.ts +1 -10
  263. package/src/prover/smt/solver/lp/explanation.ts +0 -1
  264. package/src/prover/smt/solver/lp/gomory.ts +0 -1
  265. package/src/prover/smt/solver/lp/hnf-cutter.ts +1 -2
  266. package/src/prover/smt/solver/lp/hnf.ts +0 -3
  267. package/src/prover/smt/solver/lp/int-cube.ts +3 -4
  268. package/src/prover/smt/solver/lp/int-solver.ts +0 -2
  269. package/src/prover/smt/solver/lp/lar-solver.ts +40 -4
  270. package/src/prover/smt/solver/lp/lar-term.ts +0 -1
  271. package/src/prover/smt/solver/lp/lp-settings.ts +0 -1
  272. package/src/prover/smt/solver/lp/maximize-term.ts +59 -10
  273. package/src/prover/smt/solver/lp/nex-creator.ts +0 -1
  274. package/src/prover/smt/solver/lp/nex.ts +0 -1
  275. package/src/prover/smt/solver/lp/nla-backoff.ts +0 -2
  276. package/src/prover/smt/solver/lp/nla-basics.ts +0 -2
  277. package/src/prover/smt/solver/lp/nla-core.ts +42 -11
  278. package/src/prover/smt/solver/lp/nla-divisions.ts +0 -2
  279. package/src/prover/smt/solver/lp/nla-emonics.ts +0 -1
  280. package/src/prover/smt/solver/lp/nla-factorization.ts +0 -1
  281. package/src/prover/smt/solver/lp/nla-grobner.ts +9 -4
  282. package/src/prover/smt/solver/lp/nla-horner.ts +0 -2
  283. package/src/prover/smt/solver/lp/nla-intervals.ts +0 -1
  284. package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +0 -2
  285. package/src/prover/smt/solver/lp/nla-monotone.ts +0 -1
  286. package/src/prover/smt/solver/lp/nla-order.ts +0 -2
  287. package/src/prover/smt/solver/lp/nla-patcher.ts +0 -1
  288. package/src/prover/smt/solver/lp/nla-powers.ts +220 -0
  289. package/src/prover/smt/solver/lp/nla-tangents.ts +0 -2
  290. package/src/prover/smt/solver/lp/nla-throttle.ts +0 -1
  291. package/src/prover/smt/solver/lp/nla-transcendentals.ts +324 -0
  292. package/src/prover/smt/solver/lp/nla-types.ts +0 -2
  293. package/src/prover/smt/solver/lp/nla-var-eqs.ts +0 -1
  294. package/src/prover/smt/solver/lp/nra-solver.ts +25 -4
  295. package/src/prover/smt/solver/lp/numeric-pair.ts +0 -1
  296. package/src/prover/smt/solver/lp/pdd-interval.ts +0 -1
  297. package/src/prover/smt/solver/lp/pdd-simplifier.ts +0 -1
  298. package/src/prover/smt/solver/lp/pdd-solver.ts +0 -2
  299. package/src/prover/smt/solver/lp/pdd.ts +2 -2
  300. package/src/prover/smt/solver/lp/random-updater.ts +0 -2
  301. package/src/prover/smt/solver/lp/static-matrix.ts +0 -1
  302. package/src/prover/smt/solver/lp/union-find.ts +7 -2
  303. package/src/prover/smt/solver/macro-finder.ts +530 -0
  304. package/src/prover/smt/solver/mam-compiler.ts +122 -90
  305. package/src/prover/smt/solver/mam-interpreter.ts +0 -1
  306. package/src/prover/smt/solver/max-bv-sharing-tactic.ts +17 -0
  307. package/src/prover/smt/solver/max-cliques.ts +105 -0
  308. package/src/prover/smt/solver/maxcore.ts +309 -0
  309. package/src/prover/smt/solver/maximize-ac-sharing.ts +8 -6
  310. package/src/prover/smt/solver/maxlex.ts +115 -0
  311. package/src/prover/smt/solver/maxsmt-base.ts +105 -0
  312. package/src/prover/smt/solver/maxsmt.ts +92 -0
  313. package/src/prover/smt/solver/mbp/mbp-arith.ts +467 -0
  314. package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +101 -0
  315. package/src/prover/smt/solver/mbp/mbp-plugin.ts +287 -0
  316. package/src/prover/smt/solver/mbp/mbp-qel.ts +48 -0
  317. package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +271 -0
  318. package/src/prover/smt/solver/mbp/mbp-term-graph.ts +606 -0
  319. package/src/prover/smt/solver/model-based-opt.ts +844 -0
  320. package/src/prover/smt/solver/model-checker.ts +18 -27
  321. package/src/prover/smt/solver/model-evaluator.ts +188 -12
  322. package/src/prover/smt/solver/model-finder.ts +12 -18
  323. package/src/prover/smt/solver/model-generator.ts +56 -29
  324. package/src/prover/smt/solver/model-macro-solver.ts +49 -46
  325. package/src/prover/smt/solver/model-printer.ts +214 -0
  326. package/src/prover/smt/solver/mpf.ts +711 -0
  327. package/src/prover/smt/solver/mus.ts +51 -0
  328. package/src/prover/smt/solver/muz/dl-context.ts +404 -0
  329. package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +97 -0
  330. package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +167 -0
  331. package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +125 -0
  332. package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +299 -0
  333. package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +455 -0
  334. package/src/prover/smt/solver/muz/dl-mk-slice.ts +340 -0
  335. package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +163 -0
  336. package/src/prover/smt/solver/muz/dl-rule-set.ts +273 -0
  337. package/src/prover/smt/solver/muz/dl-rule-transformer.ts +123 -0
  338. package/src/prover/smt/solver/muz/dl-rule.ts +496 -0
  339. package/src/prover/smt/solver/muz/hnf.ts +201 -0
  340. package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +176 -0
  341. package/src/prover/smt/solver/muz/horn-tactic.ts +201 -0
  342. package/src/prover/smt/solver/muz/rule-properties.ts +337 -0
  343. package/src/prover/smt/solver/muz/spacer-context.ts +1406 -0
  344. package/src/prover/smt/solver/muz/spacer-dl-interface.ts +52 -0
  345. package/src/prover/smt/solver/muz/spacer-generalizers.ts +241 -0
  346. package/src/prover/smt/solver/muz/spacer-manager.ts +127 -0
  347. package/src/prover/smt/solver/muz/spacer-pdr.ts +218 -0
  348. package/src/prover/smt/solver/muz/spacer-prop-solver.ts +333 -0
  349. package/src/prover/smt/solver/muz/spacer-util.ts +282 -0
  350. package/src/prover/smt/solver/muz/substitution.ts +203 -0
  351. package/src/prover/smt/solver/nla2bv-tactic.ts +285 -0
  352. package/src/prover/smt/solver/nlqsat.ts +484 -0
  353. package/src/prover/smt/solver/nlsat/algebraic.ts +125 -12
  354. package/src/prover/smt/solver/nlsat/atoms.ts +20 -6
  355. package/src/prover/smt/solver/nlsat/evaluator.ts +0 -1
  356. package/src/prover/smt/solver/nlsat/explain.ts +63 -23
  357. package/src/prover/smt/solver/nlsat/interval-set.ts +1 -2
  358. package/src/prover/smt/solver/nlsat/levelwise.ts +3 -9
  359. package/src/prover/smt/solver/nlsat/mpbq.ts +45 -1
  360. package/src/prover/smt/solver/nlsat/polynomial.ts +13 -6
  361. package/src/prover/smt/solver/nlsat/solver.ts +234 -36
  362. package/src/prover/smt/solver/nlsat/transcendental-eval.ts +310 -0
  363. package/src/prover/smt/solver/nlsat/transcendentals.ts +367 -0
  364. package/src/prover/smt/solver/nlsat/types.ts +0 -2
  365. package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +1 -4
  366. package/src/prover/smt/solver/nlsat/upolynomial.ts +0 -2
  367. package/src/prover/smt/solver/nlsat-tactic.ts +82 -0
  368. package/src/prover/smt/solver/nnf.ts +105 -23
  369. package/src/prover/smt/solver/normalize-bounds.ts +53 -0
  370. package/src/prover/smt/solver/occf.ts +97 -0
  371. package/src/prover/smt/solver/opt-context.ts +787 -0
  372. package/src/prover/smt/solver/opt-nlsat.ts +375 -0
  373. package/src/prover/smt/solver/opt-pareto.ts +282 -0
  374. package/src/prover/smt/solver/opt-preprocess.ts +101 -0
  375. package/src/prover/smt/solver/opt-solver.ts +308 -0
  376. package/src/prover/smt/solver/opt-value.ts +55 -0
  377. package/src/prover/smt/solver/optsmt.ts +692 -0
  378. package/src/prover/smt/solver/parallel-tactic.ts +299 -0
  379. package/src/prover/smt/solver/pattern-inference.ts +19 -11
  380. package/src/prover/smt/solver/pb-rewriter.ts +284 -0
  381. package/src/prover/smt/solver/pb2bv-tactic.ts +540 -0
  382. package/src/prover/smt/solver/poly-rewriter.ts +202 -57
  383. package/src/prover/smt/solver/probes.ts +512 -0
  384. package/src/prover/smt/solver/propagate-values.ts +37 -21
  385. package/src/prover/smt/solver/proto-model.ts +648 -19
  386. package/src/prover/smt/solver/pull-quant.ts +28 -12
  387. package/src/prover/smt/solver/purify-arith.ts +632 -0
  388. package/src/prover/smt/solver/qe-arith-plugin.ts +1098 -0
  389. package/src/prover/smt/solver/qe-lite-der.ts +2 -3
  390. package/src/prover/smt/solver/qe-lite-fm.ts +3 -4
  391. package/src/prover/smt/solver/qe-lite.ts +37 -17
  392. package/src/prover/smt/solver/qe-mbp.ts +270 -0
  393. package/src/prover/smt/solver/qe.ts +1498 -0
  394. package/src/prover/smt/solver/qel.ts +25 -0
  395. package/src/prover/smt/solver/qi-queue.ts +0 -1
  396. package/src/prover/smt/solver/qsat.ts +814 -0
  397. package/src/prover/smt/solver/quant-hoist.ts +196 -0
  398. package/src/prover/smt/solver/quant-tactics.ts +16 -56
  399. package/src/prover/smt/solver/quantifier-analyzer.ts +19 -20
  400. package/src/prover/smt/solver/quantifier-manager.ts +8 -16
  401. package/src/prover/smt/solver/quasi-macros.ts +243 -0
  402. package/src/prover/smt/solver/random-gen.ts +0 -1
  403. package/src/prover/smt/solver/rational.ts +45 -1
  404. package/src/prover/smt/solver/recfun-decl-plugin.ts +261 -0
  405. package/src/prover/smt/solver/recfun-rewriter.ts +107 -0
  406. package/src/prover/smt/solver/reduce-args.ts +225 -0
  407. package/src/prover/smt/solver/reduce-bv-size.ts +119 -0
  408. package/src/prover/smt/solver/ref-vector.ts +0 -1
  409. package/src/prover/smt/solver/relevancy.ts +1 -2
  410. package/src/prover/smt/solver/rewriter-tpl.ts +77 -10
  411. package/src/prover/smt/solver/rewriter.ts +475 -36
  412. package/src/prover/smt/solver/rlimit.ts +25 -2
  413. package/src/prover/smt/solver/sat/asymm-branch.ts +325 -0
  414. package/src/prover/smt/solver/sat/big.ts +177 -0
  415. package/src/prover/smt/solver/sat/clause-use-list.ts +71 -0
  416. package/src/prover/smt/solver/sat/clause.ts +203 -0
  417. package/src/prover/smt/solver/sat/cleaner.ts +94 -0
  418. package/src/prover/smt/solver/sat/config.ts +122 -0
  419. package/src/prover/smt/solver/sat/consequences.ts +203 -0
  420. package/src/prover/smt/solver/sat/elim-eqs.ts +142 -0
  421. package/src/prover/smt/solver/sat/goal2sat.ts +526 -0
  422. package/src/prover/smt/solver/sat/inc-sat-solver.ts +378 -0
  423. package/src/prover/smt/solver/sat/model-converter.ts +136 -0
  424. package/src/prover/smt/solver/sat/pb-constraint.ts +261 -0
  425. package/src/prover/smt/solver/sat/pb-solver.ts +1577 -0
  426. package/src/prover/smt/solver/sat/probing.ts +170 -0
  427. package/src/prover/smt/solver/sat/sat-tactic.ts +43 -0
  428. package/src/prover/smt/solver/sat/sat2goal.ts +165 -0
  429. package/src/prover/smt/solver/sat/scc.ts +142 -0
  430. package/src/prover/smt/solver/sat/simplifier.ts +1618 -0
  431. package/src/prover/smt/solver/sat/solver.ts +2127 -0
  432. package/src/prover/smt/solver/sat/var-queue.ts +117 -0
  433. package/src/prover/smt/solver/sat/watch-list.ts +140 -0
  434. package/src/prover/smt/solver/search-tree.ts +284 -0
  435. package/src/prover/smt/solver/seq-axioms.ts +1010 -0
  436. package/src/prover/smt/solver/seq-decl-plugin.ts +819 -0
  437. package/src/prover/smt/solver/seq-derive.ts +1301 -0
  438. package/src/prover/smt/solver/seq-eq-approx.ts +236 -0
  439. package/src/prover/smt/solver/seq-eq-solver.ts +439 -0
  440. package/src/prover/smt/solver/seq-factory.ts +89 -0
  441. package/src/prover/smt/solver/seq-monadic.ts +728 -0
  442. package/src/prover/smt/solver/seq-range-predicate.ts +235 -0
  443. package/src/prover/smt/solver/seq-re-rewriter.ts +1170 -0
  444. package/src/prover/smt/solver/seq-re-util.ts +758 -0
  445. package/src/prover/smt/solver/seq-regex-bisim.ts +144 -0
  446. package/src/prover/smt/solver/seq-regex-live.ts +200 -0
  447. package/src/prover/smt/solver/seq-rewriter.ts +2402 -0
  448. package/src/prover/smt/solver/seq-skolem.ts +317 -0
  449. package/src/prover/smt/solver/seq-subset.ts +165 -0
  450. package/src/prover/smt/solver/seq-view-witness.ts +353 -0
  451. package/src/prover/smt/solver/smt-consequences.ts +297 -0
  452. package/src/prover/smt/solver/smt-kernel.ts +83 -0
  453. package/src/prover/smt/solver/smt-logics.ts +66 -0
  454. package/src/prover/smt/solver/smt-setup.ts +496 -0
  455. package/src/prover/smt/solver/smt2-printer.ts +765 -0
  456. package/src/prover/smt/solver/smtlib-parser.ts +3126 -316
  457. package/src/prover/smt/solver/smtlib-script.ts +1631 -0
  458. package/src/prover/smt/solver/solve-eqs.ts +929 -0
  459. package/src/prover/smt/solver/solver.ts +113 -22
  460. package/src/prover/smt/solver/static-features.ts +314 -0
  461. package/src/prover/smt/solver/sticky-generations.ts +0 -1
  462. package/src/prover/smt/solver/tactic.ts +1986 -0
  463. package/src/prover/smt/solver/term-enumeration.ts +205 -0
  464. package/src/prover/smt/solver/theory-array.ts +1240 -0
  465. package/src/prover/smt/solver/theory-bv.ts +1200 -0
  466. package/src/prover/smt/solver/theory-char.ts +355 -0
  467. package/src/prover/smt/solver/theory-datatype.ts +598 -0
  468. package/src/prover/smt/solver/theory-finite-set.ts +30 -0
  469. package/src/prover/smt/solver/theory-fpa.ts +389 -0
  470. package/src/prover/smt/solver/theory-lra-axioms.ts +53 -2
  471. package/src/prover/smt/solver/theory-lra-bounds.ts +31 -6
  472. package/src/prover/smt/solver/theory-lra-final-check.ts +56 -70
  473. package/src/prover/smt/solver/theory-lra-internalize.ts +86 -27
  474. package/src/prover/smt/solver/theory-lra-model.ts +20 -35
  475. package/src/prover/smt/solver/theory-lra-propagate.ts +24 -26
  476. package/src/prover/smt/solver/theory-lra-state.ts +6 -22
  477. package/src/prover/smt/solver/theory-lra.ts +188 -1
  478. package/src/prover/smt/solver/theory-pb.ts +934 -0
  479. package/src/prover/smt/solver/theory-polymorphism.ts +58 -0
  480. package/src/prover/smt/solver/theory-recfun.ts +307 -0
  481. package/src/prover/smt/solver/theory-seq-regex.ts +867 -0
  482. package/src/prover/smt/solver/theory-seq-solve.ts +1373 -0
  483. package/src/prover/smt/solver/theory-seq-state.ts +871 -0
  484. package/src/prover/smt/solver/theory-seq.ts +961 -0
  485. package/src/prover/smt/solver/theory.ts +189 -0
  486. package/src/prover/smt/solver/tseitin-cnf.ts +485 -0
  487. package/src/prover/smt/solver/var-subst.ts +36 -14
  488. package/src/prover/smt/table.ts +3 -2
  489. package/src/prover/smt/types.ts +146 -0
  490. package/src/prover/tlapm/cache.ts +50 -19
  491. package/src/prover/tlapm/tlapm.ts +15 -9
  492. package/src/prover/tlapm-library.ts +3208 -0
  493. package/src/prover/verdict.ts +9 -0
  494. package/src/prover/zenon/check/check.ts +1 -2
  495. package/src/prover/zenon/check/records.ts +1 -1
  496. package/src/prover/zenon/check/relations.ts +2 -1
  497. package/src/prover/zenon/check/rewrites.ts +2 -15
  498. package/src/prover/zenon/check/sets.ts +40 -58
  499. package/src/prover/zenon/check/terms.ts +1 -2
  500. package/src/prover/zenon/decide.ts +10 -7
  501. package/src/prover/zenon/encode.ts +0 -2
  502. package/src/prover/zenon/eqrel.ts +2 -2
  503. package/src/prover/zenon/equality-rules.ts +0 -2
  504. package/src/prover/zenon/expr.ts +7 -2
  505. package/src/prover/zenon/index-table.ts +9 -21
  506. package/src/prover/zenon/isar-case.ts +0 -2
  507. package/src/prover/zenon/isar.ts +35 -37
  508. package/src/prover/zenon/llproof.ts +2 -13
  509. package/src/prover/zenon/mltoll.ts +12 -30
  510. package/src/prover/zenon/node.ts +20 -5
  511. package/src/prover/zenon/parse.ts +9 -8
  512. package/src/prover/zenon/phrase.ts +0 -2
  513. package/src/prover/zenon/proof.ts +0 -2
  514. package/src/prover/zenon/propositional-rules.ts +0 -2
  515. package/src/prover/zenon/rules.ts +0 -2
  516. package/src/prover/zenon/search.ts +11 -19
  517. package/src/prover/zenon/tla/functions.ts +2 -4
  518. package/src/prover/zenon/tla/llproof.ts +9 -13
  519. package/src/prover/zenon/tla/records.ts +1 -8
  520. package/src/prover/zenon/tla/rewrites.ts +0 -2
  521. package/src/prover/zenon/tla/sets.ts +22 -22
  522. package/src/prover/zenon/tla/terms.ts +0 -2
  523. package/src/prover/zenon/tla/tla.ts +7 -8
  524. package/src/resolve.ts +56 -74
  525. package/src/runtime.ts +4 -0
  526. package/src/sany/generation.ts +394 -0
  527. package/src/sany/generator-def-entries.ts +210 -0
  528. package/src/sany/generator-definitions.ts +686 -0
  529. package/src/sany/generator-expressions.ts +1100 -0
  530. package/src/sany/generator-proofs.ts +662 -0
  531. package/src/sany/generator.ts +155 -2625
  532. package/src/sany/levels.ts +0 -2
  533. package/src/sany/lexer.ts +17 -16
  534. package/src/sany/linter.ts +0 -2
  535. package/src/sany/nodes.ts +2 -3
  536. package/src/sany/report.ts +3 -6
  537. package/src/sany/selectors.ts +35 -38
  538. package/src/sany/xml.ts +23 -55
  539. package/src/search.ts +205 -43
  540. package/src/simulate.ts +157 -133
  541. package/src/spec-description.ts +33 -48
  542. package/src/standard-definitions.ts +4 -0
  543. package/src/standard-modules.ts +16 -32
  544. package/src/state-graph.ts +0 -2
  545. package/src/substitution-levels.ts +5 -4
  546. package/src/successors.ts +6 -8
  547. package/src/symmetry.ts +2 -2
  548. package/src/tableau.ts +2 -2
  549. package/src/tlc/fingerprint.ts +81 -9
  550. package/src/tlc/messages.ts +20 -15
  551. package/src/tlc/random.ts +4 -4
  552. package/src/tlc/replay.ts +8 -15
  553. package/src/tlc/summary.ts +29 -14
  554. package/src/tlc/tlc-operators.ts +2 -3
  555. package/src/tlc/tlcext-operators.ts +44 -12
  556. package/src/tlc/trace-spec.ts +21 -40
  557. package/src/typed-tier.ts +6535 -0
  558. package/src/typescript/actions.ts +2 -4
  559. package/src/typescript/collections.ts +34 -20
  560. package/src/typescript/compile.ts +1 -3
  561. package/src/typescript/formula.ts +5 -3
  562. package/src/typescript/model.ts +4 -5
  563. package/src/typescript/steps.ts +20 -18
  564. package/src/values.ts +62 -152
  565. package/src/prover/isabelle/isar/statement.ts +0 -52
  566. package/src/prover/smt/solver/z3-license.txt +0 -10
  567. package/src/prover/tlaps-module.ts +0 -510
  568. package/src/prover/zenon/LICENSE +0 -32
@@ -1,7 +1,16 @@
1
1
  export type Verdict = "unsat" | "sat" | "unknown";
2
2
 
3
+ export const BACKENDS = ["zenon", "isabelle", "smt", "z3", "ls4"] as const;
4
+
5
+ export type Backend = (typeof BACKENDS)[number];
6
+
7
+ export const isBackend = (prover: string): prover is Backend =>
8
+ BACKENDS.some((backend) => backend === prover);
9
+
3
10
  export interface Decision {
4
11
  verdict: Verdict;
12
+ output?: string;
13
+ errorOutput?: string;
5
14
  timeUsedMs: number;
6
15
  }
7
16
 
@@ -87,8 +87,7 @@ export const checkProof = (root: Proof<Term>, context: CheckContext, limits: Lim
87
87
  if (!needed.has(subproof)) stack.push([subproof, false]);
88
88
  }
89
89
  const hypotheses = new Set(context.hypotheses.map(keys.getTopKey));
90
- const missing = [...(needed.get(root) ?? [])].filter((key) => !hypotheses.has(key));
91
- return missing.length === 0;
90
+ return [...(needed.get(root) ?? [])].every((key) => hypotheses.has(key));
92
91
  } catch (error) {
93
92
  if (error instanceof UncheckedError) return false;
94
93
  throw error;
@@ -25,7 +25,7 @@ export const getFields = (record: Term, constructor: "TLA.record" | "TLA.records
25
25
  return fields;
26
26
  };
27
27
 
28
- const getLabels = (fields: [Term, Term][]) =>
28
+ export const getLabels = (fields: [Term, Term][]) =>
29
29
  app(
30
30
  "TLA.set",
31
31
  fields.map((field) => field[0]),
@@ -1,4 +1,5 @@
1
- import type { CheckContext, RelationProperty, Term } from "./terms";
1
+ import type { RelationProperty } from "../eqrel";
2
+ import type { CheckContext, Term } from "./terms";
2
3
 
3
4
  type Polarity = "positive" | "negative" | "both";
4
5
 
@@ -1,15 +1,13 @@
1
1
  import type { PlainRuleName } from "../proof";
2
- import { getFields } from "./records";
2
+ import { getFields, getLabels } from "./records";
3
3
  import {
4
4
  and,
5
- app,
6
5
  domain,
7
6
  ensure,
8
7
  equal,
9
8
  expectApp,
10
9
  FALSE,
11
10
  fapply,
12
- getPairs,
13
11
  getStringText,
14
12
  instantiate,
15
13
  isApp,
@@ -157,18 +155,7 @@ export const REWRITE_RULES = {
157
155
  record_domain: (args, checker) =>
158
156
  getRewriteSpec(checker, args[0], args[2], (filled) => {
159
157
  const record = expectApp(filled, "TLA.DOMAIN", 1)[0];
160
- const fields = getPairs(expectApp(record, "TLA.record"));
161
- return [
162
- [
163
- instantiate(
164
- args[2],
165
- app(
166
- "TLA.set",
167
- fields.map((field) => field[0]),
168
- ),
169
- ),
170
- ],
171
- ];
158
+ return [[instantiate(args[2], getLabels(getFields(record, "TLA.record")))]];
172
159
  }),
173
160
  boolcase_not: (args, checker) =>
174
161
  getBoolCaseSpec(checker, args, (operand) => operand.kind === "not"),
@@ -40,6 +40,40 @@ const getSetEqualSpec = (formula: Term, isNegated: boolean, checker: Checker): R
40
40
  return { premises: [formula], branches: [[isNegated ? not(extensional) : extensional]] };
41
41
  };
42
42
 
43
+ const getUnionSpec = (formula: Term, isNegated: boolean, checker: Checker): RuleSpec => {
44
+ const spec = getMembershipSpec(formula, isNegated, "TLA.UNION", 1);
45
+ const exists = checker.bind("ex", "", (bound) =>
46
+ and(member(bound, spec.operands[0]), member(spec.element, bound)),
47
+ );
48
+ return { premises: [formula], branches: [[isNegated ? not(exists) : exists]] };
49
+ };
50
+
51
+ const getSetOfAllSpec = (formula: Term, isNegated: boolean, checker: Checker): RuleSpec => {
52
+ const spec = getMembershipSpec(formula, isNegated, "TLA.setOfAll", 2);
53
+ const mapping = spec.operands[1];
54
+ ensure(mapping.kind === "lam");
55
+ const exists = checker.bind("ex", "", (bound) =>
56
+ and(member(bound, spec.operands[0]), equal(spec.element, instantiate(mapping, bound))),
57
+ );
58
+ return { premises: [formula], branches: [[isNegated ? not(exists) : exists]] };
59
+ };
60
+
61
+ const getFuncSetSpec = (formula: Term, isNegated: boolean, checker: Checker): RuleSpec => {
62
+ const spec = getMembershipSpec(formula, isNegated, "TLA.FuncSet", 2);
63
+ const fcn = spec.element;
64
+ const conjuncts = [
65
+ app("TLA.isAFcn", [fcn]),
66
+ equal(domain(fcn), spec.operands[0]),
67
+ checker.bind("all", "", (bound) =>
68
+ imply(member(bound, spec.operands[0]), member(fapply(fcn, bound), spec.operands[1])),
69
+ ),
70
+ ];
71
+ return {
72
+ premises: [formula],
73
+ branches: isNegated ? conjuncts.map((inner) => [not(inner)]) : [conjuncts],
74
+ };
75
+ };
76
+
43
77
  export const SET_RULES = {
44
78
  in_emptyset: (args) => {
45
79
  ensure(isVariable(expectApp(args[0], "TLA.in", 2)[1], "TLA.emptyset"));
@@ -112,20 +146,8 @@ export const SET_RULES = {
112
146
  branches: [[not(app("TLA.subseteq", [spec.element, spec.operands[0]]))]],
113
147
  };
114
148
  },
115
- in_UNION: (args, checker) => {
116
- const spec = getMembershipSpec(args[0], false, "TLA.UNION", 1);
117
- const exists = checker.bind("ex", "", (bound) =>
118
- and(member(bound, spec.operands[0]), member(spec.element, bound)),
119
- );
120
- return { premises: [args[0]], branches: [[exists]] };
121
- },
122
- notin_UNION: (args, checker) => {
123
- const spec = getMembershipSpec(args[0], true, "TLA.UNION", 1);
124
- const exists = checker.bind("ex", "", (bound) =>
125
- and(member(bound, spec.operands[0]), member(spec.element, bound)),
126
- );
127
- return { premises: [args[0]], branches: [[not(exists)]] };
128
- },
149
+ in_UNION: (args, checker) => getUnionSpec(args[0], false, checker),
150
+ notin_UNION: (args, checker) => getUnionSpec(args[0], true, checker),
129
151
  in_cup: (args) => {
130
152
  const spec = getMembershipSpec(args[0], false, "TLA.cup", 2);
131
153
  return {
@@ -194,50 +216,10 @@ export const SET_RULES = {
194
216
  ],
195
217
  };
196
218
  },
197
- in_setofall: (args, checker) => {
198
- const spec = getMembershipSpec(args[0], false, "TLA.setOfAll", 2);
199
- const mapping = spec.operands[1];
200
- ensure(mapping.kind === "lam");
201
- const exists = checker.bind("ex", "", (bound) =>
202
- and(member(bound, spec.operands[0]), equal(spec.element, instantiate(mapping, bound))),
203
- );
204
- return { premises: [args[0]], branches: [[exists]] };
205
- },
206
- notin_setofall: (args, checker) => {
207
- const spec = getMembershipSpec(args[0], true, "TLA.setOfAll", 2);
208
- const mapping = spec.operands[1];
209
- ensure(mapping.kind === "lam");
210
- const exists = checker.bind("ex", "", (bound) =>
211
- and(member(bound, spec.operands[0]), equal(spec.element, instantiate(mapping, bound))),
212
- );
213
- return { premises: [args[0]], branches: [[not(exists)]] };
214
- },
215
- in_funcset: (args, checker) => {
216
- const spec = getMembershipSpec(args[0], false, "TLA.FuncSet", 2);
217
- const fcn = spec.element;
218
- const maps = checker.bind("all", "", (bound) =>
219
- imply(member(bound, spec.operands[0]), member(fapply(fcn, bound), spec.operands[1])),
220
- );
221
- return {
222
- premises: [args[0]],
223
- branches: [[app("TLA.isAFcn", [fcn]), equal(domain(fcn), spec.operands[0]), maps]],
224
- };
225
- },
226
- notin_funcset: (args, checker) => {
227
- const spec = getMembershipSpec(args[0], true, "TLA.FuncSet", 2);
228
- const fcn = spec.element;
229
- const maps = checker.bind("all", "", (bound) =>
230
- imply(member(bound, spec.operands[0]), member(fapply(fcn, bound), spec.operands[1])),
231
- );
232
- return {
233
- premises: [args[0]],
234
- branches: [
235
- [not(app("TLA.isAFcn", [fcn]))],
236
- [not(equal(domain(fcn), spec.operands[0]))],
237
- [not(maps)],
238
- ],
239
- };
240
- },
219
+ in_setofall: (args, checker) => getSetOfAllSpec(args[0], false, checker),
220
+ notin_setofall: (args, checker) => getSetOfAllSpec(args[0], true, checker),
221
+ in_funcset: (args, checker) => getFuncSetSpec(args[0], false, checker),
222
+ notin_funcset: (args, checker) => getFuncSetSpec(args[0], true, checker),
241
223
  except_notin_funcset: (args) => {
242
224
  const spec = getMembershipSpec(args[0], true, "TLA.FuncSet", 2);
243
225
  const except = expectApp(spec.element, "TLA.except", 3);
@@ -1,3 +1,4 @@
1
+ import type { RelationProperty } from "../eqrel";
1
2
  import type { ExprKind } from "../expr";
2
3
  import type { Definition } from "../parse";
3
4
  import type { PlainRuleName, RuleArgs } from "../proof";
@@ -20,8 +21,6 @@ export interface RuleSpec {
20
21
  branches: Term[][];
21
22
  }
22
23
 
23
- export type RelationProperty = "reflexive" | "symmetric" | "transitive";
24
-
25
24
  export type Binding = number | { formula: Term; env: Env; operators?: Operators };
26
25
 
27
26
  export type Env = Map<string, Binding>;
@@ -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,9 +1,9 @@
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";
6
4
 
5
+ export type RelationProperty = "reflexive" | "symmetric" | "transitive";
6
+
7
7
  export interface Origin {
8
8
  formula: Expr;
9
9
  directions: Direction[];
@@ -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 {
5
3
  isApp,
@@ -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
 
@@ -217,6 +215,11 @@ export const isApp = <Symbol extends string>(
217
215
  expression.symbol === symbol &&
218
216
  (arity === undefined || expression.args.length === arity);
219
217
 
218
+ export const getStringName = (expression: Expr) =>
219
+ isApp(expression, "$string", 1) && expression.args[0].kind === "var"
220
+ ? expression.args[0].symbol
221
+ : undefined;
222
+
220
223
  export const isMeta = (expression: Expr): expression is MetaExpr => expression.kind === "meta";
221
224
 
222
225
  export const isRelation = (expression: Expr): expression is RelationExpr =>
@@ -504,6 +507,8 @@ export const createExpressions = () => {
504
507
  emeta,
505
508
  eapp,
506
509
  enot,
510
+ binary,
511
+ binder,
507
512
  eand: (left: Expr, right: Expr) => binary("and", left, right),
508
513
  eor: (left: Expr, right: Expr) => binary("or", left, right),
509
514
  eimply: (left: Expr, right: Expr) => binary("imply", left, right),
@@ -1,6 +1,6 @@
1
- // Ported from Zenon's index.ml, as shipped in tlapm. Copyright 2004 INRIA, see LICENSE.
2
-
3
1
  import {
2
+ getStringName,
3
+ isApp,
4
4
  isNegatedRelation,
5
5
  isRelation,
6
6
  type Expr,
@@ -128,35 +128,23 @@ export const createIndex = (exprs: Expressions) => {
128
128
  if (head !== undefined) action(positive, getHeadKey(head), formula);
129
129
  };
130
130
 
131
- const getStringLiteral = (expression: Expr) =>
132
- expression.kind === "app" &&
133
- expression.symbol === "$string" &&
134
- expression.args.length === 1 &&
135
- expression.args[0].kind === "var"
136
- ? expression.args[0].symbol
137
- : undefined;
138
-
139
131
  const getStringEquality = (formula: Expr) => {
140
- if (formula.kind !== "app" || formula.symbol !== "=" || formula.args.length !== 2)
141
- return undefined;
142
- const rightString = getStringLiteral(formula.args[1]);
132
+ if (!isApp(formula, "=", 2)) return undefined;
133
+ const rightString = getStringName(formula.args[1]);
143
134
  if (rightString !== undefined)
144
135
  return { isReversed: false, term: formula.args[0], value: rightString };
145
- const leftString = getStringLiteral(formula.args[0]);
136
+ const leftString = getStringName(formula.args[0]);
146
137
  return leftString === undefined
147
138
  ? undefined
148
139
  : { isReversed: true, term: formula.args[1], value: leftString };
149
140
  };
150
141
 
151
- const isEquality = (formula: Expr) =>
152
- formula.kind === "app" && formula.symbol === "=" && formula.args.length === 2;
153
-
154
142
  const add = (formula: Expr, goalness: number) => {
155
143
  pushValue(formulas, formula, goalness);
156
- if (isEquality(formula)) {
144
+ if (isApp(formula, "=", 2)) {
157
145
  pushValue(equalLeftRight, formula.args[0], formula.args[1]);
158
146
  pushValue(equalRightLeft, formula.args[1], formula.args[0]);
159
- } else if (formula.kind === "not" && isEquality(formula.args[0])) {
147
+ } else if (formula.kind === "not" && isApp(formula.args[0], "=", 2)) {
160
148
  pushValue(unequalLeftRight, formula.args[0].args[0], formula.args[0].args[1]);
161
149
  pushValue(unequalRightLeft, formula.args[0].args[1], formula.args[0].args[0]);
162
150
  }
@@ -209,10 +197,10 @@ export const createIndex = (exprs: Expressions) => {
209
197
  const stringEquality = getStringEquality(formula);
210
198
  if (stringEquality !== undefined)
211
199
  (stringEquality.isReversed ? reversedStringEqualities : stringEqualities).shift();
212
- if (isEquality(formula)) {
200
+ if (isApp(formula, "=", 2)) {
213
201
  popValue(equalLeftRight, formula.args[0]);
214
202
  popValue(equalRightLeft, formula.args[1]);
215
- } else if (formula.kind === "not" && isEquality(formula.args[0])) {
203
+ } else if (formula.kind === "not" && isApp(formula.args[0], "=", 2)) {
216
204
  popValue(unequalLeftRight, formula.args[0].args[0]);
217
205
  popValue(unequalRightLeft, formula.args[0].args[1]);
218
206
  }
@@ -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 {
@@ -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";
@@ -10,40 +8,40 @@ import { isMetaName, translateProof, type MlProof } from "./mltoll";
10
8
  import type { Phrase } from "./parse";
11
9
  import { postprocessTla } from "./tla/llproof";
12
10
 
13
- const INFIXES: Record<string, string> = {
14
- "=": "=",
15
- "TLA.cup": " \\\\cup ",
16
- "TLA.cap": " \\\\cap ",
17
- "TLA.setminus": " \\\\ ",
18
- "TLA.in": " \\\\in ",
19
- "TLA.subseteq": " \\\\subseteq ",
20
- "arith.natrange": "..",
21
- "arith.add": " + ",
22
- "arith.sub": " - ",
23
- "arith.mul": " * ",
24
- "arith.le": " <= ",
25
- "arith.lt": " < ",
26
- "TLA.concat": " \\\\circ ",
27
- "TLA.oneArg": " :> ",
28
- "TLA.extend": " @@ ",
29
- };
11
+ const INFIXES = new Map([
12
+ ["=", "="],
13
+ ["TLA.cup", " \\\\cup "],
14
+ ["TLA.cap", " \\\\cap "],
15
+ ["TLA.setminus", " \\\\ "],
16
+ ["TLA.in", " \\\\in "],
17
+ ["TLA.subseteq", " \\\\subseteq "],
18
+ ["arith.natrange", ".."],
19
+ ["arith.add", " + "],
20
+ ["arith.sub", " - "],
21
+ ["arith.mul", " * "],
22
+ ["arith.le", " <= "],
23
+ ["arith.lt", " < "],
24
+ ["TLA.concat", " \\\\circ "],
25
+ ["TLA.oneArg", " :> "],
26
+ ["TLA.extend", " @@ "],
27
+ ]);
30
28
 
31
- const CONSTANTS: Record<string, string> = {
32
- "TLA.emptyset": "{}",
33
- "arith.N": "Nat",
34
- "arith.Z": "Int",
35
- "arith.R": "isReal",
36
- "arith.Infinity": "isInfinity",
37
- };
29
+ const CONSTANTS = new Map([
30
+ ["TLA.emptyset", "{}"],
31
+ ["arith.N", "Nat"],
32
+ ["arith.Z", "Int"],
33
+ ["arith.R", "isReal"],
34
+ ["arith.Infinity", "isInfinity"],
35
+ ]);
38
36
 
39
- const PREFIXES: Record<string, string> = {
40
- "arith.div": "isa'slash",
41
- "arith.euclidiv": "isa'div",
42
- "arith.mod": "isa'pc",
43
- "arith.minus": " -.",
44
- "arith.intrange": "isa'dotdot",
45
- "TLA.box": "isa'box",
46
- };
37
+ const PREFIXES = new Map([
38
+ ["arith.div", "isa'slash"],
39
+ ["arith.euclidiv", "isa'div"],
40
+ ["arith.mod", "isa'pc"],
41
+ ["arith.minus", " -."],
42
+ ["arith.intrange", "isa'dotdot"],
43
+ ["TLA.box", "isa'box"],
44
+ ]);
47
45
 
48
46
  const stripNamespace = (symbol: string) =>
49
47
  symbol.length > 4 && symbol.startsWith("TLA.")
@@ -159,7 +157,7 @@ export const printIsar = (proof: MlProof, context: IsarContext): string | undefi
159
157
  case "var":
160
158
  return isMetaName(expression.symbol)
161
159
  ? "(CHOOSE x : TRUE)"
162
- : (CONSTANTS[expression.symbol] ?? stripNamespace(expression.symbol));
160
+ : (CONSTANTS.get(expression.symbol) ?? stripNamespace(expression.symbol));
163
161
  case "app": {
164
162
  const args = expression.args;
165
163
  switch (expression.symbol) {
@@ -192,11 +190,11 @@ export const printIsar = (proof: MlProof, context: IsarContext): string | undefi
192
190
  if (numeral !== undefined) return String(numeral + 1);
193
191
  return `(${print(args[0])}[${print(args[1])}])`;
194
192
  }
195
- const infix = INFIXES[expression.symbol];
193
+ const infix = INFIXES.get(expression.symbol);
196
194
  if (infix !== undefined && args.length === 2)
197
195
  return `(${print(args[0])}${infix}${print(args[1])})`;
198
196
  if (args.length === 0) return expression.symbol;
199
- return `${PREFIXES[expression.symbol] ?? stripNamespace(expression.symbol)}(${printList(args)})`;
197
+ return `${PREFIXES.get(expression.symbol) ?? stripNamespace(expression.symbol)}(${printList(args)})`;
200
198
  }
201
199
  case "not": {
202
200
  const operand = expression.args[0];
@@ -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
 
@@ -39,15 +37,6 @@ export interface Lemma {
39
37
  proof: LlProof;
40
38
  }
41
39
 
42
- export const connect = (exprs: Expressions, connective: Connective, left: Expr, right: Expr) =>
43
- connective === "and"
44
- ? exprs.eand(left, right)
45
- : connective === "or"
46
- ? exprs.eor(left, right)
47
- : connective === "imply"
48
- ? exprs.eimply(left, right)
49
- : exprs.eequiv(left, right);
50
-
51
40
  const getLemma = (lemmas: Map<string, Lemma>, name: string) => {
52
41
  const lemma = lemmas.get(name);
53
42
  if (lemma === undefined) throw new TlaZenonError(`Zenon: no lemma ${name}`);
@@ -102,9 +91,9 @@ const getEliminated = (exprs: Expressions, lemmas: Map<string, Lemma>, rule: LlR
102
91
  case "notnot":
103
92
  return [exprs.enot(exprs.enot(rule.formula))];
104
93
  case "connect":
105
- return [connect(exprs, rule.connective, rule.left, rule.right)];
94
+ return [exprs.binary(rule.connective, rule.left, rule.right)];
106
95
  case "notconnect":
107
- return [exprs.enot(connect(exprs, rule.connective, rule.left, rule.right))];
96
+ return [exprs.enot(exprs.binary(rule.connective, rule.left, rule.right))];
108
97
  case "ex":
109
98
  case "all":
110
99
  return [rule.quantified];
@@ -1,7 +1,5 @@
1
- // Ported from Zenon's mltoll.ml, as shipped in tlapm. Copyright 2004 INRIA, see LICENSE.
2
-
3
1
  import { TlaZenonError } from "../../errors";
4
- import type { Direction, Origin, Relations } from "./eqrel";
2
+ import type { Direction, Origin, RelationProperty, Relations } from "./eqrel";
5
3
  import {
6
4
  difference,
7
5
  union,
@@ -10,7 +8,7 @@ import {
10
8
  type Expressions,
11
9
  type VarExpr,
12
10
  } from "./expr";
13
- import { connect, type Connective, type Lemma, type LlProof, type LlRule } from "./llproof";
11
+ import type { Connective, Lemma, LlProof, LlRule } from "./llproof";
14
12
  import type { Definition, Phrase } from "./parse";
15
13
  import type { Rule } from "./proof";
16
14
  import { getTlaLlProof } from "./tla/llproof";
@@ -32,8 +30,6 @@ interface TranslateContext {
32
30
  relations: Relations;
33
31
  }
34
32
 
35
- type RelationProperty = "reflexive" | "symmetric" | "transitive";
36
-
37
33
  type HypothesisKind =
38
34
  | { kind: "reflexive"; origin: Origin }
39
35
  | { kind: "symmetric"; origin: Origin }
@@ -145,10 +141,8 @@ export const translateProof = (
145
141
  ): Lemma[] => {
146
142
  const exprs = context.exprs;
147
143
  const translatedExprs = new Map<Expr, Expr>();
148
- const lemmaNumbers = new Map<MlProof, number>();
149
- const lemmaTable = new Map<string, [Lemma, Expr[]]>();
144
+ const lemmaTable = new Map<MlProof, [Lemma, Expr[]]>();
150
145
  const lemmas: Lemma[] = [];
151
- const getLemmaName = (number: number) => `${LEMMA_PREFIX}${number}_`;
152
146
 
153
147
  const equal = (left: Expr, right: Expr) => exprs.eapp("=", [left, right]);
154
148
 
@@ -175,13 +169,13 @@ export const translateProof = (
175
169
  case "imply":
176
170
  case "equiv": {
177
171
  const right = translateExpr(expression.args[1]);
178
- return connect(exprs, expression.kind, translateExpr(expression.args[0]), right);
172
+ return exprs.binary(expression.kind, translateExpr(expression.args[0]), right);
179
173
  }
180
174
  case "all":
181
175
  case "ex":
182
176
  case "tau":
183
177
  case "lam":
184
- return makeBinder(
178
+ return exprs.binder(
185
179
  expression.kind,
186
180
  expression.args[0],
187
181
  expression.symbol,
@@ -195,15 +189,6 @@ export const translateProof = (
195
189
  return result;
196
190
  };
197
191
 
198
- const makeBinder = (kind: BinderExpr["kind"], variable: VarExpr, type: string, body: Expr) =>
199
- kind === "all"
200
- ? exprs.eall(variable, type, body)
201
- : kind === "ex"
202
- ? exprs.eex(variable, type, body)
203
- : kind === "tau"
204
- ? exprs.etau(variable, type, body)
205
- : exprs.elam(variable, type, body);
206
-
207
192
  const translateRule = (rule: MlRule): LlRule => {
208
193
  switch (rule.name) {
209
194
  case "close":
@@ -374,8 +359,7 @@ export const translateProof = (
374
359
  };
375
360
 
376
361
  const getLemmaReference = (proof: MlProof): Translated => {
377
- const number = lemmaNumbers.get(proof);
378
- const entry = number === undefined ? undefined : lemmaTable.get(getLemmaName(number));
362
+ const entry = lemmaTable.get(proof);
379
363
  if (entry === undefined) throw new TlaZenonError("Zenon: a lemma that was never made");
380
364
  const lemma = entry[0];
381
365
  return [
@@ -389,19 +373,17 @@ export const translateProof = (
389
373
  };
390
374
 
391
375
  const makeLemma = (translated: LlProof, extras: Expr[], proof: MlProof) => {
392
- const number = lemmas.length + 1;
393
- lemmaNumbers.set(proof, number);
394
376
  const lemma = {
395
- name: getLemmaName(number),
377
+ name: `${LEMMA_PREFIX}${lemmas.length + 1}_`,
396
378
  params: translated.conclusions.reduce(getParams, []),
397
379
  proof: translated,
398
380
  };
399
- lemmaTable.set(lemma.name, [lemma, extras]);
381
+ lemmaTable.set(proof, [lemma, extras]);
400
382
  lemmas.push(lemma);
401
383
  };
402
384
 
403
385
  const translate = (proof: MlProof): Translated => {
404
- if (lemmaNumbers.has(proof)) return getLemmaReference(proof);
386
+ if (lemmaTable.has(proof)) return getLemmaReference(proof);
405
387
  const result = isDerived(proof.rule)
406
388
  ? translateDerived(proof)
407
389
  : ((): Translated => {
@@ -422,7 +404,7 @@ export const translateProof = (
422
404
  };
423
405
 
424
406
  const isSharedProof = (proof: MlProof) =>
425
- context.sharedProofs.has(proof) && !lemmaNumbers.has(proof);
407
+ context.sharedProofs.has(proof) && !lemmaTable.has(proof);
426
408
 
427
409
  const translateAll = (proofs: MlProof[]): [LlProof[], Expr[]] => {
428
410
  const translated = proofs.map(translate);
@@ -1420,10 +1402,10 @@ export const translateProof = (
1420
1402
  ) {
1421
1403
  if (left.args[0] === right.args[0]) {
1422
1404
  const diff = findDiff(variable, left.args[1], right.args[1]);
1423
- return [connect(exprs, left.kind, left.args[0], diff[0]), diff[1], diff[2]];
1405
+ return [exprs.binary(left.kind, left.args[0], diff[0]), diff[1], diff[2]];
1424
1406
  }
1425
1407
  const diff = findDiff(variable, left.args[0], right.args[0]);
1426
- return [connect(exprs, left.kind, diff[0], left.args[1]), diff[1], diff[2]];
1408
+ return [exprs.binary(left.kind, diff[0], left.args[1]), diff[1], diff[2]];
1427
1409
  }
1428
1410
  if (
1429
1411
  left.kind === right.kind &&