tla-ts 0.0.4 → 0.0.5-dev.5b2dea1

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 (378) hide show
  1. package/README.md +38 -127
  2. package/dist/cli.cjs +1 -1
  3. package/dist/cli.js +1 -1
  4. package/dist/deciders.cjs +366 -0
  5. package/dist/deciders.js +366 -0
  6. package/dist/index.cjs +1 -1
  7. package/dist/index.d.cts +46 -12
  8. package/dist/index.d.ts +46 -12
  9. package/dist/index.js +1 -1
  10. package/dist/parallel-worker.cjs +1 -4
  11. package/dist/parallel-worker.js +1 -4
  12. package/dist/prove-worker.cjs +9 -0
  13. package/dist/prove-worker.d.cts +9 -0
  14. package/dist/prove-worker.d.ts +9 -0
  15. package/dist/prove-worker.js +9 -0
  16. package/dist/prove.cjs +1006 -0
  17. package/dist/prove.js +1006 -0
  18. package/dist/run.cjs +45 -0
  19. package/dist/run.js +45 -0
  20. package/dist/tlapm.cjs +10 -0
  21. package/dist/tlapm.js +10 -0
  22. package/dist/transfer.cjs +76 -92
  23. package/dist/transfer.js +76 -92
  24. package/dist/worker.cjs +21 -0
  25. package/dist/worker.js +21 -0
  26. package/package.json +21 -12
  27. package/src/ast.ts +2 -2
  28. package/src/bags.ts +22 -23
  29. package/src/builtins.ts +16 -8
  30. package/src/check.ts +131 -1153
  31. package/src/{cli-options.ts → cli/options.ts} +54 -9
  32. package/src/cli/run.ts +63 -0
  33. package/src/cli/shared.ts +106 -0
  34. package/src/cli/tlapm.ts +374 -0
  35. package/src/{run-cli.ts → cli/tlc.ts} +115 -721
  36. package/src/cli/xml-exporter.ts +221 -0
  37. package/src/cli.ts +1 -1
  38. package/src/codegen.ts +43 -22
  39. package/src/config.ts +5 -5
  40. package/src/dependencies.ts +4 -6
  41. package/src/environment.ts +55 -60
  42. package/src/errors.ts +97 -35
  43. package/src/evaluate.ts +361 -181
  44. package/src/exit-codes.ts +1 -1
  45. package/src/fingerprints.ts +3 -3
  46. package/src/index.ts +10 -0
  47. package/src/instances.ts +56 -46
  48. package/src/java-overrides.ts +79 -41
  49. package/src/json.ts +31 -36
  50. package/src/levels.ts +10 -13
  51. package/src/{live-check.ts → liveness-checker.ts} +207 -141
  52. package/src/liveness.ts +38 -34
  53. package/src/{obligation-action.ts → obligations/action.ts} +248 -74
  54. package/src/{obligation-anon.ts → obligations/anonymize.ts} +55 -57
  55. package/src/obligations/equality.ts +260 -0
  56. package/src/obligations/expression.ts +618 -0
  57. package/src/{obligation-format.ts → obligations/format.ts} +7 -8
  58. package/src/obligations/generate.ts +457 -0
  59. package/src/{obligations.ts → obligations/index.ts} +46 -32
  60. package/src/{obligation-levels.ts → obligations/levels.ts} +44 -40
  61. package/src/obligations/module.ts +445 -0
  62. package/src/obligations/normalize.ts +554 -0
  63. package/src/obligations/operators.ts +176 -0
  64. package/src/obligations/pragma.ts +195 -0
  65. package/src/{obligation-printer.ts → obligations/printer.ts} +65 -230
  66. package/src/{obligation-proof.ts → obligations/proof.ts} +7 -2
  67. package/src/obligations/regroup.ts +100 -0
  68. package/src/{obligation-generate.ts → obligations/simplify.ts} +130 -536
  69. package/src/{obligation-source.ts → obligations/source.ts} +172 -216
  70. package/src/{obligation-deref.ts → obligations/subexpression.ts} +84 -115
  71. package/src/obligations/substitution.ts +261 -0
  72. package/src/obligations/temporal.ts +321 -0
  73. package/src/{obligation-tuples.ts → obligations/tuples.ts} +38 -54
  74. package/src/parallel-worker.ts +39 -51
  75. package/src/parallel.ts +39 -66
  76. package/src/parser.ts +67 -74
  77. package/src/{pcal-ast.ts → pcal/ast.ts} +2 -17
  78. package/src/{pcal-parse.ts → pcal/parse.ts} +28 -64
  79. package/src/{pcal-tokenize.ts → pcal/tokenize.ts} +10 -39
  80. package/src/{pcal-translate.ts → pcal/translate.ts} +30 -109
  81. package/src/{pcal-validate.ts → pcal/validate.ts} +10 -20
  82. package/src/prover/decide-pool.ts +95 -0
  83. package/src/prover/deciders.ts +33 -0
  84. package/src/prover/first-order.ts +175 -0
  85. package/src/prover/isabelle/LICENSE +36 -0
  86. package/src/prover/isabelle/LICENSE-tlapm +26 -0
  87. package/src/prover/isabelle/decide.ts +44 -0
  88. package/src/prover/isabelle/encode.ts +445 -0
  89. package/src/prover/isabelle/isar/inner-syntax.ts +579 -0
  90. package/src/prover/isabelle/isar/method.ts +367 -0
  91. package/src/prover/isabelle/isar/proof.ts +28 -0
  92. package/src/prover/isabelle/isar/statement.ts +57 -0
  93. package/src/prover/isabelle/isar/theory.ts +192 -0
  94. package/src/prover/isabelle/isar/type-check.ts +278 -0
  95. package/src/prover/isabelle/provers/blast/blast.ts +258 -0
  96. package/src/prover/isabelle/provers/blast/branch.ts +322 -0
  97. package/src/prover/isabelle/provers/blast/prove.ts +347 -0
  98. package/src/prover/isabelle/provers/blast/rules.ts +330 -0
  99. package/src/prover/isabelle/provers/blast/state.ts +180 -0
  100. package/src/prover/isabelle/provers/blast/term.ts +546 -0
  101. package/src/prover/isabelle/provers/clasimp.ts +150 -0
  102. package/src/prover/isabelle/provers/classical.ts +389 -0
  103. package/src/prover/isabelle/provers/hypsubst.ts +433 -0
  104. package/src/prover/isabelle/pure/bicompose.ts +174 -0
  105. package/src/prover/isabelle/pure/consts.ts +32 -0
  106. package/src/prover/isabelle/pure/conv.ts +79 -0
  107. package/src/prover/isabelle/pure/drule.ts +264 -0
  108. package/src/prover/isabelle/pure/envir.ts +331 -0
  109. package/src/prover/isabelle/pure/goal.ts +53 -0
  110. package/src/prover/isabelle/pure/interrupt.ts +16 -0
  111. package/src/prover/isabelle/pure/list.ts +12 -0
  112. package/src/prover/isabelle/pure/logic.ts +330 -0
  113. package/src/prover/isabelle/pure/name.ts +98 -0
  114. package/src/prover/isabelle/pure/net.ts +215 -0
  115. package/src/prover/isabelle/pure/object-logic.ts +41 -0
  116. package/src/prover/isabelle/pure/pattern.ts +631 -0
  117. package/src/prover/isabelle/pure/raw-simplifier.ts +338 -0
  118. package/src/prover/isabelle/pure/rewriter.ts +602 -0
  119. package/src/prover/isabelle/pure/search.ts +68 -0
  120. package/src/prover/isabelle/pure/seq.ts +133 -0
  121. package/src/prover/isabelle/pure/simplifier.ts +106 -0
  122. package/src/prover/isabelle/pure/table.ts +201 -0
  123. package/src/prover/isabelle/pure/tactic.ts +168 -0
  124. package/src/prover/isabelle/pure/tactical.ts +264 -0
  125. package/src/prover/isabelle/pure/term-ord.ts +105 -0
  126. package/src/prover/isabelle/pure/term.ts +688 -0
  127. package/src/prover/isabelle/pure/thm.ts +783 -0
  128. package/src/prover/isabelle/pure/type.ts +121 -0
  129. package/src/prover/isabelle/pure/unify.ts +753 -0
  130. package/src/prover/isabelle/pure/variable.ts +25 -0
  131. package/src/prover/isabelle/tla/classical-setup.ts +101 -0
  132. package/src/prover/isabelle/tla/context.ts +74 -0
  133. package/src/prover/isabelle/tla/logic-data.ts +5 -0
  134. package/src/prover/isabelle/tla/logic.ts +215 -0
  135. package/src/prover/isabelle/tla/simpdata.ts +241 -0
  136. package/src/prover/isabelle/tools/intuitionistic.ts +132 -0
  137. package/src/prover/ocaml.ts +22 -0
  138. package/src/prover/prep/action.ts +508 -0
  139. package/src/prover/prep/enabled-axioms.ts +189 -0
  140. package/src/prover/prep/fingerprint.ts +388 -0
  141. package/src/prover/prep/level-comparison.ts +529 -0
  142. package/src/prover/prep/md5.ts +60 -0
  143. package/src/prover/prep/methods.ts +221 -0
  144. package/src/prover/prep/normalize.ts +309 -0
  145. package/src/prover/prove-worker.ts +22 -0
  146. package/src/prover/prove.ts +492 -0
  147. package/src/prover/ptl/decide.ts +68 -0
  148. package/src/prover/ptl/encode.ts +244 -0
  149. package/src/prover/ptl/sat.ts +151 -0
  150. package/src/prover/ptl/tableau.ts +276 -0
  151. package/src/prover/smt/axioms.ts +209 -0
  152. package/src/prover/smt/context.ts +108 -0
  153. package/src/prover/smt/data.ts +636 -0
  154. package/src/prover/smt/encode.ts +275 -0
  155. package/src/prover/smt/extensionality.ts +65 -0
  156. package/src/prover/smt/flatten.ts +112 -0
  157. package/src/prover/smt/format.ts +154 -0
  158. package/src/prover/smt/instances.ts +181 -0
  159. package/src/prover/smt/rewrite.ts +766 -0
  160. package/src/prover/smt/solver/act-cache.ts +265 -0
  161. package/src/prover/smt/solver/arith-rewriter.ts +962 -0
  162. package/src/prover/smt/solver/array.ts +22 -0
  163. package/src/prover/smt/solver/asserted-formulas.ts +469 -0
  164. package/src/prover/smt/solver/ast-lt.ts +157 -0
  165. package/src/prover/smt/solver/ast-util.ts +91 -0
  166. package/src/prover/smt/solver/ast.ts +1315 -0
  167. package/src/prover/smt/solver/auf-solver.ts +572 -0
  168. package/src/prover/smt/solver/case-split-queue.ts +178 -0
  169. package/src/prover/smt/solver/cg-table.ts +175 -0
  170. package/src/prover/smt/solver/clause.ts +276 -0
  171. package/src/prover/smt/solver/conflict-resolution.ts +343 -0
  172. package/src/prover/smt/solver/context.ts +1292 -0
  173. package/src/prover/smt/solver/ctx-simplify.ts +334 -0
  174. package/src/prover/smt/solver/der.ts +224 -0
  175. package/src/prover/smt/solver/dyn-ack.ts +141 -0
  176. package/src/prover/smt/solver/e-matching.ts +659 -0
  177. package/src/prover/smt/solver/enode.ts +259 -0
  178. package/src/prover/smt/solver/expr-ref.ts +21 -0
  179. package/src/prover/smt/solver/expr-safe-replace.ts +172 -0
  180. package/src/prover/smt/solver/fingerprints.ts +92 -0
  181. package/src/prover/smt/solver/flat-literals.ts +51 -0
  182. package/src/prover/smt/solver/goal.ts +138 -0
  183. package/src/prover/smt/solver/hash.ts +173 -0
  184. package/src/prover/smt/solver/hashtable.ts +166 -0
  185. package/src/prover/smt/solver/internalizer.ts +1381 -0
  186. package/src/prover/smt/solver/lbool.ts +5 -0
  187. package/src/prover/smt/solver/literal.ts +24 -0
  188. package/src/prover/smt/solver/lp/bound-propagator.ts +391 -0
  189. package/src/prover/smt/solver/lp/constraints.ts +78 -0
  190. package/src/prover/smt/solver/lp/containers.ts +296 -0
  191. package/src/prover/smt/solver/lp/core-solver.ts +504 -0
  192. package/src/prover/smt/solver/lp/cross-nested.ts +224 -0
  193. package/src/prover/smt/solver/lp/dep-intervals.ts +642 -0
  194. package/src/prover/smt/solver/lp/dependency.ts +51 -0
  195. package/src/prover/smt/solver/lp/dioph-eq.ts +1181 -0
  196. package/src/prover/smt/solver/lp/explanation.ts +46 -0
  197. package/src/prover/smt/solver/lp/gomory.ts +255 -0
  198. package/src/prover/smt/solver/lp/hnf-cutter.ts +125 -0
  199. package/src/prover/smt/solver/lp/hnf.ts +281 -0
  200. package/src/prover/smt/solver/lp/int-cube.ts +295 -0
  201. package/src/prover/smt/solver/lp/int-solver.ts +514 -0
  202. package/src/prover/smt/solver/lp/lar-solver.ts +816 -0
  203. package/src/prover/smt/solver/lp/lar-term.ts +62 -0
  204. package/src/prover/smt/solver/lp/lp-settings.ts +91 -0
  205. package/src/prover/smt/solver/lp/maximize-term.ts +347 -0
  206. package/src/prover/smt/solver/lp/nex-creator.ts +381 -0
  207. package/src/prover/smt/solver/lp/nex.ts +120 -0
  208. package/src/prover/smt/solver/lp/nla-backoff.ts +43 -0
  209. package/src/prover/smt/solver/lp/nla-basics.ts +398 -0
  210. package/src/prover/smt/solver/lp/nla-core.ts +968 -0
  211. package/src/prover/smt/solver/lp/nla-divisions.ts +332 -0
  212. package/src/prover/smt/solver/lp/nla-emonics.ts +373 -0
  213. package/src/prover/smt/solver/lp/nla-factorization.ts +30 -0
  214. package/src/prover/smt/solver/lp/nla-grobner.ts +904 -0
  215. package/src/prover/smt/solver/lp/nla-horner.ts +126 -0
  216. package/src/prover/smt/solver/lp/nla-intervals.ts +265 -0
  217. package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +715 -0
  218. package/src/prover/smt/solver/lp/nla-monotone.ts +59 -0
  219. package/src/prover/smt/solver/lp/nla-order.ts +307 -0
  220. package/src/prover/smt/solver/lp/nla-patcher.ts +112 -0
  221. package/src/prover/smt/solver/lp/nla-tangents.ts +251 -0
  222. package/src/prover/smt/solver/lp/nla-throttle.ts +85 -0
  223. package/src/prover/smt/solver/lp/nla-types.ts +124 -0
  224. package/src/prover/smt/solver/lp/nla-var-eqs.ts +141 -0
  225. package/src/prover/smt/solver/lp/nra-solver.ts +440 -0
  226. package/src/prover/smt/solver/lp/numeric-pair.ts +65 -0
  227. package/src/prover/smt/solver/lp/pdd-interval.ts +31 -0
  228. package/src/prover/smt/solver/lp/pdd-simplifier.ts +184 -0
  229. package/src/prover/smt/solver/lp/pdd-solver.ts +408 -0
  230. package/src/prover/smt/solver/lp/pdd.ts +971 -0
  231. package/src/prover/smt/solver/lp/random-updater.ts +138 -0
  232. package/src/prover/smt/solver/lp/static-matrix.ts +246 -0
  233. package/src/prover/smt/solver/lp/union-find.ts +96 -0
  234. package/src/prover/smt/solver/mam-compiler.ts +847 -0
  235. package/src/prover/smt/solver/mam-interpreter.ts +400 -0
  236. package/src/prover/smt/solver/maximize-ac-sharing.ts +118 -0
  237. package/src/prover/smt/solver/model-checker.ts +347 -0
  238. package/src/prover/smt/solver/model-evaluator.ts +262 -0
  239. package/src/prover/smt/solver/model-finder.ts +155 -0
  240. package/src/prover/smt/solver/model-generator.ts +97 -0
  241. package/src/prover/smt/solver/model-macro-solver.ts +728 -0
  242. package/src/prover/smt/solver/nlsat/algebraic.ts +1161 -0
  243. package/src/prover/smt/solver/nlsat/atoms.ts +238 -0
  244. package/src/prover/smt/solver/nlsat/evaluator.ts +303 -0
  245. package/src/prover/smt/solver/nlsat/explain.ts +607 -0
  246. package/src/prover/smt/solver/nlsat/interval-set.ts +351 -0
  247. package/src/prover/smt/solver/nlsat/levelwise.ts +737 -0
  248. package/src/prover/smt/solver/nlsat/mpbq.ts +161 -0
  249. package/src/prover/smt/solver/nlsat/polynomial.ts +1722 -0
  250. package/src/prover/smt/solver/nlsat/solver.ts +911 -0
  251. package/src/prover/smt/solver/nlsat/types.ts +43 -0
  252. package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +645 -0
  253. package/src/prover/smt/solver/nlsat/upolynomial.ts +996 -0
  254. package/src/prover/smt/solver/nnf.ts +469 -0
  255. package/src/prover/smt/solver/pattern-inference.ts +351 -0
  256. package/src/prover/smt/solver/poly-rewriter.ts +477 -0
  257. package/src/prover/smt/solver/propagate-values.ts +83 -0
  258. package/src/prover/smt/solver/proto-model.ts +551 -0
  259. package/src/prover/smt/solver/pull-quant.ts +139 -0
  260. package/src/prover/smt/solver/qe-lite-der.ts +526 -0
  261. package/src/prover/smt/solver/qe-lite-fm.ts +576 -0
  262. package/src/prover/smt/solver/qe-lite.ts +381 -0
  263. package/src/prover/smt/solver/qi-queue.ts +362 -0
  264. package/src/prover/smt/solver/quant-tactics.ts +117 -0
  265. package/src/prover/smt/solver/quantifier-analyzer.ts +562 -0
  266. package/src/prover/smt/solver/quantifier-manager.ts +186 -0
  267. package/src/prover/smt/solver/random-gen.ts +10 -0
  268. package/src/prover/smt/solver/rational.ts +165 -0
  269. package/src/prover/smt/solver/ref-vector.ts +62 -0
  270. package/src/prover/smt/solver/relevancy.ts +247 -0
  271. package/src/prover/smt/solver/rewriter-tpl.ts +1159 -0
  272. package/src/prover/smt/solver/rewriter.ts +843 -0
  273. package/src/prover/smt/solver/rlimit.ts +84 -0
  274. package/src/prover/smt/solver/smtlib-parser.ts +526 -0
  275. package/src/prover/smt/solver/solver.ts +71 -0
  276. package/src/prover/smt/solver/sort.ts +35 -0
  277. package/src/prover/smt/solver/sticky-generations.ts +69 -0
  278. package/src/prover/smt/solver/theory-lra-axioms.ts +340 -0
  279. package/src/prover/smt/solver/theory-lra-bounds.ts +226 -0
  280. package/src/prover/smt/solver/theory-lra-final-check.ts +252 -0
  281. package/src/prover/smt/solver/theory-lra-internalize.ts +476 -0
  282. package/src/prover/smt/solver/theory-lra-model.ts +243 -0
  283. package/src/prover/smt/solver/theory-lra-propagate.ts +405 -0
  284. package/src/prover/smt/solver/theory-lra-state.ts +43 -0
  285. package/src/prover/smt/solver/theory-lra.ts +56 -0
  286. package/src/prover/smt/solver/var-subst.ts +258 -0
  287. package/src/prover/smt/solver/z3-license.txt +10 -0
  288. package/src/prover/smt/table.ts +170 -0
  289. package/src/prover/tlapm/cache.ts +236 -0
  290. package/src/prover/tlapm/ocaml-marshal.ts +166 -0
  291. package/src/prover/tlapm/tlapm.ts +96 -0
  292. package/src/prover/tlaps-module.ts +510 -0
  293. package/src/prover/verdict.ts +13 -0
  294. package/src/prover/zenon/LICENSE +32 -0
  295. package/src/prover/zenon/check/check.ts +105 -0
  296. package/src/prover/zenon/check/definitions.ts +144 -0
  297. package/src/prover/zenon/check/equality.ts +182 -0
  298. package/src/prover/zenon/check/functions.ts +62 -0
  299. package/src/prover/zenon/check/keys.ts +125 -0
  300. package/src/prover/zenon/check/propositional.ts +104 -0
  301. package/src/prover/zenon/check/records.ts +188 -0
  302. package/src/prover/zenon/check/relations.ts +121 -0
  303. package/src/prover/zenon/check/rewrites.ts +224 -0
  304. package/src/prover/zenon/check/sets.ts +302 -0
  305. package/src/prover/zenon/check/terms.ts +127 -0
  306. package/src/prover/zenon/check/tla.ts +126 -0
  307. package/src/prover/zenon/decide.ts +107 -0
  308. package/src/prover/zenon/encode.ts +378 -0
  309. package/src/prover/zenon/eqrel.ts +300 -0
  310. package/src/prover/zenon/equality-rules.ts +435 -0
  311. package/src/prover/zenon/expr.ts +551 -0
  312. package/src/prover/zenon/index-table.ts +350 -0
  313. package/src/prover/zenon/isar-case.ts +513 -0
  314. package/src/prover/zenon/isar.ts +1249 -0
  315. package/src/prover/zenon/limits.ts +15 -0
  316. package/src/prover/zenon/llproof.ts +173 -0
  317. package/src/prover/zenon/mltoll.ts +1566 -0
  318. package/src/prover/zenon/node.ts +297 -0
  319. package/src/prover/zenon/ocaml.ts +169 -0
  320. package/src/prover/zenon/parse.ts +247 -0
  321. package/src/prover/zenon/phrase.ts +191 -0
  322. package/src/prover/zenon/proof.ts +198 -0
  323. package/src/prover/zenon/propositional-rules.ts +387 -0
  324. package/src/prover/zenon/rules.ts +94 -0
  325. package/src/prover/zenon/search.ts +288 -0
  326. package/src/prover/zenon/tla/functions.ts +151 -0
  327. package/src/prover/zenon/tla/llproof.ts +480 -0
  328. package/src/prover/zenon/tla/records.ts +225 -0
  329. package/src/prover/zenon/tla/rewrites.ts +447 -0
  330. package/src/prover/zenon/tla/sets.ts +304 -0
  331. package/src/prover/zenon/tla/terms.ts +162 -0
  332. package/src/prover/zenon/tla/tla.ts +506 -0
  333. package/src/randomization.ts +19 -24
  334. package/src/resolve.ts +15 -22
  335. package/src/runtime.ts +8 -8
  336. package/src/{sany-builtins.ts → sany/builtins.ts} +1 -1
  337. package/src/{sany-generator.ts → sany/generator.ts} +38 -55
  338. package/src/{sany-levels.ts → sany/levels.ts} +45 -48
  339. package/src/{sany-lexer.ts → sany/lexer.ts} +2 -3
  340. package/src/{sany-linter.ts → sany/linter.ts} +1 -1
  341. package/src/{sany-modules.ts → sany/modules.ts} +2 -2
  342. package/src/{sany-nodes.ts → sany/nodes.ts} +2 -2
  343. package/src/{sany-parse-error.ts → sany/parse-error.ts} +2 -2
  344. package/src/{sany-report.ts → sany/report.ts} +16 -17
  345. package/src/{sany-selectors.ts → sany/selectors.ts} +3 -5
  346. package/src/{sany-source.ts → sany/source.ts} +6 -7
  347. package/src/{sany-xml.ts → sany/xml.ts} +5 -6
  348. package/src/search.ts +969 -0
  349. package/src/spec-description.ts +26 -20
  350. package/src/{standard-levels.ts → standard-definitions.ts} +118 -2
  351. package/src/standard-modules.ts +21 -22
  352. package/src/state-graph.ts +9 -8
  353. package/src/substitution-levels.ts +2 -2
  354. package/src/successors.ts +39 -23
  355. package/src/symmetry.ts +1 -1
  356. package/src/tableau.ts +6 -7
  357. package/src/tlc/fingerprint.ts +214 -0
  358. package/src/{tlc-messages.ts → tlc/messages.ts} +119 -7
  359. package/src/{tlc-order.ts → tlc/order.ts} +7 -7
  360. package/src/{tlc-random.ts → tlc/random.ts} +3 -190
  361. package/src/{tlc-replay.ts → tlc/replay.ts} +40 -36
  362. package/src/{tlc-module.ts → tlc/tlc-operators.ts} +9 -9
  363. package/src/{tlc-ext.ts → tlc/tlcext-operators.ts} +30 -25
  364. package/src/{tlc-version.ts → tlc/version.ts} +8 -7
  365. package/src/transfer.ts +32 -32
  366. package/src/values.ts +166 -111
  367. package/src/worker.ts +62 -0
  368. package/dist/parallel.cjs +0 -12
  369. package/dist/parallel.js +0 -12
  370. package/dist/run-cli.cjs +0 -55
  371. package/dist/run-cli.js +0 -55
  372. package/src/canonical.ts +0 -40
  373. package/src/obligation-expression.ts +0 -1060
  374. package/src/obligation-module.ts +0 -1042
  375. package/src/standard-ranges.ts +0 -116
  376. package/src/value-sources.ts +0 -29
  377. /package/src/{tlc-modules.ts → tlc/jar-data.ts} +0 -0
  378. /package/src/{tlc-summary.ts → tlc/summary.ts} +0 -0
package/dist/prove.js ADDED
@@ -0,0 +1,1006 @@
1
+ /**
2
+ * @license tla-ts
3
+ *
4
+ * Copyright (c) Aiden Bai
5
+ *
6
+ * This source code is licensed under the MIT license found in the
7
+ * LICENSE file in the root directory of this source tree.
8
+ */
9
+ import{B as e,C as t,D as n,E as r,G as i,H as a,K as o,L as s,M as c,N as l,R as u,S as d,U as f,W as p,_ as m,g as h,h as g,j as _,k as v,m as y,n as b,r as x,v as ee,w as S}from"./worker.js";import{$ as te,A as C,At as w,Bt as ne,C as re,Ct as ie,D as T,Dt as ae,E as oe,Et as se,F as ce,Ft as le,Gt as ue,Ht as de,I as fe,It as pe,J as me,Jt as he,Lt as ge,M as _e,Mt as ve,N as ye,Nt as be,O as E,Ot as xe,P as Se,Pt as Ce,Q as we,Rt as Te,S as Ee,St as De,T as Oe,Tt as ke,Vt as Ae,W as je,Wt as Me,Y as Ne,Yt as Pe,Z as Fe,Zt as Ie,_ as Le,a as Re,at as ze,b as Be,bt as Ve,c as He,ct as Ue,d as We,dt as Ge,et as Ke,ft as qe,g as Je,gt as Ye,h as Xe,i as Ze,it as Qe,j as $e,jt as et,k as tt,kt as nt,lt as rt,m as it,n as at,nt as ot,o as st,ot as ct,q as D,rt as lt,s as ut,st as dt,tt as O,ut as ft,v as pt,w as mt,wt as ht,x as gt,xt as _t,y as vt,yt,zt as bt}from"./transfer.js";import{t as xt}from"./deciders.js";const St=[`CONSTANT`,`CONSTANTS`,`INIT`,`NEXT`,`SPECIFICATION`,`INVARIANT`,`INVARIANTS`,`PROPERTY`,`PROPERTIES`,`CONSTRAINT`,`CONSTRAINTS`,`ACTION_CONSTRAINT`,`ACTION_CONSTRAINTS`,`SYMMETRY`,`VIEW`,`CHECK_DEADLOCK`],Ct=/* @__PURE__ */ new Set([...St,`ALIAS`,`POSTCONDITION`,`POSTCONDITIONS`,`_POSSIBLE`,`_PERIODIC`,`_RL_REWARD`]),wt=[`TYPE`,`TYPE_CONSTRAINT`],Tt=/* @__PURE__ */ new Set([...St,...wt]),Et=[`<-`,`<<`,`>>`,`=`,`{`,`}`,`,`,`[`,`]`,`(`,`)`,`!`],Dt=e=>{let t=[],n={index:0,line:1,lineStart:0},r=(r,i)=>{t.push({kind:`Error`,text:ue(n.line,r-n.lineStart+1,e[r],i),line:n.line})},i=e=>{t.push({kind:`Error`,text:ue(n.line+1,0,void 0,e),line:n.line})},a=e=>{let t=e.split(`
10
+ `);t.length>1&&(n.line+=t.length-1,n.lineStart=n.index+e.length-t[t.length-1].length),n.index+=e.length};for(;n.index<e.length;){let o=e.slice(n.index),s=/^\s+/.exec(o)?.[0];if(s){a(s);continue}if(o.startsWith(`\\*`)){let e=o.indexOf(`
11
+ `);a(e===-1?o:o.slice(0,e));continue}if(o.startsWith(`(*`)){let e=o.indexOf(`*)`);if(e===-1)return a(o),i(``),t;a(o.slice(0,e+2));continue}let c=n.line,l=/^\d+(?![A-Za-z_])/.exec(o)?.[0];if(l){t.push({kind:`Number`,text:l,line:c}),a(l);continue}let u=/^[A-Za-z0-9_]+/.exec(o)?.[0];if(u){t.push({kind:`Word`,text:u,line:c}),a(u);continue}if(o.startsWith(`"`)){let s=/^"((?:[^"\\\n]|\\[^\n])*)("?)/.exec(o),l=s?.[0]??`"`;if(s?.[2]!==`"`)return a(l),n.index===e.length?i(`${l}\n`):r(n.index,l),t;t.push({kind:`String`,text:s[1],line:c}),a(l);continue}let d=Et.find(e=>o.startsWith(e));if(d){t.push({kind:`Symbol`,text:d,line:c}),a(d);continue}let f=Pe(e,n.index)??he(e,n.index);if(!f)return r(n.index,``),t;t.push({kind:`Word`,text:f.text,line:c}),a(e.slice(n.index,n.index+f.length))}return t.push({kind:`End`,text:``,line:n.line}),t},Ot=(e,t)=>new y(`TLC found an error in the configuration file at line ${e}\n${t}`),kt=(e,t)=>Ot(e,`The keyword ${t} appeared twice.`),At=/* @__PURE__ */ new Map([[`INIT`,`init`],[`NEXT`,`next`],[`SPECIFICATION`,`specification`],[`VIEW`,`view`],[`SYMMETRY`,`symmetry`],[`ALIAS`,`alias`],[`_PERIODIC`,`periodic`],[`_RL_REWARD`,`rlReward`]]),jt=/* @__PURE__ */ new Map([[`INVARIANT`,`invariants`],[`INVARIANTS`,`invariants`],[`PROPERTY`,`properties`],[`PROPERTIES`,`properties`],[`CONSTRAINT`,`constraints`],[`CONSTRAINTS`,`constraints`],[`ACTION_CONSTRAINT`,`actionConstraints`],[`ACTION_CONSTRAINTS`,`actionConstraints`],[`POSTCONDITION`,`postconditions`],[`POSTCONDITIONS`,`postconditions`],[`_POSSIBLE`,`possible`]]),Mt=(e,t=`master`)=>{let n=t===`1.7.4`?Tt:Ct,r=Dt(e),i={index:0},a={init:void 0,next:void 0,specification:void 0,invariants:[],properties:[],constraints:[],actionConstraints:[],constants:[],substitutions:[],checkDeadlock:!0,symmetry:void 0,view:void 0,alias:void 0,postconditions:[],possible:[],periodic:void 0,rlReward:void 0},o={isSet:!1},s=/* @__PURE__ */ new Set,c=()=>{let e=r[Math.min(i.index++,r.length-1)];if(e.kind===`Error`)throw new y(`TLC found an error in the configuration file:\n${e.text}`);return e},l=e=>{if(e.kind===`Number`)return{kind:`Number`,value:Number(e.text)};if(e.kind===`String`)return{kind:`String`,value:e.text};if(e.text===`TRUE`||e.text===`FALSE`)return{kind:`Boolean`,value:e.text===`TRUE`};if(e.text===`{`){let e=[],t={token:c()};if(t.token.text!==`}`)for(;e.push(l(t.token)),t.token=c(),t.token.text===`,`;)t.token=c();if(t.token.text!==`}`)throw Ot(t.token.line,`It was expecting }, but did not find it.`);return{kind:`Set`,elements:e}}if(e.kind!==`End`)return{kind:`ModelValue`,name:e.text};throw Ot(e.line,`It was expecting a value, but did not find it.`)},u=e=>{let t=c();if(t.kind===`End`)throw Ot(t.line,`Expected an identifier after ${e}[.`);let n=c();if(n.text!==`]`)throw Ot(n.line,`It was expecting ], but did not find it.`);return t.text},d=e=>{for(;;){let t=c();if(t.kind===`End`||n.has(t.text))return t;let r={token:c(),name:t.text};for(;r.token.text===`!`;)r.name=`${r.name}!${c().text}`,r.token=c();let i=r.name;if(r.token.text===`<-`){if(r.token=c(),r.token.text===`[`){let e=u(`<-`),t=c();if(t.kind===`End`)throw Ot(t.line,`Expected an identifier after <-[mod].`);a.substitutions.push({name:i,target:t.text,module:e});continue}if(r.token.kind===`End`)throw Ot(r.token.line,`Expected an identifier after <-.`);a.substitutions.push({name:i,target:r.token.text});continue}let o=[],s=r.token.text===`(`;if(s){for(;o.push(l(c())),r.token=c(),r.token.text===`,`;);if(r.token.text!==`)`)throw Ot(e,``);r.token=c()}if(r.token.text!==`=`)throw Ot(r.token.line,`It was expecting = or <-, but did not find it.`);r.token=c();let d=r.token.text===`[`?u(`=`):void 0,f=l(d===void 0?r.token:c());a.constants.push({name:i,value:f,...s&&{args:o},...d!==void 0&&{module:d}})}},f=e=>{for(;;){let t=c();if(t.kind===`End`||n.has(t.text))return t;e.push(t.text)}},p={token:c()};for(;p.token.kind!==`End`;){let e=p.token.text,t=p.token.line,r=n.has(e)?At.get(e):void 0,i=n.has(e)?jt.get(e):void 0,l=()=>{let n=c();if(n.kind===`End`)throw Ot(t,`The keyword ${e} was not followed by an identifier.`);return n};if(r!==void 0){let n=l();if(a[r]!==void 0)throw kt(t,e);a[r]=n.text,p.token=c()}else if(i!==void 0)p.token=f(a[i]);else if(e===`CONSTANT`||e===`CONSTANTS`)p.token=d(t);else if(e===`CHECK_DEADLOCK`){let n=l();if(n.text!==`TRUE`&&n.text!==`FALSE`)throw Ot(n.line,`It was expecting TRUE or FALSE, but did not find it.`);if(o.isSet)throw kt(t,e);o.isSet=!0,a.checkDeadlock=n.text===`TRUE`,p.token=c()}else{if(!n.has(e)||!wt.includes(e))throw Ot(t,`It was expecting a keyword, but did not find it.`);if(l(),s.has(e))throw kt(t,e);s.add(e),p.token=c()}}return a},Nt=e=>{switch(e.kind){case`Always`:return!0;case`Eventually`:case`Not`:case`Next`:return Nt(e.body);case`And`:case`Or`:return e.operands.some(Nt);default:return!1}},Pt=e=>e.promises.some(e=>Nt(e.body))||e.models.some(e=>e.eventuallyAlways.length>0||e.infinitelyOftenStates.length>0||e.infinitelyOftenActions.length>0),Ft=(e,t)=>e.every((e,n)=>Te(e,t[n])),It=e=>e.filter((t,n)=>n===0||e[n-1]!==t),Lt=e=>({data:e(1024),length:0,create:e}),Rt=(e,t,n)=>{let r=t+n.length;if(r>e.data.length){let t=e.create(Math.max(2*e.data.length,r));t.set(e.data),e.data=t}e.data.set(n,t),e.length=Math.max(e.length,r)},zt=(e,t,n)=>{let r=e.slots.length/3-1,i=Math.imul(Math.imul(t,2654435761)^n,2246822507)>>>e.shift;for(let a=i;;a=a+1&r){let r=a*3,i=e.slots[r];if(i===0||i===t+1&&e.slots[r+1]===n)return r}},Bt=e=>new Int32Array(e).fill(-1),Vt=(e,t)=>(e.edgeStarts[t]??-1)!==-1,Ht=(e,t)=>{let n=e.edgeStarts[t];return e.edgeTargets.data.subarray(n,n+e.edgeCounts[t])},Ut=(e,t,n)=>e.stateResults.data[e.nodeStates[t]*e.solution.stateChecks.length+n]===1,Wt=(e,t,n)=>(e.nodeStates.push(t),e.nodeTableaux.push(n),e.edgeStarts.push(-1),e.edgeCounts.push(0),e.nextSiblings.push(-1),e.nodeStates.length-1),Gt=(e,t)=>{let n=[];for(let r=e.firstNodes.data[t]??-1;r!==-1;r=e.nextSiblings[r])n.push(r);return n},Kt=2**53-1,qt=(e,t,n,r)=>{if(e.length===0)return;let i=t.map(e=>oe(e.expression,e.scope,n)),a=e.map(e=>E(`Not`,oe(e.expression,e.scope,n))),o=a.length===1?a[0]:T(`Or`,a),s=i.length===0?o:T(`And`,[...i,o]),c=tt(s);if(c.length===0)throw Ee();let l=/* @__PURE__ */ new Map,u=c.map(e=>({solution:e,actionIds:Int32Array.from(e.actionChecks,e=>{let t=C(e),n=l.get(t)??l.size;return l.set(t,n),n}),nodeStates:[],nodeTableaux:[],edgeStarts:[],edgeCounts:[],edgeTargets:Lt(e=>new Int32Array(e)),edgeActions:Lt(e=>new Uint8Array(e)),stateResults:Lt(e=>new Uint8Array(e)),initial:[],firstNodes:Lt(Bt),lastNodes:Lt(Bt),nextSiblings:[],nodeIds:{slots:/* @__PURE__ */ new Int32Array(3072),size:0,shift:22},isDone:[],errorNode:void 0})),d={multiplier:1},f=!O(n),p={environment:n},m={states:/* @__PURE__ */ new Map,actions:/* @__PURE__ */ new Map},g=e=>{let t=m.states.get(e)??/* @__PURE__ */ new Map;return m.states.set(e,t),t},_=(e,t)=>{n.runtime.setLivenessSource(e);let r=t();return n.runtime.setLivenessSource(void 0),r},v=(e,t)=>re(e,t,void 0,p.environment,f?g(t):/* @__PURE__ */ new Map),y=(e,t,n)=>_(t,()=>Uint8Array.from(e.solution.stateChecks,e=>+!!v(e,n))),b=(e,t,n,r)=>_(t,()=>{let t=e.solution.actionChecks;if(!f)return Uint8Array.from(t,e=>+!!re(e,n,r,p.environment,/* @__PURE__ */ new Map));let i=g(n),a=m.actions.get(n)??/* @__PURE__ */ new Map;m.actions.set(n,a);let o=a.get(r)??new Int8Array(l.size).fill(-1);return a.set(r,o),Uint8Array.from(e.actionIds,(e,a)=>(o[e]===-1&&(o[e]=+!!re(t[a],n,r,p.environment,i)),o[e]))}),x=(e,t,n,r)=>_(n,()=>e.nodes[t].statePredicates.every(e=>v(e,r))),ee=(e,t)=>{if(n.runtime.version===`1.7.4`)return!1;let r=e.nodes[t];return r.particle.length===0&&r.successors.length===1&&r.successors[0]===t},S=e=>e.solution.models.some(e=>e.eventuallyAlways.length===0&&e.infinitelyOftenStates.length===0&&e.infinitelyOftenActions.length===0),te=(e,t,n)=>{if(!e.solution.tableau)return t;let r=e.nodeIds.slots,i=zt(e.nodeIds,t,n);return r[i]===0?void 0:r[i+2]},w=(e,t,n)=>{let r=Wt(e,t,n),i=e.nodeIds;if(++i.size*2>i.slots.length/3){let e=i.slots;i.slots=new Int32Array(e.length*2),i.shift--;for(let t=0;t<e.length;t+=3)e[t]!==0&&i.slots.set(e.subarray(t,t+3),zt(i,e[t]-1,e[t+1]))}i.slots.set([t+1,n,r],zt(i,t,n));let a=e.lastNodes.data[t]??-1;return a===-1?Rt(e.firstNodes,t,[r]):e.nextSiblings[a]=r,Rt(e.lastNodes,t,[r]),r},ne=(e,t,n,r,i)=>{let a=e.edgeTargets.length,o=e.solution.actionChecks.length;Rt(e.edgeTargets,a,n),r.forEach((t,n)=>Rt(e.edgeActions,(a+n)*o,t)),Rt(e.stateResults,e.nodeStates[t]*i.length,i),e.edgeStarts[t]=a,e.edgeCounts[t]=n.length},ie=(e,t,n)=>{let i={slots:Array.from({length:16*d.multiplier}),count:0},a=(e,t)=>{for(let n=(r.getFingerprint(t)&2147483647)%e.length;;n=(n+1)%e.length){let r=e[n];if(r===void 0)return e[n]=t,!0;if(r.index===t.index&&Ft(r.state,t.state))return!1}},o=e=>{if(i.count>=i.slots.length>>1){let e=i.slots;i.slots=Array.from({length:2*e.length+1});for(let t of e)t&&a(i.slots,t)}a(i.slots,e)&&i.count++};return n.forEach(o),o({index:e,state:t}),i.slots.length>16*d.multiplier&&d.multiplier++,i.slots.filter(e=>e!==void 0)},ae=(e,t,n,i,a)=>{let o=y(e,i,n),s=t.nodes[e.nodeTableaux[a]],c=[],l=[],u=s.successors.length>0?b(e,i,n,n):/* @__PURE__ */ new Uint8Array;for(let r of s.successors){if(!x(t,r,i,n))continue;if(ee(t,r)&&e.errorNode===void 0&&S(e)){e.errorNode=a;return}let o=te(e,i,r);if(o!==void 0&&l.includes(o))continue;let s=o??w(e,i,r);l.push(s),c.push(u),o===void 0&&ae(e,t,n,i,s)}for(let a of r.getSuccessors(i,n)){let r=b(e,i,n,a.state),o=e.isDone[a.index]===!0;for(let n of s.successors){if(!x(t,n,i,a.state)||a.index===-1)continue;let s=te(e,a.index,n);if(s!==void 0&&l.includes(s))continue;let u=s??w(e,a.index,n);l.push(u),c.push(r),s===void 0&&o&&ae(e,t,a.state,a.index,u)}}l.length>0&&ne(e,a,l,c,o)},se=(e,t,n,r,i,a)=>{let o=t.nodes.map((e,r)=>n.map(e=>x(t,r,a,e.state)));e.isDone[a]=!0;for(let s of Gt(e,a)){let a=[],c=[];n.forEach((n,i)=>{let l=e.isDone[n.index]===!0;for(let u of t.nodes[e.nodeTableaux[s]].successors){if(!o[u][i])continue;let s=te(e,n.index,u);if(s!==void 0&&a.includes(s))continue;let d=s??w(e,n.index,u);a.push(d),c.push(r[i]),s===void 0&&l&&ae(e,t,n.state,n.index,d)}}),ne(e,s,a,c,i)}if(e.errorNode!==void 0)return It(le(e,e.errorNode).reverse().map(t=>e.nodeStates[t]))},ce=(e,t,n,r,i)=>{for(;e.nodeStates.length<=i;)Wt(e,e.nodeStates.length,-1);let a=[],o=[];t.forEach((t,r)=>{Vt(e,t.index)&&a.includes(t.index)||(a.push(t.index),o.push(n[r]))}),ne(e,i,a,o,r)},le=(e,t)=>{if(e.initial.includes(t))return[t];let n=/* @__PURE__ */ new Map,r=[];for(let t of e.initial)Vt(e,t)&&(r.push(t),n.set(t,-1));for(let i=0;i<r.length;i++){let a=r[i];for(let i of Ht(e,a))if(!(i===a&&e.solution.tableau)){if(i===t){let e=[t];for(let t=a;t!==-1;t=n.get(t)??-1)e.push(t);return e}Vt(e,i)&&!n.has(i)&&(n.set(i,a),r.push(i))}}throw new h(`Couldn't re-create liveness trace (path) starting at: ${t}`)},ue=(e,t)=>{let n=e.solution,r=n.actionChecks.length,i=(t,n,i)=>e.edgeActions.data[(e.edgeStarts[t]+n)*r+i]===1,a=(e,n)=>t.eventuallyAlways.every(t=>i(e,n,t)),o=new Float64Array(e.nodeStates.length).fill(-1),s=e.initial.filter(t=>Vt(e,t)),c=[],l=t=>{let n=Ht(e,t).indexOf(t);return n!==-1&&a(t,n)},u=(t,r)=>n.tableau!==void 0&&$e(n.tableau.nodes[e.nodeTableaux[t]].particle,r),d=r=>{let s=c.pop()??r;if(s===r&&!l(s)){o[s]=Kt;return}let d=/* @__PURE__ */ new Set,p=/* @__PURE__ */ new Map;for(let t=s;;t=c.pop()??r){d.add(t);let n=p.get(e.nodeStates[t]);if(n?n.push(t):p.set(e.nodeStates[t],[t]),o[t]=Kt,t===r)break}let m=t.infinitelyOftenStates.every(t=>[...d].some(n=>Ut(e,n,t))),h=t.infinitelyOftenActions.every(t=>[...d].some(n=>Ht(e,n).some((e,r)=>d.has(e)&&a(n,r)&&i(n,r,t)))),g=n.promises.every(e=>[...d].some(t=>u(t,e)));if(m&&h&&g)return f(r,d,p)},f=(r,o,s)=>{let c=It(le(e,r).reverse().map(t=>e.nodeStates[t])),l=[],d=/* @__PURE__ */ new Set([r]),f=t.infinitelyOftenStates.map(()=>!1),m=t.infinitelyOftenActions.map(()=>!1),g=n.promises.map(()=>!1),_={count:f.length+m.length+g.length},v={node:r},y=e=>o.has(e),b=e=>{l.push(v.node),v.node=e};for(;_.count>0;){let r=_.count;for(;t.infinitelyOftenStates.forEach((t,n)=>{!f[n]&&Ut(e,v.node,t)&&(f[n]=!0,_.count--)}),n.promises.forEach((e,t)=>{!g[t]&&u(v.node,e)&&(g[t]=!0,_.count--)}),!(_.count<=0);){let n={last:-1,unvisited:-1},o=_.count;if(Ht(e,v.node).some((r,c)=>{if(s.has(e.nodeStates[r])){if(!y(r)||!a(v.node,c))return!1;n.last=r,t.infinitelyOftenActions.forEach((e,t)=>{!m[t]&&i(v.node,c,e)&&(m[t]=!0,_.count--)})}return _.count<o?(b(r),d.clear(),!0):(y(r)&&!d.has(r)&&(n.unvisited=r),!1)}))break;if(_.count<r){b(n.last),d.clear();break}for(;n.unvisited===-1;){let t=l.pop();if(t===void 0)throw new h(`TLC failed to build the counterexample of a liveness property`);v.node=t,n.unvisited=Ht(e,t).find(e=>y(e)&&!d.has(e))??-1}b(n.unvisited),d.add(n.unvisited)}}let x=p(r,v.node,s,a);for(let t=l.length-1;t>=0;t--){let n=e.nodeStates[l[t]];x[x.length-1]!==n&&x.push(n)}let ee=c[c.length-1];return x[x.length-1]===ee&&x.pop(),{prefix:c.slice(0,-1),cycle:[ee,...x.reverse()],isCycleConstrained:Pt(n)}},p=(t,n,r,i)=>{if(n===t)return[];let a=e.nodeStates[n],o=/* @__PURE__ */ new Map,s=/* @__PURE__ */ new Set([a]),c=[];for(let n=a,l=-1,u=0;;u++){for(let u of r.get(n)??[])for(let[d,f]of Ht(e,u).entries()){if(f===u||!i(u,d))continue;if(f===t){let e=[];for(let t=n,r=l;t!==a;)e.push(t),t=r,r=o.get(t)??-1;return e.push(a),e}let p=e.nodeStates[f];r.has(p)&&!s.has(p)&&(s.add(p),c.push([p,n]))}o.set(n,l);let d=c[u];if(d===void 0)throw new h(`TLC failed to build the counterexample of a liveness property`);n=d[0],l=d[1]}};for(let t=0;t<s.length;t++){let n=[s[t],-1,0],r={link:0};for(;n.length>=3;){let t=n.pop()??0,i=n.pop(),l=n.pop()??0;if(i===-42){if(o[l]===t){let e=d(l);if(e)return e}n.push(Math.min(n.pop()??t,t));continue}if(o[l]!==-1){n.push(Math.min(t,o[l]));continue}o[l]=r.link,n.push(t,l,-42),c.push(l);let u={value:r.link++};Ht(e,l).forEach((t,r)=>{Vt(e,t)&&(a(l,r)?o[t]===-1?n.push(t,-1):u.value=Math.min(u.value,o[t]):o[t]===-1&&s.push(t))}),n.push(u.value)}}};return{branches:u.length,addInitialState:(e,t,r)=>{p.environment=r??n,m.states.clear(),m.actions.clear();try{for(let n of u){let r=n.solution.tableau;if(!r)n.initial.push(e);else for(let i=0;i<r.initialCount;i++)x(r,i,void 0,t)&&n.initial.push(te(n,e,i)??w(n,e,i))}}finally{p.environment=n}},addState:(e,t,r,i)=>{p.environment=i??n,m.states.clear(),m.actions.clear();try{let n=ie(e,t,r);for(let r of u){let i=n.map(n=>b(r,e,t,n.state)),a=y(r,e,t),o=r.solution.tableau;if(!o){ce(r,n,i,a,e);continue}let s=se(r,o,n,i,a,e);if(s)return s}return}finally{p.environment=n}},findViolation:()=>{for(let e of u)for(let t of e.solution.models){let n=ue(e,t);if(n)return n}},getViolatedProperties:(t,r)=>[...new Set(e.filter((e,i)=>!mt(a[i].body,t,r,0,n)).map(e=>e.name))]}},Jt=`UnnamedAction`,Yt={module:`--TLA+ BUILTINS--`,start:{line:0,column:0},end:{line:0,column:0}},Xt=e=>{let t=e.range??Yt;return xe([[`beginLine`,t.start.line],[`beginColumn`,t.start.column],[`endLine`,t.end.line],[`endColumn`,t.end.column],[`module`,t.module]])},Zt=e=>{let t=[[`name`,e.name],[`location`,Xt(e.location)]];return e.parameters.length===0?xe(t):xe([...t,[`context`,xe(e.parameters)],[`parameters`,w(e.parameters.map(e=>e[0]))]])},Qt=(e,t)=>({name:e,location:t.location,parameters:[],expression:t,scope:void 0}),$t=(e,t)=>({environment:e,scope:t,state:void 0,next:void 0}),en=e=>e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:void 0,k=e=>e.kind===`Apply`?e.args:[],tn=(e,t,n)=>{let r=en(e);if(r===void 0)return;if(Me(e)){let e=Qe(t,r);return e?.kind===`Operator`&&e.operator.kind===`Closure`?e.operator:void 0}if(n.constants.has(r)||n.variableIndex.has(r))return;let i=ze(r,n);return i?.kind===`Closure`?i:void 0},nn=(e,t)=>{try{return Fe(e,$t(t,void 0)),!0}catch(e){if(e instanceof g)return!1;throw e}},rn=(e,t)=>e?.kind===`Operator`&&e.params.length===0&&e.body.kind!==`Number`&&e.body.kind!==`String`&&ot(e,t)&&nn(e.body,t),an=(e,t)=>{let n=Ke(e.name,t);return n?.body===e.body&&rn(n,t)},on=(e,t)=>{if(e.kind!==`Identifier`||!Me(e))return;let n=Qe(t,e.name);return n?.kind===`Thunk`?n:void 0},sn=(e,t)=>(e?.params??[]).flatMap(e=>{let n=Qe(t,e.name);return n?.kind===`Value`?[[e.name,n.value]]:[]}),cn=(e,t)=>{try{return e()}catch(e){if(e instanceof g)return t();throw e}},ln=(e,t,n,r,i)=>{let a=k(t),o=()=>[{name:e.name,location:t.location,parameters:[],expression:t,scope:n}];return!r||a.length===0?[{...e,parameters:[],expression:t,scope:n}]:a.some(e=>Oe(e,n,i)!==0)?o():cn(()=>[{...e,parameters:a.map((e,t)=>[r.params[t].name.replace(/#\d+$/,``),Fe(e,$t(i,n))]),expression:t,scope:n}],o)},un=(e,t,n,r,i)=>{let a=()=>({name:n?.name??Jt,location:e.location,parameters:sn(n,t),expression:e,scope:t});switch(e.kind){case`Let`:return un(e.body,D(e.definitions,$t(r,t)),n,r,i);case`Label`:return un(e.body,t,n,r,i);case`Or`:return e.operands.flatMap(e=>un(e,t,n,r,i));case`Exists`:return cn(()=>{let o=[];return we(e.bounds,$t(r,t),t=>(o.push(...un(e.body,t,n,r,i)),!1)),o.length===0?[a()]:o},()=>[a()])}let o=Me(e)?void 0:i.get(en(e)??``),s=tn(e,t,r);if(o)return ln(o,e,t,s,r);if(!s)return[a()];let c=k(e),l=Me(e)?s.name:r.instanceNames.get(en(e)??``)??s.name,u=()=>[{name:l,location:e.location,parameters:[],expression:e,scope:t}];return an(s,r)||c.some(e=>Oe(e,t,r)!==0)?u():cn(()=>{let e=c.reduce((e,n,i)=>({name:s.params[i].name,binding:{kind:`Value`,value:Fe(n,$t(r,t))},parent:e}),s.scope);return un(s.body,e,{...s,name:l},r,i)},u)},dn=(e,t,n,r,i)=>{let a=(e,t)=>dn(e,t,n,r,i);if(e.kind===`Let`){a(e.body,D(e.definitions,$t(n,t)));return}let o=on(e,t);if(o){a(o.expression,o.scope);return}let s=tn(e,t,n);if(s&&an(s,n))return;if(s&&s.params.length===0){if(Oe(s.body,s.scope,n)===1){r.inits.push(Qt(s.name,s.body));return}a(s.body,s.scope);return}if(s&&e.kind===`Apply`&&s.params.length===e.args.length){a(s.body,me(s,e.args,$t(n,t)));return}if(e.kind===`And`){e.operands.forEach(e=>a(e,t));return}if(e.kind===`Always`){if(e.expression.kind===`BoxAction`){i.push({expression:e.expression.action,scope:t});return}r.temporals.push(Qt(Jt,e));return}let c=Oe(e,t,n);c<=1?r.inits.push(Qt(Jt,e)):c===3&&r.temporals.push(Qt(Jt,e))},fn=(e,t,n,r,i)=>{let a=(t,n)=>fn(e,t,n,r,i);if(t.kind===`Let`){a(t.body,D(t.definitions,$t(r,n)));return}let o=on(t,n);if(o){a(o.expression,o.scope);return}let s=tn(t,n,r);if(s&&an(s,r))return;if(s&&s.params.length===k(t).length){a(s.body,t.kind===`Apply`?me(s,t.args,$t(r,n)):s.scope);return}if(t.kind===`Forall`&&cn(()=>(we(t.bounds,$t(r,n),e=>(a(t.body,e),!1)),!0),()=>!1))return;if(t.kind===`And`){t.operands.forEach(e=>a(e,n));return}if(t.kind===`Always`){let a=t.expression;a.kind===`BoxAction`?i.impliedActions.push(Qt(e,a)):Oe(a,n,r)<2?i.invariants.push(Qt(e,a)):i.impliedTemporals.push(Qt(e,t));return}let c=Oe(t,n,r);c<=1?i.impliedInits.push(Qt(e,t)):c===3&&i.impliedTemporals.push(Qt(e,t))},pn=(e,t)=>{let n=Ke(e,t);return n?.kind===`Operator`&&!rn(n,t)?n:void 0},mn=(e,t,n)=>{let r={inits:[],actions:[],temporals:[],invariants:[],impliedInits:[],impliedActions:[],impliedTemporals:[]},i=[],a=e.specification===void 0?void 0:pn(e.specification,t);a&&(dn(a.body,void 0,t,r,i),i.forEach(e=>r.actions.push(...un(e.expression,e.scope,void 0,t,n))));let o=e.init===void 0?void 0:ze(e.init,t);o?.kind===`Closure`&&r.inits.push(Qt(e.init??``,o.body));let s=e.next===void 0?void 0:ze(e.next,t);return s?.kind===`Closure`&&r.actions.push(...un(s.body,s.scope,s,t,n)),e.invariants.forEach(e=>{let n=pn(e,t);n&&r.invariants.push(Qt(e,n.body))}),e.properties.forEach(e=>{let n=pn(e,t);n&&fn(e,n.body,void 0,t,r)}),r},hn=(e,t,n)=>mn(e,t,n).inits,gn=(e,t,n)=>mn(e,t,n).actions,_n=e=>e.parameters.length===0?``:`(${e.parameters.map(e=>ve(e[1])).join(`,`)})`,vn=(e,t)=>`${e.name===Jt?`Action`:e.name}${t===`1.7.4`?``:_n(e)} ${u(e.location.range??Yt)}`,yn=e=>`${e.name}${_n(e)}`,bn=(e,t,n,r)=>{let i=mn(e,t,r),a=e=>nt(e.map(Zt)),o=e=>nt(e.flatMap(e=>{let n=pn(e,t);return n?[xe([[`name`,n.name],[`location`,Xt(n.location)]])]:[]}));return xe([[`inits`,a(i.inits)],[`actions`,a(i.actions)],[`temporals`,a(i.temporals)],[`invariants`,a(i.invariants)],[`impliedinits`,a(i.impliedInits)],[`impliedactions`,a(i.impliedActions)],[`impliedtemporals`,a(i.impliedTemporals)],[`variables`,nt(t.variables.map((e,t)=>xe([[`name`,e],[`location`,Xt(n[t])]])))],[`actionconstraints`,o(e.actionConstraints)],[`constraints`,o(e.constraints)]])},xn=`paired12`,Sn=(e,t=16)=>e<=t*.75?t:Sn(e,t*2),Cn=(e,t)=>{let n=Sn(e.length)-1,r=e=>{let r=t(e);return(r^r>>>16)&n};return e.map((e,t)=>({key:e,position:t,bucket:r(e)})).sort((e,t)=>e.bucket-t.bucket||e.position-t.position).map(e=>e.key)},wn=e=>Number(BigInt.asIntN(32,e^BigInt.asUintN(64,e)>>32n)),Tn=e=>[...Array(e.length).keys()].reduce((t,n)=>Math.imul(31,t)+e.charCodeAt(n)|0,0),En=e=>e.replaceAll(`\\`,`\\\\`).replaceAll(`"`,`\\"`).trim(),Dn=e=>En(e).replaceAll(`
12
+ `,`\\n`),On=(e,t)=>{let n=[],r=e=>n.push(`State ${n.length+1}:\n${e.getText()}\n`);return{writeInitialState:r,writeSuccessor:(e,t,n)=>{n||r(t)},writeStuttering:r,close:()=>t?.(e.path,n.join(``))}},kn=(e,t,n)=>{let r=n===`1.7.4`,i=[`strict digraph DiskGraph {
13
+ `,r?``:`node [shape=box,style=rounded]
14
+ `,e.colorize?`edge [colorscheme="${xn}"]\n`:``,`nodesep=0.35;
15
+ `,`subgraph cluster_graph {
16
+ `,`color="white";
17
+ `],a=/* @__PURE__ */ new Map,o=/* @__PURE__ */ new Map,s=e=>{let t=a.get(e.level)??/* @__PURE__ */ new Set;a.set(e.level,t.add(e.fingerprint))},c=e=>{if(!e)return 1;let t=o.get(e.name)??o.size+2;return o.set(e.name,t),t},l=()=>[`subgraph cluster_legend {graph[style=bold];label = "Next State Actions" style="solid"
18
+ `,`node [ labeljust="l",colorscheme="${xn}",style=filled,shape=record ]\n`,...Cn([...o.keys()],Tn).map(e=>`${e.replaceAll(`!`,`:`)} [label="${e}",fillcolor=${o.get(e)}]\n`),`}`].join(``),u=()=>[...Cn([...a],e=>e[0]).map(e=>`{rank = same; ${Cn([...e[1]],wn).map(e=>`${e};`).join(``)}}\n`),`}
19
+ `,e.colorize&&o.size>1?l():``,`}`].join(``),d=()=>{e.snapshot&&t?.(e.path.replaceAll(`.dot`,`_snapshot.dot`),i.join(``)+u())};return{writeInitialState:e=>{i.push(`${e.fingerprint} [label="${Dn(e.getLabel())}",style = filled]\n`),s(e),d()},writeSuccessor:(t,n,a,o)=>{let l=e.colorize?String(c(o)):`black`,u=e.actionLabels&&o?En(r?o.name:o.signature):``;if(i.push(`${t.fingerprint} -> ${n.fingerprint} [label="${u}",color="${l}",fontcolor="${l}"];\n`),!a){let e=r?``:`,tooltip="${Dn(n.getText())}"`;i.push(`${n.fingerprint} [label="${Dn(n.getLabel())}"${e}];\n`)}s(t),d()},writeStuttering:e=>{i.push(`${e.fingerprint} -> ${e.fingerprint} [style="dashed"];\n`),s(e),d()},close:()=>t?.(e.path,i.join(``)+u())}},An=(e,t,n)=>e.dot?kn(e,t,n):On(e,t),jn=(e,t)=>({...e,traceOutput:[...e.traceOutput??[],...t]}),Mn=`Failed to recover the initial state from its fingerprint.`,Nn=`Failed to recover the next state from its fingerprint.`,Pn=(e,t)=>{if(!ge(e))return;let n=de(e);if(!n.domain.every(e=>typeof e==`string`))return;let r=n.domain.map((e,t)=>[String(e),n.range[t]]);return Object.fromEntries(r.sort((e,n)=>t.indexOf(e[0])-t.indexOf(n[0])))},Fn=/* @__PURE__ */ Error(`The replay stopped`),In=/* @__PURE__ */ new Set([...Array.from({length:24},(e,t)=>2222+t),2272,2273,2274,2280,2281]),Ln=t=>{let n=yt(t.message);return n&&!n.isEvalException&&In.has(n.code)?f.configParseError:e(t)},Rn=e=>{let t=e.cause;return t instanceof h?Rn(t):e instanceof d?e.exitCode:f.specEvaluationFailure},zn=e=>{let t=e.dump&&An(e.dump,e.writeFile,e.version);try{return Bn(e,t)}catch(e){throw a(e)?s():e}finally{t?.close()}},Bn=(t,n)=>{let u=typeof t.config==`string`?Mt(t.config,t.version):t.config,g=t.onPrint??console.log,_={lines:void 0},v=e=>{_.lines?_.lines.push(e):g(e)},b=e=>{let t=_.lines,n=[];_.lines=n;try{return{result:e(),lines:n}}finally{_.lines=t}};ne(ye(t.source,u,t.loadModule)),Ae(t.version);let x=_e(u,{source:t.source,loadModule:t.loadModule,loadClass:t.loadClass,print:v,files:{readFile:t.readFile,writeFile:t.writeFile},seed:t.seed,isTool:t.isTool,isTraceRecorded:t.isTraceRecorded,isSanyReported:t.isSanyReported,isWarningEnabled:t.isWarningEnabled,version:t.version});Be(x,u,t.onProgress);let S=x.environment,C=S.runtime,w=C.version===`1.7.4`;C.pause=t.onPause??(()=>{}),C.getSpecification=()=>bn(u,S,x.variableLocations,x.instanceActions);let re={depth:0,initialStates:void 0},T=(e,t,n)=>({status:e,violation:t&&{...t,loopStart:t.loopStart},failure:n,generatedStates:C.generatedStates,distinctStates:C.distinctStates,queuedStates:C.queueSize,depth:C.generatedStates===0?0:Math.max(re.depth,1),initialStates:re.initialStates,outDegrees:void 0,fingerprintDistance:void 0}),oe=Array.from({length:32},()=>0),le={newStates:0},ue=()=>Math.min(le.newStates,31),de=()=>oe.map((e,t)=>t===ue()?e+1:e),me=()=>w?[...oe]:de(),he=(e,t,n)=>w?[]:e.getViolatedProperties(t,n),ge=(e,t=[...oe])=>({...e,violationOutDegrees:t}),ve=()=>({...T(`success`),outDegrees:[...oe],fingerprintDistance:We(C.distinctStates,C.generatedStates,()=>E?E.getStoredFingerprints(O,mt):BigInt64Array.from(O,C.getFingerprint))}),E=Xe(u,S,()=>Se(t.source,t.loadModule),t.onProgress),xe=()=>Je(x.assumptions,S);if(!E){C.isStarted=!0;let e=xe();return e?T(`assumption-violation`,e):(re.initialStates={generated:0,distinct:0},t.onProgress?.({kind:`initial-states-started`}),t.onProgress?.({kind:`initial-states-computed`,initialStates:re.initialStates}),ve())}let we=u.postconditions.length>0||u.possible.length>0,Ee=/* @__PURE__ */ new WeakMap,Oe=e=>Ee.get(e)?.state??e.state,je=e=>{let t=Ee.get(e)?.action;return t?Zt(t):ce(e.action)},Me=(e,t)=>{we&&(C.counterExample=fe(e.map(Oe),e.slice(1).map(je),t));let n=E.findUnwitnessedPossible(),r=n?{result:void 0,lines:[]}:b(()=>E.findPostconditionViolation(!0));return{unwitnessed:n,postcondition:r.result,lines:r.lines}},Pe=(e,t,n)=>{let r=t.loopStart,i=Me(t.trace,r===void 0||!n?void 0:{start:r,action:n()}),a=[...t.traceOutput??[],...i.lines];return T(e,{...t,...a.length>0&&{traceOutput:a},...i.unwitnessed&&{unwitnessed:i.unwitnessed},...i.postcondition&&{postcondition:i.postcondition}})},Ie=E.spec,Re=E.getFingerprintState,ze={value:void 0},He=()=>ze.value??=gn(u,S,x.instanceActions),Ze=e=>{let t=Ne(S),n=t.callStack;try{e(t);return}catch(e){return a(e)?{callStack:[],fingerprint:void 0}:!(e instanceof h)||!n?void 0:{callStack:n.expressions,fingerprint:n.fingerprint}}},Qe=(e,t)=>{if(typeof e!=`object`)return[];let n=t.get(e),r=Ce(e).find(e=>be(e)!==void 0);return[...n?[n]:[],...r===void 0?[]:Qe(r,t)]},$e=(e,t)=>{for(let n of Re(e)){let e=be(n);if(!e)continue;let r=t?Qe(n,t.sources):[];throw t&&r.length>0&&(t.expressions.length=0,t.isFrozen=!0,t.fingerprint={sources:r,reason:e.message}),e}e.forEach(bt)},tt=()=>{let e=Qt.fingerprint?[Qt.fingerprint]:[];return(t,n)=>{$e(t,n);let r=Re(t);return Jt(Ut(r),r)!==-1||e.some(e=>Gt(e,r))?!1:(e.push(r),C.distinctStates++,!0)}},nt=()=>{let e={count:0},t=[],n=tt();return Ze(r=>{if(ft(hn(u,S,x.instanceActions),r,i=>{if(vt(e.count,e=>_.lines?.push(e)),e.count++,C.generatedStates=e.count,!(t.length>0))try{let e=E.checkReplayedInitialState(i,r,()=>{n(i,r.callStack)&&(C.queueSize++,D?.addInitialState(O.length,i,r))});if(e){let t=kt([{action:void 0,state:i}],[]).trace[0].state;throw _.lines?.push({kind:`initial-state-violation`,...e,state:t}),Fn}}catch(e){if(!(e instanceof h)||!r.callStack?.fingerprint)throw e;t.push(e)}}),t.length>0)throw t[0]})},at=e=>Ze(t=>{let r=O[e],i=n&&nn(r,St[e]),a=tt();Ge(He(),r,t,(o,s)=>{if(!E.checkReplayedSuccessor(r,o,t,()=>{let r=a(o,t.callStack);return i&&n?.writeSuccessor(i,nn(o,St[e]+1),!r,ln?{name:s.name,signature:yn(s)}:void 0),r}))throw Fn})}),ot=u.view!==void 0||u.symmetry!==void 0,st=[];E.properties.liveness.length>0&&t.onProgress?.({kind:`liveness-initializing`,isSymmetric:E.isSymmetric,isConstrained:E.isConstrained});let D=o(()=>ht(()=>qt(E.properties.liveness,Ie.temporals,S,{getFingerprint:({index:e,state:t})=>st[e]??=Number(BigInt.asIntN(32,C.getFingerprint(t))),getSuccessors:(e,t)=>{let n=[];if(Ie.next===void 0)return n;let r=k.livenessSource;return k.livenessSource=e,dt(Ie.next,t,S,e=>{if(wt(e.state),!(E.satisfiesConstraints(e.state,t)&&E.satisfiesActionConstraints(t,e.state)))return!1;let r=Re(e.state),i=Jt(Ut(r),r);return n.push({index:i,state:e.state}),!1},Ie.scope),k.livenessSource=r,n}})));C.isStarted=!0;let ut=E.isSymmetric||D!==void 0,O=[],mt=[],yt=[],xt=[],St=[],Ct={slots:new Int32Array(1<<17),size:0,shift:16},wt=se(),Tt=e=>Object.fromEntries(E.getTlcOrder().map(t=>[S.variables[t],e[t]])),Et=(e,t,n,r)=>(C.getLevel=()=>n+1,C.getBehavior=()=>t.slice(0,n+1).map(e=>e.state),Dt(e,t[n].state,(t[n+1]??t[r??n]).state)),Dt=(e,n,r)=>{try{let t=Le(`alias`,e,S).body,i=Fe(it(e),pt(S,n,r)),a=t.kind===`Record`?t.fields.map(e=>e.name):[];return Pn(i,a)??Tt(n)}catch(e){if(!(e instanceof y||e instanceof h))throw e;return{...Tt(n),_ALIASEvalError:Ye(e.message,t.isTool??!1)}}},Ot=(e,t,n,r)=>{let i=He(),a={...k};Object.assign(k,{index:e,isExpanding:!0,candidate:void 0});let o=r?e=>e:Re,s=o(n),c=i.find(e=>rt(e.expression,t,S,e.scope).some(e=>Gt(o(e.state),s)));return Object.assign(k,a),c},kt=(e,n,r={})=>{let i=u.alias,a=r.known??1,o=e.length>1?b(At).lines:[],s=e.map((t,r)=>r===0||t.action===`Stuttering`?{result:void 0,lines:[]}:b(()=>Ot(n[r-1],e[r-1].state,t.state,a===2&&r===e.length-1))),c=s.map(e=>e.lines),l=r.loopStart,d=w&&l!==void 0?l+1:e.length-a,f=d>0?[o,...c.slice(1,d)].flat():[];return{trace:e.map((n,r)=>{let a=s[r].result,o={action:n.action,label:a&&vn(a,t.version),state:i===void 0?Tt(n.state):Et(i,e,r,l),output:r===0?f:r<d?[]:c[r]};return(i!==void 0||a)&&Ee.set(o,{state:Tt(n.state),action:a}),o}),traceOutput:a>0&&!w?[o,...c].flat():[]}},At=()=>Ie.init===void 0?[]:Ue(Ie.init,S,Ie.scope),jt=(e,t)=>b(()=>{for(let n of He()){let r=rt(n.expression,e,S,n.scope).find(t);if(r)return{...r,action:r.action??n.name}}}).result,Nt=(e,t)=>Gt(Re(e),mt[t]),Pt=(e,t)=>jt(e,e=>Nt(e.state,t)),Ft=(e,t)=>{let n=b(()=>ot||lt(S)?At().find(t=>Nt(t,e[0])):O[e[0]]).result;if(!n)throw new h(Mn);let r=[{state:n,action:void 0}];for(let n=1;n<e.length;n++){let i=r[n-1].state;if(e[n-1]===e[n]){r.push({state:i,action:`Stuttering`});continue}let a=Pt(i,e[n]);if(!a)throw new h(t);r.push(a)}return r},It=(e,t)=>{let n=[];for(let t=e;t!==-1;t=yt[t])n.unshift(t);let r=ot&&n.length>1?Ft(n,Mn):n.map(e=>({state:O[e],action:xt[e]}));if(!t)return kt(r,n);let i=ot?jt(O[e],e=>Gt(e.state,t.state))?.action:t.action;return kt([...r,{state:t.state,action:i}],n,{known:2})},Lt=e=>yt[e]===-1?{trace:[{action:void 0,label:void 0,state:Tt(O[e])}],traceOutput:w?[]:b(At).lines}:It(e),Rt=(e,t)=>({trace:It(e,t).trace}),zt=(t,n)=>n.isInitial&&!n.callStack&&!n.fingerprint&&w?f.success:n.callStack?n.isCallStackFirst?e(t):n.isLiveCallStack?p(t)??(t instanceof d?t.exitCode:f.error):n.isInitial||n.fingerprint?f.specEvaluationFailure:Rn(t):n.isInitial?Ln(t):e(t),Bt=(e,t,n={})=>{let i=a(e)?new r:e;if(!(i instanceof h))throw i;let o=t.trace.length>0&&!n.traceFailure?Me(t.trace,void 0):void 0,s=o?.unwitnessed??o?.postcondition,c=[...t.traceOutput??[],...o?.lines??[]];return{...T(`error`,void 0,{...Ve(i,n.isNextState??!1),...t,...c.length>0&&{traceOutput:c},...s&&{postcondition:s},initialState:n.initialState&&!(i instanceof d)?Tt(n.initialState):void 0,exitCode:zt(i,n),callStack:n.callStack,...n.isCallStackFirst&&{isCallStackFirst:!0},...n.fingerprint&&{fingerprint:n.fingerprint},...n.traceFailure&&{traceFailure:n.traceFailure}}),outDegrees:n.outDegrees}},Vt=(e,n)=>{C.generatedStates++;let r=He(),i=r.length===1?r[0]:r.find(e=>e.name===n.action),a=n.variables,o=r.length===1?`the next-state action`:`action ${n.action} of the next-state relation`,s=w?`assigned`:`defined`,c=`Successor state is not completely specified by ${o}. The following variable${a.length>1?`s are`:` is`} not ${s}: ${a.join(`, `)}.\n`,l=ae(`null`),u=n.state.map(e=>e??l),d=Bt(n,Lt(e));return ge({...d,failure:d.failure&&{...d.failure,code:qe.incompleteSuccessor,message:c,toolMessage:c,exitCode:f.specEvaluationFailure,trace:[...d.failure.trace,{action:n.action,label:i&&vn(i,t.version),state:Tt(u)}]}})},Ht=(e,t)=>{let n=Ft(e,Nn),r=n[n.length-1].state;if(ot&&t!==void 0&&t!==e.length-1&&Pt(r,e[t])===void 0)throw new h(Nn);return n},Ut=e=>{let t=2166136261;for(let n=0;n<e.length;n++)t=ke(t,pe(e[n]));return t&1073741823},Wt=e=>{for(let t of e){let e=be(t);if(e)throw e}},Gt=(e,t)=>{for(let n=0;n<t.length;n++)if(!Te(e[n],t[n]))return!1;return!0},Kt=e=>Math.imul(e,2654435761)>>>Ct.shift<<1,Jt=(e,t)=>{let n=Ct.slots.length-1;for(let r=Kt(e);;r=r+2&n){let n=Ct.slots[r+1];if(n===0)return-1;if(Ct.slots[r]===e&&Gt(mt[n-1],t))return n-1}},Yt=(e,t)=>{let n=Ct.slots.length-1,r=Kt(e);for(;Ct.slots[r+1]!==0;)r=r+2&n;Ct.slots[r]=e,Ct.slots[r+1]=t},Xt=(e,t)=>{if(Ct.size++,Ct.size*4>Ct.slots.length){let e=Ct.slots;Ct.slots=new Int32Array(e.length*2),Ct.shift--;for(let t=0;t<e.length;t+=2)e[t+1]!==0&&Yt(e[t],e[t+1])}Yt(e,t+1)},Qt={fingerprint:void 0},$t=e=>{C.distinctStates=O.length+1,re.depth=Math.max(re.depth,e),C.diameter=Math.max(C.diameter,e)},en=(e,t,n,r)=>{let i=n===-1?1:St[n]+1;O.push(e),mt.push(t),yt.push(n),xt.push(r),St.push(i)},k={index:-1,isExpanding:!1,candidate:void 0,candidateLevel:0,livenessSource:-1},tn=e=>e===-1?[]:[...tn(yt[e]),O[e]];C.isSeen=e=>{let t=Re(e);return Jt(Ut(t),t)!==-1},C.getBehavior=e=>{let t=e===k.candidate?-1:O.indexOf(e);return t===-1?[...tn(k.index),e]:tn(t)},C.getCurrentState=()=>k.index===-1?void 0:O[k.index],C.setLivenessSource=e=>{k.livenessSource=e??-1},C.getLevel=e=>{let t=k.livenessSource;if(w){let e=t===-1?k.isExpanding?k.index:-1:t;return e===-1?0:St[e]}return t===-1?e===k.candidate?k.candidateLevel:k.index===-1?0:e===O[k.index]?St[k.index]:k.isExpanding?St[k.index]+1:0:e===O[t]?St[t]:St[t]+1};let nn=(e,t)=>({fingerprint:BigInt.asIntN(64,C.getFingerprint(e)),level:t,getLabel:()=>et(u.alias===void 0?Tt(e):Dt(u.alias,e,void 0)),getText:()=>et(Tt(e))}),rn=e=>{wt(e),C.generatedStates++,C.initialStates++,k.candidate=e,k.candidateLevel=1;let t=Re(e),r=Ut(t),i=E.satisfiesConstraints(e);if(i&&(E.trackStatePossible(e),Wt(t),e.forEach(bt)),i&&Jt(r,t)!==-1)return;Qt.fingerprint=i?t:void 0,i&&($t(1),C.queueSize++,D?.addInitialState(O.length,e),n?.writeInitialState(nn(e,1)));let a=E.findViolatedInvariant(e);if(a)return Pe(`invariant-violation`,{name:a.name,...kt([{action:void 0,state:e}],[])});let o=E.findFailedInitialPredicate(e);if(o)return Pe(`liveness-violation`,{name:o.name,...kt([{action:void 0,state:e}],[])});i&&(Xt(r,O.length),en(e,t,-1,void 0))},an=(e,t,r,i,o)=>{let s=O[e];C.generatedStates++,k.candidate=t.state,k.candidateLevel=St[e]+1,ut&&wt(t.state);let c=Re(t.state),l=Ut(c),u=Jt(l,c),d=E.satisfiesConstraints(t.state,s);d&&E.trackStatePossible(t.state);let f=d&&E.satisfiesActionConstraints(s,t.state);f&&(E.trackActionPossible(s,t.state),Wt(c),t.state.forEach(bt));let p=f?u:-1;if(i&&f&&n?.writeSuccessor(i,nn(t.state,St[e]+1),p!==-1,o&&{name:o.name,signature:yn(o)}),p!==-1&&D){let e=O[p],n=e.every((e,n)=>e===t.state[n]);r.push({index:p,state:n?e:t.state})}let m=f&&p===-1;if(m&&D&&r.push({index:O.length,state:t.state}),Qt.fingerprint=m?c:void 0,m&&($t(St[e]+1),le.newStates++),p===-1)try{let n=E.findViolatedInvariant(t.state,s);if(n)return ge(Pe(`invariant-violation`,{name:n.name,...It(e,t)}))}catch(n){if(a(n))throw n;let r=b(()=>at(e));return Bt(n,jn(Rt(e,t),r.lines),r.result??{outDegrees:me()})}let h=E.findViolatedActionProperty(s,t.state);if(h)return ge(Pe(`liveness-violation`,{name:h.name,...It(e,t)}));m&&(ut||wt(t.state),Xt(l,O.length),en(t.state,c,e,t.action),C.queueSize++)},on={result:void 0};D&&t.onProgress?.({kind:`liveness-prepared`,branches:D.branches});let sn=xe();if(sn)return T(`assumption-violation`,sn);if(t.onProgress?.({kind:`initial-states-started`}),Ie.init!==void 0)try{ct(Ie.init,S,e=>{vt(C.initialStates,t.onProgress);try{on.result=rn(e)}catch(t){let n=b(nt);on.result=Bt(t,{trace:[],traceOutput:n.lines},{initialState:e,...n.result,isInitial:!0})}return on.result!==void 0},Ie.scope)}catch(e){if(e instanceof m){let t=Bt(e,{trace:[]},{initialState:e.state.map(e=>e??ae(`null`))});return{...t,failure:t.failure&&{...t.failure,isWithoutStatistics:!0}}}let t=b(nt);return Bt(e,{trace:[],traceOutput:t.lines},{...t.result,isInitial:!0})}if(on.result)return on.result;re.initialStates={generated:C.initialStates,distinct:C.distinctStates},t.onProgress?.({kind:`initial-states-computed`,initialStates:re.initialStates});let cn=Ie.next;if(cn===void 0){if(O.length>0)throw new h(`No next state actions defined to generate successor states from.`);return ve()}let ln=!!(t.dump?.dot&&(t.dump.actionLabels||t.dump.colorize)),un=(e,t)=>{if(!ln)return dt(cn,e,S,e=>t(e,void 0),Ie.scope);let n={isStopped:!1};return He().reduce((r,i)=>n.isStopped?r:r+dt(i.expression,e,S,e=>(n.isStopped=t(e,i),n.isStopped),i.scope),0)},dn=(e,t)=>{if(!D||w)return;let n=Ze(n=>D.addState(e,O[e],t,n));return n?.callStack.length&&!n.fingerprint?n.callStack:void 0},fn=(e,t)=>{try{D?.addState(e,O[e],t);return}catch(n){if(!(n instanceof h))throw n;return dn(e,t)}},pn=(e,t)=>{let n=b(()=>fn(e,t));if(n.result)return{result:{callStack:n.result,fingerprint:void 0,isLiveCallStack:!0},lines:n.lines};let r=b(()=>at(e));return{result:r.result,lines:[...n.lines,...r.lines]}},mn=e=>Bt(s(),Lt(e)),_n=(e,t,n)=>{if(a(e))return mn(t);let r=pn(t,n);return Bt(gt(e),jn(Lt(t),r.lines),{isNextState:!0,...r.result})},xn=(e,t)=>{let r=O[e],o=n&&nn(r,St[e]),s=un(r,(n,r)=>{try{on.result=an(e,n,t,o,r)}catch(r){if(a(r))return on.result=mn(e),!0;let i=w?b(()=>at(e)):pn(e,t);if(w&&r instanceof h&&!ie(r))return on.result=Bt(new h(`${_t(r)}${r.message}`,r),jn({trace:[]},i.lines),{isNextState:!0,...i.result}),!0;let o=Re(n.state).some(e=>be(e)!==void 0)&&r instanceof h?Ve(De(r)?new h(`${c}${r.message}`):r,!0):void 0;on.result=Bt(r,jn(o?Lt(e):Rt(e,n),i.lines),{isNextState:!0,...i.result,traceFailure:o})}return on.result!==void 0});k.isExpanding=!1;let d=on.result;if(d?.violation&&!w){let n=b(()=>fn(e,t));return{...d,violation:jn(d.violation,n.lines),...n.result&&{liveCallStack:n.result}}}if(d)return d;let p=()=>{D&&o&&w&&n?.writeStuttering(o);let i=D?.addState(e,r,t);if(!D||!i)return;let a=Ht(i),s=he(D,a.map(e=>e.state),a.length-1);return Pe(`property-violation`,{name:s[0],properties:s,...kt(a,i,{known:0})})};if(s===0&&u.checkDeadlock){let n=Pe(`deadlock`,{name:`deadlock`,...Lt(e)}),r=b(()=>{try{return{additional:p()?.violation}}catch(n){if(!(n instanceof h))throw n;return{isFailed:!0,callStack:dn(e,t)}}}),i=n.violation?{...n,violation:jn(n.violation,r.lines)}:n,a=ge(i,r.result.isFailed?me():de());return r.result.additional?{...a,additionalViolation:r.result.additional}:r.result.callStack?{...a,liveCallStack:r.result.callStack}:a}try{return p()}catch(n){if(w&&n instanceof h){let e=new h(`${De(n)?c:l}${n.message}`);return Bt(i(e,f.error),{trace:[]},{outDegrees:me()})}let a=Ze(n=>D?.addState(e,r,t,n));return Bt(n,Lt(e),{outDegrees:me(),callStack:a?.callStack.length?a.callStack:void 0,isNextState:!0,isCallStackFirst:!0})}},Sn=()=>{let e=u.specification,t=`(compare Chapter 8, page 87ff of Specifying Systems at https://lamport.azurewebsites.net/tla/book.html).`;if(e===void 0)return{code:qe.noSpecificationButProperty,text:`The stuttering counterexample above may be caused by the absence of a behavior specification (SPECIFICATION). Only INIT and NEXT have been provided, so TLC permits infinite stuttering. To rule out such counterexamples, use SPECIFICATION Spec, with Spec asserting a suitable fairness constraint ${t}`};let n=Ke(e,S)?.location.range;if(!(Ie.temporals.length>0||!n))return{code:qe.noFairnessButProperty,text:`The stuttering counterexample above may be caused by the absence of a fairness constraint in the behavior specification ${e} defined at ${te(n)}. To rule out such counterexamples, conjoin a suitable fairness constraint to ${e} ${t}`}},Cn=(e,n)=>{let r=[...n.prefix,...n.cycle],i=n.prefix.length,a=Ht(r,i),o=kt(a,r,{loopStart:i,known:0}).trace,s=he(e,a.map(e=>e.state),i),c=r[i],l=r[r.length-1],u=a[a.length-1].state,d=c===l?{result:void 0,lines:[]}:b(()=>Ot(l,u,O[c],!1)),f=c===l&&n.isCycleConstrained;return Pe(`liveness-violation`,{name:s[0],properties:s,trace:o,traceOutput:d.lines,loopStart:i,loopLabel:d.result&&vn(d.result,t.version),warning:f?Sn():void 0},()=>c===l?je(o[o.length-1]):d.result?Zt(d.result):ce(Pt(u,c)?.action))},wn=D!==void 0&&t.livenessCheck!==`final`,Tn=performance.now(),En={at:Tn+3e3,size:1,time:0},Dn=e=>{let n=performance.now();if(!((e-En.size)/En.size>.1)||En.time>(n-Tn)*.2||(En.size=e,!D))return;t.onProgress?.({kind:`liveness-started`,branches:D.branches,isComplete:!1,states:e,statistics:T(`success`)});let r=D.findViolation();return r||t.onProgress?.({kind:`liveness-finished`}),En.time+=performance.now()-n,r};for(let e=0;e<O.length&&!C.isStopped;e++){k.index=e,k.candidate=void 0,C.queueSize=O.length-e-1,k.isExpanding=!0;let n=[];try{on.result=xn(e,n)}catch(t){on.result=t instanceof ee?Vt(e,t):_n(t,e,n)}if(on.result)return on.result;if(oe[ue()]++,le.newStates=0,(wn||t.onProgress)&&performance.now()>=En.at){En.at=performance.now()+6e4;let n=wn?Dn(e+1):void 0;if(D&&n)return Cn(D,n);t.onProgress?.({kind:`progress`,statistics:T(`success`)})}}k.index=-1,k.candidate=void 0,D&&t.onProgress?.({kind:`liveness-started`,branches:D.branches,isComplete:!0,states:C.distinctStates,statistics:T(`success`)});let On=D?.findViolation();if(D&&On)return Cn(D,On);D&&t.onProgress?.({kind:`liveness-finished`});try{let e=E.findPostconditionViolation();if(e)return T(`postcondition-violation`,{name:e.name,message:e.message,counts:e.counts,trace:[],postcondition:e})}catch(e){return Bt(e,{trace:[]})}return ve()},Vn=async e=>{let t=typeof e.config==`string`?Mt(e.config,e.version):e.config,n=e.onPrint??console.log,r={count:0},i=e=>[e.kind,`name`in e?e.name:``,`count`in e?e.count:``,`text`in e?e.text:``].join(` `),a=/* @__PURE__ */ new Set,o=t=>{a.add(i(t)),e.onProgress?.(t)},s=()=>{let o={count:r.count};return zn({...e,config:t,onPrint:e=>o.count-->0?void 0:n(e),onProgress:t=>{a.has(i(t))||e.onProgress?.(t)}})},c=e.workers??1;if(c<2||typeof SharedArrayBuffer!=`function`||e.dump!==void 0||t.view!==void 0||t.postconditions.length>0||t.possible.length>0)return s();let l=/* @__PURE__ */ new Map,u=t=>{let n=e.loadModule?.(t);return l.set(t,n),n},d=/* @__PURE__ */ new Map,f=t=>{let n=e.loadClass?.(t);return d.set(t,n),n};ne(ye(e.source,t,u)),Ae(e.version);let p=le(),m=_e(t,{source:e.source,loadModule:u,loadClass:f,print:e=>{r.count++,n(e)},files:{readFile:e.readFile,writeFile:e.writeFile},isTool:e.isTool,isTraceRecorded:e.isTraceRecorded,isSanyReported:e.isSanyReported,isWarningEnabled:e.isWarningEnabled,version:e.version});Be(m,t,o);let g=m.environment,_=Xe(t,g,()=>Se(e.source,u),o);if(Je(m.assumptions,g)||!_||_.spec.init===void 0||_.spec.next===void 0||_.properties.liveness.length>0||lt(g))return s();let v=se(),y={fingerprints:Ze()},b=/* @__PURE__ */ new Int32Array(2),ee=Array.from({length:c},at),S={generatedStates:0,distinctStates:0,queuedStates:0,depth:0,initialStates:void 0,outDegrees:Array.from({length:32},()=>0)},te=[],C=()=>({status:`success`,violation:void 0,failure:void 0,...S,fingerprintDistance:We(S.distinctStates,S.generatedStates,()=>{let e=new BigInt64Array(S.distinctStates);return te.reduce((t,n)=>(e.set(n,t),t+n.length),0),e})}),w=e=>{let t=[];for(let n of Ue(e,g,_.spec.scope))if(vt(S.generatedStates,o),v(n),S.generatedStates++,He(_.getFingerprintState(n),b),ut(y.fingerprints)&&(y.fingerprints=Re(y.fingerprints)),st(y.fingerprints,b[0],b[1])){if(_.findViolatedInvariant(n)||_.findFailedInitialPredicate(n))return!1;if(_.satisfiesConstraints(n)){if(!ee[t.length%c].encode(n))return!1;t.push(n),S.distinctStates++}}return te.push(BigInt64Array.from(t,e=>g.runtime.getFingerprint(e))),!0};o({kind:`initial-states-started`});try{if(!w(_.spec.init))return s()}catch(e){if(!(e instanceof h))throw e;return s()}if(le()!==p)return s();if(S.depth=S.generatedStates===0?0:1,S.initialStates={generated:S.generatedStates,distinct:S.distinctStates},o({kind:`initial-states-computed`,initialStates:S.initialStates}),S.distinctStates===0)return C();let re=[],ie={count:c,resolve:e=>{}},T=e=>{re.push(e),(e.type===`abort`||re.length===ie.count)&&ie.resolve(re.splice(0))},ae=e=>new Promise(t=>{ie.count=e,ie.resolve=t}),oe=ae(c),ce=new Int32Array(new SharedArrayBuffer(c*4)),ue=new Int32Array(new SharedArrayBuffer(c*4)),de=await Promise.all(Array.from({length:c},()=>x(new URL(`./parallel-worker.js`,import.meta.url),e=>T(e),()=>T({type:`abort`})))),fe=()=>de.forEach(e=>e.terminate()),pe=/* @__PURE__ */ new Map,me=(e,t)=>{let n=e<t?`${e}:${t}`:`${t}:${e}`,r=pe.get(n)??new MessageChannel;return pe.set(n,r),e<t?r.port1:r.port2};de.forEach((n,r)=>{let i=Array.from({length:c},(e,t)=>t===r?void 0:me(r,t)),a=ee[r].finish(),o={type:`start`,source:e.source,config:t,modules:[...l],classes:[...d],index:r,ports:i,seed:a,isTool:e.isTool,isTraceRecorded:e.isTraceRecorded,isWarningEnabled:e.isWarningEnabled,version:e.version,fingerprints:y.fingerprints,requests:ce,remaining:ue};n.postMessage(o,[...i.filter(e=>e!==void 0),a.words.buffer])});let he=e=>e.some(e=>e.type===`abort`),ge=e=>de.forEach(t=>t.postMessage(e)),ve=async e=>{let t=e.filter(e=>e.type===`paused`).length;if(t===0||he(e))return e;y.fingerprints=Re(y.fingerprints);let n=ae(t);return ge({type:`resize`,fingerprints:y.fingerprints}),[...e.filter(e=>e.type!==`paused`),...await ve(await n)]};if(he(await oe))return fe(),s();for(;;){let e=ae(c);ce.forEach((e,t)=>Atomics.store(ce,t,0)),ge({type:`level`});let t=await ve(await e);if(he(t))return fe(),s();let n=t.flatMap(e=>e.type===`level`?[e]:[]),r=n.reduce((e,t)=>e+t.added,0);if(S.generatedStates+=n.reduce((e,t)=>e+t.generated,0),S.distinctStates+=r,n.forEach(e=>{e.outDegrees.forEach((e,t)=>S.outDegrees[t]+=e),te.push(e.fingerprints)}),r===0)return fe(),C();S.depth++}},Hn=e=>{let t=e.endColumn-1;return e.startLine===e.endLine?e.startColumn>=t?`line ${e.startLine}, character ${e.startColumn}`:`line ${e.startLine}, characters ${e.startColumn}-${t}`:`line ${e.startLine}, character ${e.startColumn} to line ${e.endLine}, character ${t}`},Un=e=>`File ${JSON.stringify(e.file)}, ${Hn(e)}`,Wn=e=>e?Un(e):`<unknown location>`,Gn=e=>`${Wn(e)}:\n`,A=(e,t)=>({text:`${Gn(e)}Error: ${t}`,channel:`stderr`}),Kn=e=>e?`${Un(e)} :\n`:``,j=(e,t)=>{let n=t.location?{...e,location:t.location}:e;return t.isAtomic?{...n,isAtomic:!0}:n},qn=e=>{switch(e.kind){case`Fresh`:case`Flex`:return e.name;case`Defn`:return e.definition.name;case`Fact`:return}},Jn=(e,t)=>e.kind===`Apply`&&e.operator.kind===`Internal`&&e.operator.builtin===t,M=(e,t,n)=>j({kind:`Apply`,operator:j({kind:`Internal`,builtin:e},n),args:t},n),Yn=e=>e.context.length===0?e.active:{kind:`Sequent`,sequent:e},N=(e,t)=>({hyp:t,rest:e,size:(e?.size??0)+1}),P=(e,t)=>t.reduce(N,e),Xn=e=>{let t=[];for(let n=e;n;n=n.rest)t.push(n.hyp);return t.reverse()},Zn=(e,t)=>{let n=0;for(let r=e;r;r=r.rest){if(qn(r.hyp)===t)return{depth:n,hyp:r.hyp};n++}},Qn=(e,t)=>{let n=e;for(let e=0;e<t&&n;e++)n=n.rest;return n},$n=(e,t,n)=>{let r=[];return[t.reduce((e,t)=>{let[i,a]=n(e,t);return r.push(a),i},e),r]},er=(e,t)=>{let n={state:e,hyp:void 0,parent:void 0,next:/* @__PURE__ */ new WeakMap};return(e,r=e)=>{let i=e.reduce((e,n,i)=>{let a=e.next.get(n);if(a)return a;let[o,s]=t(e.state,r[i],n),c={state:o,hyp:s,parent:e,next:/* @__PURE__ */ new WeakMap};return e.next.set(n,c),c},n),a=[];for(let e=i;e;e=e.parent)e.hyp&&a.push(e.hyp);return{state:i.state,context:a.reverse()}}},tr=(e,t,n=0)=>({kind:`Fresh`,name:e,shape:n,level:t,domain:void 0,domainVisibility:`Visible`}),nr=(e,t)=>({kind:`Fresh`,name:e,shape:0,level:`Constant`,domain:t,domainVisibility:`Visible`}),rr=(e,t,n,r)=>({kind:`Fact`,expression:e,visibility:t,time:n,location:r}),ir=e=>tr(e.name,e.level),ar=e=>tr(e.name,`Unknown`,e.shape),or=e=>({kind:`Defn`,definition:e,whereDefined:`User`,visibility:`Visible`,isLocal:!0}),sr=e=>{if(!e.location&&!e.isAtomic)return e;let{location:t,isAtomic:n,...r}=e;return r},cr=(e,t)=>e.map(e=>e.domain.kind===`Domain`?{...e,domain:{kind:`Domain`,expression:t(e.domain.expression)}}:e),lr=(e,t)=>e.kind===`Instance`||e.kind===`Label`?{...e,args:e.args.map(t)}:e,ur=(e,t)=>e.map(e=>{let n=t(e.value);return{trail:e.trail.map(e=>e.kind===`Apply`?{kind:`Apply`,expression:t(e.expression)}:e),value:n}}),dr=(e,t)=>e.kind===`Operator`||e.kind===`Bpragma`?{...e,body:t(e.body)}:e,fr=(e,t,n)=>e.kind===`Fresh`?e.domain?{...e,domain:t(e.domain)}:e:e.kind===`Flex`||n===`visible`&&e.visibility===`Hidden`?e:e.kind===`Defn`?{...e,definition:dr(e.definition,t)}:{...e,expression:t(e.expression)},pr=(e,t,n,r,i=`visible`)=>{let a=t=>n(e,t),o=t=>t.reduce((e,t)=>r(e,ir(t)),e);switch(t.kind){case`Ix`:case`Internal`:case`Opaque`:case`String`:case`Num`:case`At`:return t;case`Lambda`:{let i=t.params.reduce((e,t)=>{let n=ar(t);return r(e,t.location?{...n,location:t.location}:n)},e);return{...t,body:n(i,t.body)}}case`Sequent`:{let[a,o]=$n(e,t.sequent.context,(e,t)=>{let a=fr(t,t=>n(e,t),i);return[r(e,a),a]});return{...t,sequent:{context:o,active:n(a,t.sequent.active)}}}case`Let`:{let[i,a]=$n(e,t.definitions,(e,t)=>{let i=dr(t,t=>n(e,t));return[r(e,or(i)),i]});return{...t,definitions:a,body:n(i,t.body)}}case`Quant`:case`Fcn`:{let e=cr(t.bounds,a);return{...t,bounds:e,body:n(o(e),t.body)}}case`SetOf`:{let e=cr(t.bounds,a);return{...t,bounds:e,element:n(o(e),t.element)}}case`Tquant`:{let i=t.names.reduce((e,t)=>r(e,{kind:`Flex`,name:t}),e);return{...t,body:n(i,t.body)}}case`Choose`:{let i=t.domain&&a(t.domain),o=i?nr(t.name,i):tr(t.name,`Constant`);return{...t,domain:i,body:n(r(e,o),t.body)}}case`SetSt`:{let i=a(t.domain),o=nr(t.name,i);return{...t,domain:i,body:n(r(e,o),t.body)}}case`Bang`:{let e=t.selectors.map(e=>lr(e,a));return{...t,expression:a(t.expression),selectors:e}}case`Apply`:{let e=t.args.map(a);return{...t,operator:a(t.operator),args:e}}case`With`:case`Dot`:case`Parens`:return{...t,expression:a(t.expression)};case`If`:{let e=a(t.alternative),n=a(t.consequent);return{...t,condition:a(t.condition),consequent:n,alternative:e}}case`List`:return{...t,items:t.items.map(a)};case`SetEnum`:case`Tuple`:return{...t,elements:t.elements.map(a)};case`Product`:return{...t,factors:t.factors.map(a)};case`FcnApp`:{let e=t.args.map(a);return{...t,function:a(t.function),args:e}}case`Arrow`:{let e=a(t.range);return{...t,domain:a(t.domain),range:e}}case`Rect`:case`Record`:return{...t,fields:t.fields.map(e=>({name:e.name,value:a(e.value)}))};case`Except`:{let e=ur(t.specs,a);return{...t,function:a(t.function),specs:e}}case`Sub`:case`Tsub`:case`Fair`:return{...t,subscript:a(t.subscript),action:a(t.action)};case`Case`:{let e=t.other&&a(t.other),n=t.arms.map(e=>{let t=a(e.body);return{condition:a(e.condition),body:t}});return{...t,arms:n,other:e}}}},mr=(e,t)=>pr(void 0,e,(e,n)=>t(n),()=>void 0,`all`),hr=e=>{let t=[];return mr(e,e=>(t.push(e),e)),t},F=e=>({kind:`Shift`,amount:e}),gr=(e,t)=>({kind:`Cons`,expression:e,rest:t}),_r=(e,t)=>e.reduce((e,t)=>gr(t,e),t),vr=(e,t)=>t.kind===`Bump`?{kind:`Bump`,amount:t.amount+e,rest:t.rest}:{kind:`Bump`,amount:e,rest:t},yr=(e,t,n)=>{switch(e.kind){case`Shift`:return j({kind:`Ix`,index:e.amount+t},n);case`Cons`:return t===1?j(sr(e.expression),n):yr(e.rest,t-1,n);case`Compose`:return I(e.outer,yr(e.inner,t,n));case`Bump`:return t<=e.amount?j({kind:`Ix`,index:t},n):I(F(e.amount),yr(e.rest,t-e.amount,n))}},br=(e,t)=>t.map(t=>I(e,t)),xr=(e,n)=>{if(e.kind===`Lambda`){if(e.params.length!==n.length)throw new t(`Arity mismatch`);return sr(I(_r(n,F(0)),e.body))}return e.kind===`Apply`?{kind:`Apply`,operator:e.operator,args:[...e.args,...n]}:n.length===0?sr(e):{kind:`Apply`,operator:e,args:n}},Sr=(e,t)=>[vr(t.length,e),cr(t,t=>I(e,t))],Cr=(e,t)=>{switch(t.kind){case`Recursive`:case`Operator`:case`Bpragma`:return dr(t,t=>I(e,t));case`Instance`:{let n=vr(t.instance.args.length,e);return{...t,instance:{...t.instance,substitutions:t.instance.substitutions.map(e=>({name:e.name,expression:I(n,e.expression)}))}}}}},wr=(e,t)=>{switch(t.kind){case`Fresh`:return t.domain?{...t,domain:I(e,t.domain)}:t;case`Flex`:return t;case`Defn`:return{...t,definition:Cr(e,t.definition)};case`Fact`:return{...t,expression:I(e,t.expression)}}},Tr=(e,t)=>{let[n,r]=$n(e,t.context,(e,t)=>[vr(1,e),wr(e,t)]);return{context:r,active:I(n,t.active)}},I=(e,t)=>{let n=t=>I(e,t);switch(t.kind){case`Internal`:case`Opaque`:case`String`:case`Num`:case`At`:return t;case`Ix`:return yr(e,t.index,t);case`Apply`:return j(xr(n(t.operator),br(e,t.args)),t);case`Bang`:return{...t,expression:n(t.expression),selectors:t.selectors.map(e=>lr(e,n))};case`Lambda`:return{...t,body:I(vr(t.params.length,e),t.body)};case`Let`:{let[n,r]=$n(e,t.definitions,(e,t)=>[vr(1,e),Cr(e,t)]);return{...t,definitions:r,body:I(n,t.body)}}case`Sequent`:return{...t,sequent:Tr(e,t.sequent)};case`With`:case`Dot`:case`Parens`:return{...t,expression:n(t.expression)};case`If`:return{...t,condition:n(t.condition),consequent:n(t.consequent),alternative:n(t.alternative)};case`List`:return{...t,items:br(e,t.items)};case`Quant`:case`Fcn`:{let[n,r]=Sr(e,t.bounds);return{...t,bounds:r,body:I(n,t.body)}}case`Tquant`:return{...t,body:I(vr(t.names.length,e),t.body)};case`Choose`:return{...t,domain:t.domain&&n(t.domain),body:I(vr(1,e),t.body)};case`SetSt`:return{...t,domain:n(t.domain),body:I(vr(1,e),t.body)};case`SetOf`:{let[n,r]=Sr(e,t.bounds);return{...t,bounds:r,element:I(n,t.element)}}case`SetEnum`:case`Tuple`:return{...t,elements:br(e,t.elements)};case`Arrow`:return{...t,domain:n(t.domain),range:n(t.range)};case`FcnApp`:return{...t,function:n(t.function),args:br(e,t.args)};case`Product`:return{...t,factors:br(e,t.factors)};case`Rect`:case`Record`:return{...t,fields:t.fields.map(e=>({name:e.name,value:n(e.value)}))};case`Except`:return{...t,function:n(t.function),specs:ur(t.specs,n)};case`Sub`:case`Tsub`:case`Fair`:return{...t,action:n(t.action),subscript:n(t.subscript)};case`Case`:return{...t,arms:t.arms.map(e=>({condition:n(e.condition),body:n(e.body)})),other:t.other&&n(t.other)}}},L=(e,t)=>e===0?t:I(F(e),t),Er=(e,t,n)=>e.length===t.length&&e.every((e,r)=>n(e,t[r])),Dr=(e,t)=>e&&t?R(e,t):!e&&!t,Or=(e,t)=>{let n=new Map(e.map(e=>[e.name,e.value])),r=new Map(t.map(e=>[e.name,e.value]));if(n.size!==r.size)return!1;for(let[e,t]of n){let n=r.get(e);if(!n||!R(t,n))return!1}return!0},kr=(e,t)=>e.level===t.level&&e.domain.kind===t.domain.kind&&(e.domain.kind!==`Domain`||t.domain.kind===`Domain`&&R(e.domain.expression,t.domain.expression)),Ar=(e,t)=>{if(e.kind!==t.kind)return!1;switch(e.kind){case`Number`:return t.kind===`Number`&&e.value===t.value;case`Instance`:return t.kind===`Instance`&&Er(e.args,t.args,R);case`Label`:return t.kind===`Label`&&e.label===t.label&&Er(e.args,t.args,R);default:return!0}},jr=(e,t)=>{if((e.kind===`Operator`||e.kind===`Bpragma`)&&t.kind===e.kind)return R(e.body,t.body);if(e.kind===`Instance`&&t.kind===`Instance`){let n=e.instance.substitutions.map(e=>({name:e.name,value:e.expression})),r=t.instance.substitutions.map(e=>({name:e.name,value:e.expression}));return Er(e.instance.args,t.instance.args,(e,t)=>e===t)&&e.instance.module===t.instance.module&&Or(n,r)}return!1},Mr=(e,t)=>e.kind===`Fresh`&&t.kind===`Fresh`?e.level===t.level&&e.shape===t.shape&&Dr(e.domain,t.domain):e.kind===`Flex`&&t.kind===`Flex`?!0:e.kind===`Defn`&&t.kind===`Defn`?jr(e.definition,t.definition)&&e.isLocal===t.isLocal:e.kind===`Fact`&&t.kind===`Fact`&&R(e.expression,t.expression),Nr=(e,t)=>Er(e.context,t.context,Mr)&&R(e.active,t.active),R=(e,t)=>{if(e.kind===`Parens`)return R(e.expression,t);if(t.kind===`Parens`)return R(e,t.expression);switch(e.kind){case`Ix`:return t.kind===`Ix`&&e.index===t.index;case`Opaque`:return t.kind===`Opaque`&&e.name===t.name;case`Internal`:return t.kind===`Internal`&&e.builtin===t.builtin;case`Lambda`:return t.kind===`Lambda`&&e.params.length===t.params.length&&R(e.body,t.body);case`Apply`:return t.kind===`Apply`&&R(e.operator,t.operator)&&Er(e.args,t.args,R);case`Sequent`:return t.kind===`Sequent`&&Nr(e.sequent,t.sequent);case`Bang`:return t.kind===`Bang`&&R(e.expression,t.expression)&&Er(e.selectors,t.selectors,Ar);case`With`:return t.kind===`With`&&R(e.expression,t.expression);case`Let`:return t.kind===`Let`&&Er(e.definitions,t.definitions,jr)&&R(e.body,t.body);case`If`:return t.kind===`If`&&R(e.condition,t.condition)&&R(e.consequent,t.consequent)&&R(e.alternative,t.alternative);case`List`:return t.kind===`List`&&e.bullet===t.bullet&&Er(e.items,t.items,R);case`Quant`:return t.kind===`Quant`&&e.quantifier===t.quantifier&&Er(e.bounds,t.bounds,kr)&&R(e.body,t.body);case`Tquant`:return t.kind===`Tquant`&&e.quantifier===t.quantifier&&Er(e.names,t.names,(e,t)=>e===t)&&R(e.body,t.body);case`Choose`:return t.kind===`Choose`&&Dr(e.domain,t.domain)&&R(e.body,t.body);case`SetSt`:return t.kind===`SetSt`&&R(e.domain,t.domain)&&R(e.body,t.body);case`SetOf`:return t.kind===`SetOf`&&R(e.element,t.element)&&Er(e.bounds,t.bounds,kr);case`SetEnum`:case`Tuple`:return t.kind===e.kind&&Er(e.elements,t.elements,R);case`Arrow`:return t.kind===`Arrow`&&R(e.domain,t.domain)&&R(e.range,t.range);case`Fcn`:return t.kind===`Fcn`&&Er(e.bounds,t.bounds,kr)&&R(e.body,t.body);case`FcnApp`:return t.kind===`FcnApp`&&Er([e.function,...e.args],[t.function,...t.args],R);case`Product`:return t.kind===`Product`&&Er(e.factors,t.factors,R);case`Rect`:case`Record`:return t.kind===e.kind&&Or(e.fields,t.fields);case`Except`:return t.kind===`Except`&&R(e.function,t.function)&&Er(e.specs,t.specs,(e,t)=>Er(e.trail,t.trail,(e,t)=>e.kind===`Dot`?t.kind===`Dot`&&e.field===t.field:t.kind===`Apply`&&R(e.expression,t.expression))&&R(e.value,t.value));case`Dot`:return t.kind===`Dot`&&R(e.expression,t.expression)&&e.field===t.field;case`Sub`:case`Tsub`:return t.kind===e.kind&&e.modal===t.modal&&R(e.action,t.action)&&R(e.subscript,t.subscript);case`Fair`:return t.kind===`Fair`&&e.fairness===t.fairness&&R(e.subscript,t.subscript)&&R(e.action,t.action);case`Case`:return t.kind===`Case`&&(e.arms.length===0||t.arms.length===0?e.arms.length===t.arms.length:R(e.arms[0].condition,t.arms[0].condition)&&R(e.arms[0].body,t.arms[0].body))&&Dr(e.other,t.other);case`String`:return t.kind===`String`&&e.value===t.value;case`Num`:return t.kind===`Num`&&e.integer===t.integer&&e.fraction===t.fraction;case`At`:return t.kind===`At`&&e.isExcept===t.isExcept}},Pr={kind:`Opaque`,name:`$Bad`},Fr=e=>e.kind===`Opaque`&&e.name===Pr.name,Ir=e=>{let t=e.kind===`Parens`?Ir(e.expression):mr(e,Ir);if(!t.isAtomic)return t;let{isAtomic:n,...r}=t;return r},Lr=e=>e.kind===`Let`?j({kind:`Let`,definitions:e.definitions,body:Lr(e.body)},e.body):e.kind===`Parens`?Lr(e.expression):mr(e,Lr),Rr=e=>e.kind===`Ix`?e.index<=0:hr(e).some(Rr),zr=(e,t,n)=>{let r=(e,r=n)=>zr(e,t,r),i=(e,t)=>e.reduce((e,t)=>e??(t.domain.kind===`Domain`?r(t.domain.expression):void 0),void 0)??r(t,[...n,...e.map(ir)]);switch(e.kind){case`Parens`:return e.form.kind===`Xlabel`?e.form.label===t?{context:n,expression:e.expression,indices:e.form.indices}:void 0:r(e.expression);case`Lambda`:return r(e.body,[...n,...e.params.map(ar)]);case`Let`:{let t=[...n];for(let n of e.definitions){let e=n.kind===`Operator`||n.kind===`Bpragma`?r(n.body,[...t]):void 0;if(e)return e;t.push({kind:`Defn`,definition:n,whereDefined:`Builtin`,visibility:`Visible`,isLocal:!0})}return r(e.body,t)}case`Quant`:case`Fcn`:return i(e.bounds,e.body);case`SetOf`:return i(e.bounds,e.element);case`Tquant`:return r(e.body,[...n,...e.names.map(e=>({kind:`Flex`,name:e}))]);case`Choose`:case`SetSt`:return(e.domain&&r(e.domain))??r(e.body,[...n,tr(e.name,`Constant`)]);case`Sequent`:{let t=[...n];for(let n of e.sequent.context){if(n.kind!==`Fact`)return;let e=r(n.expression,[...t]);if(e)return e;t.push(n)}return r(e.sequent.active,t)}default:for(let t of hr(e)){let e=r(t);if(e)return e}return}},Br=(e,t)=>_r(Array.from({length:e},(e,t)=>({kind:`Ix`,index:t+1})),F(e+t)),Vr=e=>Array.from({length:e},(t,n)=>({kind:`Ix`,index:e-n})),Hr=(e,n,r)=>{switch(n.kind){case`Quant`:case`Fcn`:case`SetOf`:{if(n.bounds.length!==r.length){let i=n.bounds.length,a=`Arity mismatch in subexpression instance.\nExpected ${i} argument${i===1?``:`s`}, but found${r.length<i?` only`:``} ${r.length}.`;throw e(A(n.location,a)),new t(a,{failure:`Expr.Deref.deref_inst`})}let i=n.kind===`SetOf`?n.element:n.body;return I(_r(r,F(0)),i)}case`Tquant`:return Hr(e,j({kind:`Quant`,quantifier:n.quantifier,bounds:n.names.map(e=>({name:e,level:`State`,domain:{kind:`NoDomain`}})),body:n.body},n),r);case`Lambda`:return Hr(e,j({kind:`Quant`,quantifier:`Forall`,bounds:n.params.map(e=>({name:e.name,level:`Unknown`,domain:{kind:`NoDomain`}})),body:n.body},n),r);case`SetSt`:case`Choose`:if(r.length!==1){let i=`Arity mismatch in subexpression instance.\nExpected 1 argument, but found ${r.length}.`;throw e(A(n.location,i)),new t(i,{failure:`Expr.Deref.deref_inst`})}return I(_r(r,F(0)),n.body);default:{let r=`Cannot instantiate non-binding expression`;throw e(A(n.location,r)),new t(r,{failure:`Expr.Deref.deref_inst`})}}},Ur=(e,n,r)=>{let i=(()=>{switch(r.kind){case`Quant`:case`Fcn`:case`SetOf`:return r.bounds.map(e=>({name:e.name,shape:0}));case`Tquant`:return r.names.map(e=>({name:e,shape:0}));case`Lambda`:return r.params;case`SetSt`:case`Choose`:return[{name:r.name,shape:0}];default:{let n=`Cannot abstract over bound variables in a non-binding expression`;throw e(A(r.location,n)),new t(n,{failure:`Expr.Deref.deref_at`})}}})(),a=I(Br(n,i.length),r);return[i,Hr(e,a,Vr(i.length))]},Wr=(e,n,r,i,a)=>{let o=n=>{if(!(r<=n))throw e(A(i.location,a)),new t(a,{failure:`Expr.Deref.deref_num`})},s=e=>(o(e.length),e[r-1]);if(n.kind===`With`)return Wr(e,n.expression,r,i,a);let c=(()=>{switch(n.kind){case`Sequent`:{let i=n.sequent;o(i.context.length+1);let a=i.context[r-1];if(a&&a.kind!==`Fact`){let r=`subexpression reference does not resolve to an expression`;throw e(A(n.location,r)),new t(r,{failure:`Expr.Deref.deref_num`})}let s=I(F(-(r-1)),a?a.expression:i.active);if(Rr(s))throw e(A(n.location,`subexpression of ASSUME/PROVE uses identifiers declared therein
20
+ Tlapm does not handle yet such subexpression namings.`)),new t(`Subexpression of ASSUME/PROVE uses identifiers declared therein
21
+
22
+ Tlapm does not handle yet such subexpression namings.`,{failure:`Expr.Deref.deref_num`});return s}case`Apply`:return s(n.args);case`If`:return s([n.condition,n.consequent,n.alternative]);case`List`:return s(n.items);case`SetEnum`:case`Tuple`:return s(n.elements);case`Product`:return s(n.factors);case`Let`:return o(1),n.body;case`Quant`:case`SetOf`:case`Fcn`:return s(n.bounds.flatMap(e=>e.domain.kind===`Domain`?[e.domain.expression]:[]));case`Choose`:case`SetSt`:if(!n.domain)break;return s([n.domain]);case`Arrow`:return s([n.domain,n.range]);case`FcnApp`:{let e=n.args.length===1?n.args[0]:j({kind:`Tuple`,elements:n.args},n);return s([n.function,e])}case`Rect`:case`Record`:return s(n.fields.map(e=>e.value));case`Dot`:return s([n.expression,j({kind:`String`,value:n.field},n)]);case`Except`:return s([n.function,...n.specs.map(e=>e.value)]);case`Sub`:case`Tsub`:return s([n.action,n.subscript]);case`Fair`:return s([n.subscript,n.action]);case`Case`:return s([...n.arms.map(e=>j({kind:`Tuple`,elements:[e.condition,e.body]},e.body)),...n.other?[j({kind:`Tuple`,elements:[Pr,n.other]},n.other)]:[]])}let i=`Expression has no subexpressions`;throw e(A(n.location,i)),new t(i,{failure:`Expr.Deref.deref_num`})})();if(Fr(c)){let i=`Cannot resolve subexpression reference !${r}`;throw e(A(n.location,i)),new t(i,{failure:`Expr.Deref.deref_num`})}return[n.kind===`Let`?n.definitions:[],c]},Gr=(e,t)=>{let n=e.length,r=e;for(let e=n-1;e>=0;e--)r.includes(n-e)||(r=r.map(t=>t+e<n?t:t-1));return r.map(e=>t[n-e])},Kr=(e,n,r,i,a)=>{let o=zr(r,i,[]);if(!o)return e(A(r.location,`Could not find label ${i}`)),{params:[],definitions:[],expression:Pr};let s=o.indices;if(s.length!==a.length&&a.length>0){let n=s.length===1?``:`s`,r=`Expected ${s.length} argument${n} for labelled reference !${i}, but found ${a.length}`;throw e(A(o.expression.location,r)),new t(r,{failure:`Expr.Deref.deref_lsub`})}let c=a.length===0?s.map(e=>({name:e.name,shape:0})):[],l=a.length===0?Vr(s.length):a,u=o.context.reduceRight((e,t)=>t.kind===`Defn`?j({kind:`Let`,definitions:[t.definition],body:e},e):t.kind===`Fresh`?j({kind:`Quant`,quantifier:`Forall`,bounds:[{name:t.name,level:`Constant`,domain:{kind:`NoDomain`}}],body:e},e):I(F(-1),e),o.expression),d=I(Br(n,c.length),u),f=[],p=d,m=Gr(s.map(e=>e.index),l);for(;m.length>0;)if(p.kind===`Let`&&p.definitions.length===1)f.push(p.definitions[0]),p=p.body,m=m.map(e=>I(F(1),e));else{if(p.kind!==`Quant`||p.bounds.length!==1)throw new _(`File "src/expr/e_deref.ml", line 477, characters 21-33: Assertion failed`);p=I(gr(m[0],F(0)),p.body),m=m.slice(1)}return{params:c,definitions:f,expression:p}},qr=(e,n,r,i,a)=>{if(r.kind!==`Let`)throw e(A(r.location,`not a LET expression`)),new t(`not a LET expression`,{failure:`Expr.Deref.deref_letop`});let o=r.definitions.findIndex(e=>e.kind===`Operator`&&e.name===i),s=r.definitions[o];if(!s||s.kind!==`Operator`){let n=`no definition of operator ${i}`;throw e(A(r.location,n)),new t(n,{failure:`Expr.Deref.deref_letop`})}let c=s.body,l=c.kind===`Lambda`?j({...c,body:j({kind:`Parens`,expression:c.body,form:{kind:`Xlabel`,label:i,indices:c.params.map((e,t)=>({name:e.name,index:c.params.length-t}))}},c.body)},c):j({kind:`Parens`,expression:c,form:{kind:`Xlabel`,label:i,indices:[]}},c);return Kr(e,n,j({kind:`Let`,definitions:r.definitions.slice(0,o),body:l},c),i,a)},Jr=(e,n,r,i)=>{let[a,...o]=i;if(!a){let e=r.definitions.length===0?r.expression:j({kind:`Let`,definitions:r.definitions,body:r.expression},r.expression),t=r.params.length===0?e:j({kind:`Lambda`,params:r.params,body:e},e);return{...Ir(t),isAtomic:!0}}if(r.expression.isAtomic)return e(A(r.expression.location,`Expression has no subexpressions`)),Pr;let s=n?r.expression:Lr(r.expression),c=r.definitions.length,l=(()=>{let i=(t,n)=>{let[i,a]=Wr(e,s,t,r.expression,n);return{params:[],definitions:i,expression:a,rest:o,isLabel:!1}};switch(a.kind){case`Down`:{let[r,...i]=o;if(s.kind===`Let`&&r?.kind===`Label`&&n)return{...qr(e,c,s,r.label,r.args),rest:i,isLabel:!0};if(n)return{params:[],definitions:[],expression:s,rest:o,isLabel:!1};throw new t(`!: is forbidden for this expression.
23
+ `,{failure:`Expr.Deref.deref: !:`})}case`Number`:return i(a.value,`Cannot resolve !${a.value}`);case`Left`:return i(1,`Cannot resolve !<<`);case`Right`:return i(2,`Cannot resolve !>>`);case`Instance`:return{params:[],definitions:[],expression:Hr(e,s,a.args),rest:o,isLabel:!1};case`Label`:return{...s.kind===`Let`&&!n?qr(e,c,s,a.label,a.args):Kr(e,c,s,a.label,a.args),rest:o,isLabel:!0};case`At`:{let[t,n]=Ur(e,c,s);return{params:t,definitions:[],expression:n,rest:o,isLabel:!1}}}})();return Jr(e,l.isLabel,{params:[...r.params,...l.params],definitions:[...r.definitions,...l.definitions],expression:l.expression},l.rest.map(e=>lr(e,e=>I(F(l.definitions.length),e))))},Yr=(e,t,n)=>{if(n.length>0)return{params:[],definitions:[],expression:Hr(e,t,n)};if(t.kind!==`Lambda`)return{params:[],definitions:[],expression:t};let[r,i]=Ur(e,0,t);return{params:r,definitions:[],expression:i}},Xr=(e,n,r,i)=>{let a=Jr(e,!0,Yr(e,n,r),i);if(Fr(a)){let r=`Could not resolve subexpression reference`;throw e(A(n.location,r)),new t(r,{failure:`Expr.Anon: 2`})}return a},Zr=(e,t)=>e.kind===`Apply`&&e.operator.kind===`Internal`&&t.includes(e.operator.builtin),Qr=e=>M(`UNCHANGED`,[e],e),$r=e=>M(`Eq`,[M(`Prime`,[e],e),e],e),ei=e=>{let t=e=>e.kind===`Tuple`?e.elements.flatMap(t):[e],n=t(e);return n.length===0?j({kind:`Internal`,builtin:`TRUE`},e):n.length===1?$r(n[0]):j({kind:`List`,bullet:`And`,items:n.map($r)},e)},ti=e=>t=>{let n=ti(e);return e(t,n)??mr(t,n)},ni=ti((e,t)=>e.kind===`Apply`&&Zr(e,[`Leadsto`])?M(`BoxTrue`,[M(`Implies`,[t(e.args[0]),M(`Diamond`,[t(e.args[1])],e)],e)],e):void 0),ri=ti(e=>{if(e.kind!==`Fair`)return;let t=e.action,n=e.subscript,r=M(`ENABLED`,[j({kind:`Sub`,modal:`Dia`,action:t,subscript:n},t)],t),i=e.fairness===`Weak`?`Diamond`:`BoxTrue`,a=e.fairness===`Weak`?`BoxTrue`:`Diamond`;return M(`Implies`,[M(i,[M(a,[r],t)],t),M(`BoxTrue`,[j({kind:`Tsub`,modal:`Dia`,action:t,subscript:n},t)],t)],t)}),ii=ti((e,t)=>{if(e.kind!==`Sub`&&e.kind!==`Tsub`)return;let n=t(e.action),r=t(e.subscript),i=e.modal===`Box`?M(`Disj`,[n,Qr(r)],e):M(`Conj`,[n,M(`Neg`,[Qr(r)],e)],e);return e.kind===`Sub`?i:M(e.modal===`Box`?`BoxTrue`:`Diamond`,[i],e)}),ai=ti(e=>e.kind===`Apply`&&Zr(e,[`UNCHANGED`])?ei(e.args[0]):void 0),oi=[`Prime`,`StrongPrime`,`Leadsto`,`ENABLED`,`UNCHANGED`,`Cdot`,`Actplus`,`BoxTrue`,`BoxFalse`,`Diamond`],si=/* @__PURE__ */ new WeakMap,ci=(e,t)=>{switch(t.kind){case`Fresh`:return t.level===`Constant`;case`Defn`:return t.definition.kind===`Operator`&&ui(e,t.definition.body);case`Fact`:return ui(e,t.expression);case`Flex`:return!1}},li=(e,t)=>P(e,t.map(e=>tr(e,`Constant`))),ui=(e,t)=>{let n=t=>ui(e,t);switch(t.kind){case`Ix`:{let n=Qn(e,t.index-1),r=n?.hyp;if(r?.kind===`Fresh`)return r.level===`Constant`;if(r?.kind!==`Defn`||r.definition.kind!==`Operator`||r.isConstnessUnset)return!1;let i=r.definition.body,a=si.get(i);if(a!==void 0)return a;let o=ui(n?.rest,i);return si.set(i,o),o}case`Opaque`:case`String`:case`Num`:case`At`:return!0;case`Internal`:return!oi.includes(t.builtin);case`Tquant`:case`Sub`:case`Tsub`:case`Fair`:return!1;case`Lambda`:return ui(li(e,t.params.map(e=>e.name)),t.body);case`Sequent`:{let n=t.sequent.context.reduce((e,t)=>({scope:N(e.scope,t),isGood:e.isGood&&ci(e.scope,t)}),{scope:e,isGood:!0});return n.isGood&&ui(n.scope,t.sequent.active)}case`Bang`:case`With`:case`Dot`:case`Parens`:return n(t.expression);case`Apply`:return n(t.operator)&&t.args.every(n);case`Let`:{let n=t.definitions.reduce((e,t)=>({scope:N(e.scope,or(t)),isGood:e.isGood&&t.kind===`Operator`&&ui(e.scope,t.body)}),{scope:e,isGood:!0});return n.isGood&&ui(n.scope,t.body)}case`Quant`:case`Fcn`:case`SetOf`:{let r=t.kind===`SetOf`?t.element:t.body;return t.bounds.every(e=>e.domain.kind!==`Domain`||n(e.domain.expression))&&ui(li(e,t.bounds.map(e=>e.name)),r)}case`Choose`:case`SetSt`:return(t.domain===void 0||n(t.domain))&&ui(li(e,[t.name]),t.body);case`If`:return n(t.condition)&&n(t.consequent)&&n(t.alternative);case`List`:return t.items.every(n);case`Tuple`:case`SetEnum`:return t.elements.every(n);case`Product`:return t.factors.every(n);case`FcnApp`:return n(t.function)&&t.args.every(n);case`Rect`:case`Record`:return t.fields.every(e=>n(e.value));case`Arrow`:return n(t.domain)&&n(t.range);case`Except`:return n(t.function)&&t.specs.every(e=>e.trail.every(e=>e.kind===`Dot`||n(e.expression))&&n(e.value));case`Case`:return t.arms.every(e=>n(e.condition)&&n(e.body))&&(t.other===void 0||n(t.other))}},di=(e,t,n)=>{if(ui(e,t))return!0;if(t.kind===`Internal`)return[`Eq`,`Neq`,`UNCHANGED`,`TRUE`,`FALSE`].includes(t.builtin);if(t.kind===`List`)return t.items.every(t=>di(e,t,n));if(t.kind===`Sequent`)return di(P(e,t.sequent.context),t.sequent.active,n);if(t.kind!==`Apply`)return!1;let r=t.args;return Zr(t,[`BoxTrue`,`BoxFalse`])&&n||Zr(t,[`Diamond`])&&!n?!0:r.length===1&&Zr(t,[`BoxTrue`,`BoxFalse`,`Diamond`,`Prime`])?di(e,r[0],n):r.length===1&&Zr(t,[`Neg`])?di(e,r[0],!n):r.length===2&&Zr(t,[`Conj`,`Disj`])?di(e,r[0],n)&&di(e,r[1],n):r.length===2&&Zr(t,[`Implies`])?di(e,r[0],!n)&&di(e,r[1],n):r.length===2&&Zr(t,[`Equiv`])?[!0,!1].every(t=>di(e,r[0],n!==t)&&di(e,r[1],n===t)):di(e,t.operator,n)&&r.every(t=>di(e,t,n))},fi=(e,t)=>di(e,ni(ri(ii(ai(t)))),!0)?`Always`:`Now`,pi=(e,t)=>t===`Always`&&e.some(e=>e.kind===`Fact`&&e.time===`Now`)?`Now`:t,mi=e=>e.kind===`Named`?`<${e.level}>${e.label}`:`<${e.level}>`,hi=e=>++e.value,gi={kind:`Fact`,expression:{kind:`At`,isExcept:!1},visibility:`Visible`,time:`Always`},_i={Number:`1NUM`,Down:`1DOWN`,At:`1AT`,Instance:`1INST`,Left:`1`,Right:`1`},vi={kind:`Opaque`,name:`$badexp`},yi=(e,t)=>t.location?{...e,location:t.location}:e,bi=(e,n,r)=>{let i,a=e=>({warnedSteps:[],scope:e}),o=e=>e.scope?.size??0,s=(e,t)=>{if(t.kind===`At`&&t.isExcept)return i?L(o(e)-i.size,i.expression):t;if(t.kind!==`Except`)return f(e,t);let n=s(e,t.function);return t.specs.reduce((n,r)=>{let[a,c]=$n(n,r.trail,(t,n)=>{if(n.kind===`Dot`)return[j({kind:`Dot`,expression:t,field:n.field},t),n];let r=s(e,n.expression);return[j({kind:`FcnApp`,function:t,args:[r]},t),{kind:`Apply`,expression:r}]}),l=i;i={expression:a,size:o(e)};let u=s(e,r.value);return i=l,j({kind:`Except`,function:n,specs:[{trail:c,value:u}]},t)},n)},c=(e,t,n)=>{let r=j({kind:`Ix`,index:e},n);return t.length===0?r:j({kind:`Apply`,operator:r,args:t},n)},l=(e,t,n,r,i)=>{if(t!==`Builtin`)return c(e,r,i);let a=L(e,n);return j(r.length===0?a:xr(a,r),i)},u=(e,n,i,a)=>{let o=Zn(e.scope,n);if(!o){let e=`Operator "${n}" not found`;throw r(A(a.location,e)),new t(e,{failure:`Expr.Anon: 4`})}let s=o.depth+1,u=o.hyp;switch(u.kind){case`Defn`:{let e=u.definition;if(e.kind===`Operator`)return l(s,u.whereDefined,e.body,i,a);if(e.kind===`Recursive`)throw new t(`Recursive operators not supported by TLAPS`,{failure:`Expr.Anon: Recursive`});return c(s,i,a)}case`Fresh`:return c(s,i,a);case`Flex`:return j({kind:`Ix`,index:s},a);case`Fact`:throw new _(`File "src/expr/e_anon.ml", line 230, characters 24-36: Assertion failed`)}},d=(e,n,i,a,o,c)=>{let u=Zn(e.scope,n);if(!u){let[o,...l]=a;if(o?.kind===`Label`){let t=o.args.map(t=>s(e,t));return d(e,`${n}!${o.label}`,[...i,...t],l,!0,c)}let u=`Operator "${n}" not found`;throw o&&r(A(c.location,u)),new t(u,{failure:`Expr.Anon: ${o?_i[o.kind]:`1EMPTY`}`})}let f=u.hyp;if(f.kind!==`Defn`||f.definition.kind!==`Operator`&&f.definition.kind!==`Bpragma`)throw new t(`invalid subexpression reference`);let p=u.depth+1;if(a.length===0&&o)return i.length===0?j({kind:`Ix`,index:p},c):l(p,f.whereDefined,f.definition.body,i,c);let m=yi(L(p,f.definition.body),c);return yi(Xr(r,m,i,a),c)},f=(e,t)=>{switch(t.kind){case`Bang`:{let n=t.expression;if(n.kind===`Apply`&&n.operator.kind===`Opaque`){let r=t.selectors.map(t=>lr(t,t=>s(e,t))),i=n.args.map(t=>s(e,t)),o=a(e.scope);return d(o,n.operator.name,i,r,!1,t)}return s(e,{...t,expression:j({kind:`Apply`,operator:n,args:[]},n)})}case`Apply`:{if(t.operator.kind!==`Opaque`)return y(e,t);let n=t.operator.name;if(e.warnedSteps.includes(n))return r({text:`${Kn(t.location)}Warning: ${n} does not introduce any assumptions. It does not make sense to use it here.\n`,channel:`toolbox`}),j({kind:`Internal`,builtin:`TRUE`},t);let i=t.args.map(t=>s(e,t));return u(e,n,i,t)}case`Opaque`:return s(e,j({kind:`Apply`,operator:t,args:[]},t));case`Parens`:return t.form.kind===`Syntax`?s(e,t.expression):{...t,expression:s(e,t.expression),form:p(e,t.form)};default:return y(e,t)}},p=(e,n)=>n.kind===`Nlabel`?{kind:`Xlabel`,label:n.label,indices:n.names.map(n=>{let r=Zn(e.scope,n);if(!r)throw new t(`Identifier "${n}" in label parameters not found`);return{name:n,index:r.depth+1}})}:n,m=(e,t)=>({warnedSteps:e.warnedSteps,scope:t}),h=(e,t)=>m(e,N(e.scope,t)),g=(e,t)=>m(e,P(e.scope,t.map(ir))),v=(e,t)=>{let n=cr(t,t=>s(e,t));return[g(e,n),n]},y=(e,t)=>{if(t.kind===`Sequent`)return{...t,sequent:S(e,t.sequent)[1]};if(t.kind===`Let`){let[n,r]=x(e,t.definitions);return{...t,definitions:r,body:s(n,t.body)}}return pr(e,t,s,h)},b=(e,t)=>{if(t.kind!==`Operator`)return t;let n=t.body;if(n.kind!==`Fcn`)return{...t,body:s(e,n)};let r=s(h(e,tr(t.name,`Constant`)),n);if(R(I(gr({kind:`Opaque`,name:`%%%`},F(1)),r),r))return{...t,body:L(-1,r)};let i=M(`Eq`,[j({kind:`Ix`,index:1},r),r],r);return{...t,body:j({kind:`Choose`,name:t.name,domain:void 0,body:i},r)}},x=(e,t)=>{let r=e,i=[...t],a=[];for(let e=0;e<i.length;e++){let t=i[e];if(t.kind===`Instance`){i.splice(e+1,0,...n(r.scope,t));continue}let o=b(r,t);r=h(r,{...or(o),isConstnessUnset:!0}),a.push(o)}return[r,a]},ee=(e,t)=>{let n=(()=>{switch(t.kind){case`Fresh`:return t.domain?{...t,domain:s(e,t.domain)}:t;case`Flex`:return t;case`Defn`:return{...t,definition:b(e,t.definition)};case`Fact`:{let n=s(e,t.expression);return{...t,expression:n,time:fi(e.scope,n)}}}})();return[h(e,n),n]},S=(e,t)=>{let[n,r]=$n(e,t.context,ee);return[n,{context:r,active:s(n,t.active)}]},te=(e,t)=>({warnedSteps:[mi(t),...e.warnedSteps],scope:e.scope}),C=(e,t,n,r)=>h(e,{kind:`Defn`,definition:{kind:`Operator`,name:mi(t),body:n,location:r.location},whereDefined:{kind:`Proof`,time:`Always`},visibility:`Visible`,isLocal:!0,isConstnessUnset:!0,location:r.location}),w=(e,t)=>m(e,P(e.scope,Array.from({length:t},()=>gi))),ne=e=>{let t=[...e.context.map((t,n)=>{let r=e.context.length-n+1;if(t.kind===`Fact`)return L(r,t.expression);if(t.kind!==`Fresh`||!t.domain)return vi;let i=M(`Mem`,[j({kind:`Ix`,index:0},t.domain),t.domain],t.domain);return L(r,i)}),L(1,e.active)];return t.length===1?t[0]:{kind:`Tuple`,elements:t}},re=e=>e.kind!==`Use`&&e.kind!==`Hide`&&e.kind!==`Define`,ie=(e,t)=>({facts:t.facts.map(t=>s(e,t)),defs:t.defs.flatMap(t=>{if(t.kind===`Dx`)return[t];let n=s(e,j({kind:`Opaque`,name:t.name},t));return n.kind===`Ix`?Qn(e.scope,n.index-1)?.hyp.kind===`Defn`?[{kind:`Dx`,index:n.index,location:t.location}]:(r({text:`${Kn(t.location)}${JSON.stringify(t.name)} is not a definition and cannot be used in a DEF clause.`,channel:`toolbox`}),[]):(r({text:`${Kn(t.location)}Ignored unexpandable identifier ${JSON.stringify(t.name)} in BY DEF.`,channel:`stderr`}),[])})}),T=(e,t)=>{switch(t.kind){case`Steps`:{let[n,r]=$n(e,t.steps,ae),i=T(t.step?te(n,t.step):n,t.qed.proof);return{...t,steps:r,qed:{...t.qed,proof:i}}}case`By`:return{...t,usable:ie(e,t.usable)};default:return t}},ae=(t,n)=>{let r=n.step?.kind===`Unnamed`&&re(n)?{kind:`Named`,level:n.step.level,label:`_a${hi(e)}`,isAnonymous:!0}:n.step;if(!r)throw new _;let i={...n,step:r};switch(i.kind){case`Assert`:{let[,e]=S(t,i.sequent),n=e.context.reduce(h,t),a=w(C(w(n,1),r,j(ne(e),i),i),1),o=e.context.length===0?te(a,r):a,s={...i,sequent:e,proof:T(o,i.proof)};return[w(C(t,r,j(Yn(e),i),i),1),s]}case`Pcase`:{let e=s(t,i.expression),n=j({kind:`Tuple`,elements:[L(2,e)]},i),a=w(C(w(t,2),r,n,i),1),o={...i,expression:e,proof:T(a,i.proof)},c=C(t,r,j({kind:`Tuple`,elements:[e]},i),i);return[w(c,1),o]}case`Suffices`:{let[,e]=S(t,i.sequent),n=j({kind:`Tuple`,elements:[j(Yn(e),i)]},i),a=w(C(t,r,n,i),1),o={...i,sequent:e,proof:T(a,i.proof)},s=e.context.reduce(h,t),c=j({kind:`Tuple`,elements:[j(ne(e),i)]},i);return[w(C(w(s,1),r,c,i),1),o]}case`Have`:{let e=s(t,i.expression),n=j({kind:`Tuple`,elements:[L(2,e)]},i);return[w(C(w(t,2),r,n,i),1),{...i,expression:e}]}case`Take`:{let[e,n]=v(t,i.bounds),a=j({kind:`Quant`,quantifier:`Forall`,bounds:n,body:vi},i);return[w(C(w(e,1),r,a,i),1),{...i,bounds:n}]}case`Witness`:{let e=i.expressions.map(e=>s(t,e)),n=j({kind:`Tuple`,elements:e},i);return[w(C(w(t,1),r,n,i),1),{...i,expressions:e}]}case`Pick`:{let[e,n]=v(t,i.bounds),a=s(e,i.expression),o=j({kind:`Quant`,quantifier:`Exists`,bounds:n,body:a},i),c=te(w(C(w(t,1),r,o,i),1),r),l={...i,bounds:n,expression:a,proof:T(c,i.proof)},u=g(w(t,2),n),d=L(4+n.length,o);return[w(C(w(u,2),r,d,i),1),l]}case`Use`:{let e=ie(t,i.usable);return[w(t,e.facts.length),{...i,usable:e}]}case`Hide`:return[t,{...i,usable:ie(t,i.usable)}];case`Define`:{let[e,n]=x(t,i.definitions);return[e,{...i,definitions:n}]}case`Forget`:return[t,i]}};return{expr:(e,t)=>s(a(e),t),defn:(e,t)=>b(a(e),t),sequent:(e,t)=>S(a(e),t)[1],usable:(e,t)=>ie(a(e),t),proof:(e,t)=>T(a(e),t)}},z=(e,t,n)=>({kind:`Definition`,definition:{kind:`Operator`,name:t,body:e===0?{kind:`Internal`,builtin:n}:{kind:`Lambda`,params:Array.from({length:e},(e,t)=>({name:`x${t+1}`,shape:0})),body:{kind:`Apply`,operator:{kind:`Internal`,builtin:n},args:Array.from({length:e},(t,n)=>({kind:`Ix`,index:e-n}))}}},whereDefined:`Builtin`,visibility:`Visible`,isLocal:!1}),xi=[z(0,`Nat`,`Nat`),z(2,`+`,`Plus`),z(2,`-`,`Minus`),z(2,`*`,`Times`),z(2,`^`,`Exp`),z(2,`<`,`Lt`),z(2,`>`,`Gt`),z(2,`=<`,`Lteq`),z(2,`>=`,`Gteq`),z(2,`%`,`Remainder`),z(2,`\\div`,`Quotient`),z(2,`..`,`Range`)],Si=[...xi,z(0,`Int`,`Int`),z(1,`-.`,`Uminus`)],Ci=[...Si,z(0,`Real`,`Real`),z(2,`/`,`Ratio`),z(0,`Infinity`,`Infinity`)],wi=[z(1,`Seq`,`Seq`),z(1,`Len`,`Len`),z(2,`BSeq`,`BSeq`),z(2,`\\o`,`Cat`),z(2,`Append`,`Append`),z(1,`Head`,`Head`),z(1,`Tail`,`Tail`),z(3,`SubSeq`,`SubSeq`),z(2,`SelectSeq`,`SelectSeq`)],Ti=[z(2,`Print`,`Print`),z(1,`PrintT`,`PrintT`),z(2,`Assert`,`Assert`),z(0,`JavaTime`,`JavaTime`),z(1,`TLCGet`,`TLCGet`),z(2,`TLCSet`,`TLCSet`),z(2,`:>`,`OneArg`),z(2,`@@`,`Extend`),z(1,`Permutations`,`Permutations`),z(2,`SortSeq`,`SortSeq`),z(1,`RandomElement`,`RandomElement`),z(0,`Any`,`Any`),z(1,`ToString`,`ToString`)],Ei=(e,t)=>({name:e,extendees:[],body:t,isImportant:!1,isStandard:!0}),Di=new Map([Ei(`Naturals`,xi),Ei(`Integers`,Si),Ei(`Reals`,Ci),Ei(`Sequences`,wi),Ei(`TLC`,Ti)].map(e=>[e.name,e])),Oi=e=>{let t=e.location;switch(e.kind){case`Constants`:return e.declarations.map(e=>({...tr(e.name,`Constant`,e.shape),location:t}));case`Recursives`:return e.declarations.map(e=>({kind:`Defn`,definition:{kind:`Recursive`,name:e.name,shape:e.shape,location:t},whereDefined:`User`,visibility:`Hidden`,isLocal:!1,location:t}));case`Variables`:return e.names.map(e=>({kind:`Flex`,name:e,location:t}));case`Definition`:return[{kind:`Defn`,definition:e.definition,whereDefined:e.whereDefined,visibility:e.visibility,isLocal:e.isLocal,location:t}];case`Axiom`:case`Theorem`:{let n=e.kind===`Axiom`?e.expression:j(Yn(Tr(F(-e.axiomCount),{...e.sequent,context:e.sequent.context.slice(e.axiomCount)})),e);return e.name===void 0?[rr(n,`Hidden`,`Always`,t)]:Ai(e.name,n,t)}case`Mutate`:return e.mode===`Use`?e.usable.facts.map((e,n)=>rr(L(n,e),`Visible`,`Always`,t)):[];case`Submod`:case`Anoninst`:return[]}},ki=e=>e.kind===`Axiom`||e.kind===`Theorem`?e.name===void 0?1:2:Oi(e).length,Ai=(e,t,n)=>[{kind:`Defn`,definition:{kind:`Operator`,name:e,body:t,location:n},whereDefined:`User`,visibility:`Visible`,isLocal:!1,location:n},rr({kind:`Ix`,index:1,location:n},`Hidden`,`Always`,n)],ji=e=>e.body.flatMap(e=>{switch(e.kind){case`Definition`:return[{...e,whereDefined:e.isLocal?`Builtin`:e.whereDefined}];case`Mutate`:return[];case`Theorem`:return[{...e,proof:{kind:`Omitted`,omission:`Elsewhere`,location:e.location}}];case`Submod`:return[{...e,module:{...e.module,body:ji(e.module)}}];default:return[e]}}),Mi=(e,n,r,i=/* @__PURE__ */ new Set([n.name]))=>{let a=[];for(let o of n.extendees){if(r.has(o))continue;if(i.has(o))throw new _(`Stack overflow`);let n=e.get(o);if(!n)throw new t(`Module "${o}" unknown`);a.push(...ji(Mi(e,n,r,/* @__PURE__ */ new Set([...i,o])))),r.add(o)}return{...n,body:[...a,...n.body].map(t=>t.kind===`Submod`?{...t,module:Mi(e,t.module,/* @__PURE__ */ new Set)}:t)}},Ni=e=>{let t=/* @__PURE__ */ new Map,n=(e,n)=>{t.has(e)||t.set(e,n)},r=e=>e.extendees.forEach((t,r)=>n(t,e.extendeeLocations?.[r])),i=/* @__PURE__ */ new Set,a=/* @__PURE__ */ new Map,o=e=>{typeof e==`object`&&e&&(`instance`in e&&Pi(e.instance)&&n(e.instance.module,e.instance.location),Object.values(e).forEach(o))},s=e=>{e.kind===`Submod`?(i.add(e.module.name),a.set(e.module.name,e.module),r(e.module),e.module.body.forEach(s)):o(e.kind===`Theorem`?e.sequent:e)};return e.body.forEach(s),i.forEach(e=>t.delete(e)),r(e),{dependencies:[...t.keys()].sort(Fi),locations:t,submodules:a}},Pi=e=>typeof e==`object`&&!!e&&`module`in e&&typeof e.module==`string`&&`substitutions`in e,Fi=(e,t)=>e<t?-1:+(e>t),Ii=(e,n)=>({facts:br(e,n.facts),defs:n.defs.map(n=>{if(n.kind===`Dvar`)return n;let r=I(e,{kind:`Ix`,index:n.index});if(r.kind!==`Ix`)throw new t(`substitution produced bad definition`);return{...n,index:r.index}})}),Li=(e,t)=>{switch(t.kind){case`Constants`:case`Recursives`:return[vr(t.declarations.length,e),t];case`Variables`:return[vr(t.names.length,e),t];case`Definition`:return[vr(1,e),{...t,definition:Cr(e,t.definition)}];case`Axiom`:return[vr(ki(t),e),{...t,expression:I(e,t.expression)}];case`Theorem`:return[vr(ki(t),e),{...t,sequent:Tr(e,t.sequent)}];case`Submod`:return[e,{...t,module:{...t.module,body:Ri(e,t.module.body)}}];case`Mutate`:return[t.mode===`Hide`?e:vr(t.usable.facts.length,e),{...t,usable:Ii(e,t.usable)}];case`Anoninst`:return[e,{...t,instance:{...t.instance,substitutions:t.instance.substitutions.map(t=>({name:t.name,expression:I(e,t.expression)}))}}]}},Ri=(e,t)=>$n(e,t,Li)[1],zi=(e,t,n)=>e===void 0?{hyps:[],sequent:t}:{hyps:[{kind:`Defn`,definition:{kind:`Operator`,name:e,body:j(Yn(t),{location:n}),location:n},whereDefined:{kind:`Proof`,time:`Always`},visibility:`Visible`,isLocal:!1,location:n}],sequent:Tr(F(1),t)},Bi={kind:`At`,isExcept:!1},Vi=e=>e?.kind===`Named`&&e.isAnonymous,Hi=e=>j({kind:`Internal`,builtin:`TRUE`},e),Ui=(e,t)=>t.context.flatMap((n,r)=>n.kind===`Fact`&&n.visibility===`Visible`?[L(e+t.context.length-1-r,n.expression)]:[]),Wi=(e,t,n)=>{if(!e.step)throw new _;return{kind:`Defn`,definition:{kind:`Operator`,name:mi(e.step),body:t,location:e.location},whereDefined:{kind:`Proof`,time:n},visibility:`Visible`,isLocal:!0,location:e.location}},Gi=(e,t,n,r)=>{let i=Vi(n.step)?`Visible`:`Hidden`,a=t.context.map(e=>e.kind===`Fact`?{...e,visibility:i}:e),o=j({kind:`List`,bullet:`Refs`,items:Ui(2,t)},n),s=pi(t.context,r);return{context:[...e,...a,rr(Hi(n),`Hidden`,r,n.location),Wi(n,o,s),rr(j({kind:`Ix`,index:1},n),`Hidden`,s,n.location)],active:L(3,t.active),time:s}},Ki=(e,t,n,r,i,a)=>{let o=e||Vi(i.step)?`Visible`:`Hidden`;return{context:[...t,Wi(i,j(Yn(r),i),a),rr(j({kind:`Ix`,index:1},i),o,a,i.location)],active:L(2,n)}},qi=(e,t,n)=>{if(t.kind!==`Ix`)return n;let r=e[e.length-t.index];return r?.kind===`Fact`?r.time:r?.kind===`Defn`&&typeof r.whereDefined==`object`?r.whereDefined.time:`Always`},Ji=(e,n,r)=>{if(r.kind!==`Dx`)throw new t(`Unknown definition ${r.name}`);let i=n.length-r.index,a=n[i];if(!a)return n;if(a.kind!==`Defn`)throw new t(`Indicated point is not a definition`);return n.map((t,n)=>n===i?{...a,visibility:e}:t)},Yi=(e,t)=>Jn(e,`Mem`)&&e.args[0]?.kind===`Ix`&&e.args[0].index===0&&R(t,e.args[1]),Xi=(e,n,r,i)=>{let a=!1,o=r,s=[...i];for(let e=i.length-1;e>=0;e--){o=L(-1,o);let t=i[e];t.kind===`Fact`&&R(t.expression,o)?(a=!0,s[e]={...t,visibility:n}):t.kind===`Fresh`&&t.domain&&Yi(o,t.domain)&&(a=!0,s[e]={...t,domainVisibility:n})}if(!a){let n=`This expression does not appear in the context and cannot be hidden.`;throw e(A(r.location,`${n}\n`)),new t(n,{failure:`proof.Gen.set_expr`})}return s},Zi=(e,t,n)=>({sequent:e,location:t.location,kind:n,method:t.method}),Qi={total:0,absent:[],omitted:[]},$i=(e,t)=>({total:e.total+t.total,absent:[...e.absent,...t.absent],omitted:[...e.omitted,...t.omitted]}),ea=e=>e.kind===`Use`?{...Qi,total:e.obligations?.length??0}:`proof`in e?ta(e.proof):Qi,ta=e=>e.kind===`Steps`?[...e.steps.map(ea),ta(e.qed.proof)].reduce($i):e.kind!==`Omitted`||!e.obligations||!e.location?{...Qi,total:e.obligations?.length??0}:{total:e.obligations.length,absent:e.omission===`Implicit`?[e.location]:[],omitted:e.omission===`Explicit`?[e.location]:[]},na=(e,n,r)=>{let i=(r,o,s)=>{let c=o.location;if(!c||!e.has(c.file)||c.endLine<n.start||c.startLine>n.end)return o;switch(o.kind){case`Obvious`:return{...o,obligations:[Zi(r,o,{kind:`Main`})]};case`Omitted`:return{...o,obligations:[Zi(r,o,{kind:`Omitted`,omission:o.omission})]};case`Error`:return{...o,obligations:[Zi(r,o,{kind:`Error`,message:o.message})]};case`By`:throw new t(`Proof.Gen.generate`);case`Steps`:{let[e,t]=$n({sequent:r,time:s},o.steps,(e,t)=>{let[n,r,i]=a(e.sequent,t,e.time);return[{sequent:n,time:i},r]}),n=i(e.sequent,o.qed.proof,e.time);return{...o,steps:t,qed:{...o.qed,proof:n}}}}},a=(e,n,a)=>{switch(n.kind){case`Forget`:{let t=e.context.length,r=e.context.map((e,r)=>e.kind===`Fact`&&e.visibility===`Visible`&&n.count+r<t?{...e,visibility:`Hidden`}:e);return[{...e,context:r},n,a]}case`Use`:{let r=n.usable;if(r.defs.length===0&&r.facts.length===1){let t=r.facts[0],i=Zi({...e,active:t},n,{kind:`Support`});return[{context:[...e.context,{...rr(t,`Visible`,qi(e.context,t,a),t.location),useLocation:n.useLocation}],active:L(1,e.active)},{...n,obligations:[i]},a]}if(r.facts.length>0)throw new t(`Proof.Gen.gen_step: USE with facts and definitions`);let i=r.defs.reduce((e,t)=>Ji(`Visible`,e,t),e.context);return[{...e,context:i},n,a]}case`Hide`:{let t=n.usable.defs.reduce((e,t)=>Ji(`Hidden`,e,t),e.context),i=n.usable.facts.reduceRight((e,t)=>Xi(r,`Hidden`,t,e),t);return[{...e,context:i},n,a]}case`Define`:return[{context:[...e.context,...n.definitions.map(e=>({kind:`Defn`,definition:e,whereDefined:`User`,visibility:`Visible`,isLocal:!0,location:e.location}))],active:L(n.definitions.length,e.active)},n,a];case`Assert`:{let t=Gi(e.context,n.sequent,n,a),r=i(t,n.proof,t.time),o={...n,proof:r};return[Ki(!1,e.context,e.active,n.sequent,o,a),o,a]}case`Suffices`:{let t=i(Ki(!0,e.context,e.active,n.sequent,n,a),n.proof,a),r={...n,proof:t},o=Gi(e.context,n.sequent,r,a);return[o,r,o.time]}default:throw new t(`Proof.Gen.gen_step`)}},o=(e,t,n,r)=>{let i={kind:`Unnamed`,level:0,id:0},[o,s]=a({context:e,active:{...Bi,location:r}},t===`Use`?{kind:`Use`,usable:n,isOnly:!1,location:r,step:i,useLocation:r}:{kind:`Hide`,usable:n,location:r,step:i},`Always`);return[o.context,s.obligations??[]]},s=(e,t,n,r)=>{if(n.defs.length===0&&n.facts.length===0)return[e,[]];let i=n.defs.length>0,[a,...c]=n.facts,[l,u]=o(e,t,i?{defs:n.defs,facts:[]}:{defs:[],facts:[a]},r),d=i?n.facts:c.map(e=>L(1,e)),[f,p]=s(l,t,{defs:[],facts:d},r);return[f,[...u,...p]]},c=e=>{let t=[],n=e=>{e.kind===`Steps`?(n(e.qed.proof),e.steps.forEach(r)):e.obligations&&t.push(...e.obligations)},r=e=>{e.kind===`Use`&&e.obligations&&t.push(...e.obligations),`proof`in e&&n(e.proof)};return n(e),t},l=(e,t)=>{let n=[],r=[],a=Qi,o=e;for(let e of t.body)switch(e.kind){case`Theorem`:{let t=zi(e.name,e.sequent,e.location),s=[...o,...t.hyps],l=[...s,...t.sequent.context],u=i({context:l,active:t.sequent.active},e.proof,pi(l,`Always`));n.push(...c(u));let d=ta(u);r.push({...d,location:e.location}),a=$i(a,d);let f=e.name===void 0?j(Yn(e.sequent),e):{kind:`Ix`,index:1,location:e.location};o=[...s,rr(f,`Hidden`,`Always`,e.location)];continue}case`Submod`:{let t=l(o,e.module);n.push(...t.obligations),a=$i(a,t.summary);continue}case`Mutate`:{let[t,r]=s(o,e.mode,e.usable,e.location);n.push(...r),o=t;continue}default:o=[...o,...Oi(e)]}return{obligations:n,summary:{...a,theorems:r}}};return l},ra=(e,t=0)=>({level:e,weights:Array.from({length:t},()=>!0),params:/* @__PURE__ */ new Set}),ia={TRUE:[0,0],FALSE:[0,0],Implies:[0,2],Equiv:[0,2],Conj:[0,2],Disj:[0,2],Neg:[0,1],Eq:[0,2],Neq:[0,2],STRING:[0,0],BOOLEAN:[0,0],SUBSET:[0,1],UNION:[0,1],DOMAIN:[0,1],Subseteq:[0,2],Mem:[0,2],Notmem:[0,2],Setminus:[0,2],Cap:[0,2],Cup:[0,2],Actplus:[3,2],BoxTrue:[3,1],BoxFalse:[3,1],Diamond:[3,1],Prime:[2,1],StrongPrime:[2,1],ENABLED:[1,1],UNCHANGED:[2,1],Leadsto:[3,2],Cdot:[2,2],Nat:[0,0],Int:[0,0],Real:[0,0],Infinity:[0,0],Plus:[0,2],Minus:[0,2],Times:[0,2],Ratio:[0,2],Quotient:[0,2],Remainder:[0,2],Exp:[0,2],Divides:[0,2],Lteq:[0,2],Lt:[0,2],Gteq:[0,2],Gt:[0,2],Range:[0,2],Uminus:[0,1],Seq:[0,1],Len:[0,1],BSeq:[0,2],Cat:[0,2],Append:[0,2],Head:[0,1],Tail:[0,1],SubSeq:[0,3],SelectSeq:[0,2],OneArg:[0,2],Extend:[0,2],Print:[0,2],PrintT:[0,1],Assert:[0,2],JavaTime:[0,0],TLCGet:[0,1],TLCSet:[0,2],Permutations:[0,1],SortSeq:[0,2],RandomElement:[0,1],Any:[0,0],ToString:[0,1],Unprimable:[0,1]},aa={Constant:0,State:1,Action:2,Temporal:3,Unknown:0},oa=e=>new Set(e.flatMap(e=>[...e])),sa=e=>({level:Math.max(0,...e.map(e=>e.level)),weights:[],params:oa(e.map(e=>e.params))}),ca=/* @__PURE__ */ new WeakMap,la=e=>{let t=e.hyp;switch(t.kind){case`Flex`:return ra(1);case`Fresh`:return{...ra(aa[t.level],t.shape),params:/* @__PURE__ */ new Set([t.name])};case`Defn`:{let n=t.definition;if(n.kind!==`Operator`&&n.kind!==`Bpragma`)throw new _;return pa(e.rest,n.body)}case`Fact`:return pa(e.rest,t.expression)}},ua=e=>{let t=ca.get(e);if(t)return t;let n=la(e);return ca.set(e,n),n},da=(e,t,n)=>{let r=t.flatMap(t=>t.domain.kind===`Domain`?[pa(e,t.domain.expression)]:[]);return sa([pa(P(e,t.map(ir)),n),...r])},fa=(e,n)=>{if(e.weights.length!==n.length)throw new t(`Invalid number of arguments`);let r=n.filter((t,n)=>e.weights[n]);return{level:Math.max(e.level,...r.map(e=>e.level)),weights:[],params:oa([e.params,...r.map(e=>e.params)])}},pa=(e,t)=>{let n=t=>pa(e,t);switch(t.kind){case`Ix`:{let n=Qn(e,t.index-1);if(!n)throw new _;return ua(n)}case`Internal`:{let e=ia[t.builtin];if(!e)throw new _;return ra(e[0],e[1])}case`Opaque`:case`String`:case`Num`:return ra(0);case`Lambda`:{let n=pa(P(e,t.params.map(ar)),t.body),r=new Set(t.params.map(e=>e.name));return{level:n.level,weights:t.params.map(e=>n.params.has(e.name)),params:new Set([...n.params].filter(e=>!r.has(e)))}}case`Apply`:{let e=t.operator;if(Jn(e,`Prime`)&&e.args.length===1)return n({...t,operator:e.args[0]});if(e.kind===`Opaque`)return fa(ra(0,t.args.length),t.args.map(n));if(e.kind===`Internal`&&t.args.length===1){let r=t.args[0];switch(e.builtin){case`Prime`:case`StrongPrime`:if(n(r).level>1)throw new _;return ra(2,1);case`ENABLED`:{let e=n(r);if(e.level>2)throw new _;return{level:1,weights:[],params:e.params}}case`UNCHANGED`:{let e=n(r);if(e.level>1)throw new _;return{level:2,weights:[],params:e.params}}}}return e.kind===`Internal`&&e.builtin===`Cdot`?(t.args.forEach(n),ra(2)):e.kind===`Internal`&&e.builtin===`Leadsto`?(t.args.forEach(n),ra(3,2)):fa(n(e),t.args.map(n))}case`Sequent`:{let[n,r]=$n(e,t.sequent.context,(e,t)=>{let n=N(e,t);return[n,ua(n).level]});return ra(Math.max(0,...r,pa(n,t.sequent.active).level))}case`With`:case`Dot`:case`Parens`:return n(t.expression);case`Let`:return pa(P(e,t.definitions.map(or)),t.body);case`If`:return sa([t.condition,t.consequent,t.alternative].map(n));case`List`:return sa(t.items.map(n));case`Quant`:case`Fcn`:return da(e,t.bounds,t.body);case`SetOf`:return da(e,t.bounds,t.element);case`Tquant`:return pa(P(e,t.names.map(e=>({kind:`Flex`,name:e}))),t.body),ra(3);case`Choose`:case`SetSt`:{let r=t.domain&&n(t.domain),i=t.domain?nr(t.name,t.domain):tr(t.name,`Constant`);return sa([pa(N(e,i),t.body),...r?[r]:[]])}case`SetEnum`:case`Tuple`:return sa(t.elements.map(n));case`Product`:return sa(t.factors.map(n));case`FcnApp`:return sa([t.function,...t.args].map(n));case`Arrow`:return sa([n(t.domain),n(t.range)]);case`Rect`:case`Record`:return sa(t.fields.map(e=>n(e.value)));case`Except`:return sa([n(t.function),...t.specs.flatMap(e=>[...e.trail.flatMap(e=>e.kind===`Apply`?[n(e.expression)]:[]),n(e.value)])]);case`Sub`:return{...sa([n(t.action),n(t.subscript)]),level:2};case`Tsub`:case`Fair`:return n(t.action),n(t.subscript),ra(3);case`Case`:return sa([...t.arms.flatMap(e=>[n(e.condition),n(e.body)]),...t.other?[n(t.other)]:[]]);case`Bang`:case`At`:throw new _}},ma=`EnabledWrapper`,ha=`CdotWrapper`,ga="Nested occurrence of the operator `ENABLED` found in scope of `\\cdot` when expanding `\\cdot`. Using the proof directive `ExpandENABLED` from the module `TLAPS` is expected to avoid this error.For example, writing `BY ExpandENABLED`.",_a="Nested occurrence of the operator `\\cdot` found in scope of `ENABLED` when expanding `ENABLED`. Using the proof directive `ExpandCdot` from the module `TLAPS` is expected to avoid this error.",va=`${_a} For example, writing \`BY ExpandCdot\`.`,ya=(e,t)=>pr(void 0,e,(e,n)=>t(n),()=>void 0),ba=(e,t)=>{let n=Qn(e,t-1)?.hyp;if(!n)throw new _;return n},xa=e=>e.kind===`Internal`&&(e.builtin===`ENABLED`||e.builtin===`Cdot`),Sa=e=>e.kind===`Opaque`&&(e.name===ma||e.name===ha),Ca=e=>e.kind===`Apply`&&e.args.length===1&&e.args[0].kind===`Lambda`&&(xa(e.operator)||Sa(e.operator)),wa=e=>e===void 0?2:Math.min(2,e),Ta=e=>e===void 0?void 0:Math.max(1,e-1),Ea=(e,n,r,i,a)=>{let o=(t,i=a)=>Ea(e,n,r,t,i);if(Ca(i))return i;if(i.kind===`Sub`)return{...i,action:o(i.action),subscript:o(i.subscript,Ta(a))};if(i.kind===`Apply`&&i.operator.kind===`Internal`){let t=i.operator.builtin,[r,s]=i.args;if(t===`Cdot`&&i.args.length===2){if(a!==void 0&&!e.isCdot)throw n(A(i.location,`${_a}For example, writing \`BY ExpandCdot\`.`)),new S(`Expr.Action`);return{...i,args:e.isCdot?[o(r,wa(a)),o(s,1)]:[o(r),o(s)]}}if(t===`ENABLED`&&i.args.length===1){if(a!==void 0&&!e.isEnabled)throw n(A(i.location,ga)),new S(`Expr.Action`);return{...i,args:[e.isEnabled?o(r,wa(a)):o(r)]}}if((t===`Prime`||t===`UNCHANGED`)&&i.args.length===1)return{...i,args:[o(r,Ta(a))]}}let s=i.kind===`Apply`&&i.operator.kind===`Ix`?i.operator:i;if(s.kind!==`Ix`)return pr(r,i,(t,r)=>Ea(e,n,t,r,a),N);if(a===void 0)return i;let c=pa(r,i).level,l=ba(r,s.index),u=e=>`The operator \`${e}\` is declared at:\n${Wn(l.location)}`;if(l.kind===`Fresh`&&l.level===`Unknown`)throw n(A(i.location,`Declared operator \`${l.name}\` has unknown level and occurs within the scope of \`ENABLED\` or \`\\cdot\` where soundness requires expanding expressions of level >= ${a}.\nIf a constant operator is substituted for this operator, then the expression that results from applying this declared operator has expression level ${c}.\n May need expansion. A declared operator cannot be expanded.\n${u(l.name)}\n and has arity: ${l.shape}`)),new _(`File "src/expr/e_action.ml", line 367, characters 20-26: Assertion failed`);if(c<a)return i;if(c>2||l.kind===`Fact`)throw new _;if(l.kind===`Flex`){if(i.kind!==`Ix`)throw new _;return i}if(l.kind===`Fresh`){let e=`The expression that results from applying the declared operator \`${l.name}\` has expression level ${c} within the scope of \`ENABLED\` or \`\\cdot\` where soundness requires expanding expressions of level >= ${a}. A declared operator cannot be expanded.\n${u(l.name)}\n and has level: ${aa[l.level]}\n and arity: ${l.shape}`;throw n(A(i.location,e)),new t(e)}let d=l.definition;if(d.kind!==`Operator`&&d.kind!==`Bpragma`)throw new _;if(!e.isAutoUse){let t=e.isEnabled&&e.isCdot?["the operators `ENABLED` and `\\cdot`","the proof directives `ExpandENABLED` and `ExpandCdot`"]:e.isEnabled?["the operator `ENABLED`","`ExpandENABLED` proof directive"]:["the operator `\\cdot`","`ExpandCdot` proof directive"],r=d.body.kind===`Lambda`?d.body.body:d.body,a=`Hidden definition of operator \`${d.name}\` needs expansion for soundly expanding ${t[0]} (using rigid quantification).\nThe expansion of ${t[0]} has been activated with the ${t[1]} from the module \`TLAPS\`.\nThe operator \`${d.name}\` is defined at: \n\t${Wn(r.location)}\nand the operator \`${d.name}\` occurs at: \n\t${Wn(i.location)}\nUsing the proof directive \`AutoUSE\` from the module \`TLAPS\`, or \`BY DEF ${d.name}\` is expected to avoid this error.\n`;throw n(A(i.location,a)),new S(a)}n({text:`${Gn(i.location)}[INFO]: Auto-expanding the definition of operator: ${d.name}\n`,channel:`stdout`});let f=I(F(s.index),d.body);return o(sr(i.kind===`Apply`?xr(f,i.args):f))},Da=e=>{if(e.kind===`Apply`&&e.args.length===1)return ei(e.args[0]);if(e.kind!==`Sub`)throw new _;let t=ei(e.subscript),n=e.modal===`Box`?t:M(`Neg`,[t],e);return M(e.modal===`Box`?`Disj`:`Conj`,[e.action,n],e)},Oa=e=>{let t=(e,t)=>e<<t|e>>>32-t,n=(e,n)=>{let r=Math.imul(t(Math.imul(n,3432918353),15),461845907);return Math.imul(t(e^r,13),5)+3864292196|0},r=new TextEncoder().encode(e),i=r.length-r.length%4,a=0;for(let e=0;e<i;e+=4)a=n(a,r[e]|r[e+1]<<8|r[e+2]<<16|r[e+3]<<24);let o=r.subarray(i).reduceRight((e,t)=>e<<8|t,0);return r.length>i&&(a=n(a,o)),a^=r.length,a=Math.imul(a^a>>>16,2246822507),a=Math.imul(a^a>>>13,3266489909),(a^a>>>16)&1073741823},ka=e=>{let t=Array.from({length:16},()=>[]);return e.forEach((e,n)=>{if(t[Oa(e)&t.length-1].unshift(e),n+1<=t.length*2)return;let r=Array.from({length:t.length*2},()=>[]);t.flat().forEach(e=>r[Oa(e)&r.length-1].push(e)),t=r}),t.flat()},Aa=(e,t,n,r,i,a)=>{let o=a=>Aa(e,t,n,r,i,a),s=n!==void 0||r!==void 0,c=(o,s)=>{let c={names:[],depth:Math.max(n?.depth??0,r?.depth??0)+1},[l,u]=s,d=[Aa(e,t,n,c,i,l),...u?[Aa(e,t,c,r,i,u)]:[]],f=c.names.length===0?[`r#0`]:ka(c.names);return j({kind:`Apply`,operator:o,args:[{kind:`Lambda`,params:[`_`,...f].map(e=>({name:e,shape:0})),body:d.length===1?d[0]:{kind:`List`,bullet:`And`,items:d}}]},a)};if(Ca(a))return a;if(a.kind===`Apply`&&a.operator.kind===`Internal`){let n=a.operator.builtin;if(e.isEnabled&&n===`ENABLED`&&a.args.length===1||e.isCdot&&n===`Cdot`&&a.args.length===2)return c(a.operator,a.args);if(n===`ENABLED`&&s)throw t(A(a.location,ga)),new S(`Expr.Action`);if(n===`Cdot`&&s)throw t(A(a.location,va)),new S(`Expr.Action`);if(n===`Prime`&&a.args.length===1){let n=Aa(e,t,r,void 0,i,a.args[0]);return r?n:{...a,args:[n]}}if(n===`UNCHANGED`&&s)return o(Da(a))}if(a.kind===`Sub`&&s)return o(Da(a));if(a.kind===`Ix`){if(!n)return a;let e=ba(i,a.index);if(e.kind===`Fact`)throw new _;if(e.kind!==`Flex`)return a;let t=`${e.name}#enabled#prime${n.depth}`;return n.names.includes(t)||n.names.push(t),j({kind:`Opaque`,name:t},a)}if(a.kind===`Apply`&&a.operator.kind===`Opaque`)throw t(A(a.location,`Named operator \`${a.operator.name}\` unexpected after anonymization.`)),new _(`File "src/expr/e_action.ml", line 1048, characters 12-18: Assertion failed`);return pr(i,a,(i,a)=>Aa(e,t,n,r,i,a),N)},ja=(e,t)=>{if(t.kind===`Apply`&&xa(t.operator)){let[n]=t.args;if(t.args.length!==1||n.kind!==`Lambda`)throw new _;let[r,...i]=n.params;if(r.name!==`_`)return t;let a=ja({kind:`Compose`,outer:e,inner:F(i.length)},n.body);return{kind:`Apply`,operator:t.operator,args:[{kind:`Lambda`,params:i,body:a}]}}return t.kind===`Ix`?I(e,t):t.kind===`Apply`?j(xr(ja(e,t.operator),t.args.map(t=>ja(e,t))),t):pr(e,t,ja,e=>vr(1,e))},Ma=(e,t)=>{if(t.kind===`Apply`&&xa(t.operator)){let[n]=t.args;if(t.args.length!==1||n.kind!==`Lambda`||n.params[0].name===`_`)throw new _;let r=t.operator.builtin===`Cdot`?ha:ma;return{kind:`Apply`,operator:j({kind:`Opaque`,name:r},t.operator),args:[{kind:`Lambda`,params:n.params.map((t,n)=>({name:e?t.name:`r#${n}`,shape:0})),body:Ma(e,n.body)}]}}return ya(t,t=>Ma(e,t))},Na=e=>{if(Jn(e,`Cdot`)&&e.args.length===1&&e.args[0].kind!==`Lambda`)throw new _;return ya(e,Na)},Pa=(e,t,n,r,i,a)=>{let o=Aa(i,t,void 0,void 0,n,r);return Ma(a,e.expr(n,ja(F(0),o)))},Fa={isEnabled:!0,isCdot:!0,isAutoUse:!0},Ia=(e,t,n,r,i=Fa)=>{let a=Ea(i,t,n,r,void 0);return Na(Pa(e,t,n,a,i,!1))},La=(e,t,n,r,i)=>{let a=(r,i)=>({kind:`Quant`,quantifier:`Exists`,bounds:r.map(e=>({name:e.name,level:`Constant`,domain:{kind:`NoDomain`}})),body:La(e,t,P(n,r.map(ar)),i,!0)}),o=t=>t===`ENABLED`?e.isEnabled:e.isCdot;if(r.kind===`Apply`&&r.args.length===1){let i=r.operator,[s]=r.args;if(s.kind===`Lambda`){if(i.kind===`Opaque`&&(e.isEnabled&&i.name===ma||e.isCdot&&i.name===ha))return a(s.params,s.body);if(i.kind===`Ix`&&(e.isEnabled||e.isCdot)){let e=ba(n,i.index);if(e.kind===`Defn`&&e.definition.kind===`Operator`&&(e.definition.name===ma||e.definition.name===ha))return a(s.params,s.body)}if(xa(i)&&o(i.builtin))return a(s.params,s.body)}if(xa(i)&&o(i.builtin))return La(e,t,n,s,!0)}if(Jn(r,`ENABLED`)&&i)throw t(A(r.location,ga)),new S(`Expr.Action`);if(Jn(r,`Cdot`)&&i)throw t(A(r.location,va)),new S(`Expr.Action`);return pr(n,r,(n,r)=>La(e,t,n,r,i),N)},Ra=e=>{if(e.kind===`Quant`&&e.quantifier===`Exists`){let t=e.body;if(t.kind===`List`&&t.bullet===`Or`)return Ra({...t,items:t.items.map(t=>({...e,body:t}))});if(Jn(t,`Disj`)){if(t.args.length!==2)throw new _;return Ra({...t,args:t.args.map(t=>({...e,body:t}))})}}return ya(e,Ra)},za=(e,t,n,r,i)=>{let a=Ea(i,t,n,r,void 0),o=Pa(e,t,n,a,i,!0);return Ra(La(i,t,n,o,!1))},Ba=(e,n,r,i)=>{try{let t=Ia(e.anonymizer,e.onWarning,n,{kind:`Sequent`,sequent:i});if(t.kind!==`Sequent`)throw new _;return t.sequent}catch(n){if(!(n instanceof t)||n.failure===void 0)throw n;let a=i.active.location,o=`${n.failure}\nCould not instantiate the theorem ${r===void 0?``:`named: ${r}, `}at: ${Wn(a)}`;return e.onWarning({text:`${Gn(a)}[ERROR]${o}`,channel:`stdout`}),e.onWarning({text:o,channel:`toolboxOnly`}),{context:[],active:j({kind:`Internal`,builtin:`TRUE`},i.active)}}},Va=(e,t,n)=>{if(n.kind===`Theorem`)return{...n,sequent:Ba(e,t,n.name,n.sequent)};if(n.kind!==`Definition`)return n;let r=n.definition;if(r.kind!==`Operator`&&r.kind!==`Bpragma`)return n;let i=Ia(e.anonymizer,e.onWarning,t,r.body);return{...n,definition:{...r,body:i}}},Ha=(e,t,n)=>$n(t,n,(t,n)=>{if(n.kind===`Submod`){let[r,i]=Ha(e,t,n.module.body);return[r,{...n,module:{...n.module,body:i}}]}let r=Va(e,t,n);return[P(t,Oi(r)),r]}),Ua=(e,n)=>{let r=[],i=0,a=e;for(;a.length>0;){let[e,...o]=a,s=e.kind===`Constants`?{name:e.declarations[0].name,remaining:{...e,declarations:e.declarations.slice(1)}}:e.kind===`Variables`?{name:e.names[0],remaining:{...e,names:e.names.slice(1)}}:void 0;if(s){let e=n.get(s.name);if(!e)throw new t(`Parameter ${s.name} has no substitute`);let r=ki(s.remaining)===0;a=Ri(gr(L(i,e),F(0)),r?o:[s.remaining,...o])}else r.push(e),i+=ki(e),a=o}return r},Wa=(e,t,n)=>{let r=Array.from({length:t},(e,r)=>j({kind:`Ix`,index:t-r},{location:n})),i=Array.from({length:t},(e,t)=>j({kind:`Ix`,index:t+1},{location:n})),a=Array.from({length:e},(e,i)=>{let a=j({kind:`Ix`,index:i+t+1},{location:n});return t>0?j({kind:`Apply`,operator:a,args:r},{location:n}):a});return _r([...a,...i].reverse(),F(e+t))},Ga=(e,t)=>{let n=t.map(e=>({name:e,shape:0}));return e.kind===`Lambda`?{...e,params:[...n,...e.params]}:t.length===0?e:j({kind:`Lambda`,params:n,body:e},e)},Ka=(e,n,r,i,a,o)=>{let s=e=>r===``?e:`${r}!${e}`,c=i.args.length,l=[],u=0,d=n,f=c===0,p=t=>{f||(f=!0,e.onWarning({text:t,channel:`stderr`}))};for(;d.length>0;){let[n,...r]=d;d=r;let f=e=>Ga(I(Wa(u,c,o),e),i.args);switch(n.kind){case`Definition`:{let r=n.definition;if(r.kind!==`Operator`&&r.kind!==`Bpragma`)throw new t(`Module.Elab.localize`);let i=n.isLocal?`${r.name}$${hi(e.salts)}`:r.name;l.push({...n,definition:{...r,name:s(i),body:f(r.body)},whereDefined:n.isLocal?`Builtin`:n.whereDefined,isLocal:n.isLocal||a}),u+=1;continue}case`Axiom`:{p(`${Kn(o)}Instancing produces parametric axioms.\nSuch axioms will be forcibly hidden and cannot be cited.\n(This warning appears at-most once per INSTANCE declaration.)`);let e={...n,name:n.name===void 0?void 0:s(n.name),expression:f(n.expression)};l.push(e),u+=ki(e);continue}case`Theorem`:{p(`${Gn(o)}Warning: Instancing produces parametric theorems.\nSuch theorems will be forcibly hidden and cannot be cited.\n(This warning appears at-most once per INSTANCE declaration.)`);let e=f(j(Yn(n.sequent),n));l.push({...n,name:n.name===void 0?void 0:s(n.name),sequent:e.kind===`Sequent`?e.sequent:{context:[],active:e},proof:{kind:`Omitted`,omission:`Elsewhere`,location:n.location}}),u+=1;continue}case`Mutate`:n.mode===`Use`&&(d=Ri(F(-n.usable.facts.length),d));continue;case`Submod`:continue;default:throw new t(`Module.Elab.localize`)}}return l},qa=e=>{let t=[],n=e;for(;n.length>0;){let[e,...r]=n;if(e.kind!==`Axiom`){t.push(e),n=r;continue}let i=e.location;e.name!==void 0&&t.push({kind:`Definition`,definition:{kind:`Operator`,name:e.name,body:e.expression,location:i},whereDefined:{kind:`Proof`,time:`Always`},visibility:`Visible`,isLocal:!1,location:i});let a=rr(e.name===void 0?L(1,e.expression):j({kind:`Ix`,index:2},e),`Visible`,`Always`,i),o=0,s=r.map(e=>{let t=o;if(o+=ki(e),e.kind!==`Theorem`)return e;let n=Tr(F(1),e.sequent);return{...e,sequent:{...n,context:[wr(F(t),a),...n.context]},axiomCount:e.axiomCount+1}});n=Ri(F(-1),s)}return t},Ja=e=>new Set(e.body.flatMap(e=>e.kind===`Constants`?e.declarations.map(e=>e.name):e.kind===`Variables`?e.names:[])),Ya=(e,n,r,i,a,o,s)=>{let c=n.get(i.module);if(!c)throw new t(`Module "${i.module}" unknown`);let l=Ja(c);for(let e of i.substitutions)if(!l.has(e.name))throw new t(`Parameter ${e.name} occurs in the statement \`INSTANCE ${i.module} WITH\`, and is not declared in the module ${i.module}`);let u=P(r,i.args.map(e=>tr(e,`Unknown`))),d=new Map(i.substitutions.map(e=>[e.name,e.expression]));for(let e of[...l].sort(Fi))if(!d.has(e)){if(!Zn(u,e))throw new t(`Required parameter ${e} for module ${i.module} could not be inferred.`);d.set(e,j({kind:`Opaque`,name:e},{location:s}))}let f=new Map([...d].map(([t,n])=>[t,e.anonymizer.expr(u,n)])),p=Ri(F((u?.size??0)-(c.depth??0)),c.body.map(e=>e.kind===`Theorem`?{...e,proof:{kind:`Omitted`,omission:`Implicit`,location:e.proof.location}}:e)),[,m]=Ha(e,u,p);return qa(Ka(e,Ua(m,f),o,i,a,s))},Xa=(e,n,r)=>{let i=r.instance.module;if(!e.latestModules.has(i))throw e.onWarning({text:`${Kn(r.instance.location)}Module ${JSON.stringify(i)} unknown\n`,channel:`toolbox`}),new t(`Module ${JSON.stringify(i)} unknown`,{failure:`Module.Elab.anon#defns`});let a=Ya(e,e.latestModules,n,r.instance,!0,r.name,r.location),o=[],s=a;for(;s.length>0;){let[e,...t]=s;e.kind===`Definition`?(o.push(e.definition),s=t):s=Ri(F(-ki(e)),t)}return o},Za=(e,t,n,r)=>{let i=[],a=n,o=e=>{i.push(e),a=P(a,Oi(e))},s=e=>e!==void 0&&Zn(a,e)!==void 0,c=r.body.map(e=>({unit:e,isAnonymized:!1}));for(let n=0;n<c.length;n++){let i=c[n].unit,l=(r,o,s)=>{let l=Ya(e,t,a,r,o,s,i.location);c.splice(n+1,0,...l.map(e=>({unit:e,isAnonymized:!0})))};switch(i.kind){case`Anoninst`:l(i.instance,i.isLocal,``);continue;case`Definition`:{let t=i.definition;if(t.kind===`Instance`){l(t.instance,i.isLocal,t.name);continue}let r=t.kind===`Recursive`||c[n].isAnonymized?t:e.anonymizer.defn(a,t),s={...i,definition:r};if(t.kind===`Recursive`){o(s);continue}let u=Oi(s)[0],d=Zn(a,t.name);if(d?.hyp.kind===`Defn`&&(d.hyp.definition.kind===`Recursive`||Mr(wr(F(d.depth+1),d.hyp),u))){let e=c.slice(n+1),t=Ri(gr(j({kind:`Ix`,index:d.depth+1},i),F(0)),e.map(e=>e.unit));c.splice(n+1,e.length,...e.map((e,n)=>({...e,unit:t[n]})));continue}o(s);continue}case`Recursives`:case`Constants`:case`Variables`:o(i);continue;case`Axiom`:if(s(i.name))continue;e.latestModules=new Map(t),o({...i,expression:e.anonymizer.expr(a,i.expression)});continue;case`Theorem`:{let n=s(i.name),c=n?`(redundant)${i.name}`:i.name,l=n?{kind:`Obvious`,location:i.proof.location}:i.proof;e.latestModules=new Map(t);let u=e.anonymizer.sequent(a,i.sequent),d=zi(c,u,i.location),f=P(P(a,d.hyps.map(e=>({...e,isConstnessUnset:!0}))),d.sequent.context),p=e.anonymizer.proof(f,l),m=r.isImportant?e.simplify(Xn(f),d.sequent.active,p,pi(d.sequent.context,`Always`)):p;o({...i,name:c,sequent:u,proof:m});continue}case`Mutate`:e.latestModules=new Map(t),o({...i,usable:e.anonymizer.usable(a,i.usable)});continue;case`Submod`:o({...i,module:Za(e,t,a,i.module)});continue}}let l={...r,body:i,depth:n?.size??0};return t.set(r.name,l),l},Qa=1000000010,$a=new TextEncoder,eo=e=>{for(let t=0;t<e.length;t++)if(e.charCodeAt(t)>127)return $a.encode(e).length;return e.length},to=()=>({leftTotal:-1,element:{size:-1,token:{kind:`Text`,text:``},length:0}}),no=e=>{let t={size:-1,token:{kind:`Begin`,indent:0,box:`hov`},length:0};return{queue:[t],queueStart:0,scanStack:[to(),{leftTotal:1,element:t}],formatStack:[],margin:78,maxIndent:e,spaceLeft:78,currentIndent:0,isNewLine:!0,leftTotal:1,rightTotal:1,depth:1,output:[]}},ro=(e,t)=>{e.rightTotal+=t.length,e.queue.push(t)},io=(e,t,n)=>{e.output.push(`
24
+ `),e.isNewLine=!0,e.currentIndent=Math.min(e.maxIndent,e.margin-n+t),e.spaceLeft=e.margin-e.currentIndent,e.output.push(` `.repeat(e.currentIndent))},ao=(e,t)=>{e.spaceLeft-=t,e.output.push(` `.repeat(t))},oo=e=>{let t=e.formatStack.at(-1);t?t.width>e.spaceLeft&&t.box!==`fits`&&t.box!==`h`&&io(e,0,t.width):e.output.push(`
25
+ `)},so=(e,t,n)=>{switch(n.kind){case`Text`:e.spaceLeft-=t,e.output.push(n.text),e.isNewLine=!1;return;case`Begin`:{e.margin-e.spaceLeft>e.maxIndent&&oo(e);let r=e.spaceLeft-n.indent,i=n.box===`v`||t>e.spaceLeft?n.box:`fits`;e.formatStack.push({box:i,width:r});return}case`End`:e.formatStack.pop();return;case`Newline`:{let t=e.formatStack.at(-1);t?io(e,0,t.width):e.output.push(`
26
+ `);return}case`Break`:{let r=e.formatStack.at(-1);if(!r)return;let i=r.width;switch(r.box){case`hov`:t>e.spaceLeft?io(e,n.offset,i):ao(e,n.width);return;case`b`:e.isNewLine?ao(e,n.width):t>e.spaceLeft||e.currentIndent>e.margin-i+n.offset?io(e,n.offset,i):ao(e,n.width);return;case`hv`:case`v`:io(e,n.offset,i);return;case`fits`:case`h`:ao(e,n.width);return}}}},co=e=>{for(;e.queueStart<e.queue.length;){let t=e.queue[e.queueStart],n=t.size>=0;if(!n&&e.rightTotal-e.leftTotal<e.spaceLeft)return;e.queueStart++,so(e,n?t.size:Qa,t.token),e.leftTotal+=t.length}e.queue.length=0,e.queueStart=0},lo=(e,t)=>{ro(e,t),co(e)},uo=(e,t)=>{let n=e.scanStack.at(-1);n&&(n.leftTotal<e.leftTotal?e.scanStack=[to()]:n.element.token.kind===(t?`Break`:`Begin`)&&(n.element.size=e.rightTotal+n.element.size,e.scanStack.pop()))},fo=(e,t,n)=>{ro(e,n),t&&uo(e,!0),e.scanStack.push({leftTotal:e.rightTotal,element:n})},po=(e,t,n)=>{e.depth++,fo(e,!1,{size:-e.rightTotal,token:{kind:`Begin`,indent:n,box:t},length:0})},mo=e=>{e.depth<=1||(ro(e,{size:0,token:{kind:`End`},length:0}),uo(e,!0),uo(e,!1),e.depth--)},ho=(e,t,n)=>lo(e,{size:t,token:{kind:`Text`,text:n},length:t}),go=(e,t,n)=>fo(e,!0,{size:-e.rightTotal,token:{kind:`Break`,width:t,offset:n},length:t}),_o=e=>lo(e,{size:0,token:{kind:`Newline`},length:0}),vo=e=>{for(;e.depth>1;)mo(e);return e.rightTotal=Qa,co(e),e.output.join(``)},yo=e=>{vo(e);let t=[...e.output,`
27
+ `];Object.assign(e,no(e.maxIndent)),e.output=t},bo={h:`h`,v:`v`,hv:`hv`,hov:`hov`,b:`b`},xo=e=>({kind:`Text`,text:e,size:eo(e)}),B=e=>e===``?[]:[xo(e)],So={kind:`Break`,width:1,offset:0},Co={kind:`Break`,width:0,offset:0},wo=e=>{let t=e.search(/\d|$/);return{kind:`Open`,box:bo[e.slice(0,t)],indent:Number(e.slice(t)||0)}},V=(e,...t)=>{let n=[],r=0,i=``,a=()=>{i!==``&&(n.push(xo(i)),i=``)};for(let o=0;o<e.length;o++){let s=e[o];if(s===`%`){a();let e=t[r++];typeof e==`string`?e!==``&&n.push(xo(e)):n.push(e),o++}else if(s!==`@`)i+=s;else switch(a(),e[o+1]){case`[`:{if(e[o+2]!==`<`){n.push({kind:`Open`,box:`b`,indent:0}),o++;break}let t=e.indexOf(`>`,o);n.push(wo(e.slice(o+3,t))),o=t;break}case`]`:n.push({kind:`Close`}),o++;break;case` `:n.push(So),o++;break;case`,`:n.push(Co),o++;break;case`
28
+ `:n.push({kind:`Newline`}),o++;break;case`.`:n.push({kind:`Flush`}),o++;break;case`;`:{let t=e.indexOf(`>`,o),r=e.slice(o+3,t).split(` `);n.push({kind:`Break`,width:Number(r[0]),offset:Number(r[1])}),o=t;break}case`<`:{let i=e.indexOf(`>`,o);n.push({kind:`Text`,text:String(t[r++]),size:Number(e.slice(o+2,i))}),o=i+2;break}}}return a(),n},H=(e,t,n=[xo(`,`),So])=>e.flatMap((e,r)=>r===0?[t(e)]:[n,t(e)]),To=(e,t)=>{for(let n of t)if(Array.isArray(n))To(e,n);else switch(n.kind){case`Open`:po(e,n.box,n.indent);break;case`Close`:mo(e);break;case`Text`:ho(e,n.size,n.text);break;case`Break`:go(e,n.width,n.offset);break;case`Newline`:_o(e);break;case`Flush`:yo(e)}},Eo=(e,t=68)=>{let n=no(t);return To(n,e),vo(n)},Do=[[`=>`,1,1,`InfixNon`,[]],[`<=>`,2,2,`InfixNon`,[`\\equiv`]],[`/\\`,3,3,`InfixLeft`,[`\\land`]],[`\\/`,3,3,`InfixLeft`,[`\\lor`]],[`~`,4,4,`Prefix`,[`\\neg`,`\\lnot`]],[`=`,5,5,`InfixNon`,[]],[`#`,5,5,`InfixNon`,[`/=`]],[`SUBSET`,8,8,`Prefix`,[]],[`UNION`,8,8,`Prefix`,[]],[`DOMAIN`,9,9,`Prefix`,[]],[`\\subseteq`,5,5,`InfixNon`,[]],[`\\in`,5,5,`InfixNon`,[]],[`\\notin`,5,5,`InfixNon`,[]],[`\\`,8,8,`InfixNon`,[]],[`\\cap`,8,8,`InfixLeft`,[`\\intersect`]],[`\\cup`,8,8,`InfixLeft`,[`\\union`]],[`\\X`,10,13,`Prefix`,[`\\times`]],[`'`,15,15,`Postfix`,[]],[`~>`,2,2,`InfixNon`,[`\\leadsto`]],[`ENABLED`,4,15,`Prefix`,[]],[`UNCHANGED`,4,15,`Prefix`,[]],[`\\cdot`,5,14,`InfixLeft`,[]],[`-+->`,2,2,`InfixNon`,[]],[`[]`,4,15,`Prefix`,[]],[`<>`,4,15,`Prefix`,[]],[`^`,14,14,`InfixNon`,[]],[`/`,13,13,`InfixNon`,[]],[`*`,13,13,`InfixLeft`,[]],[`-.`,12,12,`Prefix`,[`-`]],[`-`,11,11,`InfixLeft`,[]],[`+`,10,10,`InfixLeft`,[]],[`^+`,15,15,`Postfix`,[]],[`^*`,15,15,`Postfix`,[]],[`^#`,15,15,`Postfix`,[]],[`<`,5,5,`InfixNon`,[]],[`=<`,5,5,`InfixNon`,[`<=`,`\\leq`]],[`>`,5,5,`InfixNon`,[]],[`>=`,5,5,`InfixNon`,[`\\geq`]],[`...`,9,9,`InfixNon`,[]],[`..`,9,9,`InfixNon`,[]],[`|`,10,11,`InfixLeft`,[]],[`||`,10,11,`InfixLeft`,[]],[`&&`,13,13,`InfixLeft`,[]],[`&`,13,13,`InfixLeft`,[]],[`$$`,9,13,`InfixLeft`,[]],[`$`,9,13,`InfixLeft`,[]],[`??`,9,13,`InfixLeft`,[]],[`%%`,10,11,`InfixLeft`,[]],[`%`,10,11,`InfixLeft`,[`\\mod`]],[`##`,9,13,`InfixLeft`,[]],[`++`,10,10,`InfixLeft`,[]],[`--`,11,11,`InfixLeft`,[]],[`**`,13,13,`InfixLeft`,[]],[`//`,13,13,`InfixNon`,[]],[`^^`,14,14,`InfixNon`,[]],[`@@`,6,6,`InfixLeft`,[]],[`!!`,9,13,`InfixNon`,[]],[`|-`,5,5,`InfixNon`,[]],[`|=`,5,5,`InfixNon`,[]],[`-|`,5,5,`InfixNon`,[]],[`=|`,5,5,`InfixNon`,[]],[`<:`,7,7,`InfixNon`,[]],[`:>`,7,7,`InfixNon`,[]],[`:=`,5,5,`InfixNon`,[]],[`::=`,5,5,`InfixNon`,[]],[`(+)`,10,10,`InfixLeft`,[`\\oplus`]],[`(-)`,11,11,`InfixLeft`,[`\\ominus`]],[`(.)`,13,13,`InfixLeft`,[`\\odot`]],[`(/)`,13,13,`InfixNon`,[`\\oslash`]],[`(\\X)`,13,13,`InfixLeft`,[`\\otimes`]],[`\\uplus`,9,13,`InfixLeft`,[]],[`\\sqcap`,9,13,`InfixLeft`,[]],[`\\sqcup`,9,13,`InfixLeft`,[]],[`\\div`,13,13,`InfixNon`,[]],[`\\wr`,9,14,`InfixNon`,[]],[`\\star`,13,13,`InfixLeft`,[]],[`\\o`,13,13,`InfixLeft`,[`\\circ`]],[`\\bigcirc`,13,13,`InfixLeft`,[]],[`\\bullet`,13,13,`InfixLeft`,[]],[`\\prec`,5,5,`InfixNon`,[]],[`\\succ`,5,5,`InfixNon`,[]],[`\\preceq`,5,5,`InfixNon`,[]],[`\\succeq`,5,5,`InfixNon`,[]],[`\\sim`,5,5,`InfixNon`,[]],[`\\simeq`,5,5,`InfixNon`,[]],[`\\ll`,5,5,`InfixNon`,[]],[`\\gg`,5,5,`InfixNon`,[]],[`\\asymp`,5,5,`InfixNon`,[]],[`\\subset`,5,5,`InfixNon`,[]],[`\\supset`,5,5,`InfixNon`,[]],[`\\supseteq`,5,5,`InfixNon`,[]],[`\\approx`,5,5,`InfixNon`,[]],[`\\cong`,5,5,`InfixNon`,[]],[`\\sqsubset`,5,5,`InfixNon`,[]],[`\\sqsubseteq`,5,5,`InfixNon`,[]],[`\\sqsupset`,5,5,`InfixNon`,[]],[`\\sqsupseteq`,5,5,`InfixNon`,[]],[`\\doteq`,5,5,`InfixNon`,[]],[`\\propto`,5,5,`InfixNon`,[]]],Oo=/* @__PURE__ */ new Map;for(let[e,t,n,r,i]of Do){let a={name:e,low:t,high:n,fixity:r};for(let t of[e,...i])Oo.set(t,a)}const ko=e=>({name:e,low:-1,high:-1,fixity:`Nonfix`}),Ao=e=>Oo.get(e)??ko(e),jo={Implies:`=>`,Equiv:`<=>`,Conj:`/\\`,Disj:`\\/`,Neg:`~`,Eq:`=`,Neq:`#`,SUBSET:`SUBSET`,UNION:`UNION`,DOMAIN:`DOMAIN`,Subseteq:`\\subseteq`,Mem:`\\in`,Notmem:`\\notin`,Setminus:`\\`,Cap:`\\cap`,Cup:`\\cup`,Prime:`'`,StrongPrime:`'`,Leadsto:`~>`,ENABLED:`ENABLED`,UNCHANGED:`UNCHANGED`,Cdot:`\\cdot`,Actplus:`-+->`,BoxTrue:`[]`,BoxFalse:`[]`,Diamond:`<>`,Plus:`+`,Minus:`-`,Times:`*`,Ratio:`/`,Quotient:`\\div`,Remainder:`%`,Exp:`^`,Lteq:`=<`,Lt:`<`,Gteq:`>=`,Gt:`>`,Range:`..`,Cat:`\\o`,OneArg:`:>`,Extend:`@@`},Mo=e=>{if(e===`Divides`)return{name:`?|`,low:10,high:11,fixity:`InfixNon`};if(e===`Uminus`)return{...Ao(`-.`),name:`-`};let t=jo[e];return t?Ao(t):ko(e)},No=e=>e.salt===0?e.rep:`${e.rep}_${e.salt}`,Po=()=>({stack:[],idents:/* @__PURE__ */ new Map,defined:/* @__PURE__ */ new Map}),Fo=(e,t)=>{let n=e.stack[e.stack.length-t];return n&&No(n)},Io=(e,t)=>{let n=e.idents.get(t)?.at(-1),r=n?{rep:t,salt:n.salt+1}:{rep:t,salt:0};for(;e.defined.has(No(r));)r={rep:t,salt:r.salt+1};e.stack.push(r);let i=e.idents.get(t);i?i.push(r):e.idents.set(t,[r]);let a=No(r);return e.defined.set(a,(e.defined.get(a)??0)+1),a},Lo=(e,t)=>{for(let n=0;n<t;n++){let t=e.stack.pop();if(!t)return;e.idents.get(t.rep)?.pop();let n=No(t),r=(e.defined.get(n)??1)-1;r===0?e.defined.delete(n):e.defined.set(n,r)}},Ro=(e,t,n)=>{let r=n(t.map(t=>Io(e,t)));return Lo(e,t.length),r},zo=(e,t)=>t.kind===`Atm`||t.kind===`Op`&&e<t.low,Bo=e=>[V(`(`),e,V(`)`)],Vo=(e,t)=>t?Ho(e):Bo(Ho(e)),Ho=e=>{if(e.kind!==`Op`)return e.doc;let t=e.skeleton,n=t=>zo(e.high,t);switch(t.kind){case`Prefix`:case`Postfix`:{let r=t.operand,i=Vo(r,n(r)||r.kind===`Op`&&r.skeleton.kind===t.kind),a=t.kind===`Prefix`?[e.doc,i]:[i,e.doc];return[V(`@[<h>`),...a,V(`@]`)]}case`Infix`:{let r=t.left,i=t.right,a=n(r)||r.kind===`Op`&&r.name===e.name&&t.assoc===`Left`,o=n(i)||t.assoc===`Right`&&i.kind===`Op`&&i.skeleton.kind===`Infix`&&i.skeleton.assoc===`Right`;return[V(`@[<b0>`),Vo(r,a),e.doc,Vo(i,o),V(`@]`)]}}},U=e=>({kind:`Atm`,doc:e}),Uo=e=>({kind:`Big`,doc:e}),Wo=e=>e.kind===`Lambda`?Wo(e.body):e.kind===`Sequent`?Wo(e.sequent.active):e.kind===`With`,Go=e=>{if(e.kind===`Defn`){let t=e.definition,n=t.kind===`Operator`&&Wo(t.body);return e.visibility===`Hidden`||n||e.whereDefined!==`User`}return e.kind===`Fact`?e.visibility===`Hidden`||Wo(e.expression):!1},Ko=e=>e===0?[]:V(`@[<hov1>(%a)@]`,H(Array.from({length:e},()=>`_`),B)),qo=e=>V(`%s%a`,e.name,Ko(e.shape)),Jo={Constant:`CONSTANT`,State:`STATE`,Action:`ACTION`,Temporal:`TEMPORAL`,Unknown:`UNKNOWN`},Yo=(e=[])=>{let n=Po(),r=e=>Ho(u(e)),i=(e,t)=>Ro(n,e.map(e=>e.name),()=>V(`@[<b2>LAMBDA @[<hv0>%a@] :@ %a@]`,H(e,qo),r(t))),a=(e,t)=>{let i=e.map(e=>e.domain.kind===`Domain`?r(e.domain.expression):void 0);return Ro(n,e.map(e=>e.name),n=>{let r=[];return e.forEach((e,t)=>{t>0&&e.domain.kind===`Ditto`?r.at(-1)?.names.push(n[t]):r.push({names:[n[t]],index:t})}),t(H(r,t=>{let n=H(t.names,B),r=e[t.index].domain;return r.kind===`NoDomain`?n:r.kind===`Ditto`?V(`@[<hov0>%a@ \\in ??????@]`,n):V(`@[<hov0>%a@ \\in %a@]`,n,i[t.index]??[])}))})},o=e=>{switch(e.kind){case`Down`:return V(`:`);case`Left`:return V(`<<`);case`Right`:return V(`>>`);case`At`:return B(`@`);case`Number`:return B(String(e.value));case`Instance`:return V(`@[<b1>(%a)@]`,H(e.args,r));case`Label`:return e.args.length===0?B(e.label):V(`@[<b2>%s@,@[<b1>(%a)@]@]`,e.label,H(e.args,r))}},s=e=>e.length===0?[]:[V(`!`),H(e,o,V(`!`))],c=t=>{if(t<0)return`#$$${Math.abs(t)}`;if(t===0)return`#$0`;if(t<=n.stack.length)return Fo(n,t);let r=e[e.length-(t-n.stack.length)];return r?qn(r)??`??? FACT ???`:`#$${t}`},l=(e,n)=>{if(e.kind===`Lambda`)return{kind:`Op`,name:` `,doc:V(`@ `),low:20,high:20,skeleton:{kind:`Infix`,assoc:`Left`,left:Uo(i(e.params,e.body)),right:U(V(`(%a)`,H(n,r)))}};if(e.kind===`Bang`)return n.length===0?u(e):U(V(`@[<b2>%a@[<b1>(%a)@]@]`,r(e),H(n,r)));if(e.kind===`Internal`&&n.length===1){if(e.builtin===`BoxFalse`||e.builtin===`Unprimable`)return u(n[0]);if(e.builtin===`Irregular`)return U(V(`@[<h>@<1>%s%a@<1>%s@]`,`<[`,r(n[0]),`]>`))}let a=(()=>{switch(e.kind){case`Ix`:return Ao(c(e.index));case`Opaque`:{let t=Ao(e.name);return{...t,name:`?${t.name}`}}case`Internal`:return Mo(e.builtin);default:throw new t(`Cannot print this operator`)}})(),o=(e,t)=>({kind:`Op`,name:a.name,doc:e,low:a.low,high:a.high,skeleton:t});if(n.length===0)return U(B(a.name));if(a.fixity===`Nonfix`)return U(V(`@[<b2>%s@[<b1>(%a)@]@]`,a.name,H(n,r)));if(a.fixity===`Prefix`&&n.length===1)return o(/[A-Za-z]$/.test(a.name)?V(`%s@ `,a.name):B(a.name),{kind:`Prefix`,operand:u(n[0])});if(a.fixity===`Postfix`&&n.length===1)return o(B(a.name),{kind:`Postfix`,operand:u(n[0])});if(a.fixity.startsWith(`Infix`)&&n.length===2){let e=a.fixity===`InfixLeft`?`Left`:a.fixity===`InfixRight`?`Right`:`Non`;return o(a.name===`..`?B(a.name):V(`@ %s `,a.name),{kind:`Infix`,assoc:e,left:u(n[0]),right:u(n[1])})}throw new t(`Arity mismatch for operator ${a.name}`)},u=e=>{switch(e.kind){case`Ix`:case`Opaque`:case`Internal`:return l(e,[]);case`Lambda`:return Uo(i(e.params,e.body));case`Bang`:return U([r(e.expression),s(e.selectors)]);case`Apply`:return l(e.operator,e.args);case`Sequent`:return Uo(p(e.sequent));case`With`:return u(e.expression);case`If`:return Uo(V(`@[<hv2>@[<b2>IF@ %a@]@ @[<b2>THEN %a@]@ @[<b2>ELSE %a@]@]`,r(e.condition),r(e.consequent),r(e.alternative)));case`List`:{if(e.bullet===`Refs`&&e.items.length===0)return U(V(`TRUE`));if(e.bullet===`Refs`&&e.items.length===1)return u(e.items[0]);let t=e.bullet===`Or`?`\\/`:`/\\`;return Uo(V(`@[<v0>%a@]`,H(e.items,e=>V(`@[<h>%s %a@]`,t,r(e)),V(`@,`))))}case`Let`:{let t=H(e.definitions,d,V(`@,`)),i=r(e.body);return Lo(n,e.definitions.length),Uo([V(`@[<hv0>LET @[<v0>`),t,V(`@]@
29
+ IN %a@]`,i)])}case`Quant`:return a(e.bounds,t=>Uo(V(`@[<b3>%s @[<b0>%a@] :@ %a@]`,e.quantifier===`Forall`?`\\A`:`\\E`,t,r(e.body))));case`Tquant`:return Ro(n,e.names,t=>Uo(V(`@[<b4>%s @[<b0>%a@] : %a@]`,e.quantifier===`Forall`?`\\AA`:`\\EE`,H(t,B),r(e.body))));case`Choose`:{let t=e.domain&&r(e.domain);return Ro(n,[e.name],([n])=>Uo(t?V(`@[<b2>CHOOSE @[<b2>%s \\in@ %a@] :@ %a@]`,n,t,r(e.body)):V(`@[<b2>CHOOSE %s :@ %a@]`,n,r(e.body))))}case`SetSt`:{let t=r(e.domain);return Ro(n,[e.name],([n])=>U(V(`@[<b3>{@[<b2>%s \\in@ %a@] :@ %a}@]`,n,t,r(e.body))))}case`SetOf`:return a(e.bounds,t=>U(V(`@[<b3>{%a :@ %a}@]`,r(e.element),t)));case`SetEnum`:return U(V(`@[<h>{@[<b0>%a@]}@]`,H(e.elements,r)));case`Arrow`:return U(V(`@[<b3>[%a ->@ %a]@]`,r(e.domain),r(e.range)));case`Fcn`:return a(e.bounds,t=>U(V(`@[<b3>[%a |->@ %a]@]`,t,r(e.body))));case`FcnApp`:{let t=u(e.function),n=t.kind===`Atm`;return U(V(`@[<h>%s%a%s@[<b1>[%a]@]@]`,n?``:`(`,Ho(t),n?``:`)`,H(e.args,r)))}case`Product`:if(e.factors.length===1)return u(e.factors[0]);if(e.factors.length===0)throw new t(`Expr.Fmt.fmt_expr: PRODUCT []`);return{kind:`Op`,name:`\\X`,doc:V(`@ \\X `),low:10,high:13,skeleton:{kind:`Infix`,assoc:`Right`,left:u(e.factors[0]),right:u({...e,factors:e.factors.slice(1)})}};case`Tuple`:return U(V(`@[<b2><<%a>>@]`,H(e.elements,r)));case`Rect`:case`Record`:{let t=e.kind===`Rect`?`:`:`|->`;return U(V(`@[<b1>[%a]@]`,H(e.fields,e=>V(`@[<h>%s ${t} %a@]`,e.name,r(e.value)))))}case`Except`:return U(V(`@[<b3>[%a EXCEPT@ @[<v0>%a@]]@]`,r(e.function),H(e.specs,e=>V(`!@[<h>%a = %a@]`,e.trail.map(e=>e.kind===`Dot`?V(`.%s`,e.field):V(`[%a]`,r(e.expression))),r(e.value)))));case`Dot`:return{kind:`Op`,name:`.`,doc:V(`.`),low:16,high:16,skeleton:{kind:`Infix`,assoc:`Left`,left:u(e.expression),right:U(B(e.field))}};case`Sub`:case`Tsub`:{let t=e.modal===`Box`,n=e.kind===`Sub`?t?`[`:`<<`:t?`[][`:`<><<`;return U(V(`@[<h>%s@[<b2>%a@]%s%a@]`,n,r(e.action),t?`]_`:`>>_`,r(e.subscript)))}case`Fair`:return Uo(V(`@[<h>%s_%a (%a)@]`,e.fairness===`Weak`?`WF`:`SF`,Bo(r(e.subscript)),r(e.action)));case`Case`:return Uo(V(`@[<v2>CASE %a%a@]`,H(e.arms,e=>V(`@[<b2>%a ->@ %a@]`,r(e.condition),r(e.body)),V(`@,[] `)),e.other?V(`@,[] @[<b2>OTHER ->@ %a@]`,r(e.other)):[]));case`String`:return U(V(`"%s"`,e.value));case`Num`:return U(B(e.fraction===``?e.integer:`${e.integer}.${e.fraction}`));case`At`:return U(B(`@`));case`Parens`:{let t=e.form;if(t.kind===`Syntax`)return u(e.expression);let r=t.kind===`Nlabel`?t.names:t.indices.map(e=>e.index>=1&&e.index<=n.stack.length?c(e.index):`¶${e.index}`),i=u(e.expression);if(r.length===0){let e=i.kind===`Op`?`%s::(%a)`:`%s::%a`;return U(V(e,t.label,Ho(i)))}let a=H(r,B),o=i.kind===`Atm`?`%s(%a)::%a`:i.kind===`Big`?`%s(%a)::(%a)`:`(%s(%a):: %a)`;return U(V(o,t.label,a,Ho(i)))}}},d=e=>{switch(e.kind){case`Operator`:case`Bpragma`:{let t=e.body;if(t.kind===`Lambda`){let i=Ro(n,t.params.map(e=>e.name),()=>r(t.body)),a=Io(n,e.name);return V(`@[<b2>%s@[<b1>(%a)@] ==@ %a@]`,a,H(t.params,qo),i)}let i=r(t);return V(`@[<b2>%s ==@ %a@]`,Io(n,e.name),i)}case`Instance`:{let t=e.instance,i=Ro(n,t.args,e=>({doc:V(`@[<b2>INSTANCE %s%a@]`,t.module,t.substitutions.length===0?[]:V(`@ WITH@ %a`,H(t.substitutions,e=>V(`@[<b2>%s <- %a@]`,e.name,r(e.expression))))),args:e})),a=Io(n,e.name),o=t.args.length===0?B(a):V(`%s (@[<b0>%a@])`,a,H(i.args,B));return V(`@[<b2>%a == %a@]`,o,i.doc)}case`Recursive`:{let t=Io(n,e.name);return V(`@[<b2>NEW CONSTANT %s%a@]`,t,Ko(e.shape))}}},f=e=>{switch(e.kind){case`Fresh`:{let t=e.domain&&e.domainVisibility===`Visible`?r(e.domain):void 0,i=Io(n,e.name);return[V(`NEW %s %s%a`,Jo[e.level],i,Ko(e.shape)),t?V(` \\in %a`,t):[]]}case`Flex`:return V(`NEW VARIABLE %s`,Io(n,e.name));case`Defn`:return d(e.definition);case`Fact`:{let t=V(`@[<h>%a @]`,r(e.expression));return Io(n,``),t}}},p=e=>{if(e.context.length===0)return r(e.active);let t=[];for(let r of e.context)Go(r)?Io(n,qn(r)??``):t.push(f(r));let i=r(e.active);return Lo(n,e.context.length),t.length===0?i:[V(`@[<v0>ASSUME @[<v0>`),H(t,e=>e),V(`@]@
30
+ PROVE %a@]`,i)]};return{printSequent:p,printExpr:r}},Xo=(e,t)=>Yo(e).printExpr(t),Zo=e=>Yo().printSequent(e),Qo=e=>Eo(V(`@[<b0>%a@]`,Zo(e))).trimEnd(),$o=e=>({location:e.location,step:e.step,method:e.method}),es=e=>e?.level??0,ts=(e,t)=>Jn(e,t)&&e.args.length===2,ns=(e,...t)=>Eo(V(e,...t)),rs=e=>is(e).map((e,t)=>{let n=e.domain.kind===`Domain`?L(t,e.domain.expression):void 0;return{kind:`Fresh`,name:e.name,shape:0,level:n?`Constant`:e.level,domain:n,domainVisibility:`Visible`}}),is=e=>{let t={kind:`NoDomain`};return e.map(e=>e.domain.kind===`Ditto`?{...e,domain:t}:(t=e.domain,e))},as=(e,t)=>{let n=Sr(F(1),t)[1];return n[0].domain.kind===`Ditto`&&e.domain.kind===`Domain`?[{...n[0],domain:{kind:`Domain`,expression:L(1,e.domain.expression)}},...n.slice(1)]:n},os=(e,t)=>{if(t.length===0)return{kind:`Obvious`,...$o(e)};let n=t.map((t,n)=>{let r=L(2*n+2,t);return{kind:`Assert`,sequent:{context:[],active:r},proof:{kind:`By`,usable:{facts:[L(3,r)],defs:[]},isOnly:!1,location:t.location,method:e.method},location:t.location}}),r={kind:`By`,usable:{facts:[j({kind:`Ix`,index:2*t.length+2},e),...t.map((n,r)=>j({kind:`Ix`,index:2*(t.length-r)},e))],defs:[]},isOnly:!0,...$o(e),method:void 0};return{kind:`Steps`,steps:n,qed:{proof:r,location:r.location},...$o(e)}},ss=(e,t)=>e.kind===`At`&&!e.isExcept?j(sr(t),e):mr(e,e=>ss(e,t)),cs=e=>{let n=t=>({kind:`Named`,level:t,label:`_a${hi(e)}`,isAnonymous:!0}),r=(e,t)=>t?.kind===`Named`?{...t,level:e}:n(e),i=(e,t)=>{let n={...t,step:r(e,t.step)};if(n.kind!==`Steps`)return n;let o=n.steps.map(t=>a(e,t));return{...n,steps:o,qed:{...n.qed,proof:i(e+1,n.qed.proof)}}},a=(e,t)=>{let n={...t,step:r(e,t.step)};return`proof`in n?{...n,proof:i(e+1,n.proof)}:n},o=(e,n)=>{let r=n.kind===`Apply`?n.operator:n;if(r.kind===`Ix`){let i=e[e.length-r.index];if(!i)throw new t(`expose_connective`);if(i.kind!==`Defn`||i.definition.kind!==`Operator`)return n;let a=L(r.index,i.definition.body);if(n.kind!==`Apply`)return o(e,a);let s={...a,location:n.location};return o(e,j(xr(s,n.args),s))}if(Jn(n,`Prime`)){let t=o(e,n.args[0]),r=e=>M(`Prime`,[e],e);return t.kind===`Quant`?j({kind:`Quant`,quantifier:t.quantifier,bounds:cr(t.bounds,r),body:r(t.body)},n):ts(t,`Implies`)||ts(t,`Mem`)?j({kind:`Apply`,operator:t.operator,args:[r(t.args[0]),r(t.args[1])]},n):r(t)}return n.kind===`Parens`?o(e,n.expression):n},s=e=>{if(e.kind!==`Assert`)return;let t=e.sequent.active;return t.kind===`Apply`&&t.args.length===2?t.args[1]:void 0},c=e=>{if(e.kind!==`Steps`)return e;let t=[];return e.steps.forEach(e=>{let n=t.at(-1),r=n&&s(n);if(e.kind!==`Assert`||!r){t.push(e);return}let i=ss(e.sequent.active,L(2,r));t.push({...e,sequent:{...e.sequent,active:i}})}),{...e,steps:t}},l=(e,t,r,i)=>{let a=c(r);switch(a.kind){case`Obvious`:case`Omitted`:case`Error`:return a;case`By`:{let e=a.usable,t=e.defs.length===0?[]:[{kind:`Use`,usable:{facts:[],defs:e.defs},isOnly:!1,location:a.location}],r=e.facts.map((e,t)=>({kind:`Use`,usable:{facts:[L(t,e)],defs:[]},isOnly:!1,location:e.location,useLocation:a.location})),i=a.isOnly?[{kind:`Forget`,count:e.facts.length,location:a.location}]:[],o=es(a.step),s=[...t,...r,...i].map(e=>({...e,step:n(o)})),c={kind:`Obvious`,location:a.location,step:n(o),method:a.method};return{kind:`Steps`,steps:s,qed:{proof:c,location:c.location,step:c.step},location:a.location,step:a.step}}case`Steps`:{let[n,r]=$n({context:e,goal:t,time:i},a.steps,(e,t)=>{let[n,r,i,a]=u(e.context,e.goal,t,e.time);return[{context:n,goal:r,time:a},i]}),o=l(n.context,n.goal,a.qed.proof,n.time);return{...a,steps:r.flat(),qed:{...a.qed,proof:o}}}}},u=(e,n,r,i)=>{let s=es(r.step);switch(r.kind){case`Forget`:return[e,n,[r],i];case`Assert`:{let t=Gi(e,r.sequent,r,i),a={...r,proof:l(t.context,t.active,r.proof,t.time)},o=Ki(!1,e,n,r.sequent,a,i);return[o.context,o.active,[a],i]}case`Suffices`:{let t=Ki(!0,e,n,r.sequent,r,i),a={...r,proof:l(t.context,t.active,r.proof,i)},o=Gi(e,r.sequent,a,i);return[o.context,o.active,[a],o.time]}case`Use`:{let a={kind:`By`,usable:r.usable,isOnly:r.isOnly,location:r.location,step:r.step,method:r.method},o=l(e,n,a,i);if(o.kind!==`Steps`)throw new t(`simplifying BY does not produce a non-leaf proof!`);let s=r.usable.facts.map(()=>rr(Bi,`Visible`,i,r.location));return[[...e,...s],L(r.usable.facts.length,n),o.steps,i]}case`Hide`:return[r.usable.defs.reduce((e,n)=>{if(n.kind!==`Dx`)throw new t(`set_vis`);let i=e.length-n.index,a=e[i];if(a?.kind!==`Defn`){let e=a?a.kind===`Fact`?`??? FACT ???`:a.name:``;throw new t(`USE DEF ${e} invalid because ${e} is not a defined operator`)}return e.map((e,t)=>t===i?{...a,visibility:`Hidden`,location:r.location}:e)},e),n,[r],i];case`Define`:return[[...e,...r.definitions.map(e=>({kind:`Defn`,definition:e,whereDefined:{kind:`Proof`,time:i},visibility:`Visible`,isLocal:!0,location:r.location}))],L(r.definitions.length,n),[r],i];case`Have`:{let t=o(e,n),c=ts(t,`Implies`),l={context:[rr(r.expression,`Visible`,i,r.location)],active:c?L(1,t.args[1]):t},d=c?{kind:`By`,usable:{facts:[j({kind:`Ix`,index:2},r)],defs:[]},isOnly:!0,...$o(r)}:{kind:`Error`,message:ns(`@.@[<v2>@[%s@ %s@]@,%a@]@.`,`Error: this HAVE step is applied to the following goal,`,`which is not an implication:`,Xo(e,n)),...$o(r)},f=a(s,{kind:`Suffices`,sequent:l,proof:d,location:r.location,step:r.step});return u(e,n,f,i)}case`Take`:return u(e,n,a(s,f(e,n,r)),i);case`Witness`:return u(e,n,a(s,p(e,n,r)),i);case`Pcase`:{let t={kind:`Assert`,sequent:{context:[rr(r.expression,`Visible`,i,r.location)],active:L(1,n)},proof:r.proof,...$o(r)};return u(e,n,a(s,t),i)}case`Pick`:{let a=j({kind:`Quant`,quantifier:`Exists`,bounds:r.bounds,body:r.expression},r),o=d(r.step,`ex`),[s,c,l,f]=u(e,n,{kind:`Assert`,sequent:{context:[],active:a},proof:r.proof,...$o(r),step:o},i),p=L(2,a);if(p.kind!==`Quant`)throw new t(`Proof.Simplify.simplify_step/PICK`);let m=[...rs(p.bounds),rr(p.body,`Visible`,f,p.body.location)],[h,g,_,v]=u(s,c,{kind:`Suffices`,sequent:{context:m,active:L(m.length,c)},proof:{kind:`Omitted`,omission:`Elsewhere`,...$o(r)},...$o(r)},f);return[h,g,[...l,..._],v]}}},d=(t,n)=>({kind:`Named`,level:es(t),label:`${t?.kind===`Named`?t.label:`_a`}${n}${hi(e)}`,isAnonymous:!1}),f=(e,t,n)=>{let r=is(n.bounds),i=(t,n,r,a)=>{let s=a[0];if(!s)return{sideFacts:n,goal:r};let c=o(e,r);if(c.kind!==`Quant`||c.quantifier!==`Forall`||c.bounds.length===0)return ns(`@.@[<v2>@[<b0>%s@ %s@]@,%a@]@.`,`Error: this TAKE step is applied to the following goal,`,`which is not a universal formula:`,Xo(e,r));let l=c.bounds[0],u=is(c.bounds).slice(1),d=s.domain,f=l.domain;if(d.kind===`NoDomain`&&f.kind===`Domain`)return ns(`@.@[<b0>%s (%s)@ %s (%s \\in %a)@]@.`,`Error: the TAKE argument`,s.name,`does not match the pattern`,l.name,Xo(e,f.expression));if(d.kind===`Domain`&&f.kind===`NoDomain`)return ns(`@.@[<b0>%s (%s \\in %a)@ %s (%s)@]@.`,`Error: the TAKE argument`,s.name,Xo(e,d.expression),`does not match the pattern`,l.name);let p=d.kind===`Domain`&&f.kind===`Domain`&&!R(d.expression,f.expression)?[{kind:`Apply`,operator:{kind:`Internal`,builtin:`Subseteq`},args:[f.expression,d.expression]},...n]:n;if(u.length===0)return i(1,p,c.body,a.slice(1));let m=a.length===1?u.map(e=>Sr(F(t),[e])[1][0]):u;return i(t+1,p,j({kind:`Quant`,quantifier:`Forall`,bounds:m,body:c.body},c),a.slice(1))},a=i(1,[],t,r);if(typeof a==`string`)return{kind:`Suffices`,sequent:{context:[rr(Hi(t),`Visible`,`Now`,n.location)],active:t},proof:{kind:`Error`,message:a,...$o(n)},...$o(n)};let s=a.sideFacts.filter((e,t)=>a.sideFacts.findIndex(t=>R(e,t))===t),c=[j({kind:`Ix`,index:2},n),...s.map(e=>L(2,e))];return{kind:`Suffices`,sequent:{context:rs(r),active:a.goal},proof:{kind:`By`,usable:{facts:c,defs:[]},isOnly:!0,...$o(n)},...$o(n)}},p=(e,t,n)=>{let r=[],i=``,a=t;for(let t of n.expressions){let n=o(e,a);if(n.kind!==`Quant`||n.quantifier!==`Exists`||n.bounds.length===0){i||=ns(`@.@[<v2>@[<b0>%s@ %s@]@,%a@]@.`,`Error: this WITNESS step is applied to the following goal,`,`which is not an existential formula:`,Xo(e,n)),a=n;break}let[s,...c]=n.bounds,l=c.length===0?n.body:j({kind:`Quant`,quantifier:`Exists`,bounds:as(s,c),body:n.body},n),u=t;if(s.domain.kind===`Domain`){let n=s.domain.expression,a=o(e,t);if(ts(a,`Mem`)){let[e,t]=a.args,i=R(t,n)?[]:[M(`Subseteq`,[t,n],t)];r.push(...i,a),u=e}else i||=ns(`@.@[<b0>%s (%a)@ %s (%s \\in %a)@]@.`,`Error: the WITNESS argument`,Xo(e,a),`does not match the pattern`,s.name,Xo(e,n)),u=a}let d=M(`Unprimable`,[u],u);a=I(gr(d,F(0)),l)}let s=i===``?os(n,r):{kind:`Error`,message:i,...$o(n)};return{kind:`Suffices`,sequent:{context:[],active:a},proof:s,...$o(n)}};return l},ls=[`(`,`)`,`;`,`:`,`@`,`,`],us=e=>e===` `||e===`\r`||e===` `,ds=(e,t)=>{for(;t.line<e.length;){let n=e[t.line];for(;us(n[t.column]);)t.column++;if(t.column<n.length)return;t.line++,t.column=0}},fs=(e,t)=>{let n={...t};return ds(e,n),(e[n.line]??``).startsWith(`(*{`,n.column)?n:void 0},ps=(e,t)=>{let n=fs(e,t);if(!n)return;let r={line:n.line,column:n.column+3},i=[];for(ds(e,r);r.line<e.length;ds(e,r)){let t=e[r.line].slice(r.column);if(t.startsWith(`}*)`))return i;let n=/^[A-Za-z_][A-Za-z0-9_]*/.exec(t)??/^\d+(\.\d+)?/.exec(t)??/^"(\\.|[^"\\])*"/.exec(t);if(n){let e=n[0];i.push(e.startsWith(`"`)?{kind:`String`,text:JSON.parse(e)}:/^\d/.test(e)?{kind:`Number`,text:e}:{kind:`Ident`,text:e}),r.column+=e.length}else{if(!ls.includes(t[0]))return;i.push({kind:`Punct`,text:t[0]}),r.column++}}},ms=(e,t)=>e?.kind===`Punct`&&e.text===t,hs=e=>e?.kind===`String`?{kind:`String`,value:e.text}:e?.kind===`Number`?{kind:`Float`,value:Number.parseFloat(e.text)}:ms(e,`@`)?{kind:`Default`}:void 0,gs=/* @__PURE__ */ new Map([[`smt`,`smt`],[`cvc3`,`cvc4`],[`yices`,`yices`],[`z3`,`z3`],[`cooper`,`cooper`],[`presburger`,`cooper`],[`fail`,`fail`],[`smt2lib`,`smt`],[`smt2z3`,`z3`],[`smt3`,`smt`],[`z33`,`z3`],[`cvc33`,`cvc4`],[`yices3`,`yices`],[`verit`,`verit`],[`zipper`,`zipper`],[`spass`,`spass`],[`tptp`,`tptp`],[`ls4`,`ls4`],[`expandenabled`,`expandenabled`],[`expandcdot`,`expandcdot`],[`autouse`,`autouse`],[`lambdify`,`lambdify`],[`enabledaxioms`,`enabledaxioms`],[`levelcomparison`,`levelcomparison`],[`trivial`,`trivial`]]),_s=(e,t)=>{let n=ps(e,t);if(!n)return;let r=0,i=()=>{let e=n[r];return e?.kind===`Number`?(r++,{timeout:Number.parseFloat(e.text)}):{}},a=()=>{if(!ms(n[r],`(`))return;r++;let e=n[r++];if(e?.kind!==`Ident`)return;let t=(()=>{if(e.text===`isabelle`){let t=n[r];return t?.kind===`String`?(r++,{name:e.text,tactic:t.text,...i()}):void 0}if(e.text===`zenon`){let t=i();return ms(n[r],`(`)&&!a()?void 0:{name:e.text,...t}}let t=gs.get(e.text);return t===void 0?void 0:{name:t}})();if(t&&ms(n[r],`)`))return r++,t};if(n[r]?.kind!==`Ident`||n[r++].text!==`by`)return;let o=a();return r===n.length?o:void 0},vs=(e,t)=>{let n=ps(e,t);if(!n)return;let r=0,i=[];for(;r<n.length;){let e=n[r++];if(e.kind!==`Ident`||e.text!==`by`&&e.text!==`set`||!ms(n[r],`(`))return;r++;let t=[];for(;;){let e=n[r++];if(e?.kind!==`Ident`||!ms(n[r],`:`))return;r++;let i=hs(n[r++]);if(!i)return;if(t.push({hint:e.text,value:i}),ms(n[r],`)`))break;if(!ms(n[r],`;`))return;r++}r++,i.push(t)}return i},ys=e=>({kind:`Opaque`,name:e}),bs=e=>({kind:`Tuple`,elements:e.map(ys)}),xs=(e,t)=>({kind:`Apply`,operator:{kind:`Internal`,builtin:`Eq`},args:[e,t]}),Ss=e=>e.map(e=>({name:e,level:`Constant`,domain:{kind:`NoDomain`}})),Cs=(e,t)=>e?.kind===`Product`&&e.factors.length===t.length?e.factors:void 0,ws=(e,t)=>t.map((t,n)=>({kind:`Operator`,name:t,body:{kind:`FcnApp`,function:ys(e),args:[{kind:`Num`,integer:String(n+1),fraction:``}]}})),Ts=(e,t)=>e.map((e,n)=>({name:e,level:`Constant`,domain:{kind:`Domain`,expression:t[n]}})),Es=e=>({name:e.name,level:`Constant`,domain:e.domain}),Ds=(e,t,n)=>{let r=[];return t.forEach(e=>{e.kind===`Name`&&e.domain.kind===`Ditto`?r.at(-1)?.push(e):r.push([e])}),r.reduceRight((t,n)=>{let r=(n,r=t)=>({kind:`Quant`,quantifier:e,bounds:n,body:r,location:t.location}),i=n[0];if(i.kind===`Name`)return r(n.flatMap(e=>e.kind===`Name`?[Es(e)]:[]));let a=Cs(i.domain,i.names);if(a)return r(Ts(i.names,a));let o={kind:`Apply`,operator:{kind:`Internal`,builtin:e===`Exists`?`Mem`:`Notmem`},args:[bs(i.names),i.domain]};return r(Ss(i.names),{kind:`List`,bullet:e===`Exists`?`And`:`Or`,items:[o,t]})},n)},Os=(e,t,n)=>{let r=`${e.kind.toLowerCase()}#${t[0]}`;return{...e,name:r,body:Cs(e.domain,t)?{kind:`Let`,definitions:ws(r,t),body:n}:{kind:`Quant`,quantifier:`Exists`,bounds:Ss(t),body:{kind:`List`,bullet:`And`,items:[xs(ys(r),bs(t)),n]}}}},ks=(e,t,n)=>{let r=e.map(e=>{if(e.kind===`Name`)return{bounds:[Es(e)],definitions:[]};let t=Cs(e.domain,e.names);if(t&&n)return{bounds:Ts(e.names,t),definitions:[]};let r=`fcn#${e.names[0]}`,i={name:r,level:`Constant`,domain:{kind:`Domain`,expression:e.domain}};if(t)return{bounds:[i],definitions:ws(r,e.names)};let a=`choose#${r}`;return{bounds:[i],definitions:[{kind:`Operator`,name:a,body:Os({kind:`Choose`,domain:void 0},e.names,xs(ys(r),bs(e.names)))},...ws(a,e.names)]}}),i=r.flatMap(e=>e.definitions);return{bounds:r.flatMap(e=>e.bounds),value:i.length===0?t:{kind:`Let`,definitions:i,body:t}}},As=(e,t)=>{let n=ks(t,e,!0);return{kind:`SetOf`,element:n.value,bounds:n.bounds}},js=(e,t)=>{let n=ks(e,t,!1);return{kind:`Fcn`,bounds:n.bounds,body:n.value}},Ms={Always:`[]`,Eventually:`<>`,Enabled:`ENABLED`,Unchanged:`UNCHANGED`},Ns=(e,t)=>e!==void 0&&t!==void 0&&e.line===t.line&&e.column===t.column,Ps=e=>e.location.range?.start,Fs=e=>e.location.range?.end,Is=(e,t)=>{let n=e.location.range;return n&&t?{...e,location:{...e.location,range:{...n,end:t}}}:e},Ls=e=>{if(e.kind===`Apply`){let t=Ao(e.operator),n=e.args.length===2&&t.fixity.startsWith(`Infix`),r=e.args.length===1&&t.fixity===`Prefix`;if(!n&&!r)return;let i=e.args.length-1;return{operator:t,isInfix:n,operand:e.args[i],replace:t=>({...e,args:[...e.args.slice(0,i),t]})}}let t=Ms[e.kind];if(t!==void 0&&`expression`in e)return{operator:Ao(t),isInfix:!1,operand:e.expression,replace:t=>({...e,expression:t})}},Rs=(e,t)=>e.high<t.low,zs=e=>{let t=Ao(e.operator),[n,r]=e.args,i=Fs(e),a=t=>{let n=e.location.range,i=Ps(t);return{...e,args:[t,r],location:n&&i?{...e.location,range:{...n,start:i}}:e.location}},o=(e,n)=>{let r=n?Ls(e):void 0;if(!r)return{kind:`Reduced`,isFinal:!1};let s=o(r.operand,Ns(Fs(r.operand),Fs(e)));return s.kind===`Attached`?{kind:`Attached`,expression:Is(r.replace(s.expression),i)}:!s.isFinal&&(Rs(t,r.operator)||r.isInfix&&t.fixity===`InfixLeft`&&r.operator.fixity===`InfixLeft`&&!Rs(r.operator,t))?{kind:`Reduced`,isFinal:!Rs(t,r.operator)}:{kind:`Attached`,expression:Is(r.replace(a(r.operand)),i)}},s=o(n,Ns(Ps(n),Ps(e)));return s.kind===`Attached`?s.expression:e},Bs={"=>":`Implies`,"<=>":`Equiv`,"/\\":`Conj`,"\\/":`Disj`,"~":`Neg`,"=":`Eq`,"#":`Neq`,SUBSET:`SUBSET`,UNION:`UNION`,DOMAIN:`DOMAIN`,"\\subseteq":`Subseteq`,"\\in":`Mem`,"\\notin":`Notmem`,"\\":`Setminus`,"\\cap":`Cap`,"\\cup":`Cup`,"'":`Prime`,"~>":`Leadsto`,ENABLED:`ENABLED`,UNCHANGED:`UNCHANGED`,"\\cdot":`Cdot`,"-+->":`Actplus`,"[]":`BoxTrue`,"<>":`Diamond`,TRUE:`TRUE`,FALSE:`FALSE`,BOOLEAN:`BOOLEAN`,STRING:`STRING`},Vs=e=>Ao(e).name,Hs=/^<(\d+|\*|\+)>([A-Za-z0-9_]*)\.*$/,Us=(e,t)=>{if(!e||!t)return e??t;let n=e.startLine<t.startLine||e.startLine===t.startLine&&e.startColumn<=t.startColumn,r=e.endLine>t.endLine||e.endLine===t.endLine&&e.endColumn>=t.endColumn;return{file:e.file,startLine:n?e.startLine:t.startLine,startColumn:n?e.startColumn:t.startColumn,endLine:r?e.endLine:t.endLine,endColumn:r?e.endColumn:t.endColumn}},Ws="use instead the class`E_visit.iter_concrete`",Gs=(e,t)=>t>0&&e[t-1].set===e[t].set,Ks=(e,n,r,i)=>{let a=n.split(`
31
+ `),o=t=>({file:e,startLine:t.start.line,startColumn:t.start.column,endLine:t.end.line,endColumn:t.end.column+1}),s=e=>{let t=fs(a,{line:e.endLine-1,column:e.endColumn-1});if(!t)return e;for(let n=t.line;n<a.length;n++){let r=a[n].indexOf(`}*)`,n===t.line?t.column:0);if(r!==-1)return{...e,endLine:n+1,endColumn:r+4}}return e},c=e=>e&&_s(a,{line:e.end.line-1,column:e.end.column}),l=e=>{let t=c(e),n=o(e);return t?{location:s(n),method:t}:{location:n}},u=(e,t)=>{let n=c(t);return n?j({kind:`With`,expression:e,method:n},e):e},d=(t,n)=>({file:e,startLine:t.line,startColumn:t.column,endLine:t.line,endColumn:t.column+n}),f=e=>e.range?o(e.range):d(e,1),p=(e,t)=>{let n=Vs(e),r=Bs[n];return j(r?{kind:`Internal`,builtin:r}:{kind:`Opaque`,name:n},{location:t})},m=(e,t,n,r)=>{if(e.startsWith(`<`)){let t=j({kind:`Opaque`,name:e},{location:n});return j({kind:`Bang`,expression:t,selectors:[]},{location:n})}let i=Bs[e];if(i&&t.length===0)return j({kind:`Internal`,builtin:i},{location:n});let a=e.split(`!`);if(a.length===1){let r=j({kind:`Opaque`,name:e},{location:n});return t.length===0?r:j({kind:`Apply`,operator:r,args:t},{location:n})}let o=r??a.map((e,n)=>n===a.length-1?t.length:0),s=o.map((e,t)=>o.slice(0,t).reduce((e,t)=>e+t,0)),c=e=>t.slice(s[e],s[e]+o[e]),l=j({kind:`Opaque`,name:a[0]},{location:n});return j({kind:`Bang`,expression:o[0]===0?l:j({kind:`Apply`,operator:l,args:c(0)},{location:n}),selectors:a.slice(1).map((e,t)=>({kind:`Label`,label:Vs(e),args:c(t+1)}))},{location:n})},h=(e,n)=>e.map((r,i)=>{if(r.pattern.kind===`Tuple`)throw new t(`Unexpected tuple declaration`,{failure:Ws});return{name:r.pattern.name,level:`Constant`,domain:Gs(e,i)?{kind:`Ditto`}:{kind:`Domain`,expression:b(r.set,n)}}}),g=(e,t)=>e.map((n,r)=>{let i=b(n.set,t);return n.pattern.kind===`Tuple`?{kind:`Tuple`,names:n.pattern.names,domain:i}:{kind:`Name`,name:n.pattern.name,domain:Gs(e,r)?{kind:`Ditto`}:{kind:`Domain`,expression:i}}}),_=(e,n)=>{if(!i)throw new t(`Unexpected tuple declaration`,{failure:Ws});return j(e,{location:n})},y=e=>e.some(e=>e.pattern.kind===`Tuple`),b=(e,n)=>{let r=f(e.location),i=e=>b(e,n),o=(e,t)=>e.length===2?Us(e[0].location,e[1].location):e.length!==1||!e[0].location?r:t===`Prefix`?Us({...r,endLine:r.startLine,endColumn:r.startColumn+1},e[0].location):t===`Postfix`?Us({...r,startLine:r.endLine,startColumn:r.endColumn-1},e[0].location):r,s=(e,t)=>j({kind:`Apply`,operator:{kind:`Internal`,builtin:e},args:[t]},{location:o([t],`Prefix`)});switch(e.kind){case`Number`:return j({kind:`Num`,integer:e.text??String(e.value),fraction:``},{location:r});case`Decimal`:{let[t,n]=e.text.split(`.`);return j({kind:`Num`,integer:t,fraction:n},{location:r})}case`String`:{let t=/"((?:[^"\\]|\\.)*)"$/.exec((a[r.endLine-1]??``).slice(0,r.endColumn-1));return j({kind:`String`,value:t?.[1]??e.value},{location:r})}case`Identifier`:return m(e.name,[],r);case`Apply`:{if(e.args.length===2){let t=zs(e);if(t!==e)return i(t)}let t=e.args.map(i),n=Ao(e.operator);return n.fixity===`Nonfix`?m(e.operator,t,r,e.argumentCounts):j({kind:`Apply`,operator:p(e.operator,void 0),args:t},{location:o(t,n.fixity)})}case`OperatorReference`:return p(e.operator,r);case`Lambda`:return j({kind:`Lambda`,params:e.params.map(e=>({name:e,shape:0})),body:i(e.body)},{location:r});case`And`:case`Or`:{let t=e.operands.map(i);if(e.isBulleted)return j({kind:`List`,bullet:e.kind,items:t},{location:r});let n=e.kind===`And`?`Conj`:`Disj`;return t.reduce((e,t)=>j({kind:`Apply`,operator:{kind:`Internal`,builtin:n},args:[e,t]},{location:Us(e.location,t.location)}))}case`Prime`:{let t=i(e.expression);return j({kind:`Apply`,operator:{kind:`Internal`,builtin:`Prime`},args:[t]},{location:o([t],`Postfix`)})}case`Unchanged`:return s(`UNCHANGED`,i(e.expression));case`Enabled`:return s(`ENABLED`,i(e.expression));case`If`:return j({kind:`If`,condition:i(e.condition),consequent:i(e.consequent),alternative:i(e.alternative)},{location:r});case`Case`:return j({kind:`Case`,arms:e.arms.map(e=>({condition:i(e.condition),body:i(e.body)})),other:e.other&&i(e.other)},{location:r});case`Let`:return j({kind:`Let`,definitions:[...e.definitions,...e.instances??[]].sort((e,t)=>e.location.line-t.location.line||e.location.column-t.location.column).map(e=>ee(e,n)),body:i(e.body)},{location:r});case`Forall`:case`Exists`:return y(e.bounds)?_(Ds(e.kind,g(e.bounds,n),i(e.body)),r):j({kind:`Quant`,quantifier:e.kind,bounds:h(e.bounds,n),body:i(e.body)},{location:r});case`UnboundedQuantifier`:{let t=i(e.body),n=e.quantifier;return e.isTemporal?j({kind:`Tquant`,quantifier:n,names:e.names,body:t},{location:r}):j({kind:`Quant`,quantifier:n,bounds:Ss(e.names),body:t},{location:r})}case`Choose`:return e.pattern.kind===`Tuple`?_(Os({kind:`Choose`,domain:e.set&&i(e.set)},e.pattern.names,i(e.body)),r):j({kind:`Choose`,name:e.pattern.name,domain:e.set&&i(e.set),body:i(e.body)},{location:r});case`SetEnumeration`:return j({kind:`SetEnum`,elements:e.elements.map(i)},{location:r});case`SetFilter`:return e.bound.pattern.kind===`Tuple`?_(Os({kind:`SetSt`,domain:i(e.bound.set)},e.bound.pattern.names,i(e.predicate)),r):j({kind:`SetSt`,name:e.bound.pattern.name,domain:i(e.bound.set),body:i(e.predicate)},{location:r});case`SetMap`:return y(e.bounds)?_(As(i(e.expression),g(e.bounds,n)),r):j({kind:`SetOf`,element:i(e.expression),bounds:h(e.bounds,n)},{location:r});case`Tuple`:return j({kind:`Tuple`,elements:e.elements.map(i)},{location:{...r,startLine:r.endLine,startColumn:r.endColumn-2}});case`FunctionConstruction`:return y(e.bounds)?_(js(g(e.bounds,n),i(e.body)),r):j({kind:`Fcn`,bounds:h(e.bounds,n),body:i(e.body)},{location:r});case`FunctionSet`:return j({kind:`Arrow`,domain:i(e.domain),range:i(e.range)},{location:r});case`Record`:case`RecordSet`:return j({kind:e.kind===`Record`?`Record`:`Rect`,fields:e.fields.map(e=>({name:e.name,value:i(e.value)}))},{location:r});case`Except`:return j({kind:`Except`,function:i(e.function),specs:e.updates.map(e=>({trail:e.path.map(e=>e.kind===`Field`?{kind:`Dot`,field:e.name}:{kind:`Apply`,expression:e.args.length===1?i(e.args[0]):{kind:`Tuple`,elements:e.args.map(i)}}),value:b(e.value,!0)}))},{location:r});case`ExceptAt`:return j({kind:`At`,isExcept:n},{location:r});case`Bracket`:throw new t(`Unexpected [ without a function or subscript`);case`FunctionApplication`:return j({kind:`FcnApp`,function:i(e.function),args:e.args.map(i)},{location:r});case`FieldAccess`:return j({kind:`Dot`,expression:i(e.record),field:e.field},{location:r});case`Product`:return j({kind:`Product`,factors:e.factors.map(i)},{location:r});case`Always`:case`Eventually`:{let t=e.expression;return e.kind===`Always`&&t.kind===`BoxAction`?j({kind:`Tsub`,modal:`Box`,action:i(t.action),subscript:i(t.subscript)},{location:r}):e.kind===`Eventually`&&t.kind===`AngleAction`?j({kind:`Tsub`,modal:`Dia`,action:i(t.action),subscript:i(t.subscript)},{location:r}):s(e.kind===`Always`?`BoxTrue`:`Diamond`,i(t))}case`BoxAction`:case`AngleAction`:return j({kind:`Sub`,modal:e.kind===`BoxAction`?`Box`:`Dia`,action:i(e.action),subscript:i(e.subscript)},{location:r});case`WeakFairness`:case`StrongFairness`:return j({kind:`Fair`,fairness:e.kind===`WeakFairness`?`Weak`:`Strong`,subscript:i(e.subscript),action:i(e.action)},{location:r});case`Label`:return j({kind:`Parens`,expression:i(e.body),form:{kind:`Nlabel`,label:e.name,names:e.params}},{location:r});case`Subexpression`:{let[n,...a]=e.selectors;if(n.kind!==`Name`)throw new t(`Unexpected subexpression reference`);let o=j({kind:`Opaque`,name:n.name},{location:r}),s=n.args.length===0?o:j({kind:`Apply`,operator:o,args:n.args.map(i)},{location:r});return j({kind:`Bang`,expression:s,selectors:a.map(e=>{switch(e.kind){case`Name`:return{kind:`Label`,label:Vs(e.name),args:e.args.map(i)};case`Operand`:return e.operand===`<<`?{kind:`Left`}:e.operand===`>>`?{kind:`Right`}:{kind:`Number`,value:e.operand};case`Bound`:return{kind:`Instance`,args:e.args.map(i)};case`At`:return{kind:`At`};case`Colon`:return{kind:`Down`}}})},{location:r})}}},x=e=>({location:o(e.definitionRange??e.instanceRange),args:e.params.map(e=>e.name),module:e.module,substitutions:e.substitutions.map(e=>({name:Vs(e.name),expression:b(e.expression,!1)}))}),ee=(e,n=!1)=>{let r=f(e.location);if(e.kind===`Instance`){if(e.name===void 0)throw new t(`Unexpected keyword INSTANCE`);return{kind:`Instance`,name:e.name,instance:x(e),location:r}}let i=e.kind===`Operator`&&e.params.length===1&&e.name===`-`?`-.`:Vs(e.name),o=b(e.body,n);if(e.kind===`Function`&&y(e.bounds))return{kind:`Operator`,name:i,body:_(js(g(e.bounds,n),o),r),location:r};if(e.kind===`Function`){let t=h(e.bounds,n);return{kind:`Operator`,name:i,body:j({kind:`Fcn`,bounds:t,body:o},{location:r}),location:r}}let s=e.params.length===0?o:j({kind:`Lambda`,params:e.params.map(e=>({name:Vs(e.name),shape:e.arity,...e.location&&{location:d(e.location,e.name.length)}})),body:o},{location:r}),c=e.location.range?.end,l=c&&vs(a,{line:c.line-1,column:c.column});return l?{kind:`Bpragma`,name:i,body:s,methods:l,location:r}:{kind:`Operator`,name:i,body:s,location:r}},S=e=>{let t=f(e.location);return e.level===`Variable`?{kind:`Flex`,name:e.name,location:t}:{kind:`Fresh`,name:e.name,shape:e.arity,level:e.level,domain:e.set&&b(e.set,!1),domainVisibility:`Visible`,location:t}},te=e=>e.kind===`AssumeProve`?{context:e.assumptions.map(e=>{if(e.kind===`NewSymbol`)return S(e);let t=e.kind===`AssumeProve`?j({kind:`Sequent`,sequent:te(e)},{location:f(e.location)}):C(e);return rr(t,`Visible`,`Now`,t.location)}),active:b(e.conclusion,!1)}:{context:[],active:b(e,!1)},C=e=>{if(e.kind!==`Label`||e.params.length>0)return b(e,!1);let t=f(e.location);return j({kind:`Parens`,expression:b(e.body,!1),form:{kind:`Xlabel`,label:e.name,indices:[]}},{location:t})},w=e=>{if(e.kind===`ModuleFact`)throw new v(`MODULE facts in proof obligations are not supported`);let t=b(e,!1);return t.kind===`Bang`&&t.selectors.length===0?t.expression:t},ne=e=>{let t=f(e.location);if(e.kind===`ModuleFact`)return{kind:`Dvar`,name:e.name,location:t};if(e.kind===`Identifier`)return{kind:`Dvar`,name:Vs(e.name),location:t};if(e.kind===`OperatorReference`)return{kind:`Dvar`,name:Vs(e.operator),location:t};throw new v(`This DEF clause in proof obligations is not supported`)},re=e=>({facts:e.facts.map(w),defs:e.defs.map(ne)}),ie=(e,t)=>e?.[2]?{kind:`Named`,level:t,label:e[2],isAnonymous:!1}:{kind:`Unnamed`,level:t,id:hi(r)},T=(e,t,n)=>{if(!e)return{kind:`Omitted`,omission:`Implicit`,location:n};switch(e.kind){case`Obvious`:return{kind:`Obvious`,...l(e.keyword)};case`Omitted`:return{kind:`Omitted`,omission:`Explicit`,location:o(e.keyword)};case`By`:return{kind:`By`,usable:re(e),isOnly:e.isOnly,location:o(e.keyword),step:{kind:`Unnamed`,level:t,id:0},method:c(e.location.range)};case`Steps`:{let n=e.steps.map(e=>Hs.exec(e.token)),r=n[0],i=r&&r[1]!==`*`&&r[1]!==`+`?Number(r[1]):t,a=e.steps.slice(0,-1).map((e,t)=>oe(e,ie(n[t],i),i)),s=e.steps[e.steps.length-1],c=ie(n[n.length-1],i),l=o(s.head),u=T(s.proof,i+1,l),d={proof:u,location:Us(l,u.location),step:c};return{kind:`Steps`,steps:a,qed:d,location:a.reduce((e,t)=>Us(e,t.location),d.location),step:d.step}}}},ae=e=>Us(o(e.keyword),e.defs.length>0?f(e.defs[e.defs.length-1].location):void 0),oe=(e,n,r)=>{let i=o(e.head),a=e.body,s=t=>{let a=T(e.proof,r+1,i);return{...t(a),location:Us(i,a.location),step:n}},u=t=>({...t,...l(e.head),step:n});switch(a.kind){case`Use`:case`Hide`:{let t=Us(o({...e.head,end:e.head.start}),ae(a)),r=re(a);return a.kind===`Use`?{kind:`Use`,usable:r,isOnly:a.isOnly,location:t,step:n,method:c(a.location.range)}:{kind:`Hide`,usable:r,location:t,step:n}}case`Instance`:throw new t(`Unexpected keyword INSTANCE`);case`Define`:return{kind:`Define`,definitions:a.definitions.map(e=>ee(e)),location:i,step:n};case`Have`:return u({kind:`Have`,expression:b(a.expression,!1)});case`Take`:return u({kind:`Take`,bounds:a.names.length>0?Ss(a.names):h(a.bounds,!1)});case`Witness`:return u({kind:`Witness`,expressions:a.expressions.map(e=>b(e,!1))});case`Pick`:{let e=a.names.length>0?Ss(a.names):h(a.bounds,!1),t=b(a.body,!1);return s(n=>({kind:`Pick`,bounds:e,expression:t,proof:n}))}case`Case`:{let e=b(a.expression,!1);return s(t=>({kind:`Pcase`,expression:e,proof:t}))}case`Assert`:{let e=te(a.statement);return s(t=>a.isSuffices?{kind:`Suffices`,sequent:e,proof:t}:{kind:`Assert`,sequent:e,proof:t})}case`Qed`:throw new v(`QED in the middle of a proof`)}},se=e=>({name:e.name,extendees:e.extends,extendeeLocations:e.extendsRanges.map(o),isImportant:!1,location:f(e.location),body:e.units.map(e=>{switch(e.kind){case`Constants`:case`Recursive`:return{kind:e.kind===`Constants`?`Constants`:`Recursives`,declarations:e.declarations.map(e=>({name:Vs(e.name),shape:e.arity})),location:f(e.declarations[0].location)};case`Variables`:return{kind:`Variables`,names:e.declarations.map(e=>e.name),location:f(e.declarations[0].location)};case`Definition`:return{kind:`Definition`,definition:ee(e.definition),whereDefined:`User`,visibility:`Hidden`,isLocal:e.definition.isLocal,location:f(e.definition.location)};case`Instance`:{let t=e.instance,n=f(t.location);return t.name===void 0?{kind:`Anoninst`,instance:x(t),isLocal:t.isLocal,location:n}:{kind:`Definition`,definition:ee(t),whereDefined:`User`,visibility:`Hidden`,isLocal:t.isLocal,location:o(t.instanceRange)}}case`Assumption`:return{kind:`Axiom`,name:e.assumption.name,expression:u(b(e.assumption.expression,!1),e.assumption.location.range),location:f(e.assumption.location)};case`Theorem`:{let t=e.theorem,n=f(t.location),r=s(n),i=te(t.statement);return{kind:`Theorem`,name:t.name,sequent:{...i,active:u(i.active,t.statement.location.range)},axiomCount:0,proof:T(t.proof,0,{...r,startLine:r.endLine,startColumn:r.endColumn}),location:n}}case`Use`:return{kind:`Mutate`,mode:e.use.kind,usable:re(e.use),location:ae(e.use)};case`Module`:return{kind:`Submod`,module:{...se(e.module),isImportant:!0}}}})});return{convertModule:se}},qs={start:0,end:1/0},Js=/-{4,} *MODULE/,Ys=`Unexpected EOF`,Xs=e=>e?`${e.startLine}:${e.startColumn}:${e.endLine}:${e.endColumn}`:``,Zs=e=>{let t=Ie(e),n=e.split(`
32
+ `),r=t.at(-1)?.line??n.length,i=n.slice(0,r-1).reduce((e,t)=>e+t.length+1,0)+n[r-1].indexOf(`====`),a=e.indexOf(` `,e.search(Js));if(a===-1||a>=i)return;let o=e.slice(0,a).split(`
33
+ `).length,s=a-e.lastIndexOf(`
34
+ `,a-1),c=t.findLast(e=>e.kind!==`End`&&(e.line<o||e.line===o&&e.column<s));return{offset:a,line:o,column:s,end:{reason:Ys,line:c?.line??o,column:c?c.endColumn+1:s,isEnd:!0}}},Qs=e=>{try{return e()}catch(e){if(!(e instanceof n)||!e.failure)throw e;return e.failure}},$s=e=>typeof e==`object`&&!!e&&`reason`in e,ec=e=>{let t=Qs(()=>Zs(e));if($s(t))return[t];let n=Qs(()=>je(t?e.slice(0,t.offset):e));return t&&(!$s(n)||n.isEnd)?[{reason:`Unexpected TAB character. TLAPS does not handle TAB characters in source files.`,line:t.line,column:t.column,isEnd:!1},$s(n)&&n.reason===Ys?n:t.end]:$s(n)?[n]:n},tc=(e,n,r,i,a)=>{if(!Js.test(e.source))throw new t(`No tokens in file`);let o=ec(e.source);if(Array.isArray(o)){o.forEach(t=>{let n=`File ${JSON.stringify(e.file)}, line ${t.line}, character ${t.column}\n${t.reason}`;i({text:n,channel:`stderr`}),i({text:`${n}\n`,channel:`toolboxOnly`})});let n=`Could not parse ${JSON.stringify(e.file)} successfully.`;throw i({text:`${a}Error: ${n}`,channel:`stderr`}),new t(n,{failure:`Module.Parser.parse_file`})}let s=Ks(e.file,e.source,n,r).convertModule(o),c=e.file.slice(e.file.lastIndexOf(`/`)+1),l=c.replace(/\.tla$/,``);return s.name===l?s:(i({text:`${Kn(s.location)}Warning: module name ${JSON.stringify(s.name)} does not match file name ${JSON.stringify(c)}.`,channel:`toolbox`}),{...s,name:l})},nc=e=>{let n=new Map([...e].map(([e,t])=>[e,Ni(t).dependencies])),r=/* @__PURE__ */ new Set,i=[],a=o=>{if(r.has(o))return;r.add(o);let s=e.get(o);if(!s)throw new t(`Module "${o}" not found`);(n.get(o)??[]).forEach(a),i.push(s)};return[...e.keys()].sort(Fi).forEach(a),i},rc=(e,t,n)=>t.length===0?[]:[` ${e}_proofs_count = ${t.length}`,...t.map((t,r)=>` ${e}_proof_${n+r+1} at ${Hn(t)}`)],ic=(e,t,n)=>{let r=e.location;return[` ---- incomplete proof of theorem at ${r?Hn({...r,endLine:r.startLine,endColumn:r.startColumn}):`<unknown location>`} ----`,...rc(`missing`,e.absent,t),...rc(`omitted`,e.omitted,n),` ====`]},ac=e=>{let t=e.summary,n=t.theorems.reduce((e,t)=>t.absent.length+t.omitted.length===0?e:{lines:[...e.lines,...ic(t,e.missing,e.omitted)],missing:e.missing+t.absent.length,omitted:e.omitted+t.omitted.length},{lines:[],missing:0,omitted:0});return[`---- summary of module ${JSON.stringify(e.name)} ----`,` obligations_count = ${t.total}`,...t.absent.length>0?[` missing_proofs_count = ${t.absent.length}`]:[],...t.omitted.length>0?[` omitted_proofs_count = ${t.omitted.length}`]:[],...n.lines,`====`].join(`
35
+ `)},oc=(e,n,r={})=>{let i=r.lines??qs,a=r.onWarning??(()=>{}),o={value:0},s=new Map(Di);e.forEach(e=>{let t={...tc(e,o,!0,a,`File "<unknown>":
36
+ `),isImportant:!0};s.set(t.name,t)});let c=[...s.values()].sort((e,t)=>Fi(e.name,t.name)),l=/* @__PURE__ */ new Map,u=/* @__PURE__ */ new Set;for(let e=0;e<c.length;e++){let t=Ni(c[e]);t.submodules.forEach((e,t)=>{u.add(t),s.has(t)||s.set(t,e)});for(let e of t.dependencies){if(s.has(e)&&!Di.has(e))continue;let r=n(e);if(!r){!s.has(e)&&!l.has(e)&&l.set(e,t.locations.get(e));continue}let i=tc(r,o,!1,a,Gn(t.locations.get(e)));s.set(e,i),c.push(i)}}let d=[...l.keys()].filter(e=>!u.has(e)).sort(Fi);if(d.forEach(e=>a(A(l.get(e),`Unknown module ${JSON.stringify(e)}`))),d.length>0)throw new t(`Unknown module ${JSON.stringify(d[0])}`,{failure:`Module.Parser.load_module`});let f={anonymizer:bi(o,(e,t)=>Xa(f,e,t),a),simplify:cs(o),salts:{value:0},latestModules:/* @__PURE__ */ new Map,onWarning:a},p=nc(s).map(e=>e.isStandard?e:Mi(s,e,/* @__PURE__ */ new Set)),m=na(new Set(e.map(e=>e.file)),i,a),h=new Map(p.map(e=>[e.name,e]));return p.flatMap(e=>{if(e.isStandard)return[];let t=Za(f,h,void 0,e);if(!e.isImportant)return[];let n=m([],t),r=n.obligations.flatMap((e,t)=>{let n=e.location;if(e.kind.kind===`Omitted`||n&&(n.startLine<i.start||n.endLine>i.end))return[];let r=e.kind.kind===`Error`?e.kind.message:`${Qo(e.sequent)}\n`;return[{id:t+1,location:Xs(n),locus:n,text:r,kind:e.kind,sequent:e.sequent,method:e.method}]});return[{name:e.name,location:e.location,obligations:r,summary:n.summary}]})},sc=async e=>{let t=[],n=[],r=/* @__PURE__ */ new Map,i=[],a={failure:void 0},o=()=>{for(;i.length>0&&n.length>0;){let e=n.reduce((e,t,r)=>t.priority<n[e].priority?r:e,0),[a]=n.splice(e,1),o=i.pop()??0;r.set(o,a),t[o].postMessage(a.request)}},s=(e,t)=>{let n=t,a=r.get(e);r.delete(e),i.push(e),`verdict`in n&&a?.resolve(n),`error`in n&&a?.reject(new S(n.error)),o()},c=e=>{a.failure||(a.failure={reason:e},[...n.splice(0),...r.values()].forEach(t=>t.reject(e)),r.clear(),t.forEach(e=>e.terminate()))};return t.push(...await Promise.all(Array.from({length:e},(e,t)=>x(new URL(`./prove-worker.js`,import.meta.url),e=>s(t,e),c)))),i.push(...t.keys()),{decide:(e,t,r,i)=>new Promise((s,c)=>{if(a.failure)return c(a.failure.reason);n.push({request:{prover:e,text:t,timeLimitMs:r.timeLimitMs},priority:i,resolve:s,reject:c}),o()}),terminate:c}},cc={"!":`excl_`,"#":`hash_`,$:`doll_`,"%":`perc_`,"&":`ampe_`,"'":`quot_`,"(":`lpar_`,")":`rpar_`,"*":`star_`,"+":`plus_`,"-":`dash_`,".":`peri_`,"/":`slas_`,":":`colo_`,"<":`less_`,"=":`equa_`,">":`more_`,"?":`ques_`,"@":`atsi_`,"[":`lbrk_`,"\\":`bksl_`,"]":`rbrk_`,"^":`care_`,_:`unde_`,"|":`vert_`,"~":`tild_`},lc=new Set((/* @__PURE__ */ `All Append Bijections Case CaseArm CaseOther Char Choice EnumFuncSet Ex Fcn FuncSet INTER Id.Image Injections Injective InjectiveOn Int Inverse Len Let Monotonic Nat Nibble Not PeanoAxioms.Pred Product Range Seq String Succ Surjections Surjective TYPE Trueprop Zero abs addElt addnat.all antisymmetric any aprop arbitrary args arith_add asms bAll bChoice bEx boolify c cap cargs.case_arm case_arms cases_conj cases_equal cases_forall cases_implies char cidts classes cond.conj conjunction converse cs cup default diff diffnat disj div divmodNat divmod_rel domrng.domrngs dummy dummy_pattern dvd emptySeq eq equivalence except extend fapply float_const.float_token fun geq gfp greater id idt idts iff imp in index infinity irreflexive isAFcn isASeq.isBool isNeg isPos itself leq less letbind letbinds lfp logic longid minus mod mult multnat.natInterval num num_const oneArg prod prop psubset psupset pttrn pttrns reflexive rel_comp.rel_domain rel_image rel_range setOfAll setOfPairs setminus sgn sort sort_constraint struct.subsetOf subseteq symmetric term tid tpl transitive tvar type types upair upto var xcpt xnum.xstr.ML ML_command ML_export ML_file ML_file_debug ML_file_no_debug ML_prf ML_val ROOTS_file.SML_export SML_file SML_file_debug SML_file_no_debug SML_import abbreviation abbrevs alias also.and apply apply_end assume assumes attribute_setup axiomatization back begin bibtex_file binder.bundle by case chapter class class_deps code_datatype compile_generated_files consider.constrains consts context corollary declaration declare default_sort defer define defines.definition done end experiment export_files export_generated_files export_prefix external_file.external_files extract extract_type finally find_consts find_theorems fix fixes for from.full_prf generate_file global_interpretation guess have help hence hide_class hide_const.hide_fact hide_type if imports in include includes including infix infixl infixr instance.instantiation interpret interpretation is judgment keywords lemma lemmas let local_setup locale.locale_deps method_setup moreover named_theorems next no_notation no_syntax no_translations.no_type_notation nonterminal notation note notepad notes obtain obtains oops open opening oracle.output overloaded overloading paragraph parse_ast_translation parse_translation pervasive prefer.premises presume prf print_ML_antiquotations print_abbrevs print_antiquotations.print_ast_translation print_attributes print_bundles print_cases print_classes print_codesetup.print_commands print_context print_definitions print_defn_rules print_facts print_interps.print_locale print_locales print_methods print_options print_rules print_simpset print_state.print_statement print_syntax print_term_bindings print_theorems print_theory print_trans_rules.print_translation private proof prop proposition qed qualified realizability realizers rewrites.schematic_goal section setup show shows simproc_setup sorry structure subclass subgoal sublocale.subparagraph subsection subsubsection supply syntax syntax_declaration term text text_raw then.theorem theory thm thm_deps thm_oracles thus thy_deps translations txt typ type_alias.type_notation type_synonym typed_print_translation typedecl ultimately unbundle unchecked.unfolding unused_thms using welcome when where with write.O max status`.split(`.`)).join(` `).split(` `)),uc=e=>/^[A-Za-z]$/.test(e),dc=e=>{if(/^[A-Za-z0-9]$/.test(e))return;let t=cc[e];if(t===void 0)throw new _;return t},fc=e=>{let t=[...e];return uc(t[0]??``)&&uc(t.at(-1)??``)&&t.every(e=>dc(e)===void 0)&&!lc.has(e)?e:`a_${t.map(e=>dc(e)??e).join(``)}a`},pc={Leadsto:[`Leadsto`,2],ENABLED:[`ENABLED`,1],Cdot:[`\\cdot`,2],Actplus:[`-+->`,2],BoxTrue:[`[]`,1],BoxFalse:[`[]`,1],Diamond:[`<>`,1]},mc=(e,t,n)=>{if((e===`Prime`||e===`StrongPrime`||e===`UNCHANGED`)&&t===1)return new _;let r=pc[e];return r&&r[1]===t?new S(`Unsupported operator \`${r[0]}\`.\n`):new S(n)},hc=(e,t,n)=>{let r=t[0],i=t.slice(1),a=i[0]?.domain.kind===`Ditto`?[{...i[0],domain:r.domain},...i.slice(1)]:i;return a.length===0?{first:r,inner:n}:{first:r,inner:{kind:`Quant`,quantifier:e,bounds:a.map(e=>e.domain.kind===`Domain`?{...e,domain:{kind:`Domain`,expression:L(1,e.domain.expression)}}:e),body:n,location:n.location}}},gc=(e,t)=>{let n=e.stack.length;try{return t()}catch(t){if(!(t instanceof v))throw t;return Lo(e,e.stack.length-n),t}},_c=e=>`is${fc(e)}`,vc={TRUE:`TRUE`,FALSE:`FALSE`,STRING:`STRING`,BOOLEAN:`BOOLEAN`,Nat:`Nat`,Int:`Int`,Real:_c(`Real`),Infinity:_c(`Infinity`),Any:`Any`},yc={Neg:`~`,DOMAIN:`DOMAIN`,SUBSET:`SUBSET`,UNION:`UNION`},bc={Implies:`\\<Rightarrow>`,Equiv:`\\<Leftrightarrow>`,Conj:`\\<and>`,Disj:`\\<or>`,Eq:`=`,Neq:`\\<noteq>`,Subseteq:`\\<subseteq>`,Mem:`\\<in>`,Notmem:`\\<notin>`,Setminus:`\\\\`,Cap:`\\<inter>`,Cup:`\\<union>`,OneArg:`:>`,Extend:`@@`},xc={Plus:[`addint`,2],Minus:[`subint`,2],Uminus:[`minus`,1],Times:[`mult`,2],Ratio:[_c(`/`),2],Quotient:[_c(`\\div`),2],Remainder:[_c(`%`),2],Exp:[_c(`^`),2],Lteq:[`leq`,2],Lt:[`less`,2],Gteq:[`geq`,2],Gt:[`greater`,2],Range:[`intvl`,2],Seq:[`Seq`,1],Len:[`Len`,1],BSeq:[`BSeq`,1],Cat:[_c(`\\circ`),2],Append:[`Append`,2],Head:[`Head`,1],Tail:[`Tail`,1],SubSeq:[`SubSeq`,3],SelectSeq:[`SelectSeq`,2],Print:[`Print`,2],PrintT:[`PrintT`,1],Assert:[`Assert`,2],JavaTime:[`JavaTime`,0],TLCGet:[`TLCGet`,1],TLCSet:[`TLCSet`,2],Permutations:[`Permutations`,1],SortSeq:[`SortSeq`,2],RandomElement:[`RandomElement`,1],ToString:[`ToString`,1]},Sc=[`consts`,...[[`Real`,0],[`/`,2],[`\\div`,2],[`%`,2],[`..`,2],[`Infinity`,0],[`[]`,1],[`<>`,1]].map(e=>` "${_c(e[0])}" :: ${e[1]===0?`c`:`"[${Array(e[1]).fill(`c`).join(`,`)}] => c"`}`),``].join(`
37
+ `),Cc=e=>{let t=Number.parseInt(e,10);return`${`succ[`.repeat(t)}0${`]`.repeat(t)}`},wc=(e,t)=>[`(* automatically generated -- do not edit manually *)`,`theory ${e} imports Constant Zenon begin`,...t?[`ML_command \\<open> writeln ("*** TLAPS PARSED\\n"); \\<close>`]:[],Sc],Tc=e=>{let t=Po(),n=e=>Io(t,fc(e)),r=()=>Io(t,``),i=(e,r)=>{let i=r(n(e));return Lo(t,1),i},a=e=>`(${f(e)})`,o=e=>e.map(a).join(`, `),s=(e,t)=>`(${e} (${o(t)}))`,c=(e,t)=>{let n=vc[e];if(n!==void 0&&t.length===0)return n;let r=yc[e];if(r!==void 0&&t.length===1)return`(${r} ${a(t[0])})`;let i=bc[e];if(i!==void 0&&t.length===2)return`(${a(t[0])} ${i} ${a(t[1])})`;let o=xc[e];if(o&&o[1]===t.length)return s(o[0],t);if(e===`Unprimable`&&t.length===1)return a(t[0]);throw e===`Irregular`&&t.length===1?new v(`Irregular`):mc(e,t.length,`Backend.Isabelle.pp_apply`)},l=(e,r)=>{switch(e.kind){case`Ix`:{let n=Fo(t,e.index);if(e.index<=0||n===void 0)throw new _;return r.length===0?n:`(${n} (${o(r)}))`}case`Opaque`:{let t=fc(e.name);return r.length===0?`(${t} :: c)`:`(${t} (${o(r)}) :: c)`}case`Internal`:return c(e.builtin,r);case`Lambda`:{let r=`\\<lambda> ${e.params.map(e=>`${n(e.name)} `).join(``)}. ${a(e.body)}`;return Lo(t,e.params.length),r}default:throw new _}},u=(e,t,n)=>{if(t.length===0)return f(n);let r=hc(e,t,n),o=e===`Forall`?`\\<forall>`:`\\<exists>`;if(r.first.domain.kind===`NoDomain`)return i(r.first.name,e=>`${o}${e} : ${a(r.inner)}`);if(r.first.domain.kind!==`Domain`)throw new _;let s=a(r.first.domain.expression);return i(r.first.name,e=>`${o} ${e} \\<in> ${s} : ${a(r.inner)}`)},d=e=>{if(e.context.length===0)return a(e.active);let n=e.context[0],o=()=>d({context:e.context.slice(1),active:e.active});switch(n.kind){case`Flex`:return i(n.name,e=>`(\\<And> ${e} ${e}'.${o()})`);case`Fresh`:{if(n.domain&&n.domainVisibility===`Visible`){let e=a(n.domain);return i(n.name,t=>`(\\<And> ${t} :: c. ${t} \\<in> ${e} \\<Longrightarrow> ${o()})`)}let e=`${`c => `.repeat(n.shape)}c`;return i(n.name,t=>`(\\<And> ${t} :: ${e}. ${o()})`)}case`Fact`:{let e=n.visibility===`Visible`?a(n.expression):void 0;r();let i=e?`(${e} \\<Longrightarrow> ${o()})`:o();return Lo(t,1),i}case`Defn`:throw new v(`Inner definition`)}},f=e=>{switch(e.kind){case`Ix`:case`Internal`:case`Opaque`:case`Lambda`:return l(e,[]);case`Apply`:return l(e.operator,e.args);case`Bang`:throw new S(`Backend.Isabelle.module`);case`Sequent`:return d(e.sequent);case`With`:case`Parens`:return f(e.expression);case`Let`:throw new v(`LET`);case`List`:return e.bullet===`Refs`&&e.items.length===0?`TRUE`:e.bullet===`Refs`&&e.items.length===1?f(e.items[0]):e.items.map(a).join(e.bullet===`Or`?` | `:` & `);case`If`:return`cond(${a(e.condition)}, ${a(e.consequent)}, ${a(e.alternative)})`;case`Quant`:return u(e.quantifier,e.bounds,e.body);case`Tquant`:throw new v(e.quantifier===`Forall`?`\\\\AA`:`\\\\EE`);case`Choose`:{if(!e.domain)return i(e.name,t=>`Choice(%${t}. ${a(e.body)})`);let t=a(e.domain);return i(e.name,n=>`bChoice(${t}, %${n}. ${a(e.body)})`)}case`SetSt`:{let t=a(e.domain);return i(e.name,n=>`subsetOf(${t}, %${n}. ${a(e.body)})`)}case`SetOf`:{if(e.bounds.length===0)throw new _;let t=e.bounds[0];if(e.bounds.length!==1||t.domain.kind!==`Domain`)throw new v(`SetOf (multiple declared constants)`);let n=a(t.domain.expression);return i(t.name,t=>`setOfAll(${n}, %${t}. ${a(e.element)})`)}case`SetEnum`:return`{${o(e.elements)}}`;case`Fcn`:{let t=e.bounds[0];if(e.bounds.length!==1)throw new v(`function (multiple declared constants)`);if(t.domain.kind===`Ditto`)throw new _;let n=t.domain.kind===`Domain`?a(t.domain.expression):void 0;return i(t.name,t=>`[${n===void 0?t:` ${t} \\<in> ${n} `} \\<mapsto> ${a(e.body)}]`)}case`FcnApp`:{let t=a(e.function);return e.args.length===1?`fapply (${t}, ${a(e.args[0])})`:`fapply (${t}, <<${o(e.args)}>>)`}case`Arrow`:return`[${a(e.domain)} \\<rightarrow> ${a(e.range)}]`;case`Rect`:return`[${e.fields.map(e=>`''${e.name}'' : ${a(e.value)}`).join(`, `)}]`;case`Record`:return`(${e.fields.map(e=>`(''${e.name}'' :> ${a(e.value)})`).join(` @@ `)})`;case`Except`:{let t=e.specs.map(e=>`!${e.trail.map(e=>e.kind===`Dot`?`[''${e.field}'']`:`[${a(e.expression)}]`).join(``)} = ${a(e.value)}`);return`[${a(e.function)} EXCEPT ${t.join(`, `)}]`}case`Dot`:return`fapply (${a(e.expression)}, (''${e.field}''))`;case`Tuple`:return`<<${o(e.elements)}>>`;case`Product`:return e.factors.length===2?`(${a(e.factors[0])} \\<times> ${a(e.factors[1])})`:`Product(\\<langle>${o(e.factors)}\\<rangle>)`;case`Sub`:case`Tsub`:{let t=e.kind===`Sub`?`sub`:`tsub`;return`${e.modal===`Box`?_c(`a'box'${t}`):`a'dia'${t}`}(${a(e.action)},${a(e.subscript)})`}case`Fair`:return`${_c(e.fairness===`Weak`?`a'wf`:`a'sf`)}(${a(e.subscript)},${a(e.action)})`;case`Case`:{let t=o(e.arms.map(e=>e.condition)),n=o(e.arms.map(e=>e.body));return e.other?`CaseOther(<<${t}>>,<<${n}>>,${a(e.other)})`:`Case(<<${t}>>,<<${n}>>)`}case`String`:return`''${e.value}''`;case`Num`:if(e.fraction!==``)throw new v(`real constants`);return`(${Cc(e.integer)})`;case`At`:throw new _}},p=e=>{let i=[];for(let o of e.context)switch(o.kind){case`Flex`:{let e=n(o.name);i.push(`fixes ${e} ${e}'`);break}case`Fresh`:{let e=o.domain&&o.domainVisibility===`Visible`?a(o.domain):void 0,t=n(o.name);if(i.push(`fixes ${t}`),e===void 0)break;i.push(`assumes ${t}_in : "(${t} \\<in> ${e})"`);break}case`Fact`:{let e=t.stack.length,n=o.visibility===`Visible`?gc(t,()=>a(o.expression)):void 0;if(r(),n instanceof v){i.push(`(* omitted temporal assumption : ${n.message} *)`);break}if(n===void 0)break;i.push(`assumes v'${e}: "${n}"`);break}case`Defn`:if(o.definition.kind===`Bpragma`)return[...i,``];i.push(`(* usable definition ${o.definition.name} suppressed *)`),n(o.definition.name)}return[...i,`shows "${a(e.active)}"`]};try{let t=p(e);return{text:t.join(`
38
+ `),isAssumed:t.some(e=>e.startsWith(`assumes `))}}catch(e){throw e instanceof v?new S(`isabelle : unsupported operator ${e.message}`):e}},Ec=(e,t,n)=>{let r=Tc(t);return[...wc(`tlapm_${e}`,!1),`lemma ob'${e}:`,`${r.text}(is "PROP ?ob'${e}")`,`proof -`,`show "PROP ?ob'${e}"`,`${r.isAssumed?`using assms `:``}by ${n}`,`qed`,`end`,``].join(`
39
+ `)},Dc=(e,t)=>[...wc(e,!0),...t.flatMap(e=>[`lemma ob'${e.id}:`,`${Tc(e.sequent).text}(is "PROP ?ob'${e.id}")`,`proof -`,`ML_command \\<open> writeln "*** TLAPS ENTER ${e.id}"; \\<close>`,`show "PROP ?ob'${e.id}"`,`using assms by ${e.tactic}`,`ML_command \\<open> writeln "*** TLAPS EXIT ${e.id}"; \\<close> qed`]),`end`,``].join(`
40
+ `),Oc=[7,12,17,22,5,9,14,20,4,11,16,23,6,10,15,21],kc=Array.from({length:64},(e,t)=>Math.floor(Math.abs(Math.sin(t+1))*2**32)),Ac=(e,t)=>e<<t|e>>>32-t,jc=e=>{let t=new TextEncoder().encode(e),n=Math.ceil((t.length+9)/64)*64,r=new Uint8Array(n);r.set(t),r[t.length]=128;let i=new DataView(r.buffer);i.setUint32(n-8,t.length*8>>>0,!0),i.setUint32(n-4,Math.floor(t.length/2**29),!0);let a=[1732584193,4023233417,2562383102,271733878];for(let e=0;e<n;e+=64){let t=Array.from({length:16},(t,n)=>i.getUint32(e+n*4,!0)),n=Array.from({length:64}).reduce(([e,n,r,i],a,o)=>{let s=Math.floor(o/16),c=s===0?n&r|~n&i:s===1?i&n|~i&r:s===2?n^r^i:r^(n|~i),l=s===0?o:s===1?(5*o+1)%16:s===2?(3*o+5)%16:7*o%16,u=e+c+kc[o]+t[l]|0;return[i,n+Ac(u,Oc[s*4+o%4])|0,n,r]},a);a.splice(0,4,...a.map((e,t)=>e+n[t]|0))}return a.flatMap(e=>[e,e>>>8,e>>>16,e>>>24]).map(e=>(e&255).toString(16).padStart(2,`0`)).join(``)},Mc=(e,t)=>{let n=Qn(e,t-1)?.hyp;if(!n)throw new _;return n},Nc=(e,t)=>pa(e,t).level,Pc=(e,t)=>e.kind===`Apply`&&e.operator.kind===`Internal`&&t.includes(e.operator.builtin),Fc=(e,t)=>{let n=er(void 0,(n,r)=>{let i=fr(r,t=>e(n,t),t);return[N(n,i),i]});return(t,r)=>{let i=n(t,r.context);return{context:i.context,active:e(i.state,r.active)}}},Ic=(e,t)=>{if(t.kind===`Sub`||t.kind===`Tsub`){let n=Ic(e,t.action),r=Ic(e,t.subscript),i=M(`UNCHANGED`,[r],t),a=t.modal===`Box`?M(`Disj`,[n,i],t):M(`Conj`,[n,M(`Neg`,[i],t)],t);return t.kind===`Sub`?a:M(t.modal===`Box`?`BoxTrue`:`Diamond`,[a],t)}return pr(e,t,Ic,N,`all`)},Lc=(e,t)=>t.kind===`Apply`&&Pc(t,[`UNCHANGED`])&&t.args.length===1?ei(t.args[0]):pr(e,t,Lc,N,`all`),Rc=(e,t)=>M(e,[t],t),zc=(e,t)=>{if(t.kind===`Ix`){let n=Mc(e,t.index);return n.kind===`Fresh`&&n.level===`Constant`||n.kind===`Defn`&&n.definition.kind===`Operator`&&Nc(Qn(e,t.index),n.definition.body)===0?t:Rc(`Prime`,t)}if(Pc(t,[`ENABLED`])||t.kind===`Opaque`||t.kind===`Sequent`||t.kind===`Let`)return Rc(`Prime`,t);if(Pc(t,[`UNCHANGED`,`Cdot`,`Leadsto`,`Actplus`,`BoxTrue`,`BoxFalse`,`Diamond`])||t.kind===`Tquant`||t.kind===`Sub`||t.kind===`Tsub`||t.kind===`Fair`)throw new _;return pr(e,t,zc,N)},Bc=e=>{let t=e===`BoxTrue`?`Conj`:`Disj`,n=e===`BoxTrue`?`Forall`:`Exists`,r=(i,a)=>Nc(i,a)===0?a:Pc(a,[t])||(a.kind===`Quant`||a.kind===`Tquant`)&&a.quantifier===n?pr(i,a,r,N):Rc(e,a);return r},Vc={Prime:zc,BoxTrue:Bc(`BoxTrue`),Diamond:Bc(`Diamond`)},Hc=(e,t)=>{if(t.kind===`Apply`&&t.operator.kind===`Internal`){let n=Vc[t.operator.builtin];if(n){if(t.args.length!==1)throw new _;return n(e,t.args[0])}}return pr(e,t,Hc,N,`all`)},Uc={Constant:`CONSTANT`,State:`STATE`,Action:`ACTION`,Temporal:`TEMPORAL`,Unknown:`Unknown`},Wc=[`CONSTANT`,`STATE`,`ACTION`,`TEMPORAL`],Gc=(e,t)=>`${e}_${t}_`,Kc=(e,t,n)=>{if(t.kind!==`Operator`)return t.kind===`Bpragma`?{...t,body:Qc(e,t.body)}:t;let r=Qc(e,t.body),i=Wc[n??Nc(e,r)];if(i===void 0)throw new _;return{...t,name:Gc(i,t.name),body:r}},qc=(e,t,n)=>{switch(t.kind){case`Fresh`:return{...t,name:Gc(Uc[t.level],t.name),domain:t.domain&&Qc(e,t.domain)};case`Flex`:return{...t,name:Gc(`VARIABLE`,t.name)};case`Defn`:return{...t,definition:Kc(e,t.definition,n)};case`Fact`:return{...t,expression:Qc(e,t.expression)}}},Jc=(e,t)=>{if(t.kind!==`Defn`||t.definition.kind!==`Operator`)return;let n=t=>{if(!Pc(t,[`UNCHANGED`])||t.kind!==`Apply`)return Nc(e,t);let n=e=>e.kind===`Tuple`?e.elements.flatMap(n):[e],r=n(t.args[0]);return Nc(e,r.length===1?r[0]:t.args[0])},r=t.definition.body;return n(Pc(r,[`Prime`,`BoxTrue`,`Diamond`])&&r.kind===`Apply`&&r.args.length===1&&r.kind===`Apply`?r.args[0]:r)},Yc=er({scope:void 0,original:void 0},(e,t,n)=>{let r=qc(e.scope,t,Jc(e.original,n));return[{scope:N(e.scope,r),original:N(e.original,n)},r]}),Xc=(e,t)=>{let n=Yc(t.context,e.context);return{context:n.context,active:Qc(n.state.scope,e.active)}},Zc=(e,t)=>{let[n,r]=$n(e,t.context,(e,t)=>{let n=qc(e,t);return[N(e,n),n]});return{context:r,active:Qc(n,t.active)}},Qc=(e,t)=>{switch(t.kind){case`Lambda`:{let n=t.params.map(e=>({...e,name:Gc(`Unknown`,e.name)})),r=P(e,n.map(ar));return{...t,params:n,body:Qc(r,t.body)}}case`Tquant`:{let n=P(e,t.names.map(e=>({kind:`Flex`,name:Gc(`VARIABLE`,e)})));return{...t,body:Qc(n,t.body)}}case`Choose`:{let n=t.domain&&Qc(e,t.domain),r=Gc(`CONSTANT`,t.name),i=n?nr(r,n):tr(r,`Constant`);return{...t,name:r,domain:n,body:Qc(N(e,i),t.body)}}case`SetSt`:{let n=Qc(e,t.domain),r=Gc(`CONSTANT`,t.name),i=Qc(N(e,nr(r,n)),t.body);return{...t,name:r,domain:n,body:i}}case`Quant`:case`Fcn`:case`SetOf`:{let n=t.bounds.map(t=>({...t,name:Gc(Uc[t.level],t.name),domain:t.domain.kind===`Domain`?{kind:`Domain`,expression:Qc(e,t.domain.expression)}:t.domain})),r=P(e,n.map(ir));return t.kind===`SetOf`?{...t,bounds:n,element:Qc(r,t.element)}:{...t,bounds:n,body:Qc(r,t.body)}}case`Let`:{let[n,r]=$n(e,t.definitions,(e,t)=>{let n=Kc(e,t);return[N(e,or(n)),n]});return{...t,definitions:r,body:Qc(n,t.body)}}case`Sequent`:return{...t,sequent:Zc(e,t.sequent)};default:return pr(e,t,Qc,N,`all`)}},$c=/* @__PURE__ */ new WeakMap,el=(e,t)=>{let n=$c.get(t);if(n)return n;let r=t.kind===`Operator`?t.body:void 0;if(r?.kind!==`Lambda`)return[];let i=P(e,r.params.map(ar)),a=r.params.map((e,t)=>rl(i,r.body,t+1,!0));return $c.set(t,a),a},tl=[`Prime`,`StrongPrime`,`BoxTrue`,`BoxFalse`,`Diamond`,`ENABLED`,`UNCHANGED`],nl=[`Leadsto`,`Actplus`,`Cdot`],rl=(e,t,n,r)=>{if(t.kind===`Ix`)return r||t.index!==n;if(t.kind===`Apply`&&t.operator.kind===`Internal`){let r=t.operator.builtin;if(tl.includes(r)&&t.args.length===1||nl.includes(r)&&t.args.length===2)return t.args.every(t=>rl(e,t,n,!1))}if(t.kind===`Sub`)return[t.action,t.subscript].every(t=>rl(e,t,n,!1));if(t.kind===`Apply`&&t.operator.kind===`Ix`){let r=Qn(e,t.operator.index-1),i=r?.hyp;if(r&&i?.kind===`Defn`&&i.definition.kind===`Operator`){let a=el(r.rest,i.definition);return t.args.every((t,r)=>{let i=a[r];if(i===void 0)throw new _;return rl(e,t,n,i)})}}let i={isSubstitutive:!0};return pr({scope:e,index:n},t,(e,t)=>(i.isSubstitutive&&=rl(e.scope,t,e.index,r),t),(e,t)=>({scope:N(e.scope,t),index:e.index+1}),`all`),i.isSubstitutive},il=(e,t)=>`h${jc(Eo(Xo(e,t))).slice(0,5)}`,al=(e,t)=>j({kind:`Opaque`,name:il(Xn(e),t)},t),ol=(e,t,n,r,i)=>{let a=i.map((t,r)=>Nc(e,t)===0||n[i.length-r-1]?j({kind:`Opaque`,name:`*`},t):t);return al(e,j({kind:`Apply`,operator:{kind:`Opaque`,name:t},args:a},r))},sl=[`Prime`,`StrongPrime`,`BoxTrue`,`BoxFalse`,`Diamond`,`Leadsto`,`ENABLED`,`Cdot`,`UNCHANGED`],cl=(e,t)=>{if(t.kind!==`Apply`)return pr(e,t,cl,N);let n=t.operator,[r]=t.args;if(Pc(t,[`Prime`,`StrongPrime`])&&t.args.length===1&&r.kind===`Ix`){let n=Mc(e,r.index);if(n.kind===`Fresh`||n.kind===`Flex`)return j({kind:`Opaque`,name:`${n.name}#prime`},t)}if(Pc(t,sl))return al(e,t);if(n.kind!==`Ix`)return pr(e,t,cl,N);let i=Qn(e,n.index-1),a=i?.hyp;if(!a)throw new _;let o=t.args;if(a.kind===`Defn`&&a.definition.kind===`Operator`){let r=el(i.rest,a.definition);if(o.every((t,n)=>Nc(e,t)===0||r[o.length-n-1]))return pr(e,t,cl,N);let s=ol(e,a.definition.name,r,n,o);return j({kind:`Apply`,operator:s,args:o.map(t=>cl(e,t))},t)}if(a.kind===`Flex`)return pr(e,t,cl,N);if(a.kind===`Fresh`){if(a.level===`Constant`)return j({kind:`Apply`,operator:n,args:o.map(t=>cl(e,t))},t);let r=o.map(()=>!1);return ol(e,a.name,r,n,o)}throw new _},ll=Fc(Ic,`all`),ul=Fc(Lc,`all`),dl=Fc(Hc,`all`),fl=Fc(cl,`visible`),pl=e=>{let t=e.context,n=ul(t,ll(t,e)),r=dl(t,n);return fl(t,Xc(r,e))},ml=/* @__PURE__ */ `TRUE.FALSE.Implies.Equiv.Conj.Disj.Neg.Eq.Neq.STRING.BOOLEAN.SUBSET.UNION.DOMAIN.Subseteq.Mem.Notmem.Setminus.Cap.Cup.Prime.StrongPrime.Leadsto.ENABLED.UNCHANGED.Cdot.Actplus.Diamond.Nat.Int.Real.Plus.Minus.Uminus.Times.Ratio.Quotient.Remainder.Exp.Infinity.Lteq.Lt.Gteq.Gt.Divides.Range.Seq.Len.BSeq.Cat.Append.Head.Tail.SubSeq.SelectSeq.OneArg.Extend.Print.PrintT.Assert.JavaTime.TLCGet.TLCSet.Permutations.SortSeq.RandomElement.Any.ToString.Unprimable.Irregular`.split(`.`),hl={And:0,Or:1,Refs:2},gl={Forall:0,Exists:1},_l={Box:0,Dia:1},vl={Weak:0,Strong:1},yl={34:`\\"`,92:`\\\\`,10:`\\n`,9:`\\t`,13:`\\r`,8:`\\b`},bl=e=>`"${[...new TextEncoder().encode(e)].map(e=>yl[e]??(e<32||e>126?`\\${String(e).padStart(3,`0`)}`:String.fromCharCode(e))).join(``)}"`,xl=e=>e===`BoxTrue`?`$Box`:e===`BoxFalse`?`$FakeBox`:`$${ml.indexOf(e)}`,Sl=e=>e.level===`Unknown`?`Unknown`:e.level.toUpperCase(),Cl=e=>{let t=[],n=e=>{let n=t[t.length-e];if(!n)throw new _;return n},r=e=>t.push({ident:e,isUsed:!1}),i=()=>{let e=t.pop();if(!e)throw new _;return e},a=e=>Array.from({length:e}).forEach(()=>r({kind:`Var`})),o=e=>Array.from({length:e},i),s=e=>{if(e.ident.kind===`VarIndex`)return e.ident.index;if(e.ident.kind===`Var`)return 0;throw new _},c=e=>{if(e.ident.kind!==`HypIndex`)throw new _;return e.ident.index},l=(e,t)=>{let i=t=>l(e,t),c=e=>e.map(i).join(`,`),d=(e,t)=>t.map((t,n)=>t.domain.kind===`Domain`?`${s(e[n])}:${i(t.domain.expression)},`:``).join(``),f=(e,t)=>(a(e),{text:i(t),entries:o(e)}),p=e=>e.map(e=>`${s(e)}.`).join(``);switch(t.kind){case`Ix`:{let r=n(t.index);r.isUsed=!0;let i=r.ident;switch(i.kind){case`None`:return`$V(${t.index}SHOULD_NOT_APPEAR)`;case`Hyp`:{let t=e.hyp++;return r.ident={kind:`HypIndex`,index:t},`$${i.label}(${t})`}case`Var`:{let t=e.variable++;return r.ident={kind:`VarIndex`,index:t},`$PRM(${t})`}case`HypIndex`:return`$HYP(${i.index})`;case`VarIndex`:return`$PRM(${i.index})`;case`Pragma`:return``}throw new _}case`Opaque`:return t.name;case`Internal`:return xl(t.builtin);case`Lambda`:{let e=f(t.params.length,t.body);return`$Lam(${p(e.entries.toReversed())}${e.text})`}case`Sequent`:return u(t.sequent);case`Apply`:{let e=t.operator;return e.kind===`Ix`&&n(e.index).ident.kind===`Pragma`?``:`$OpApp(${i(e)};${c(t.args)})`}case`With`:case`Parens`:return i(t.expression);case`If`:return`$If(${i(t.condition)},${i(t.consequent)},${i(t.alternative)})`;case`List`:return`$List(${hl[t.bullet]};${c(t.items)})`;case`Let`:{let e=t.definitions.map(e=>{if(e.kind!==`Operator`&&e.kind!==`Bpragma`)throw new _;let t=`${i(e.body)}.`;return r({kind:`Var`}),t}),n=i(t.body);return o(e.length),`${e.join(``)}${n}`}case`Quant`:{let e=f(t.bounds.length,t.body);return`$Quant(${gl[t.quantifier]};${d(e.entries,t.bounds)}.${e.text})`}case`Tquant`:{let e=f(t.names.length,t.body);return`$Tquant(${gl[t.quantifier]}${p(e.entries.toReversed())}${e.text})`}case`Choose`:{let e=f(1,t.body),n=s(e.entries[0]);return t.domain?`$Bch(${n}:${i(t.domain)};${e.text})`:`$Ch(${n}:${e.text})`}case`SetSt`:{let e=f(1,t.body);return`$SSt(${s(e.entries[0])}:${i(t.domain)};${e.text})`}case`SetOf`:{let e=f(t.bounds.length,t.element);return`$Sof(${d(e.entries.toReversed(),t.bounds)}.${e.text})`}case`Fcn`:{let e=f(t.bounds.length,t.body);return`$Fcn(${d(e.entries.toReversed(),t.bounds)}.${e.text})`}case`SetEnum`:return`$Set(${c(t.elements)})`;case`Tuple`:return`$Tup(${c(t.elements)})`;case`Product`:return`$Prod(${c(t.factors)})`;case`FcnApp`:return`$FcnApp(${i(t.function)};${c(t.args)})`;case`Arrow`:return`$Arrow(${i(t.domain)},${i(t.range)})`;case`Rect`:case`Record`:return`$${t.kind}(${t.fields.map(e=>`(${e.name},${i(e.value)})`).join(`,`)})`;case`Except`:return`$Except(${i(t.function)},${t.specs.map(e=>`(${e.trail.map(e=>e.kind===`Dot`?`.${e.field}`:`.${i(e.expression)}`).join(``)}=${i(e.value)})`).join(`,`)})`;case`Dot`:return`$Dot(${i(t.expression)},${t.field})`;case`Sub`:case`Tsub`:return`$${t.kind}(${_l[t.modal]},${i(t.action)},${i(t.subscript)})`;case`Fair`:return`$Fair(${vl[t.fairness]},${i(t.subscript)},${i(t.action)})`;case`Case`:return`$Case(${t.arms.map(e=>`(${i(e.condition)},${i(e.body)})`).join(`,`)},${t.other?i(t.other):``})`;case`String`:return bl(t.value);case`Num`:return`$Num(${t.integer},${t.fraction})`;case`At`:return`$At`;case`Bang`:throw new _}},u=e=>{let t={hyp:1,variable:1},n=(a,o)=>{let s=e.context[a];if(!s)return`$Goal(${l(t,e.active)})`;let u=e=>(r(e),{rest:n(a+1,N(o,s)),entry:i()});switch(s.kind){case`Fresh`:{if(!s.domain){let e=Sl(s),t=u({kind:`Hyp`,label:e});return t.entry.isUsed?`${t.rest}${e}${s.name}`:t.rest}let e=u({kind:`Hyp`,label:`CON`});if(s.domainVisibility===`Hidden`)return e.rest;let n=e.entry.isUsed?String(c(e.entry)):`_`;return`${e.rest}$Dom(${n};${l(t,s.domain)})`}case`Flex`:return u({kind:`Hyp`,label:`VAR`}).rest;case`Defn`:{let e=s.definition;if(e.kind===`Recursive`)return u({kind:`Hyp`,label:`CON`}).rest;if(e.kind===`Bpragma`)return u({kind:`Pragma`}).rest;if(e.kind===`Instance`)throw new _;let n=u({kind:`Hyp`,label:`HYP`});if(!n.entry.isUsed)return n.rest;let r=c(n.entry);return s.visibility===`Hidden`?`${n.rest}$Def(${r},${ui(o,e.body)?0:3})`:`${n.rest}$Def(${r};${l(t,e.body)})`}case`Fact`:return s.visibility===`Hidden`?u({kind:`None`}).rest:`${u({kind:`Hyp`,label:`HYP`}).rest}$Fact(${l(t,s.expression)},${s.time.toLowerCase()})`}};return n(0,void 0)};return u(e)},wl=e=>jc(Cl(e)),Tl={kind:`Internal`,builtin:`TRUE`},El=(e,t)=>e.kind===`Apply`&&e.operator.kind===`Internal`&&e.operator.builtin===t&&e.args.length===2?e.args:void 0,Dl=e=>e.kind===`Apply`&&e.operator.kind===`Internal`&&e.operator.builtin===`ENABLED`&&e.args.length===1?e.args[0]:void 0,Ol=(e,t)=>{let n=El(e,t),r=n&&Dl(n[0]),i=n&&Dl(n[1]);return r&&i?[r,i]:void 0},kl=(e,t)=>{let n=/* @__PURE__ */ new Set,r=(e,t)=>{let i={...e,isPrimed:!0},a=t.kind===`Apply`&&t.operator.kind===`Internal`&&t.operator,o=a&&a.builtin,s=t.kind===`Apply`?t.args:[];if((o===`Prime`&&s.length===1||o===`ENABLED`||o===`Cdot`&&s.length===2||o===`UNCHANGED`&&s.length===1||t.kind===`Sub`)&&e.isPrimed)throw new _;if(o===`Prime`&&s.length===1)r(i,s[0]);else if(o===`Cdot`&&s.length===2)r(e,s[1]);else if(o===`UNCHANGED`&&s.length===1)r(i,s[0]);else if(t.kind===`Sub`)r(e,t.action),r(i,t.subscript);else if(t.kind===`Ix`){let r=Qn(e.scope,t.index-1)?.hyp;if(!r)throw new _;r.kind===`Flex`&&e.isPrimed&&n.add(r.name)}else o!==`ENABLED`&&pr(e,t,r,(e,t)=>({...e,scope:N(e.scope,t)}));return t};return r({scope:e,isPrimed:!1},t),n},Al=(e,t,n)=>{let r=kl(e,t);return[...kl(e,n)].every(e=>!r.has(e))},jl=(e,t)=>{let n=t=>pa(e,t).level,r=(e,t)=>{if(n(e)>2||n(t)>2)throw new _},i=Dl(t),a=i&&El(i,`Disj`);if(a)return r(a[0],a[1]),{name:`abdisj_inverse`,left:a[0],right:a[1]};let o=Ol(t,`Disj`);if(o)return r(o[0],o[1]),{name:`abdisj`,left:o[0],right:o[1]};let s=i&&El(i,`Conj`);if(s){let t=s[0],i=s[1],a=Al(e,t,i);return r(t,i),a?{name:n(t)===2?`abconj_inverse`:`pconj_inverse`,left:t,right:i}:void 0}let c=Ol(t,`Conj`);if(c)return Al(e,c[0],c[1])?{name:`abconj`,left:c[0],right:c[1]}:void 0;let l=El(t,`Conj`),u=l&&Dl(l[1]);if(l&&u)return n(l[0])<=1&&n(u)<=2?{name:`pconj`,left:l[0],right:u}:void 0;let d=Ol(t,`Equiv`)??Ol(t,`Eq`);if(d)return{name:`equiv`,left:d[0],right:d[1]};let f=Ol(t,`Implies`);return f&&{name:`implies`,left:f[0],right:f[1]}},Ml=e=>{let t=P(void 0,e.context),n=jl(t,e.active),r={isPremise:!1,isLeftBoolean:!1,isRightBoolean:!1};if(e.context.forEach((t,i)=>{if(!n||t.kind!==`Fact`||t.visibility!==`Visible`)return;let a=e.context.length-i,o=t.expression,s=e=>R(L(a,e),n.left),c=e=>R(L(a,e),n.right),l=(e,t)=>e!==void 0&&s(e[0])&&c(e[1])&&t.includes(n.name),u=Dl(o),d=u&&El(u,`Conj`),f=El(o,`Conj`),p=f&&Dl(f[1]),m=El(o,`Mem`),h=m?.[1].kind===`Internal`&&m[1].builtin===`BOOLEAN`;l(d,[`pconj`])||l(u&&El(u,`Disj`),[`abdisj`])||l(Ol(o,`Disj`),[`abdisj_inverse`])||l(d,[`abconj`])||l(Ol(o,`Conj`),[`abconj_inverse`,`pconj_inverse`])||l(f&&p&&[f[0],p],[`pconj_inverse`])?r.isPremise=!0:l(El(o,`Equiv`),[`equiv`])?(r.isPremise=!0,r.isLeftBoolean=!0,r.isRightBoolean=!0):l(El(o,`Eq`),[`equiv`])?r.isPremise=!0:m&&h&&s(m[0])?r.isLeftBoolean=!0:m&&h&&c(m[0])?r.isRightBoolean=!0:l(El(o,`Implies`),[`implies`])&&(r.isPremise=!0)}),!r.isPremise||!r.isLeftBoolean||!r.isRightBoolean)throw new S(`ENABLEDaxioms proof directive did not succeed.
41
+ `);return{...e,active:Tl}},Nl={Constant:0,State:1,Action:2,Temporal:3},Pl=(e,t,n)=>e.every((e,r)=>r<t.length&&n(e,t[r]))&&e.length===t.length,Fl=e=>[...new Map(e.toReversed().map(e=>[e.name,e.value]))].toSorted((e,t)=>e[0]<t[0]?-1:1),Il=(e,t)=>{let n=Qn(e,t-1);if(!n)throw new _;let r=n.hyp;if(r.kind===`Fresh`)return{name:r.name,kind:r.level,level:Nl[r.level]??-1};if(r.kind===`Flex`)return{name:r.name,kind:`Variable`,level:1};if(r.kind===`Defn`&&r.definition.kind===`Operator`){let e=pa(n.rest,r.definition.body).level;return{name:r.definition.name,kind:`Definition`,level:e}}throw new _},Ll=(e,t)=>P(e,t.map(ir)),Rl=(e,t)=>P(e,t.map(ar)),zl=(e,t)=>P(e,t.map(or)),Bl=(e,t)=>P(e,t.map(e=>({kind:`Flex`,name:e}))),Vl=(e,t,n,r)=>{let i=/* @__PURE__ */ new Map,a=(e,t,n,r)=>{let a=Il(e,n),o=Il(t,r);if(a.kind===`Unknown`)return n===r;if(a.kind===`Variable`||a.kind===`Definition`)return a.name===o.name&&o.kind===a.kind;let s=Nl[o.kind];if(!(s!==void 0&&s<=a.level||o.kind===`Definition`&&o.level<=a.level))return!1;let c=i.get(a.name);return c===void 0?(i.set(a.name,o.name),!0):c===o.name},o=(e,t,n,r)=>{if(n.kind===`Operator`&&r.kind===`Operator`||n.kind===`Bpragma`&&r.kind===`Bpragma`)return f(e,t,n.body,r.body);if(n.kind!==`Instance`||r.kind!==`Instance`)return!1;let i=n.instance.args,a=r.instance.args,o=(e,t)=>P(e,t.map(e=>tr(e,`Unknown`))),c=e=>Fl(e.substitutions.map(e=>({name:e.name,value:e.expression})));return Pl(i,a,(e,t)=>e===t)&&n.instance.module===r.instance.module&&s(o(e,i),o(t,a),c(n.instance),c(r.instance))},s=(e,t,n,r)=>Pl(n,r,(n,r)=>n[0]===r[0]&&f(e,t,n[1],r[1])),c=(e,t,n,r)=>Pl(n,r,(n,r)=>{if(n.level!==r.level)return!1;let i=n.domain,a=r.domain;return i.kind===`Domain`&&a.kind===`Domain`?f(e,t,i.expression,a.expression):i.kind===a.kind&&i.kind!==`Domain`}),l=(e,t,n,r)=>n.kind===`Fresh`&&r.kind===`Fresh`?n.level!==r.level||n.shape!==r.shape?!1:n.domain&&r.domain?f(e,t,n.domain,r.domain):!n.domain&&!r.domain:n.kind===`Flex`&&r.kind===`Flex`?!0:n.kind===`Defn`&&r.kind===`Defn`?o(e,t,n.definition,r.definition)&&n.isLocal===r.isLocal:n.kind===`Fact`&&r.kind===`Fact`&&f(e,t,n.expression,r.expression),u=(e,t,n,r)=>n.length===0||r.length===0?n.length===r.length:l(e,t,n[0],r[0])&&u(N(e,n[0]),N(t,r[0]),n.slice(1),r.slice(1)),d=(e,t,n,r)=>!n.domain||!r.domain?!n.domain&&!r.domain&&f(N(e,tr(n.name,`Constant`)),N(t,tr(r.name,`Constant`)),n.body,r.body):f(e,t,n.domain,r.domain)&&f(N(e,nr(n.name,n.domain)),N(t,nr(r.name,r.domain)),n.body,r.body),f=(e,t,n,r)=>{if(n.kind===`Parens`)return f(e,t,n.expression,r);if(r.kind===`Parens`)return f(e,t,n,r.expression);let i=(n,r)=>f(e,t,n,r),l=(e,t)=>Pl(e,t,i);switch(n.kind){case`Ix`:return r.kind===`Ix`&&a(e,t,n.index,r.index);case`Opaque`:return r.kind===`Opaque`&&n.name===r.name;case`Internal`:return r.kind===`Internal`&&n.builtin===r.builtin;case`Lambda`:return r.kind===`Lambda`&&n.params.length===r.params.length&&f(Rl(e,n.params),Rl(t,r.params),n.body,r.body);case`Apply`:return r.kind===`Apply`&&i(n.operator,r.operator)&&l(n.args,r.args);case`Sequent`:return r.kind===`Sequent`&&u(e,t,n.sequent.context,r.sequent.context)&&f(P(e,n.sequent.context),P(t,r.sequent.context),n.sequent.active,r.sequent.active);case`Bang`:{if(r.kind!==`Bang`||!i(n.expression,r.expression))return!1;let e=r.selectors,t=n.selectors.every((t,n)=>{let r=e[n];return r?t.kind===`Number`&&r.kind===`Number`?t.value===r.value:t.kind===`Instance`&&r.kind===`Instance`?l(t.args,r.args):t.kind===`Label`&&r.kind===`Label`?t.label===r.label&&l(t.args,r.args):t.kind===r.kind:!0});if(t&&n.selectors.length!==e.length)throw new _(`Invalid_argument`);return t}case`With`:return r.kind===`With`&&i(n.expression,r.expression);case`Let`:return r.kind===`Let`&&Pl(n.definitions,r.definitions,(n,r)=>o(e,t,n,r))&&f(zl(e,n.definitions),zl(t,r.definitions),n.body,r.body);case`If`:return r.kind===`If`&&i(n.condition,r.condition)&&i(n.consequent,r.consequent)&&i(n.alternative,r.alternative);case`List`:return r.kind===`List`&&n.bullet===r.bullet&&l(n.items,r.items);case`Quant`:return r.kind===`Quant`&&n.quantifier===r.quantifier&&c(e,t,n.bounds,r.bounds)&&f(Ll(e,n.bounds),Ll(t,n.bounds),n.body,r.body);case`Tquant`:return r.kind===`Tquant`&&n.quantifier===r.quantifier&&Pl(n.names,r.names,(e,t)=>e===t)&&f(Bl(e,n.names),Bl(t,r.names),n.body,r.body);case`Choose`:case`SetSt`:return r.kind===n.kind&&d(e,t,n,r);case`SetOf`:return r.kind===`SetOf`&&f(Ll(e,n.bounds),Ll(t,r.bounds),n.element,r.element)&&c(e,t,n.bounds,r.bounds);case`SetEnum`:return r.kind===`SetEnum`&&l(n.elements,r.elements);case`Arrow`:return r.kind===`Arrow`&&i(n.domain,r.domain)&&i(n.range,r.range);case`Fcn`:return r.kind===`Fcn`&&c(e,t,n.bounds,r.bounds)&&f(Ll(e,n.bounds),Ll(t,r.bounds),n.body,r.body);case`FcnApp`:return r.kind===`FcnApp`&&l([n.function,...n.args],[r.function,...r.args]);case`Tuple`:return r.kind===`Tuple`&&l(n.elements,r.elements);case`Product`:return r.kind===`Product`&&l(n.factors,r.factors);case`Rect`:case`Record`:return r.kind===n.kind&&s(e,t,Fl(n.fields),Fl(r.fields));case`Except`:return r.kind===`Except`&&i(n.function,r.function)&&Pl(n.specs,r.specs,(e,t)=>Pl(e.trail,t.trail,(e,t)=>e.kind===`Dot`?t.kind===`Dot`&&e.field===t.field:t.kind===`Apply`&&i(e.expression,t.expression))&&i(e.value,t.value));case`Dot`:return r.kind===`Dot`&&i(n.expression,r.expression)&&n.field===r.field;case`Sub`:case`Tsub`:return r.kind===n.kind&&n.modal===r.modal&&i(n.action,r.action)&&i(n.subscript,r.subscript);case`Fair`:return r.kind===`Fair`&&n.fairness===r.fairness&&i(n.subscript,r.subscript)&&i(n.action,r.action);case`Case`:{if(r.kind!==`Case`)return!1;let e=n.arms[0],t=r.arms[0];return(e&&t?i(e.condition,t.condition)&&i(e.body,t.body):!e&&!t)?n.other&&r.other?i(n.other,r.other):!n.other&&!r.other:!1}case`String`:return r.kind===`String`&&n.value===r.value;case`Num`:return r.kind===`Num`&&n.integer===r.integer&&n.fraction===r.fraction;case`At`:return r.kind===`At`&&n.isExcept===r.isExcept}},p=f(e,t,n,r),m=Xn(e),h=[...i].map(e=>e[0]===e[1]||m.reduce((t,n)=>{if(n.kind===`Fact`)return t;if(n.kind===`Defn`&&n.definition.kind!==`Operator`)throw new _;return t||(n.kind===`Defn`?n.definition.name:n.name)===e[0]},!1));return p&&h.every(Boolean)},Hl=e=>{let t=P(void 0,e.context);if(!e.context.some((n,r)=>{if(n.kind!==`Fact`||n.visibility!==`Visible`)return!1;let i=Qn(t,e.context.length-r),a=n.expression;return a.kind===`Sequent`?Vl(P(i,a.sequent.context),t,a.sequent.active,e.active):Vl(i,t,a,e.active)}))throw new S(`LevelComparison proof directive did not succeed.
42
+ `);return{...e,active:{kind:`Internal`,builtin:`TRUE`}}},Ul=/* @__PURE__ */ new Set([`expandenabled`,`expandcdot`,`autouse`,`lambdify`,`enabledaxioms`,`levelcomparison`]),Wl=[{prover:`smt`,timeLimitMs:5e3},{prover:`zenon`,timeLimitMs:1e4},{prover:`isabelle`,timeLimitMs:3e4,tactic:`auto`}],Gl={zenon:{prover:`zenon`,seconds:10},isabelle:{prover:`isabelle`,seconds:30},yices:{prover:`yices`,seconds:30},ls4:{prover:`ls4`,seconds:10},z3:{prover:`z3`,seconds:5,isBudgeted:!0},smt:{prover:`smt`,seconds:5,isBudgeted:!0},cvc3:{prover:`cvc3`,seconds:5},cooper:{prover:`cooper`,seconds:0},fail:{prover:`fail`,seconds:0},smt2lib:{prover:`smt`,seconds:5,isBudgeted:!0},smt2z3:{prover:`z3`,seconds:5,isBudgeted:!0},smt3:{prover:`smt`,seconds:5,isBudgeted:!0},z33:{prover:`z3`,seconds:5,isBudgeted:!0},cvc33:{prover:`cvc3`,seconds:5},yices3:{prover:`yices`,seconds:5},verit:{prover:`verit`,seconds:5},zipper:{prover:`zipper`,seconds:30},spass:{prover:`spass`,seconds:5},tptp:{prover:`tptp`,seconds:5},trivial:{prover:`trivial`,seconds:0},...Object.fromEntries([...Ul].map(e=>[e,{prover:e,seconds:0}]))},Kl=(e,t,n,r)=>{let i=Gl[e];if(!i)throw new S(`Unknown prover: ${e}`);if(n!==void 0&&!i.isBudgeted)throw new S(`A Z3 rlimit budget ("rN") is only supported by the SMT and Z3 backends.`);return{prover:i.prover,timeLimitMs:n===void 0?(t??i.seconds)*1e3:1/0,...n!==void 0&&{rlimit:n},...i.prover===`isabelle`&&{tactic:r??`auto`}}},ql=e=>{let t=Number.parseFloat(e.slice(1));if(!/^[rR]./.test(e)||!Number.isFinite(t)||t<=0)throw new S(`Invalid SMT budget "${e}"`);return Math.max(1,Math.trunc(Math.min(t*3e6,4294967295)))},Jl=(e,t)=>{let n=e.reduce((e,t)=>{let n=t.value,r=n.kind===`Default`?e.args[0]:void 0,i=n.kind===`Default`?e.args.slice(1):e.args;if(n.kind===`Default`&&!r)throw new S(`Some arguments are missing`);let a=n.kind===`String`?n.value:r?.kind===`String`?r.value:void 0;switch(t.hint){case`prover`:case`tactic`:if(a===void 0)throw new S(`This argument should be a string`);return{...e,args:i,[t.hint]:a};case`timeout`:if(n.kind===`Float`)return{...e,args:i,timeout:n.value};if(a!==void 0)return{...e,args:i,rlimit:ql(a)};if(r?.kind!==`Num`)throw new S(`This argument should be a number of seconds`);return{...e,args:i,timeout:Number(`${r.integer}.${r.fraction}`)};default:throw new S(`Unknown keyword in proof method definition: ${t.hint}`)}},{args:t});if(n.args.length>0)throw new S(`Too many arguments`);if(n.prover===void 0)throw new S(`Missing prover name`);return Kl(n.prover,n.timeout,n.rlimit,n.tactic)},Yl=e=>Kl(e.name,e.timeout,void 0,e.tactic),Xl=e=>{let t=[],n={methods:[],useLocation:null};return e.context.forEach((e,r)=>{let i=e.kind===`Fact`&&e.visibility===`Visible`&&e.expression;if(i&&i.kind===`With`){n.methods.push(Yl(i.method)),t.push(void 0);return}if(e.kind===`Defn`&&e.definition.kind===`Bpragma`){t.push({kind:`Premeth`,groups:e.definition.methods});return}if(e.kind===`Defn`&&e.definition.kind===`Operator`&&e.visibility===`Visible`){let n=e.definition.body;t.push(n.kind===`With`?{kind:`Meth`,method:n.method}:void 0);return}if(t.push(void 0),!i||e.kind!==`Fact`)return;let a=i.kind===`Apply`?i.operator:i;if(a.kind!==`Ix`)return;let o=t[r-a.index];if(o?.kind===`Premeth`){e.useLocation!==n.useLocation&&(n.methods=[],n.useLocation=e.useLocation);let t=i.kind===`Apply`?i.args:[];n.methods.push(...o.groups.map(e=>Jl(e,t)))}else if(o?.kind===`Meth`){if(i.kind===`Apply`)throw new _;n.methods.push(Yl(o.method))}}),n.methods},Zl=e=>{let t=e.method===void 0?Xl(e.sequent):[Yl(e.method)],n=t.filter(e=>!Ul.has(e.prover));return{frontends:new Set(t.flatMap(e=>Ul.has(e.prover)?[e.prover]:[])),provers:n.length>0?n:Wl}},Ql=e=>er(F(0),(t,n)=>n.kind===`Defn`&&(e&&n.definition.kind===`Bpragma`||n.definition.kind===`Operator`&&n.visibility===`Visible`)?[gr(I(t,n.definition.body),t),void 0]:[vr(1,t),wr(t,n)]),$l=Ql(!0),eu=Ql(!1),tu=(e,t=!0)=>{let n=(t?$l:eu)(e.context);return{context:n.context,active:I(n.state,e.active)}},nu=/* @__PURE__ */ new Set([`BoxTrue`,`BoxFalse`,`Diamond`,`Actplus`,`Leadsto`,`Cdot`]),ru=e=>{switch(e.kind){case`Fresh`:return e.domain?[e.domain]:[];case`Flex`:return[];case`Defn`:return e.visibility===`Hidden`||e.definition.kind!==`Operator`&&e.definition.kind!==`Bpragma`?[]:[e.definition.body];case`Fact`:return e.visibility===`Hidden`?[]:[e.expression]}},iu=e=>{if(e.kind===`Tsub`||e.kind===`Fair`||e.kind===`Apply`&&e.operator.kind===`Internal`&&nu.has(e.operator.builtin))return!1;if(e.kind===`Sequent`){let t=e.sequent;return[...t.context.flatMap(ru),t.active].every(iu)}return hr(e).every(iu)},au=e=>{if(e.kind!==`Let`)return mr(e,au);let[n,...r]=e.definitions;if(!n)return au(e.body);if(n.kind!==`Operator`&&n.kind!==`Bpragma`)throw new t(n.kind===`Instance`?`Found INSTANCE in Expr.Elab.let_normalize, all INSTANCE statements have been replaced with definitions in Module.Elab `:`Expr.Elab.let_normalize`);let i=au(n.body),a={...e,definitions:r};return au(I(gr(i,F(0)),a))},ou=(e,t)=>t.kind===`Dot`?j({kind:`Dot`,expression:e,field:t.field},e):j({kind:`FcnApp`,function:e,args:[t.expression]},e),su=(e,t)=>e.kind===`Dot`?t.kind===`Dot`&&e.field===t.field:t.kind===`Apply`&&R(e.expression,t.expression),cu=(e,t)=>{let n=t.kind===`Dot`?t.field:t.expression.kind===`String`?t.expression.value:void 0;return e.kind===`Record`&&n!==void 0?e.fields.find(e=>e.name===n):void 0},lu=e=>{if(e.kind!==`Except`)return mr(e,lu);let t=e,n=(e,t)=>cu(e,t)?.value??ou(e,t),r=(e,n,r)=>{let i=cu(e,n);if(e.kind!==`Record`||!i)return j({kind:`Except`,function:e,specs:[{trail:[n],value:r}]},t);let a=e.fields.map(e=>e.name===i.name?{name:e.name,value:r}:e);return j({kind:`Record`,fields:a},e)},i=(e,t)=>{let[a,...o]=t;if(!a)return e;if(a.trail.length===0)return i(a.value,o);let s=a.trail[0],c=t.findIndex(e=>e.trail.length===0||!su(e.trail[0],s)),l=c===-1?t.length:c,u=t.slice(0,l).map(e=>({trail:e.trail.slice(1),value:e.value}));return i(r(e,s,i(n(e,s),u)),t.slice(l))};return i(lu(t.function),ur(t.specs,lu))},uu=er(!0,(e,t)=>[e&&ru(t).every(iu),fr(t,au,`all`)]),du=er(void 0,(e,t)=>[void 0,fr(t,lu,`all`)]),fu=e=>{let t=uu(e.context),n=au(e.active);return t.state&&iu(e.active)?{context:du(e.context,t.context).context,active:lu(n)}:{context:t.context,active:n}},pu=(e,t)=>{let n=t.has(`expandenabled`),r=t.has(`expandcdot`),i=t.has(`autouse`),a=t.has(`lambdify`);if(!n&&!r&&!a)return t.has(`levelcomparison`)?Hl(e):t.has(`enabledaxioms`)?Ml(e):e;let o=bi({value:0},()=>{throw new _},()=>{}),s={kind:`Sequent`,sequent:e},c=n||r?za(o,()=>{},void 0,s,{isEnabled:n,isCdot:r,isAutoUse:i}):Ia(o,()=>{},void 0,s,{isEnabled:!0,isCdot:!0,isAutoUse:i});if(c.kind!==`Sequent`)throw new _;return c.sequent},mu=(e,t=Zl(e))=>pu(fu(tu(e.sequent)),t.frontends),hu=e=>e.active.kind===`Internal`&&e.active.builtin===`TRUE`||e.context.some((t,n)=>t.kind===`Fact`?R(t.expression,L(n-e.context.length,e.active)):t.kind!==`Fresh`||!t.domain?!1:R(M(`Mem`,[{kind:`Ix`,index:1},L(1,t.domain)],{}),L(n+1-e.context.length,e.active))),gu=e=>e.domain.kind===`NoDomain`,_u=e=>{if(e.kind===`List`&&(e.bullet===`And`||e.bullet===`Refs`)){let t=e.items.map(_u),n=t.flatMap(e=>e[0]),r=t.flatMap(e=>e[1]?[e[1]]:[]);return r.length<=1?[n,r[0]]:[n,{...e,bullet:`And`,items:r}]}if(e.kind===`Apply`&&e.operator.kind===`Internal`){let t=e.operator.builtin;if(t===`Conj`&&e.args.length===2){let t=_u(e.args[0]),n=_u(e.args[1]),r=[...t[0],...n[0]];return t[1]&&n[1]?[r,{...e,args:[t[1],n[1]]}]:[r,t[1]??n[1]]}if(t===`Eq`)return[[e],void 0]}if(e.kind===`Internal`&&e.builtin===`TRUE`)return[[],void 0];if(e.kind===`Quant`&&e.quantifier===`Forall`&&e.bounds.every(gu)){let t=_u(e.body),n=(t,n)=>j({kind:`Quant`,quantifier:`Forall`,bounds:e.bounds,body:t},n);return[t[0].map(e=>n(e,e)),t[1]&&n(t[1],e)]}return[[],e]},vu=e=>{let t=[],n=e.context.reduce((e,n)=>{if(n.kind!==`Fact`||n.visibility!==`Visible`)return t.push(wr(e,n)),vr(1,e);let r=_u(n.expression),i=[...r[1]?[r[1]]:[],...r[0]];return i.forEach((r,i)=>t.push({...n,expression:L(i,I(e,r))})),{kind:`Compose`,outer:F(i.length-1),inner:vr(1,e)}},F(0));return{context:t,active:I(n,e.active)}},yu=(e,t)=>{let[n,r]=$n(e,t.context,(e,t)=>{let n=(()=>{switch(t.kind){case`Fresh`:return{...t,name:`${Uc[t.level]}_${t.name}_`,domain:t.domain&&bu(e,t.domain)};case`Flex`:return{...t,name:`VARIABLE_${t.name}_`};case`Defn`:{let n=t.definition;if(n.kind!==`Operator`)return t;let r=bu(e,n.body),i=Wc[pa(e,r).level];return{...t,definition:{...n,name:`${i}_${n.name}_`,body:r}}}case`Fact`:return{...t,expression:bu(e,t.expression)}}})();return[N(e,n),n]});return{context:r,active:bu(n,t.active)}},bu=(e,t)=>{if(t.kind===`Sequent`)return{...t,sequent:yu(e,t.sequent)};let n=pr(e,t,bu,N,`all`);switch(n.kind){case`Lambda`:return{...n,params:n.params.map(e=>({...e,name:`Unknown_${e.name}_`}))};case`Quant`:case`Fcn`:case`SetOf`:return{...n,bounds:n.bounds.map(e=>({...e,name:`${Uc[e.level]}_${e.name}_`}))};case`Choose`:case`SetSt`:return{...n,name:`CONSTANT_${n.name}_`};default:return n}},xu=(e,t)=>{if(t.kind!==`Sequent`)return pr(e,t,xu,N,`all`);let n={scope:e,substitution:F(0),context:[]},r=e=>{let t=e.kind===`Fact`&&e.visibility===`Visible`&&e.time===`Always`?{...e,expression:M(`BoxTrue`,[e.expression],e.expression)}:e;n.context.push(t),n.scope=N(n.scope,t)};for(let e of t.sequent.context){let t=wr(n.substitution,e);if(t.kind!==`Fresh`||!t.domain||e.kind!==`Fresh`||!e.domain){r(t.kind===`Fact`?{...t,expression:xu(n.scope,t.expression)}:t),n.substitution=vr(1,n.substitution);continue}let i=xu(n.scope,t.domain);r({...t,domain:void 0}),r({kind:`Fact`,expression:M(`Mem`,[j({kind:`Ix`,index:1},i),L(1,i)],i),visibility:t.domainVisibility,time:t.level===`Constant`?fi(n.scope,e.domain):`Now`,location:t.location}),n.substitution={kind:`Compose`,outer:F(1),inner:vr(1,n.substitution)}}let i=I(n.substitution,t.sequent.active);return{...t,sequent:{context:n.context,active:xu(n.scope,i)}}},Su={Conj:`&`,Disj:`|`,Implies:`->`,Equiv:`<->`},Cu={Neg:`~`,BoxTrue:`always`,BoxFalse:`always`,Diamond:`sometime`,Prime:`next`},wu=e=>{if(e.kind===`Internal`&&e.builtin===`TRUE`)return;if(e.kind===`List`&&e.bullet!==`Or`){let t=e.items.flatMap(e=>wu(e)??[]);return t.length<=1?t[0]:{...e,bullet:`And`,items:t}}if(e.kind!==`Apply`||e.operator.kind!==`Internal`||e.operator.builtin!==`Conj`||e.args.length!==2)return e;let t=wu(e.args[0]),n=wu(e.args[1]);return t&&n?{...e,args:[t,n]}:t??n},Tu=`(cc | ~ cc)`,Eu=e=>{let t=(e,n,r=!1)=>{let i=n=>t(e,n);switch(n.kind){case`Internal`:if(n.builtin===`TRUE`)return Tu;if(n.builtin===`FALSE`)return`(cc & ~ cc)`;break;case`Apply`:{let e=n.operator,t=n.args;if(e.kind!==`Internal`)break;let r=Su[e.builtin];if(r&&t.length===2)return`(${i(t[0])} ${r} ${i(t[1])})`;let a=Cu[e.builtin];if(a&&t.length===1)return`(${a} ${i(t[0])})`;break}case`List`:{if(n.items.length===0)return Tu;let e=n.bullet===`Or`?`|`:`&`;return n.items.map(i).reduceRight((t,n)=>`(${n} ${e} ${t})`)}case`Sequent`:{let i=[...e],a=[];for(let e of n.sequent.context){let n=e.kind!==`Fact`||e.visibility!==`Visible`?void 0:r?wu(e.expression):e.expression;n&&a.push(t(i,n)),i.push(e)}let o=t(i,n.sequent.active);return a.length===0?o:`(${a.join(` & `)} -> ${o})`}}return il(e,n)},n=bu(void 0,{kind:`Sequent`,sequent:e});return`not (${t([],xu(void 0,ii(ni(ri(n)))),!0)})`},Du=(e,t)=>e<t?-1:+(e>t),Ou=(e,t)=>{if(typeof e==`number`&&typeof t==`number`)return e-t;if(typeof e==`string`&&typeof t==`string`)return Du(e,t);if(!Array.isArray(e)||!Array.isArray(t))return 0;let n=e.findIndex((e,n)=>n>=t.length||Ou(e,t[n])!==0);return n===-1?e.length-t.length:n>=t.length?1:Ou(e[n],t[n])},ku={"\\":`backslash_`,"+":`plussign_`,"-":`hyphen_`,"*":`asterisk_`,"/":`slash_`,"%":`percentsign_`,"^":`circumflexaccent_`,"&":`ampersand_`,"@":`atsign_`,"#":`pound_`,$:`dollarsign_`,"(":`leftparenthesis_`,")":`rightparenthesis_`,"|":`verticalbar_`,".":`period_`,":":`colon_`,"?":`questionmark_`,"!":`exclamationmark_`,"<":`lessthansign_`,">":`greaterthansign_`,"=":`equalsign_`," ":`space_`},Au=e=>`smt__${e.replace(/[\\+\-*/%^&@#$()|.:?!<>= ]/g,e=>ku[e]).replaceAll(`_`,`__`)}`,ju=Au(`TLA__`),Mu=new Map(Object.entries(ku).map(e=>[e[1],e[0]])),Nu=RegExp(`(${[...Mu.keys()].join(`|`)})`,`g`),W=e=>Au(`TLA__${e}`),Pu=e=>e.startsWith(ju)?e.slice(ju.length).replaceAll(`__`,`_`).replace(Nu,e=>Mu.get(e)??e):void 0,G=W(`Mem`),Fu=W(`SetExtTrigger`),Iu=W(`SubsetEq`),Lu=W(`Cup`),Ru=W(`Cap`),zu=W(`SetMinus`),Bu=W(`Subset`),Vu=W(`Union`),Hu=W(`Tt_Idv`),Uu=W(`Cast_Bool`),Wu=W(`BoolSet`),Gu=W(`StrSet`),Ku=W(`IntSet`),qu=W(`NatSet`),K=W(`Cast_Int`),q=W(`Proj_Int`),Ju=W(`IntLteq`),Yu=W(`IntRange`),J=W(`FunApp`),Xu=W(`FunDom`),Zu=W(`FunIsafcn`),Qu=W(`FunSet`),$u=W(`FunExcept`),ed=W(`TrigEq_Set$Idv$`),td=W(`IsSetOf`),Y=W(`Seq`),X=W(`Len`),nd=W(`Cat`),rd=W(`Append`),id=W(`Head`),ad=W(`Tail`),od=W(`SubSeq`),sd=W(`Tuple_0`),cd={Cup:Lu,Cap:Ru,Setminus:zu,SUBSET:Bu,UNION:Vu,DOMAIN:Xu,Plus:W(`IntPlus`),Minus:W(`IntMinus`),Times:W(`IntTimes`),Exp:W(`IntExp`),Quotient:W(`IntQuotient`),Remainder:W(`IntRemainder`),Uminus:W(`IntUminus`),Range:Yu,Seq:Y,Len:X,BSeq:W(`BSeq`),Cat:nd,Append:rd,Head:id,Tail:ad,SubSeq:od},ld=(e,t)=>Array.from({length:t},(t,n)=>`${e}${n+1}`),ud=(e,t=`Idv`)=>e.map(e=>`(${e} ${t})`).join(` `),Z=(e,t,n=[],r=`Idv`)=>e.length===0?t:`(forall (${ud(e,r)}) ${n.length===0?t:`(! ${t} ${n.map(e=>`:pattern (${e.join(` `)})`).join(` `)})`})`,dd=e=>e.length===0?`true`:e.length===1?e[0]:`(and ${e.join(` `)})`,fd=e=>e.length===0?`false`:e.length===1?e[0]:`(or ${e.join(` `)})`,Q=(e,t)=>t.length===0?e:`(${e} ${t.join(` `)})`,pd=(e,t,n=`Idv`,r=`Idv`)=>`(declare-fun ${e} (${Array.from({length:t},()=>r).join(` `)}) ${n})`,md=(e,t)=>{let n={depth:0,index:t};for(;n.index<e.length;n.index++)if(e[n.index]===`(`&&n.depth++,e[n.index]===`)`&&n.depth--,n.depth===0)return n.index;return e.length},hd=(e,t,n)=>e.replace(/[^\s()]+/g,e=>e===t?n:e),gd=(e,t)=>t===0?e:`${e}_${t}`,_d=()=>{let e=/* @__PURE__ */ new Map,t=/* @__PURE__ */ new Set;return{names:t,adjoin:n=>{let r=Au(n),i=(e.get(r)??-1)+1,a=Array.from({length:t.size+1},(e,t)=>i+t).find(e=>!t.has(gd(r,e)))??i;return{base:r,salt:a,name:gd(r,a)}},enter:n=>{let r=e.get(n.base);return e.set(n.base,n.salt),t.add(n.name),()=>{t.delete(n.name),r===void 0?e.delete(n.base):e.set(n.base,r)}}}},vd=e=>{let t=_d();return{resolve:n=>{let r=/^\(declare-fun (\S+)/.exec(n)?.[1];if(r!==void 0){let i=e.get(r);return i?t.enter(i):t.names.add(r),n}let i=[...n.matchAll(/\|[^|]*\||[()]|[^\s()|]+/g)],a=/* @__PURE__ */ new Map,o=/* @__PURE__ */ new Map,s=[],c={index:0,depth:0};for(;c.index<i.length;){let e=i[c.index][0];if(e===`(`&&(i[c.index+1]?.[0]===`forall`||i[c.index+1]?.[0]===`exists`)&&i[c.index+2]?.[0]===`(`){c.depth++;let e={depth:c.depth,exits:[]};for(s.push(e),c.index+=3;i[c.index]?.[0]===`(`;){let n=i[c.index+1][0],r=t.adjoin(n.replace(/#\d+$/,``)),s=o.get(n)??[];o.set(n,[...s,r.name]),e.exits.push(t.enter(r),()=>o.set(n,s)),a.set(c.index+1,r.name),c.index+=4}c.index++;continue}e===`(`&&c.depth++,e===`)`&&(s.at(-1)?.depth===c.depth&&s.pop()?.exits.toReversed().forEach(e=>e()),c.depth--);let n=o.get(e)?.at(-1);n!==void 0&&a.set(c.index,n),c.index++}return i.map((e,t)=>{let r=i[t+1]?.index??n.length;return`${a.get(t)??e[0]}${n.slice(e.index+e[0].length,r)}`}).join(``)}}},yd=/* @__PURE__ */ `ChooseDef.ChooseExt.SetExt.SubsetEqDef.SubsetEqIntro.SubsetEqElim.UnionDef.UnionIntro.UnionElim.SubsetDef.SubsetDefAlt.SubsetIntro.SubsetElim.CupDef.CapDef.SetMinusDef.SetStDef.NatSetDef.IntPlusTyping.IntUminusTyping.IntMinusTyping.IntTimesTyping.IntQuotientTyping.IntRemainderTyping.IntExpTyping.NatPlusTyping.NatTimesTyping.IntRangeDef.NonNegIsPos.LteqReflexive.LteqTransitive.LteqAntisym.FunExt.FunConstrIsafcn.FunSetDef.FunSetIntro.FunSetElim1.FunSetElim2.FunSetImIntro.FunSetSubs.FunDomDef.FunAppDef.FunTyping.FunExceptIsafcn.FunExceptDomDef.FunExceptAppDef1.FunExceptAppDef2.FunExceptTyping.FunImDef.FunImIntro.FunImElim.SeqSetIntro.SeqSetElim1.SeqSetElim2.SeqLenDef.SeqCatTyping.SeqCatLen.SeqCatApp1.SeqCatApp2.SeqAppendTyping.SeqAppendLen.SeqAppendApp1.SeqAppendApp2.SeqHeadDef.SeqTailTyping.SeqTailLen.SeqTailApp.SeqSubseqTyping.SeqSubseqLen.SeqSubseqApp.SeqSelectseqTyping.SeqSelectseqLen.SeqSelectseqNil.SeqSelectseqApp.SeqSelectseqAppend.DisjointTrigger.EmptyComprehensionTrigger.CompareSetOfTrigger`.split(`.`),bd=/* @__PURE__ */ `EnumDef.EnumDefIntro.EnumDefElim.SetOfDef.SetOfIntro.SetOfElim.StrLitIsstr.StrLitDistinct.IntLitIsint.IntLitDistinct.IntLitZeroCmp.TupIsafcn.TupDomDef.TupAppDef.TupExcept.ProductDef.ProductIntro.ProductElim.RecIsafcn.RecDomDef.RecAppDef.RecExcept.RecSetDef.RecSetIntro.RecSetElim.SeqTupTyping.SeqTupLen.CastInj.CastInjAlt.TypeGuard.TypeGuardIntro.TypeGuardElim.Typing.ExtTrigEqDef.ExtTrigEqTrigger.AssertIsSetOf`.split(`.`),xd=[`TIntPlus`,`TIntUminus`,`TIntMinus`,`TIntTimes`,`TIntQuotient`,`TIntRemainder`,`TIntLteq`],$=(e,t,n,r)=>({name:e,args:t,label:r??[e,...t.flat()].join(` `),formula:n}),Sd=e=>`${e.name} ${JSON.stringify(e.args)}`,Cd=e=>{let t=yd.indexOf(e.name);return t===-1?yd.length+bd.indexOf(e.name):t},wd=(e,t)=>Cd(e)-Cd(t)||Ou(e.args,t.args),Td={IntPlus:[`+`,2],IntMinus:[`-`,2],IntTimes:[`*`,2],IntUminus:[`-`,1],IntQuotient:[`div`,2],IntRemainder:[`mod`,2],IntLteq:[`<=`,2]},Ed=e=>{let t=Td[e][0],n=t===`div`||t===`mod`,r=Td[e][1]===1?[`x1`]:n?[`x`,`y`]:[`x1`,`x2`],i=Q(W(e),r.map(e=>`(${K} ${e})`)),a=`(= ${i} ${t===`<=`?`(<= ${r.join(` `)})`:`(${K} (${t} ${r.join(` `)}))`})`;return $(`Typing`,[xd.indexOf(`T${e}`)],Z(r,n?`(=> (> y 0) ${a})`:a,[[i]],`Int`),`Typing T${e}`)},Dd=e=>{let t=W(`SetEnum_${e}`),n=ld(`a`,e),r=Q(t,n),i=$(`EnumDefElim`,[e],Z([...n,`x`],e===0?`(not (${G} x ${r}))`:`(=> (${G} x ${r}) ${fd(n.map(e=>`(= x ${e})`))})`,[[`(${G} x ${r})`]]));return e===0?[i]:[$(`EnumDefIntro`,[e],Z(n,dd(n.map(e=>`(${G} ${e} ${r})`)),[[r]])),i]},Od=e=>Array.from({length:e},(e,t)=>`(${K} ${t+1})`),kd=e=>e.map(e=>W(`StrLit_${e}`)),Ad=(e,t,n,r)=>{let i=ld(`x`,r.length);return r.map((r,a)=>{let o=`(${$u} ${Q(n,i)} ${r} x)`,s=i.map((e,t)=>t===a?`x`:e);return $(`${e}Except`,[...t,a+1],Z([...i,`x`],`(= ${o} ${Q(n,s)})`,[[o]]))})},jd=e=>Ad(`Tup`,[e],W(`Tuple_${e}`),Od(e)),Md=e=>Ad(`Rec`,[e],W(`Record_${e.join(`_`)}`),kd(e)),Nd=(e,t,n,r)=>{let i=ld(`x`,r.length),a=Q(n,i),o=$(`${e}Isafcn`,t,Z(i,`(${Zu} ${a})`,[[a]]));return r.length===0?[o]:[o,$(`${e}DomDef`,t,Z(i,`(= (${Xu} ${a}) ${Q(W(`SetEnum_${r.length}`),r)})`,[[a]])),$(`${e}AppDef`,t,Z(i,dd(r.map((e,t)=>`(= (${J} ${a} ${e}) ${i[t]})`)),[[a]]))]},Pd=(e,t)=>{let n=W(`Tuple_${e}`),r=ld(`x`,e),i=Q(n,r);return[...Nd(`Tup`,[e],n,Od(e)),$(`SeqTupTyping`,[e],Z([`a`,...r],e===0?`(${G} ${i} (${Y} a))`:`(=> ${dd(r.map(e=>`(${G} ${e} a)`))} (${G} ${i} (${Y} a)))`,[[...r.map(e=>`(${G} ${e} a)`),i]])),$(`SeqTupLen`,[e],Z(r,`(= (${X} ${i}) (${K} ${e}))`,[[i]])),...t?jd(e):[]]},Fd=(e,t)=>[...Nd(`Rec`,[e],W(`Record_${e.join(`_`)}`),kd(e)),...t?Md(e):[]],Id=(e,t,n,r,i,a)=>{let o=ld(`s`,i.length),s=ld(`x`,i.length),c=Q(n,o),l=Q(r,s),u=i.map(e=>`(${J} ${a} ${e})`);return[$(`${e}Intro`,t,Z([...o,...s],`(=> ${dd(s.map((e,t)=>`(${G} ${e} ${o[t]})`))} (${G} ${l} ${c}))`,[[l,c]])),$(`${e}Elim`,t,Z([...o,a],`(=> (${G} ${a} ${c}) ${dd([`(= ${a} ${Q(r,u)})`,...u.map((e,t)=>`(${G} ${e} ${o[t]})`)])})`,[[`(${G} ${a} ${c})`]]))]},Ld=[`Mem`,`Seq`,`Len`,`FunApp`,`NatSet`,`Cast_Int`,`Proj_Int`],Rd=(e,t)=>{let n=(e,t,n)=>({declaration:e,deps:t,axioms:n}),r=W(e),i=(e,t,i,a=`Idv`)=>n(pd(r,e,a),t,i),a=/^SetEnum_(\d+)$/.exec(e);if(a)return i(Number(a[1]),[`Mem`],Dd(Number(a[1])));let o=/^SetOf_(\d+)$/.exec(e);if(o){let e=Number(o[1]);return n(void 0,[`Mem`,`IsSetOf`],[$(`SetOfIntro`,[e],void 0),$(`SetOfElim`,[e],void 0),$(`AssertIsSetOf`,[e],void 0),$(`CompareSetOfTrigger`,[],Z([`a`,`b`],`(${Fu} a b)`,[[`(${td} a)`,`(${td} b)`]]))])}if(e.startsWith(`StrLit_`)){let n=e.slice(7),a=t.strings.map(e=>$(`StrLitDistinct`,[n,e],`(distinct ${r} ${W(`StrLit_${e}`)})`));return t.strings.push(n),i(0,[`Mem`,`StrSet`],[$(`StrLitIsstr`,[n],`(${G} ${r} ${Gu})`),...a])}let s=/^Tuple_(\d+)$/.exec(e);if(s){let e=Number(s[1]);return t.tuples.push(e),i(e,e===0?[`FunIsafcn`,`Cast_Int`,`Seq`,`Len`]:[`FunIsafcn`,`FunDom`,`FunApp`,`SetEnum_${e}`,`Cast_Int`,`Mem`,`Seq`,`Len`],Pd(e,t.isExcept))}let c=/^Product_(\d+)$/.exec(e);if(c){let e=Number(c[1]);return i(e,[`Mem`,`Tuple_${e}`,`FunApp`,`Cast_Int`,`Proj_Int`],Id(`Product`,[e],r,W(`Tuple_${e}`),Od(e),`t`))}let l=t.recordFields.get(e);if(l&&e.startsWith(`Record_`))return t.records.push(l),i(l.length,[`FunIsafcn`,`FunDom`,`FunApp`,`SetEnum_${l.length}`,...l.map(e=>`StrLit_${e}`)],Fd(l,t.isExcept));if(l&&e.startsWith(`RecordSet_`)){let e=`Record_${l.join(`_`)}`;return i(l.length,[`Mem`,e,`FunApp`,...l.map(e=>`StrLit_${e}`)],Id(`RecSet`,[l],r,W(e),kd(l),`r`))}let u=t.anonymous.get(e);if(u!==void 0)return i(u,[],[]);let d=Td[e];if(d)return i(d[1],[`Cast_Int`],[Ed(e)],e===`IntLteq`?`Bool`:`Idv`);switch(e){case`IntExp`:return i(2,[`Mem`,`IntSet`,`Cast_Int`,`TIntLteq`,`TIntLit_0`,`TIntLit_1`],[$(`IntExpTyping`,[],`(forall ((x Idv) (y Idv)) (! (=> (and (${G} x ${Ku}) (${G} y ${Ku}) (or (distinct x (${K} 0)) (${Ju} (${K} 1) y))) (${G} (${r} x y) ${Ku})) :pattern ((${r} x y))))`)]);case`SelectSeq`:return n(void 0,[`Mem`,`Seq`,`Len`,`Append`,`FunApp`,`FunDom`,`IntSet`,`NatSet`,`Tuple_0`,`Proj_Int`],[$(`SeqSelectseqTyping`,[],void 0),$(`SeqSelectseqLen`,[],void 0),$(`SeqSelectseqNil`,[],void 0),$(`SeqSelectseqApp`,[],void 0),$(`SeqSelectseqAppend`,[],void 0)]);case`Choose`:return n(void 0,[],[$(`ChooseDef`,[],void 0)]);case`Mem`:return i(2,[`SetExtTrigger`],[$(`SetExt`,[],`(forall ((x Idv) (y Idv)) (! (=> (forall ((z Idv)) (= (${G} z x) (${G} z y))) (= x y)) :pattern ((${Fu} x y))))`)],`Bool`);case`SubsetEq`:return i(2,[`Mem`],[$(`SubsetEqIntro`,[],`(forall ((x Idv) (y Idv)) (! (=> (forall ((z Idv)) (=> (${G} z x) (${G} z y))) (${Iu} x y)) :pattern ((${Iu} x y))))`),$(`SubsetEqElim`,[],`(forall ((x Idv) (y Idv) (z Idv)) (! (=> (and (${Iu} x y) (${G} z x)) (${G} z y)) :pattern ((${Iu} x y) (${G} z x))))`)],`Bool`);case`Union`:return i(1,[`Mem`],[$(`UnionIntro`,[],`(forall ((a Idv) (x Idv) (y Idv)) (! (=> (and (${G} y a) (${G} x y)) (${G} x (${Vu} a))) :pattern ((${G} y a) (${G} x (${Vu} a))) :pattern ((${G} x y) (${G} x (${Vu} a))) :pattern ((${G} y a) (${G} x y) (${Vu} a))))`),$(`UnionElim`,[],`(forall ((a Idv) (x Idv)) (! (=> (${G} x (${Vu} a)) (exists ((y Idv)) (and (${G} y a) (${G} x y)))) :pattern ((${G} x (${Vu} a)))))`)]);case`Subset`:return i(1,[`Mem`,`SubsetEq`],[$(`SubsetDefAlt`,[],`(forall ((a Idv) (x Idv)) (! (= (${G} x (${Bu} a)) (${Iu} x a)) :pattern ((${G} x (${Bu} a))) :pattern ((${Iu} x a) (${Bu} a))))`)]);case`Cup`:case`Cap`:case`SetMinus`:{let t=e===`Cup`?`(or (MEM x a) (MEM x b))`:e===`Cap`?`(and (MEM x a) (MEM x b))`:`(and (MEM x a) (not (MEM x b)))`,n=$(`${e}Def`,[],`(forall ((a Idv) (b Idv) (x Idv)) (! (= (${G} x (${r} a b)) ${t.replaceAll(`MEM`,G)}) :pattern ((${G} x (${r} a b))) :pattern ((${G} x a) (${r} a b)) :pattern ((${G} x b) (${r} a b))))`);return e===`Cap`?i(2,[`Mem`,`SetEnum_0`,`SetExtTrigger`],[n,$(`DisjointTrigger`,[],`(forall ((x Idv) (y Idv)) (! (${Fu} (${Ru} x y) ${W(`SetEnum_0`)}) :pattern ((${Ru} x y))))`)]):i(2,[`Mem`],[n])}case`SetSt`:return n(void 0,[`Mem`,`SetEnum_0`,`SetExtTrigger`],[$(`SetStDef`,[],void 0),$(`EmptyComprehensionTrigger`,[],void 0)]);case`NatSet`:return i(0,[`IntSet`,`TIntLit_0`,`Cast_Int`,`IntLteq`],[$(`NatSetDef`,[],`(forall ((x Idv)) (! (= (${G} x ${qu}) (and (${G} x ${Ku}) (${Ju} (${K} 0) x))) :pattern ((${G} x ${qu}))))`)]);case`IntRange`:return i(2,[`Mem`,`IntSet`,`IntLteq`],[$(`IntRangeDef`,[],`(forall ((a Idv) (b Idv) (x Idv)) (! (= (${G} x (${Yu} a b)) (and (${G} x ${Ku}) (${Ju} a x) (${Ju} x b))) :pattern ((${G} x (${Yu} a b)))))`)]);case`FunIsafcn`:return i(1,[`Mem`,`FunDom`,`FunFcn`,`FunApp`],[$(`FunExt`,[],`(forall ((f Idv) (g Idv)) (! (=> (and (${Zu} f) (${Zu} g) (= (${Xu} f) (${Xu} g)) (forall ((x Idv)) (=> (${G} x (${Xu} f)) (= (${J} f x) (${J} g x))))) (= f g)) :pattern ((${Zu} f) (${Zu} g))))`)],`Bool`);case`FunSet`:return t.isFunSet=!0,i(2,[`Mem`,`FunIsafcn`,`FunDom`,`FunApp`],[$(`FunSetIntro`,[],`(forall ((a Idv) (b Idv) (f Idv)) (! (=> (and (${Zu} f) (= (${Xu} f) a) (forall ((x Idv)) (=> (${G} x a) (${G} (${J} f x) b)))) (${G} f (${Qu} a b))) :pattern ((${G} f (${Qu} a b)))))`),$(`FunSetElim1`,[],`(forall ((a Idv) (b Idv) (f Idv)) (! (=> (${G} f (${Qu} a b)) (and (${Zu} f) (= (${Xu} f) a))) :pattern ((${G} f (${Qu} a b)))))`),$(`FunSetElim2`,[],`(forall ((a Idv) (b Idv) (f Idv) (x Idv)) (! (=> (and (${G} f (${Qu} a b)) (${G} x a)) (${G} (${J} f x) b)) :pattern ((${G} f (${Qu} a b)) (${G} x a)) :pattern ((${G} f (${Qu} a b)) (${J} f x))))`),...t.isFunConstr?[$(`FunTyping`,[],void 0)]:[]]);case`FunFcn`:return t.isFunConstr=!0,n(void 0,[`FunIsafcn`],[$(`FunConstrIsafcn`,[],void 0),...t.isFunSet?[$(`FunTyping`,[],void 0)]:[]]);case`FunDom`:return i(1,[`FunFcn`],[$(`FunDomDef`,[],void 0)]);case`FunApp`:return i(2,[`Mem`,`FunFcn`],[$(`FunAppDef`,[],void 0)]);case`FunExcept`:{t.isExcept=!0;let e=`(${$u} f x y)`;return i(3,[`Mem`,`FunIsafcn`,`FunDom`,`FunApp`],[$(`FunExceptIsafcn`,[],`(forall ((f Idv) (x Idv) (y Idv)) (! (${Zu} ${e}) :pattern (${e})))`),$(`FunExceptDomDef`,[],`(forall ((f Idv) (x Idv) (y Idv)) (! (= (${Xu} ${e}) (${Xu} f)) :pattern (${e})))`),$(`FunExceptAppDef1`,[],`(forall ((f Idv) (x Idv) (y Idv)) (! (=> (${G} x (${Xu} f)) (= (${J} ${e} x) y)) :pattern (${e})))`),$(`FunExceptAppDef2`,[],`(forall ((f Idv) (x Idv) (y Idv) (z Idv)) (! (=> (${G} z (${Xu} f)) (and (=> (= z x) (= (${J} ${e} z) y)) (=> (distinct z x) (= (${J} ${e} z) (${J} f z))))) :pattern ((${J} ${e} z)) :pattern (${e} (${J} f z))))`),...t.tuples.flatMap(jd),...t.records.flatMap(Md)])}case`Seq`:return i(1,[`Mem`,`Len`,`FunIsafcn`,`FunDom`,`FunApp`,`IntSet`,`NatSet`,`IntRange`,`Cast_Int`,`Proj_Int`],[$(`SeqSetIntro`,[],`(forall ((a Idv) (s Idv)) (! (=> (and (${Zu} s) (>= (${q} (${X} s)) 0) (forall ((i Idv)) (= (${G} i (${Xu} s)) (and (${G} i ${Ku}) (<= 1 (${q} i)) (<= (${q} i) (${q} (${X} s)))))) (forall ((i Int)) (=> (and (<= 1 i) (<= i (${q} (${X} s)))) (${G} (${J} s (${K} i)) a)))) (${G} s (${Y} a))) :pattern ((${G} s (${Y} a)))))`),$(`SeqSetElim1`,[],`(forall ((a Idv) (s Idv)) (! (=> (${G} s (${Y} a)) (and (${Zu} s) (${G} (${X} s) ${qu}) (= (${Xu} s) (${Yu} (${K} 1) (${X} s))))) :pattern ((${G} s (${Y} a)))))`,`SetSetElim1`),$(`SeqSetElim2`,[],`(forall ((a Idv) (s Idv) (i Int)) (! (=> (and (${G} s (${Y} a)) (<= 1 i) (<= i (${q} (${X} s)))) (${G} (${J} s (${K} i)) a)) :pattern ((${G} s (${Y} a)) (${J} s (${K} i)))))`,`SetSetElim2`)]);case`Len`:return i(1,[`FunDom`,`IntRange`,`Cast_Int`],[$(`SeqLenDef`,[],`(forall ((s Idv) (z Int)) (=> (and (>= z 0) (= (${Xu} s) (${Yu} (${K} 1) (${K} z)))) (= (${X} s) (${K} z))))`)]);case`BSeq`:return i(1,[],[]);case`Cat`:return i(2,Ld,[$(`SeqCatTyping`,[],`(forall ((a Idv) (s Idv) (t Idv)) (! (=> (and (${G} s (${Y} a)) (${G} t (${Y} a))) (${G} (${nd} s t) (${Y} a))) :pattern ((${G} s (${Y} a)) (${nd} s t)) :pattern ((${G} t (${Y} a)) (${nd} s t))))`),$(`SeqCatLen`,[],`(forall ((s Idv) (t Idv)) (! (=> (and (${G} (${X} s) ${qu}) (${G} (${X} t) ${qu})) (= (${X} (${nd} s t)) (${K} (+ (${q} (${X} s)) (${q} (${X} t)))))) :pattern ((${nd} s t))))`),$(`SeqCatApp1`,[],`(forall ((s Idv) (t Idv) (i Int)) (! (=> (and (${G} (${X} s) ${qu}) (${G} (${X} t) ${qu}) (<= 1 i) (<= i (${q} (${X} s)))) (= (${J} (${nd} s t) (${K} i)) (${J} s (${K} i)))) :pattern ((${J} (${nd} s t) (${K} i))) :pattern ((${nd} s t) (${J} s (${K} i)))))`),$(`SeqCatApp2`,[],`(forall ((s Idv) (t Idv) (i Int)) (! (=> (and (${G} (${X} s) ${qu}) (${G} (${X} t) ${qu}) (<= i (+ (${q} (${X} s)) (${q} (${X} t)))) (< (${q} (${X} s)) i)) (= (${J} (${nd} s t) (${K} i)) (${J} t (${K} (- i (${q} (${X} s))))))) :pattern ((${J} (${nd} s t) (${K} i)))))`)]);case`Append`:return i(2,Ld,[$(`SeqAppendTyping`,[],`(forall ((a Idv) (s Idv) (x Idv)) (! (=> (and (${G} s (${Y} a)) (${G} x a)) (${G} (${rd} s x) (${Y} a))) :pattern ((${G} s (${Y} a)) (${rd} s x))))`),$(`SeqAppendLen`,[],`(forall ((s Idv) (x Idv)) (! (=> (${G} (${X} s) ${qu}) (= (${X} (${rd} s x)) (${K} (+ (${q} (${X} s)) 1)))) :pattern ((${rd} s x))))`),$(`SeqAppendApp1`,[],`(forall ((s Idv) (x Idv) (i Int)) (! (=> (and (${G} (${X} s) ${qu}) (<= 1 i) (<= i (${q} (${X} s)))) (= (${J} (${rd} s x) (${K} i)) (${J} s (${K} i)))) :pattern ((${J} (${rd} s x) (${K} i))) :pattern ((${rd} s x) (${J} s (${K} i)))))`),$(`SeqAppendApp2`,[],`(forall ((s Idv) (x Idv)) (! (=> (${G} (${X} s) ${qu}) (= (${J} (${rd} s x) (${K} (+ (${q} (${X} s)) 1))) x)) :pattern ((${rd} s x))))`)]);case`Head`:return i(1,[`FunApp`,`Cast_Int`],[$(`SeqHeadDef`,[],`(forall ((s Idv)) (! (= (${id} s) (${J} s (${K} 1))) :pattern ((${id} s))))`)]);case`Tail`:return i(1,Ld,[$(`SeqTailTyping`,[],`(forall ((a Idv) (s Idv)) (! (=> (and (${G} s (${Y} a)) (distinct (${q} (${X} s)) 0)) (${G} (${ad} s) (${Y} a))) :pattern ((${G} s (${Y} a)) (${ad} s))))`),$(`SeqTailLen`,[],`(forall ((s Idv)) (! (=> (and (${G} (${X} s) ${qu}) (distinct (${q} (${X} s)) 0)) (= (${X} (${ad} s)) (${K} (- (${q} (${X} s)) 1)))) :pattern ((${ad} s))))`),$(`SeqTailApp`,[],`(forall ((s Idv) (i Int)) (! (=> (and (${G} (${X} s) ${qu}) (distinct (${q} (${X} s)) 0) (<= 1 i) (<= i (- (${q} (${X} s)) 1))) (= (${J} (${ad} s) (${K} i)) (${J} s (${K} (+ i 1))))) :pattern ((${J} (${ad} s) (${K} i)))))`)]);case`SubSeq`:{let e=`(${od} s (${K} x) (${K} y))`;return i(3,[`Mem`,`Seq`,`Len`,`FunApp`,`IntSet`,`Cast_Int`,`Proj_Int`],[$(`SeqSubseqTyping`,[],`(forall ((a Idv) (s Idv) (x Int) (y Int)) (! (=> (or (< y x) (and (${G} s (${Y} a)) (<= 1 x) (<= y (${q} (${X} s))))) (${G} ${e} (${Y} a))) :pattern ((${G} s (${Y} a)) ${e})))`),$(`SeqSubseqLen`,[],`(forall ((s Idv) (x Int) (y Int)) (! (and (=> (<= x (+ y 1)) (= (${X} ${e}) (${K} (- (+ y 1) x)))) (=> (> x (+ y 1)) (= (${X} ${e}) (${K} 0)))) :pattern (${e})))`),$(`SeqSubseqApp`,[],`(forall ((s Idv) (x Int) (y Int) (z Int)) (! (=> (and (<= 1 x) (<= 1 z) (<= z (- (+ y 1) x))) (= (${J} ${e} (${K} z)) (${J} s (${K} (- (+ z x) 1))))) :pattern ((${J} ${e} (${K} z)))))`)])}case`Cast_Int`:return n(pd(r,1,`Idv`,`Int`),[`Mem`,`IntSet`,`Proj_Int`],[$(`CastInjAlt`,[`Int`],`(forall ((x Int)) (! (= x (${q} (${K} x))) :pattern ((${K} x))))`),$(`TypeGuardIntro`,[`Int`],`(forall ((z Int)) (! (${G} (${K} z) ${Ku}) :pattern ((${K} z))))`),$(`TypeGuardElim`,[`Int`],`(forall ((x Idv)) (! (=> (${G} x ${Ku}) (= x (${K} (${q} x)))) :pattern ((${G} x ${Ku}))))`)]);case`Cast_Bool`:return n(pd(r,1,`Idv`,`Bool`),[`Mem`,`BoolSet`,`Tt_Idv`],[$(`CastInjAlt`,[`Bool`],`(and (= (${Uu} true) ${Hu}) (distinct (${Uu} false) ${Hu}))`),$(`TypeGuardIntro`,[`Bool`],`(forall ((z Bool)) (! (${G} (${Uu} z) ${Wu}) :pattern ((${Uu} z))))`),$(`TypeGuardElim`,[`Bool`],`(forall ((x Idv)) (! (=> (${G} x ${Wu}) (or (= x (${Uu} true)) (= x (${Uu} false)))) :pattern ((${G} x ${Wu}))))`)]);case`Proj_Int`:return n(pd(r,1,`Int`),[],[]);case`TrigEq_Set$Idv$`:return i(2,[`SetExtTrigger`],[$(`ExtTrigEqDef`,[`Set$Idv$`],`(forall ((x Idv) (y Idv)) (! (= (${ed} x y) (= x y)) :pattern ((${ed} x y))))`),$(`ExtTrigEqTrigger`,[`Idv`],`(forall ((x Idv) (y Idv)) (! (${Fu} x y) :pattern ((${ed} x y))))`)],`Bool`);case`SetExtTrigger`:case`IsSetOf`:return i(e===`IsSetOf`?1:2,[],[],`Bool`);case`BoolSet`:case`StrSet`:case`IntSet`:case`Tt_Idv`:return i(0,[],[]);case`TIntLteq`:return n(void 0,[`IntLteq`],[Ed(`IntLteq`)]);default:if(e.startsWith(`TIntLit_`))return n(void 0,[],[]);throw new v(`the symbol ${e}`)}},zd=(e,t)=>`${e}#${t}`,Bd=e=>Number(e.slice(e.lastIndexOf(`#`)+1)),Vd=`?unprimable`,Hd=e=>{let t=e.indexOf(`(${Vd} `);if(t===-1)return e;let n=md(e,t);return e.slice(0,t)+Hd(e.slice(t+11+2,n))+Hd(e.slice(n+1))},Ud=(e,t)=>/\((forall|exists|ite) /.test(e)?void 0:e.replace(/[^\s()]+#(\d+)/g,(e,n)=>Number(n)<t?`#`:`#${Number(n)-t}`),Wd=()=>{let e=/* @__PURE__ */ new Map,t=/* @__PURE__ */ new Map,n={blueprints:0},r=[];return{flattened:e,flatten:(i,a,o,s,c,l=`TLA__${i}`)=>{if(o.isOmitted){let t=Au(`${l}_omitted_${e.size}`);return e.set(t,{symbol:t,kind:i,visit:Hd(a),getLines:()=>[]}),t}let u=Ud(`${l} ${a}`,o.depth);n.blueprints++;let d=u===void 0?void 0:t.get(u);if(d)return d.symbol;let f=`${l}_flatnd_${n.blueprints}`,p=Au(f),m={symbol:p,kind:i,visit:Hd(a),getLines:e=>[pd(p,c),...s(p,e).map(e=>`(assert (! ${Hd(e.formula??``)} :named |${e.label} ${f}|))`)]};return u!==void 0&&t.set(u,m),e.set(p,m),r.push(m),p},takeIntroduced:()=>r.splice(0)}},Gd=`?trigger`,Kd=/* @__PURE__ */ new Set([Vu,Bu,Lu,Ru,zu,Yu,Qu,Y]),qd=e=>{let t=/^\(?([^\s()]+)/.exec(e)?.[1]??``;return Kd.has(t)||/^smt__TLA____(SetEnum__\d+|SetSt__flatnd__\d+|SetOf__\d+__flatnd__\d+|Product__\d+|RecordSet__)/.test(t)},Jd=(e,t)=>{let n=e.indexOf(`(${Gd} `);if(n===-1)return e;let r=n+8+2,i=md(e,r)+1,a=md(e,i+1)+1,o=t?e.slice(r,i):e.slice(i+1,a);return e.slice(0,n)+o+Jd(e.slice(a+1),t)},Yd=(e,t,n,r)=>{let i=`(${ed} ${e} ${t})`,a=r?`(distinct ${e} ${t})`:`(= ${e} ${t})`;if(!qd(e)&&!qd(t))return a;let o=r?`(not ${i})`:i;return n===(r?`Positive`:`Negative`)?`(${Gd} ${o} ${a})`:o},Xd=(e,t,n,r)=>{let i=Q(e,[`a`,...t]);return[$(`SetStDef`,[],Z([...t,`a`,`x`],`(= (${G} x ${i}) (and (${G} x a) ${hd(n,r,`x`)}))`,[[`(${G} x ${i})`],[`(${G} x a)`,i]]))]},Zd=(e,t,n,r)=>{let i=r.length,a=ld(`a`,i),o=ld(`y`,i),s=r.reduce((e,t,n)=>hd(e,t,o[n]),n),c=Q(e,[...a,...t]),l=o.map((e,t)=>`(${G} ${e} ${a[t]})`),u=i===1?[`a`]:a,d=Q(e,[...u,...t]);return[$(`SetOfIntro`,[i],Z([...t,...a,...o],`(=> ${dd(l)} (${G} ${s} ${c}))`,[[s,c],[c,...l]])),$(`SetOfElim`,[i],Z([...t,...a,`x`],`(=> (${G} x ${c}) (exists (${ud(o)}) ${dd([...l,`(= x ${s})`])}))`,[[`(${G} x ${c})`]])),$(`AssertIsSetOf`,[i],Z([...t,...u],`(${td} ${d})`,[[d]]))]},Qd=(e,t,n,r,i)=>{let a=Q(e,[`a`,...t]),o=hd(n,r,`x`),s=i.has(Sd($(`FunTyping`,[],void 0)))?[$(`FunTyping`,[],Z([...t,`a`,`b`],`(=> (forall ((x Idv)) (=> (${G} x a) (${G} ${o} b))) (${G} ${a} (${Qu} a b)))`,[[a,`(${Qu} a b)`]]))]:[];return[$(`FunConstrIsafcn`,[],Z([...t,`a`],`(${Zu} ${a})`,[[a]])),$(`FunDomDef`,[],Z([...t,`a`],`(= (${Xu} ${a}) a)`,[[a]])),$(`FunAppDef`,[],Z([...t,`a`,`x`],`(=> (${G} x a) (= (${J} ${a} x) ${o}))`,[[`(${J} ${a} x)`],[`(${G} x a)`,a]])),...s]},$d=(e,t,n,r)=>[$(`ChooseDef`,[],Z([...t,`x`],`(=> ${hd(n,r,`x`)} ${hd(n,r,Q(e,t))})`))],ef=(e,t,n,r)=>{let i=n=>Q(e,[n,...t]),a=e=>hd(n,r,e),o=i(`(${rd} s x)`);return[$(`SeqSelectseqTyping`,[],Z([...t,`a`,`s`],`(=> (${G} s (${Y} a)) (${G} ${i(`s`)} (${Y} a)))`,[[`(${G} s (${Y} a))`,i(`s`)]])),$(`SeqSelectseqLen`,[],Z([...t,`s`],`(=> (${G} (${X} s) ${qu}) (<= (${q} (${X} ${i(`s`)})) (${q} (${X} s))))`,[[i(`s`)]])),$(`SeqSelectseqNil`,[],Z(t,`(= ${i(sd)} ${sd})`)),$(`SeqSelectseqApp`,[],Z([...t,`s`,`x`],`(=> (${G} x (${Xu} ${i(`s`)})) ${a(`(${J} ${i(`s`)} x)`)})`,[[`(${J} ${i(`s`)} x)`]])),$(`SeqSelectseqAppend`,[],Z([...t,`s`,`x`],`(and (=> ${a(`x`)} (= ${o} (${rd} ${i(`s`)} x))) (=> (not ${a(`x`)}) (= ${o} ${i(`s`)})))`,[[o]]))]},tf=e=>{let t=Wd(),n=t.flatten,r=/* @__PURE__ */ new Map,i=/* @__PURE__ */ new Map,a=_d(),o=/* @__PURE__ */ new Map,s=e=>e.isBool?e.text:`(= ${Jd(e.text,!0)} ${Hu})`,c=e=>e.isBool?`(${Uu} ${Jd(e.text,!0)})`:e.text,l=e=>({isBool:!0,text:e}),u=e=>({isBool:!1,text:e}),d=(e,t)=>{let n=Array.from({length:t-1}).reduce(e=>e?.rest,e);if(!n)throw new v(`a reference outside the obligation`);return n.binding},f=(e,t)=>({binding:t,rest:e}),p=(e,t)=>[...new Set(e.match(/[^\s()]+#\d+/g))].filter(e=>Bd(e)<t).toSorted((e,t)=>Bd(e)-Bd(t)),m=e=>{let t=a.adjoin(e);return a.enter(t),o.set(t.name,t),t.name},h=e=>({...e,polarity:`Neither`}),g=e=>({...e,polarity:e.polarity===`Positive`?`Negative`:e.polarity===`Negative`?`Positive`:`Neither`}),_=(e,t,n)=>c(fe(e,t,h(n))),y=(e,t,n)=>s(fe(e,t,n)),b=(e,t,n)=>e.reduce((e,t)=>t.domain.kind===`Ditto`?[...e,e.at(-1)]:t.domain.kind===`NoDomain`?[...e,void 0]:[...e,t.domain.expression],[]).map(e=>e===void 0?void 0:_(e,t,n)),x=(e,t,n,r)=>b(e,t,n).map(e=>{if(e===void 0)throw new v(`${r} without a domain`);return e}),ee=(e,t,n)=>{let r=e.map((e,t)=>zd(e,n.depth+t));return{variables:r,env:r.reduce((e,t)=>f(e,{kind:`constant`,symbol:t}),t),mode:{...n,depth:n.depth+e.length}}},S=(e,t,n)=>{let r=b(e.bounds,t,n),i=ee(e.bounds.map(e=>e.name),t,n),a=y(e.body,i.env,i.mode),o=i.variables.flatMap((e,t)=>r[t]===void 0?[]:[`(${G} ${e} ${r[t]})`]);return e.quantifier===`Forall`?`(forall (${ud(i.variables)}) ${o.length===0?a:`(=> ${dd(o)} ${a})`})`:`(exists (${ud(i.variables)}) ${dd([...o,a])})`},te=(e,t,r)=>{let i=_(e.domain,t,r),a=ee([e.name],t,h(r)),o=y(e.body,a.env,a.mode),s=p(o,r.depth),c=n(`SetSt`,o,r,e=>Xd(e,s,o,a.variables[0]),s.length+1);return u(Q(c,[i,...s]))},C=(e,t,r)=>{let i=x(e.bounds,t,r,`a set of values`),a=ee(e.bounds.map(e=>e.name),t,h(r)),o=_(e.element,a.env,a.mode),s=p(o,r.depth),c=i.length,l=n(`SetOf_${c}`,o,r,e=>Zd(e,s,o,a.variables),c+s.length);return u(Q(l,[...i,...s]))},w=(e,t,r)=>{let i=x(e.bounds,t,r,`a function`),a=i.length===1?i[0]:Q(W(`Product_${i.length}`),i),o=zd(i.length===1?e.bounds[0].name:`x`,r.depth),s={...h(r),depth:r.depth+1},c=i.length===1?f(t,{kind:`constant`,symbol:o}):Od(i.length).reduce((e,t)=>f(e,{kind:`constant`,symbol:`(${J} ${o} ${t})`}),t),l=_(e.body,c,s),d=p(l,r.depth),m=n(`FunFcn`,l,r,(e,t)=>Qd(e,d,l,o,t),d.length+1);return u(Q(m,[a,...d]))},ne=(e,t,r)=>{let i=ee([e.name],t,h(r)),a=i.variables[0],o=e.domain&&`(${G} ${a} ${_(e.domain,t,r)})`,s=y(e.body,i.env,i.mode),c=o===void 0?s:dd([o,s]),l=p(c,r.depth),d=n(`Choose`,c,r,e=>$d(e,l,c,a),l.length);return u(Q(d,l))},re=(e,t,n,r)=>Yd(_(e[0],t,n),_(e[1],t,n),n.polarity,r),ie=(e,t,n)=>{let r=e.kind===`Lambda`&&e.params.length===1?e:void 0,i=ee([r?.params[0].name??`x1`],t,h(n));return{body:y(r?.body??{kind:`Apply`,operator:L(1,e),args:[{kind:`Ix`,index:1}]},i.env,i.mode),variable:i.variables[0]}},T=(e,t,r,i)=>{let a=()=>t.map(e=>_(e,r,i));switch(e){case`Conj`:return l(dd(t.map(e=>y(e,r,i))));case`Disj`:return l(fd(t.map(e=>y(e,r,i))));case`Implies`:return l(`(=> ${y(t[0],r,g(i))} ${y(t[1],r,i)})`);case`Equiv`:return l(`(= ${t.map(e=>y(e,r,h(i))).join(` `)})`);case`Neg`:return l(`(not ${y(t[0],r,g(i))})`);case`Eq`:return l(re(t,r,i,!1));case`Neq`:return l(re(t,r,i,!0));case`Mem`:return l(Q(G,a()));case`Notmem`:return l(`(not ${Q(G,a())})`);case`Subseteq`:return l(Q(Iu,a()));case`Lteq`:return l(Q(Ju,a()));case`Gteq`:return l(Q(Ju,a().toReversed()));case`Lt`:case`Gt`:{let t=()=>e===`Lt`?a():a().toReversed();return l(`(and ${Q(Ju,t())} (distinct ${t().join(` `)}))`)}case`SelectSeq`:{let e=ie(t[1],r,i),a=p(e.body,i.depth),o=n(`SelectSeq`,e.body,i,t=>ef(t,a,e.body,e.variable),a.length+1);return u(Q(o,[_(t[0],r,i),...a]))}case`Unprimable`:{let e=fe(t[0],r,h(i));return{...e,text:`(${Vd} ${e.text})`}}default:{let t=cd[e];if(t===void 0)throw new v(`the operator ${e}`);return u(Q(t,a()))}}},ae=(e,t,r,i)=>{switch(e.kind){case`constant`:case`variable`:if(t.length>0)throw new v(`an applied ${e.kind}`);return u(e.symbol);case`operator`:if(t.length!==e.arity)throw new v(`an operator applied to the wrong number of arguments`);return u(Q(e.symbol,t.map(e=>_(e,r,i))));case`secondOrder`:{if(t.length!==e.shapes.length)throw new v(`an operator applied to the wrong number of arguments`);let a=t.map((t,n)=>{if(e.shapes[n]===0)return{isFirstOrder:!0,text:_(t,r,i)};if(t.kind===`Ix`){let e=d(r,t.index);if(e.kind!==`operator`)throw new v(`an operator argument that isn't a LAMBDA`);return{isFirstOrder:!1,text:e.symbol}}if(t.kind!==`Lambda`)throw new v(`an operator argument that isn't a LAMBDA`);let a=ee(t.params.map(e=>e.name),r,h(i));return{isFirstOrder:!1,text:_(t.body,a.env,a.mode)}}),o=a.flatMap(e=>e.isFirstOrder?[e.text]:[]),s=a.flatMap(e=>e.isFirstOrder?[]:[e.text]),c=p(s.join(` `),i.depth),l=n(``,s.join(` `),i,()=>[],o.length+c.length,e.name);return u(Q(l,[...o,...c]))}case`unsupported`:throw new v(e.reason)}},oe=(e,t)=>{if(!e)throw new v(`a primed declaration that isn't a variable`);let n=e.binding;return n.kind===`variable`&&n.name===t?n.primed:oe(e.rest,t)},se=(e,t,n,i)=>{if(t.length===0&&e.endsWith(`#prime`))return u(oe(n,e.slice(0,-6)));let a=t.length===0?`Anon_OPAQUE_${e}`:`Anon_${e}`;return r.set(a,t.length),u(Q(W(a),t.map(e=>_(e,n,i))))},ce=(e,t,n)=>e.specs.reduce((e,r)=>{let i=(e,a)=>{if(a.length===0)return _(r.value,t,{...n,at:e});let o=a[0],s=()=>o.kind===`Dot`?W(`StrLit_${o.field}`):_(o.expression,t,n),c=s(),l=i(`(${J} ${e} ${a.length>1?s():c})`,a.slice(1));return`(${$u} ${e} ${c} ${l})`};return i(e,r.trail)},_(e.function,t,n)),le=()=>{e.caseErrors++;let t=`Anon_incomplete_case_error_${e.caseErrors}`;return r.set(t,0),W(t)},ue=(e,t,n)=>{let r=e.arms.map(e=>fe(e.body,t,n)),i=e.other?fe(e.other,t,n):u(le()),a=i.isBool&&r.every(e=>e.isBool);if(i.integer!==void 0&&r.every(e=>e.integer!==void 0)){let a=e.arms.reduceRight((e,i,a)=>`(ite ${y(i.condition,t,h(n))} ${r[a].integer} ${e})`,i.integer??``);return{isBool:!1,text:`(${K} ${a})`,integer:a}}let o=e=>a?e.text:c(e);return{isBool:a,text:e.arms.reduceRight((e,i,a)=>`(ite ${y(i.condition,t,n)} ${o(r[a])} ${e})`,o(i))}},de=(e,t,n)=>{let r=e.context.reduce((e,t)=>{switch(t.kind){case`Fresh`:{if(t.shape>0){if(!e.mode.isOmitted)throw new v(`a second-order ASSUME`);let n=zd(t.name,e.mode.depth);return{env:f(e.env,{kind:`operator`,symbol:n,arity:t.shape}),mode:{...e.mode,depth:e.mode.depth+1},wrappers:[...e.wrappers,e=>`(forall ((${n} Idv)) ${e})`]}}if(t.level!==`Constant`)throw new v(`a NEW declaration that isn't constant`);let n=t.domain&&_(t.domain,e.env,e.mode),r=ee([t.name],e.env,e.mode),i=r.variables[0],a=n&&`(${G} ${i} ${n})`;return{env:r.env,mode:r.mode,wrappers:[...e.wrappers,e=>`(forall ((${i} Idv)) ${a?`(=> ${a} ${e})`:e})`]}}case`Fact`:{let n=t.visibility===`Visible`?y(t.expression,e.env,g(e.mode)):void 0;return{env:f(e.env,{kind:`unsupported`,reason:`a reference to a fact`}),mode:e.mode,wrappers:n?[...e.wrappers,e=>`(=> ${n} ${e})`]:e.wrappers}}default:throw new v(`a ${t.kind} in a nested ASSUME`)}},{env:t,mode:n,wrappers:[]});return r.wrappers.reduceRight((e,t)=>t(e),y(e.active,r.env,r.mode))},fe=(e,t,n)=>{switch(e.kind){case`Ix`:return ae(d(t,e.index),[],t,n);case`Internal`:switch(e.builtin){case`TRUE`:return l(`true`);case`FALSE`:return l(`false`);case`BOOLEAN`:return u(Wu);case`STRING`:return u(Gu);case`Nat`:return u(qu);case`Int`:return u(Ku);default:throw new v(`the operator ${e.builtin}`)}case`Apply`:{let r=e.operator;if(r.kind===`Internal`)return T(r.builtin,e.args,t,n);if(r.kind===`Ix`)return ae(d(t,r.index),e.args,t,n);if(r.kind===`Opaque`)return se(r.name,e.args,t,n);if(r.kind===`Lambda`)return fe(xr(r,e.args),t,n);throw new v(`an application of ${r.kind}`)}case`Sequent`:return l(de(e.sequent,t,n));case`With`:case`Parens`:return fe(e.expression,t,n);case`If`:{let r=y(e.condition,t,n),i=fe(e.consequent,t,n),a=fe(e.alternative,t,n);if(i.integer!==void 0&&a.integer!==void 0){let e=`(ite ${Jd(r,!0)} ${i.integer} ${a.integer})`;return{isBool:!1,text:`(${K} ${e})`,integer:e}}return i.isBool&&a.isBool?l(`(ite ${r} ${i.text} ${a.text})`):u(`(ite ${r} ${c(i)} ${c(a)})`)}case`List`:{let r=e.items.map(e=>y(e,t,n));return l(e.bullet===`Or`?fd(r):dd(r))}case`Opaque`:return se(e.name,[],t,n);case`Quant`:return l(S(e,t,n));case`Choose`:return ne(e,t,n);case`SetSt`:return te(e,t,n);case`SetOf`:return C(e,t,n);case`SetEnum`:return u(Q(W(`SetEnum_${e.elements.length}`),e.elements.map(e=>_(e,t,n))));case`Product`:return u(Q(W(`Product_${e.factors.length}`),e.factors.map(e=>_(e,t,n))));case`Tuple`:return u(Q(W(`Tuple_${e.elements.length}`),e.elements.map(e=>_(e,t,n))));case`Fcn`:return w(e,t,n);case`FcnApp`:{let r=_(e.function,t,n),i=e.args.map(e=>_(e,t,n)),a=i.length===1?i[0]:Q(W(`Tuple_${i.length}`),i);return u(`(${J} ${r} ${a})`)}case`Arrow`:return u(Q(Qu,[_(e.domain,t,n),_(e.range,t,n)]));case`Record`:case`Rect`:{let r=e.fields.map(e=>e.name),a=r.join(`_`);return i.set(`Record_${a}`,r),i.set(`RecordSet_${a}`,r),u(Q(W(`${e.kind===`Record`?`Record`:`RecordSet`}_${a}`),e.fields.map(e=>_(e.value,t,n))))}case`Except`:return u(ce(e,t,n));case`Dot`:return u(`(${J} ${_(e.expression,t,n)} ${W(`StrLit_${e.field}`)})`);case`Case`:return ue(e,t,n);case`String`:return u(W(`StrLit_${e.value}`));case`Num`:if(e.fraction!==``)throw new v(`a real number`);return{isBool:!1,text:`(${K} ${BigInt(e.integer)})`,integer:String(BigInt(e.integer))};case`At`:if(n.at===void 0)throw new v(`@ outside EXCEPT`);return u(n.at);case`Tquant`:case`Tsub`:case`Fair`:throw new v(`a temporal formula`);default:throw new v(`the expression ${e.kind}`)}};return{encodeIdv:_,encodeBool:y,push:f,getEntries:e=>[...t.takeIntroduced(),Hd(Jd(e,!1))],getUniqueName:m,flattened:t.flattened,anonymous:r,recordFields:i,declared:o}},nf=(e,t)=>e.fields.length===t.fields.length&&e.fields.every(e=>t.fields.some(t=>t.name===e.name))&&t.fields.every(t=>e.fields.some(e=>e.name===t.name)),rf=e=>e.length===1?e[0]:M(`Conj`,[e[0],rf(e.slice(1))],e[0]),af=(e,t,n)=>e.kind!==`Record`||t.kind!==`Record`||!nf(e,t)?M(`Eq`,[e,t],n):rf(e.fields.map(e=>af(e.value,t.fields.find(t=>t.name===e.name)?.value??e.value,n))),of=e=>{let t=mr(e,of);return t.kind!==`Apply`||t.operator.kind!==`Internal`||t.operator.builtin!==`Eq`||t.args.length!==2||t.args[0].kind!==`Record`||t.args[1].kind!==`Record`?t:j(af(t.args[0],t.args[1],t),t)},sf=e=>e.kind===`Record`||e.kind===`Rect`?{...e,fields:e.fields.toSorted((e,t)=>Du(e.name,t.name))}:mr(e,sf),cf=(e,t)=>{let n={recordFields:t.recordFields,strings:[],isFunConstr:!1,isFunSet:!1,isExcept:!1,tuples:[],records:[],anonymous:t.anonymous},r=/* @__PURE__ */ new Map,i=/* @__PURE__ */ new Map,a=e=>{let t=/* @__PURE__ */ new Set([e]);for(;t.size>0;){let e=[...t].toSorted(Du)[0];if(t.delete(e),r.has(e))continue;let a=Rd(e,n);r.set(e,a),a.deps.forEach(e=>t.add(e)),a.axioms.forEach(e=>i.set(Sd(e),e))}},o=e=>{let n=e.match(/[()]|[^\s()]+/g)??[],r=[];n.reduce((e,i,s)=>{if(i===`(`)return e+1;if(i===`)`)return r.at(-1)?.depth===e&&o(r.pop()?.text??``),e-1;let c=t.flattened.get(i);if(!c){let t=Pu(i);return t!==void 0&&a(t),e}return c.kind!==``&&a(c.kind),n[s-1]===`(`?r.push({depth:e,text:c.visit}):o(c.visit),e},0)};return e.forEach(e=>{typeof e==`string`?o(e):`omitted`in e&&o(e.omitted)}),{symbols:r,axioms:i}},lf={isOmitted:!1,polarity:`Negative`,at:void 0,depth:0},uf=e=>e.definition.kind===`Bpragma`||e.definition.kind===`Operator`&&e.visibility===`Visible`,df=e=>e.kind===`Sequent`&&e.sequent.context.some(e=>e.kind===`Fresh`&&e.shape>0),ff=(e,t)=>e.reduce((e,n)=>{let r=(n,r=[])=>({env:t.push(e.env,n),entries:[...e.entries,...r]});switch(n.kind){case`Fresh`:{let i=t.getUniqueName(n.name),a=n.shape===0?{kind:`constant`,symbol:i}:{kind:`operator`,symbol:i,arity:n.shape},o=pd(i,n.shape);if(!n.domain||n.domainVisibility===`Hidden`)return r(a,[o]);let s=`(assert (${G} ${i} ${t.encodeIdv(n.domain,e.env,lf)}))`;return r(a,[o,...t.getEntries(s)])}case`Flex`:{let e=t.getUniqueName(n.name),i=t.getUniqueName(`${n.name}_prime`);return r({kind:`variable`,name:n.name,symbol:e,primed:i},[pd(e,0),pd(i,0)])}case`Defn`:{let e=n.definition;if(uf(n))return r({kind:`unsupported`,reason:`an expanded definition`});if(e.kind===`Instance`)return r({kind:`unsupported`,reason:`an instance`});if(e.kind===`Recursive`){let n=t.getUniqueName(`CONSTANT_${e.name}_`);return r({kind:`operator`,symbol:n,arity:e.shape},[pd(n,e.shape)])}if(e.kind!==`Operator`)return r({kind:`unsupported`,reason:`a definition`});let i=e.body,a=i.kind===`Lambda`?i.params:[];if(a.some(e=>e.shape>0))return r({kind:`secondOrder`,name:e.name,shapes:a.map(e=>e.shape)});let o=t.getUniqueName(e.name);return r({kind:`operator`,symbol:o,arity:a.length},[pd(o,a.length)])}case`Fact`:{let i={kind:`unsupported`,reason:`a reference to a fact`};if(n.visibility===`Hidden`)return r(i);let a=df(n.expression),o=t.getEntries(`(assert ${t.encodeBool(n.expression,e.env,{...lf,isOmitted:a})})`);return r(i,a?o.map(e=>typeof e==`string`?{omitted:e}:e):o)}}},{env:void 0,entries:[]}),pf=(e,t)=>{let n=sf(of({kind:`Sequent`,sequent:e})),r=n.kind===`Sequent`?n.sequent:e,i=tf(t),a=ff(r.context,i),o=df(r.active)?[]:i.getEntries(`(assert (! (not ${i.encodeBool(r.active,a.env,{...lf,polarity:`Positive`})}) :named |Goal|))`),s=[...a.entries,...o],c=vd(i.declared),l=cf(s,i),u=[...l.symbols].toSorted((e,t)=>Du(e[0],t[0])).flatMap(e=>e[1].declaration===void 0?[]:[e[1].declaration]),d=[...l.axioms.values()].toSorted(wd).flatMap(e=>e.formula===void 0?[]:[`(assert (! ${e.formula} :named |${e.label}|))`]),f=new Set(l.axioms.keys()),p=[...u,...d,...s.flatMap(e=>typeof e==`string`?[e]:`omitted`in e?[]:e.getLines(f))];return[`(set-logic UFNIA)`,...p.some(e=>/\bIdv\b/.test(e))||r.context.some(e=>e.kind===`Defn`&&(e.definition.kind===`Operator`||e.definition.kind===`Recursive`)&&!uf(e))?[`(declare-sort Idv 0)`]:[],...p].map(c.resolve).concat(`(check-sat)`,`(exit)`).join(`
43
+ `)},mf=V(`@ `),hf={TRUE:`T.`,FALSE:`F.`,STRING:`TLA.STRING`,BOOLEAN:`(TLA.set T. F.)`,Nat:`arith.N`,Int:`arith.Z`,Real:`arith.R`,Infinity:`arith.Infinity`,Any:`TLA.Any`},gf={Implies:[`=>`,2],Equiv:[`<=>`,2],Conj:[`/\\`,2],Disj:[`\\/`,2],Neg:[`-.`,1],Eq:[`=`,2],DOMAIN:[`TLA.DOMAIN`,1],SUBSET:[`TLA.SUBSET`,1],UNION:[`TLA.UNION`,1],Subseteq:[`TLA.subseteq`,2],Mem:[`TLA.in`,2],Setminus:[`TLA.setminus`,2],Cap:[`TLA.cap`,2],Cup:[`TLA.cup`,2],Plus:[`arith.add`,2],Uminus:[`arith.minus`,1],Times:[`arith.mul`,2],Ratio:[`arith.div`,2],Quotient:[`arith.euclidiv`,2],Remainder:[`arith.mod`,2],Exp:[`arith.power`,2],Lteq:[`arith.le`,2],Lt:[`arith.lt`,2],Range:[`arith.intrange`,2],Seq:[`TLA.Seq`,1],Len:[`TLA.Len`,1],BSeq:[`TLA.BSeq`,1],Cat:[`TLA.concat`,2],Append:[`TLA.Append`,2],Head:[`TLA.Head`,1],Tail:[`TLA.Tail`,1],SubSeq:[`TLA.SubSeq`,3],SelectSeq:[`TLA.SelectSeq`,2],OneArg:[`TLA.oneArg`,2],Extend:[`TLA.extend`,2],Print:[`TLA.Print`,2],PrintT:[`TLA.PrintT`,1],Assert:[`TLA.Assert`,2],JavaTime:[`TLA.JavaTime`,0],TLCGet:[`TLA.TLCGet`,1],TLCSet:[`TLA.TLCSet`,2],Permutations:[`TLA.Permutations`,1],SortSeq:[`TLA.SortSeq`,2],RandomElement:[`TLA.RandomElement`,1],ToString:[`TLA.ToString`,1]},_f=e=>{let t=Number.parseInt(e,10);return`${`(TLA.fapply TLA.Succ `.repeat(t)}0${`)`.repeat(t)}`},vf=(e,t)=>{let n=Po(),r=e=>Io(n,fc(e)),i=()=>Io(n,``),a=e=>H(e,p,mf),o=(e,t)=>V(`(%s %a)`,e,a(t)),s=(e,t,i)=>{let a=r(e),o=V(`%a((%s) %a))`,t,a,p(i));return Lo(n,1),o},c=(e,t)=>{let n=hf[e];if(n!==void 0&&t.length===0)return B(n);let r=gf[e];if(r&&r[1]===t.length)return o(r[0],t);if(t.length===2)switch(e){case`Neq`:return V(`(-. %a)`,o(`=`,t));case`Notmem`:return V(`(-. %a)`,o(`TLA.in`,t));case`Minus`:return o(`arith.add`,[t[0],{kind:`Apply`,operator:{kind:`Internal`,builtin:`Uminus`,location:t[1].location},args:[t[1]],location:t[1].location}]);case`Gteq`:return o(`arith.le`,t.toReversed());case`Gt`:return o(`arith.lt`,t.toReversed())}if(e===`Unprimable`&&t.length===1)return p(t[0]);throw mc(e,t.length,`Backend.Zenon.fmt_apply`)},l=(e,t)=>{switch(e.kind){case`Ix`:{let r=Fo(n,e.index);if(e.index<=0||r===void 0)throw new _;return t.length===0?B(r):o(r,t)}case`Opaque`:{let n=fc(e.name);return t.length===0?B(n):o(n,t)}case`Internal`:return c(e.builtin,t);case`Lambda`:{let t=e.params.map(e=>V(`%s `,r(e.name))),i=V(`((%a) %a)`,t,p(e.body));return Lo(n,e.params.length),i}default:throw new _}},u=(e,t,n)=>{if(t.length===0)return p(n);let r=hc(e,t,n),i=e===`Forall`;if(r.first.domain.kind===`NoDomain`)return s(r.first.name,B(i?`(A. `:`(E. `),r.inner);if(r.first.domain.kind!==`Domain`)throw new _;let a=p(r.first.domain.expression);return s(r.first.name,V(`(%s %a `,i?`TLA.bAll`:`TLA.bEx`,a),r.inner)},d=(e,t,n,r)=>{if(t.length!==1)throw new v(`${r} (multiple declared constants)`);let i=t[0];if(i.domain.kind!==`Domain`)throw new _;return s(i.name,V(`(%s %a `,e,p(i.domain.expression)),n)},f=e=>{if(e.context.length===0)return p(e.active);let t=e.context[0],a=()=>f({context:e.context.slice(1),active:e.active});if(t.kind===`Fact`){let e=t.visibility===`Visible`?p(t.expression):void 0;i();let r=e?V(`(=> %a %a)`,e,a()):a();return Lo(n,1),r}if(t.kind===`Defn`)throw new _;let o=t.kind===`Fresh`&&t.domain&&t.domainVisibility===`Visible`?p(t.domain):void 0,s=r(t.name),c=t.kind===`Flex`?V(`(A. ((%s) (A. ((%s') %a))))`,s,s,a()):o?V(`(TLA.bAll %a ((%s) %a))`,o,s,a()):V(`(A. ((%s) %a))`,s,a());return Lo(n,1),c},p=e=>{switch(e.kind){case`Ix`:case`Internal`:case`Opaque`:case`Lambda`:return l(e,[]);case`Apply`:return l(e.operator,e.args);case`Sequent`:return f(e.sequent);case`With`:case`Parens`:return p(e.expression);case`If`:return V(`(TLA.cond %a %a %a)`,p(e.condition),p(e.consequent),p(e.alternative));case`List`:if(e.bullet===`Refs`&&e.items.length===0)throw new _;return e.bullet===`Refs`&&e.items.length===1?p(e.items[0]):V(`(%s %a)`,e.bullet===`Or`?`\\/`:`/\\`,a(e.items));case`Quant`:return u(e.quantifier,e.bounds,e.body);case`Tquant`:throw new v(`\\AA or \\EE`);case`Choose`:return e.domain?s(e.name,V(`(TLA.bChoice %a `,p(e.domain)),e.body):s(e.name,B(`(t. `),e.body);case`SetSt`:return s(e.name,V(`(TLA.subsetOf %a `,p(e.domain)),e.body);case`SetOf`:return d(`TLA.setOfAll`,e.bounds,e.element,`Setof`);case`Fcn`:return d(`TLA.Fcn`,e.bounds,e.body,`Fcn`);case`SetEnum`:return e.elements.length===0?B(`TLA.emptyset`):[B(`(TLA.set`),e.elements.map(e=>V(` %a`,p(e))),B(`)`)];case`FcnApp`:{let t=p(e.function);return e.args.length===1?V(`(TLA.fapply %a %a)`,t,p(e.args[0])):V(`(TLA.fapply %a (TLA.tuple %a))`,t,a(e.args))}case`Arrow`:return V(`(TLA.FuncSet %a %a)`,p(e.domain),p(e.range));case`Rect`:case`Record`:return[B(e.kind===`Rect`?`(TLA.recordset`:`(TLA.record`),e.fields.map(e=>V(` "%s" %a`,e.name,p(e.value))),B(`)`)];case`Except`:{let t=e.specs[0];if(e.specs.length!==1||t.trail.length!==1)throw new v(`complex EXCEPT`);let n=t.trail[0],r=n.kind===`Dot`?B(`"${n.field}"`):p(n.expression);return V(`(TLA.except %a %a %a)`,p(e.function),r,p(t.value))}case`Dot`:return V(`(TLA.fapply %a "%s")`,p(e.expression),e.field);case`Tuple`:return V(`(TLA.tuple %a)`,a(e.elements));case`Product`:return e.factors.length===2?V(`(TLA.prod %a %a)`,p(e.factors[0]),p(e.factors[1])):V(`(TLA.Product (TLA.tuple %a))`,a(e.factors));case`Sub`:case`Tsub`:case`Fair`:throw new v(e.kind);case`Case`:{let t=H(e.arms,e=>V(`%a %a`,p(e.condition),p(e.body)),mf);return e.other?V(`(TLA.CASE %a %a)@]`,t,p(e.other)):V(`(TLA.CASE %a )`,t)}case`String`:return V(`"%s"`,e.value);case`Num`:if(e.fraction!==``)throw new v(`Real number constants`);return B(_f(e.integer));case`Bang`:case`Let`:case`At`:throw new _}},m=e=>{switch(e.kind){case`Fresh`:{let t=e.domain&&e.domainVisibility===`Visible`?p(e.domain):void 0,n=r(e.name);return t?V(`$hyp "%s_in" (TLA.in %s %a)@
44
+ `,n,n,t):[]}case`Flex`:return r(e.name),[];case`Defn`:{let t=r(e.definition.name);return e.visibility===`Visible`?V(`; usable definition %s suppressed@.`,t):[]}case`Fact`:{let t=String(n.stack.length),r=e.visibility===`Visible`?gc(n,()=>p(e.expression)):void 0;return i(),r instanceof v?V(`; omitted temporal assumption : %s @.`,r.message):r?V(`$hyp "v'%s" %a@
45
+ `,t,r):[]}}},h=(()=>{try{return[t.context.map(m),V(`$goal %a`,p(t.active))]}catch(e){throw e instanceof v?new S(`Zenon: unsupported operator ${e.message}`):e}})();return Eo([V(`;; obligation #%s@
46
+ `,String(e)),h])},yf=`------------------------------- MODULE TLAPS --------------------------------
47
+
48
+ (* Backend pragmas. *)
49
+
50
+
51
+ (***************************************************************************)
52
+ (* Each of these pragmas can be cited with a BY or a USE. The pragma that *)
53
+ (* is added to the context of an obligation most recently is the one whose *)
54
+ (* effects are triggered. *)
55
+ (***************************************************************************)
56
+
57
+ (***************************************************************************)
58
+ (* The following pragmas should be used only as a last resource. They are *)
59
+ (* dependent upon the particular backend provers, and are unlikely to have *)
60
+ (* any effect if the set of backend provers changes. Moreover, they are *)
61
+ (* meaningless to a reader of the proof. *)
62
+ (***************************************************************************)
63
+
64
+
65
+ (**************************************************************************)
66
+ (* Backend pragma: use the SMT solver for arithmetic. *)
67
+ (* *)
68
+ (* This method exists under this name for historical reasons. *)
69
+ (**************************************************************************)
70
+
71
+ SimpleArithmetic == TRUE (*{ by (prover:"smt3") }*)
72
+
73
+
74
+ (**************************************************************************)
75
+ (* Backend pragma: SMT solver *)
76
+ (* *)
77
+ (* This method translates the proof obligation to SMTLIB2. The supported *)
78
+ (* fragment includes first-order logic, set theory, functions and *)
79
+ (* records. *)
80
+ (* SMT calls the smt-solver with the default timeout of 5 seconds *)
81
+ (* while SMTT(n) calls the smt-solver with a timeout of n seconds. *)
82
+ (* *)
83
+ (* SMTT also accepts a string argument of the form "rN" to bound the *)
84
+ (* underlying Z3 solver by a deterministic \`rlimit\` budget instead of a *)
85
+ (* wall-clock timeout, e.g. SMTT("r5"). N is a multiple of a fixed base *)
86
+ (* resource count, so a small readable budget like "r5" is meaningful. *)
87
+ (* Unlike a wall-clock timeout, an \`rlimit\` budget does not depend on CPU *)
88
+ (* speed or load, so the proof's pass/fail outcome reproduces on any *)
89
+ (* machine and every rerun (for a fixed Z3 build); how long it takes to *)
90
+ (* consume the budget still varies by machine. This is Z3-specific. *)
91
+ (**************************************************************************)
92
+
93
+ SMT == TRUE (*{ by (prover:"smt3") }*)
94
+ SMTT(X) == TRUE (*{ by (prover:"smt3"; timeout:@) }*)
95
+
96
+
97
+ (**************************************************************************)
98
+ (* Backend pragma: CVC4 SMT solver *)
99
+ (* *)
100
+ (* These methods translate the proof obligation to SMTLIB2 and call CVC4. *)
101
+ (**************************************************************************)
102
+
103
+ (* The CVC3* methods are here for backward compatibility. They call CVC4. *)
104
+ CVC3 == TRUE (*{ by (prover: "cvc33") }*)
105
+ CVC3T(X) == TRUE (*{ by (prover:"cvc33"; timeout:@) }*)
106
+
107
+ CVC4 == TRUE (*{ by (prover: "cvc33") }*)
108
+ CVC4T(X) == TRUE (*{ by (prover:"cvc33"; timeout:@) }*)
109
+
110
+
111
+ (**************************************************************************)
112
+ (* Backend pragma: Yices SMT solver *)
113
+ (* *)
114
+ (* This method translates the proof obligation to Yices native language. *)
115
+ (**************************************************************************)
116
+
117
+ Yices == TRUE (*{ by (prover: "yices3") }*)
118
+ YicesT(X) == TRUE (*{ by (prover:"yices3"; timeout:@) }*)
119
+
120
+ (**************************************************************************)
121
+ (* Backend pragma: veriT SMT solver *)
122
+ (* *)
123
+ (* This method translates the proof obligation to SMTLIB2 and calls veriT.*)
124
+ (**************************************************************************)
125
+
126
+ veriT == TRUE (*{ by (prover: "verit") }*)
127
+ veriTT(X) == TRUE (*{ by (prover:"verit"; timeout:@) }*)
128
+
129
+ (**************************************************************************)
130
+ (* Backend pragma: Zipperposition solver *)
131
+ (* *)
132
+ (* This method translates the proof obligation to TPTP and *)
133
+ (* calls Zipperposition. *)
134
+ (**************************************************************************)
135
+
136
+ Zipper == TRUE (*{ by (prover: "zipper") }*)
137
+ ZipperT(X) == TRUE (*{ by (prover:"zipper"; timeout:@) }*)
138
+
139
+ (**************************************************************************)
140
+ (* Backend pragma: Z3 SMT solver *)
141
+ (* *)
142
+ (* This method translates the proof obligation to SMTLIB2 and calls Z3. *)
143
+ (* Z3 is used by default but you can also explicitly call it. *)
144
+ (* Z3T(n) bounds Z3 by a wall-clock timeout of n seconds, while Z3T("rN") *)
145
+ (* bounds it by a deterministic \`rlimit\` budget of N base units, which *)
146
+ (* reproduces the same outcome on any machine (see SMTT). *)
147
+ (**************************************************************************)
148
+
149
+ Z3 == TRUE (*{ by (prover: "z33") }*)
150
+ Z3T(X) == TRUE (*{ by (prover:"z33"; timeout:@) }*)
151
+
152
+ (**************************************************************************)
153
+ (* Backend pragma: SPASS superposition prover *)
154
+ (* *)
155
+ (* This method translates the proof obligation to the DFG format language *)
156
+ (* supported by the ATP SPASS. The translation is based on the SMT one. *)
157
+ (**************************************************************************)
158
+
159
+ Spass == TRUE (*{ by (prover: "spass") }*)
160
+ SpassT(X) == TRUE (*{ by (prover:"spass"; timeout:@) }*)
161
+
162
+ (**************************************************************************)
163
+ (* Backend pragma: The PTL propositional linear time temporal logic *)
164
+ (* prover. It currently is the LS4 backend. *)
165
+ (* *)
166
+ (* This method translates the negetation of the proof obligation to *)
167
+ (* Seperated Normal Form (TRP++ format) and checks for unsatisfiability *)
168
+ (**************************************************************************)
169
+
170
+ LS4 == TRUE (*{ by (prover: "ls4") }*)
171
+ LS4T(X) == TRUE (*{ by (prover: "ls4"; timeout:@) }*)
172
+ PTL == TRUE (*{ by (prover: "ls4") }*)
173
+
174
+ (**************************************************************************)
175
+ (* Backend pragma: Zenon with different timeouts (default is 10 seconds) *)
176
+ (* *)
177
+ (**************************************************************************)
178
+
179
+ Zenon == TRUE (*{ by (prover:"zenon") }*)
180
+ ZenonT(X) == TRUE (*{ by (prover:"zenon"; timeout:@) }*)
181
+
182
+ (********************************************************************)
183
+ (* Backend pragma: Isabelle with different timeouts and tactics *)
184
+ (* (default is 30 seconds/auto) *)
185
+ (********************************************************************)
186
+
187
+ Isa == TRUE (*{ by (prover:"isabelle") }*)
188
+ IsaT(X) == TRUE (*{ by (prover:"isabelle"; timeout:@) }*)
189
+ IsaM(X) == TRUE (*{ by (prover:"isabelle"; tactic:@) }*)
190
+ IsaMT(X,Y) == TRUE (*{ by (prover:"isabelle"; tactic:@; timeout:@) }*)
191
+
192
+ (***************************************************************************)
193
+ (* The following theorem expresses the (useful implication of the) law of *)
194
+ (* set extensionality, which can be written as *)
195
+ (* *)
196
+ (* THEOREM \\A S, T : (S = T) <=> (\\A x : (x \\in S) <=> (x \\in T)) *)
197
+ (* *)
198
+ (* Theorem SetExtensionality is sometimes required by the SMT backend for *)
199
+ (* reasoning about sets. It is usually counterproductive to include *)
200
+ (* theorem SetExtensionality in a BY clause for the Zenon or Isabelle *)
201
+ (* backends. Instead, use the pragma IsaWithSetExtensionality to instruct *)
202
+ (* the Isabelle backend to use the rule of set extensionality. *)
203
+ (***************************************************************************)
204
+ IsaWithSetExtensionality == TRUE
205
+ (*{ by (prover:"isabelle"; tactic:"(auto intro: setEqualI)")}*)
206
+
207
+ THEOREM SetExtensionality == \\A S,T : (\\A x : x \\in S <=> x \\in T) => S = T
208
+ OBVIOUS
209
+
210
+ (***************************************************************************)
211
+ (* The following theorem is needed to deduce NotInSetS \\notin SetS from *)
212
+ (* the definition *)
213
+ (* *)
214
+ (* NotInSetS == CHOOSE v : v \\notin SetS *)
215
+ (***************************************************************************)
216
+ THEOREM NoSetContainsEverything == \\A S : \\E x : x \\notin S
217
+ OBVIOUS (*{by (isabelle "(auto intro: inIrrefl)")}*)
218
+ -----------------------------------------------------------------------------
219
+
220
+
221
+
222
+ (********************************************************************)
223
+ (********************************************************************)
224
+ (********************************************************************)
225
+
226
+
227
+ (********************************************************************)
228
+ (* Old versions of Zenon and Isabelle pragmas below *)
229
+ (* (kept for compatibility) *)
230
+ (********************************************************************)
231
+
232
+
233
+ (**************************************************************************)
234
+ (* Backend pragma: Zenon with different timeouts (default is 10 seconds) *)
235
+ (* *)
236
+ (**************************************************************************)
237
+
238
+ SlowZenon == TRUE (*{ by (prover:"zenon"; timeout:20) }*)
239
+ SlowerZenon == TRUE (*{ by (prover:"zenon"; timeout:40) }*)
240
+ VerySlowZenon == TRUE (*{ by (prover:"zenon"; timeout:80) }*)
241
+ SlowestZenon == TRUE (*{ by (prover:"zenon"; timeout:160) }*)
242
+
243
+
244
+
245
+ (********************************************************************)
246
+ (* Backend pragma: Isabelle's automatic search ("auto") *)
247
+ (* *)
248
+ (* This pragma bypasses Zenon. It is useful in situations involving *)
249
+ (* essentially simplification and equational reasoning. *)
250
+ (* Default imeout for all isabelle tactics is 30 seconds. *)
251
+ (********************************************************************)
252
+ Auto == TRUE (*{ by (prover:"isabelle"; tactic:"auto") }*)
253
+ SlowAuto == TRUE (*{ by (prover:"isabelle"; tactic:"auto"; timeout:120) }*)
254
+ SlowerAuto == TRUE (*{ by (prover:"isabelle"; tactic:"auto"; timeout:480) }*)
255
+ SlowestAuto == TRUE (*{ by (prover:"isabelle"; tactic:"auto"; timeout:960) }*)
256
+
257
+ (********************************************************************)
258
+ (* Backend pragma: Isabelle's "force" tactic *)
259
+ (* *)
260
+ (* This pragma bypasses Zenon. It is useful in situations involving *)
261
+ (* quantifier reasoning. *)
262
+ (********************************************************************)
263
+ Force == TRUE (*{ by (prover:"isabelle"; tactic:"force") }*)
264
+ SlowForce == TRUE (*{ by (prover:"isabelle"; tactic:"force"; timeout:120) }*)
265
+ SlowerForce == TRUE (*{ by (prover:"isabelle"; tactic:"force"; timeout:480) }*)
266
+ SlowestForce == TRUE (*{ by (prover:"isabelle"; tactic:"force"; timeout:960) }*)
267
+
268
+ (***********************************************************************)
269
+ (* Backend pragma: Isabelle's "simplification" tactics *)
270
+ (* *)
271
+ (* These tactics simplify the goal before running one of the automated *)
272
+ (* tactics. They are often necessary for obligations involving record *)
273
+ (* or tuple projections. Use the SimplfyAndSolve tactic unless you're *)
274
+ (* sure you can get away with just Simplification *)
275
+ (***********************************************************************)
276
+ SimplifyAndSolve == TRUE
277
+ (*{ by (prover:"isabelle"; tactic:"clarsimp auto?") }*)
278
+ SlowSimplifyAndSolve == TRUE
279
+ (*{ by (prover:"isabelle"; tactic:"clarsimp auto?"; timeout:120) }*)
280
+ SlowerSimplifyAndSolve == TRUE
281
+ (*{ by (prover:"isabelle"; tactic:"clarsimp auto?"; timeout:480) }*)
282
+ SlowestSimplifyAndSolve == TRUE
283
+ (*{ by (prover:"isabelle"; tactic:"clarsimp auto?"; timeout:960) }*)
284
+
285
+ Simplification == TRUE (*{ by (prover:"isabelle"; tactic:"clarsimp") }*)
286
+ SlowSimplification == TRUE
287
+ (*{ by (prover:"isabelle"; tactic:"clarsimp"; timeout:120) }*)
288
+ SlowerSimplification == TRUE
289
+ (*{ by (prover:"isabelle"; tactic:"clarsimp"; timeout:480) }*)
290
+ SlowestSimplification == TRUE
291
+ (*{ by (prover:"isabelle"; tactic:"clarsimp"; timeout:960) }*)
292
+
293
+ (**************************************************************************)
294
+ (* Backend pragma: Isabelle's tableau prover ("blast") *)
295
+ (* *)
296
+ (* This pragma bypasses Zenon and uses Isabelle's built-in theorem *)
297
+ (* prover, Blast. It is almost never better than Zenon by itself, but *)
298
+ (* becomes very useful in combination with the Auto pragma above. The *)
299
+ (* AutoBlast pragma first attempts Auto and then uses Blast to prove what *)
300
+ (* Auto could not prove. (There is currently no way to use Zenon on the *)
301
+ (* results left over from Auto.) *)
302
+ (**************************************************************************)
303
+ Blast == TRUE (*{ by (prover:"isabelle"; tactic:"blast") }*)
304
+ SlowBlast == TRUE (*{ by (prover:"isabelle"; tactic:"blast"; timeout:120) }*)
305
+ SlowerBlast == TRUE (*{ by (prover:"isabelle"; tactic:"blast"; timeout:480) }*)
306
+ SlowestBlast == TRUE (*{ by (prover:"isabelle"; tactic:"blast"; timeout:960) }*)
307
+
308
+ AutoBlast == TRUE (*{ by (prover:"isabelle"; tactic:"auto, blast") }*)
309
+
310
+
311
+ (**************************************************************************)
312
+ (* Backend pragmas: multi-back-ends *)
313
+ (* *)
314
+ (* These pragmas just run a bunch of back-ends one after the other in the *)
315
+ (* hope that one will succeed. This saves time and effort for the user at *)
316
+ (* the expense of computation time. *)
317
+ (**************************************************************************)
318
+
319
+ (* CVC3 goes first because it's bundled with TLAPS, then the other SMT
320
+ solvers are unlikely to succeed if CVC3 fails, so we run zenon and
321
+ Isabelle before them. *)
322
+ AllProvers == TRUE (*{
323
+ by (prover:"cvc33")
324
+ by (prover:"zenon")
325
+ by (prover:"isabelle"; tactic:"auto")
326
+ by (prover:"spass")
327
+ by (prover:"smt3")
328
+ by (prover:"yices3")
329
+ by (prover:"verit")
330
+ by (prover:"z33")
331
+ by (prover:"isabelle"; tactic:"force")
332
+ by (prover:"isabelle"; tactic:"(auto intro: setEqualI)")
333
+ by (prover:"isabelle"; tactic:"clarsimp auto?")
334
+ by (prover:"isabelle"; tactic:"clarsimp")
335
+ by (prover:"isabelle"; tactic:"auto, blast")
336
+ }*)
337
+ AllProversT(X) == TRUE (*{
338
+ by (prover:"cvc33"; timeout:@)
339
+ by (prover:"zenon"; timeout:@)
340
+ by (prover:"isabelle"; tactic:"auto"; timeout:@)
341
+ by (prover:"spass"; timeout:@)
342
+ by (prover:"smt3"; timeout:@)
343
+ by (prover:"yices3"; timeout:@)
344
+ by (prover:"verit"; timeout:@)
345
+ by (prover:"z33"; timeout:@)
346
+ by (prover:"isabelle"; tactic:"force"; timeout:@)
347
+ by (prover:"isabelle"; tactic:"(auto intro: setEqualI)"; timeout:@)
348
+ by (prover:"isabelle"; tactic:"clarsimp auto?"; timeout:@)
349
+ by (prover:"isabelle"; tactic:"clarsimp"; timeout:@)
350
+ by (prover:"isabelle"; tactic:"auto, blast"; timeout:@)
351
+ }*)
352
+
353
+ AllSMT == TRUE (*{
354
+ by (prover:"cvc33")
355
+ by (prover:"smt3")
356
+ by (prover:"yices3")
357
+ by (prover:"verit")
358
+ by (prover:"z33")
359
+ }*)
360
+ AllSMTT(X) == TRUE (*{
361
+ by (prover:"cvc33"; timeout:@)
362
+ by (prover:"smt3"; timeout:@)
363
+ by (prover:"yices3"; timeout:@)
364
+ by (prover:"verit"; timeout:@)
365
+ by (prover:"z33"; timeout:@)
366
+ }*)
367
+
368
+ AllIsa == TRUE (*{
369
+ by (prover:"isabelle"; tactic:"auto")
370
+ by (prover:"isabelle"; tactic:"force")
371
+ by (prover:"isabelle"; tactic:"(auto intro: setEqualI)")
372
+ by (prover:"isabelle"; tactic:"clarsimp auto?")
373
+ by (prover:"isabelle"; tactic:"clarsimp")
374
+ by (prover:"isabelle"; tactic:"auto, blast")
375
+ }*)
376
+ AllIsaT(X) == TRUE (*{
377
+ by (prover:"isabelle"; tactic:"auto"; timeout:@)
378
+ by (prover:"isabelle"; tactic:"force"; timeout:@)
379
+ by (prover:"isabelle"; tactic:"(auto intro: setEqualI)"; timeout:@)
380
+ by (prover:"isabelle"; tactic:"clarsimp auto?"; timeout:@)
381
+ by (prover:"isabelle"; tactic:"clarsimp"; timeout:@)
382
+ by (prover:"isabelle"; tactic:"auto, blast"; timeout:@)
383
+ }*)
384
+
385
+
386
+ (**************************************************************************)
387
+ (* The pragma ExpandEnabled invokes expansion of the operator ENABLED. *)
388
+ (* *)
389
+ (* The pragma ExpandCdot invokes expansion of the operator \\cdot. *)
390
+ (* *)
391
+ (* The pragma AutoUSE invokes automated expansion of definitions, *)
392
+ (* for both of ExpandEnabled and ExpandCdot, when each is present. *)
393
+ (* *)
394
+ (* The pragma Lambdify invokes expansion of the operators *)
395
+ (* ENABLED and \\cdot to an intermediate form with bound VARIABLES, *)
396
+ (* which is a form before introducing rigid quantifiers. *)
397
+ (* The pragma Lambdify is sound for occurrences of ENABLED and \\cdot *)
398
+ (* that are not nested. *)
399
+ (**************************************************************************)
400
+ ExpandENABLED == TRUE (*{ by (prover:"expandenabled") }*)
401
+ ExpandCdot == TRUE (*{ by (prover:"expandcdot") }*)
402
+ AutoUSE == TRUE (*{ by (prover:"autouse") }*)
403
+ Lambdify == TRUE (*{ by (prover:"lambdify") }*)
404
+ ENABLEDaxioms == TRUE (*{ by (prover:"enabledaxioms") }*)
405
+ LevelComparison == TRUE (*{ by (prover:"levelcomparison") }*)
406
+
407
+ (* The operators EnabledWrapper and CdotWrapper occur in an intermediate *)
408
+ (* representation within TLAPM. *)
409
+ EnabledWrapper(Op(_)) == FALSE
410
+ CdotWrapper(Op(_)) == FALSE
411
+
412
+ (***************************************************************************)
413
+ (* The following may be used in a \`BY ONLY ThmName\` for unit testing the *)
414
+ (* triviality checks in TLAPM. *)
415
+ (***************************************************************************)
416
+ Trivial == TRUE (*{ by (prover:"trivial") }*)
417
+
418
+
419
+ =============================================================================
420
+
421
+ The material below is obsolete: the TLA proof rules below are superseded by
422
+ the PTL decision procedure, and their formulation is unsound for the semantics
423
+ of temporal reasoning that TLAPS adopts.
424
+
425
+ ----------------------------------------------------------------------------
426
+ (***************************************************************************)
427
+ (* TEMPORAL LOGIC *)
428
+ (* *)
429
+ (* The following rules are intended to be used when TLAPS handles temporal *)
430
+ (* logic. They will not work now. Moreover when temporal reasoning is *)
431
+ (* implemented, these rules may be changed or omitted, and additional *)
432
+ (* rules will probably be added. However, they are included mainly so *)
433
+ (* their names will be defined, preventing the use of identifiers that are *)
434
+ (* likely to produce name clashes with future versions of this module. *)
435
+ (***************************************************************************)
436
+
437
+
438
+ (***************************************************************************)
439
+ (* The following proof rules (and their names) are from the paper "The *)
440
+ (* Temporal Logic of Actions". *)
441
+ (***************************************************************************)
442
+ THEOREM RuleTLA1 == ASSUME STATE P, STATE f,
443
+ P /\\ (f' = f) => P'
444
+ PROVE []P <=> P /\\ [][P => P']_f
445
+
446
+ THEOREM RuleTLA2 == ASSUME STATE P, STATE Q, STATE f, STATE g,
447
+ ACTION A, ACTION B,
448
+ P /\\ [A]_f => Q /\\ [B]_g
449
+ PROVE []P /\\ [][A]_f => []Q /\\ [][B]_g
450
+
451
+ THEOREM RuleINV1 == ASSUME STATE I, STATE F, ACTION N,
452
+ I /\\ [N]_F => I'
453
+ PROVE I /\\ [][N]_F => []I
454
+
455
+ THEOREM RuleINV2 == ASSUME STATE I, STATE f, ACTION N
456
+ PROVE []I => ([][N]_f <=> [][N /\\ I /\\ I']_f)
457
+
458
+ THEOREM RuleWF1 == ASSUME STATE P, STATE Q, STATE f, ACTION N, ACTION A,
459
+ P /\\ [N]_f => (P' \\/ Q'),
460
+ P /\\ <<N /\\ A>>_f => Q',
461
+ P => ENABLED <<A>>_f
462
+ PROVE [][N]_f /\\ WF_f(A) => (P ~> Q)
463
+
464
+ THEOREM RuleSF1 == ASSUME STATE P, STATE Q, STATE f,
465
+ ACTION N, ACTION A, TEMPORAL F,
466
+ P /\\ [N]_f => (P' \\/ Q'),
467
+ P /\\ <<N /\\ A>>_f => Q',
468
+ []P /\\ [][N]_f /\\ []F => <> ENABLED <<A>>_f
469
+ PROVE [][N]_f /\\ SF_f(A) /\\ []F => (P ~> Q)
470
+
471
+ (***************************************************************************)
472
+ (* The rules WF2 and SF2 in "The Temporal Logic of Actions" are obtained *)
473
+ (* from the following two rules by the following substitutions: \`. *)
474
+ (* *)
475
+ (* ___ ___ _______________ *)
476
+ (* M <- M , g <- g , EM <- ENABLED <<M>>_g .' *)
477
+ (***************************************************************************)
478
+ THEOREM RuleWF2 == ASSUME STATE P, STATE f, STATE g, STATE EM,
479
+ ACTION A, ACTION B, ACTION N, ACTION M,
480
+ TEMPORAL F,
481
+ <<N /\\ B>>_f => <<M>>_g,
482
+ P /\\ P' /\\ <<N /\\ A>>_f /\\ EM => B,
483
+ P /\\ EM => ENABLED A,
484
+ [][N /\\ ~B]_f /\\ WF_f(A) /\\ []F /\\ <>[]EM => <>[]P
485
+ PROVE [][N]_f /\\ WF_f(A) /\\ []F => []<><<M>>_g \\/ []<>(~EM)
486
+
487
+ THEOREM RuleSF2 == ASSUME STATE P, STATE f, STATE g, STATE EM,
488
+ ACTION A, ACTION B, ACTION N, ACTION M,
489
+ TEMPORAL F,
490
+ <<N /\\ B>>_f => <<M>>_g,
491
+ P /\\ P' /\\ <<N /\\ A>>_f /\\ EM => B,
492
+ P /\\ EM => ENABLED A,
493
+ [][N /\\ ~B]_f /\\ SF_f(A) /\\ []F /\\ []<>EM => <>[]P
494
+ PROVE [][N]_f /\\ SF_f(A) /\\ []F => []<><<M>>_g \\/ <>[](~EM)
495
+
496
+
497
+ (***************************************************************************)
498
+ (* The following rule is a special case of the general temporal logic *)
499
+ (* proof rule STL4 from the paper "The Temporal Logic of Actions". The *)
500
+ (* general rule is for arbitrary temporal formulas F and G, but it cannot *)
501
+ (* yet be handled by TLAPS. *)
502
+ (***************************************************************************)
503
+ THEOREM RuleInvImplication ==
504
+ ASSUME STATE F, STATE G,
505
+ F => G
506
+ PROVE []F => []G
507
+ PROOF OMITTED
508
+
509
+ (***************************************************************************)
510
+ (* The following rule is a special case of rule TLA2 from the paper "The *)
511
+ (* Temporal Logic of Actions". *)
512
+ (***************************************************************************)
513
+ THEOREM RuleStepSimulation ==
514
+ ASSUME STATE I, STATE f, STATE g,
515
+ ACTION M, ACTION N,
516
+ I /\\ I' /\\ [M]_f => [N]_g
517
+ PROVE []I /\\ [][M]_f => [][N]_g
518
+ PROOF OMITTED
519
+
520
+ (***************************************************************************)
521
+ (* The following may be used to invoke a decision procedure for *)
522
+ (* propositional temporal logic. *)
523
+ (***************************************************************************)
524
+ PropositionalTemporalLogic == TRUE
525
+ =============================================================================
526
+ `,bf=e=>vu(pl(e)),xf=(e,t,n,r)=>(n.rlimit===void 0?``:`(set-option :rlimit ${n.rlimit})\n`)+pf(bf(t),r),Sf={smt:xf,z3:xf,zenon:(e,t)=>vf(e,bf(t)),isabelle:(e,t,n)=>Ec(e,bf(t),n.tactic??`auto`),ls4:(e,t)=>Eu(t)},Cf=e=>e.kind===`Case`&&e.other===void 0||hr(e).some(Cf),wf=/* @__PURE__ */ new WeakMap,Tf=e=>{let t=wf.get(e);if(t!==void 0)return t;let n=[];fr(e,e=>(n.push(e),e),`all`);let r=n.some(Cf);return wf.set(e,r),r},Ef=e=>/-{4,}\s*MODULE\s+(\w+)/.exec(e)?.[1]??`Main`,Df=e=>({id:e.id,location:e.location,text:e.text}),Of=(e,t,n,r=[])=>({obligation:{...Df(e),status:t,reason:n},attempts:r}),kf=(e,t)=>`${Qo(t?fu(tu(e.sequent,!1)):mu(e))}\n`,Af=(e,t,n)=>Dc(e,t.flatMap((e,t)=>e.attempts.filter(e=>e.method.prover===`isabelle`&&e.isProved&&!e.isReused).map(r=>({id:e.obligation.id,sequent:bf(mu(n[t])),tactic:r.method.tactic??`auto`})))),jf=async(e,t)=>{let n=e.tasks[t];if(n.session)return n.session.current;let r=e.tasks.slice(0,t);await Promise.all(r.map(e=>e.done));let i=r.reduce((e,t)=>e+(t.session?t.session.current.caseErrors-t.session.initial:0),0);return n.session={initial:i,current:{caseErrors:i}},n.session.current},Mf=async(e,t,n,r)=>{if(e.kind.kind===`Error`)return Of(e,`failed`,e.kind.message);let i=Zl(e),a=wl(e.sequent),o=n.lastByFingerprint.get(a);n.lastByFingerprint.set(a,n.tasks[t].done),await o;let s=[],c=[],l=t=>({obligation:{...Df(e),status:`proved`,prover:t},attempts:s}),u=t=>{n.isFingerprinted(e)||n.results.delete(a);let r=n.results.get(a)?.get(t.prover);return r?.method.tactic===t.tactic?r:void 0},d=e=>e.rlimit??e.timeLimitMs/1e3,f=e=>s.push({...e,isReused:!0,timeUsedMs:void 0}),p=e=>{s.push(e),n.results.set(a,(n.results.get(a)??/* @__PURE__ */ new Map).set(e.method.prover,e))},m=(e,t)=>{s.push({method:e,isProved:!1,isReused:!1,reason:t}),c.push({reason:t,isDecided:!1})},h=u(i.provers[0]);if(h?.isProved)return f(h),l(h.method.prover);let g=mu(e,i);if(e.kind.kind===`Support`&&hu(g))return n.results.set(a,n.results.get(a)??/* @__PURE__ */ new Map),{obligation:{...Df(e),status:`trivial`},attempts:s};for(let a of i.provers){let i=u(a);if(i?.isProved)return f(i),l(a.prover);if(i&&d(i.method)>=d(a)){f(i),c.push({reason:`${a.prover} failed on an obligation with the same fingerprint`,isDecided:!0});continue}if(!n.isProving)continue;if(a.prover===`trivial`)return l(a.prover);let o=Sf[a.prover];if(!o)m(a,`tla-ts has no ${a.prover} backend`);else try{let i=o===xf&&(g.context.some(Tf)||Cf(g.active))?await jf(n,t):{caseErrors:0},s=o(e.id,g,a,i),u=await n.decide(a.prover,s,{timeLimitMs:a.timeLimitMs,signal:r},t),d=u.verdict===`unsat`;if(p({method:a,isProved:d,isReused:!1,...!d&&{reason:u.timeUsedMs>=a.timeLimitMs?`timeout`:`false`},verdict:u.verdict,timeUsedMs:u.timeUsedMs}),d)return l(a.prover);c.push({reason:`${a.prover} answered ${u.verdict}`,isDecided:!0})}catch(e){if(e instanceof S){p({method:a,isProved:!1,isReused:!1,reason:`false`}),c.push({reason:`${a.prover} failed: ${e.message}`,isDecided:!0});continue}if(!(e instanceof v))throw e;m(a,`${a.prover} can't encode ${e.message}`)}}return Of(e,c.some(e=>e.isDecided)?`failed`:`unsupported`,c.map(e=>e.reason).join(`, `),s)},Nf=(e,t)=>{if(t instanceof v)return Of(e,`unsupported`,t.message);if(t instanceof S)return Of(e,`failed`,t.message);throw t},Pf=async(e,t)=>{let n=t.workers??1,r=n>1&&b()?await sc(n):void 0,i=()=>r?.terminate(t.signal?.reason);t.signal?.addEventListener(`abort`,i);let a={tasks:[],results:t.results??/* @__PURE__ */ new Map,isFingerprinted:t.isFingerprinted??(()=>!0),isProving:t.isProving??!0,lastByFingerprint:/* @__PURE__ */ new Map,decide:r?.decide??(async(e,t,n)=>xt(e,t,n))},o=r?n*4:1,s=[],c=[],l=/* @__PURE__ */ new Set,u=[],d=async()=>{for(;c[u.length];){t.signal?.throwIfAborted();let n=await s[u.length];u.push(n),t.onReport?.(n,e[u.length-1]),await new Promise(e=>setTimeout(e))}};try{for(let[n,r]of e.entries()){t.signal?.throwIfAborted();let e=Promise.withResolvers();a.tasks.push({done:e.promise,session:void 0});let i=Mf(r,n,a,t.signal).catch(e=>Nf(r,e));s.push(i),l.add(e.promise);let u=()=>{c[n]=!0,l.delete(e.promise),e.resolve()};i.then(u,u),l.size>=o&&await Promise.race(l),await d()}await Promise.all(l),await d()}finally{t.signal?.removeEventListener(`abort`,i),r?.terminate(new S(`prove stopped`))}return u},Ff=(e,t)=>({...Df(e),...t??{status:`unsupported`,reason:`tlapm reported no result`}}),If=async e=>{let t=Ef(e.source),n=/* @__PURE__ */ new Map,r=oc([{file:`${t}.tla`,source:e.source}],t=>{let r=e.loadModule?.(t);r!==void 0&&n.set(t,r);let i=r??(t===`TLAPS`?`------------------------------- MODULE TLAPS --------------------------------
527
+
528
+ (* Backend pragmas. *)
529
+
530
+
531
+ (***************************************************************************)
532
+ (* Each of these pragmas can be cited with a BY or a USE. The pragma that *)
533
+ (* is added to the context of an obligation most recently is the one whose *)
534
+ (* effects are triggered. *)
535
+ (***************************************************************************)
536
+
537
+ (***************************************************************************)
538
+ (* The following pragmas should be used only as a last resource. They are *)
539
+ (* dependent upon the particular backend provers, and are unlikely to have *)
540
+ (* any effect if the set of backend provers changes. Moreover, they are *)
541
+ (* meaningless to a reader of the proof. *)
542
+ (***************************************************************************)
543
+
544
+
545
+ (**************************************************************************)
546
+ (* Backend pragma: use the SMT solver for arithmetic. *)
547
+ (* *)
548
+ (* This method exists under this name for historical reasons. *)
549
+ (**************************************************************************)
550
+
551
+ SimpleArithmetic == TRUE (*{ by (prover:"smt3") }*)
552
+
553
+
554
+ (**************************************************************************)
555
+ (* Backend pragma: SMT solver *)
556
+ (* *)
557
+ (* This method translates the proof obligation to SMTLIB2. The supported *)
558
+ (* fragment includes first-order logic, set theory, functions and *)
559
+ (* records. *)
560
+ (* SMT calls the smt-solver with the default timeout of 5 seconds *)
561
+ (* while SMTT(n) calls the smt-solver with a timeout of n seconds. *)
562
+ (* *)
563
+ (* SMTT also accepts a string argument of the form "rN" to bound the *)
564
+ (* underlying Z3 solver by a deterministic \`rlimit\` budget instead of a *)
565
+ (* wall-clock timeout, e.g. SMTT("r5"). N is a multiple of a fixed base *)
566
+ (* resource count, so a small readable budget like "r5" is meaningful. *)
567
+ (* Unlike a wall-clock timeout, an \`rlimit\` budget does not depend on CPU *)
568
+ (* speed or load, so the proof's pass/fail outcome reproduces on any *)
569
+ (* machine and every rerun (for a fixed Z3 build); how long it takes to *)
570
+ (* consume the budget still varies by machine. This is Z3-specific. *)
571
+ (**************************************************************************)
572
+
573
+ SMT == TRUE (*{ by (prover:"smt3") }*)
574
+ SMTT(X) == TRUE (*{ by (prover:"smt3"; timeout:@) }*)
575
+
576
+
577
+ (**************************************************************************)
578
+ (* Backend pragma: CVC4 SMT solver *)
579
+ (* *)
580
+ (* These methods translate the proof obligation to SMTLIB2 and call CVC4. *)
581
+ (**************************************************************************)
582
+
583
+ (* The CVC3* methods are here for backward compatibility. They call CVC4. *)
584
+ CVC3 == TRUE (*{ by (prover: "cvc33") }*)
585
+ CVC3T(X) == TRUE (*{ by (prover:"cvc33"; timeout:@) }*)
586
+
587
+ CVC4 == TRUE (*{ by (prover: "cvc33") }*)
588
+ CVC4T(X) == TRUE (*{ by (prover:"cvc33"; timeout:@) }*)
589
+
590
+
591
+ (**************************************************************************)
592
+ (* Backend pragma: Yices SMT solver *)
593
+ (* *)
594
+ (* This method translates the proof obligation to Yices native language. *)
595
+ (**************************************************************************)
596
+
597
+ Yices == TRUE (*{ by (prover: "yices3") }*)
598
+ YicesT(X) == TRUE (*{ by (prover:"yices3"; timeout:@) }*)
599
+
600
+ (**************************************************************************)
601
+ (* Backend pragma: veriT SMT solver *)
602
+ (* *)
603
+ (* This method translates the proof obligation to SMTLIB2 and calls veriT.*)
604
+ (**************************************************************************)
605
+
606
+ veriT == TRUE (*{ by (prover: "verit") }*)
607
+ veriTT(X) == TRUE (*{ by (prover:"verit"; timeout:@) }*)
608
+
609
+ (**************************************************************************)
610
+ (* Backend pragma: Zipperposition solver *)
611
+ (* *)
612
+ (* This method translates the proof obligation to TPTP and *)
613
+ (* calls Zipperposition. *)
614
+ (**************************************************************************)
615
+
616
+ Zipper == TRUE (*{ by (prover: "zipper") }*)
617
+ ZipperT(X) == TRUE (*{ by (prover:"zipper"; timeout:@) }*)
618
+
619
+ (**************************************************************************)
620
+ (* Backend pragma: Z3 SMT solver *)
621
+ (* *)
622
+ (* This method translates the proof obligation to SMTLIB2 and calls Z3. *)
623
+ (* Z3 is used by default but you can also explicitly call it. *)
624
+ (* Z3T(n) bounds Z3 by a wall-clock timeout of n seconds, while Z3T("rN") *)
625
+ (* bounds it by a deterministic \`rlimit\` budget of N base units, which *)
626
+ (* reproduces the same outcome on any machine (see SMTT). *)
627
+ (**************************************************************************)
628
+
629
+ Z3 == TRUE (*{ by (prover: "z33") }*)
630
+ Z3T(X) == TRUE (*{ by (prover:"z33"; timeout:@) }*)
631
+
632
+ (**************************************************************************)
633
+ (* Backend pragma: SPASS superposition prover *)
634
+ (* *)
635
+ (* This method translates the proof obligation to the DFG format language *)
636
+ (* supported by the ATP SPASS. The translation is based on the SMT one. *)
637
+ (**************************************************************************)
638
+
639
+ Spass == TRUE (*{ by (prover: "spass") }*)
640
+ SpassT(X) == TRUE (*{ by (prover:"spass"; timeout:@) }*)
641
+
642
+ (**************************************************************************)
643
+ (* Backend pragma: The PTL propositional linear time temporal logic *)
644
+ (* prover. It currently is the LS4 backend. *)
645
+ (* *)
646
+ (* This method translates the negetation of the proof obligation to *)
647
+ (* Seperated Normal Form (TRP++ format) and checks for unsatisfiability *)
648
+ (**************************************************************************)
649
+
650
+ LS4 == TRUE (*{ by (prover: "ls4") }*)
651
+ LS4T(X) == TRUE (*{ by (prover: "ls4"; timeout:@) }*)
652
+ PTL == TRUE (*{ by (prover: "ls4") }*)
653
+
654
+ (**************************************************************************)
655
+ (* Backend pragma: Zenon with different timeouts (default is 10 seconds) *)
656
+ (* *)
657
+ (**************************************************************************)
658
+
659
+ Zenon == TRUE (*{ by (prover:"zenon") }*)
660
+ ZenonT(X) == TRUE (*{ by (prover:"zenon"; timeout:@) }*)
661
+
662
+ (********************************************************************)
663
+ (* Backend pragma: Isabelle with different timeouts and tactics *)
664
+ (* (default is 30 seconds/auto) *)
665
+ (********************************************************************)
666
+
667
+ Isa == TRUE (*{ by (prover:"isabelle") }*)
668
+ IsaT(X) == TRUE (*{ by (prover:"isabelle"; timeout:@) }*)
669
+ IsaM(X) == TRUE (*{ by (prover:"isabelle"; tactic:@) }*)
670
+ IsaMT(X,Y) == TRUE (*{ by (prover:"isabelle"; tactic:@; timeout:@) }*)
671
+
672
+ (***************************************************************************)
673
+ (* The following theorem expresses the (useful implication of the) law of *)
674
+ (* set extensionality, which can be written as *)
675
+ (* *)
676
+ (* THEOREM \\A S, T : (S = T) <=> (\\A x : (x \\in S) <=> (x \\in T)) *)
677
+ (* *)
678
+ (* Theorem SetExtensionality is sometimes required by the SMT backend for *)
679
+ (* reasoning about sets. It is usually counterproductive to include *)
680
+ (* theorem SetExtensionality in a BY clause for the Zenon or Isabelle *)
681
+ (* backends. Instead, use the pragma IsaWithSetExtensionality to instruct *)
682
+ (* the Isabelle backend to use the rule of set extensionality. *)
683
+ (***************************************************************************)
684
+ IsaWithSetExtensionality == TRUE
685
+ (*{ by (prover:"isabelle"; tactic:"(auto intro: setEqualI)")}*)
686
+
687
+ THEOREM SetExtensionality == \\A S,T : (\\A x : x \\in S <=> x \\in T) => S = T
688
+ OBVIOUS
689
+
690
+ (***************************************************************************)
691
+ (* The following theorem is needed to deduce NotInSetS \\notin SetS from *)
692
+ (* the definition *)
693
+ (* *)
694
+ (* NotInSetS == CHOOSE v : v \\notin SetS *)
695
+ (***************************************************************************)
696
+ THEOREM NoSetContainsEverything == \\A S : \\E x : x \\notin S
697
+ OBVIOUS (*{by (isabelle "(auto intro: inIrrefl)")}*)
698
+ -----------------------------------------------------------------------------
699
+
700
+
701
+
702
+ (********************************************************************)
703
+ (********************************************************************)
704
+ (********************************************************************)
705
+
706
+
707
+ (********************************************************************)
708
+ (* Old versions of Zenon and Isabelle pragmas below *)
709
+ (* (kept for compatibility) *)
710
+ (********************************************************************)
711
+
712
+
713
+ (**************************************************************************)
714
+ (* Backend pragma: Zenon with different timeouts (default is 10 seconds) *)
715
+ (* *)
716
+ (**************************************************************************)
717
+
718
+ SlowZenon == TRUE (*{ by (prover:"zenon"; timeout:20) }*)
719
+ SlowerZenon == TRUE (*{ by (prover:"zenon"; timeout:40) }*)
720
+ VerySlowZenon == TRUE (*{ by (prover:"zenon"; timeout:80) }*)
721
+ SlowestZenon == TRUE (*{ by (prover:"zenon"; timeout:160) }*)
722
+
723
+
724
+
725
+ (********************************************************************)
726
+ (* Backend pragma: Isabelle's automatic search ("auto") *)
727
+ (* *)
728
+ (* This pragma bypasses Zenon. It is useful in situations involving *)
729
+ (* essentially simplification and equational reasoning. *)
730
+ (* Default imeout for all isabelle tactics is 30 seconds. *)
731
+ (********************************************************************)
732
+ Auto == TRUE (*{ by (prover:"isabelle"; tactic:"auto") }*)
733
+ SlowAuto == TRUE (*{ by (prover:"isabelle"; tactic:"auto"; timeout:120) }*)
734
+ SlowerAuto == TRUE (*{ by (prover:"isabelle"; tactic:"auto"; timeout:480) }*)
735
+ SlowestAuto == TRUE (*{ by (prover:"isabelle"; tactic:"auto"; timeout:960) }*)
736
+
737
+ (********************************************************************)
738
+ (* Backend pragma: Isabelle's "force" tactic *)
739
+ (* *)
740
+ (* This pragma bypasses Zenon. It is useful in situations involving *)
741
+ (* quantifier reasoning. *)
742
+ (********************************************************************)
743
+ Force == TRUE (*{ by (prover:"isabelle"; tactic:"force") }*)
744
+ SlowForce == TRUE (*{ by (prover:"isabelle"; tactic:"force"; timeout:120) }*)
745
+ SlowerForce == TRUE (*{ by (prover:"isabelle"; tactic:"force"; timeout:480) }*)
746
+ SlowestForce == TRUE (*{ by (prover:"isabelle"; tactic:"force"; timeout:960) }*)
747
+
748
+ (***********************************************************************)
749
+ (* Backend pragma: Isabelle's "simplification" tactics *)
750
+ (* *)
751
+ (* These tactics simplify the goal before running one of the automated *)
752
+ (* tactics. They are often necessary for obligations involving record *)
753
+ (* or tuple projections. Use the SimplfyAndSolve tactic unless you're *)
754
+ (* sure you can get away with just Simplification *)
755
+ (***********************************************************************)
756
+ SimplifyAndSolve == TRUE
757
+ (*{ by (prover:"isabelle"; tactic:"clarsimp auto?") }*)
758
+ SlowSimplifyAndSolve == TRUE
759
+ (*{ by (prover:"isabelle"; tactic:"clarsimp auto?"; timeout:120) }*)
760
+ SlowerSimplifyAndSolve == TRUE
761
+ (*{ by (prover:"isabelle"; tactic:"clarsimp auto?"; timeout:480) }*)
762
+ SlowestSimplifyAndSolve == TRUE
763
+ (*{ by (prover:"isabelle"; tactic:"clarsimp auto?"; timeout:960) }*)
764
+
765
+ Simplification == TRUE (*{ by (prover:"isabelle"; tactic:"clarsimp") }*)
766
+ SlowSimplification == TRUE
767
+ (*{ by (prover:"isabelle"; tactic:"clarsimp"; timeout:120) }*)
768
+ SlowerSimplification == TRUE
769
+ (*{ by (prover:"isabelle"; tactic:"clarsimp"; timeout:480) }*)
770
+ SlowestSimplification == TRUE
771
+ (*{ by (prover:"isabelle"; tactic:"clarsimp"; timeout:960) }*)
772
+
773
+ (**************************************************************************)
774
+ (* Backend pragma: Isabelle's tableau prover ("blast") *)
775
+ (* *)
776
+ (* This pragma bypasses Zenon and uses Isabelle's built-in theorem *)
777
+ (* prover, Blast. It is almost never better than Zenon by itself, but *)
778
+ (* becomes very useful in combination with the Auto pragma above. The *)
779
+ (* AutoBlast pragma first attempts Auto and then uses Blast to prove what *)
780
+ (* Auto could not prove. (There is currently no way to use Zenon on the *)
781
+ (* results left over from Auto.) *)
782
+ (**************************************************************************)
783
+ Blast == TRUE (*{ by (prover:"isabelle"; tactic:"blast") }*)
784
+ SlowBlast == TRUE (*{ by (prover:"isabelle"; tactic:"blast"; timeout:120) }*)
785
+ SlowerBlast == TRUE (*{ by (prover:"isabelle"; tactic:"blast"; timeout:480) }*)
786
+ SlowestBlast == TRUE (*{ by (prover:"isabelle"; tactic:"blast"; timeout:960) }*)
787
+
788
+ AutoBlast == TRUE (*{ by (prover:"isabelle"; tactic:"auto, blast") }*)
789
+
790
+
791
+ (**************************************************************************)
792
+ (* Backend pragmas: multi-back-ends *)
793
+ (* *)
794
+ (* These pragmas just run a bunch of back-ends one after the other in the *)
795
+ (* hope that one will succeed. This saves time and effort for the user at *)
796
+ (* the expense of computation time. *)
797
+ (**************************************************************************)
798
+
799
+ (* CVC3 goes first because it's bundled with TLAPS, then the other SMT
800
+ solvers are unlikely to succeed if CVC3 fails, so we run zenon and
801
+ Isabelle before them. *)
802
+ AllProvers == TRUE (*{
803
+ by (prover:"cvc33")
804
+ by (prover:"zenon")
805
+ by (prover:"isabelle"; tactic:"auto")
806
+ by (prover:"spass")
807
+ by (prover:"smt3")
808
+ by (prover:"yices3")
809
+ by (prover:"verit")
810
+ by (prover:"z33")
811
+ by (prover:"isabelle"; tactic:"force")
812
+ by (prover:"isabelle"; tactic:"(auto intro: setEqualI)")
813
+ by (prover:"isabelle"; tactic:"clarsimp auto?")
814
+ by (prover:"isabelle"; tactic:"clarsimp")
815
+ by (prover:"isabelle"; tactic:"auto, blast")
816
+ }*)
817
+ AllProversT(X) == TRUE (*{
818
+ by (prover:"cvc33"; timeout:@)
819
+ by (prover:"zenon"; timeout:@)
820
+ by (prover:"isabelle"; tactic:"auto"; timeout:@)
821
+ by (prover:"spass"; timeout:@)
822
+ by (prover:"smt3"; timeout:@)
823
+ by (prover:"yices3"; timeout:@)
824
+ by (prover:"verit"; timeout:@)
825
+ by (prover:"z33"; timeout:@)
826
+ by (prover:"isabelle"; tactic:"force"; timeout:@)
827
+ by (prover:"isabelle"; tactic:"(auto intro: setEqualI)"; timeout:@)
828
+ by (prover:"isabelle"; tactic:"clarsimp auto?"; timeout:@)
829
+ by (prover:"isabelle"; tactic:"clarsimp"; timeout:@)
830
+ by (prover:"isabelle"; tactic:"auto, blast"; timeout:@)
831
+ }*)
832
+
833
+ AllSMT == TRUE (*{
834
+ by (prover:"cvc33")
835
+ by (prover:"smt3")
836
+ by (prover:"yices3")
837
+ by (prover:"verit")
838
+ by (prover:"z33")
839
+ }*)
840
+ AllSMTT(X) == TRUE (*{
841
+ by (prover:"cvc33"; timeout:@)
842
+ by (prover:"smt3"; timeout:@)
843
+ by (prover:"yices3"; timeout:@)
844
+ by (prover:"verit"; timeout:@)
845
+ by (prover:"z33"; timeout:@)
846
+ }*)
847
+
848
+ AllIsa == TRUE (*{
849
+ by (prover:"isabelle"; tactic:"auto")
850
+ by (prover:"isabelle"; tactic:"force")
851
+ by (prover:"isabelle"; tactic:"(auto intro: setEqualI)")
852
+ by (prover:"isabelle"; tactic:"clarsimp auto?")
853
+ by (prover:"isabelle"; tactic:"clarsimp")
854
+ by (prover:"isabelle"; tactic:"auto, blast")
855
+ }*)
856
+ AllIsaT(X) == TRUE (*{
857
+ by (prover:"isabelle"; tactic:"auto"; timeout:@)
858
+ by (prover:"isabelle"; tactic:"force"; timeout:@)
859
+ by (prover:"isabelle"; tactic:"(auto intro: setEqualI)"; timeout:@)
860
+ by (prover:"isabelle"; tactic:"clarsimp auto?"; timeout:@)
861
+ by (prover:"isabelle"; tactic:"clarsimp"; timeout:@)
862
+ by (prover:"isabelle"; tactic:"auto, blast"; timeout:@)
863
+ }*)
864
+
865
+
866
+ (**************************************************************************)
867
+ (* The pragma ExpandEnabled invokes expansion of the operator ENABLED. *)
868
+ (* *)
869
+ (* The pragma ExpandCdot invokes expansion of the operator \\cdot. *)
870
+ (* *)
871
+ (* The pragma AutoUSE invokes automated expansion of definitions, *)
872
+ (* for both of ExpandEnabled and ExpandCdot, when each is present. *)
873
+ (* *)
874
+ (* The pragma Lambdify invokes expansion of the operators *)
875
+ (* ENABLED and \\cdot to an intermediate form with bound VARIABLES, *)
876
+ (* which is a form before introducing rigid quantifiers. *)
877
+ (* The pragma Lambdify is sound for occurrences of ENABLED and \\cdot *)
878
+ (* that are not nested. *)
879
+ (**************************************************************************)
880
+ ExpandENABLED == TRUE (*{ by (prover:"expandenabled") }*)
881
+ ExpandCdot == TRUE (*{ by (prover:"expandcdot") }*)
882
+ AutoUSE == TRUE (*{ by (prover:"autouse") }*)
883
+ Lambdify == TRUE (*{ by (prover:"lambdify") }*)
884
+ ENABLEDaxioms == TRUE (*{ by (prover:"enabledaxioms") }*)
885
+ LevelComparison == TRUE (*{ by (prover:"levelcomparison") }*)
886
+
887
+ (* The operators EnabledWrapper and CdotWrapper occur in an intermediate *)
888
+ (* representation within TLAPM. *)
889
+ EnabledWrapper(Op(_)) == FALSE
890
+ CdotWrapper(Op(_)) == FALSE
891
+
892
+ (***************************************************************************)
893
+ (* The following may be used in a \`BY ONLY ThmName\` for unit testing the *)
894
+ (* triviality checks in TLAPM. *)
895
+ (***************************************************************************)
896
+ Trivial == TRUE (*{ by (prover:"trivial") }*)
897
+
898
+
899
+ =============================================================================
900
+
901
+ The material below is obsolete: the TLA proof rules below are superseded by
902
+ the PTL decision procedure, and their formulation is unsound for the semantics
903
+ of temporal reasoning that TLAPS adopts.
904
+
905
+ ----------------------------------------------------------------------------
906
+ (***************************************************************************)
907
+ (* TEMPORAL LOGIC *)
908
+ (* *)
909
+ (* The following rules are intended to be used when TLAPS handles temporal *)
910
+ (* logic. They will not work now. Moreover when temporal reasoning is *)
911
+ (* implemented, these rules may be changed or omitted, and additional *)
912
+ (* rules will probably be added. However, they are included mainly so *)
913
+ (* their names will be defined, preventing the use of identifiers that are *)
914
+ (* likely to produce name clashes with future versions of this module. *)
915
+ (***************************************************************************)
916
+
917
+
918
+ (***************************************************************************)
919
+ (* The following proof rules (and their names) are from the paper "The *)
920
+ (* Temporal Logic of Actions". *)
921
+ (***************************************************************************)
922
+ THEOREM RuleTLA1 == ASSUME STATE P, STATE f,
923
+ P /\\ (f' = f) => P'
924
+ PROVE []P <=> P /\\ [][P => P']_f
925
+
926
+ THEOREM RuleTLA2 == ASSUME STATE P, STATE Q, STATE f, STATE g,
927
+ ACTION A, ACTION B,
928
+ P /\\ [A]_f => Q /\\ [B]_g
929
+ PROVE []P /\\ [][A]_f => []Q /\\ [][B]_g
930
+
931
+ THEOREM RuleINV1 == ASSUME STATE I, STATE F, ACTION N,
932
+ I /\\ [N]_F => I'
933
+ PROVE I /\\ [][N]_F => []I
934
+
935
+ THEOREM RuleINV2 == ASSUME STATE I, STATE f, ACTION N
936
+ PROVE []I => ([][N]_f <=> [][N /\\ I /\\ I']_f)
937
+
938
+ THEOREM RuleWF1 == ASSUME STATE P, STATE Q, STATE f, ACTION N, ACTION A,
939
+ P /\\ [N]_f => (P' \\/ Q'),
940
+ P /\\ <<N /\\ A>>_f => Q',
941
+ P => ENABLED <<A>>_f
942
+ PROVE [][N]_f /\\ WF_f(A) => (P ~> Q)
943
+
944
+ THEOREM RuleSF1 == ASSUME STATE P, STATE Q, STATE f,
945
+ ACTION N, ACTION A, TEMPORAL F,
946
+ P /\\ [N]_f => (P' \\/ Q'),
947
+ P /\\ <<N /\\ A>>_f => Q',
948
+ []P /\\ [][N]_f /\\ []F => <> ENABLED <<A>>_f
949
+ PROVE [][N]_f /\\ SF_f(A) /\\ []F => (P ~> Q)
950
+
951
+ (***************************************************************************)
952
+ (* The rules WF2 and SF2 in "The Temporal Logic of Actions" are obtained *)
953
+ (* from the following two rules by the following substitutions: \`. *)
954
+ (* *)
955
+ (* ___ ___ _______________ *)
956
+ (* M <- M , g <- g , EM <- ENABLED <<M>>_g .' *)
957
+ (***************************************************************************)
958
+ THEOREM RuleWF2 == ASSUME STATE P, STATE f, STATE g, STATE EM,
959
+ ACTION A, ACTION B, ACTION N, ACTION M,
960
+ TEMPORAL F,
961
+ <<N /\\ B>>_f => <<M>>_g,
962
+ P /\\ P' /\\ <<N /\\ A>>_f /\\ EM => B,
963
+ P /\\ EM => ENABLED A,
964
+ [][N /\\ ~B]_f /\\ WF_f(A) /\\ []F /\\ <>[]EM => <>[]P
965
+ PROVE [][N]_f /\\ WF_f(A) /\\ []F => []<><<M>>_g \\/ []<>(~EM)
966
+
967
+ THEOREM RuleSF2 == ASSUME STATE P, STATE f, STATE g, STATE EM,
968
+ ACTION A, ACTION B, ACTION N, ACTION M,
969
+ TEMPORAL F,
970
+ <<N /\\ B>>_f => <<M>>_g,
971
+ P /\\ P' /\\ <<N /\\ A>>_f /\\ EM => B,
972
+ P /\\ EM => ENABLED A,
973
+ [][N /\\ ~B]_f /\\ SF_f(A) /\\ []F /\\ []<>EM => <>[]P
974
+ PROVE [][N]_f /\\ SF_f(A) /\\ []F => []<><<M>>_g \\/ <>[](~EM)
975
+
976
+
977
+ (***************************************************************************)
978
+ (* The following rule is a special case of the general temporal logic *)
979
+ (* proof rule STL4 from the paper "The Temporal Logic of Actions". The *)
980
+ (* general rule is for arbitrary temporal formulas F and G, but it cannot *)
981
+ (* yet be handled by TLAPS. *)
982
+ (***************************************************************************)
983
+ THEOREM RuleInvImplication ==
984
+ ASSUME STATE F, STATE G,
985
+ F => G
986
+ PROVE []F => []G
987
+ PROOF OMITTED
988
+
989
+ (***************************************************************************)
990
+ (* The following rule is a special case of rule TLA2 from the paper "The *)
991
+ (* Temporal Logic of Actions". *)
992
+ (***************************************************************************)
993
+ THEOREM RuleStepSimulation ==
994
+ ASSUME STATE I, STATE f, STATE g,
995
+ ACTION M, ACTION N,
996
+ I /\\ I' /\\ [M]_f => [N]_g
997
+ PROVE []I /\\ [][M]_f => [][N]_g
998
+ PROOF OMITTED
999
+
1000
+ (***************************************************************************)
1001
+ (* The following may be used to invoke a decision procedure for *)
1002
+ (* propositional temporal logic. *)
1003
+ (***************************************************************************)
1004
+ PropositionalTemporalLogic == TRUE
1005
+ =============================================================================
1006
+ `:void 0);return i===void 0?void 0:{file:`${t}.tla`,source:i}}),i=r.flatMap(e=>e.obligations),a={missingProofCount:r.reduce((e,t)=>e+t.summary.absent.length,0),omittedProofCount:r.reduce((e,t)=>e+t.summary.omitted.length,0)};if(e.backend===`tlapm`){if(typeof process>`u`||process.versions?.node===void 0)throw new v(`The tlapm backend runs only in Node and Bun.`);let r=await import(`./tlapm.js`).then(e=>e.n),o=new Map(i.map(e=>[e.id,e])),s=await r.proveWithTlapm(t,new Map([[t,e.source],...n]),{signal:e.signal,onResult:(t,n)=>{let r=o.get(t);r&&e.onObligation?.(Ff(r,n))}});return{obligations:i.map(e=>Ff(e,s.get(e.id))),...a}}return{obligations:(await Pf(i,{workers:e.workers,signal:e.signal,onReport:t=>e.onObligation?.(t.obligation)})).map(e=>e.obligation),...a}};export{yf as a,oc as c,Eo as d,Gn as f,Mt as h,Pf as i,Zo as l,Vn as m,kf as n,qs as o,Un as p,If as r,ac as s,Af as t,V as u};