tla-ts 0.0.9 → 0.0.10-dev.09e53c2a6

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (625) hide show
  1. package/README.md +30 -1
  2. package/dist/compile.cjs +23 -0
  3. package/dist/compile.js +23 -0
  4. package/dist/deciders.cjs +41 -37
  5. package/dist/deciders.js +57 -53
  6. package/dist/index.cjs +1 -1
  7. package/dist/index.d.cts +109 -10
  8. package/dist/index.d.ts +109 -10
  9. package/dist/index.js +1 -1
  10. package/dist/parallel-worker.cjs +1 -1
  11. package/dist/parallel-worker.js +1 -1
  12. package/dist/prove-worker.cjs +1 -1
  13. package/dist/prove-worker.js +1 -1
  14. package/dist/prove.cjs +2746 -410
  15. package/dist/prove.js +2745 -409
  16. package/dist/run.cjs +146 -31
  17. package/dist/run.js +146 -31
  18. package/dist/tlapm.cjs +2 -2
  19. package/dist/tlapm.js +2 -2
  20. package/dist/transfer.cjs +132 -104
  21. package/dist/transfer.js +132 -104
  22. package/dist/worker.cjs +6 -6
  23. package/dist/worker.js +6 -6
  24. package/package.json +3 -1
  25. package/src/ast.ts +45 -59
  26. package/src/bags.ts +99 -102
  27. package/src/builtins.ts +28 -75
  28. package/src/bundled-modules.ts +1 -8
  29. package/src/check-failure.ts +116 -0
  30. package/src/check-trace.ts +282 -0
  31. package/src/check.ts +797 -782
  32. package/src/cli/options.ts +12 -32
  33. package/src/cli/run.ts +0 -2
  34. package/src/cli/runtime-invariants.ts +136 -0
  35. package/src/cli/shared.ts +19 -12
  36. package/src/cli/tlapm.ts +433 -82
  37. package/src/cli/tlc-arguments.ts +652 -0
  38. package/src/cli/tlc-output.ts +687 -0
  39. package/src/cli/tlc-usage.ts +360 -0
  40. package/src/cli/tlc.ts +323 -658
  41. package/src/cli/typescript.ts +23 -0
  42. package/src/cli/xml-exporter.ts +27 -49
  43. package/src/cli.ts +0 -1
  44. package/src/codegen.ts +196 -74
  45. package/src/config.ts +140 -109
  46. package/src/coverage.ts +830 -0
  47. package/src/dependencies.ts +36 -54
  48. package/src/dfid.ts +618 -0
  49. package/src/environment-config.ts +315 -0
  50. package/src/environment.ts +178 -339
  51. package/src/errors.ts +100 -57
  52. package/src/evaluate.ts +598 -340
  53. package/src/exit-codes.ts +38 -3
  54. package/src/fingerprints.ts +75 -11
  55. package/src/index.ts +3 -0
  56. package/src/instances.ts +126 -21
  57. package/src/java-hash.ts +7 -0
  58. package/src/java-overrides.ts +4 -19
  59. package/src/json-reader.ts +455 -0
  60. package/src/json.ts +252 -139
  61. package/src/levels.ts +46 -58
  62. package/src/lexer.ts +83 -101
  63. package/src/liveness-checker.ts +590 -311
  64. package/src/liveness.ts +180 -124
  65. package/src/obligations/action.ts +17 -44
  66. package/src/obligations/anonymize.ts +120 -95
  67. package/src/obligations/enabled-axioms.ts +218 -0
  68. package/src/obligations/equality.ts +1 -3
  69. package/src/obligations/expression.ts +37 -26
  70. package/src/obligations/format.ts +0 -10
  71. package/src/obligations/generate.ts +66 -64
  72. package/src/obligations/index.ts +38 -19
  73. package/src/obligations/levels.ts +27 -18
  74. package/src/obligations/module.ts +28 -55
  75. package/src/obligations/normalize.ts +30 -37
  76. package/src/obligations/operators.ts +0 -3
  77. package/src/obligations/pragma.ts +52 -24
  78. package/src/obligations/printer.ts +89 -58
  79. package/src/obligations/proof.ts +3 -6
  80. package/src/obligations/regroup.ts +0 -5
  81. package/src/obligations/simplify.ts +57 -63
  82. package/src/obligations/source.ts +119 -95
  83. package/src/obligations/subexpression.ts +49 -28
  84. package/src/obligations/substitution.ts +1 -5
  85. package/src/obligations/temporal.ts +12 -20
  86. package/src/obligations/tuples.ts +2 -10
  87. package/src/parallel-worker.ts +30 -60
  88. package/src/parallel.ts +59 -73
  89. package/src/parser.ts +1082 -399
  90. package/src/pcal/ast.ts +53 -86
  91. package/src/pcal/parse.ts +144 -219
  92. package/src/pcal/tokenize.ts +91 -131
  93. package/src/pcal/translate.ts +83 -130
  94. package/src/pcal/validate.ts +48 -68
  95. package/src/pretty-print.ts +7 -8
  96. package/src/prover/decide-pool.ts +8 -13
  97. package/src/prover/deciders.ts +12 -13
  98. package/src/prover/first-order.ts +0 -11
  99. package/src/prover/isabelle/decide.ts +3 -31
  100. package/src/prover/isabelle/encode.ts +82 -64
  101. package/src/prover/isabelle/isar/attrib.ts +250 -0
  102. package/src/prover/isabelle/isar/context.ts +335 -0
  103. package/src/prover/isabelle/isar/induct.ts +382 -0
  104. package/src/prover/isabelle/isar/inner-syntax.ts +262 -117
  105. package/src/prover/isabelle/isar/method.ts +510 -226
  106. package/src/prover/isabelle/isar/proof.ts +570 -23
  107. package/src/prover/isabelle/isar/rule-cases.ts +224 -0
  108. package/src/prover/isabelle/isar/theory.ts +488 -88
  109. package/src/prover/isabelle/isar/toplevel.ts +331 -0
  110. package/src/prover/isabelle/isar/type-check.ts +99 -38
  111. package/src/prover/isabelle/provers/blast/blast.ts +16 -105
  112. package/src/prover/isabelle/provers/blast/branch.ts +0 -33
  113. package/src/prover/isabelle/provers/blast/prove.ts +0 -36
  114. package/src/prover/isabelle/provers/blast/rules.ts +5 -45
  115. package/src/prover/isabelle/provers/blast/state.ts +1 -29
  116. package/src/prover/isabelle/provers/blast/term.ts +8 -37
  117. package/src/prover/isabelle/provers/clasimp.ts +0 -14
  118. package/src/prover/isabelle/provers/classical.ts +58 -61
  119. package/src/prover/isabelle/provers/hypsubst.ts +27 -52
  120. package/src/prover/isabelle/pure/bicompose.ts +24 -39
  121. package/src/prover/isabelle/pure/consts.ts +0 -8
  122. package/src/prover/isabelle/pure/conv.ts +2 -18
  123. package/src/prover/isabelle/pure/drule.ts +95 -45
  124. package/src/prover/isabelle/pure/envir.ts +2 -53
  125. package/src/prover/isabelle/pure/goal.ts +1 -9
  126. package/src/prover/isabelle/pure/interrupt.ts +0 -5
  127. package/src/prover/isabelle/pure/list.ts +0 -3
  128. package/src/prover/isabelle/pure/logic.ts +1 -16
  129. package/src/prover/isabelle/pure/name.ts +1 -10
  130. package/src/prover/isabelle/pure/net.ts +2 -60
  131. package/src/prover/isabelle/pure/object-logic.ts +15 -16
  132. package/src/prover/isabelle/pure/pattern.ts +1 -20
  133. package/src/prover/isabelle/pure/raw-simplifier.ts +16 -63
  134. package/src/prover/isabelle/pure/rewriter.ts +31 -74
  135. package/src/prover/isabelle/pure/search.ts +2 -11
  136. package/src/prover/isabelle/pure/seq.ts +0 -11
  137. package/src/prover/isabelle/pure/simplifier.ts +27 -16
  138. package/src/prover/isabelle/pure/table.ts +2 -33
  139. package/src/prover/isabelle/pure/tactic.ts +11 -23
  140. package/src/prover/isabelle/pure/tactical.ts +47 -48
  141. package/src/prover/isabelle/pure/term-ord.ts +1 -7
  142. package/src/prover/isabelle/pure/term.ts +1 -44
  143. package/src/prover/isabelle/pure/thm.ts +26 -48
  144. package/src/prover/isabelle/pure/type.ts +1 -16
  145. package/src/prover/isabelle/pure/unify.ts +19 -31
  146. package/src/prover/isabelle/pure/variable.ts +2 -8
  147. package/src/prover/isabelle/tla/classical-setup.ts +17 -25
  148. package/src/prover/isabelle/tla/context.ts +65 -26
  149. package/src/prover/isabelle/tla/logic-data.ts +1 -1
  150. package/src/prover/isabelle/tla/logic.ts +53 -32
  151. package/src/prover/isabelle/tla/simpdata.ts +45 -44
  152. package/src/prover/isabelle/tools/intuitionistic.ts +28 -21
  153. package/src/prover/ocaml.ts +4 -7
  154. package/src/prover/prep/action.ts +33 -66
  155. package/src/prover/prep/enabled-axioms.ts +22 -20
  156. package/src/prover/prep/fingerprint.ts +2 -21
  157. package/src/prover/prep/level-comparison.ts +8 -12
  158. package/src/prover/prep/md5.ts +0 -2
  159. package/src/prover/prep/methods.ts +189 -86
  160. package/src/prover/prep/normalize.ts +42 -37
  161. package/src/prover/prove-worker.ts +0 -2
  162. package/src/prover/prove.ts +398 -133
  163. package/src/prover/ptl/decide.ts +96 -56
  164. package/src/prover/ptl/encode.ts +15 -38
  165. package/src/prover/ptl/sat.ts +24 -32
  166. package/src/prover/ptl/tableau.ts +40 -28
  167. package/src/prover/smt/arithmetic.ts +310 -0
  168. package/src/prover/smt/axioms.ts +12 -15
  169. package/src/prover/smt/context.ts +60 -32
  170. package/src/prover/smt/data.ts +517 -401
  171. package/src/prover/smt/encode.ts +155 -85
  172. package/src/prover/smt/extensionality.ts +5 -13
  173. package/src/prover/smt/flatten.ts +7 -28
  174. package/src/prover/smt/format.ts +33 -14
  175. package/src/prover/smt/instances.ts +7 -11
  176. package/src/prover/smt/layout.ts +91 -0
  177. package/src/prover/smt/rewrite.ts +1026 -658
  178. package/src/prover/smt/simplify.ts +441 -0
  179. package/src/prover/smt/solver/ackermannize-bv-tactic.ts +61 -0
  180. package/src/prover/smt/solver/ackr-helper.ts +179 -0
  181. package/src/prover/smt/solver/ackr-model-converter.ts +105 -0
  182. package/src/prover/smt/solver/act-cache.ts +0 -16
  183. package/src/prover/smt/solver/add-bounds-tactic.ts +59 -0
  184. package/src/prover/smt/solver/aig-tactic.ts +52 -0
  185. package/src/prover/smt/solver/aig.ts +889 -0
  186. package/src/prover/smt/solver/arith-rewriter.ts +615 -53
  187. package/src/prover/smt/solver/arith-terms.ts +121 -0
  188. package/src/prover/smt/solver/array-decl-plugin.ts +175 -0
  189. package/src/prover/smt/solver/array-rewriter.ts +309 -0
  190. package/src/prover/smt/solver/array.ts +1 -3
  191. package/src/prover/smt/solver/asserted-formulas.ts +87 -58
  192. package/src/prover/smt/solver/ast-lt.ts +166 -22
  193. package/src/prover/smt/solver/ast-util.ts +160 -7
  194. package/src/prover/smt/solver/ast.ts +1424 -180
  195. package/src/prover/smt/solver/auf-solver.ts +7 -44
  196. package/src/prover/smt/solver/bit-blast-tactic.ts +582 -0
  197. package/src/prover/smt/solver/bit-blaster.ts +871 -0
  198. package/src/prover/smt/solver/bound-manager.ts +196 -0
  199. package/src/prover/smt/solver/bound-simplifier.ts +600 -0
  200. package/src/prover/smt/solver/bv-bound-chk.ts +492 -0
  201. package/src/prover/smt/solver/bv-decl-plugin.ts +338 -0
  202. package/src/prover/smt/solver/bv-divrem-bounds.ts +95 -0
  203. package/src/prover/smt/solver/bv-rewriter.ts +1901 -0
  204. package/src/prover/smt/solver/bv1-blast.ts +214 -0
  205. package/src/prover/smt/solver/bv2fpa-converter.ts +174 -0
  206. package/src/prover/smt/solver/bv2int-rewriter.ts +544 -0
  207. package/src/prover/smt/solver/bv2real-rewriter.ts +533 -0
  208. package/src/prover/smt/solver/card2bv.ts +110 -0
  209. package/src/prover/smt/solver/case-split-queue.ts +0 -10
  210. package/src/prover/smt/solver/cg-table.ts +39 -42
  211. package/src/prover/smt/solver/check-logic.ts +330 -0
  212. package/src/prover/smt/solver/clause.ts +0 -27
  213. package/src/prover/smt/solver/cofactor-elim-term-ite.ts +278 -0
  214. package/src/prover/smt/solver/conflict-resolution.ts +78 -11
  215. package/src/prover/smt/solver/context.ts +519 -175
  216. package/src/prover/smt/solver/ctx-simplify.ts +33 -50
  217. package/src/prover/smt/solver/ctx-solver-simplify.ts +122 -0
  218. package/src/prover/smt/solver/datatype-decl-plugin.ts +572 -0
  219. package/src/prover/smt/solver/datatype-rewriter.ts +82 -0
  220. package/src/prover/smt/solver/demodulator.ts +786 -0
  221. package/src/prover/smt/solver/dependent-expr-state.ts +81 -0
  222. package/src/prover/smt/solver/der.ts +39 -30
  223. package/src/prover/smt/solver/diff-neq.ts +206 -0
  224. package/src/prover/smt/solver/distribute-forall.ts +57 -0
  225. package/src/prover/smt/solver/dom-simplify.ts +511 -0
  226. package/src/prover/smt/solver/dt2bv-tactic.ts +260 -0
  227. package/src/prover/smt/solver/dyn-ack.ts +0 -11
  228. package/src/prover/smt/solver/e-matching.ts +9 -41
  229. package/src/prover/smt/solver/elim-small-bv-tactic.ts +129 -0
  230. package/src/prover/smt/solver/elim-uncnstr.ts +545 -0
  231. package/src/prover/smt/solver/enode.ts +100 -23
  232. package/src/prover/smt/solver/eq2bv-tactic.ts +218 -0
  233. package/src/prover/smt/solver/euf/arith-axioms.ts +403 -0
  234. package/src/prover/smt/solver/euf/arith-internalize.ts +653 -0
  235. package/src/prover/smt/solver/euf/arith-solver.ts +889 -0
  236. package/src/prover/smt/solver/euf/array-axioms.ts +527 -0
  237. package/src/prover/smt/solver/euf/array-internalize.ts +428 -0
  238. package/src/prover/smt/solver/euf/array-solver.ts +306 -0
  239. package/src/prover/smt/solver/euf/bv-ackerman.ts +162 -0
  240. package/src/prover/smt/solver/euf/bv-internalize.ts +748 -0
  241. package/src/prover/smt/solver/euf/bv-solver.ts +449 -0
  242. package/src/prover/smt/solver/euf/dt-solver.ts +618 -0
  243. package/src/prover/smt/solver/euf/egraph.ts +907 -0
  244. package/src/prover/smt/solver/euf/euf-solver.ts +1205 -0
  245. package/src/prover/smt/solver/euf/fpa-solver.ts +317 -0
  246. package/src/prover/smt/solver/euf/mam.ts +1050 -0
  247. package/src/prover/smt/solver/euf/q-ematch.ts +830 -0
  248. package/src/prover/smt/solver/euf/q-mbi.ts +587 -0
  249. package/src/prover/smt/solver/euf/q-model-fixer.ts +296 -0
  250. package/src/prover/smt/solver/euf/q-solver.ts +361 -0
  251. package/src/prover/smt/solver/euf/th-solver.ts +335 -0
  252. package/src/prover/smt/solver/euf/th-solvers.ts +30 -0
  253. package/src/prover/smt/solver/expr-ref.ts +0 -5
  254. package/src/prover/smt/solver/expr-safe-replace.ts +26 -7
  255. package/src/prover/smt/solver/expr2polynomial.ts +146 -0
  256. package/src/prover/smt/solver/factor.ts +141 -0
  257. package/src/prover/smt/solver/fd-solver.ts +265 -0
  258. package/src/prover/smt/solver/fingerprints.ts +15 -26
  259. package/src/prover/smt/solver/fix-dl-var.ts +148 -0
  260. package/src/prover/smt/solver/flat-literals.ts +0 -9
  261. package/src/prover/smt/solver/fm-tactic.ts +884 -0
  262. package/src/prover/smt/solver/fpa-decl-plugin.ts +618 -0
  263. package/src/prover/smt/solver/fpa-rewriter.ts +640 -0
  264. package/src/prover/smt/solver/fpa2bv-converter.ts +2249 -0
  265. package/src/prover/smt/solver/fpa2bv-rewriter.ts +348 -0
  266. package/src/prover/smt/solver/fpa2bv-tactic.ts +73 -0
  267. package/src/prover/smt/solver/goal.ts +176 -28
  268. package/src/prover/smt/solver/goal2nlsat.ts +189 -0
  269. package/src/prover/smt/solver/guard-set.ts +219 -0
  270. package/src/prover/smt/solver/hash.ts +0 -9
  271. package/src/prover/smt/solver/hashtable.ts +26 -23
  272. package/src/prover/smt/solver/inf-eps.ts +63 -0
  273. package/src/prover/smt/solver/inj-axiom.ts +101 -0
  274. package/src/prover/smt/solver/internalizer.ts +112 -132
  275. package/src/prover/smt/solver/lackr.ts +381 -0
  276. package/src/prover/smt/solver/lbool.ts +0 -2
  277. package/src/prover/smt/solver/lia2card.ts +268 -0
  278. package/src/prover/smt/solver/lia2pb.ts +154 -0
  279. package/src/prover/smt/solver/literal.ts +0 -4
  280. package/src/prover/smt/solver/logic-tactics.ts +345 -0
  281. package/src/prover/smt/solver/lp/bound-propagator.ts +7 -26
  282. package/src/prover/smt/solver/lp/constraints.ts +1 -8
  283. package/src/prover/smt/solver/lp/containers.ts +11 -30
  284. package/src/prover/smt/solver/lp/core-solver.ts +23 -29
  285. package/src/prover/smt/solver/lp/cross-nested.ts +5 -20
  286. package/src/prover/smt/solver/lp/dep-intervals.ts +6 -24
  287. package/src/prover/smt/solver/lp/dependency.ts +0 -5
  288. package/src/prover/smt/solver/lp/dioph-eq.ts +8 -103
  289. package/src/prover/smt/solver/lp/explanation.ts +0 -6
  290. package/src/prover/smt/solver/lp/gomory.ts +8 -22
  291. package/src/prover/smt/solver/lp/hnf-cutter.ts +16 -23
  292. package/src/prover/smt/solver/lp/hnf.ts +10 -28
  293. package/src/prover/smt/solver/lp/int-cube.ts +17 -39
  294. package/src/prover/smt/solver/lp/int-solver.ts +3 -35
  295. package/src/prover/smt/solver/lp/lar-solver.ts +69 -82
  296. package/src/prover/smt/solver/lp/lar-term.ts +0 -5
  297. package/src/prover/smt/solver/lp/lp-settings.ts +0 -14
  298. package/src/prover/smt/solver/lp/maximize-term.ts +76 -52
  299. package/src/prover/smt/solver/lp/nex-creator.ts +4 -28
  300. package/src/prover/smt/solver/lp/nex.ts +0 -6
  301. package/src/prover/smt/solver/lp/nla-backoff.ts +0 -5
  302. package/src/prover/smt/solver/lp/nla-basics.ts +48 -30
  303. package/src/prover/smt/solver/lp/nla-core.ts +91 -135
  304. package/src/prover/smt/solver/lp/nla-divisions.ts +31 -43
  305. package/src/prover/smt/solver/lp/nla-emonics.ts +3 -21
  306. package/src/prover/smt/solver/lp/nla-factorization.ts +0 -4
  307. package/src/prover/smt/solver/lp/nla-grobner.ts +22 -72
  308. package/src/prover/smt/solver/lp/nla-horner.ts +2 -12
  309. package/src/prover/smt/solver/lp/nla-intervals.ts +1 -12
  310. package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +15 -42
  311. package/src/prover/smt/solver/lp/nla-monotone.ts +1 -6
  312. package/src/prover/smt/solver/lp/nla-order.ts +0 -13
  313. package/src/prover/smt/solver/lp/nla-patcher.ts +3 -7
  314. package/src/prover/smt/solver/lp/nla-powers.ts +220 -0
  315. package/src/prover/smt/solver/lp/nla-tangents.ts +0 -10
  316. package/src/prover/smt/solver/lp/nla-throttle.ts +0 -6
  317. package/src/prover/smt/solver/lp/nla-transcendentals.ts +324 -0
  318. package/src/prover/smt/solver/lp/nla-types.ts +0 -12
  319. package/src/prover/smt/solver/lp/nla-var-eqs.ts +4 -26
  320. package/src/prover/smt/solver/lp/nra-solver.ts +123 -112
  321. package/src/prover/smt/solver/lp/numeric-pair.ts +0 -4
  322. package/src/prover/smt/solver/lp/pdd-interval.ts +0 -3
  323. package/src/prover/smt/solver/lp/pdd-simplifier.ts +1 -14
  324. package/src/prover/smt/solver/lp/pdd-solver.ts +2 -33
  325. package/src/prover/smt/solver/lp/pdd.ts +7 -70
  326. package/src/prover/smt/solver/lp/random-updater.ts +0 -9
  327. package/src/prover/smt/solver/lp/static-matrix.ts +8 -19
  328. package/src/prover/smt/solver/lp/union-find.ts +5 -5
  329. package/src/prover/smt/solver/macro-finder.ts +530 -0
  330. package/src/prover/smt/solver/mam-compiler.ts +129 -139
  331. package/src/prover/smt/solver/mam-interpreter.ts +0 -21
  332. package/src/prover/smt/solver/max-bv-sharing-tactic.ts +17 -0
  333. package/src/prover/smt/solver/max-cliques.ts +105 -0
  334. package/src/prover/smt/solver/maxcore.ts +309 -0
  335. package/src/prover/smt/solver/maximize-ac-sharing.ts +8 -21
  336. package/src/prover/smt/solver/maxlex.ts +115 -0
  337. package/src/prover/smt/solver/maxsmt-base.ts +105 -0
  338. package/src/prover/smt/solver/maxsmt.ts +92 -0
  339. package/src/prover/smt/solver/mbp/mbp-arith.ts +467 -0
  340. package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +101 -0
  341. package/src/prover/smt/solver/mbp/mbp-plugin.ts +287 -0
  342. package/src/prover/smt/solver/mbp/mbp-qel.ts +48 -0
  343. package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +271 -0
  344. package/src/prover/smt/solver/mbp/mbp-term-graph.ts +606 -0
  345. package/src/prover/smt/solver/model-based-opt.ts +844 -0
  346. package/src/prover/smt/solver/model-checker.ts +19 -62
  347. package/src/prover/smt/solver/model-evaluator.ts +190 -40
  348. package/src/prover/smt/solver/model-finder.ts +14 -32
  349. package/src/prover/smt/solver/model-generator.ts +56 -40
  350. package/src/prover/smt/solver/model-macro-solver.ts +60 -114
  351. package/src/prover/smt/solver/model-printer.ts +214 -0
  352. package/src/prover/smt/solver/mpf.ts +711 -0
  353. package/src/prover/smt/solver/mus.ts +51 -0
  354. package/src/prover/smt/solver/muz/dl-context.ts +404 -0
  355. package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +97 -0
  356. package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +167 -0
  357. package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +125 -0
  358. package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +299 -0
  359. package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +455 -0
  360. package/src/prover/smt/solver/muz/dl-mk-slice.ts +340 -0
  361. package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +163 -0
  362. package/src/prover/smt/solver/muz/dl-rule-set.ts +273 -0
  363. package/src/prover/smt/solver/muz/dl-rule-transformer.ts +123 -0
  364. package/src/prover/smt/solver/muz/dl-rule.ts +496 -0
  365. package/src/prover/smt/solver/muz/hnf.ts +201 -0
  366. package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +176 -0
  367. package/src/prover/smt/solver/muz/horn-tactic.ts +201 -0
  368. package/src/prover/smt/solver/muz/rule-properties.ts +337 -0
  369. package/src/prover/smt/solver/muz/spacer-context.ts +1406 -0
  370. package/src/prover/smt/solver/muz/spacer-dl-interface.ts +52 -0
  371. package/src/prover/smt/solver/muz/spacer-generalizers.ts +241 -0
  372. package/src/prover/smt/solver/muz/spacer-manager.ts +127 -0
  373. package/src/prover/smt/solver/muz/spacer-pdr.ts +218 -0
  374. package/src/prover/smt/solver/muz/spacer-prop-solver.ts +333 -0
  375. package/src/prover/smt/solver/muz/spacer-util.ts +282 -0
  376. package/src/prover/smt/solver/muz/substitution.ts +203 -0
  377. package/src/prover/smt/solver/nla2bv-tactic.ts +285 -0
  378. package/src/prover/smt/solver/nlqsat.ts +484 -0
  379. package/src/prover/smt/solver/nlsat/algebraic.ts +177 -160
  380. package/src/prover/smt/solver/nlsat/atoms.ts +24 -24
  381. package/src/prover/smt/solver/nlsat/evaluator.ts +16 -22
  382. package/src/prover/smt/solver/nlsat/explain.ts +65 -69
  383. package/src/prover/smt/solver/nlsat/interval-set.ts +9 -51
  384. package/src/prover/smt/solver/nlsat/levelwise.ts +48 -135
  385. package/src/prover/smt/solver/nlsat/mpbq.ts +47 -14
  386. package/src/prover/smt/solver/nlsat/polynomial.ts +29 -161
  387. package/src/prover/smt/solver/nlsat/solver.ts +241 -110
  388. package/src/prover/smt/solver/nlsat/transcendental-eval.ts +310 -0
  389. package/src/prover/smt/solver/nlsat/transcendentals.ts +367 -0
  390. package/src/prover/smt/solver/nlsat/types.ts +0 -9
  391. package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +1 -47
  392. package/src/prover/smt/solver/nlsat/upolynomial.ts +10 -93
  393. package/src/prover/smt/solver/nlsat-tactic.ts +82 -0
  394. package/src/prover/smt/solver/nnf.ts +107 -60
  395. package/src/prover/smt/solver/normalize-bounds.ts +53 -0
  396. package/src/prover/smt/solver/occf.ts +97 -0
  397. package/src/prover/smt/solver/opt-context.ts +787 -0
  398. package/src/prover/smt/solver/opt-nlsat.ts +375 -0
  399. package/src/prover/smt/solver/opt-pareto.ts +282 -0
  400. package/src/prover/smt/solver/opt-preprocess.ts +101 -0
  401. package/src/prover/smt/solver/opt-solver.ts +308 -0
  402. package/src/prover/smt/solver/opt-value.ts +55 -0
  403. package/src/prover/smt/solver/optsmt.ts +692 -0
  404. package/src/prover/smt/solver/parallel-tactic.ts +299 -0
  405. package/src/prover/smt/solver/pattern-inference.ts +21 -26
  406. package/src/prover/smt/solver/pb-rewriter.ts +284 -0
  407. package/src/prover/smt/solver/pb2bv-tactic.ts +540 -0
  408. package/src/prover/smt/solver/poly-rewriter.ts +204 -79
  409. package/src/prover/smt/solver/probes.ts +512 -0
  410. package/src/prover/smt/solver/propagate-values.ts +37 -30
  411. package/src/prover/smt/solver/proto-model.ts +650 -66
  412. package/src/prover/smt/solver/pull-quant.ts +28 -23
  413. package/src/prover/smt/solver/purify-arith.ts +632 -0
  414. package/src/prover/smt/solver/qe-arith-plugin.ts +1098 -0
  415. package/src/prover/smt/solver/qe-lite-der.ts +2 -31
  416. package/src/prover/smt/solver/qe-lite-fm.ts +4 -28
  417. package/src/prover/smt/solver/qe-lite.ts +39 -49
  418. package/src/prover/smt/solver/qe-mbp.ts +270 -0
  419. package/src/prover/smt/solver/qe.ts +1498 -0
  420. package/src/prover/smt/solver/qel.ts +25 -0
  421. package/src/prover/smt/solver/qi-queue.ts +0 -16
  422. package/src/prover/smt/solver/qsat.ts +814 -0
  423. package/src/prover/smt/solver/quant-hoist.ts +196 -0
  424. package/src/prover/smt/solver/quant-tactics.ts +17 -74
  425. package/src/prover/smt/solver/quantifier-analyzer.ts +26 -47
  426. package/src/prover/smt/solver/quantifier-manager.ts +8 -23
  427. package/src/prover/smt/solver/quasi-macros.ts +243 -0
  428. package/src/prover/smt/solver/random-gen.ts +0 -2
  429. package/src/prover/smt/solver/rational.ts +45 -8
  430. package/src/prover/smt/solver/recfun-decl-plugin.ts +261 -0
  431. package/src/prover/smt/solver/recfun-rewriter.ts +107 -0
  432. package/src/prover/smt/solver/reduce-args.ts +225 -0
  433. package/src/prover/smt/solver/reduce-bv-size.ts +119 -0
  434. package/src/prover/smt/solver/ref-vector.ts +0 -6
  435. package/src/prover/smt/solver/relevancy.ts +2 -16
  436. package/src/prover/smt/solver/rewriter-tpl.ts +52 -129
  437. package/src/prover/smt/solver/rewriter.ts +477 -120
  438. package/src/prover/smt/solver/rlimit.ts +39 -21
  439. package/src/prover/smt/solver/sat/asymm-branch.ts +325 -0
  440. package/src/prover/smt/solver/sat/big.ts +177 -0
  441. package/src/prover/smt/solver/sat/clause-use-list.ts +71 -0
  442. package/src/prover/smt/solver/sat/clause.ts +203 -0
  443. package/src/prover/smt/solver/sat/cleaner.ts +94 -0
  444. package/src/prover/smt/solver/sat/config.ts +122 -0
  445. package/src/prover/smt/solver/sat/consequences.ts +203 -0
  446. package/src/prover/smt/solver/sat/elim-eqs.ts +142 -0
  447. package/src/prover/smt/solver/sat/goal2sat.ts +526 -0
  448. package/src/prover/smt/solver/sat/inc-sat-solver.ts +378 -0
  449. package/src/prover/smt/solver/sat/model-converter.ts +136 -0
  450. package/src/prover/smt/solver/sat/pb-constraint.ts +261 -0
  451. package/src/prover/smt/solver/sat/pb-solver.ts +1577 -0
  452. package/src/prover/smt/solver/sat/probing.ts +170 -0
  453. package/src/prover/smt/solver/sat/sat-tactic.ts +43 -0
  454. package/src/prover/smt/solver/sat/sat2goal.ts +165 -0
  455. package/src/prover/smt/solver/sat/scc.ts +142 -0
  456. package/src/prover/smt/solver/sat/simplifier.ts +1618 -0
  457. package/src/prover/smt/solver/sat/solver.ts +2127 -0
  458. package/src/prover/smt/solver/sat/var-queue.ts +117 -0
  459. package/src/prover/smt/solver/sat/watch-list.ts +140 -0
  460. package/src/prover/smt/solver/search-tree.ts +284 -0
  461. package/src/prover/smt/solver/seq-axioms.ts +1010 -0
  462. package/src/prover/smt/solver/seq-decl-plugin.ts +819 -0
  463. package/src/prover/smt/solver/seq-derive.ts +1301 -0
  464. package/src/prover/smt/solver/seq-eq-approx.ts +236 -0
  465. package/src/prover/smt/solver/seq-eq-solver.ts +439 -0
  466. package/src/prover/smt/solver/seq-factory.ts +89 -0
  467. package/src/prover/smt/solver/seq-monadic.ts +728 -0
  468. package/src/prover/smt/solver/seq-range-predicate.ts +235 -0
  469. package/src/prover/smt/solver/seq-re-rewriter.ts +1170 -0
  470. package/src/prover/smt/solver/seq-re-util.ts +758 -0
  471. package/src/prover/smt/solver/seq-regex-bisim.ts +144 -0
  472. package/src/prover/smt/solver/seq-regex-live.ts +200 -0
  473. package/src/prover/smt/solver/seq-rewriter.ts +2402 -0
  474. package/src/prover/smt/solver/seq-skolem.ts +317 -0
  475. package/src/prover/smt/solver/seq-subset.ts +165 -0
  476. package/src/prover/smt/solver/seq-view-witness.ts +353 -0
  477. package/src/prover/smt/solver/smt-consequences.ts +297 -0
  478. package/src/prover/smt/solver/smt-kernel.ts +83 -0
  479. package/src/prover/smt/solver/smt-logics.ts +66 -0
  480. package/src/prover/smt/solver/smt-setup.ts +496 -0
  481. package/src/prover/smt/solver/smt2-printer.ts +765 -0
  482. package/src/prover/smt/solver/smtlib-parser.ts +3140 -365
  483. package/src/prover/smt/solver/smtlib-script.ts +1631 -0
  484. package/src/prover/smt/solver/solve-eqs.ts +929 -0
  485. package/src/prover/smt/solver/solver.ts +119 -39
  486. package/src/prover/smt/solver/sort.ts +1 -5
  487. package/src/prover/smt/solver/static-features.ts +314 -0
  488. package/src/prover/smt/solver/sticky-generations.ts +0 -6
  489. package/src/prover/smt/solver/tactic.ts +1986 -0
  490. package/src/prover/smt/solver/term-enumeration.ts +205 -0
  491. package/src/prover/smt/solver/theory-array.ts +1240 -0
  492. package/src/prover/smt/solver/theory-bv.ts +1200 -0
  493. package/src/prover/smt/solver/theory-char.ts +355 -0
  494. package/src/prover/smt/solver/theory-datatype.ts +598 -0
  495. package/src/prover/smt/solver/theory-finite-set.ts +30 -0
  496. package/src/prover/smt/solver/theory-fpa.ts +389 -0
  497. package/src/prover/smt/solver/theory-lra-axioms.ts +55 -25
  498. package/src/prover/smt/solver/theory-lra-bounds.ts +31 -11
  499. package/src/prover/smt/solver/theory-lra-final-check.ts +59 -91
  500. package/src/prover/smt/solver/theory-lra-internalize.ts +94 -53
  501. package/src/prover/smt/solver/theory-lra-model.ts +23 -53
  502. package/src/prover/smt/solver/theory-lra-propagate.ts +24 -40
  503. package/src/prover/smt/solver/theory-lra-state.ts +6 -27
  504. package/src/prover/smt/solver/theory-lra.ts +188 -8
  505. package/src/prover/smt/solver/theory-pb.ts +934 -0
  506. package/src/prover/smt/solver/theory-polymorphism.ts +58 -0
  507. package/src/prover/smt/solver/theory-recfun.ts +307 -0
  508. package/src/prover/smt/solver/theory-seq-regex.ts +867 -0
  509. package/src/prover/smt/solver/theory-seq-solve.ts +1373 -0
  510. package/src/prover/smt/solver/theory-seq-state.ts +871 -0
  511. package/src/prover/smt/solver/theory-seq.ts +961 -0
  512. package/src/prover/smt/solver/theory.ts +189 -0
  513. package/src/prover/smt/solver/tseitin-cnf.ts +485 -0
  514. package/src/prover/smt/solver/var-subst.ts +37 -39
  515. package/src/prover/smt/table.ts +3 -10
  516. package/src/prover/smt/types.ts +146 -0
  517. package/src/prover/tlapm/cache.ts +67 -41
  518. package/src/prover/tlapm/ocaml-marshal.ts +19 -21
  519. package/src/prover/tlapm/tlapm.ts +21 -20
  520. package/src/prover/tlapm-library.ts +3208 -0
  521. package/src/prover/verdict.ts +9 -2
  522. package/src/prover/zenon/check/check.ts +1 -11
  523. package/src/prover/zenon/check/definitions.ts +5 -15
  524. package/src/prover/zenon/check/equality.ts +0 -8
  525. package/src/prover/zenon/check/functions.ts +0 -4
  526. package/src/prover/zenon/check/keys.ts +0 -7
  527. package/src/prover/zenon/check/propositional.ts +0 -3
  528. package/src/prover/zenon/check/records.ts +1 -6
  529. package/src/prover/zenon/check/relations.ts +2 -14
  530. package/src/prover/zenon/check/rewrites.ts +2 -21
  531. package/src/prover/zenon/check/sets.ts +40 -61
  532. package/src/prover/zenon/check/terms.ts +1 -19
  533. package/src/prover/zenon/check/tla.ts +0 -6
  534. package/src/prover/zenon/decide.ts +10 -19
  535. package/src/prover/zenon/encode.ts +0 -9
  536. package/src/prover/zenon/eqrel.ts +2 -15
  537. package/src/prover/zenon/equality-rules.ts +0 -6
  538. package/src/prover/zenon/expr.ts +8 -28
  539. package/src/prover/zenon/index-table.ts +26 -59
  540. package/src/prover/zenon/isar-case.ts +8 -20
  541. package/src/prover/zenon/isar.ts +35 -65
  542. package/src/prover/zenon/limits.ts +0 -4
  543. package/src/prover/zenon/llproof.ts +2 -22
  544. package/src/prover/zenon/mltoll.ts +66 -106
  545. package/src/prover/zenon/node.ts +20 -15
  546. package/src/prover/zenon/ocaml.ts +1 -17
  547. package/src/prover/zenon/parse.ts +9 -13
  548. package/src/prover/zenon/phrase.ts +1 -13
  549. package/src/prover/zenon/proof.ts +0 -11
  550. package/src/prover/zenon/propositional-rules.ts +0 -7
  551. package/src/prover/zenon/rules.ts +2 -8
  552. package/src/prover/zenon/search.ts +11 -35
  553. package/src/prover/zenon/tla/functions.ts +59 -33
  554. package/src/prover/zenon/tla/llproof.ts +67 -78
  555. package/src/prover/zenon/tla/records.ts +57 -35
  556. package/src/prover/zenon/tla/rewrites.ts +12 -21
  557. package/src/prover/zenon/tla/sets.ts +88 -59
  558. package/src/prover/zenon/tla/terms.ts +0 -8
  559. package/src/prover/zenon/tla/tla.ts +66 -66
  560. package/src/randomization.ts +81 -35
  561. package/src/resolve.ts +67 -185
  562. package/src/runtime.ts +26 -22
  563. package/src/sany/builtins.ts +2 -5
  564. package/src/sany/generation.ts +394 -0
  565. package/src/sany/generator-def-entries.ts +210 -0
  566. package/src/sany/generator-definitions.ts +686 -0
  567. package/src/sany/generator-expressions.ts +1100 -0
  568. package/src/sany/generator-proofs.ts +662 -0
  569. package/src/sany/generator.ts +191 -2764
  570. package/src/sany/levels.ts +5 -35
  571. package/src/sany/lexer.ts +58 -77
  572. package/src/sany/linter.ts +0 -10
  573. package/src/sany/modules.ts +1 -5
  574. package/src/sany/nodes.ts +5 -43
  575. package/src/sany/parse-error.ts +39 -117
  576. package/src/sany/report.ts +32 -69
  577. package/src/sany/selectors.ts +49 -76
  578. package/src/sany/source.ts +1 -17
  579. package/src/sany/xml.ts +35 -117
  580. package/src/search.ts +671 -169
  581. package/src/simulate.ts +712 -0
  582. package/src/spec-description.ts +192 -100
  583. package/src/standard-definitions.ts +4 -4
  584. package/src/standard-modules.ts +264 -95
  585. package/src/state-graph.ts +52 -33
  586. package/src/subexpressions.ts +69 -52
  587. package/src/substitution-levels.ts +7 -7
  588. package/src/successors.ts +267 -100
  589. package/src/symmetry.ts +35 -27
  590. package/src/tableau.ts +29 -26
  591. package/src/tlc/fingerprint.ts +267 -79
  592. package/src/tlc/jar-data.ts +112 -6
  593. package/src/tlc/messages.ts +125 -54
  594. package/src/tlc/order.ts +39 -69
  595. package/src/tlc/random.ts +37 -49
  596. package/src/tlc/replay.ts +553 -228
  597. package/src/tlc/summary.ts +64 -60
  598. package/src/tlc/tlc-operators.ts +78 -44
  599. package/src/tlc/tlcext-operators.ts +171 -122
  600. package/src/tlc/trace-spec.ts +249 -0
  601. package/src/tlc/value-stream.ts +139 -0
  602. package/src/tlc/version.ts +1 -4
  603. package/src/transfer.ts +22 -25
  604. package/src/typed-tier.ts +6535 -0
  605. package/src/typescript/actions.ts +479 -0
  606. package/src/typescript/collections.ts +614 -0
  607. package/src/typescript/compile.ts +63 -0
  608. package/src/typescript/context.ts +94 -0
  609. package/src/typescript/emit.ts +121 -0
  610. package/src/typescript/expressions.ts +496 -0
  611. package/src/typescript/formula.ts +154 -0
  612. package/src/typescript/functions.ts +284 -0
  613. package/src/typescript/model.ts +162 -0
  614. package/src/typescript/names.ts +114 -0
  615. package/src/typescript/program.ts +48 -0
  616. package/src/typescript/properties.ts +139 -0
  617. package/src/typescript/scope.ts +112 -0
  618. package/src/typescript/steps.ts +167 -0
  619. package/src/typescript/types.ts +171 -0
  620. package/src/values.ts +832 -484
  621. package/src/worker.ts +7 -8
  622. package/src/prover/isabelle/isar/statement.ts +0 -57
  623. package/src/prover/smt/solver/z3-license.txt +0 -10
  624. package/src/prover/tlaps-module.ts +0 -510
  625. package/src/prover/zenon/LICENSE +0 -32
@@ -1,6 +1,3 @@
1
- // Expr.Action.implication_to_enabled, the ENABLEDaxioms frontend: it proves a rule about ENABLED
2
- // from facts of the form the rule needs.
3
-
4
1
  import { TlapmBugError, TlaProverError } from "../../errors";
5
2
  import { shiftExpr } from "../../obligations/substitution";
6
3
  import { isEqualExpr } from "../../obligations/equality";
@@ -9,10 +6,13 @@ import {
9
6
  adjoinAll,
10
7
  getScopeAt,
11
8
  mapScoped,
9
+ getAtPrefix,
12
10
  type Builtin,
13
11
  type Expr,
12
+ type Locus,
14
13
  type Scope,
15
14
  type Sequent,
15
+ type Warn,
16
16
  } from "../../obligations/expression";
17
17
  import { getLevelInfo } from "../../obligations/levels";
18
18
 
@@ -40,7 +40,6 @@ const getEnabled = (expression: Expr) =>
40
40
  ? expression.args[0]
41
41
  : undefined;
42
42
 
43
- // Both operands of the connective, when each is an ENABLED.
44
43
  const getEnabledOperands = (expression: Expr, builtin: Builtin) => {
45
44
  const operands = getOperands(expression, builtin);
46
45
  const left = operands && getEnabled(operands[0]);
@@ -48,7 +47,6 @@ const getEnabledOperands = (expression: Expr, builtin: Builtin) => {
48
47
  return left && right ? [left, right] : undefined;
49
48
  };
50
49
 
51
- // E_visit.collect_primed_vars: the variables under a prime, an UNCHANGED, or a subscript.
52
50
  const getPrimedVariables = (scope: Scope | undefined, expression: Expr) => {
53
51
  const names = new Set<string>();
54
52
  const visit = (state: { scope: Scope | undefined; isPrimed: boolean }, inner: Expr): Expr => {
@@ -90,7 +88,6 @@ const isDisjoint = (scope: Scope | undefined, left: Expr, right: Expr) => {
90
88
  return [...getPrimedVariables(scope, right)].every((name) => !leftNames.has(name));
91
89
  };
92
90
 
93
- // check_active: the rule the goal's form calls for, with the operands the facts must mention.
94
91
  const getRule = (scope: Scope | undefined, goal: Expr): Rule | undefined => {
95
92
  const getLevelOf = (expression: Expr) => getLevelInfo(scope, expression).level;
96
93
  const assertActions = (left: Expr, right: Expr) => {
@@ -135,13 +132,17 @@ const getRule = (scope: Scope | undefined, goal: Expr): Rule | undefined => {
135
132
  return implication && { name: "implies", left: implication[0], right: implication[1] };
136
133
  };
137
134
 
138
- // implication_to_enabled: the goal follows by the rule its form calls for when a visible fact is
139
- // the rule's premise and others say that both operands are in BOOLEAN, or the premise is an
140
- // equivalence. The goal then becomes TRUE; otherwise tlapm records the obligation as not tried.
141
- export const implicationToEnabled = (sequent: Sequent): Sequent => {
135
+ // When no rule applies, tlapm records the obligation as not tried.
136
+ export const implicationToEnabled = (
137
+ sequent: Sequent,
138
+ locus: Locus | undefined,
139
+ onWarning: Warn,
140
+ ): Sequent => {
142
141
  const goalScope = adjoinAll(undefined, sequent.context);
143
142
  const rule = getRule(goalScope, sequent.active);
144
- const found = { isPremise: false, isLeftBoolean: false, isRightBoolean: false };
143
+ let isPremise = false;
144
+ let isLeftBoolean = false;
145
+ let isRightBoolean = false;
145
146
  sequent.context.forEach((hyp, index) => {
146
147
  if (!rule || hyp.kind !== "Fact" || hyp.visibility !== "Visible") return;
147
148
  const amount = sequent.context.length - index;
@@ -167,23 +168,24 @@ export const implicationToEnabled = (sequent: Sequent): Sequent => {
167
168
  isPair(getEnabledOperands(fact, "Conj"), ["abconj_inverse", "pconj_inverse"]) ||
168
169
  isPair(conjunction && action && [conjunction[0], action], ["pconj_inverse"])
169
170
  ) {
170
- found.isPremise = true;
171
+ isPremise = true;
171
172
  } else if (isPair(getOperands(fact, "Equiv"), ["equiv"])) {
172
- found.isPremise = true;
173
- found.isLeftBoolean = true;
174
- found.isRightBoolean = true;
173
+ isPremise = true;
174
+ isLeftBoolean = true;
175
+ isRightBoolean = true;
175
176
  } else if (isPair(getOperands(fact, "Eq"), ["equiv"])) {
176
- found.isPremise = true;
177
+ isPremise = true;
177
178
  } else if (membership && isBoolean && isLeft(membership[0])) {
178
- found.isLeftBoolean = true;
179
+ isLeftBoolean = true;
179
180
  } else if (membership && isBoolean && isRight(membership[0])) {
180
- found.isRightBoolean = true;
181
+ isRightBoolean = true;
181
182
  } else if (isPair(getOperands(fact, "Implies"), ["implies"])) {
182
- found.isPremise = true;
183
+ isPremise = true;
183
184
  }
184
185
  });
185
- if (!found.isPremise || !found.isLeftBoolean || !found.isRightBoolean) {
186
+ if (!rule || !isPremise || !isLeftBoolean || !isRightBoolean) {
186
187
  throw new TlaProverError("ENABLEDaxioms proof directive did not succeed.\n");
187
188
  }
189
+ onWarning({ text: `${getAtPrefix(locus)}[INFO]\nProved ${rule.name}\n`, channel: "stdout" });
188
190
  return { ...sequent, active: TRUE };
189
191
  };
@@ -1,21 +1,16 @@
1
- // A port of tlapm's Backend.Fingerprints.fp_sequent: the digest of an obligation that names its
2
- // hypotheses and bound variables by the order of their first use, so two obligations that differ
3
- // only in names share it.
4
-
5
1
  import { TlapmBugError } from "../../errors";
6
2
  import {
7
3
  adjoin,
8
4
  type Bound,
9
5
  type Builtin,
10
6
  type Expr,
11
- type Hyp,
12
7
  type Scope,
13
8
  type Sequent,
14
9
  } from "../../obligations/expression";
15
10
  import { isConstant } from "../../obligations/temporal";
11
+ import { LEVEL_PREFIXES } from "./action";
16
12
  import { getMd5 } from "./md5";
17
13
 
18
- // builtin_to_int, whose numbers skip [], which fp_bin prints by name.
19
14
  const BUILTIN_NUMBERS: Builtin[] = [
20
15
  "TRUE",
21
16
  "FALSE",
@@ -97,8 +92,6 @@ const MODALS = { Box: 0, Dia: 1 };
97
92
 
98
93
  const FAIRNESS = { Weak: 0, Strong: 1 };
99
94
 
100
- // What a stack entry stands for: a hypothesis not yet used, under the label its first use prints,
101
- // one used, numbered, a bound variable not yet used, one used, a pragma, or a hidden fact.
102
95
  type Ident =
103
96
  | { kind: "Hyp"; label: string }
104
97
  | { kind: "HypIndex"; index: number }
@@ -126,7 +119,6 @@ const OCAML_ESCAPES: Record<number, string> = {
126
119
  0x08: "\\b",
127
120
  };
128
121
 
129
- // OCaml's %S: a string literal, with each byte outside printable ASCII as a decimal escape.
130
122
  const quoteString = (value: string) =>
131
123
  `"${[...new TextEncoder().encode(value)]
132
124
  .map(
@@ -144,10 +136,6 @@ const getBuiltin = (builtin: Builtin) => {
144
136
  return `$${BUILTIN_NUMBERS.indexOf(builtin)}`;
145
137
  };
146
138
 
147
- const getFreshLabel = (hyp: Extract<Hyp, { kind: "Fresh" }>) =>
148
- hyp.level === "Unknown" ? "Unknown" : hyp.level.toUpperCase();
149
-
150
- // fp_sequent's text for an obligation, before its digest.
151
139
  const getFingerprintText = (sequent: Sequent) => {
152
140
  const stack: Entry[] = [];
153
141
  const getEntry = (index: number) => {
@@ -163,7 +151,6 @@ const getFingerprintText = (sequent: Sequent) => {
163
151
  };
164
152
  const pushVariables = (count: number) =>
165
153
  Array.from({ length: count }).forEach(() => push({ kind: "Var" }));
166
- // Stack.popn: the entries from the top down.
167
154
  const popVariables = (count: number) => Array.from({ length: count }, pop);
168
155
  const getVariableNumber = (entry: Entry) => {
169
156
  if (entry.ident.kind === "VarIndex") return entry.ident.index;
@@ -178,7 +165,6 @@ const getFingerprintText = (sequent: Sequent) => {
178
165
  const printExpr = (counters: Counters, expression: Expr): string => {
179
166
  const print = (inner: Expr) => printExpr(counters, inner);
180
167
  const printList = (items: Expr[]) => items.map(print).join(",");
181
- // fp_bounds pairs each bound with an entry, and prints those with a domain.
182
168
  const printBounds = (entries: Entry[], bounds: Bound[]) =>
183
169
  bounds
184
170
  .map((bound, index) =>
@@ -187,7 +173,6 @@ const getFingerprintText = (sequent: Sequent) => {
187
173
  : "",
188
174
  )
189
175
  .join("");
190
- // A binder's body comes first, then what pops off the stack after it.
191
176
  const printBound = (count: number, body: Expr) => {
192
177
  pushVariables(count);
193
178
  const text = print(body);
@@ -220,7 +205,6 @@ const getFingerprintText = (sequent: Sequent) => {
220
205
  case "Pragma":
221
206
  return "";
222
207
  }
223
- throw new TlapmBugError();
224
208
  }
225
209
  case "Opaque":
226
210
  return expression.name;
@@ -333,8 +317,6 @@ const getFingerprintText = (sequent: Sequent) => {
333
317
  }
334
318
  };
335
319
 
336
- // Each hypothesis prints after the goal and the hypotheses after it, once their uses have
337
- // numbered it.
338
320
  const printSequent = (inner: Sequent): string => {
339
321
  const counters = { hyp: 1, variable: 1 };
340
322
  const spin = (index: number, scope: Scope | undefined): string => {
@@ -348,7 +330,7 @@ const getFingerprintText = (sequent: Sequent) => {
348
330
  switch (hyp.kind) {
349
331
  case "Fresh": {
350
332
  if (!hyp.domain) {
351
- const label = getFreshLabel(hyp);
333
+ const label = LEVEL_PREFIXES[hyp.level];
352
334
  const after = getRest({ kind: "Hyp", label });
353
335
  return after.entry.isUsed ? `${after.rest}${label}${hyp.name}` : after.rest;
354
336
  }
@@ -384,5 +366,4 @@ const getFingerprintText = (sequent: Sequent) => {
384
366
  return printSequent(sequent);
385
367
  };
386
368
 
387
- // fingerprint: the hex digest of an obligation's fp_sequent text.
388
369
  export const getFingerprint = (sequent: Sequent) => getMd5(getFingerprintText(sequent));
@@ -1,7 +1,3 @@
1
- // A port of tlapm's Expr.LevelComparison, the LevelComparison frontend: it proves an obligation
2
- // whose goal is a visible fact, or the goal of a visible ASSUME/PROVE fact, with identifiers
3
- // renamed to identifiers of no higher level, each renamed one declared by the fact.
4
-
5
1
  import { TlapmBugError, TlaProverError } from "../../errors";
6
2
  import {
7
3
  adjoin,
@@ -30,6 +26,12 @@ interface Declaration {
30
26
  level: number;
31
27
  }
32
28
 
29
+ interface Binder {
30
+ name: string;
31
+ domain: Expr | undefined;
32
+ body: Expr;
33
+ }
34
+
33
35
  const RANKS: Partial<Record<Declaration["kind"], number>> = {
34
36
  Constant: 0,
35
37
  State: 1,
@@ -46,7 +48,6 @@ const isPairwise = <Item>(
46
48
  left.every((item, index) => index < right.length && isSameItem(item, right[index])) &&
47
49
  left.length === right.length;
48
50
 
49
- // Util.Coll.Sm built from a list, where the first entry of a name wins, in key order.
50
51
  const getSortedFields = (fields: { name: string; value: Expr }[]) =>
51
52
  [...new Map(fields.toReversed().map((field) => [field.name, field.value]))].toSorted(
52
53
  (first, second) => (first[0] < second[0] ? -1 : 1),
@@ -81,8 +82,6 @@ const bindFlexible = (scope: Scope | undefined, names: string[]) =>
81
82
  names.map((name) => ({ kind: "Flex", name })),
82
83
  );
83
84
 
84
- // level_comparison#compare: the expressions match up to a renaming that maps each name one way,
85
- // and the fact's context declares each name it changes.
86
85
  const compare = (
87
86
  factScope: Scope | undefined,
88
87
  goalScope: Scope | undefined,
@@ -227,8 +226,8 @@ const compare = (
227
226
  const isSameBinder = (
228
227
  leftScope: Scope | undefined,
229
228
  rightScope: Scope | undefined,
230
- left: { name: string; domain: Expr | undefined; body: Expr },
231
- right: { name: string; domain: Expr | undefined; body: Expr },
229
+ left: Binder,
230
+ right: Binder,
232
231
  ) => {
233
232
  if (!left.domain || !right.domain) {
234
233
  return (
@@ -317,7 +316,6 @@ const compare = (
317
316
  }
318
317
  return selector.kind === other.kind;
319
318
  });
320
- // List.for_all2 raises when the lists differ in length after a matching prefix.
321
319
  if (isPrefix && left.selectors.length !== rightSelectors.length) {
322
320
  throw new TlapmBugError("Invalid_argument");
323
321
  }
@@ -507,8 +505,6 @@ const compare = (
507
505
  return isMatch && isDeclared.every(Boolean);
508
506
  };
509
507
 
510
- // check_level_change: the first visible fact that matches proves the goal, which becomes TRUE.
511
- // When none does, tlapm records the obligation as not tried.
512
508
  export const checkLevelChange = (sequent: Sequent): Sequent => {
513
509
  const goalScope = adjoinAll(undefined, sequent.context);
514
510
  const isProved = sequent.context.some((hyp, index) => {
@@ -1,5 +1,3 @@
1
- // MD5 (RFC 1321), as OCaml's Digest computes it. tlapm names the operators it coalesces by
2
- // the digest of their printed form, so matching its SMT-LIB output needs the same digest.
3
1
  const SHIFTS = [7, 12, 17, 22, 5, 9, 14, 20, 4, 11, 16, 23, 6, 10, 15, 21];
4
2
 
5
3
  const CONSTANTS = Array.from({ length: 64 }, (_value, index) =>
@@ -1,23 +1,36 @@
1
- // Prep.find_meth and Prep.compute_meth: the methods the pragmas an obligation cites select, each a
2
- // prover with its time limit, or a frontend that rewrites the obligation first. A malformed method
3
- // throws a TlaProverError, since Prep.ship catches compute_meth's failure and fails only that
4
- // obligation.
5
-
6
- import { TlapmBugError, TlaProverError } from "../../errors";
1
+ import { TlaMethodError, TlapmBugError, TlaProverError } from "../../errors";
7
2
  import type { Expr, Locus, Sequent } from "../../obligations/expression";
8
3
  import type { OldMethod, PragmaSetting } from "../../obligations/pragma";
4
+ import type { Backend } from "../verdict";
5
+
6
+ type Prover =
7
+ | Backend
8
+ | "yices"
9
+ | "cvc4"
10
+ | "cooper"
11
+ | "fail"
12
+ | "verit"
13
+ | "zipper"
14
+ | "spass"
15
+ | "tptp"
16
+ | "trivial"
17
+ | "expandenabled"
18
+ | "expandcdot"
19
+ | "autouse"
20
+ | "lambdify"
21
+ | "enabledaxioms"
22
+ | "levelcomparison";
9
23
 
10
- // A method, named after the Method.t constructor tlapm reports it by. A Z3 resource budget turns
11
- // the time limit off.
12
24
  export interface Method {
13
- prover: string;
25
+ prover: Prover;
14
26
  timeLimitMs: number;
15
27
  rlimit?: number;
16
28
  tactic?: string;
17
29
  }
18
30
 
19
- // The methods that rewrite an obligation in Prep.expand_enabled_cdot instead of proving it.
20
- const FRONTENDS = new Set([
31
+ export const getBudget = (method: Method) => method.rlimit ?? method.timeLimitMs / 1000;
32
+
33
+ export const FRONTENDS = new Set<Prover>([
21
34
  "expandenabled",
22
35
  "expandcdot",
23
36
  "autouse",
@@ -26,40 +39,35 @@ const FRONTENDS = new Set([
26
39
  "levelcomparison",
27
40
  ]);
28
41
 
29
- // Method.default_*_timeout, in seconds.
30
42
  const SMT_SECONDS = 5;
31
43
  const ZENON_SECONDS = 10;
32
44
  const ISABELLE_SECONDS = 30;
33
45
  const LS4_SECONDS = 10;
34
46
 
35
- // Method.rlimit_base and Method.max_rlimit.
36
47
  const RLIMIT_BASE = 3_000_000;
37
48
  const MAX_RLIMIT = 0xffff_ffff;
38
49
 
39
- // Params.default_method: what tlapm tries when a step cites no prover.
40
50
  const DEFAULT_METHODS: Method[] = [
41
51
  { prover: "smt", timeLimitMs: SMT_SECONDS * 1000 },
42
52
  { prover: "zenon", timeLimitMs: ZENON_SECONDS * 1000 },
43
53
  { prover: "isabelle", timeLimitMs: ISABELLE_SECONDS * 1000, tactic: "auto" },
44
54
  ];
45
55
 
46
- // compute_meth's names for each prover, and the Method.t constructor and default time each
47
- // selects. The SMT solvers take a resource budget.
48
- const PROVERS: Record<string, { prover: string; seconds: number; isBudgeted?: boolean }> = {
56
+ const PROVERS: Record<string, { prover: Prover; seconds: number; isBudgeted?: boolean }> = {
49
57
  zenon: { prover: "zenon", seconds: ZENON_SECONDS },
50
58
  isabelle: { prover: "isabelle", seconds: ISABELLE_SECONDS },
51
59
  yices: { prover: "yices", seconds: 30 },
52
60
  ls4: { prover: "ls4", seconds: LS4_SECONDS },
53
61
  z3: { prover: "z3", seconds: SMT_SECONDS, isBudgeted: true },
54
62
  smt: { prover: "smt", seconds: SMT_SECONDS, isBudgeted: true },
55
- cvc3: { prover: "cvc3", seconds: SMT_SECONDS },
56
- cooper: { prover: "cooper", seconds: 0 },
57
- fail: { prover: "fail", seconds: 0 },
63
+ cvc3: { prover: "cvc4", seconds: SMT_SECONDS },
64
+ cooper: { prover: "cooper", seconds: Infinity },
65
+ fail: { prover: "fail", seconds: Infinity },
58
66
  smt2lib: { prover: "smt", seconds: SMT_SECONDS, isBudgeted: true },
59
67
  smt2z3: { prover: "z3", seconds: SMT_SECONDS, isBudgeted: true },
60
68
  smt3: { prover: "smt", seconds: SMT_SECONDS, isBudgeted: true },
61
69
  z33: { prover: "z3", seconds: SMT_SECONDS, isBudgeted: true },
62
- cvc33: { prover: "cvc3", seconds: SMT_SECONDS },
70
+ cvc33: { prover: "cvc4", seconds: SMT_SECONDS },
63
71
  yices3: { prover: "yices", seconds: SMT_SECONDS },
64
72
  verit: { prover: "verit", seconds: SMT_SECONDS },
65
73
  zipper: { prover: "zipper", seconds: 30 },
@@ -69,84 +77,155 @@ const PROVERS: Record<string, { prover: string; seconds: number; isBudgeted?: bo
69
77
  ...Object.fromEntries([...FRONTENDS].map((name) => [name, { prover: name, seconds: 0 }])),
70
78
  };
71
79
 
80
+ const UNTIMED_PROVERS = new Set<Prover>(["cooper", "fail", "trivial", ...FRONTENDS]);
81
+
72
82
  const getProverMethod = (
73
83
  name: string,
74
84
  timeout: number | undefined,
75
85
  rlimit: number | undefined,
76
86
  tactic: string | undefined,
77
87
  ): Method => {
78
- const known = PROVERS[name];
88
+ const known = Object.hasOwn(PROVERS, name) ? PROVERS[name] : undefined;
79
89
  if (!known) throw new TlaProverError(`Unknown prover: ${name}`);
80
- if (rlimit !== undefined && !known.isBudgeted)
81
- throw new TlaProverError(
82
- 'A Z3 rlimit budget ("rN") is only supported by the SMT and Z3 backends.',
83
- );
84
90
  return {
85
91
  prover: known.prover,
86
- timeLimitMs: rlimit === undefined ? (timeout ?? known.seconds) * 1000 : Infinity,
92
+ timeLimitMs:
93
+ rlimit !== undefined
94
+ ? Infinity
95
+ : ((UNTIMED_PROVERS.has(known.prover) ? undefined : timeout) ?? known.seconds) * 1000,
87
96
  ...(rlimit !== undefined && { rlimit }),
88
97
  ...(known.prover === "isabelle" && { tactic: tactic ?? "auto" }),
89
98
  };
90
99
  };
91
100
 
92
- // parse_rlimit: "rN" is N times the base resource count, at least 1.
93
- const getRlimit = (budget: string) => {
94
- const count = Number.parseFloat(budget.slice(1));
95
- if (!/^[rR]./.test(budget) || !Number.isFinite(count) || count <= 0)
96
- throw new TlaProverError(`Invalid SMT budget "${budget}"`);
101
+ const BUDGET_FORMS =
102
+ 'a number of seconds (wall-clock timeout), or a deterministic Z3 rlimit budget of the form "rN" (e.g. "r5")';
103
+
104
+ const HEX_FLOAT =
105
+ /^[\t-\r ]*[+-]?0x(?=\.?[\da-f])([\da-f]*)\.?([\da-f]*)(?:p([\t-\r ]*[+-]?\d+))?$/i;
106
+ const DECIMAL_FLOAT = /^[\t-\r ]*[+-]?(?:\d+\.?\d*|\.\d+)(?:e[+-]?\d+)?$/i;
107
+ const SPECIAL_FLOAT = /^[\t-\r ]*[+-]?(?:(inf(?:inity)?)|nan(?:\([^)]*\))?)$/i;
108
+
109
+ // OCaml's float_of_string_opt: caml_float_of_string drops underscores, then reads a C99 float.
110
+ export const parseOcamlFloat = (text: string) => {
111
+ const digits = text.replaceAll("_", "");
112
+ const sign = digits.trimStart().startsWith("-") ? -1 : 1;
113
+ const hex = HEX_FLOAT.exec(digits);
114
+ if (hex) {
115
+ const mantissa = Number(BigInt(`0x${hex[1]}${hex[2]}`));
116
+ return mantissa === 0 ? 0 : sign * mantissa * 2 ** (Number(hex[3] ?? 0) - 4 * hex[2].length);
117
+ }
118
+ const special = SPECIAL_FLOAT.exec(digits);
119
+ if (special) return special[1] === undefined ? NaN : sign * Infinity;
120
+ return DECIMAL_FLOAT.test(digits) ? Number(digits) : undefined;
121
+ };
122
+
123
+ const OCAML_INT =
124
+ /^([+-]?)(?:0x([\da-f][\da-f_]*)|0o([0-7][0-7_]*)|0b([01][01_]*)|(0u)?(\d[\d_]*))$/i;
125
+
126
+ // OCaml's int_of_string_opt: only an unprefixed decimal is range-checked as a signed 63-bit integer.
127
+ export const parseOcamlInt = (text: string) => {
128
+ const match = OCAML_INT.exec(text);
129
+ if (!match) return undefined;
130
+ const isNegative = match[1] === "-";
131
+ const prefixed =
132
+ match[2] === undefined
133
+ ? match[3] === undefined
134
+ ? match[4] === undefined
135
+ ? match[6]
136
+ : `0b${match[4]}`
137
+ : `0o${match[3]}`
138
+ : `0x${match[2]}`;
139
+ const magnitude = BigInt(prefixed.replaceAll("_", ""));
140
+ const isSigned = prefixed === match[6] && match[5] === undefined;
141
+ if (magnitude > (isSigned ? 2n ** 62n - (isNegative ? 0n : 1n) : 2n ** 63n - 1n))
142
+ return undefined;
143
+ return Number(BigInt.asIntN(63, isNegative ? -magnitude : magnitude));
144
+ };
145
+
146
+ const getRlimit = (budget: string, locus: Locus | undefined) => {
147
+ const count = parseOcamlFloat(budget.slice(1));
148
+ if (!/^[rR]./s.test(budget) || count === undefined || !Number.isFinite(count) || count <= 0)
149
+ throw new TlaMethodError(
150
+ `Invalid SMT budget ${JSON.stringify(budget)}: expected ${BUDGET_FORMS}.`,
151
+ locus,
152
+ );
97
153
  return Math.max(1, Math.trunc(Math.min(count * RLIMIT_BASE, MAX_RLIMIT)));
98
154
  };
99
155
 
100
- // compute_meth: a group of a pragma's settings, where each @ takes the next argument the pragma is
101
- // applied to.
102
- const computeMethod = (settings: PragmaSetting[], args: Expr[]): Method => {
103
- const values = settings.reduce<{
104
- args: Expr[];
105
- prover?: string;
106
- timeout?: number;
107
- rlimit?: number;
108
- tactic?: string;
109
- }>(
156
+ interface MethodValues {
157
+ args: Expr[];
158
+ prover?: string;
159
+ proverLocus?: Locus;
160
+ timeout?: number;
161
+ rlimit?: number;
162
+ tactic?: string;
163
+ }
164
+
165
+ // Each @ takes the next argument the pragma is applied to at the use.
166
+ const computeMethod = (settings: PragmaSetting[], args: Expr[], use: Locus | undefined): Method => {
167
+ const values = settings.reduce<MethodValues>(
110
168
  (state, setting) => {
111
169
  const value = setting.value;
112
170
  const argument = value.kind === "Default" ? state.args[0] : undefined;
113
171
  const rest = value.kind === "Default" ? state.args.slice(1) : state.args;
172
+ if (setting.hint !== "prover" && setting.hint !== "tactic" && setting.hint !== "timeout")
173
+ throw new TlaMethodError(
174
+ `Unknown keyword in proof method definition: ${setting.hint}`,
175
+ setting.location,
176
+ );
114
177
  if (value.kind === "Default" && !argument)
115
- throw new TlaProverError("Some arguments are missing");
116
- const text =
117
- value.kind === "String"
118
- ? value.value
119
- : argument?.kind === "String"
120
- ? argument.value
121
- : undefined;
122
- switch (setting.hint) {
123
- case "prover":
124
- case "tactic":
125
- if (text === undefined) throw new TlaProverError(`This argument should be a string`);
126
- return { ...state, args: rest, [setting.hint]: text };
127
- case "timeout": {
128
- if (value.kind === "Float") return { ...state, args: rest, timeout: value.value };
129
- if (text !== undefined) return { ...state, args: rest, rlimit: getRlimit(text) };
130
- if (argument?.kind !== "Num")
131
- throw new TlaProverError("This argument should be a number of seconds");
178
+ throw new TlaMethodError("Some arguments are missing", use);
179
+ if (setting.hint === "timeout") {
180
+ if (value.kind === "Float") return { ...state, timeout: value.value };
181
+ if (value.kind === "String")
182
+ return { ...state, rlimit: getRlimit(value.value, setting.location) };
183
+ if (argument?.kind === "Num")
132
184
  return {
133
185
  ...state,
134
186
  args: rest,
135
187
  timeout: Number(`${argument.integer}.${argument.fraction}`),
136
188
  };
137
- }
138
- default:
139
- throw new TlaProverError(`Unknown keyword in proof method definition: ${setting.hint}`);
189
+ if (argument?.kind === "String")
190
+ return { ...state, args: rest, rlimit: getRlimit(argument.value, argument.location) };
191
+ throw new TlaMethodError(`This argument should be ${BUDGET_FORMS}`, argument?.location);
140
192
  }
193
+ if (value.kind === "Float")
194
+ throw new TlaMethodError("Argument should be a string or @", setting.location);
195
+ const text =
196
+ value.kind === "String"
197
+ ? value.value
198
+ : argument?.kind === "String"
199
+ ? argument.value
200
+ : undefined;
201
+ if (text === undefined)
202
+ throw new TlaMethodError(
203
+ `This argument should be a string (${setting.hint === "prover" ? "prover name" : "proof tactic"})`,
204
+ argument?.location,
205
+ );
206
+ if (setting.hint === "tactic") return { ...state, args: rest, tactic: text };
207
+ return {
208
+ ...state,
209
+ args: rest,
210
+ prover: text,
211
+ proverLocus: value.kind === "Default" ? use : setting.location,
212
+ };
141
213
  },
142
214
  { args },
143
215
  );
144
- if (values.args.length > 0) throw new TlaProverError("Too many arguments");
145
- if (values.prover === undefined) throw new TlaProverError("Missing prover name");
216
+ if (values.args.length > 0) throw new TlaMethodError("Too many arguments", use);
217
+ if (values.prover === undefined)
218
+ throw new TlaMethodError("Missing prover name", settings[0].location);
219
+ const known = Object.hasOwn(PROVERS, values.prover) ? PROVERS[values.prover] : undefined;
220
+ if (!known) throw new TlaMethodError(`Unknown prover: ${values.prover}`, values.proverLocus);
221
+ if (values.rlimit !== undefined && !known.isBudgeted)
222
+ throw new TlaMethodError(
223
+ 'A Z3 rlimit budget ("rN") is only supported by the SMT and Z3 backends.',
224
+ use,
225
+ );
146
226
  return getProverMethod(values.prover, values.timeout, values.rlimit, values.tactic);
147
227
  };
148
228
 
149
- // An old-style method, as Method_prs reads it, with its default time unless it names one.
150
229
  const getOldMethod = (method: OldMethod) =>
151
230
  getProverMethod(method.name, method.timeout, undefined, method.tactic);
152
231
 
@@ -155,21 +234,14 @@ type Cited =
155
234
  | { kind: "Meth"; method: OldMethod }
156
235
  | undefined;
157
236
 
158
- // find_meth: an obligation whose proof names a method keeps it. Otherwise each visible fact that
159
- // cites a pragma, alone or applied to arguments, adds the methods its groups compute, and each that
160
- // cites a theorem or carries an old-style method adds that method. A pragma that a fact from
161
- // another BY or USE cites drops the methods found so far: tlapm compares the USE locations
162
- // physically, as tla-ts compares the objects.
163
237
  const getCitedMethods = (sequent: Sequent) => {
164
238
  const cited: Cited[] = [];
165
- const state: { methods: Method[]; useLocation: Locus | undefined | null } = {
166
- methods: [],
167
- useLocation: null,
168
- };
239
+ let methods: Method[] = [];
240
+ let useLocation: Locus | undefined | null = null;
169
241
  sequent.context.forEach((hyp, index) => {
170
242
  const expression = hyp.kind === "Fact" && hyp.visibility === "Visible" && hyp.expression;
171
243
  if (expression && expression.kind === "With") {
172
- state.methods.push(getOldMethod(expression.method));
244
+ methods.push(getOldMethod(expression.method));
173
245
  cited.push(undefined);
174
246
  return;
175
247
  }
@@ -188,25 +260,25 @@ const getCitedMethods = (sequent: Sequent) => {
188
260
  if (operator.kind !== "Ix") return;
189
261
  const entry = cited[index - operator.index];
190
262
  if (entry?.kind === "Premeth") {
191
- if (hyp.useLocation !== state.useLocation) {
192
- state.methods = [];
193
- state.useLocation = hyp.useLocation;
263
+ if (hyp.useLocation !== useLocation) {
264
+ methods = [];
265
+ useLocation = hyp.useLocation;
194
266
  }
195
267
  const args = expression.kind === "Apply" ? expression.args : [];
196
- state.methods.push(...entry.groups.map((group) => computeMethod(group, args)));
268
+ methods.push(...entry.groups.map((group) => computeMethod(group, args, expression.location)));
197
269
  return;
198
270
  }
199
271
  if (entry?.kind !== "Meth") return;
200
- // find_meth asserts that a theorem with a method is not applied to arguments.
201
272
  if (expression.kind === "Apply") throw new TlapmBugError();
202
- state.methods.push(getOldMethod(entry.method));
273
+ methods.push(getOldMethod(entry.method));
203
274
  });
204
- return state.methods;
275
+ return methods;
205
276
  };
206
277
 
207
- // The methods find_meth selects: the frontends to apply, and the provers to try in order, which
208
- // are tlapm's default ones when the obligation cites only frontends or nothing.
209
- export const findMethods = (obligation: { sequent: Sequent; method?: OldMethod }) => {
278
+ export const findMethods = (
279
+ obligation: { sequent: Sequent; method?: OldMethod },
280
+ defaultMethods = DEFAULT_METHODS,
281
+ ) => {
210
282
  const methods =
211
283
  obligation.method === undefined
212
284
  ? getCitedMethods(obligation.sequent)
@@ -216,6 +288,37 @@ export const findMethods = (obligation: { sequent: Sequent; method?: OldMethod }
216
288
  frontends: new Set(
217
289
  methods.flatMap((method) => (FRONTENDS.has(method.prover) ? [method.prover] : [])),
218
290
  ),
219
- provers: provers.length > 0 ? provers : DEFAULT_METHODS,
291
+ provers: provers.length > 0 ? provers : defaultMethods,
220
292
  };
221
293
  };
294
+
295
+ const DEFAULT_METHOD_NAMES: Record<string, string> = {
296
+ zenon: "zenon",
297
+ smt: "smt",
298
+ z3: "z3",
299
+ cvc4: "cvc33",
300
+ yices: "yices3",
301
+ verit: "verit",
302
+ zipper: "zipper",
303
+ spass: "spass",
304
+ tptp: "tptp",
305
+ ls4: "ls4",
306
+ };
307
+
308
+ export const parseDefaultMethods = (text: string) =>
309
+ text.split(",").map((entry): Method => {
310
+ const separator = entry.indexOf(":");
311
+ const name = separator === -1 ? entry : entry.slice(0, separator);
312
+ const seconds = separator === -1 ? undefined : Number.parseFloat(entry.slice(separator + 1));
313
+ if (Number.isNaN(seconds))
314
+ throw new TlaProverError("--method: bad timeout specification: not a number");
315
+ if (name === "auto" || name === "blast" || name === "force")
316
+ return getProverMethod("isabelle", seconds, undefined, name);
317
+ if (name === "fail") return { prover: "fail", timeLimitMs: Infinity };
318
+ const known = Object.hasOwn(DEFAULT_METHOD_NAMES, name)
319
+ ? DEFAULT_METHOD_NAMES[name]
320
+ : undefined;
321
+ if (known === undefined)
322
+ throw new TlaProverError(`--method: unknown method ${JSON.stringify(name)}`);
323
+ return getProverMethod(known, seconds, undefined, undefined);
324
+ });