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

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 (587) 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 +41 -37
  6. package/dist/index.cjs +1 -1
  7. package/dist/index.d.cts +21 -4
  8. package/dist/index.d.ts +21 -4
  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 +2681 -425
  15. package/dist/prove.js +2681 -425
  16. package/dist/run.cjs +41 -42
  17. package/dist/run.js +41 -42
  18. package/dist/tlapm.cjs +2 -2
  19. package/dist/tlapm.js +2 -2
  20. package/dist/transfer.cjs +97 -89
  21. package/dist/transfer.js +97 -89
  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 +72 -39
  26. package/src/bags.ts +50 -29
  27. package/src/builtins.ts +8 -16
  28. package/src/check-failure.ts +118 -0
  29. package/src/check-trace.ts +321 -0
  30. package/src/check.ts +828 -770
  31. package/src/cli/options.ts +6 -31
  32. package/src/cli/runtime-invariants.ts +20 -56
  33. package/src/cli/shared.ts +1 -1
  34. package/src/cli/tlapm.ts +433 -70
  35. package/src/cli/tlc-arguments.ts +224 -212
  36. package/src/cli/tlc-output.ts +701 -0
  37. package/src/cli/tlc-usage.ts +1 -2
  38. package/src/cli/tlc.ts +65 -712
  39. package/src/cli/xml-exporter.ts +23 -33
  40. package/src/codegen.ts +28 -20
  41. package/src/coverage.ts +255 -20
  42. package/src/dependencies.ts +96 -27
  43. package/src/dfid.ts +115 -50
  44. package/src/environment-config.ts +315 -0
  45. package/src/environment.ts +175 -373
  46. package/src/errors.ts +40 -5
  47. package/src/evaluate.ts +429 -139
  48. package/src/exit-codes.ts +28 -12
  49. package/src/fingerprints.ts +65 -1
  50. package/src/instances.ts +178 -17
  51. package/src/java-hash.ts +14 -0
  52. package/src/java-overrides.ts +2 -2
  53. package/src/json.ts +4 -7
  54. package/src/levels.ts +708 -272
  55. package/src/lexer.ts +17 -5
  56. package/src/liveness-checker.ts +707 -249
  57. package/src/liveness.ts +148 -95
  58. package/src/obligations/action.ts +14 -17
  59. package/src/obligations/anonymize.ts +37 -16
  60. package/src/obligations/enabled-axioms.ts +218 -0
  61. package/src/obligations/equality.ts +1 -3
  62. package/src/obligations/expression.ts +36 -8
  63. package/src/obligations/format.ts +0 -2
  64. package/src/obligations/generate.ts +66 -54
  65. package/src/obligations/index.ts +39 -9
  66. package/src/obligations/levels.ts +24 -11
  67. package/src/obligations/module.ts +28 -41
  68. package/src/obligations/normalize.ts +27 -18
  69. package/src/obligations/operators.ts +0 -2
  70. package/src/obligations/pragma.ts +53 -16
  71. package/src/obligations/printer.ts +48 -18
  72. package/src/obligations/proof.ts +3 -2
  73. package/src/obligations/regroup.ts +0 -2
  74. package/src/obligations/simplify.ts +55 -50
  75. package/src/obligations/source.ts +120 -74
  76. package/src/obligations/subexpression.ts +45 -18
  77. package/src/obligations/substitution.ts +1 -3
  78. package/src/obligations/temporal.ts +5 -7
  79. package/src/obligations/tuples.ts +0 -2
  80. package/src/parallel-worker.ts +17 -31
  81. package/src/parallel.ts +29 -47
  82. package/src/parser.ts +757 -326
  83. package/src/pretty-print.ts +1 -1
  84. package/src/prover/decide-pool.ts +3 -3
  85. package/src/prover/deciders.ts +12 -9
  86. package/src/prover/isabelle/decide.ts +3 -25
  87. package/src/prover/isabelle/encode.ts +72 -42
  88. package/src/prover/isabelle/isar/attrib.ts +250 -0
  89. package/src/prover/isabelle/isar/context.ts +335 -0
  90. package/src/prover/isabelle/isar/induct.ts +382 -0
  91. package/src/prover/isabelle/isar/inner-syntax.ts +158 -7
  92. package/src/prover/isabelle/isar/method.ts +509 -212
  93. package/src/prover/isabelle/isar/proof.ts +570 -14
  94. package/src/prover/isabelle/isar/rule-cases.ts +226 -0
  95. package/src/prover/isabelle/isar/theory.ts +487 -76
  96. package/src/prover/isabelle/isar/toplevel.ts +331 -0
  97. package/src/prover/isabelle/isar/type-check.ts +89 -14
  98. package/src/prover/isabelle/provers/blast/blast.ts +7 -65
  99. package/src/prover/isabelle/provers/blast/branch.ts +0 -2
  100. package/src/prover/isabelle/provers/blast/prove.ts +0 -2
  101. package/src/prover/isabelle/provers/blast/rules.ts +0 -2
  102. package/src/prover/isabelle/provers/blast/state.ts +0 -2
  103. package/src/prover/isabelle/provers/blast/term.ts +0 -2
  104. package/src/prover/isabelle/provers/clasimp.ts +1 -3
  105. package/src/prover/isabelle/provers/classical.ts +45 -20
  106. package/src/prover/isabelle/provers/hypsubst.ts +19 -30
  107. package/src/prover/isabelle/pure/bicompose.ts +9 -27
  108. package/src/prover/isabelle/pure/consts.ts +0 -2
  109. package/src/prover/isabelle/pure/conv.ts +2 -10
  110. package/src/prover/isabelle/pure/drule.ts +72 -6
  111. package/src/prover/isabelle/pure/envir.ts +0 -2
  112. package/src/prover/isabelle/pure/goal.ts +1 -3
  113. package/src/prover/isabelle/pure/logic.ts +1 -3
  114. package/src/prover/isabelle/pure/name.ts +0 -2
  115. package/src/prover/isabelle/pure/net.ts +0 -2
  116. package/src/prover/isabelle/pure/object-logic.ts +13 -7
  117. package/src/prover/isabelle/pure/pattern.ts +0 -2
  118. package/src/prover/isabelle/pure/raw-simplifier.ts +4 -15
  119. package/src/prover/isabelle/pure/rewriter.ts +9 -20
  120. package/src/prover/isabelle/pure/search.ts +0 -2
  121. package/src/prover/isabelle/pure/seq.ts +0 -2
  122. package/src/prover/isabelle/pure/simplifier.ts +26 -7
  123. package/src/prover/isabelle/pure/table.ts +2 -3
  124. package/src/prover/isabelle/pure/tactic.ts +0 -2
  125. package/src/prover/isabelle/pure/tactical.ts +42 -37
  126. package/src/prover/isabelle/pure/term-ord.ts +0 -2
  127. package/src/prover/isabelle/pure/term.ts +3 -5
  128. package/src/prover/isabelle/pure/thm.ts +14 -13
  129. package/src/prover/isabelle/pure/type.ts +0 -2
  130. package/src/prover/isabelle/pure/unify.ts +0 -2
  131. package/src/prover/isabelle/pure/variable.ts +0 -2
  132. package/src/prover/isabelle/tla/classical-setup.ts +18 -16
  133. package/src/prover/isabelle/tla/context.ts +58 -11
  134. package/src/prover/isabelle/tla/logic-data.ts +1 -1
  135. package/src/prover/isabelle/tla/logic.ts +49 -21
  136. package/src/prover/isabelle/tla/simpdata.ts +1 -12
  137. package/src/prover/isabelle/tools/intuitionistic.ts +28 -12
  138. package/src/prover/ocaml.ts +4 -1
  139. package/src/prover/prep/action.ts +30 -31
  140. package/src/prover/prep/enabled-axioms.ts +11 -2
  141. package/src/prover/prep/fingerprint.ts +2 -5
  142. package/src/prover/prep/md5.ts +26 -29
  143. package/src/prover/prep/methods.ts +181 -51
  144. package/src/prover/prep/normalize.ts +38 -9
  145. package/src/prover/prove.ts +395 -94
  146. package/src/prover/ptl/decide.ts +95 -50
  147. package/src/prover/ptl/encode.ts +2 -3
  148. package/src/prover/ptl/tableau.ts +28 -2
  149. package/src/prover/smt/arithmetic.ts +310 -0
  150. package/src/prover/smt/axioms.ts +12 -8
  151. package/src/prover/smt/context.ts +43 -8
  152. package/src/prover/smt/data.ts +498 -379
  153. package/src/prover/smt/encode.ts +148 -57
  154. package/src/prover/smt/extensionality.ts +5 -3
  155. package/src/prover/smt/flatten.ts +4 -6
  156. package/src/prover/smt/format.ts +28 -4
  157. package/src/prover/smt/instances.ts +7 -1
  158. package/src/prover/smt/layout.ts +91 -0
  159. package/src/prover/smt/rewrite.ts +1016 -618
  160. package/src/prover/smt/simplify.ts +441 -0
  161. package/src/prover/smt/solver/ackermannize-bv-tactic.ts +62 -0
  162. package/src/prover/smt/solver/ackr-helper.ts +179 -0
  163. package/src/prover/smt/solver/ackr-model-converter.ts +105 -0
  164. package/src/prover/smt/solver/act-cache.ts +0 -1
  165. package/src/prover/smt/solver/add-bounds-tactic.ts +59 -0
  166. package/src/prover/smt/solver/aig-tactic.ts +52 -0
  167. package/src/prover/smt/solver/aig.ts +889 -0
  168. package/src/prover/smt/solver/arith-rewriter.ts +624 -9
  169. package/src/prover/smt/solver/arith-terms.ts +121 -0
  170. package/src/prover/smt/solver/array-decl-plugin.ts +175 -0
  171. package/src/prover/smt/solver/array-rewriter.ts +319 -0
  172. package/src/prover/smt/solver/asserted-formulas.ts +240 -56
  173. package/src/prover/smt/solver/ast-lt.ts +165 -11
  174. package/src/prover/smt/solver/ast-util.ts +160 -2
  175. package/src/prover/smt/solver/ast.ts +1483 -45
  176. package/src/prover/smt/solver/auf-solver.ts +25 -18
  177. package/src/prover/smt/solver/bit-blast-tactic.ts +608 -0
  178. package/src/prover/smt/solver/bit-blaster.ts +871 -0
  179. package/src/prover/smt/solver/blast-term-ite.ts +47 -0
  180. package/src/prover/smt/solver/bound-manager.ts +196 -0
  181. package/src/prover/smt/solver/bound-simplifier.ts +598 -0
  182. package/src/prover/smt/solver/bv-bound-chk.ts +492 -0
  183. package/src/prover/smt/solver/bv-decl-plugin.ts +341 -0
  184. package/src/prover/smt/solver/bv-divrem-bounds.ts +95 -0
  185. package/src/prover/smt/solver/bv-rewriter.ts +1901 -0
  186. package/src/prover/smt/solver/bv1-blast.ts +214 -0
  187. package/src/prover/smt/solver/bv2fpa-converter.ts +174 -0
  188. package/src/prover/smt/solver/bv2int-rewriter.ts +544 -0
  189. package/src/prover/smt/solver/bv2real-rewriter.ts +533 -0
  190. package/src/prover/smt/solver/card2bv.ts +127 -0
  191. package/src/prover/smt/solver/case-split-queue.ts +0 -2
  192. package/src/prover/smt/solver/cg-table.ts +39 -25
  193. package/src/prover/smt/solver/check-logic.ts +330 -0
  194. package/src/prover/smt/solver/clause.ts +0 -1
  195. package/src/prover/smt/solver/cofactor-elim-term-ite.ts +293 -0
  196. package/src/prover/smt/solver/conflict-resolution.ts +78 -2
  197. package/src/prover/smt/solver/context.ts +598 -128
  198. package/src/prover/smt/solver/ctx-simplify.ts +29 -14
  199. package/src/prover/smt/solver/ctx-solver-simplify.ts +122 -0
  200. package/src/prover/smt/solver/datatype-decl-plugin.ts +580 -0
  201. package/src/prover/smt/solver/datatype-rewriter.ts +82 -0
  202. package/src/prover/smt/solver/demodulator.ts +786 -0
  203. package/src/prover/smt/solver/dependent-expr-state.ts +93 -0
  204. package/src/prover/smt/solver/der.ts +38 -10
  205. package/src/prover/smt/solver/diff-neq.ts +207 -0
  206. package/src/prover/smt/solver/distribute-forall.ts +57 -0
  207. package/src/prover/smt/solver/dom-simplify.ts +511 -0
  208. package/src/prover/smt/solver/dt2bv-tactic.ts +298 -0
  209. package/src/prover/smt/solver/dyn-ack.ts +0 -1
  210. package/src/prover/smt/solver/e-matching.ts +7 -8
  211. package/src/prover/smt/solver/elim-bounds.ts +89 -0
  212. package/src/prover/smt/solver/elim-small-bv-tactic.ts +129 -0
  213. package/src/prover/smt/solver/elim-term-ite-tactic.ts +48 -0
  214. package/src/prover/smt/solver/elim-uncnstr.ts +548 -0
  215. package/src/prover/smt/solver/enode.ts +100 -3
  216. package/src/prover/smt/solver/eq2bv-tactic.ts +227 -0
  217. package/src/prover/smt/solver/euf/arith-axioms.ts +403 -0
  218. package/src/prover/smt/solver/euf/arith-internalize.ts +653 -0
  219. package/src/prover/smt/solver/euf/arith-solver.ts +889 -0
  220. package/src/prover/smt/solver/euf/array-axioms.ts +527 -0
  221. package/src/prover/smt/solver/euf/array-internalize.ts +428 -0
  222. package/src/prover/smt/solver/euf/array-solver.ts +306 -0
  223. package/src/prover/smt/solver/euf/bv-ackerman.ts +162 -0
  224. package/src/prover/smt/solver/euf/bv-internalize.ts +748 -0
  225. package/src/prover/smt/solver/euf/bv-solver.ts +449 -0
  226. package/src/prover/smt/solver/euf/dt-solver.ts +618 -0
  227. package/src/prover/smt/solver/euf/egraph.ts +901 -0
  228. package/src/prover/smt/solver/euf/euf-solver.ts +1204 -0
  229. package/src/prover/smt/solver/euf/fpa-solver.ts +317 -0
  230. package/src/prover/smt/solver/euf/mam.ts +1046 -0
  231. package/src/prover/smt/solver/euf/q-ematch.ts +829 -0
  232. package/src/prover/smt/solver/euf/q-mbi.ts +587 -0
  233. package/src/prover/smt/solver/euf/q-model-fixer.ts +296 -0
  234. package/src/prover/smt/solver/euf/q-solver.ts +361 -0
  235. package/src/prover/smt/solver/euf/th-solver.ts +328 -0
  236. package/src/prover/smt/solver/euf/th-solvers.ts +30 -0
  237. package/src/prover/smt/solver/expr-ref.ts +0 -1
  238. package/src/prover/smt/solver/expr-safe-replace.ts +26 -2
  239. package/src/prover/smt/solver/expr2polynomial.ts +271 -0
  240. package/src/prover/smt/solver/factor.ts +163 -0
  241. package/src/prover/smt/solver/fd-solver.ts +734 -0
  242. package/src/prover/smt/solver/fingerprints.ts +15 -15
  243. package/src/prover/smt/solver/fix-dl-var.ts +147 -0
  244. package/src/prover/smt/solver/flat-literals.ts +0 -1
  245. package/src/prover/smt/solver/fm-tactic.ts +886 -0
  246. package/src/prover/smt/solver/fpa-decl-plugin.ts +618 -0
  247. package/src/prover/smt/solver/fpa-rewriter.ts +639 -0
  248. package/src/prover/smt/solver/fpa2bv-converter.ts +2251 -0
  249. package/src/prover/smt/solver/fpa2bv-rewriter.ts +349 -0
  250. package/src/prover/smt/solver/fpa2bv-tactic.ts +73 -0
  251. package/src/prover/smt/solver/goal.ts +178 -15
  252. package/src/prover/smt/solver/goal2nlsat.ts +216 -0
  253. package/src/prover/smt/solver/guard-set.ts +219 -0
  254. package/src/prover/smt/solver/hash.ts +0 -1
  255. package/src/prover/smt/solver/hashtable.ts +34 -16
  256. package/src/prover/smt/solver/inf-eps.ts +63 -0
  257. package/src/prover/smt/solver/inj-axiom.ts +101 -0
  258. package/src/prover/smt/solver/internalizer.ts +111 -39
  259. package/src/prover/smt/solver/lackr.ts +381 -0
  260. package/src/prover/smt/solver/lbool.ts +0 -1
  261. package/src/prover/smt/solver/lia2card.ts +268 -0
  262. package/src/prover/smt/solver/lia2pb.ts +154 -0
  263. package/src/prover/smt/solver/literal.ts +0 -1
  264. package/src/prover/smt/solver/logic-tactics.ts +355 -0
  265. package/src/prover/smt/solver/lp/bound-propagator.ts +0 -1
  266. package/src/prover/smt/solver/lp/constraints.ts +0 -1
  267. package/src/prover/smt/solver/lp/containers.ts +7 -2
  268. package/src/prover/smt/solver/lp/core-solver.ts +30 -11
  269. package/src/prover/smt/solver/lp/cross-nested.ts +1 -4
  270. package/src/prover/smt/solver/lp/dep-intervals.ts +0 -3
  271. package/src/prover/smt/solver/lp/dependency.ts +0 -2
  272. package/src/prover/smt/solver/lp/dioph-eq.ts +1 -10
  273. package/src/prover/smt/solver/lp/explanation.ts +0 -1
  274. package/src/prover/smt/solver/lp/gomory.ts +0 -1
  275. package/src/prover/smt/solver/lp/hnf-cutter.ts +1 -2
  276. package/src/prover/smt/solver/lp/hnf.ts +0 -3
  277. package/src/prover/smt/solver/lp/int-cube.ts +3 -4
  278. package/src/prover/smt/solver/lp/int-solver.ts +0 -2
  279. package/src/prover/smt/solver/lp/lar-solver.ts +41 -5
  280. package/src/prover/smt/solver/lp/lar-term.ts +0 -1
  281. package/src/prover/smt/solver/lp/lp-settings.ts +6 -3
  282. package/src/prover/smt/solver/lp/maximize-term.ts +59 -10
  283. package/src/prover/smt/solver/lp/nex-creator.ts +3 -3
  284. package/src/prover/smt/solver/lp/nex.ts +2 -2
  285. package/src/prover/smt/solver/lp/nla-backoff.ts +0 -2
  286. package/src/prover/smt/solver/lp/nla-basics.ts +46 -3
  287. package/src/prover/smt/solver/lp/nla-core.ts +68 -17
  288. package/src/prover/smt/solver/lp/nla-divisions.ts +0 -2
  289. package/src/prover/smt/solver/lp/nla-emonics.ts +0 -1
  290. package/src/prover/smt/solver/lp/nla-factorization.ts +0 -1
  291. package/src/prover/smt/solver/lp/nla-grobner.ts +167 -85
  292. package/src/prover/smt/solver/lp/nla-horner.ts +0 -2
  293. package/src/prover/smt/solver/lp/nla-intervals.ts +0 -1
  294. package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +0 -2
  295. package/src/prover/smt/solver/lp/nla-monotone.ts +0 -1
  296. package/src/prover/smt/solver/lp/nla-order.ts +0 -2
  297. package/src/prover/smt/solver/lp/nla-patcher.ts +0 -1
  298. package/src/prover/smt/solver/lp/nla-powers.ts +220 -0
  299. package/src/prover/smt/solver/lp/nla-tangents.ts +0 -2
  300. package/src/prover/smt/solver/lp/nla-throttle.ts +0 -1
  301. package/src/prover/smt/solver/lp/nla-transcendentals.ts +324 -0
  302. package/src/prover/smt/solver/lp/nla-types.ts +0 -2
  303. package/src/prover/smt/solver/lp/nla-var-eqs.ts +0 -1
  304. package/src/prover/smt/solver/lp/nra-solver.ts +163 -99
  305. package/src/prover/smt/solver/lp/numeric-pair.ts +0 -1
  306. package/src/prover/smt/solver/lp/pdd-interval.ts +6 -3
  307. package/src/prover/smt/solver/lp/pdd-simplifier.ts +60 -21
  308. package/src/prover/smt/solver/lp/pdd-solver.ts +72 -41
  309. package/src/prover/smt/solver/lp/pdd.ts +725 -290
  310. package/src/prover/smt/solver/lp/random-updater.ts +0 -2
  311. package/src/prover/smt/solver/lp/static-matrix.ts +0 -1
  312. package/src/prover/smt/solver/lp/union-find.ts +7 -2
  313. package/src/prover/smt/solver/macro-finder.ts +530 -0
  314. package/src/prover/smt/solver/mam-compiler.ts +122 -90
  315. package/src/prover/smt/solver/mam-interpreter.ts +0 -1
  316. package/src/prover/smt/solver/max-bv-sharing-tactic.ts +17 -0
  317. package/src/prover/smt/solver/max-cliques.ts +105 -0
  318. package/src/prover/smt/solver/maxcore.ts +310 -0
  319. package/src/prover/smt/solver/maximize-ac-sharing.ts +8 -6
  320. package/src/prover/smt/solver/maxlex.ts +115 -0
  321. package/src/prover/smt/solver/maxsmt-base.ts +106 -0
  322. package/src/prover/smt/solver/maxsmt.ts +92 -0
  323. package/src/prover/smt/solver/mbp/mbp-arith.ts +467 -0
  324. package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +101 -0
  325. package/src/prover/smt/solver/mbp/mbp-plugin.ts +287 -0
  326. package/src/prover/smt/solver/mbp/mbp-qel.ts +48 -0
  327. package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +271 -0
  328. package/src/prover/smt/solver/mbp/mbp-term-graph.ts +606 -0
  329. package/src/prover/smt/solver/model-based-opt.ts +844 -0
  330. package/src/prover/smt/solver/model-checker.ts +19 -28
  331. package/src/prover/smt/solver/model-evaluator.ts +190 -12
  332. package/src/prover/smt/solver/model-finder.ts +12 -18
  333. package/src/prover/smt/solver/model-generator.ts +104 -35
  334. package/src/prover/smt/solver/model-macro-solver.ts +49 -46
  335. package/src/prover/smt/solver/model-printer.ts +214 -0
  336. package/src/prover/smt/solver/mpf.ts +709 -0
  337. package/src/prover/smt/solver/mus.ts +50 -0
  338. package/src/prover/smt/solver/muz/dl-context.ts +382 -0
  339. package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +97 -0
  340. package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +167 -0
  341. package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +125 -0
  342. package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +299 -0
  343. package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +455 -0
  344. package/src/prover/smt/solver/muz/dl-mk-slice.ts +340 -0
  345. package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +163 -0
  346. package/src/prover/smt/solver/muz/dl-rule-set.ts +273 -0
  347. package/src/prover/smt/solver/muz/dl-rule-transformer.ts +123 -0
  348. package/src/prover/smt/solver/muz/dl-rule.ts +495 -0
  349. package/src/prover/smt/solver/muz/hnf.ts +201 -0
  350. package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +176 -0
  351. package/src/prover/smt/solver/muz/horn-tactic.ts +214 -0
  352. package/src/prover/smt/solver/muz/rule-properties.ts +359 -0
  353. package/src/prover/smt/solver/muz/spacer-context.ts +1404 -0
  354. package/src/prover/smt/solver/muz/spacer-dl-interface.ts +52 -0
  355. package/src/prover/smt/solver/muz/spacer-generalizers.ts +241 -0
  356. package/src/prover/smt/solver/muz/spacer-manager.ts +127 -0
  357. package/src/prover/smt/solver/muz/spacer-pdr.ts +219 -0
  358. package/src/prover/smt/solver/muz/spacer-prop-solver.ts +333 -0
  359. package/src/prover/smt/solver/muz/spacer-util.ts +282 -0
  360. package/src/prover/smt/solver/muz/substitution.ts +203 -0
  361. package/src/prover/smt/solver/nla2bv-tactic.ts +285 -0
  362. package/src/prover/smt/solver/nlqsat.ts +485 -0
  363. package/src/prover/smt/solver/nlsat/algebraic.ts +315 -98
  364. package/src/prover/smt/solver/nlsat/atoms.ts +71 -38
  365. package/src/prover/smt/solver/nlsat/evaluator.ts +0 -1
  366. package/src/prover/smt/solver/nlsat/explain.ts +427 -229
  367. package/src/prover/smt/solver/nlsat/interval-set.ts +1 -2
  368. package/src/prover/smt/solver/nlsat/levelwise.ts +460 -246
  369. package/src/prover/smt/solver/nlsat/mpbq.ts +45 -1
  370. package/src/prover/smt/solver/nlsat/polynomial.ts +2376 -684
  371. package/src/prover/smt/solver/nlsat/solver.ts +293 -92
  372. package/src/prover/smt/solver/nlsat/transcendental-eval.ts +310 -0
  373. package/src/prover/smt/solver/nlsat/transcendentals.ts +391 -0
  374. package/src/prover/smt/solver/nlsat/types.ts +0 -2
  375. package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +9 -8
  376. package/src/prover/smt/solver/nlsat/upolynomial.ts +41 -20
  377. package/src/prover/smt/solver/nlsat-tactic.ts +82 -0
  378. package/src/prover/smt/solver/nnf.ts +110 -24
  379. package/src/prover/smt/solver/normalize-bounds.ts +53 -0
  380. package/src/prover/smt/solver/occf.ts +97 -0
  381. package/src/prover/smt/solver/opt-context.ts +801 -0
  382. package/src/prover/smt/solver/opt-nlsat.ts +386 -0
  383. package/src/prover/smt/solver/opt-pareto.ts +301 -0
  384. package/src/prover/smt/solver/opt-preprocess.ts +101 -0
  385. package/src/prover/smt/solver/opt-solver.ts +312 -0
  386. package/src/prover/smt/solver/opt-value.ts +55 -0
  387. package/src/prover/smt/solver/optsmt.ts +692 -0
  388. package/src/prover/smt/solver/parallel-tactic.ts +299 -0
  389. package/src/prover/smt/solver/pattern-inference.ts +19 -11
  390. package/src/prover/smt/solver/pb-rewriter.ts +281 -0
  391. package/src/prover/smt/solver/pb2bv-tactic.ts +546 -0
  392. package/src/prover/smt/solver/poly-rewriter.ts +259 -57
  393. package/src/prover/smt/solver/probes.ts +577 -0
  394. package/src/prover/smt/solver/propagate-values.ts +37 -21
  395. package/src/prover/smt/solver/proto-model.ts +648 -19
  396. package/src/prover/smt/solver/pull-quant.ts +28 -12
  397. package/src/prover/smt/solver/purify-arith.ts +634 -0
  398. package/src/prover/smt/solver/push-app-ite.ts +37 -0
  399. package/src/prover/smt/solver/qe-arith-plugin.ts +1096 -0
  400. package/src/prover/smt/solver/qe-lite-der.ts +2 -3
  401. package/src/prover/smt/solver/qe-lite-fm.ts +3 -4
  402. package/src/prover/smt/solver/qe-lite.ts +39 -19
  403. package/src/prover/smt/solver/qe-mbp.ts +270 -0
  404. package/src/prover/smt/solver/qe.ts +1499 -0
  405. package/src/prover/smt/solver/qel.ts +25 -0
  406. package/src/prover/smt/solver/qi-queue.ts +0 -1
  407. package/src/prover/smt/solver/qsat.ts +829 -0
  408. package/src/prover/smt/solver/quant-hoist.ts +196 -0
  409. package/src/prover/smt/solver/quant-tactics.ts +16 -56
  410. package/src/prover/smt/solver/quantifier-analyzer.ts +19 -20
  411. package/src/prover/smt/solver/quantifier-manager.ts +22 -25
  412. package/src/prover/smt/solver/quasi-macros.ts +243 -0
  413. package/src/prover/smt/solver/random-gen.ts +0 -1
  414. package/src/prover/smt/solver/rational.ts +45 -1
  415. package/src/prover/smt/solver/recfun-decl-plugin.ts +262 -0
  416. package/src/prover/smt/solver/recfun-rewriter.ts +107 -0
  417. package/src/prover/smt/solver/reduce-args.ts +225 -0
  418. package/src/prover/smt/solver/reduce-bv-size.ts +119 -0
  419. package/src/prover/smt/solver/ref-vector.ts +0 -1
  420. package/src/prover/smt/solver/relevancy.ts +1 -2
  421. package/src/prover/smt/solver/rewriter-tpl.ts +82 -14
  422. package/src/prover/smt/solver/rewriter.ts +505 -60
  423. package/src/prover/smt/solver/rlimit.ts +45 -5
  424. package/src/prover/smt/solver/sat/asymm-branch.ts +325 -0
  425. package/src/prover/smt/solver/sat/big.ts +177 -0
  426. package/src/prover/smt/solver/sat/clause-use-list.ts +71 -0
  427. package/src/prover/smt/solver/sat/clause.ts +203 -0
  428. package/src/prover/smt/solver/sat/cleaner.ts +94 -0
  429. package/src/prover/smt/solver/sat/config.ts +122 -0
  430. package/src/prover/smt/solver/sat/consequences.ts +203 -0
  431. package/src/prover/smt/solver/sat/elim-eqs.ts +142 -0
  432. package/src/prover/smt/solver/sat/goal2sat.ts +589 -0
  433. package/src/prover/smt/solver/sat/inc-sat-solver.ts +480 -0
  434. package/src/prover/smt/solver/sat/model-converter.ts +136 -0
  435. package/src/prover/smt/solver/sat/pb-constraint.ts +268 -0
  436. package/src/prover/smt/solver/sat/pb-solver.ts +1596 -0
  437. package/src/prover/smt/solver/sat/probing.ts +170 -0
  438. package/src/prover/smt/solver/sat/sat-tactic.ts +72 -0
  439. package/src/prover/smt/solver/sat/sat2goal.ts +190 -0
  440. package/src/prover/smt/solver/sat/scc.ts +142 -0
  441. package/src/prover/smt/solver/sat/simplifier.ts +1618 -0
  442. package/src/prover/smt/solver/sat/solver.ts +2107 -0
  443. package/src/prover/smt/solver/sat/var-queue.ts +117 -0
  444. package/src/prover/smt/solver/sat/watch-list.ts +140 -0
  445. package/src/prover/smt/solver/search-tree.ts +284 -0
  446. package/src/prover/smt/solver/seq-axioms.ts +995 -0
  447. package/src/prover/smt/solver/seq-decl-plugin.ts +819 -0
  448. package/src/prover/smt/solver/seq-derive.ts +1298 -0
  449. package/src/prover/smt/solver/seq-eq-approx.ts +236 -0
  450. package/src/prover/smt/solver/seq-eq-solver.ts +439 -0
  451. package/src/prover/smt/solver/seq-factory.ts +89 -0
  452. package/src/prover/smt/solver/seq-monadic.ts +730 -0
  453. package/src/prover/smt/solver/seq-range-predicate.ts +235 -0
  454. package/src/prover/smt/solver/seq-re-rewriter.ts +1171 -0
  455. package/src/prover/smt/solver/seq-re-util.ts +758 -0
  456. package/src/prover/smt/solver/seq-regex-bisim.ts +144 -0
  457. package/src/prover/smt/solver/seq-regex-live.ts +200 -0
  458. package/src/prover/smt/solver/seq-rewriter.ts +2404 -0
  459. package/src/prover/smt/solver/seq-skolem.ts +294 -0
  460. package/src/prover/smt/solver/seq-subset.ts +165 -0
  461. package/src/prover/smt/solver/seq-view-witness.ts +353 -0
  462. package/src/prover/smt/solver/smt-consequences.ts +297 -0
  463. package/src/prover/smt/solver/smt-kernel.ts +124 -0
  464. package/src/prover/smt/solver/smt-logics.ts +66 -0
  465. package/src/prover/smt/solver/smt-setup.ts +589 -0
  466. package/src/prover/smt/solver/smt2-printer.ts +765 -0
  467. package/src/prover/smt/solver/smtlib-parser.ts +3535 -360
  468. package/src/prover/smt/solver/smtlib-script.ts +2136 -0
  469. package/src/prover/smt/solver/solve-eqs.ts +928 -0
  470. package/src/prover/smt/solver/solver.ts +128 -23
  471. package/src/prover/smt/solver/static-features.ts +314 -0
  472. package/src/prover/smt/solver/sticky-generations.ts +0 -1
  473. package/src/prover/smt/solver/tactic.ts +2176 -0
  474. package/src/prover/smt/solver/term-enumeration.ts +205 -0
  475. package/src/prover/smt/solver/theory-array.ts +1240 -0
  476. package/src/prover/smt/solver/theory-bv.ts +1210 -0
  477. package/src/prover/smt/solver/theory-char.ts +355 -0
  478. package/src/prover/smt/solver/theory-datatype.ts +598 -0
  479. package/src/prover/smt/solver/theory-finite-set.ts +30 -0
  480. package/src/prover/smt/solver/theory-fpa.ts +389 -0
  481. package/src/prover/smt/solver/theory-lra-axioms.ts +53 -2
  482. package/src/prover/smt/solver/theory-lra-bounds.ts +31 -6
  483. package/src/prover/smt/solver/theory-lra-final-check.ts +57 -70
  484. package/src/prover/smt/solver/theory-lra-internalize.ts +96 -27
  485. package/src/prover/smt/solver/theory-lra-model.ts +20 -35
  486. package/src/prover/smt/solver/theory-lra-propagate.ts +35 -28
  487. package/src/prover/smt/solver/theory-lra-state.ts +7 -23
  488. package/src/prover/smt/solver/theory-lra.ts +189 -2
  489. package/src/prover/smt/solver/theory-pb.ts +951 -0
  490. package/src/prover/smt/solver/theory-polymorphism.ts +58 -0
  491. package/src/prover/smt/solver/theory-recfun.ts +307 -0
  492. package/src/prover/smt/solver/theory-seq-regex.ts +867 -0
  493. package/src/prover/smt/solver/theory-seq-solve.ts +1373 -0
  494. package/src/prover/smt/solver/theory-seq-state.ts +852 -0
  495. package/src/prover/smt/solver/theory-seq.ts +961 -0
  496. package/src/prover/smt/solver/theory-without-terms.ts +24 -0
  497. package/src/prover/smt/solver/theory.ts +189 -0
  498. package/src/prover/smt/solver/tseitin-cnf.ts +495 -0
  499. package/src/prover/smt/solver/var-subst.ts +36 -14
  500. package/src/prover/smt/table.ts +3 -2
  501. package/src/prover/smt/types.ts +146 -0
  502. package/src/prover/tlapm/cache.ts +57 -26
  503. package/src/prover/tlapm/tlapm.ts +15 -9
  504. package/src/prover/tlapm-library.ts +3208 -0
  505. package/src/prover/verdict.ts +9 -0
  506. package/src/prover/zenon/check/check.ts +1 -2
  507. package/src/prover/zenon/check/records.ts +1 -1
  508. package/src/prover/zenon/check/relations.ts +2 -1
  509. package/src/prover/zenon/check/rewrites.ts +2 -15
  510. package/src/prover/zenon/check/sets.ts +40 -58
  511. package/src/prover/zenon/check/terms.ts +1 -2
  512. package/src/prover/zenon/decide.ts +10 -7
  513. package/src/prover/zenon/encode.ts +0 -2
  514. package/src/prover/zenon/eqrel.ts +2 -2
  515. package/src/prover/zenon/equality-rules.ts +24 -2
  516. package/src/prover/zenon/expr.ts +28 -2
  517. package/src/prover/zenon/index-table.ts +16 -23
  518. package/src/prover/zenon/isar-case.ts +1 -3
  519. package/src/prover/zenon/isar.ts +37 -39
  520. package/src/prover/zenon/llproof.ts +2 -13
  521. package/src/prover/zenon/mltoll.ts +12 -30
  522. package/src/prover/zenon/node.ts +20 -5
  523. package/src/prover/zenon/parse.ts +9 -8
  524. package/src/prover/zenon/phrase.ts +1 -3
  525. package/src/prover/zenon/proof.ts +0 -2
  526. package/src/prover/zenon/propositional-rules.ts +0 -2
  527. package/src/prover/zenon/rules.ts +2 -3
  528. package/src/prover/zenon/search.ts +11 -19
  529. package/src/prover/zenon/tla/functions.ts +2 -4
  530. package/src/prover/zenon/tla/llproof.ts +9 -13
  531. package/src/prover/zenon/tla/records.ts +1 -8
  532. package/src/prover/zenon/tla/rewrites.ts +0 -2
  533. package/src/prover/zenon/tla/sets.ts +22 -22
  534. package/src/prover/zenon/tla/terms.ts +0 -2
  535. package/src/prover/zenon/tla/tla.ts +7 -8
  536. package/src/resolve.ts +1327 -328
  537. package/src/runtime.ts +25 -2
  538. package/src/sany/builtins.ts +10 -10
  539. package/src/sany/generation.ts +384 -0
  540. package/src/sany/generator-def-entries.ts +297 -0
  541. package/src/sany/generator-definitions.ts +688 -0
  542. package/src/sany/generator-expressions.ts +1123 -0
  543. package/src/sany/generator-proofs.ts +668 -0
  544. package/src/sany/generator.ts +161 -2625
  545. package/src/sany/levels.ts +0 -2
  546. package/src/sany/lexer.ts +32 -23
  547. package/src/sany/linter.ts +0 -2
  548. package/src/sany/modules.ts +4 -2
  549. package/src/sany/nodes.ts +3 -4
  550. package/src/sany/report.ts +3 -6
  551. package/src/sany/selectors.ts +46 -44
  552. package/src/sany/xml.ts +25 -58
  553. package/src/search.ts +513 -165
  554. package/src/simulate.ts +340 -251
  555. package/src/spec-description.ts +48 -55
  556. package/src/standard-definitions.ts +5 -0
  557. package/src/standard-modules.ts +72 -54
  558. package/src/state-graph.ts +0 -2
  559. package/src/subexpressions.ts +564 -138
  560. package/src/substitution-levels.ts +5 -4
  561. package/src/successors.ts +56 -28
  562. package/src/symmetry.ts +4 -3
  563. package/src/tableau.ts +2 -2
  564. package/src/tlc/fingerprint.ts +81 -9
  565. package/src/tlc/jar-data.ts +10 -0
  566. package/src/tlc/messages.ts +23 -18
  567. package/src/tlc/order.ts +14 -3
  568. package/src/tlc/random.ts +6 -5
  569. package/src/tlc/replay.ts +152 -58
  570. package/src/tlc/summary.ts +29 -14
  571. package/src/tlc/tlc-operators.ts +12 -11
  572. package/src/tlc/tlcext-operators.ts +87 -26
  573. package/src/tlc/trace-spec.ts +27 -60
  574. package/src/trace-liveness.ts +529 -0
  575. package/src/typed-tier.ts +6556 -0
  576. package/src/typescript/actions.ts +2 -4
  577. package/src/typescript/collections.ts +34 -20
  578. package/src/typescript/compile.ts +1 -3
  579. package/src/typescript/formula.ts +5 -3
  580. package/src/typescript/model.ts +4 -5
  581. package/src/typescript/steps.ts +20 -18
  582. package/src/typescript/types.ts +2 -2
  583. package/src/values.ts +208 -227
  584. package/src/prover/isabelle/isar/statement.ts +0 -52
  585. package/src/prover/smt/solver/z3-license.txt +0 -10
  586. package/src/prover/tlaps-module.ts +0 -510
  587. 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,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
 
@@ -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 =>
@@ -238,6 +241,27 @@ export const compareExprs = (left: Expr, right: Expr): number => {
238
241
  return 0;
239
242
  };
240
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
+
241
265
  type Substitution = [Expr, Expr][];
242
266
 
243
267
  const lookup = (map: Substitution, variable: Expr) => map.find((pair) => pair[0] === variable)?.[1];
@@ -504,6 +528,8 @@ export const createExpressions = () => {
504
528
  emeta,
505
529
  eapp,
506
530
  enot,
531
+ binary,
532
+ binder,
507
533
  eand: (left: Expr, right: Expr) => binary("and", left, right),
508
534
  eor: (left: Expr, right: Expr) => binary("or", left, right),
509
535
  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
  }
@@ -274,8 +262,11 @@ export const createIndex = (exprs: Expressions) => {
274
262
  const suspect = group[0];
275
263
  const count = suspect.records.length;
276
264
  const missing = [
277
- ...Array.from({ length: count - suspect.cursor }, (_, offset) => suspect.cursor + offset),
278
- ...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),
279
270
  ].find((index) => !suspect.records[index].isPresent);
280
271
  if (missing === undefined) return suspect.proof;
281
272
  suspects = [group.slice(1), ...suspects.slice(1)];
@@ -292,6 +283,8 @@ export const createIndex = (exprs: Expressions) => {
292
283
  getGoalness,
293
284
  findPositive: (symbol: string) => withGoalness(getLatestFirst(positive, symbol)),
294
285
  findNegative: (symbol: string) => withGoalness(getLatestFirst(negative, symbol)),
286
+ getPositive: (symbol: string) => positive.get(symbol),
287
+ getNegative: (symbol: string) => negative.get(symbol),
295
288
  findEqualRight: (term: Expr) => getLatestFirst(equalLeftRight, term),
296
289
  findEqualLeft: (term: Expr) => getLatestFirst(equalRightLeft, term),
297
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";
@@ -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.")
@@ -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
  ]);
@@ -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];
@@ -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
 
@@ -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];