tla-ts 0.0.4-dev.fa107ef → 0.0.5-dev.552d313

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 +44 -12
  8. package/dist/index.d.ts +44 -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 +135 -120
  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} +169 -142
  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 +79 -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 +38 -22
  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 +154 -105
  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.cjs 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
+ const e=require("./worker.cjs"),t=require("./transfer.cjs"),n=require("./deciders.cjs"),r=[`CONSTANT`,`CONSTANTS`,`INIT`,`NEXT`,`SPECIFICATION`,`INVARIANT`,`INVARIANTS`,`PROPERTY`,`PROPERTIES`,`CONSTRAINT`,`CONSTRAINTS`,`ACTION_CONSTRAINT`,`ACTION_CONSTRAINTS`,`SYMMETRY`,`VIEW`,`CHECK_DEADLOCK`],i=/* @__PURE__ */ new Set([...r,`ALIAS`,`POSTCONDITION`,`POSTCONDITIONS`,`_POSSIBLE`,`_PERIODIC`,`_RL_REWARD`]),a=[`TYPE`,`TYPE_CONSTRAINT`],o=/* @__PURE__ */ new Set([...r,...a]),s=[`<-`,`<<`,`>>`,`=`,`{`,`}`,`,`,`[`,`]`,`(`,`)`,`!`],c=e=>{let n=[],r={index:0,line:1,lineStart:0},i=(i,a)=>{n.push({kind:`Error`,text:t.Gt(r.line,i-r.lineStart+1,e[i],a),line:r.line})},a=e=>{n.push({kind:`Error`,text:t.Gt(r.line+1,0,void 0,e),line:r.line})},o=e=>{let t=e.split(`
10
+ `);t.length>1&&(r.line+=t.length-1,r.lineStart=r.index+e.length-t[t.length-1].length),r.index+=e.length};for(;r.index<e.length;){let c=e.slice(r.index),l=/^\s+/.exec(c)?.[0];if(l){o(l);continue}if(c.startsWith(`\\*`)){let e=c.indexOf(`
11
+ `);o(e===-1?c:c.slice(0,e));continue}if(c.startsWith(`(*`)){let e=c.indexOf(`*)`);if(e===-1)return o(c),a(``),n;o(c.slice(0,e+2));continue}let u=r.line,d=/^\d+(?![A-Za-z_])/.exec(c)?.[0];if(d){n.push({kind:`Number`,text:d,line:u}),o(d);continue}let f=/^[A-Za-z0-9_]+/.exec(c)?.[0];if(f){n.push({kind:`Word`,text:f,line:u}),o(f);continue}if(c.startsWith(`"`)){let t=/^"((?:[^"\\\n]|\\[^\n])*)("?)/.exec(c),s=t?.[0]??`"`;if(t?.[2]!==`"`)return o(s),r.index===e.length?a(`${s}\n`):i(r.index,s),n;n.push({kind:`String`,text:t[1],line:u}),o(s);continue}let p=s.find(e=>c.startsWith(e));if(p){n.push({kind:`Symbol`,text:p,line:u}),o(p);continue}let m=t.Yt(e,r.index)??t.Jt(e,r.index);if(!m)return i(r.index,``),n;n.push({kind:`Word`,text:m.text,line:u}),o(e.slice(r.index,r.index+m.length))}return n.push({kind:`End`,text:``,line:r.line}),n},l=(t,n)=>new e.m(`TLC found an error in the configuration file at line ${t}\n${n}`),u=(e,t)=>l(e,`The keyword ${t} appeared twice.`),d=/* @__PURE__ */ new Map([[`INIT`,`init`],[`NEXT`,`next`],[`SPECIFICATION`,`specification`],[`VIEW`,`view`],[`SYMMETRY`,`symmetry`],[`ALIAS`,`alias`],[`_PERIODIC`,`periodic`],[`_RL_REWARD`,`rlReward`]]),f=/* @__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`]]),p=(t,n=`master`)=>{let r=n===`1.7.4`?o:i,s=c(t),p={index:0},m={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},h={isSet:!1},g=/* @__PURE__ */ new Set,_=()=>{let t=s[Math.min(p.index++,s.length-1)];if(t.kind===`Error`)throw new e.m(`TLC found an error in the configuration file:\n${t.text}`);return t},v=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:_()};if(t.token.text!==`}`)for(;e.push(v(t.token)),t.token=_(),t.token.text===`,`;)t.token=_();if(t.token.text!==`}`)throw l(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 l(e.line,`It was expecting a value, but did not find it.`)},y=e=>{let t=_();if(t.kind===`End`)throw l(t.line,`Expected an identifier after ${e}[.`);let n=_();if(n.text!==`]`)throw l(n.line,`It was expecting ], but did not find it.`);return t.text},b=e=>{for(;;){let t=_();if(t.kind===`End`||r.has(t.text))return t;let n={token:_(),name:t.text};for(;n.token.text===`!`;)n.name=`${n.name}!${_().text}`,n.token=_();let i=n.name;if(n.token.text===`<-`){if(n.token=_(),n.token.text===`[`){let e=y(`<-`),t=_();if(t.kind===`End`)throw l(t.line,`Expected an identifier after <-[mod].`);m.substitutions.push({name:i,target:t.text,module:e});continue}if(n.token.kind===`End`)throw l(n.token.line,`Expected an identifier after <-.`);m.substitutions.push({name:i,target:n.token.text});continue}let a=[],o=n.token.text===`(`;if(o){for(;a.push(v(_())),n.token=_(),n.token.text===`,`;);if(n.token.text!==`)`)throw l(e,``);n.token=_()}if(n.token.text!==`=`)throw l(n.token.line,`It was expecting = or <-, but did not find it.`);n.token=_();let s=n.token.text===`[`?y(`=`):void 0,c=v(s===void 0?n.token:_());m.constants.push({name:i,value:c,...o&&{args:a},...s!==void 0&&{module:s}})}},ee=e=>{for(;;){let t=_();if(t.kind===`End`||r.has(t.text))return t;e.push(t.text)}},x={token:_()};for(;x.token.kind!==`End`;){let e=x.token.text,t=x.token.line,n=r.has(e)?d.get(e):void 0,i=r.has(e)?f.get(e):void 0,o=()=>{let n=_();if(n.kind===`End`)throw l(t,`The keyword ${e} was not followed by an identifier.`);return n};if(n!==void 0){let r=o();if(m[n]!==void 0)throw u(t,e);m[n]=r.text,x.token=_()}else if(i!==void 0)x.token=ee(m[i]);else if(e===`CONSTANT`||e===`CONSTANTS`)x.token=b(t);else if(e===`CHECK_DEADLOCK`){let n=o();if(n.text!==`TRUE`&&n.text!==`FALSE`)throw l(n.line,`It was expecting TRUE or FALSE, but did not find it.`);if(h.isSet)throw u(t,e);h.isSet=!0,m.checkDeadlock=n.text===`TRUE`,x.token=_()}else{if(!r.has(e)||!a.includes(e))throw l(t,`It was expecting a keyword, but did not find it.`);if(o(),g.has(e))throw u(t,e);g.add(e),x.token=_()}}return m},m=e=>{switch(e.kind){case`Always`:return!0;case`Eventually`:case`Not`:case`Next`:return m(e.body);case`And`:case`Or`:return e.operands.some(m);default:return!1}},h=e=>e.promises.some(e=>m(e.body))||e.models.some(e=>e.eventuallyAlways.length>0||e.infinitelyOftenStates.length>0||e.infinitelyOftenActions.length>0),g=(e,n)=>e.every((e,r)=>t.Rt(e,n[r])),_=e=>e.filter((t,n)=>n===0||e[n-1]!==t),v=e=>({data:e(1024),length:0,create:e}),y=(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)},b=(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}},ee=e=>new Int32Array(e).fill(-1),x=(e,t)=>(e.edgeStarts[t]??-1)!==-1,te=(e,t)=>{let n=e.edgeStarts[t];return e.edgeTargets.data.subarray(n,n+e.edgeCounts[t])},S=(e,t,n)=>e.stateResults.data[e.nodeStates[t]*e.solution.stateChecks.length+n]===1,C=(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),ne=(e,t)=>{let n=[];for(let r=e.firstNodes.data[t]??-1;r!==-1;r=e.nextSiblings[r])n.push(r);return n},re=2**53-1,ie=(n,r,i,a)=>{if(n.length===0)return;let o=r.map(e=>t.E(e.expression,e.scope,i)),s=n.map(e=>t.O(`Not`,t.E(e.expression,e.scope,i))),c=s.length===1?s[0]:t.D(`Or`,s),l=o.length===0?c:t.D(`And`,[...o,c]),u=t.k(l);if(u.length===0)throw t.S();let d=/* @__PURE__ */ new Map,f=u.map(e=>({solution:e,actionIds:Int32Array.from(e.actionChecks,e=>{let n=t.A(e),r=d.get(n)??d.size;return d.set(n,r),r}),nodeStates:[],nodeTableaux:[],edgeStarts:[],edgeCounts:[],edgeTargets:v(e=>new Int32Array(e)),edgeActions:v(e=>new Uint8Array(e)),stateResults:v(e=>new Uint8Array(e)),initial:[],firstNodes:v(ee),lastNodes:v(ee),nextSiblings:[],nodeIds:{slots:/* @__PURE__ */ new Int32Array(3072),size:0,shift:22},isDone:[],errorNode:void 0})),p={multiplier:1},m=!t.tt(i),ie={environment:i},w={states:/* @__PURE__ */ new Map,actions:/* @__PURE__ */ new Map},ae=e=>{let t=w.states.get(e)??/* @__PURE__ */ new Map;return w.states.set(e,t),t},oe=(e,t)=>{i.runtime.setLivenessSource(e);let n=t();return i.runtime.setLivenessSource(void 0),n},se=(e,n)=>t.C(e,n,void 0,ie.environment,m?ae(n):/* @__PURE__ */ new Map),T=(e,t,n)=>oe(t,()=>Uint8Array.from(e.solution.stateChecks,e=>+!!se(e,n))),E=(e,n,r,i)=>oe(n,()=>{let n=e.solution.actionChecks;if(!m)return Uint8Array.from(n,e=>+!!t.C(e,r,i,ie.environment,/* @__PURE__ */ new Map));let a=ae(r),o=w.actions.get(r)??/* @__PURE__ */ new Map;w.actions.set(r,o);let s=o.get(i)??new Int8Array(d.size).fill(-1);return o.set(i,s),Uint8Array.from(e.actionIds,(e,o)=>(s[e]===-1&&(s[e]=+!!t.C(n[o],r,i,ie.environment,a)),s[e]))}),ce=(e,t,n,r)=>oe(n,()=>e.nodes[t].statePredicates.every(e=>se(e,r))),le=(e,t)=>{if(i.runtime.version===`1.7.4`)return!1;let n=e.nodes[t];return n.particle.length===0&&n.successors.length===1&&n.successors[0]===t},ue=e=>e.solution.models.some(e=>e.eventuallyAlways.length===0&&e.infinitelyOftenStates.length===0&&e.infinitelyOftenActions.length===0),de=(e,t,n)=>{if(!e.solution.tableau)return t;let r=e.nodeIds.slots,i=b(e.nodeIds,t,n);return r[i]===0?void 0:r[i+2]},fe=(e,t,n)=>{let r=C(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),b(i,e[t]-1,e[t+1]))}i.slots.set([t+1,n,r],b(i,t,n));let a=e.lastNodes.data[t]??-1;return a===-1?y(e.firstNodes,t,[r]):e.nextSiblings[a]=r,y(e.lastNodes,t,[r]),r},pe=(e,t,n,r,i)=>{let a=e.edgeTargets.length,o=e.solution.actionChecks.length;y(e.edgeTargets,a,n),r.forEach((t,n)=>y(e.edgeActions,(a+n)*o,t)),y(e.stateResults,e.nodeStates[t]*i.length,i),e.edgeStarts[t]=a,e.edgeCounts[t]=n.length},me=(e,t,n)=>{let r={slots:Array.from({length:16*p.multiplier}),count:0},i=(e,t)=>{for(let n=(a.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&&g(r.state,t.state))return!1}},o=e=>{if(r.count>=r.slots.length>>1){let e=r.slots;r.slots=Array.from({length:2*e.length+1});for(let t of e)t&&i(r.slots,t)}i(r.slots,e)&&r.count++};return n.forEach(o),o({index:e,state:t}),r.slots.length>16*p.multiplier&&p.multiplier++,r.slots.filter(e=>e!==void 0)},he=(e,t,n,r,i)=>{let o=T(e,r,n),s=t.nodes[e.nodeTableaux[i]],c=[],l=[],u=s.successors.length>0?E(e,r,n,n):/* @__PURE__ */ new Uint8Array;for(let a of s.successors){if(!ce(t,a,r,n))continue;if(le(t,a)&&e.errorNode===void 0&&ue(e)){e.errorNode=i;return}let o=de(e,r,a);if(o!==void 0&&l.includes(o))continue;let s=o??fe(e,r,a);l.push(s),c.push(u),o===void 0&&he(e,t,n,r,s)}for(let i of a.getSuccessors(r,n)){let a=E(e,r,n,i.state),o=e.isDone[i.index]===!0;for(let n of s.successors){if(!ce(t,n,r,i.state)||i.index===-1)continue;let s=de(e,i.index,n);if(s!==void 0&&l.includes(s))continue;let u=s??fe(e,i.index,n);l.push(u),c.push(a),s===void 0&&o&&he(e,t,i.state,i.index,u)}}l.length>0&&pe(e,i,l,c,o)},ge=(e,t,n,r,i,a)=>{let o=t.nodes.map((e,r)=>n.map(e=>ce(t,r,a,e.state)));e.isDone[a]=!0;for(let s of ne(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=de(e,n.index,u);if(s!==void 0&&a.includes(s))continue;let d=s??fe(e,n.index,u);a.push(d),c.push(r[i]),s===void 0&&l&&he(e,t,n.state,n.index,d)}}),pe(e,s,a,c,i)}if(e.errorNode!==void 0)return _(ve(e,e.errorNode).reverse().map(t=>e.nodeStates[t]))},_e=(e,t,n,r,i)=>{for(;e.nodeStates.length<=i;)C(e,e.nodeStates.length,-1);let a=[],o=[];t.forEach((t,r)=>{x(e,t.index)&&a.includes(t.index)||(a.push(t.index),o.push(n[r]))}),pe(e,i,a,o,r)},ve=(t,n)=>{if(t.initial.includes(n))return[n];let r=/* @__PURE__ */ new Map,i=[];for(let e of t.initial)x(t,e)&&(i.push(e),r.set(e,-1));for(let e=0;e<i.length;e++){let a=i[e];for(let e of te(t,a))if(!(e===a&&t.solution.tableau)){if(e===n){let e=[n];for(let t=a;t!==-1;t=r.get(t)??-1)e.push(t);return e}x(t,e)&&!r.has(e)&&(r.set(e,a),i.push(e))}}throw new e.g(`Couldn't re-create liveness trace (path) starting at: ${n}`)},D=(n,r)=>{let i=n.solution,a=i.actionChecks.length,o=(e,t,r)=>n.edgeActions.data[(n.edgeStarts[e]+t)*a+r]===1,s=(e,t)=>r.eventuallyAlways.every(n=>o(e,t,n)),c=new Float64Array(n.nodeStates.length).fill(-1),l=n.initial.filter(e=>x(n,e)),u=[],d=e=>{let t=te(n,e).indexOf(e);return t!==-1&&s(e,t)},f=(e,r)=>i.tableau!==void 0&&t.j(i.tableau.nodes[n.nodeTableaux[e]].particle,r),p=e=>{let t=u.pop()??e;if(t===e&&!d(t)){c[t]=re;return}let a=/* @__PURE__ */ new Set,l=/* @__PURE__ */ new Map;for(let r=t;;r=u.pop()??e){a.add(r);let t=l.get(n.nodeStates[r]);if(t?t.push(r):l.set(n.nodeStates[r],[r]),c[r]=re,r===e)break}let p=r.infinitelyOftenStates.every(e=>[...a].some(t=>S(n,t,e))),h=r.infinitelyOftenActions.every(e=>[...a].some(t=>te(n,t).some((n,r)=>a.has(n)&&s(t,r)&&o(t,r,e)))),g=i.promises.every(e=>[...a].some(t=>f(t,e)));if(p&&h&&g)return m(e,a,l)},m=(t,a,c)=>{let l=_(ve(n,t).reverse().map(e=>n.nodeStates[e])),u=[],d=/* @__PURE__ */ new Set([t]),p=r.infinitelyOftenStates.map(()=>!1),m=r.infinitelyOftenActions.map(()=>!1),v=i.promises.map(()=>!1),y={count:p.length+m.length+v.length},b={node:t},ee=e=>a.has(e),x=e=>{u.push(b.node),b.node=e};for(;y.count>0;){let t=y.count;for(;r.infinitelyOftenStates.forEach((e,t)=>{!p[t]&&S(n,b.node,e)&&(p[t]=!0,y.count--)}),i.promises.forEach((e,t)=>{!v[t]&&f(b.node,e)&&(v[t]=!0,y.count--)}),!(y.count<=0);){let i={last:-1,unvisited:-1},a=y.count;if(te(n,b.node).some((e,t)=>{if(c.has(n.nodeStates[e])){if(!ee(e)||!s(b.node,t))return!1;i.last=e,r.infinitelyOftenActions.forEach((e,n)=>{!m[n]&&o(b.node,t,e)&&(m[n]=!0,y.count--)})}return y.count<a?(x(e),d.clear(),!0):(ee(e)&&!d.has(e)&&(i.unvisited=e),!1)}))break;if(y.count<t){x(i.last),d.clear();break}for(;i.unvisited===-1;){let t=u.pop();if(t===void 0)throw new e.g(`TLC failed to build the counterexample of a liveness property`);b.node=t,i.unvisited=te(n,t).find(e=>ee(e)&&!d.has(e))??-1}x(i.unvisited),d.add(i.unvisited)}}let C=g(t,b.node,c,s);for(let e=u.length-1;e>=0;e--){let t=n.nodeStates[u[e]];C[C.length-1]!==t&&C.push(t)}let ne=l[l.length-1];return C[C.length-1]===ne&&C.pop(),{prefix:l.slice(0,-1),cycle:[ne,...C.reverse()],isCycleConstrained:h(i)}},g=(t,r,i,a)=>{if(r===t)return[];let o=n.nodeStates[r],s=/* @__PURE__ */ new Map,c=/* @__PURE__ */ new Set([o]),l=[];for(let r=o,u=-1,d=0;;d++){for(let e of i.get(r)??[])for(let[d,f]of te(n,e).entries()){if(f===e||!a(e,d))continue;if(f===t){let e=[];for(let t=r,n=u;t!==o;)e.push(t),t=n,n=s.get(t)??-1;return e.push(o),e}let p=n.nodeStates[f];i.has(p)&&!c.has(p)&&(c.add(p),l.push([p,r]))}s.set(r,u);let f=l[d];if(f===void 0)throw new e.g(`TLC failed to build the counterexample of a liveness property`);r=f[0],u=f[1]}};for(let e=0;e<l.length;e++){let t=[l[e],-1,0],r={link:0};for(;t.length>=3;){let e=t.pop()??0,i=t.pop(),a=t.pop()??0;if(i===-42){if(c[a]===e){let e=p(a);if(e)return e}t.push(Math.min(t.pop()??e,e));continue}if(c[a]!==-1){t.push(Math.min(e,c[a]));continue}c[a]=r.link,t.push(e,a,-42),u.push(a);let o={value:r.link++};te(n,a).forEach((e,r)=>{x(n,e)&&(s(a,r)?c[e]===-1?t.push(e,-1):o.value=Math.min(o.value,c[e]):c[e]===-1&&l.push(e))}),t.push(o.value)}}};return{branches:f.length,addInitialState:(e,t,n)=>{ie.environment=n??i,w.states.clear(),w.actions.clear();try{for(let n of f){let r=n.solution.tableau;if(!r)n.initial.push(e);else for(let i=0;i<r.initialCount;i++)ce(r,i,void 0,t)&&n.initial.push(de(n,e,i)??fe(n,e,i))}}finally{ie.environment=i}},addState:(e,t,n,r)=>{ie.environment=r??i,w.states.clear(),w.actions.clear();try{let r=me(e,t,n);for(let n of f){let i=r.map(r=>E(n,e,t,r.state)),a=T(n,e,t),o=n.solution.tableau;if(!o){_e(n,r,i,a,e);continue}let s=ge(n,o,r,i,a,e);if(s)return s}return}finally{ie.environment=i}},findViolation:()=>{for(let e of f)for(let t of e.solution.models){let n=D(e,t);if(n)return n}},getViolatedProperties:(e,r)=>[...new Set(n.filter((n,a)=>!t.w(s[a].body,e,r,0,i)).map(e=>e.name))]}},w=`UnnamedAction`,ae={module:`--TLA+ BUILTINS--`,start:{line:0,column:0},end:{line:0,column:0}},oe=e=>{let n=e.range??ae;return t.Ot([[`beginLine`,n.start.line],[`beginColumn`,n.start.column],[`endLine`,n.end.line],[`endColumn`,n.end.column],[`module`,n.module]])},se=e=>{let n=[[`name`,e.name],[`location`,oe(e.location)]];return e.parameters.length===0?t.Ot(n):t.Ot([...n,[`context`,t.Ot(e.parameters)],[`parameters`,t.At(e.parameters.map(e=>e[0]))]])},T=(e,t)=>({name:e,location:t.location,parameters:[],expression:t,scope:void 0}),E=(e,t)=>({environment:e,scope:t,state:void 0,next:void 0}),ce=e=>e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:void 0,le=e=>e.kind===`Apply`?e.args:[],ue=(e,n,r)=>{let i=ce(e);if(i===void 0)return;if(t.Wt(e)){let e=t.it(n,i);return e?.kind===`Operator`&&e.operator.kind===`Closure`?e.operator:void 0}if(r.constants.has(i)||r.variableIndex.has(i))return;let a=t.at(i,r);return a?.kind===`Closure`?a:void 0},de=(n,r)=>{try{return t.Z(n,E(r,void 0)),!0}catch(t){if(t instanceof e.h)return!1;throw t}},fe=(e,n)=>e?.kind===`Operator`&&e.params.length===0&&e.body.kind!==`Number`&&e.body.kind!==`String`&&t.nt(e,n)&&de(e.body,n),pe=(e,n)=>{let r=t.et(e.name,n);return r?.body===e.body&&fe(r,n)},me=(e,n)=>{if(e.kind!==`Identifier`||!t.Wt(e))return;let r=t.it(n,e.name);return r?.kind===`Thunk`?r:void 0},he=(e,n)=>(e?.params??[]).flatMap(e=>{let r=t.it(n,e.name);return r?.kind===`Value`?[[e.name,r.value]]:[]}),ge=(t,n)=>{try{return t()}catch(t){if(t instanceof e.h)return n();throw t}},_e=(e,n,r,i,a)=>{let o=le(n),s=()=>[{name:e.name,location:n.location,parameters:[],expression:n,scope:r}];return!i||o.length===0?[{...e,parameters:[],expression:n,scope:r}]:o.some(e=>t.T(e,r,a)!==0)?s():ge(()=>[{...e,parameters:o.map((e,n)=>[i.params[n].name.replace(/#\d+$/,``),t.Z(e,E(a,r))]),expression:n,scope:r}],s)},ve=(e,n,r,i,a)=>{let o=()=>({name:r?.name??w,location:e.location,parameters:he(r,n),expression:e,scope:n});switch(e.kind){case`Let`:return ve(e.body,t.q(e.definitions,E(i,n)),r,i,a);case`Label`:return ve(e.body,n,r,i,a);case`Or`:return e.operands.flatMap(e=>ve(e,n,r,i,a));case`Exists`:return ge(()=>{let s=[];return t.Q(e.bounds,E(i,n),t=>(s.push(...ve(e.body,t,r,i,a)),!1)),s.length===0?[o()]:s},()=>[o()])}let s=t.Wt(e)?void 0:a.get(ce(e)??``),c=ue(e,n,i);if(s)return _e(s,e,n,c,i);if(!c)return[o()];let l=le(e),u=t.Wt(e)?c.name:i.instanceNames.get(ce(e)??``)??c.name,d=()=>[{name:u,location:e.location,parameters:[],expression:e,scope:n}];return pe(c,i)||l.some(e=>t.T(e,n,i)!==0)?d():ge(()=>{let e=l.reduce((e,r,a)=>({name:c.params[a].name,binding:{kind:`Value`,value:t.Z(r,E(i,n))},parent:e}),c.scope);return ve(c.body,e,{...c,name:u},i,a)},d)},D=(e,n,r,i,a)=>{let o=(e,t)=>D(e,t,r,i,a);if(e.kind===`Let`){o(e.body,t.q(e.definitions,E(r,n)));return}let s=me(e,n);if(s){o(s.expression,s.scope);return}let c=ue(e,n,r);if(c&&pe(c,r))return;if(c&&c.params.length===0){if(t.T(c.body,c.scope,r)===1){i.inits.push(T(c.name,c.body));return}o(c.body,c.scope);return}if(c&&e.kind===`Apply`&&c.params.length===e.args.length){o(c.body,t.J(c,e.args,E(r,n)));return}if(e.kind===`And`){e.operands.forEach(e=>o(e,n));return}if(e.kind===`Always`){if(e.expression.kind===`BoxAction`){a.push({expression:e.expression.action,scope:n});return}i.temporals.push(T(w,e));return}let l=t.T(e,n,r);l<=1?i.inits.push(T(w,e)):l===3&&i.temporals.push(T(w,e))},ye=(e,n,r,i,a)=>{let o=(t,n)=>ye(e,t,n,i,a);if(n.kind===`Let`){o(n.body,t.q(n.definitions,E(i,r)));return}let s=me(n,r);if(s){o(s.expression,s.scope);return}let c=ue(n,r,i);if(c&&pe(c,i))return;if(c&&c.params.length===le(n).length){o(c.body,n.kind===`Apply`?t.J(c,n.args,E(i,r)):c.scope);return}if(n.kind===`Forall`&&ge(()=>(t.Q(n.bounds,E(i,r),e=>(o(n.body,e),!1)),!0),()=>!1))return;if(n.kind===`And`){n.operands.forEach(e=>o(e,r));return}if(n.kind===`Always`){let o=n.expression;o.kind===`BoxAction`?a.impliedActions.push(T(e,o)):t.T(o,r,i)<2?a.invariants.push(T(e,o)):a.impliedTemporals.push(T(e,n));return}let l=t.T(n,r,i);l<=1?a.impliedInits.push(T(e,n)):l===3&&a.impliedTemporals.push(T(e,n))},O=(e,n)=>{let r=t.et(e,n);return r?.kind===`Operator`&&!fe(r,n)?r:void 0},be=(e,n,r)=>{let i={inits:[],actions:[],temporals:[],invariants:[],impliedInits:[],impliedActions:[],impliedTemporals:[]},a=[],o=e.specification===void 0?void 0:O(e.specification,n);o&&(D(o.body,void 0,n,i,a),a.forEach(e=>i.actions.push(...ve(e.expression,e.scope,void 0,n,r))));let s=e.init===void 0?void 0:t.at(e.init,n);s?.kind===`Closure`&&i.inits.push(T(e.init??``,s.body));let c=e.next===void 0?void 0:t.at(e.next,n);return c?.kind===`Closure`&&i.actions.push(...ve(c.body,c.scope,c,n,r)),e.invariants.forEach(e=>{let t=O(e,n);t&&i.invariants.push(T(e,t.body))}),e.properties.forEach(e=>{let t=O(e,n);t&&ye(e,t.body,void 0,n,i)}),i},xe=(e,t,n)=>be(e,t,n).inits,Se=(e,t,n)=>be(e,t,n).actions,Ce=e=>e.parameters.length===0?``:`(${e.parameters.map(e=>t.Mt(e[1])).join(`,`)})`,we=(t,n)=>`${t.name===w?`Action`:t.name}${n===`1.7.4`?``:Ce(t)} ${e.R(t.location.range??ae)}`,Te=e=>`${e.name}${Ce(e)}`,Ee=(e,n,r,i)=>{let a=be(e,n,i),o=e=>t.kt(e.map(se)),s=e=>t.kt(e.flatMap(e=>{let r=O(e,n);return r?[t.Ot([[`name`,r.name],[`location`,oe(r.location)]])]:[]}));return t.Ot([[`inits`,o(a.inits)],[`actions`,o(a.actions)],[`temporals`,o(a.temporals)],[`invariants`,o(a.invariants)],[`impliedinits`,o(a.impliedInits)],[`impliedactions`,o(a.impliedActions)],[`impliedtemporals`,o(a.impliedTemporals)],[`variables`,t.kt(n.variables.map((e,n)=>t.Ot([[`name`,e],[`location`,oe(r[n])]])))],[`actionconstraints`,s(e.actionConstraints)],[`constraints`,s(e.constraints)]])},De=`paired12`,Oe=(e,t=16)=>e<=t*.75?t:Oe(e,t*2),ke=(e,t)=>{let n=Oe(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)},Ae=e=>Number(BigInt.asIntN(32,e^BigInt.asUintN(64,e)>>32n)),je=e=>[...Array(e.length).keys()].reduce((t,n)=>Math.imul(31,t)+e.charCodeAt(n)|0,0),Me=e=>e.replaceAll(`\\`,`\\\\`).replaceAll(`"`,`\\"`).trim(),Ne=e=>Me(e).replaceAll(`
12
+ `,`\\n`),Pe=(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(``))}},Fe=(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="${De}"]\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="${De}",style=filled,shape=record ]\n`,...ke([...o.keys()],je).map(e=>`${e.replaceAll(`!`,`:`)} [label="${e}",fillcolor=${o.get(e)}]\n`),`}`].join(``),u=()=>[...ke([...a],e=>e[0]).map(e=>`{rank = same; ${ke([...e[1]],Ae).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="${Ne(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?Me(r?o.name:o.signature):``;if(i.push(`${t.fingerprint} -> ${n.fingerprint} [label="${u}",color="${l}",fontcolor="${l}"];\n`),!a){let e=r?``:`,tooltip="${Ne(n.getText())}"`;i.push(`${n.fingerprint} [label="${Ne(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())}},Ie=(e,t,n)=>e.dot?Fe(e,t,n):Pe(e,t),Le=(e,t)=>({...e,traceOutput:[...e.traceOutput??[],...t]}),Re=`Failed to recover the initial state from its fingerprint.`,ze=`Failed to recover the next state from its fingerprint.`,Be=(e,n)=>{if(!t.Lt(e))return;let r=t.Ht(e);if(!r.domain.every(e=>typeof e==`string`))return;let i=r.domain.map((e,t)=>[String(e),r.range[t]]);return Object.fromEntries(i.sort((e,t)=>n.indexOf(e[0])-n.indexOf(t[0])))},Ve=/* @__PURE__ */ Error(`The replay stopped`),He=/* @__PURE__ */ new Set([...Array.from({length:24},(e,t)=>2222+t),2272,2273,2274,2280,2281]),Ue=n=>{let r=t.yt(n.message);return r&&!r.isEvalException&&He.has(r.code)?e.U.configParseError:e.B(n)},We=t=>{let n=t.cause;return n instanceof e.g?We(n):t instanceof e.S?t.exitCode:e.U.specEvaluationFailure},Ge=t=>{let n=t.dump&&Ie(t.dump,t.writeFile,t.version);try{return Ke(t,n)}catch(t){throw e.H(t)?e.L():t}finally{n?.close()}},Ke=(n,r)=>{let i=typeof n.config==`string`?p(n.config,n.version):n.config,a=n.onPrint??console.log,o={lines:void 0},s=e=>{o.lines?o.lines.push(e):a(e)},c=e=>{let t=o.lines,n=[];o.lines=n;try{return{result:e(),lines:n}}finally{o.lines=t}};t.Bt(t.N(n.source,i,n.loadModule)),t.Vt(n.version);let l=t.M(i,{source:n.source,loadModule:n.loadModule,loadClass:n.loadClass,print:s,files:{readFile:n.readFile,writeFile:n.writeFile},seed:n.seed,isTool:n.isTool,isTraceRecorded:n.isTraceRecorded,isSanyReported:n.isSanyReported,isWarningEnabled:n.isWarningEnabled,version:n.version});t.b(l,i,n.onProgress);let u=l.environment,d=u.runtime,f=d.version===`1.7.4`;d.pause=n.onPause??(()=>{}),d.getSpecification=()=>Ee(i,u,l.variableLocations,l.instanceActions);let m={depth:0,initialStates:void 0},h=(e,t,n)=>({status:e,violation:t&&{...t,loopStart:t.loopStart},failure:n,generatedStates:d.generatedStates,distinctStates:d.distinctStates,queuedStates:d.queueSize,depth:d.generatedStates===0?0:Math.max(m.depth,1),initialStates:m.initialStates,outDegrees:void 0,fingerprintDistance:void 0}),g=Array.from({length:32},()=>0),_={newStates:0},v=()=>Math.min(_.newStates,31),y=()=>g.map((e,t)=>t===v()?e+1:e),b=()=>f?[...g]:y(),ee=(e,t,n)=>f?[]:e.getViolatedProperties(t,n),x=(e,t=[...g])=>({...e,violationOutDegrees:t}),te=()=>({...h(`success`),outDegrees:[...g],fingerprintDistance:t.d(d.distinctStates,d.generatedStates,()=>S?S.getStoredFingerprints(O,be):BigInt64Array.from(O,d.getFingerprint))}),S=t.h(i,u,()=>t.P(n.source,n.loadModule),n.onProgress),C=()=>t.g(l.assumptions,u);if(!S){d.isStarted=!0;let e=C();return e?h(`assumption-violation`,e):(m.initialStates={generated:0,distinct:0},n.onProgress?.({kind:`initial-states-started`}),n.onProgress?.({kind:`initial-states-computed`,initialStates:m.initialStates}),te())}let ne=i.postconditions.length>0||i.possible.length>0,re=/* @__PURE__ */ new WeakMap,w=e=>re.get(e)?.state??e.state,ae=e=>{let n=re.get(e)?.action;return n?se(n):t.F(e.action)},oe=(e,n)=>{ne&&(d.counterExample=t.I(e.map(w),e.slice(1).map(ae),n));let r=S.findUnwitnessedPossible(),i=r?{result:void 0,lines:[]}:c(()=>S.findPostconditionViolation(!0));return{unwitnessed:r,postcondition:i.result,lines:i.lines}},T=(e,t,n)=>{let r=t.loopStart,i=oe(t.trace,r===void 0||!n?void 0:{start:r,action:n()}),a=[...t.traceOutput??[],...i.lines];return h(e,{...t,...a.length>0&&{traceOutput:a},...i.unwitnessed&&{unwitnessed:i.unwitnessed},...i.postcondition&&{postcondition:i.postcondition}})},E=S.spec,ce=S.getFingerprintState,le={value:void 0},ue=()=>le.value??=Se(i,u,l.instanceActions),de=n=>{let r=t.Y(u),i=r.callStack;try{n(r);return}catch(t){return e.H(t)?{callStack:[],fingerprint:void 0}:!(t instanceof e.g)||!i?void 0:{callStack:i.expressions,fingerprint:i.fingerprint}}},fe=(e,n)=>{if(typeof e!=`object`)return[];let r=n.get(e),i=t.Pt(e).find(e=>t.Nt(e)!==void 0);return[...r?[r]:[],...i===void 0?[]:fe(i,n)]},pe=(e,n)=>{for(let r of ce(e)){let e=t.Nt(r);if(!e)continue;let i=n?fe(r,n.sources):[];throw n&&i.length>0&&(n.expressions.length=0,n.isFrozen=!0,n.fingerprint={sources:i,reason:e.message}),e}e.forEach(t.zt)},me=()=>{let e=rt.fingerprint?[rt.fingerprint]:[];return(t,n)=>{pe(t,n);let r=ce(t);return M($e(r),r)!==-1||e.some(e=>j(e,r))?!1:(e.push(r),d.distinctStates++,!0)}},he=()=>{let n={count:0},r=[],a=me();return de(s=>{if(t.ut(xe(i,u,l.instanceActions),s,i=>{if(t.y(n.count,e=>o.lines?.push(e)),n.count++,d.generatedStates=n.count,!(r.length>0))try{let e=S.checkReplayedInitialState(i,s,()=>{a(i,s.callStack)&&(d.queueSize++,D?.addInitialState(O.length,i,s))});if(e){let t=Fe([{action:void 0,state:i}],[]).trace[0].state;throw o.lines?.push({kind:`initial-state-violation`,...e,state:t}),Ve}}catch(t){if(!(t instanceof e.g)||!s.callStack?.fingerprint)throw t;r.push(t)}}),r.length>0)throw r[0]})},ge=e=>de(n=>{let i=O[e],a=r&&st(i,Oe[e]),o=me();t.dt(ue(),i,n,(t,s)=>{if(!S.checkReplayedSuccessor(i,t,n,()=>{let i=o(t,n.callStack);return a&&r?.writeSuccessor(a,st(t,Oe[e]+1),!i,pt?{name:s.name,signature:Te(s)}:void 0),i}))throw Ve})}),_e=i.view!==void 0||i.symmetry!==void 0,ve=[];S.properties.liveness.length>0&&n.onProgress?.({kind:`liveness-initializing`,isSymmetric:S.isSymmetric,isConstrained:S.isConstrained});let D=e.K(()=>t.wt(()=>ie(S.properties.liveness,E.temporals,u,{getFingerprint:({index:e,state:t})=>ve[e]??=Number(BigInt.asIntN(32,d.getFingerprint(t))),getSuccessors:(e,n)=>{let r=[];if(E.next===void 0)return r;let i=P.livenessSource;return P.livenessSource=e,t.st(E.next,n,u,e=>{if(Ae(e.state),!(S.satisfiesConstraints(e.state,n)&&S.satisfiesActionConstraints(n,e.state)))return!1;let t=ce(e.state),i=M($e(t),t);return r.push({index:i,state:e.state}),!1},E.scope),P.livenessSource=i,r}})));d.isStarted=!0;let ye=S.isSymmetric||D!==void 0,O=[],be=[],Ce=[],De=[],Oe=[],ke={slots:new Int32Array(1<<17),size:0,shift:16},Ae=t.Et(),je=e=>Object.fromEntries(S.getTlcOrder().map(t=>[u.variables[t],e[t]])),Me=(e,t,n,r)=>(d.getLevel=()=>n+1,d.getBehavior=()=>t.slice(0,n+1).map(e=>e.state),Ne(e,t[n].state,(t[n+1]??t[r??n]).state)),Ne=(r,i,a)=>{try{let e=t._(`alias`,r,u).body,n=t.Z(t.m(r),t.v(u,i,a)),o=e.kind===`Record`?e.fields.map(e=>e.name):[];return Be(n,o)??je(i)}catch(r){if(!(r instanceof e.m||r instanceof e.g))throw r;return{...je(i),_ALIASEvalError:t.gt(r.message,n.isTool??!1)}}},Pe=(e,n,r,i)=>{let a=ue(),o={...P};Object.assign(P,{index:e,isExpanding:!0,candidate:void 0});let s=i?e=>e:ce,c=s(r),l=a.find(e=>t.lt(e.expression,n,u,e.scope).some(e=>j(s(e.state),c)));return Object.assign(P,o),l},Fe=(e,t,r={})=>{let a=i.alias,o=r.known??1,s=e.length>1?c(Ie).lines:[],l=e.map((n,r)=>r===0||n.action===`Stuttering`?{result:void 0,lines:[]}:c(()=>Pe(t[r-1],e[r-1].state,n.state,o===2&&r===e.length-1))),u=l.map(e=>e.lines),d=r.loopStart,p=f&&d!==void 0?d+1:e.length-o,m=p>0?[s,...u.slice(1,p)].flat():[];return{trace:e.map((t,r)=>{let i=l[r].result,o={action:t.action,label:i&&we(i,n.version),state:a===void 0?je(t.state):Me(a,e,r,d),output:r===0?m:r<p?[]:u[r]};return(a!==void 0||i)&&re.set(o,{state:je(t.state),action:i}),o}),traceOutput:o>0&&!f?[s,...u].flat():[]}},Ie=()=>E.init===void 0?[]:t.ct(E.init,u,E.scope),He=(e,n)=>c(()=>{for(let r of ue()){let i=t.lt(r.expression,e,u,r.scope).find(n);if(i)return{...i,action:i.action??r.name}}}).result,Ge=(e,t)=>j(ce(e),be[t]),Ke=(e,t)=>He(e,e=>Ge(e.state,t)),qe=(n,r)=>{let i=c(()=>_e||t.rt(u)?Ie().find(e=>Ge(e,n[0])):O[n[0]]).result;if(!i)throw new e.g(Re);let a=[{state:i,action:void 0}];for(let t=1;t<n.length;t++){let i=a[t-1].state;if(n[t-1]===n[t]){a.push({state:i,action:`Stuttering`});continue}let o=Ke(i,n[t]);if(!o)throw new e.g(r);a.push(o)}return a},Je=(e,t)=>{let n=[];for(let t=e;t!==-1;t=Ce[t])n.unshift(t);let r=_e&&n.length>1?qe(n,Re):n.map(e=>({state:O[e],action:De[e]}));if(!t)return Fe(r,n);let i=_e?He(O[e],e=>j(e.state,t.state))?.action:t.action;return Fe([...r,{state:t.state,action:i}],n,{known:2})},Ye=e=>Ce[e]===-1?{trace:[{action:void 0,label:void 0,state:je(O[e])}],traceOutput:f?[]:c(Ie).lines}:Je(e),Xe=(e,t)=>({trace:Je(e,t).trace}),Ze=(t,n)=>n.isInitial&&!n.callStack&&!n.fingerprint&&f?e.U.success:n.callStack?n.isCallStackFirst?e.B(t):n.isLiveCallStack?e.W(t)??(t instanceof e.S?t.exitCode:e.U.error):n.isInitial||n.fingerprint?e.U.specEvaluationFailure:We(t):n.isInitial?Ue(t):e.B(t),k=(n,r,i={})=>{let a=e.H(n)?new e.E:n;if(!(a instanceof e.g))throw a;let o=r.trace.length>0&&!i.traceFailure?oe(r.trace,void 0):void 0,s=o?.unwitnessed??o?.postcondition,c=[...r.traceOutput??[],...o?.lines??[]];return{...h(`error`,void 0,{...t.bt(a,i.isNextState??!1),...r,...c.length>0&&{traceOutput:c},...s&&{postcondition:s},initialState:i.initialState&&!(a instanceof e.S)?je(i.initialState):void 0,exitCode:Ze(a,i),callStack:i.callStack,...i.isCallStackFirst&&{isCallStackFirst:!0},...i.fingerprint&&{fingerprint:i.fingerprint},...i.traceFailure&&{traceFailure:i.traceFailure}}),outDegrees:i.outDegrees}},Qe=(r,i)=>{d.generatedStates++;let a=ue(),o=a.length===1?a[0]:a.find(e=>e.name===i.action),s=i.variables,c=a.length===1?`the next-state action`:`action ${i.action} of the next-state relation`,l=f?`assigned`:`defined`,u=`Successor state is not completely specified by ${c}. The following variable${s.length>1?`s are`:` is`} not ${l}: ${s.join(`, `)}.\n`,p=t.Dt(`null`),m=i.state.map(e=>e??p),h=k(i,Ye(r));return x({...h,failure:h.failure&&{...h.failure,code:t.ft.incompleteSuccessor,message:u,toolMessage:u,exitCode:e.U.specEvaluationFailure,trace:[...h.failure.trace,{action:i.action,label:o&&we(o,n.version),state:je(m)}]}})},A=(t,n)=>{let r=qe(t,ze),i=r[r.length-1].state;if(_e&&n!==void 0&&n!==t.length-1&&Ke(i,t[n])===void 0)throw new e.g(ze);return r},$e=e=>{let n=2166136261;for(let r=0;r<e.length;r++)n=t.Tt(n,t.It(e[r]));return n&1073741823},et=e=>{for(let n of e){let e=t.Nt(n);if(e)throw e}},j=(e,n)=>{for(let r=0;r<n.length;r++)if(!t.Rt(e[r],n[r]))return!1;return!0},tt=e=>Math.imul(e,2654435761)>>>ke.shift<<1,M=(e,t)=>{let n=ke.slots.length-1;for(let r=tt(e);;r=r+2&n){let n=ke.slots[r+1];if(n===0)return-1;if(ke.slots[r]===e&&j(be[n-1],t))return n-1}},N=(e,t)=>{let n=ke.slots.length-1,r=tt(e);for(;ke.slots[r+1]!==0;)r=r+2&n;ke.slots[r]=e,ke.slots[r+1]=t},nt=(e,t)=>{if(ke.size++,ke.size*4>ke.slots.length){let e=ke.slots;ke.slots=new Int32Array(e.length*2),ke.shift--;for(let t=0;t<e.length;t+=2)e[t+1]!==0&&N(e[t],e[t+1])}N(e,t+1)},rt={fingerprint:void 0},it=e=>{d.distinctStates=O.length+1,m.depth=Math.max(m.depth,e),d.diameter=Math.max(d.diameter,e)},at=(e,t,n,r)=>{let i=n===-1?1:Oe[n]+1;O.push(e),be.push(t),Ce.push(n),De.push(r),Oe.push(i)},P={index:-1,isExpanding:!1,candidate:void 0,candidateLevel:0,livenessSource:-1},ot=e=>e===-1?[]:[...ot(Ce[e]),O[e]];d.isSeen=e=>{let t=ce(e);return M($e(t),t)!==-1},d.getBehavior=e=>{let t=e===P.candidate?-1:O.indexOf(e);return t===-1?[...ot(P.index),e]:ot(t)},d.getCurrentState=()=>P.index===-1?void 0:O[P.index],d.setLivenessSource=e=>{P.livenessSource=e??-1},d.getLevel=e=>{let t=P.livenessSource;if(f){let e=t===-1?P.isExpanding?P.index:-1:t;return e===-1?0:Oe[e]}return t===-1?e===P.candidate?P.candidateLevel:P.index===-1?0:e===O[P.index]?Oe[P.index]:P.isExpanding?Oe[P.index]+1:0:e===O[t]?Oe[t]:Oe[t]+1};let st=(e,n)=>({fingerprint:BigInt.asIntN(64,d.getFingerprint(e)),level:n,getLabel:()=>t.jt(i.alias===void 0?je(e):Ne(i.alias,e,void 0)),getText:()=>t.jt(je(e))}),ct=e=>{Ae(e),d.generatedStates++,d.initialStates++,P.candidate=e,P.candidateLevel=1;let n=ce(e),i=$e(n),a=S.satisfiesConstraints(e);if(a&&(S.trackStatePossible(e),et(n),e.forEach(t.zt)),a&&M(i,n)!==-1)return;rt.fingerprint=a?n:void 0,a&&(it(1),d.queueSize++,D?.addInitialState(O.length,e),r?.writeInitialState(st(e,1)));let o=S.findViolatedInvariant(e);if(o)return T(`invariant-violation`,{name:o.name,...Fe([{action:void 0,state:e}],[])});let s=S.findFailedInitialPredicate(e);if(s)return T(`liveness-violation`,{name:s.name,...Fe([{action:void 0,state:e}],[])});a&&(nt(i,O.length),at(e,n,-1,void 0))},lt=(n,i,a,o,s)=>{let l=O[n];d.generatedStates++,P.candidate=i.state,P.candidateLevel=Oe[n]+1,ye&&Ae(i.state);let u=ce(i.state),f=$e(u),p=M(f,u),m=S.satisfiesConstraints(i.state,l);m&&S.trackStatePossible(i.state);let h=m&&S.satisfiesActionConstraints(l,i.state);h&&(S.trackActionPossible(l,i.state),et(u),i.state.forEach(t.zt));let g=h?p:-1;if(o&&h&&r?.writeSuccessor(o,st(i.state,Oe[n]+1),g!==-1,s&&{name:s.name,signature:Te(s)}),g!==-1&&D){let e=O[g],t=e.every((e,t)=>e===i.state[t]);a.push({index:g,state:t?e:i.state})}let v=h&&g===-1;if(v&&D&&a.push({index:O.length,state:i.state}),rt.fingerprint=v?u:void 0,v&&(it(Oe[n]+1),_.newStates++),g===-1)try{let e=S.findViolatedInvariant(i.state,l);if(e)return x(T(`invariant-violation`,{name:e.name,...Je(n,i)}))}catch(t){if(e.H(t))throw t;let r=c(()=>ge(n));return k(t,Le(Xe(n,i),r.lines),r.result??{outDegrees:b()})}let y=S.findViolatedActionProperty(l,i.state);if(y)return x(T(`liveness-violation`,{name:y.name,...Je(n,i)}));v&&(ye||Ae(i.state),nt(f,O.length),at(i.state,u,n,i.action),d.queueSize++)},ut={result:void 0};D&&n.onProgress?.({kind:`liveness-prepared`,branches:D.branches});let dt=C();if(dt)return h(`assumption-violation`,dt);if(n.onProgress?.({kind:`initial-states-started`}),E.init!==void 0)try{t.ot(E.init,u,e=>{t.y(d.initialStates,n.onProgress);try{ut.result=ct(e)}catch(t){let n=c(he);ut.result=k(t,{trace:[],traceOutput:n.lines},{initialState:e,...n.result,isInitial:!0})}return ut.result!==void 0},E.scope)}catch(n){if(n instanceof e._){let e=k(n,{trace:[]},{initialState:n.state.map(e=>e??t.Dt(`null`))});return{...e,failure:e.failure&&{...e.failure,isWithoutStatistics:!0}}}let r=c(he);return k(n,{trace:[],traceOutput:r.lines},{...r.result,isInitial:!0})}if(ut.result)return ut.result;m.initialStates={generated:d.initialStates,distinct:d.distinctStates},n.onProgress?.({kind:`initial-states-computed`,initialStates:m.initialStates});let ft=E.next;if(ft===void 0){if(O.length>0)throw new e.g(`No next state actions defined to generate successor states from.`);return te()}let pt=!!(n.dump?.dot&&(n.dump.actionLabels||n.dump.colorize)),mt=(e,n)=>{if(!pt)return t.st(ft,e,u,e=>n(e,void 0),E.scope);let r={isStopped:!1};return ue().reduce((i,a)=>r.isStopped?i:i+t.st(a.expression,e,u,e=>(r.isStopped=n(e,a),r.isStopped),a.scope),0)},ht=(e,t)=>{if(!D||f)return;let n=de(n=>D.addState(e,O[e],t,n));return n?.callStack.length&&!n.fingerprint?n.callStack:void 0},gt=(t,n)=>{try{D?.addState(t,O[t],n);return}catch(r){if(!(r instanceof e.g))throw r;return ht(t,n)}},_t=(e,t)=>{let n=c(()=>gt(e,t));if(n.result)return{result:{callStack:n.result,fingerprint:void 0,isLiveCallStack:!0},lines:n.lines};let r=c(()=>ge(e));return{result:r.result,lines:[...n.lines,...r.lines]}},F=t=>k(e.L(),Ye(t)),vt=(n,r,i)=>{if(e.H(n))return F(r);let a=_t(r,i);return k(t.x(n),Le(Ye(r),a.lines),{isNextState:!0,...a.result})},yt=(n,a)=>{let o=O[n],s=r&&st(o,Oe[n]),l=mt(o,(r,i)=>{try{ut.result=lt(n,r,a,s,i)}catch(i){if(e.H(i))return ut.result=F(n),!0;let o=f?c(()=>ge(n)):_t(n,a);if(f&&i instanceof e.g&&!t.Ct(i))return ut.result=k(new e.g(`${t.xt(i)}${i.message}`,i),Le({trace:[]},o.lines),{isNextState:!0,...o.result}),!0;let s=ce(r.state).some(e=>t.Nt(e)!==void 0)&&i instanceof e.g?t.bt(t.St(i)?new e.g(`${e.M}${i.message}`):i,!0):void 0;ut.result=k(i,Le(s?Ye(n):Xe(n,r),o.lines),{isNextState:!0,...o.result,traceFailure:s})}return ut.result!==void 0});P.isExpanding=!1;let u=ut.result;if(u?.violation&&!f){let e=c(()=>gt(n,a));return{...u,violation:Le(u.violation,e.lines),...e.result&&{liveCallStack:e.result}}}if(u)return u;let d=()=>{D&&s&&f&&r?.writeStuttering(s);let e=D?.addState(n,o,a);if(!D||!e)return;let t=A(e),i=ee(D,t.map(e=>e.state),t.length-1);return T(`property-violation`,{name:i[0],properties:i,...Fe(t,e,{known:0})})};if(l===0&&i.checkDeadlock){let t=T(`deadlock`,{name:`deadlock`,...Ye(n)}),r=c(()=>{try{return{additional:d()?.violation}}catch(t){if(!(t instanceof e.g))throw t;return{isFailed:!0,callStack:ht(n,a)}}}),i=t.violation?{...t,violation:Le(t.violation,r.lines)}:t,o=x(i,r.result.isFailed?b():y());return r.result.additional?{...o,additionalViolation:r.result.additional}:r.result.callStack?{...o,liveCallStack:r.result.callStack}:o}try{return d()}catch(r){if(f&&r instanceof e.g){let n=new e.g(`${t.St(r)?e.M:e.N}${r.message}`);return k(e.G(n,e.U.error),{trace:[]},{outDegrees:b()})}let i=de(e=>D?.addState(n,o,a,e));return k(r,Ye(n),{outDegrees:b(),callStack:i?.callStack.length?i.callStack:void 0,isNextState:!0,isCallStackFirst:!0})}},I=()=>{let e=i.specification,n=`(compare Chapter 8, page 87ff of Specifying Systems at https://lamport.azurewebsites.net/tla/book.html).`;if(e===void 0)return{code:t.ft.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 ${n}`};let r=t.et(e,u)?.location.range;if(!(E.temporals.length>0||!r))return{code:t.ft.noFairnessButProperty,text:`The stuttering counterexample above may be caused by the absence of a fairness constraint in the behavior specification ${e} defined at ${t.$(r)}. To rule out such counterexamples, conjoin a suitable fairness constraint to ${e} ${n}`}},bt=(e,r)=>{let i=[...r.prefix,...r.cycle],a=r.prefix.length,o=A(i,a),s=Fe(o,i,{loopStart:a,known:0}).trace,l=ee(e,o.map(e=>e.state),a),u=i[a],d=i[i.length-1],f=o[o.length-1].state,p=u===d?{result:void 0,lines:[]}:c(()=>Pe(d,f,O[u],!1)),m=u===d&&r.isCycleConstrained;return T(`liveness-violation`,{name:l[0],properties:l,trace:s,traceOutput:p.lines,loopStart:a,loopLabel:p.result&&we(p.result,n.version),warning:m?I():void 0},()=>u===d?ae(s[s.length-1]):p.result?se(p.result):t.F(Ke(f,u)?.action))},xt=D!==void 0&&n.livenessCheck!==`final`,St=performance.now(),Ct={at:St+3e3,size:1,time:0},wt=e=>{let t=performance.now();if(!((e-Ct.size)/Ct.size>.1)||Ct.time>(t-St)*.2||(Ct.size=e,!D))return;n.onProgress?.({kind:`liveness-started`,branches:D.branches,isComplete:!1,states:e,statistics:h(`success`)});let r=D.findViolation();return r||n.onProgress?.({kind:`liveness-finished`}),Ct.time+=performance.now()-t,r};for(let t=0;t<O.length&&!d.isStopped;t++){P.index=t,P.candidate=void 0,d.queueSize=O.length-t-1,P.isExpanding=!0;let r=[];try{ut.result=yt(t,r)}catch(n){ut.result=n instanceof e.v?Qe(t,n):vt(n,t,r)}if(ut.result)return ut.result;if(g[v()]++,_.newStates=0,(xt||n.onProgress)&&performance.now()>=Ct.at){Ct.at=performance.now()+6e4;let e=xt?wt(t+1):void 0;if(D&&e)return bt(D,e);n.onProgress?.({kind:`progress`,statistics:h(`success`)})}}P.index=-1,P.candidate=void 0,D&&n.onProgress?.({kind:`liveness-started`,branches:D.branches,isComplete:!0,states:d.distinctStates,statistics:h(`success`)});let Tt=D?.findViolation();if(D&&Tt)return bt(D,Tt);D&&n.onProgress?.({kind:`liveness-finished`});try{let e=S.findPostconditionViolation();if(e)return h(`postcondition-violation`,{name:e.name,message:e.message,counts:e.counts,trace:[],postcondition:e})}catch(e){return k(e,{trace:[]})}return te()},qe=async n=>{let r=typeof n.config==`string`?p(n.config,n.version):n.config,i=n.onPrint??console.log,a={count:0},o=e=>[e.kind,`name`in e?e.name:``,`count`in e?e.count:``,`text`in e?e.text:``].join(` `),s=/* @__PURE__ */ new Set,c=e=>{s.add(o(e)),n.onProgress?.(e)},l=()=>{let e={count:a.count};return Ge({...n,config:r,onPrint:t=>e.count-->0?void 0:i(t),onProgress:e=>{s.has(o(e))||n.onProgress?.(e)}})},u=n.workers??1;if(u<2||typeof SharedArrayBuffer!=`function`||n.dump!==void 0||r.view!==void 0||r.postconditions.length>0||r.possible.length>0)return l();let d=/* @__PURE__ */ new Map,f=e=>{let t=n.loadModule?.(e);return d.set(e,t),t},m=/* @__PURE__ */ new Map,h=e=>{let t=n.loadClass?.(e);return m.set(e,t),t};t.Bt(t.N(n.source,r,f)),t.Vt(n.version);let g=t.Ft(),_=t.M(r,{source:n.source,loadModule:f,loadClass:h,print:e=>{a.count++,i(e)},files:{readFile:n.readFile,writeFile:n.writeFile},isTool:n.isTool,isTraceRecorded:n.isTraceRecorded,isSanyReported:n.isSanyReported,isWarningEnabled:n.isWarningEnabled,version:n.version});t.b(_,r,c);let v=_.environment,y=t.h(r,v,()=>t.P(n.source,f),c);if(t.g(_.assumptions,v)||!y||y.spec.init===void 0||y.spec.next===void 0||y.properties.liveness.length>0||t.rt(v))return l();let b=t.Et(),ee={fingerprints:t.i()},x=/* @__PURE__ */ new Int32Array(2),te=Array.from({length:u},t.n),S={generatedStates:0,distinctStates:0,queuedStates:0,depth:0,initialStates:void 0,outDegrees:Array.from({length:32},()=>0)},C=[],ne=()=>({status:`success`,violation:void 0,failure:void 0,...S,fingerprintDistance:t.d(S.distinctStates,S.generatedStates,()=>{let e=new BigInt64Array(S.distinctStates);return C.reduce((t,n)=>(e.set(n,t),t+n.length),0),e})}),re=e=>{let n=[];for(let r of t.ct(e,v,y.spec.scope))if(t.y(S.generatedStates,c),b(r),S.generatedStates++,t.c(y.getFingerprintState(r),x),t.s(ee.fingerprints)&&(ee.fingerprints=t.a(ee.fingerprints)),t.o(ee.fingerprints,x[0],x[1])){if(y.findViolatedInvariant(r)||y.findFailedInitialPredicate(r))return!1;if(y.satisfiesConstraints(r)){if(!te[n.length%u].encode(r))return!1;n.push(r),S.distinctStates++}}return C.push(BigInt64Array.from(n,e=>v.runtime.getFingerprint(e))),!0};c({kind:`initial-states-started`});try{if(!re(y.spec.init))return l()}catch(t){if(!(t instanceof e.g))throw t;return l()}if(t.Ft()!==g)return l();if(S.depth=S.generatedStates===0?0:1,S.initialStates={generated:S.generatedStates,distinct:S.distinctStates},c({kind:`initial-states-computed`,initialStates:S.initialStates}),S.distinctStates===0)return ne();let ie=[],w={count:u,resolve:e=>{}},ae=e=>{ie.push(e),(e.type===`abort`||ie.length===w.count)&&w.resolve(ie.splice(0))},oe=e=>new Promise(t=>{w.count=e,w.resolve=t}),se=oe(u),T=new Int32Array(new SharedArrayBuffer(u*4)),E=new Int32Array(new SharedArrayBuffer(u*4)),ce=await Promise.all(Array.from({length:u},()=>e.r(new URL(`./parallel-worker.js`,require("url").pathToFileURL(__filename).href),e=>ae(e),()=>ae({type:`abort`})))),le=()=>ce.forEach(e=>e.terminate()),ue=/* @__PURE__ */ new Map,de=(e,t)=>{let n=e<t?`${e}:${t}`:`${t}:${e}`,r=ue.get(n)??new MessageChannel;return ue.set(n,r),e<t?r.port1:r.port2};ce.forEach((e,t)=>{let i=Array.from({length:u},(e,n)=>n===t?void 0:de(t,n)),a=te[t].finish(),o={type:`start`,source:n.source,config:r,modules:[...d],classes:[...m],index:t,ports:i,seed:a,isTool:n.isTool,isTraceRecorded:n.isTraceRecorded,isWarningEnabled:n.isWarningEnabled,version:n.version,fingerprints:ee.fingerprints,requests:T,remaining:E};e.postMessage(o,[...i.filter(e=>e!==void 0),a.words.buffer])});let fe=e=>e.some(e=>e.type===`abort`),pe=e=>ce.forEach(t=>t.postMessage(e)),me=async e=>{let n=e.filter(e=>e.type===`paused`).length;if(n===0||fe(e))return e;ee.fingerprints=t.a(ee.fingerprints);let r=oe(n);return pe({type:`resize`,fingerprints:ee.fingerprints}),[...e.filter(e=>e.type!==`paused`),...await me(await r)]};if(fe(await se))return le(),l();for(;;){let e=oe(u);T.forEach((e,t)=>Atomics.store(T,t,0)),pe({type:`level`});let t=await me(await e);if(fe(t))return le(),l();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),C.push(e.fingerprints)}),r===0)return le(),ne();S.depth++}},Je=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}`},Ye=e=>`File ${JSON.stringify(e.file)}, ${Je(e)}`,Xe=e=>e?Ye(e):`<unknown location>`,Ze=e=>`${Xe(e)}:\n`,k=(e,t)=>({text:`${Ze(e)}Error: ${t}`,channel:`stderr`}),Qe=e=>e?`${Ye(e)} :\n`:``,A=(e,t)=>{let n=t.location?{...e,location:t.location}:e;return t.isAtomic?{...n,isAtomic:!0}:n},$e=e=>{switch(e.kind){case`Fresh`:case`Flex`:return e.name;case`Defn`:return e.definition.name;case`Fact`:return}},et=(e,t)=>e.kind===`Apply`&&e.operator.kind===`Internal`&&e.operator.builtin===t,j=(e,t,n)=>A({kind:`Apply`,operator:A({kind:`Internal`,builtin:e},n),args:t},n),tt=e=>e.context.length===0?e.active:{kind:`Sequent`,sequent:e},M=(e,t)=>({hyp:t,rest:e,size:(e?.size??0)+1}),N=(e,t)=>t.reduce(M,e),nt=e=>{let t=[];for(let n=e;n;n=n.rest)t.push(n.hyp);return t.reverse()},rt=(e,t)=>{let n=0;for(let r=e;r;r=r.rest){if($e(r.hyp)===t)return{depth:n,hyp:r.hyp};n++}},it=(e,t)=>{let n=e;for(let e=0;e<t&&n;e++)n=n.rest;return n},at=(e,t,n)=>{let r=[];return[t.reduce((e,t)=>{let[i,a]=n(e,t);return r.push(a),i},e),r]},P=(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()}}},ot=(e,t,n=0)=>({kind:`Fresh`,name:e,shape:n,level:t,domain:void 0,domainVisibility:`Visible`}),st=(e,t)=>({kind:`Fresh`,name:e,shape:0,level:`Constant`,domain:t,domainVisibility:`Visible`}),ct=(e,t,n,r)=>({kind:`Fact`,expression:e,visibility:t,time:n,location:r}),lt=e=>ot(e.name,e.level),ut=e=>ot(e.name,`Unknown`,e.shape),dt=e=>({kind:`Defn`,definition:e,whereDefined:`User`,visibility:`Visible`,isLocal:!0}),ft=e=>{if(!e.location&&!e.isAtomic)return e;let{location:t,isAtomic:n,...r}=e;return r},pt=(e,t)=>e.map(e=>e.domain.kind===`Domain`?{...e,domain:{kind:`Domain`,expression:t(e.domain.expression)}}:e),mt=(e,t)=>e.kind===`Instance`||e.kind===`Label`?{...e,args:e.args.map(t)}:e,ht=(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}}),gt=(e,t)=>e.kind===`Operator`||e.kind===`Bpragma`?{...e,body:t(e.body)}:e,_t=(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:gt(e.definition,t)}:{...e,expression:t(e.expression)},F=(e,t,n,r,i=`visible`)=>{let a=t=>n(e,t),o=t=>t.reduce((e,t)=>r(e,lt(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=ut(t);return r(e,t.location?{...n,location:t.location}:n)},e);return{...t,body:n(i,t.body)}}case`Sequent`:{let[a,o]=at(e,t.sequent.context,(e,t)=>{let a=_t(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]=at(e,t.definitions,(e,t)=>{let i=gt(t,t=>n(e,t));return[r(e,dt(i)),i]});return{...t,definitions:a,body:n(i,t.body)}}case`Quant`:case`Fcn`:{let e=pt(t.bounds,a);return{...t,bounds:e,body:n(o(e),t.body)}}case`SetOf`:{let e=pt(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?st(t.name,i):ot(t.name,`Constant`);return{...t,domain:i,body:n(r(e,o),t.body)}}case`SetSt`:{let i=a(t.domain),o=st(t.name,i);return{...t,domain:i,body:n(r(e,o),t.body)}}case`Bang`:{let e=t.selectors.map(e=>mt(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=ht(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}}}},vt=(e,t)=>F(void 0,e,(e,n)=>t(n),()=>void 0,`all`),yt=e=>{let t=[];return vt(e,e=>(t.push(e),e)),t},I=e=>({kind:`Shift`,amount:e}),bt=(e,t)=>({kind:`Cons`,expression:e,rest:t}),xt=(e,t)=>e.reduce((e,t)=>bt(t,e),t),St=(e,t)=>t.kind===`Bump`?{kind:`Bump`,amount:t.amount+e,rest:t.rest}:{kind:`Bump`,amount:e,rest:t},Ct=(e,t,n)=>{switch(e.kind){case`Shift`:return A({kind:`Ix`,index:e.amount+t},n);case`Cons`:return t===1?A(ft(e.expression),n):Ct(e.rest,t-1,n);case`Compose`:return L(e.outer,Ct(e.inner,t,n));case`Bump`:return t<=e.amount?A({kind:`Ix`,index:t},n):L(I(e.amount),Ct(e.rest,t-e.amount,n))}},wt=(e,t)=>t.map(t=>L(e,t)),Tt=(t,n)=>{if(t.kind===`Lambda`){if(t.params.length!==n.length)throw new e.C(`Arity mismatch`);return ft(L(xt(n,I(0)),t.body))}return t.kind===`Apply`?{kind:`Apply`,operator:t.operator,args:[...t.args,...n]}:n.length===0?ft(t):{kind:`Apply`,operator:t,args:n}},Et=(e,t)=>[St(t.length,e),pt(t,t=>L(e,t))],Dt=(e,t)=>{switch(t.kind){case`Recursive`:case`Operator`:case`Bpragma`:return gt(t,t=>L(e,t));case`Instance`:{let n=St(t.instance.args.length,e);return{...t,instance:{...t.instance,substitutions:t.instance.substitutions.map(e=>({name:e.name,expression:L(n,e.expression)}))}}}}},Ot=(e,t)=>{switch(t.kind){case`Fresh`:return t.domain?{...t,domain:L(e,t.domain)}:t;case`Flex`:return t;case`Defn`:return{...t,definition:Dt(e,t.definition)};case`Fact`:return{...t,expression:L(e,t.expression)}}},kt=(e,t)=>{let[n,r]=at(e,t.context,(e,t)=>[St(1,e),Ot(e,t)]);return{context:r,active:L(n,t.active)}},L=(e,t)=>{let n=t=>L(e,t);switch(t.kind){case`Internal`:case`Opaque`:case`String`:case`Num`:case`At`:return t;case`Ix`:return Ct(e,t.index,t);case`Apply`:return A(Tt(n(t.operator),wt(e,t.args)),t);case`Bang`:return{...t,expression:n(t.expression),selectors:t.selectors.map(e=>mt(e,n))};case`Lambda`:return{...t,body:L(St(t.params.length,e),t.body)};case`Let`:{let[n,r]=at(e,t.definitions,(e,t)=>[St(1,e),Dt(e,t)]);return{...t,definitions:r,body:L(n,t.body)}}case`Sequent`:return{...t,sequent:kt(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:wt(e,t.items)};case`Quant`:case`Fcn`:{let[n,r]=Et(e,t.bounds);return{...t,bounds:r,body:L(n,t.body)}}case`Tquant`:return{...t,body:L(St(t.names.length,e),t.body)};case`Choose`:return{...t,domain:t.domain&&n(t.domain),body:L(St(1,e),t.body)};case`SetSt`:return{...t,domain:n(t.domain),body:L(St(1,e),t.body)};case`SetOf`:{let[n,r]=Et(e,t.bounds);return{...t,bounds:r,element:L(n,t.element)}}case`SetEnum`:case`Tuple`:return{...t,elements:wt(e,t.elements)};case`Arrow`:return{...t,domain:n(t.domain),range:n(t.range)};case`FcnApp`:return{...t,function:n(t.function),args:wt(e,t.args)};case`Product`:return{...t,factors:wt(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:ht(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)}}},R=(e,t)=>e===0?t:L(I(e),t),At=(e,t,n)=>e.length===t.length&&e.every((e,r)=>n(e,t[r])),jt=(e,t)=>e&&t?z(e,t):!e&&!t,Mt=(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||!z(t,n))return!1}return!0},Nt=(e,t)=>e.level===t.level&&e.domain.kind===t.domain.kind&&(e.domain.kind!==`Domain`||t.domain.kind===`Domain`&&z(e.domain.expression,t.domain.expression)),Pt=(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`&&At(e.args,t.args,z);case`Label`:return t.kind===`Label`&&e.label===t.label&&At(e.args,t.args,z);default:return!0}},Ft=(e,t)=>{if((e.kind===`Operator`||e.kind===`Bpragma`)&&t.kind===e.kind)return z(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 At(e.instance.args,t.instance.args,(e,t)=>e===t)&&e.instance.module===t.instance.module&&Mt(n,r)}return!1},It=(e,t)=>e.kind===`Fresh`&&t.kind===`Fresh`?e.level===t.level&&e.shape===t.shape&&jt(e.domain,t.domain):e.kind===`Flex`&&t.kind===`Flex`?!0:e.kind===`Defn`&&t.kind===`Defn`?Ft(e.definition,t.definition)&&e.isLocal===t.isLocal:e.kind===`Fact`&&t.kind===`Fact`&&z(e.expression,t.expression),Lt=(e,t)=>At(e.context,t.context,It)&&z(e.active,t.active),z=(e,t)=>{if(e.kind===`Parens`)return z(e.expression,t);if(t.kind===`Parens`)return z(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&&z(e.body,t.body);case`Apply`:return t.kind===`Apply`&&z(e.operator,t.operator)&&At(e.args,t.args,z);case`Sequent`:return t.kind===`Sequent`&&Lt(e.sequent,t.sequent);case`Bang`:return t.kind===`Bang`&&z(e.expression,t.expression)&&At(e.selectors,t.selectors,Pt);case`With`:return t.kind===`With`&&z(e.expression,t.expression);case`Let`:return t.kind===`Let`&&At(e.definitions,t.definitions,Ft)&&z(e.body,t.body);case`If`:return t.kind===`If`&&z(e.condition,t.condition)&&z(e.consequent,t.consequent)&&z(e.alternative,t.alternative);case`List`:return t.kind===`List`&&e.bullet===t.bullet&&At(e.items,t.items,z);case`Quant`:return t.kind===`Quant`&&e.quantifier===t.quantifier&&At(e.bounds,t.bounds,Nt)&&z(e.body,t.body);case`Tquant`:return t.kind===`Tquant`&&e.quantifier===t.quantifier&&At(e.names,t.names,(e,t)=>e===t)&&z(e.body,t.body);case`Choose`:return t.kind===`Choose`&&jt(e.domain,t.domain)&&z(e.body,t.body);case`SetSt`:return t.kind===`SetSt`&&z(e.domain,t.domain)&&z(e.body,t.body);case`SetOf`:return t.kind===`SetOf`&&z(e.element,t.element)&&At(e.bounds,t.bounds,Nt);case`SetEnum`:case`Tuple`:return t.kind===e.kind&&At(e.elements,t.elements,z);case`Arrow`:return t.kind===`Arrow`&&z(e.domain,t.domain)&&z(e.range,t.range);case`Fcn`:return t.kind===`Fcn`&&At(e.bounds,t.bounds,Nt)&&z(e.body,t.body);case`FcnApp`:return t.kind===`FcnApp`&&At([e.function,...e.args],[t.function,...t.args],z);case`Product`:return t.kind===`Product`&&At(e.factors,t.factors,z);case`Rect`:case`Record`:return t.kind===e.kind&&Mt(e.fields,t.fields);case`Except`:return t.kind===`Except`&&z(e.function,t.function)&&At(e.specs,t.specs,(e,t)=>At(e.trail,t.trail,(e,t)=>e.kind===`Dot`?t.kind===`Dot`&&e.field===t.field:t.kind===`Apply`&&z(e.expression,t.expression))&&z(e.value,t.value));case`Dot`:return t.kind===`Dot`&&z(e.expression,t.expression)&&e.field===t.field;case`Sub`:case`Tsub`:return t.kind===e.kind&&e.modal===t.modal&&z(e.action,t.action)&&z(e.subscript,t.subscript);case`Fair`:return t.kind===`Fair`&&e.fairness===t.fairness&&z(e.subscript,t.subscript)&&z(e.action,t.action);case`Case`:return t.kind===`Case`&&(e.arms.length===0||t.arms.length===0?e.arms.length===t.arms.length:z(e.arms[0].condition,t.arms[0].condition)&&z(e.arms[0].body,t.arms[0].body))&&jt(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}},Rt={kind:`Opaque`,name:`$Bad`},zt=e=>e.kind===`Opaque`&&e.name===Rt.name,Bt=e=>{let t=e.kind===`Parens`?Bt(e.expression):vt(e,Bt);if(!t.isAtomic)return t;let{isAtomic:n,...r}=t;return r},Vt=e=>e.kind===`Let`?A({kind:`Let`,definitions:e.definitions,body:Vt(e.body)},e.body):e.kind===`Parens`?Vt(e.expression):vt(e,Vt),Ht=e=>e.kind===`Ix`?e.index<=0:yt(e).some(Ht),Ut=(e,t,n)=>{let r=(e,r=n)=>Ut(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(lt)]);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(ut)]);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,ot(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 yt(e)){let e=r(t);if(e)return e}return}},Wt=(e,t)=>xt(Array.from({length:e},(e,t)=>({kind:`Ix`,index:t+1})),I(e+t)),Gt=e=>Array.from({length:e},(t,n)=>({kind:`Ix`,index:e-n})),Kt=(t,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 t(k(n.location,a)),new e.C(a,{failure:`Expr.Deref.deref_inst`})}let i=n.kind===`SetOf`?n.element:n.body;return L(xt(r,I(0)),i)}case`Tquant`:return Kt(t,A({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 Kt(t,A({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 t(k(n.location,i)),new e.C(i,{failure:`Expr.Deref.deref_inst`})}return L(xt(r,I(0)),n.body);default:{let r=`Cannot instantiate non-binding expression`;throw t(k(n.location,r)),new e.C(r,{failure:`Expr.Deref.deref_inst`})}}},qt=(t,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 t(k(r.location,n)),new e.C(n,{failure:`Expr.Deref.deref_at`})}}})(),a=L(Wt(n,i.length),r);return[i,Kt(t,a,Gt(i.length))]},Jt=(t,n,r,i,a)=>{let o=n=>{if(!(r<=n))throw t(k(i.location,a)),new e.C(a,{failure:`Expr.Deref.deref_num`})},s=e=>(o(e.length),e[r-1]);if(n.kind===`With`)return Jt(t,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 t(k(n.location,r)),new e.C(r,{failure:`Expr.Deref.deref_num`})}let s=L(I(-(r-1)),a?a.expression:i.active);if(Ht(s))throw t(k(n.location,`subexpression of ASSUME/PROVE uses identifiers declared therein
20
+ Tlapm does not handle yet such subexpression namings.`)),new e.C(`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]:A({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,A({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=>A({kind:`Tuple`,elements:[e.condition,e.body]},e.body)),...n.other?[A({kind:`Tuple`,elements:[Rt,n.other]},n.other)]:[]])}let i=`Expression has no subexpressions`;throw t(k(n.location,i)),new e.C(i,{failure:`Expr.Deref.deref_num`})})();if(zt(c)){let i=`Cannot resolve subexpression reference !${r}`;throw t(k(n.location,i)),new e.C(i,{failure:`Expr.Deref.deref_num`})}return[n.kind===`Let`?n.definitions:[],c]},Yt=(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])},Xt=(t,n,r,i,a)=>{let o=Ut(r,i,[]);if(!o)return t(k(r.location,`Could not find label ${i}`)),{params:[],definitions:[],expression:Rt};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 t(k(o.expression.location,r)),new e.C(r,{failure:`Expr.Deref.deref_lsub`})}let c=a.length===0?s.map(e=>({name:e.name,shape:0})):[],l=a.length===0?Gt(s.length):a,u=o.context.reduceRight((e,t)=>t.kind===`Defn`?A({kind:`Let`,definitions:[t.definition],body:e},e):t.kind===`Fresh`?A({kind:`Quant`,quantifier:`Forall`,bounds:[{name:t.name,level:`Constant`,domain:{kind:`NoDomain`}}],body:e},e):L(I(-1),e),o.expression),d=L(Wt(n,c.length),u),f=[],p=d,m=Yt(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=>L(I(1),e));else{if(p.kind!==`Quant`||p.bounds.length!==1)throw new e.j(`File "src/expr/e_deref.ml", line 477, characters 21-33: Assertion failed`);p=L(bt(m[0],I(0)),p.body),m=m.slice(1)}return{params:c,definitions:f,expression:p}},Zt=(t,n,r,i,a)=>{if(r.kind!==`Let`)throw t(k(r.location,`not a LET expression`)),new e.C(`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 t(k(r.location,n)),new e.C(n,{failure:`Expr.Deref.deref_letop`})}let c=s.body,l=c.kind===`Lambda`?A({...c,body:A({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):A({kind:`Parens`,expression:c,form:{kind:`Xlabel`,label:i,indices:[]}},c);return Xt(t,n,A({kind:`Let`,definitions:r.definitions.slice(0,o),body:l},c),i,a)},Qt=(t,n,r,i)=>{let[a,...o]=i;if(!a){let e=r.definitions.length===0?r.expression:A({kind:`Let`,definitions:r.definitions,body:r.expression},r.expression),t=r.params.length===0?e:A({kind:`Lambda`,params:r.params,body:e},e);return{...Bt(t),isAtomic:!0}}if(r.expression.isAtomic)return t(k(r.expression.location,`Expression has no subexpressions`)),Rt;let s=n?r.expression:Vt(r.expression),c=r.definitions.length,l=(()=>{let i=(e,n)=>{let[i,a]=Jt(t,s,e,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{...Zt(t,c,s,r.label,r.args),rest:i,isLabel:!0};if(n)return{params:[],definitions:[],expression:s,rest:o,isLabel:!1};throw new e.C(`!: 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:Kt(t,s,a.args),rest:o,isLabel:!1};case`Label`:return{...s.kind===`Let`&&!n?Zt(t,c,s,a.label,a.args):Xt(t,c,s,a.label,a.args),rest:o,isLabel:!0};case`At`:{let[e,n]=qt(t,c,s);return{params:e,definitions:[],expression:n,rest:o,isLabel:!1}}}})();return Qt(t,l.isLabel,{params:[...r.params,...l.params],definitions:[...r.definitions,...l.definitions],expression:l.expression},l.rest.map(e=>mt(e,e=>L(I(l.definitions.length),e))))},$t=(e,t,n)=>{if(n.length>0)return{params:[],definitions:[],expression:Kt(e,t,n)};if(t.kind!==`Lambda`)return{params:[],definitions:[],expression:t};let[r,i]=qt(e,0,t);return{params:r,definitions:[],expression:i}},en=(t,n,r,i)=>{let a=Qt(t,!0,$t(t,n,r),i);if(zt(a)){let r=`Could not resolve subexpression reference`;throw t(k(n.location,r)),new e.C(r,{failure:`Expr.Anon: 2`})}return a},tn=(e,t)=>e.kind===`Apply`&&e.operator.kind===`Internal`&&t.includes(e.operator.builtin),nn=e=>j(`UNCHANGED`,[e],e),rn=e=>j(`Eq`,[j(`Prime`,[e],e),e],e),an=e=>{let t=e=>e.kind===`Tuple`?e.elements.flatMap(t):[e],n=t(e);return n.length===0?A({kind:`Internal`,builtin:`TRUE`},e):n.length===1?rn(n[0]):A({kind:`List`,bullet:`And`,items:n.map(rn)},e)},on=e=>t=>{let n=on(e);return e(t,n)??vt(t,n)},sn=on((e,t)=>e.kind===`Apply`&&tn(e,[`Leadsto`])?j(`BoxTrue`,[j(`Implies`,[t(e.args[0]),j(`Diamond`,[t(e.args[1])],e)],e)],e):void 0),cn=on(e=>{if(e.kind!==`Fair`)return;let t=e.action,n=e.subscript,r=j(`ENABLED`,[A({kind:`Sub`,modal:`Dia`,action:t,subscript:n},t)],t),i=e.fairness===`Weak`?`Diamond`:`BoxTrue`,a=e.fairness===`Weak`?`BoxTrue`:`Diamond`;return j(`Implies`,[j(i,[j(a,[r],t)],t),j(`BoxTrue`,[A({kind:`Tsub`,modal:`Dia`,action:t,subscript:n},t)],t)],t)}),ln=on((e,t)=>{if(e.kind!==`Sub`&&e.kind!==`Tsub`)return;let n=t(e.action),r=t(e.subscript),i=e.modal===`Box`?j(`Disj`,[n,nn(r)],e):j(`Conj`,[n,j(`Neg`,[nn(r)],e)],e);return e.kind===`Sub`?i:j(e.modal===`Box`?`BoxTrue`:`Diamond`,[i],e)}),un=on(e=>e.kind===`Apply`&&tn(e,[`UNCHANGED`])?an(e.args[0]):void 0),dn=[`Prime`,`StrongPrime`,`Leadsto`,`ENABLED`,`UNCHANGED`,`Cdot`,`Actplus`,`BoxTrue`,`BoxFalse`,`Diamond`],fn=/* @__PURE__ */ new WeakMap,pn=(e,t)=>{switch(t.kind){case`Fresh`:return t.level===`Constant`;case`Defn`:return t.definition.kind===`Operator`&&hn(e,t.definition.body);case`Fact`:return hn(e,t.expression);case`Flex`:return!1}},mn=(e,t)=>N(e,t.map(e=>ot(e,`Constant`))),hn=(e,t)=>{let n=t=>hn(e,t);switch(t.kind){case`Ix`:{let n=it(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=fn.get(i);if(a!==void 0)return a;let o=hn(n?.rest,i);return fn.set(i,o),o}case`Opaque`:case`String`:case`Num`:case`At`:return!0;case`Internal`:return!dn.includes(t.builtin);case`Tquant`:case`Sub`:case`Tsub`:case`Fair`:return!1;case`Lambda`:return hn(mn(e,t.params.map(e=>e.name)),t.body);case`Sequent`:{let n=t.sequent.context.reduce((e,t)=>({scope:M(e.scope,t),isGood:e.isGood&&pn(e.scope,t)}),{scope:e,isGood:!0});return n.isGood&&hn(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:M(e.scope,dt(t)),isGood:e.isGood&&t.kind===`Operator`&&hn(e.scope,t.body)}),{scope:e,isGood:!0});return n.isGood&&hn(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))&&hn(mn(e,t.bounds.map(e=>e.name)),r)}case`Choose`:case`SetSt`:return(t.domain===void 0||n(t.domain))&&hn(mn(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))}},gn=(e,t,n)=>{if(hn(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=>gn(e,t,n));if(t.kind===`Sequent`)return gn(N(e,t.sequent.context),t.sequent.active,n);if(t.kind!==`Apply`)return!1;let r=t.args;return tn(t,[`BoxTrue`,`BoxFalse`])&&n||tn(t,[`Diamond`])&&!n?!0:r.length===1&&tn(t,[`BoxTrue`,`BoxFalse`,`Diamond`,`Prime`])?gn(e,r[0],n):r.length===1&&tn(t,[`Neg`])?gn(e,r[0],!n):r.length===2&&tn(t,[`Conj`,`Disj`])?gn(e,r[0],n)&&gn(e,r[1],n):r.length===2&&tn(t,[`Implies`])?gn(e,r[0],!n)&&gn(e,r[1],n):r.length===2&&tn(t,[`Equiv`])?[!0,!1].every(t=>gn(e,r[0],n!==t)&&gn(e,r[1],n===t)):gn(e,t.operator,n)&&r.every(t=>gn(e,t,n))},_n=(e,t)=>gn(e,sn(cn(ln(un(t)))),!0)?`Always`:`Now`,vn=(e,t)=>t===`Always`&&e.some(e=>e.kind===`Fact`&&e.time===`Now`)?`Now`:t,yn=e=>e.kind===`Named`?`<${e.level}>${e.label}`:`<${e.level}>`,bn=e=>++e.value,xn={kind:`Fact`,expression:{kind:`At`,isExcept:!1},visibility:`Visible`,time:`Always`},Sn={Number:`1NUM`,Down:`1DOWN`,At:`1AT`,Instance:`1INST`,Left:`1`,Right:`1`},Cn={kind:`Opaque`,name:`$badexp`},wn=(e,t)=>t.location?{...e,location:t.location}:e,Tn=(t,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?R(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]=at(n,r.trail,(t,n)=>{if(n.kind===`Dot`)return[A({kind:`Dot`,expression:t,field:n.field},t),n];let r=s(e,n.expression);return[A({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,A({kind:`Except`,function:n,specs:[{trail:c,value:u}]},t)},n)},c=(e,t,n)=>{let r=A({kind:`Ix`,index:e},n);return t.length===0?r:A({kind:`Apply`,operator:r,args:t},n)},l=(e,t,n,r,i)=>{if(t!==`Builtin`)return c(e,r,i);let a=R(e,n);return A(r.length===0?a:Tt(a,r),i)},u=(t,n,i,a)=>{let o=rt(t.scope,n);if(!o){let t=`Operator "${n}" not found`;throw r(k(a.location,t)),new e.C(t,{failure:`Expr.Anon: 4`})}let s=o.depth+1,u=o.hyp;switch(u.kind){case`Defn`:{let t=u.definition;if(t.kind===`Operator`)return l(s,u.whereDefined,t.body,i,a);if(t.kind===`Recursive`)throw new e.C(`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 A({kind:`Ix`,index:s},a);case`Fact`:throw new e.j(`File "src/expr/e_anon.ml", line 230, characters 24-36: Assertion failed`)}},d=(t,n,i,a,o,c)=>{let u=rt(t.scope,n);if(!u){let[o,...l]=a;if(o?.kind===`Label`){let e=o.args.map(e=>s(t,e));return d(t,`${n}!${o.label}`,[...i,...e],l,!0,c)}let u=`Operator "${n}" not found`;throw o&&r(k(c.location,u)),new e.C(u,{failure:`Expr.Anon: ${o?Sn[o.kind]:`1EMPTY`}`})}let f=u.hyp;if(f.kind!==`Defn`||f.definition.kind!==`Operator`&&f.definition.kind!==`Bpragma`)throw new e.C(`invalid subexpression reference`);let p=u.depth+1;if(a.length===0&&o)return i.length===0?A({kind:`Ix`,index:p},c):l(p,f.whereDefined,f.definition.body,i,c);let m=wn(R(p,f.definition.body),c);return wn(en(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=>mt(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:A({kind:`Apply`,operator:n,args:[]},n)})}case`Apply`:{if(t.operator.kind!==`Opaque`)return v(e,t);let n=t.operator.name;if(e.warnedSteps.includes(n))return r({text:`${Qe(t.location)}Warning: ${n} does not introduce any assumptions. It does not make sense to use it here.\n`,channel:`toolbox`}),A({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,A({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 v(e,t)}},p=(t,n)=>n.kind===`Nlabel`?{kind:`Xlabel`,label:n.label,indices:n.names.map(n=>{let r=rt(t.scope,n);if(!r)throw new e.C(`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,M(e.scope,t)),g=(e,t)=>m(e,N(e.scope,t.map(lt))),_=(e,t)=>{let n=pt(t,t=>s(e,t));return[g(e,n),n]},v=(e,t)=>{if(t.kind===`Sequent`)return{...t,sequent:x(e,t.sequent)[1]};if(t.kind===`Let`){let[n,r]=b(e,t.definitions);return{...t,definitions:r,body:s(n,t.body)}}return F(e,t,s,h)},y=(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,ot(t.name,`Constant`)),n);if(z(L(bt({kind:`Opaque`,name:`%%%`},I(1)),r),r))return{...t,body:R(-1,r)};let i=j(`Eq`,[A({kind:`Ix`,index:1},r),r],r);return{...t,body:A({kind:`Choose`,name:t.name,domain:void 0,body:i},r)}},b=(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=y(r,t);r=h(r,{...dt(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:y(e,t.definition)};case`Fact`:{let n=s(e,t.expression);return{...t,expression:n,time:_n(e.scope,n)}}}})();return[h(e,n),n]},x=(e,t)=>{let[n,r]=at(e,t.context,ee);return[n,{context:r,active:s(n,t.active)}]},te=(e,t)=>({warnedSteps:[yn(t),...e.warnedSteps],scope:e.scope}),S=(e,t,n,r)=>h(e,{kind:`Defn`,definition:{kind:`Operator`,name:yn(t),body:n,location:r.location},whereDefined:{kind:`Proof`,time:`Always`},visibility:`Visible`,isLocal:!0,isConstnessUnset:!0,location:r.location}),C=(e,t)=>m(e,N(e.scope,Array.from({length:t},()=>xn))),ne=e=>{let t=[...e.context.map((t,n)=>{let r=e.context.length-n+1;if(t.kind===`Fact`)return R(r,t.expression);if(t.kind!==`Fresh`||!t.domain)return Cn;let i=j(`Mem`,[A({kind:`Ix`,index:0},t.domain),t.domain],t.domain);return R(r,i)}),R(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,A({kind:`Opaque`,name:t.name},t));return n.kind===`Ix`?it(e.scope,n.index-1)?.hyp.kind===`Defn`?[{kind:`Dx`,index:n.index,location:t.location}]:(r({text:`${Qe(t.location)}${JSON.stringify(t.name)} is not a definition and cannot be used in a DEF clause.`,channel:`toolbox`}),[]):(r({text:`${Qe(t.location)}Ignored unexpandable identifier ${JSON.stringify(t.name)} in BY DEF.`,channel:`stderr`}),[])})}),w=(e,t)=>{switch(t.kind){case`Steps`:{let[n,r]=at(e,t.steps,ae),i=w(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=(n,r)=>{let i=r.step?.kind===`Unnamed`&&re(r)?{kind:`Named`,level:r.step.level,label:`_a${bn(t)}`,isAnonymous:!0}:r.step;if(!i)throw new e.j;let a={...r,step:i};switch(a.kind){case`Assert`:{let[,e]=x(n,a.sequent),t=e.context.reduce(h,n),r=C(S(C(t,1),i,A(ne(e),a),a),1),o=e.context.length===0?te(r,i):r,s={...a,sequent:e,proof:w(o,a.proof)};return[C(S(n,i,A(tt(e),a),a),1),s]}case`Pcase`:{let e=s(n,a.expression),t=A({kind:`Tuple`,elements:[R(2,e)]},a),r=C(S(C(n,2),i,t,a),1),o={...a,expression:e,proof:w(r,a.proof)},c=S(n,i,A({kind:`Tuple`,elements:[e]},a),a);return[C(c,1),o]}case`Suffices`:{let[,e]=x(n,a.sequent),t=A({kind:`Tuple`,elements:[A(tt(e),a)]},a),r=C(S(n,i,t,a),1),o={...a,sequent:e,proof:w(r,a.proof)},s=e.context.reduce(h,n),c=A({kind:`Tuple`,elements:[A(ne(e),a)]},a);return[C(S(C(s,1),i,c,a),1),o]}case`Have`:{let e=s(n,a.expression),t=A({kind:`Tuple`,elements:[R(2,e)]},a);return[C(S(C(n,2),i,t,a),1),{...a,expression:e}]}case`Take`:{let[e,t]=_(n,a.bounds),r=A({kind:`Quant`,quantifier:`Forall`,bounds:t,body:Cn},a);return[C(S(C(e,1),i,r,a),1),{...a,bounds:t}]}case`Witness`:{let e=a.expressions.map(e=>s(n,e)),t=A({kind:`Tuple`,elements:e},a);return[C(S(C(n,1),i,t,a),1),{...a,expressions:e}]}case`Pick`:{let[e,t]=_(n,a.bounds),r=s(e,a.expression),o=A({kind:`Quant`,quantifier:`Exists`,bounds:t,body:r},a),c=te(C(S(C(n,1),i,o,a),1),i),l={...a,bounds:t,expression:r,proof:w(c,a.proof)},u=g(C(n,2),t),d=R(4+t.length,o);return[C(S(C(u,2),i,d,a),1),l]}case`Use`:{let e=ie(n,a.usable);return[C(n,e.facts.length),{...a,usable:e}]}case`Hide`:return[n,{...a,usable:ie(n,a.usable)}];case`Define`:{let[e,t]=b(n,a.definitions);return[e,{...a,definitions:t}]}case`Forget`:return[n,a]}};return{expr:(e,t)=>s(a(e),t),defn:(e,t)=>y(a(e),t),sequent:(e,t)=>x(a(e),t)[1],usable:(e,t)=>ie(a(e),t),proof:(e,t)=>w(a(e),t)}},B=(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}),En=[B(0,`Nat`,`Nat`),B(2,`+`,`Plus`),B(2,`-`,`Minus`),B(2,`*`,`Times`),B(2,`^`,`Exp`),B(2,`<`,`Lt`),B(2,`>`,`Gt`),B(2,`=<`,`Lteq`),B(2,`>=`,`Gteq`),B(2,`%`,`Remainder`),B(2,`\\div`,`Quotient`),B(2,`..`,`Range`)],Dn=[...En,B(0,`Int`,`Int`),B(1,`-.`,`Uminus`)],On=[...Dn,B(0,`Real`,`Real`),B(2,`/`,`Ratio`),B(0,`Infinity`,`Infinity`)],kn=[B(1,`Seq`,`Seq`),B(1,`Len`,`Len`),B(2,`BSeq`,`BSeq`),B(2,`\\o`,`Cat`),B(2,`Append`,`Append`),B(1,`Head`,`Head`),B(1,`Tail`,`Tail`),B(3,`SubSeq`,`SubSeq`),B(2,`SelectSeq`,`SelectSeq`)],An=[B(2,`Print`,`Print`),B(1,`PrintT`,`PrintT`),B(2,`Assert`,`Assert`),B(0,`JavaTime`,`JavaTime`),B(1,`TLCGet`,`TLCGet`),B(2,`TLCSet`,`TLCSet`),B(2,`:>`,`OneArg`),B(2,`@@`,`Extend`),B(1,`Permutations`,`Permutations`),B(2,`SortSeq`,`SortSeq`),B(1,`RandomElement`,`RandomElement`),B(0,`Any`,`Any`),B(1,`ToString`,`ToString`)],jn=(e,t)=>({name:e,extendees:[],body:t,isImportant:!1,isStandard:!0}),Mn=new Map([jn(`Naturals`,En),jn(`Integers`,Dn),jn(`Reals`,On),jn(`Sequences`,kn),jn(`TLC`,An)].map(e=>[e.name,e])),Nn=e=>{let t=e.location;switch(e.kind){case`Constants`:return e.declarations.map(e=>({...ot(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:A(tt(kt(I(-e.axiomCount),{...e.sequent,context:e.sequent.context.slice(e.axiomCount)})),e);return e.name===void 0?[ct(n,`Hidden`,`Always`,t)]:Fn(e.name,n,t)}case`Mutate`:return e.mode===`Use`?e.usable.facts.map((e,n)=>ct(R(n,e),`Visible`,`Always`,t)):[];case`Submod`:case`Anoninst`:return[]}},Pn=e=>e.kind===`Axiom`||e.kind===`Theorem`?e.name===void 0?1:2:Nn(e).length,Fn=(e,t,n)=>[{kind:`Defn`,definition:{kind:`Operator`,name:e,body:t,location:n},whereDefined:`User`,visibility:`Visible`,isLocal:!1,location:n},ct({kind:`Ix`,index:1,location:n},`Hidden`,`Always`,n)],In=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:In(e.module)}}];default:return[e]}}),Ln=(t,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 e.j(`Stack overflow`);let n=t.get(o);if(!n)throw new e.C(`Module "${o}" unknown`);a.push(...In(Ln(t,n,r,/* @__PURE__ */ new Set([...i,o])))),r.add(o)}return{...n,body:[...a,...n.body].map(e=>e.kind===`Submod`?{...e,module:Ln(t,e.module,/* @__PURE__ */ new Set)}:e)}},Rn=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&&zn(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(Bn),locations:t,submodules:a}},zn=e=>typeof e==`object`&&!!e&&`module`in e&&typeof e.module==`string`&&`substitutions`in e,Bn=(e,t)=>e<t?-1:+(e>t),Vn=(t,n)=>({facts:wt(t,n.facts),defs:n.defs.map(n=>{if(n.kind===`Dvar`)return n;let r=L(t,{kind:`Ix`,index:n.index});if(r.kind!==`Ix`)throw new e.C(`substitution produced bad definition`);return{...n,index:r.index}})}),Hn=(e,t)=>{switch(t.kind){case`Constants`:case`Recursives`:return[St(t.declarations.length,e),t];case`Variables`:return[St(t.names.length,e),t];case`Definition`:return[St(1,e),{...t,definition:Dt(e,t.definition)}];case`Axiom`:return[St(Pn(t),e),{...t,expression:L(e,t.expression)}];case`Theorem`:return[St(Pn(t),e),{...t,sequent:kt(e,t.sequent)}];case`Submod`:return[e,{...t,module:{...t.module,body:Un(e,t.module.body)}}];case`Mutate`:return[t.mode===`Hide`?e:St(t.usable.facts.length,e),{...t,usable:Vn(e,t.usable)}];case`Anoninst`:return[e,{...t,instance:{...t.instance,substitutions:t.instance.substitutions.map(t=>({name:t.name,expression:L(e,t.expression)}))}}]}},Un=(e,t)=>at(e,t,Hn)[1],Wn=(e,t,n)=>e===void 0?{hyps:[],sequent:t}:{hyps:[{kind:`Defn`,definition:{kind:`Operator`,name:e,body:A(tt(t),{location:n}),location:n},whereDefined:{kind:`Proof`,time:`Always`},visibility:`Visible`,isLocal:!1,location:n}],sequent:kt(I(1),t)},Gn={kind:`At`,isExcept:!1},Kn=e=>e?.kind===`Named`&&e.isAnonymous,qn=e=>A({kind:`Internal`,builtin:`TRUE`},e),Jn=(e,t)=>t.context.flatMap((n,r)=>n.kind===`Fact`&&n.visibility===`Visible`?[R(e+t.context.length-1-r,n.expression)]:[]),Yn=(t,n,r)=>{if(!t.step)throw new e.j;return{kind:`Defn`,definition:{kind:`Operator`,name:yn(t.step),body:n,location:t.location},whereDefined:{kind:`Proof`,time:r},visibility:`Visible`,isLocal:!0,location:t.location}},Xn=(e,t,n,r)=>{let i=Kn(n.step)?`Visible`:`Hidden`,a=t.context.map(e=>e.kind===`Fact`?{...e,visibility:i}:e),o=A({kind:`List`,bullet:`Refs`,items:Jn(2,t)},n),s=vn(t.context,r);return{context:[...e,...a,ct(qn(n),`Hidden`,r,n.location),Yn(n,o,s),ct(A({kind:`Ix`,index:1},n),`Hidden`,s,n.location)],active:R(3,t.active),time:s}},Zn=(e,t,n,r,i,a)=>{let o=e||Kn(i.step)?`Visible`:`Hidden`;return{context:[...t,Yn(i,A(tt(r),i),a),ct(A({kind:`Ix`,index:1},i),o,a,i.location)],active:R(2,n)}},Qn=(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`},$n=(t,n,r)=>{if(r.kind!==`Dx`)throw new e.C(`Unknown definition ${r.name}`);let i=n.length-r.index,a=n[i];if(!a)return n;if(a.kind!==`Defn`)throw new e.C(`Indicated point is not a definition`);return n.map((e,n)=>n===i?{...a,visibility:t}:e)},er=(e,t)=>et(e,`Mem`)&&e.args[0]?.kind===`Ix`&&e.args[0].index===0&&z(t,e.args[1]),tr=(t,n,r,i)=>{let a=!1,o=r,s=[...i];for(let e=i.length-1;e>=0;e--){o=R(-1,o);let t=i[e];t.kind===`Fact`&&z(t.expression,o)?(a=!0,s[e]={...t,visibility:n}):t.kind===`Fresh`&&t.domain&&er(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 t(k(r.location,`${n}\n`)),new e.C(n,{failure:`proof.Gen.set_expr`})}return s},nr=(e,t,n)=>({sequent:e,location:t.location,kind:n,method:t.method}),rr={total:0,absent:[],omitted:[]},ir=(e,t)=>({total:e.total+t.total,absent:[...e.absent,...t.absent],omitted:[...e.omitted,...t.omitted]}),ar=e=>e.kind===`Use`?{...rr,total:e.obligations?.length??0}:`proof`in e?or(e.proof):rr,or=e=>e.kind===`Steps`?[...e.steps.map(ar),or(e.qed.proof)].reduce(ir):e.kind!==`Omitted`||!e.obligations||!e.location?{...rr,total:e.obligations?.length??0}:{total:e.obligations.length,absent:e.omission===`Implicit`?[e.location]:[],omitted:e.omission===`Explicit`?[e.location]:[]},sr=(t,n,r)=>{let i=(r,o,s)=>{let c=o.location;if(!c||!t.has(c.file)||c.endLine<n.start||c.startLine>n.end)return o;switch(o.kind){case`Obvious`:return{...o,obligations:[nr(r,o,{kind:`Main`})]};case`Omitted`:return{...o,obligations:[nr(r,o,{kind:`Omitted`,omission:o.omission})]};case`Error`:return{...o,obligations:[nr(r,o,{kind:`Error`,message:o.message})]};case`By`:throw new e.C(`Proof.Gen.generate`);case`Steps`:{let[e,t]=at({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=(t,n,a)=>{switch(n.kind){case`Forget`:{let e=t.context.length,r=t.context.map((t,r)=>t.kind===`Fact`&&t.visibility===`Visible`&&n.count+r<e?{...t,visibility:`Hidden`}:t);return[{...t,context:r},n,a]}case`Use`:{let r=n.usable;if(r.defs.length===0&&r.facts.length===1){let e=r.facts[0],i=nr({...t,active:e},n,{kind:`Support`});return[{context:[...t.context,{...ct(e,`Visible`,Qn(t.context,e,a),e.location),useLocation:n.useLocation}],active:R(1,t.active)},{...n,obligations:[i]},a]}if(r.facts.length>0)throw new e.C(`Proof.Gen.gen_step: USE with facts and definitions`);let i=r.defs.reduce((e,t)=>$n(`Visible`,e,t),t.context);return[{...t,context:i},n,a]}case`Hide`:{let e=n.usable.defs.reduce((e,t)=>$n(`Hidden`,e,t),t.context),i=n.usable.facts.reduceRight((e,t)=>tr(r,`Hidden`,t,e),e);return[{...t,context:i},n,a]}case`Define`:return[{context:[...t.context,...n.definitions.map(e=>({kind:`Defn`,definition:e,whereDefined:`User`,visibility:`Visible`,isLocal:!0,location:e.location}))],active:R(n.definitions.length,t.active)},n,a];case`Assert`:{let e=Xn(t.context,n.sequent,n,a),r=i(e,n.proof,e.time),o={...n,proof:r};return[Zn(!1,t.context,t.active,n.sequent,o,a),o,a]}case`Suffices`:{let e=i(Zn(!0,t.context,t.active,n.sequent,n,a),n.proof,a),r={...n,proof:e},o=Xn(t.context,n.sequent,r,a);return[o,r,o.time]}default:throw new e.C(`Proof.Gen.gen_step`)}},o=(e,t,n,r)=>{let i={kind:`Unnamed`,level:0,id:0},[o,s]=a({context:e,active:{...Gn,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=>R(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=rr,o=e;for(let e of t.body)switch(e.kind){case`Theorem`:{let t=Wn(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,vn(l,`Always`));n.push(...c(u));let d=or(u);r.push({...d,location:e.location}),a=ir(a,d);let f=e.name===void 0?A(tt(e.sequent),e):{kind:`Ix`,index:1,location:e.location};o=[...s,ct(f,`Hidden`,`Always`,e.location)];continue}case`Submod`:{let t=l(o,e.module);n.push(...t.obligations),a=ir(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,...Nn(e)]}return{obligations:n,summary:{...a,theorems:r}}};return l},cr=(e,t=0)=>({level:e,weights:Array.from({length:t},()=>!0),params:/* @__PURE__ */ new Set}),lr={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]},ur={Constant:0,State:1,Action:2,Temporal:3,Unknown:0},dr=e=>new Set(e.flatMap(e=>[...e])),fr=e=>({level:Math.max(0,...e.map(e=>e.level)),weights:[],params:dr(e.map(e=>e.params))}),pr=/* @__PURE__ */ new WeakMap,mr=t=>{let n=t.hyp;switch(n.kind){case`Flex`:return cr(1);case`Fresh`:return{...cr(ur[n.level],n.shape),params:/* @__PURE__ */ new Set([n.name])};case`Defn`:{let r=n.definition;if(r.kind!==`Operator`&&r.kind!==`Bpragma`)throw new e.j;return vr(t.rest,r.body)}case`Fact`:return vr(t.rest,n.expression)}},hr=e=>{let t=pr.get(e);if(t)return t;let n=mr(e);return pr.set(e,n),n},gr=(e,t,n)=>{let r=t.flatMap(t=>t.domain.kind===`Domain`?[vr(e,t.domain.expression)]:[]);return fr([vr(N(e,t.map(lt)),n),...r])},_r=(t,n)=>{if(t.weights.length!==n.length)throw new e.C(`Invalid number of arguments`);let r=n.filter((e,n)=>t.weights[n]);return{level:Math.max(t.level,...r.map(e=>e.level)),weights:[],params:dr([t.params,...r.map(e=>e.params)])}},vr=(t,n)=>{let r=e=>vr(t,e);switch(n.kind){case`Ix`:{let r=it(t,n.index-1);if(!r)throw new e.j;return hr(r)}case`Internal`:{let t=lr[n.builtin];if(!t)throw new e.j;return cr(t[0],t[1])}case`Opaque`:case`String`:case`Num`:return cr(0);case`Lambda`:{let e=vr(N(t,n.params.map(ut)),n.body),r=new Set(n.params.map(e=>e.name));return{level:e.level,weights:n.params.map(t=>e.params.has(t.name)),params:new Set([...e.params].filter(e=>!r.has(e)))}}case`Apply`:{let t=n.operator;if(et(t,`Prime`)&&t.args.length===1)return r({...n,operator:t.args[0]});if(t.kind===`Opaque`)return _r(cr(0,n.args.length),n.args.map(r));if(t.kind===`Internal`&&n.args.length===1){let i=n.args[0];switch(t.builtin){case`Prime`:case`StrongPrime`:if(r(i).level>1)throw new e.j;return cr(2,1);case`ENABLED`:{let t=r(i);if(t.level>2)throw new e.j;return{level:1,weights:[],params:t.params}}case`UNCHANGED`:{let t=r(i);if(t.level>1)throw new e.j;return{level:2,weights:[],params:t.params}}}}return t.kind===`Internal`&&t.builtin===`Cdot`?(n.args.forEach(r),cr(2)):t.kind===`Internal`&&t.builtin===`Leadsto`?(n.args.forEach(r),cr(3,2)):_r(r(t),n.args.map(r))}case`Sequent`:{let[e,r]=at(t,n.sequent.context,(e,t)=>{let n=M(e,t);return[n,hr(n).level]});return cr(Math.max(0,...r,vr(e,n.sequent.active).level))}case`With`:case`Dot`:case`Parens`:return r(n.expression);case`Let`:return vr(N(t,n.definitions.map(dt)),n.body);case`If`:return fr([n.condition,n.consequent,n.alternative].map(r));case`List`:return fr(n.items.map(r));case`Quant`:case`Fcn`:return gr(t,n.bounds,n.body);case`SetOf`:return gr(t,n.bounds,n.element);case`Tquant`:return vr(N(t,n.names.map(e=>({kind:`Flex`,name:e}))),n.body),cr(3);case`Choose`:case`SetSt`:{let e=n.domain&&r(n.domain),i=n.domain?st(n.name,n.domain):ot(n.name,`Constant`);return fr([vr(M(t,i),n.body),...e?[e]:[]])}case`SetEnum`:case`Tuple`:return fr(n.elements.map(r));case`Product`:return fr(n.factors.map(r));case`FcnApp`:return fr([n.function,...n.args].map(r));case`Arrow`:return fr([r(n.domain),r(n.range)]);case`Rect`:case`Record`:return fr(n.fields.map(e=>r(e.value)));case`Except`:return fr([r(n.function),...n.specs.flatMap(e=>[...e.trail.flatMap(e=>e.kind===`Apply`?[r(e.expression)]:[]),r(e.value)])]);case`Sub`:return{...fr([r(n.action),r(n.subscript)]),level:2};case`Tsub`:case`Fair`:return r(n.action),r(n.subscript),cr(3);case`Case`:return fr([...n.arms.flatMap(e=>[r(e.condition),r(e.body)]),...n.other?[r(n.other)]:[]]);case`Bang`:case`At`:throw new e.j}},yr=`EnabledWrapper`,br=`CdotWrapper`,xr="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`.",Sr="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.",Cr=`${Sr} For example, writing \`BY ExpandCdot\`.`,wr=(e,t)=>F(void 0,e,(e,n)=>t(n),()=>void 0),Tr=(t,n)=>{let r=it(t,n-1)?.hyp;if(!r)throw new e.j;return r},Er=e=>e.kind===`Internal`&&(e.builtin===`ENABLED`||e.builtin===`Cdot`),Dr=e=>e.kind===`Opaque`&&(e.name===yr||e.name===br),Or=e=>e.kind===`Apply`&&e.args.length===1&&e.args[0].kind===`Lambda`&&(Er(e.operator)||Dr(e.operator)),kr=e=>e===void 0?2:Math.min(2,e),Ar=e=>e===void 0?void 0:Math.max(1,e-1),jr=(t,n,r,i,a)=>{let o=(e,i=a)=>jr(t,n,r,e,i);if(Or(i))return i;if(i.kind===`Sub`)return{...i,action:o(i.action),subscript:o(i.subscript,Ar(a))};if(i.kind===`Apply`&&i.operator.kind===`Internal`){let r=i.operator.builtin,[s,c]=i.args;if(r===`Cdot`&&i.args.length===2){if(a!==void 0&&!t.isCdot)throw n(k(i.location,`${Sr}For example, writing \`BY ExpandCdot\`.`)),new e.w(`Expr.Action`);return{...i,args:t.isCdot?[o(s,kr(a)),o(c,1)]:[o(s),o(c)]}}if(r===`ENABLED`&&i.args.length===1){if(a!==void 0&&!t.isEnabled)throw n(k(i.location,xr)),new e.w(`Expr.Action`);return{...i,args:[t.isEnabled?o(s,kr(a)):o(s)]}}if((r===`Prime`||r===`UNCHANGED`)&&i.args.length===1)return{...i,args:[o(s,Ar(a))]}}let s=i.kind===`Apply`&&i.operator.kind===`Ix`?i.operator:i;if(s.kind!==`Ix`)return F(r,i,(e,r)=>jr(t,n,e,r,a),M);if(a===void 0)return i;let c=vr(r,i).level,l=Tr(r,s.index),u=e=>`The operator \`${e}\` is declared at:\n${Xe(l.location)}`;if(l.kind===`Fresh`&&l.level===`Unknown`)throw n(k(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 e.j(`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 e.j;if(l.kind===`Flex`){if(i.kind!==`Ix`)throw new e.j;return i}if(l.kind===`Fresh`){let t=`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: ${ur[l.level]}\n and arity: ${l.shape}`;throw n(k(i.location,t)),new e.C(t)}let d=l.definition;if(d.kind!==`Operator`&&d.kind!==`Bpragma`)throw new e.j;if(!t.isAutoUse){let r=t.isEnabled&&t.isCdot?["the operators `ENABLED` and `\\cdot`","the proof directives `ExpandENABLED` and `ExpandCdot`"]:t.isEnabled?["the operator `ENABLED`","`ExpandENABLED` proof directive"]:["the operator `\\cdot`","`ExpandCdot` proof directive"],a=d.body.kind===`Lambda`?d.body.body:d.body,o=`Hidden definition of operator \`${d.name}\` needs expansion for soundly expanding ${r[0]} (using rigid quantification).\nThe expansion of ${r[0]} has been activated with the ${r[1]} from the module \`TLAPS\`.\nThe operator \`${d.name}\` is defined at: \n\t${Xe(a.location)}\nand the operator \`${d.name}\` occurs at: \n\t${Xe(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(k(i.location,o)),new e.w(o)}n({text:`${Ze(i.location)}[INFO]: Auto-expanding the definition of operator: ${d.name}\n`,channel:`stdout`});let f=L(I(s.index),d.body);return o(ft(i.kind===`Apply`?Tt(f,i.args):f))},Mr=t=>{if(t.kind===`Apply`&&t.args.length===1)return an(t.args[0]);if(t.kind!==`Sub`)throw new e.j;let n=an(t.subscript),r=t.modal===`Box`?n:j(`Neg`,[n],t);return j(t.modal===`Box`?`Disj`:`Conj`,[t.action,r],t)},Nr=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},Pr=e=>{let t=Array.from({length:16},()=>[]);return e.forEach((e,n)=>{if(t[Nr(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[Nr(e)&r.length-1].push(e)),t=r}),t.flat()},Fr=(t,n,r,i,a,o)=>{let s=e=>Fr(t,n,r,i,a,e),c=r!==void 0||i!==void 0,l=(e,s)=>{let c={names:[],depth:Math.max(r?.depth??0,i?.depth??0)+1},[l,u]=s,d=[Fr(t,n,r,c,a,l),...u?[Fr(t,n,c,i,a,u)]:[]],f=c.names.length===0?[`r#0`]:Pr(c.names);return A({kind:`Apply`,operator:e,args:[{kind:`Lambda`,params:[`_`,...f].map(e=>({name:e,shape:0})),body:d.length===1?d[0]:{kind:`List`,bullet:`And`,items:d}}]},o)};if(Or(o))return o;if(o.kind===`Apply`&&o.operator.kind===`Internal`){let r=o.operator.builtin;if(t.isEnabled&&r===`ENABLED`&&o.args.length===1||t.isCdot&&r===`Cdot`&&o.args.length===2)return l(o.operator,o.args);if(r===`ENABLED`&&c)throw n(k(o.location,xr)),new e.w(`Expr.Action`);if(r===`Cdot`&&c)throw n(k(o.location,Cr)),new e.w(`Expr.Action`);if(r===`Prime`&&o.args.length===1){let e=Fr(t,n,i,void 0,a,o.args[0]);return i?e:{...o,args:[e]}}if(r===`UNCHANGED`&&c)return s(Mr(o))}if(o.kind===`Sub`&&c)return s(Mr(o));if(o.kind===`Ix`){if(!r)return o;let t=Tr(a,o.index);if(t.kind===`Fact`)throw new e.j;if(t.kind!==`Flex`)return o;let n=`${t.name}#enabled#prime${r.depth}`;return r.names.includes(n)||r.names.push(n),A({kind:`Opaque`,name:n},o)}if(o.kind===`Apply`&&o.operator.kind===`Opaque`)throw n(k(o.location,`Named operator \`${o.operator.name}\` unexpected after anonymization.`)),new e.j(`File "src/expr/e_action.ml", line 1048, characters 12-18: Assertion failed`);return F(a,o,(e,a)=>Fr(t,n,r,i,e,a),M)},Ir=(t,n)=>{if(n.kind===`Apply`&&Er(n.operator)){let[r]=n.args;if(n.args.length!==1||r.kind!==`Lambda`)throw new e.j;let[i,...a]=r.params;if(i.name!==`_`)return n;let o=Ir({kind:`Compose`,outer:t,inner:I(a.length)},r.body);return{kind:`Apply`,operator:n.operator,args:[{kind:`Lambda`,params:a,body:o}]}}return n.kind===`Ix`?L(t,n):n.kind===`Apply`?A(Tt(Ir(t,n.operator),n.args.map(e=>Ir(t,e))),n):F(t,n,Ir,e=>St(1,e))},Lr=(t,n)=>{if(n.kind===`Apply`&&Er(n.operator)){let[r]=n.args;if(n.args.length!==1||r.kind!==`Lambda`||r.params[0].name===`_`)throw new e.j;let i=n.operator.builtin===`Cdot`?br:yr;return{kind:`Apply`,operator:A({kind:`Opaque`,name:i},n.operator),args:[{kind:`Lambda`,params:r.params.map((e,n)=>({name:t?e.name:`r#${n}`,shape:0})),body:Lr(t,r.body)}]}}return wr(n,e=>Lr(t,e))},Rr=t=>{if(et(t,`Cdot`)&&t.args.length===1&&t.args[0].kind!==`Lambda`)throw new e.j;return wr(t,Rr)},zr=(e,t,n,r,i,a)=>{let o=Fr(i,t,void 0,void 0,n,r);return Lr(a,e.expr(n,Ir(I(0),o)))},Br={isEnabled:!0,isCdot:!0,isAutoUse:!0},Vr=(e,t,n,r,i=Br)=>{let a=jr(i,t,n,r,void 0);return Rr(zr(e,t,n,a,i,!1))},Hr=(t,n,r,i,a)=>{let o=(e,i)=>({kind:`Quant`,quantifier:`Exists`,bounds:e.map(e=>({name:e.name,level:`Constant`,domain:{kind:`NoDomain`}})),body:Hr(t,n,N(r,e.map(ut)),i,!0)}),s=e=>e===`ENABLED`?t.isEnabled:t.isCdot;if(i.kind===`Apply`&&i.args.length===1){let e=i.operator,[a]=i.args;if(a.kind===`Lambda`){if(e.kind===`Opaque`&&(t.isEnabled&&e.name===yr||t.isCdot&&e.name===br))return o(a.params,a.body);if(e.kind===`Ix`&&(t.isEnabled||t.isCdot)){let t=Tr(r,e.index);if(t.kind===`Defn`&&t.definition.kind===`Operator`&&(t.definition.name===yr||t.definition.name===br))return o(a.params,a.body)}if(Er(e)&&s(e.builtin))return o(a.params,a.body)}if(Er(e)&&s(e.builtin))return Hr(t,n,r,a,!0)}if(et(i,`ENABLED`)&&a)throw n(k(i.location,xr)),new e.w(`Expr.Action`);if(et(i,`Cdot`)&&a)throw n(k(i.location,Cr)),new e.w(`Expr.Action`);return F(r,i,(e,r)=>Hr(t,n,e,r,a),M)},Ur=t=>{if(t.kind===`Quant`&&t.quantifier===`Exists`){let n=t.body;if(n.kind===`List`&&n.bullet===`Or`)return Ur({...n,items:n.items.map(e=>({...t,body:e}))});if(et(n,`Disj`)){if(n.args.length!==2)throw new e.j;return Ur({...n,args:n.args.map(e=>({...t,body:e}))})}}return wr(t,Ur)},Wr=(e,t,n,r,i)=>{let a=jr(i,t,n,r,void 0),o=zr(e,t,n,a,i,!0);return Ur(Hr(i,t,n,o,!1))},Gr=(t,n,r,i)=>{try{let r=Vr(t.anonymizer,t.onWarning,n,{kind:`Sequent`,sequent:i});if(r.kind!==`Sequent`)throw new e.j;return r.sequent}catch(n){if(!(n instanceof e.C)||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: ${Xe(a)}`;return t.onWarning({text:`${Ze(a)}[ERROR]${o}`,channel:`stdout`}),t.onWarning({text:o,channel:`toolboxOnly`}),{context:[],active:A({kind:`Internal`,builtin:`TRUE`},i.active)}}},Kr=(e,t,n)=>{if(n.kind===`Theorem`)return{...n,sequent:Gr(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=Vr(e.anonymizer,e.onWarning,t,r.body);return{...n,definition:{...r,body:i}}},qr=(e,t,n)=>at(t,n,(t,n)=>{if(n.kind===`Submod`){let[r,i]=qr(e,t,n.module.body);return[r,{...n,module:{...n.module,body:i}}]}let r=Kr(e,t,n);return[N(t,Nn(r)),r]}),Jr=(t,n)=>{let r=[],i=0,a=t;for(;a.length>0;){let[t,...o]=a,s=t.kind===`Constants`?{name:t.declarations[0].name,remaining:{...t,declarations:t.declarations.slice(1)}}:t.kind===`Variables`?{name:t.names[0],remaining:{...t,names:t.names.slice(1)}}:void 0;if(s){let t=n.get(s.name);if(!t)throw new e.C(`Parameter ${s.name} has no substitute`);let r=Pn(s.remaining)===0;a=Un(bt(R(i,t),I(0)),r?o:[s.remaining,...o])}else r.push(t),i+=Pn(t),a=o}return r},Yr=(e,t,n)=>{let r=Array.from({length:t},(e,r)=>A({kind:`Ix`,index:t-r},{location:n})),i=Array.from({length:t},(e,t)=>A({kind:`Ix`,index:t+1},{location:n})),a=Array.from({length:e},(e,i)=>{let a=A({kind:`Ix`,index:i+t+1},{location:n});return t>0?A({kind:`Apply`,operator:a,args:r},{location:n}):a});return xt([...a,...i].reverse(),I(e+t))},Xr=(e,t)=>{let n=t.map(e=>({name:e,shape:0}));return e.kind===`Lambda`?{...e,params:[...n,...e.params]}:t.length===0?e:A({kind:`Lambda`,params:n,body:e},e)},Zr=(t,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=e=>{f||(f=!0,t.onWarning({text:e,channel:`stderr`}))};for(;d.length>0;){let[n,...r]=d;d=r;let f=e=>Xr(L(Yr(u,c,o),e),i.args);switch(n.kind){case`Definition`:{let r=n.definition;if(r.kind!==`Operator`&&r.kind!==`Bpragma`)throw new e.C(`Module.Elab.localize`);let i=n.isLocal?`${r.name}$${bn(t.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(`${Qe(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+=Pn(e);continue}case`Theorem`:{p(`${Ze(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(A(tt(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=Un(I(-n.usable.facts.length),d));continue;case`Submod`:continue;default:throw new e.C(`Module.Elab.localize`)}}return l},Qr=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=ct(e.name===void 0?R(1,e.expression):A({kind:`Ix`,index:2},e),`Visible`,`Always`,i),o=0,s=r.map(e=>{let t=o;if(o+=Pn(e),e.kind!==`Theorem`)return e;let n=kt(I(1),e.sequent);return{...e,sequent:{...n,context:[Ot(I(t),a),...n.context]},axiomCount:e.axiomCount+1}});n=Un(I(-1),s)}return t},$r=e=>new Set(e.body.flatMap(e=>e.kind===`Constants`?e.declarations.map(e=>e.name):e.kind===`Variables`?e.names:[])),ei=(t,n,r,i,a,o,s)=>{let c=n.get(i.module);if(!c)throw new e.C(`Module "${i.module}" unknown`);let l=$r(c);for(let t of i.substitutions)if(!l.has(t.name))throw new e.C(`Parameter ${t.name} occurs in the statement \`INSTANCE ${i.module} WITH\`, and is not declared in the module ${i.module}`);let u=N(r,i.args.map(e=>ot(e,`Unknown`))),d=new Map(i.substitutions.map(e=>[e.name,e.expression]));for(let t of[...l].sort(Bn))if(!d.has(t)){if(!rt(u,t))throw new e.C(`Required parameter ${t} for module ${i.module} could not be inferred.`);d.set(t,A({kind:`Opaque`,name:t},{location:s}))}let f=new Map([...d].map(([e,n])=>[e,t.anonymizer.expr(u,n)])),p=Un(I((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]=qr(t,u,p);return Qr(Zr(t,Jr(m,f),o,i,a,s))},ti=(t,n,r)=>{let i=r.instance.module;if(!t.latestModules.has(i))throw t.onWarning({text:`${Qe(r.instance.location)}Module ${JSON.stringify(i)} unknown\n`,channel:`toolbox`}),new e.C(`Module ${JSON.stringify(i)} unknown`,{failure:`Module.Elab.anon#defns`});let a=ei(t,t.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=Un(I(-Pn(e)),t)}return o},ni=(e,t,n,r)=>{let i=[],a=n,o=e=>{i.push(e),a=N(a,Nn(e))},s=e=>e!==void 0&&rt(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=ei(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=Nn(s)[0],d=rt(a,t.name);if(d?.hyp.kind===`Defn`&&(d.hyp.definition.kind===`Recursive`||It(Ot(I(d.depth+1),d.hyp),u))){let e=c.slice(n+1),t=Un(bt(A({kind:`Ix`,index:d.depth+1},i),I(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=Wn(c,u,i.location),f=N(N(a,d.hyps.map(e=>({...e,isConstnessUnset:!0}))),d.sequent.context),p=e.anonymizer.proof(f,l),m=r.isImportant?e.simplify(nt(f),d.sequent.active,p,vn(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:ni(e,t,a,i.module)});continue}}let l={...r,body:i,depth:n?.size??0};return t.set(r.name,l),l},ri=1000000010,ii=new TextEncoder,ai=e=>{for(let t=0;t<e.length;t++)if(e.charCodeAt(t)>127)return ii.encode(e).length;return e.length},oi=()=>({leftTotal:-1,element:{size:-1,token:{kind:`Text`,text:``},length:0}}),si=e=>{let t={size:-1,token:{kind:`Begin`,indent:0,box:`hov`},length:0};return{queue:[t],queueStart:0,scanStack:[oi(),{leftTotal:1,element:t}],formatStack:[],margin:78,maxIndent:e,spaceLeft:78,currentIndent:0,isNewLine:!0,leftTotal:1,rightTotal:1,depth:1,output:[]}},ci=(e,t)=>{e.rightTotal+=t.length,e.queue.push(t)},li=(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))},ui=(e,t)=>{e.spaceLeft-=t,e.output.push(` `.repeat(t))},di=e=>{let t=e.formatStack.at(-1);t?t.width>e.spaceLeft&&t.box!==`fits`&&t.box!==`h`&&li(e,0,t.width):e.output.push(`
25
+ `)},fi=(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&&di(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?li(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?li(e,n.offset,i):ui(e,n.width);return;case`b`:e.isNewLine?ui(e,n.width):t>e.spaceLeft||e.currentIndent>e.margin-i+n.offset?li(e,n.offset,i):ui(e,n.width);return;case`hv`:case`v`:li(e,n.offset,i);return;case`fits`:case`h`:ui(e,n.width);return}}}},pi=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++,fi(e,n?t.size:ri,t.token),e.leftTotal+=t.length}e.queue.length=0,e.queueStart=0},mi=(e,t)=>{ci(e,t),pi(e)},hi=(e,t)=>{let n=e.scanStack.at(-1);n&&(n.leftTotal<e.leftTotal?e.scanStack=[oi()]:n.element.token.kind===(t?`Break`:`Begin`)&&(n.element.size=e.rightTotal+n.element.size,e.scanStack.pop()))},gi=(e,t,n)=>{ci(e,n),t&&hi(e,!0),e.scanStack.push({leftTotal:e.rightTotal,element:n})},_i=(e,t,n)=>{e.depth++,gi(e,!1,{size:-e.rightTotal,token:{kind:`Begin`,indent:n,box:t},length:0})},vi=e=>{e.depth<=1||(ci(e,{size:0,token:{kind:`End`},length:0}),hi(e,!0),hi(e,!1),e.depth--)},yi=(e,t,n)=>mi(e,{size:t,token:{kind:`Text`,text:n},length:t}),bi=(e,t,n)=>gi(e,!0,{size:-e.rightTotal,token:{kind:`Break`,width:t,offset:n},length:t}),xi=e=>mi(e,{size:0,token:{kind:`Newline`},length:0}),Si=e=>{for(;e.depth>1;)vi(e);return e.rightTotal=ri,pi(e),e.output.join(``)},Ci=e=>{Si(e);let t=[...e.output,`
27
+ `];Object.assign(e,si(e.maxIndent)),e.output=t},wi={h:`h`,v:`v`,hv:`hv`,hov:`hov`,b:`b`},Ti=e=>({kind:`Text`,text:e,size:ai(e)}),V=e=>e===``?[]:[Ti(e)],Ei={kind:`Break`,width:1,offset:0},Di={kind:`Break`,width:0,offset:0},Oi=e=>{let t=e.search(/\d|$/);return{kind:`Open`,box:wi[e.slice(0,t)],indent:Number(e.slice(t)||0)}},H=(e,...t)=>{let n=[],r=0,i=``,a=()=>{i!==``&&(n.push(Ti(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(Ti(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(Oi(e.slice(o+3,t))),o=t;break}case`]`:n.push({kind:`Close`}),o++;break;case` `:n.push(Ei),o++;break;case`,`:n.push(Di),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},U=(e,t,n=[Ti(`,`),Ei])=>e.flatMap((e,r)=>r===0?[t(e)]:[n,t(e)]),ki=(e,t)=>{for(let n of t)if(Array.isArray(n))ki(e,n);else switch(n.kind){case`Open`:_i(e,n.box,n.indent);break;case`Close`:vi(e);break;case`Text`:yi(e,n.size,n.text);break;case`Break`:bi(e,n.width,n.offset);break;case`Newline`:xi(e);break;case`Flush`:Ci(e)}},Ai=(e,t=68)=>{let n=si(t);return ki(n,e),Si(n)},ji=[[`=>`,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`,[]]],Mi=/* @__PURE__ */ new Map;for(let[e,t,n,r,i]of ji){let a={name:e,low:t,high:n,fixity:r};for(let t of[e,...i])Mi.set(t,a)}const Ni=e=>({name:e,low:-1,high:-1,fixity:`Nonfix`}),Pi=e=>Mi.get(e)??Ni(e),Fi={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:`@@`},Ii=e=>{if(e===`Divides`)return{name:`?|`,low:10,high:11,fixity:`InfixNon`};if(e===`Uminus`)return{...Pi(`-.`),name:`-`};let t=Fi[e];return t?Pi(t):Ni(e)},Li=e=>e.salt===0?e.rep:`${e.rep}_${e.salt}`,Ri=()=>({stack:[],idents:/* @__PURE__ */ new Map,defined:/* @__PURE__ */ new Map}),zi=(e,t)=>{let n=e.stack[e.stack.length-t];return n&&Li(n)},Bi=(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(Li(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=Li(r);return e.defined.set(a,(e.defined.get(a)??0)+1),a},Vi=(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=Li(t),r=(e.defined.get(n)??1)-1;r===0?e.defined.delete(n):e.defined.set(n,r)}},Hi=(e,t,n)=>{let r=n(t.map(t=>Bi(e,t)));return Vi(e,t.length),r},Ui=(e,t)=>t.kind===`Atm`||t.kind===`Op`&&e<t.low,Wi=e=>[H(`(`),e,H(`)`)],Gi=(e,t)=>t?Ki(e):Wi(Ki(e)),Ki=e=>{if(e.kind!==`Op`)return e.doc;let t=e.skeleton,n=t=>Ui(e.high,t);switch(t.kind){case`Prefix`:case`Postfix`:{let r=t.operand,i=Gi(r,n(r)||r.kind===`Op`&&r.skeleton.kind===t.kind),a=t.kind===`Prefix`?[e.doc,i]:[i,e.doc];return[H(`@[<h>`),...a,H(`@]`)]}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[H(`@[<b0>`),Gi(r,a),e.doc,Gi(i,o),H(`@]`)]}}},qi=e=>({kind:`Atm`,doc:e}),Ji=e=>({kind:`Big`,doc:e}),Yi=e=>e.kind===`Lambda`?Yi(e.body):e.kind===`Sequent`?Yi(e.sequent.active):e.kind===`With`,Xi=e=>{if(e.kind===`Defn`){let t=e.definition,n=t.kind===`Operator`&&Yi(t.body);return e.visibility===`Hidden`||n||e.whereDefined!==`User`}return e.kind===`Fact`?e.visibility===`Hidden`||Yi(e.expression):!1},Zi=e=>e===0?[]:H(`@[<hov1>(%a)@]`,U(Array.from({length:e},()=>`_`),V)),Qi=e=>H(`%s%a`,e.name,Zi(e.shape)),$i={Constant:`CONSTANT`,State:`STATE`,Action:`ACTION`,Temporal:`TEMPORAL`,Unknown:`UNKNOWN`},ea=(t=[])=>{let n=Ri(),r=e=>Ki(u(e)),i=(e,t)=>Hi(n,e.map(e=>e.name),()=>H(`@[<b2>LAMBDA @[<hv0>%a@] :@ %a@]`,U(e,Qi),r(t))),a=(e,t)=>{let i=e.map(e=>e.domain.kind===`Domain`?r(e.domain.expression):void 0);return Hi(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(U(r,t=>{let n=U(t.names,V),r=e[t.index].domain;return r.kind===`NoDomain`?n:r.kind===`Ditto`?H(`@[<hov0>%a@ \\in ??????@]`,n):H(`@[<hov0>%a@ \\in %a@]`,n,i[t.index]??[])}))})},o=e=>{switch(e.kind){case`Down`:return H(`:`);case`Left`:return H(`<<`);case`Right`:return H(`>>`);case`At`:return V(`@`);case`Number`:return V(String(e.value));case`Instance`:return H(`@[<b1>(%a)@]`,U(e.args,r));case`Label`:return e.args.length===0?V(e.label):H(`@[<b2>%s@,@[<b1>(%a)@]@]`,e.label,U(e.args,r))}},s=e=>e.length===0?[]:[H(`!`),U(e,o,H(`!`))],c=e=>{if(e<0)return`#$$${Math.abs(e)}`;if(e===0)return`#$0`;if(e<=n.stack.length)return zi(n,e);let r=t[t.length-(e-n.stack.length)];return r?$e(r)??`??? FACT ???`:`#$${e}`},l=(t,n)=>{if(t.kind===`Lambda`)return{kind:`Op`,name:` `,doc:H(`@ `),low:20,high:20,skeleton:{kind:`Infix`,assoc:`Left`,left:Ji(i(t.params,t.body)),right:qi(H(`(%a)`,U(n,r)))}};if(t.kind===`Bang`)return n.length===0?u(t):qi(H(`@[<b2>%a@[<b1>(%a)@]@]`,r(t),U(n,r)));if(t.kind===`Internal`&&n.length===1){if(t.builtin===`BoxFalse`||t.builtin===`Unprimable`)return u(n[0]);if(t.builtin===`Irregular`)return qi(H(`@[<h>@<1>%s%a@<1>%s@]`,`<[`,r(n[0]),`]>`))}let a=(()=>{switch(t.kind){case`Ix`:return Pi(c(t.index));case`Opaque`:{let e=Pi(t.name);return{...e,name:`?${e.name}`}}case`Internal`:return Ii(t.builtin);default:throw new e.C(`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 qi(V(a.name));if(a.fixity===`Nonfix`)return qi(H(`@[<b2>%s@[<b1>(%a)@]@]`,a.name,U(n,r)));if(a.fixity===`Prefix`&&n.length===1)return o(/[A-Za-z]$/.test(a.name)?H(`%s@ `,a.name):V(a.name),{kind:`Prefix`,operand:u(n[0])});if(a.fixity===`Postfix`&&n.length===1)return o(V(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===`..`?V(a.name):H(`@ %s `,a.name),{kind:`Infix`,assoc:e,left:u(n[0]),right:u(n[1])})}throw new e.C(`Arity mismatch for operator ${a.name}`)},u=t=>{switch(t.kind){case`Ix`:case`Opaque`:case`Internal`:return l(t,[]);case`Lambda`:return Ji(i(t.params,t.body));case`Bang`:return qi([r(t.expression),s(t.selectors)]);case`Apply`:return l(t.operator,t.args);case`Sequent`:return Ji(p(t.sequent));case`With`:return u(t.expression);case`If`:return Ji(H(`@[<hv2>@[<b2>IF@ %a@]@ @[<b2>THEN %a@]@ @[<b2>ELSE %a@]@]`,r(t.condition),r(t.consequent),r(t.alternative)));case`List`:{if(t.bullet===`Refs`&&t.items.length===0)return qi(H(`TRUE`));if(t.bullet===`Refs`&&t.items.length===1)return u(t.items[0]);let e=t.bullet===`Or`?`\\/`:`/\\`;return Ji(H(`@[<v0>%a@]`,U(t.items,t=>H(`@[<h>%s %a@]`,e,r(t)),H(`@,`))))}case`Let`:{let e=U(t.definitions,d,H(`@,`)),i=r(t.body);return Vi(n,t.definitions.length),Ji([H(`@[<hv0>LET @[<v0>`),e,H(`@]@
29
+ IN %a@]`,i)])}case`Quant`:return a(t.bounds,e=>Ji(H(`@[<b3>%s @[<b0>%a@] :@ %a@]`,t.quantifier===`Forall`?`\\A`:`\\E`,e,r(t.body))));case`Tquant`:return Hi(n,t.names,e=>Ji(H(`@[<b4>%s @[<b0>%a@] : %a@]`,t.quantifier===`Forall`?`\\AA`:`\\EE`,U(e,V),r(t.body))));case`Choose`:{let e=t.domain&&r(t.domain);return Hi(n,[t.name],([n])=>Ji(e?H(`@[<b2>CHOOSE @[<b2>%s \\in@ %a@] :@ %a@]`,n,e,r(t.body)):H(`@[<b2>CHOOSE %s :@ %a@]`,n,r(t.body))))}case`SetSt`:{let e=r(t.domain);return Hi(n,[t.name],([n])=>qi(H(`@[<b3>{@[<b2>%s \\in@ %a@] :@ %a}@]`,n,e,r(t.body))))}case`SetOf`:return a(t.bounds,e=>qi(H(`@[<b3>{%a :@ %a}@]`,r(t.element),e)));case`SetEnum`:return qi(H(`@[<h>{@[<b0>%a@]}@]`,U(t.elements,r)));case`Arrow`:return qi(H(`@[<b3>[%a ->@ %a]@]`,r(t.domain),r(t.range)));case`Fcn`:return a(t.bounds,e=>qi(H(`@[<b3>[%a |->@ %a]@]`,e,r(t.body))));case`FcnApp`:{let e=u(t.function),n=e.kind===`Atm`;return qi(H(`@[<h>%s%a%s@[<b1>[%a]@]@]`,n?``:`(`,Ki(e),n?``:`)`,U(t.args,r)))}case`Product`:if(t.factors.length===1)return u(t.factors[0]);if(t.factors.length===0)throw new e.C(`Expr.Fmt.fmt_expr: PRODUCT []`);return{kind:`Op`,name:`\\X`,doc:H(`@ \\X `),low:10,high:13,skeleton:{kind:`Infix`,assoc:`Right`,left:u(t.factors[0]),right:u({...t,factors:t.factors.slice(1)})}};case`Tuple`:return qi(H(`@[<b2><<%a>>@]`,U(t.elements,r)));case`Rect`:case`Record`:{let e=t.kind===`Rect`?`:`:`|->`;return qi(H(`@[<b1>[%a]@]`,U(t.fields,t=>H(`@[<h>%s ${e} %a@]`,t.name,r(t.value)))))}case`Except`:return qi(H(`@[<b3>[%a EXCEPT@ @[<v0>%a@]]@]`,r(t.function),U(t.specs,e=>H(`!@[<h>%a = %a@]`,e.trail.map(e=>e.kind===`Dot`?H(`.%s`,e.field):H(`[%a]`,r(e.expression))),r(e.value)))));case`Dot`:return{kind:`Op`,name:`.`,doc:H(`.`),low:16,high:16,skeleton:{kind:`Infix`,assoc:`Left`,left:u(t.expression),right:qi(V(t.field))}};case`Sub`:case`Tsub`:{let e=t.modal===`Box`,n=t.kind===`Sub`?e?`[`:`<<`:e?`[][`:`<><<`;return qi(H(`@[<h>%s@[<b2>%a@]%s%a@]`,n,r(t.action),e?`]_`:`>>_`,r(t.subscript)))}case`Fair`:return Ji(H(`@[<h>%s_%a (%a)@]`,t.fairness===`Weak`?`WF`:`SF`,Wi(r(t.subscript)),r(t.action)));case`Case`:return Ji(H(`@[<v2>CASE %a%a@]`,U(t.arms,e=>H(`@[<b2>%a ->@ %a@]`,r(e.condition),r(e.body)),H(`@,[] `)),t.other?H(`@,[] @[<b2>OTHER ->@ %a@]`,r(t.other)):[]));case`String`:return qi(H(`"%s"`,t.value));case`Num`:return qi(V(t.fraction===``?t.integer:`${t.integer}.${t.fraction}`));case`At`:return qi(V(`@`));case`Parens`:{let e=t.form;if(e.kind===`Syntax`)return u(t.expression);let r=e.kind===`Nlabel`?e.names:e.indices.map(e=>e.index>=1&&e.index<=n.stack.length?c(e.index):`¶${e.index}`),i=u(t.expression);if(r.length===0){let t=i.kind===`Op`?`%s::(%a)`:`%s::%a`;return qi(H(t,e.label,Ki(i)))}let a=U(r,V),o=i.kind===`Atm`?`%s(%a)::%a`:i.kind===`Big`?`%s(%a)::(%a)`:`(%s(%a):: %a)`;return qi(H(o,e.label,a,Ki(i)))}}},d=e=>{switch(e.kind){case`Operator`:case`Bpragma`:{let t=e.body;if(t.kind===`Lambda`){let i=Hi(n,t.params.map(e=>e.name),()=>r(t.body)),a=Bi(n,e.name);return H(`@[<b2>%s@[<b1>(%a)@] ==@ %a@]`,a,U(t.params,Qi),i)}let i=r(t);return H(`@[<b2>%s ==@ %a@]`,Bi(n,e.name),i)}case`Instance`:{let t=e.instance,i=Hi(n,t.args,e=>({doc:H(`@[<b2>INSTANCE %s%a@]`,t.module,t.substitutions.length===0?[]:H(`@ WITH@ %a`,U(t.substitutions,e=>H(`@[<b2>%s <- %a@]`,e.name,r(e.expression))))),args:e})),a=Bi(n,e.name),o=t.args.length===0?V(a):H(`%s (@[<b0>%a@])`,a,U(i.args,V));return H(`@[<b2>%a == %a@]`,o,i.doc)}case`Recursive`:{let t=Bi(n,e.name);return H(`@[<b2>NEW CONSTANT %s%a@]`,t,Zi(e.shape))}}},f=e=>{switch(e.kind){case`Fresh`:{let t=e.domain&&e.domainVisibility===`Visible`?r(e.domain):void 0,i=Bi(n,e.name);return[H(`NEW %s %s%a`,$i[e.level],i,Zi(e.shape)),t?H(` \\in %a`,t):[]]}case`Flex`:return H(`NEW VARIABLE %s`,Bi(n,e.name));case`Defn`:return d(e.definition);case`Fact`:{let t=H(`@[<h>%a @]`,r(e.expression));return Bi(n,``),t}}},p=e=>{if(e.context.length===0)return r(e.active);let t=[];for(let r of e.context)Xi(r)?Bi(n,$e(r)??``):t.push(f(r));let i=r(e.active);return Vi(n,e.context.length),t.length===0?i:[H(`@[<v0>ASSUME @[<v0>`),U(t,e=>e),H(`@]@
30
+ PROVE %a@]`,i)]};return{printSequent:p,printExpr:r}},ta=(e,t)=>ea(e).printExpr(t),na=e=>ea().printSequent(e),ra=e=>Ai(H(`@[<b0>%a@]`,na(e))).trimEnd(),ia=e=>({location:e.location,step:e.step,method:e.method}),aa=e=>e?.level??0,oa=(e,t)=>et(e,t)&&e.args.length===2,sa=(e,...t)=>Ai(H(e,...t)),ca=e=>la(e).map((e,t)=>{let n=e.domain.kind===`Domain`?R(t,e.domain.expression):void 0;return{kind:`Fresh`,name:e.name,shape:0,level:n?`Constant`:e.level,domain:n,domainVisibility:`Visible`}}),la=e=>{let t={kind:`NoDomain`};return e.map(e=>e.domain.kind===`Ditto`?{...e,domain:t}:(t=e.domain,e))},ua=(e,t)=>{let n=Et(I(1),t)[1];return n[0].domain.kind===`Ditto`&&e.domain.kind===`Domain`?[{...n[0],domain:{kind:`Domain`,expression:R(1,e.domain.expression)}},...n.slice(1)]:n},da=(e,t)=>{if(t.length===0)return{kind:`Obvious`,...ia(e)};let n=t.map((t,n)=>{let r=R(2*n+2,t);return{kind:`Assert`,sequent:{context:[],active:r},proof:{kind:`By`,usable:{facts:[R(3,r)],defs:[]},isOnly:!1,location:t.location,method:e.method},location:t.location}}),r={kind:`By`,usable:{facts:[A({kind:`Ix`,index:2*t.length+2},e),...t.map((n,r)=>A({kind:`Ix`,index:2*(t.length-r)},e))],defs:[]},isOnly:!0,...ia(e),method:void 0};return{kind:`Steps`,steps:n,qed:{proof:r,location:r.location},...ia(e)}},fa=(e,t)=>e.kind===`At`&&!e.isExcept?A(ft(t),e):vt(e,e=>fa(e,t)),pa=t=>{let n=e=>({kind:`Named`,level:e,label:`_a${bn(t)}`,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=(t,n)=>{let r=n.kind===`Apply`?n.operator:n;if(r.kind===`Ix`){let i=t[t.length-r.index];if(!i)throw new e.C(`expose_connective`);if(i.kind!==`Defn`||i.definition.kind!==`Operator`)return n;let a=R(r.index,i.definition.body);if(n.kind!==`Apply`)return o(t,a);let s={...a,location:n.location};return o(t,A(Tt(s,n.args),s))}if(et(n,`Prime`)){let e=o(t,n.args[0]),r=e=>j(`Prime`,[e],e);return e.kind===`Quant`?A({kind:`Quant`,quantifier:e.quantifier,bounds:pt(e.bounds,r),body:r(e.body)},n):oa(e,`Implies`)||oa(e,`Mem`)?A({kind:`Apply`,operator:e.operator,args:[r(e.args[0]),r(e.args[1])]},n):r(e)}return n.kind===`Parens`?o(t,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=fa(e.sequent.active,R(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:[R(t,e)],defs:[]},isOnly:!1,location:e.location,useLocation:a.location})),i=a.isOnly?[{kind:`Forget`,count:e.facts.length,location:a.location}]:[],o=aa(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]=at({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=(t,n,r,i)=>{let s=aa(r.step);switch(r.kind){case`Forget`:return[t,n,[r],i];case`Assert`:{let e=Xn(t,r.sequent,r,i),a={...r,proof:l(e.context,e.active,r.proof,e.time)},o=Zn(!1,t,n,r.sequent,a,i);return[o.context,o.active,[a],i]}case`Suffices`:{let e=Zn(!0,t,n,r.sequent,r,i),a={...r,proof:l(e.context,e.active,r.proof,i)},o=Xn(t,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(t,n,a,i);if(o.kind!==`Steps`)throw new e.C(`simplifying BY does not produce a non-leaf proof!`);let s=r.usable.facts.map(()=>ct(Gn,`Visible`,i,r.location));return[[...t,...s],R(r.usable.facts.length,n),o.steps,i]}case`Hide`:return[r.usable.defs.reduce((t,n)=>{if(n.kind!==`Dx`)throw new e.C(`set_vis`);let i=t.length-n.index,a=t[i];if(a?.kind!==`Defn`){let t=a?a.kind===`Fact`?`??? FACT ???`:a.name:``;throw new e.C(`USE DEF ${t} invalid because ${t} is not a defined operator`)}return t.map((e,t)=>t===i?{...a,visibility:`Hidden`,location:r.location}:e)},t),n,[r],i];case`Define`:return[[...t,...r.definitions.map(e=>({kind:`Defn`,definition:e,whereDefined:{kind:`Proof`,time:i},visibility:`Visible`,isLocal:!0,location:r.location}))],R(r.definitions.length,n),[r],i];case`Have`:{let e=o(t,n),c=oa(e,`Implies`),l={context:[ct(r.expression,`Visible`,i,r.location)],active:c?R(1,e.args[1]):e},d=c?{kind:`By`,usable:{facts:[A({kind:`Ix`,index:2},r)],defs:[]},isOnly:!0,...ia(r)}:{kind:`Error`,message:sa(`@.@[<v2>@[%s@ %s@]@,%a@]@.`,`Error: this HAVE step is applied to the following goal,`,`which is not an implication:`,ta(t,n)),...ia(r)},f=a(s,{kind:`Suffices`,sequent:l,proof:d,location:r.location,step:r.step});return u(t,n,f,i)}case`Take`:return u(t,n,a(s,f(t,n,r)),i);case`Witness`:return u(t,n,a(s,p(t,n,r)),i);case`Pcase`:{let e={kind:`Assert`,sequent:{context:[ct(r.expression,`Visible`,i,r.location)],active:R(1,n)},proof:r.proof,...ia(r)};return u(t,n,a(s,e),i)}case`Pick`:{let a=A({kind:`Quant`,quantifier:`Exists`,bounds:r.bounds,body:r.expression},r),o=d(r.step,`ex`),[s,c,l,f]=u(t,n,{kind:`Assert`,sequent:{context:[],active:a},proof:r.proof,...ia(r),step:o},i),p=R(2,a);if(p.kind!==`Quant`)throw new e.C(`Proof.Simplify.simplify_step/PICK`);let m=[...ca(p.bounds),ct(p.body,`Visible`,f,p.body.location)],[h,g,_,v]=u(s,c,{kind:`Suffices`,sequent:{context:m,active:R(m.length,c)},proof:{kind:`Omitted`,omission:`Elsewhere`,...ia(r)},...ia(r)},f);return[h,g,[...l,..._],v]}}},d=(e,n)=>({kind:`Named`,level:aa(e),label:`${e?.kind===`Named`?e.label:`_a`}${n}${bn(t)}`,isAnonymous:!1}),f=(e,t,n)=>{let r=la(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 sa(`@.@[<v2>@[<b0>%s@ %s@]@,%a@]@.`,`Error: this TAKE step is applied to the following goal,`,`which is not a universal formula:`,ta(e,r));let l=c.bounds[0],u=la(c.bounds).slice(1),d=s.domain,f=l.domain;if(d.kind===`NoDomain`&&f.kind===`Domain`)return sa(`@.@[<b0>%s (%s)@ %s (%s \\in %a)@]@.`,`Error: the TAKE argument`,s.name,`does not match the pattern`,l.name,ta(e,f.expression));if(d.kind===`Domain`&&f.kind===`NoDomain`)return sa(`@.@[<b0>%s (%s \\in %a)@ %s (%s)@]@.`,`Error: the TAKE argument`,s.name,ta(e,d.expression),`does not match the pattern`,l.name);let p=d.kind===`Domain`&&f.kind===`Domain`&&!z(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=>Et(I(t),[e])[1][0]):u;return i(t+1,p,A({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:[ct(qn(t),`Visible`,`Now`,n.location)],active:t},proof:{kind:`Error`,message:a,...ia(n)},...ia(n)};let s=a.sideFacts.filter((e,t)=>a.sideFacts.findIndex(t=>z(e,t))===t),c=[A({kind:`Ix`,index:2},n),...s.map(e=>R(2,e))];return{kind:`Suffices`,sequent:{context:ca(r),active:a.goal},proof:{kind:`By`,usable:{facts:c,defs:[]},isOnly:!0,...ia(n)},...ia(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||=sa(`@.@[<v2>@[<b0>%s@ %s@]@,%a@]@.`,`Error: this WITNESS step is applied to the following goal,`,`which is not an existential formula:`,ta(e,n)),a=n;break}let[s,...c]=n.bounds,l=c.length===0?n.body:A({kind:`Quant`,quantifier:`Exists`,bounds:ua(s,c),body:n.body},n),u=t;if(s.domain.kind===`Domain`){let n=s.domain.expression,a=o(e,t);if(oa(a,`Mem`)){let[e,t]=a.args,i=z(t,n)?[]:[j(`Subseteq`,[t,n],t)];r.push(...i,a),u=e}else i||=sa(`@.@[<b0>%s (%a)@ %s (%s \\in %a)@]@.`,`Error: the WITNESS argument`,ta(e,a),`does not match the pattern`,s.name,ta(e,n)),u=a}let d=j(`Unprimable`,[u],u);a=L(bt(d,I(0)),l)}let s=i===``?da(n,r):{kind:`Error`,message:i,...ia(n)};return{kind:`Suffices`,sequent:{context:[],active:a},proof:s,...ia(n)}};return l},ma=[`(`,`)`,`;`,`:`,`@`,`,`],ha=e=>e===` `||e===`\r`||e===` `,ga=(e,t)=>{for(;t.line<e.length;){let n=e[t.line];for(;ha(n[t.column]);)t.column++;if(t.column<n.length)return;t.line++,t.column=0}},_a=(e,t)=>{let n={...t};return ga(e,n),(e[n.line]??``).startsWith(`(*{`,n.column)?n:void 0},va=(e,t)=>{let n=_a(e,t);if(!n)return;let r={line:n.line,column:n.column+3},i=[];for(ga(e,r);r.line<e.length;ga(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(!ma.includes(t[0]))return;i.push({kind:`Punct`,text:t[0]}),r.column++}}},ya=(e,t)=>e?.kind===`Punct`&&e.text===t,ba=e=>e?.kind===`String`?{kind:`String`,value:e.text}:e?.kind===`Number`?{kind:`Float`,value:Number.parseFloat(e.text)}:ya(e,`@`)?{kind:`Default`}:void 0,xa=/* @__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`]]),Sa=(e,t)=>{let n=va(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(!ya(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 ya(n[r],`(`)&&!a()?void 0:{name:e.text,...t}}let t=xa.get(e.text);return t===void 0?void 0:{name:t}})();if(t&&ya(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},Ca=(e,t)=>{let n=va(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`||!ya(n[r],`(`))return;r++;let t=[];for(;;){let e=n[r++];if(e?.kind!==`Ident`||!ya(n[r],`:`))return;r++;let i=ba(n[r++]);if(!i)return;if(t.push({hint:e.text,value:i}),ya(n[r],`)`))break;if(!ya(n[r],`;`))return;r++}r++,i.push(t)}return i},wa=e=>({kind:`Opaque`,name:e}),Ta=e=>({kind:`Tuple`,elements:e.map(wa)}),Ea=(e,t)=>({kind:`Apply`,operator:{kind:`Internal`,builtin:`Eq`},args:[e,t]}),Da=e=>e.map(e=>({name:e,level:`Constant`,domain:{kind:`NoDomain`}})),Oa=(e,t)=>e?.kind===`Product`&&e.factors.length===t.length?e.factors:void 0,ka=(e,t)=>t.map((t,n)=>({kind:`Operator`,name:t,body:{kind:`FcnApp`,function:wa(e),args:[{kind:`Num`,integer:String(n+1),fraction:``}]}})),Aa=(e,t)=>e.map((e,n)=>({name:e,level:`Constant`,domain:{kind:`Domain`,expression:t[n]}})),ja=e=>({name:e.name,level:`Constant`,domain:e.domain}),Ma=(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`?[ja(e)]:[]));let a=Oa(i.domain,i.names);if(a)return r(Aa(i.names,a));let o={kind:`Apply`,operator:{kind:`Internal`,builtin:e===`Exists`?`Mem`:`Notmem`},args:[Ta(i.names),i.domain]};return r(Da(i.names),{kind:`List`,bullet:e===`Exists`?`And`:`Or`,items:[o,t]})},n)},Na=(e,t,n)=>{let r=`${e.kind.toLowerCase()}#${t[0]}`;return{...e,name:r,body:Oa(e.domain,t)?{kind:`Let`,definitions:ka(r,t),body:n}:{kind:`Quant`,quantifier:`Exists`,bounds:Da(t),body:{kind:`List`,bullet:`And`,items:[Ea(wa(r),Ta(t)),n]}}}},Pa=(e,t,n)=>{let r=e.map(e=>{if(e.kind===`Name`)return{bounds:[ja(e)],definitions:[]};let t=Oa(e.domain,e.names);if(t&&n)return{bounds:Aa(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:ka(r,e.names)};let a=`choose#${r}`;return{bounds:[i],definitions:[{kind:`Operator`,name:a,body:Na({kind:`Choose`,domain:void 0},e.names,Ea(wa(r),Ta(e.names)))},...ka(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}}},Fa=(e,t)=>{let n=Pa(t,e,!0);return{kind:`SetOf`,element:n.value,bounds:n.bounds}},Ia=(e,t)=>{let n=Pa(e,t,!1);return{kind:`Fcn`,bounds:n.bounds,body:n.value}},La={Always:`[]`,Eventually:`<>`,Enabled:`ENABLED`,Unchanged:`UNCHANGED`},Ra=(e,t)=>e!==void 0&&t!==void 0&&e.line===t.line&&e.column===t.column,za=e=>e.location.range?.start,Ba=e=>e.location.range?.end,Va=(e,t)=>{let n=e.location.range;return n&&t?{...e,location:{...e.location,range:{...n,end:t}}}:e},Ha=e=>{if(e.kind===`Apply`){let t=Pi(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=La[e.kind];if(t!==void 0&&`expression`in e)return{operator:Pi(t),isInfix:!1,operand:e.expression,replace:t=>({...e,expression:t})}},Ua=(e,t)=>e.high<t.low,Wa=e=>{let t=Pi(e.operator),[n,r]=e.args,i=Ba(e),a=t=>{let n=e.location.range,i=za(t);return{...e,args:[t,r],location:n&&i?{...e.location,range:{...n,start:i}}:e.location}},o=(e,n)=>{let r=n?Ha(e):void 0;if(!r)return{kind:`Reduced`,isFinal:!1};let s=o(r.operand,Ra(Ba(r.operand),Ba(e)));return s.kind===`Attached`?{kind:`Attached`,expression:Va(r.replace(s.expression),i)}:!s.isFinal&&(Ua(t,r.operator)||r.isInfix&&t.fixity===`InfixLeft`&&r.operator.fixity===`InfixLeft`&&!Ua(r.operator,t))?{kind:`Reduced`,isFinal:!Ua(t,r.operator)}:{kind:`Attached`,expression:Va(r.replace(a(r.operand)),i)}},s=o(n,Ra(za(n),za(e)));return s.kind===`Attached`?s.expression:e},Ga={"=>":`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`},Ka=e=>Pi(e).name,qa=/^<(\d+|\*|\+)>([A-Za-z0-9_]*)\.*$/,Ja=(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}},Ya="use instead the class`E_visit.iter_concrete`",Xa=(e,t)=>t>0&&e[t-1].set===e[t].set,Za=(t,n,r,i)=>{let a=n.split(`
31
+ `),o=e=>({file:t,startLine:e.start.line,startColumn:e.start.column,endLine:e.end.line,endColumn:e.end.column+1}),s=e=>{let t=_a(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&&Sa(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?A({kind:`With`,expression:e,method:n},e):e},d=(e,n)=>({file:t,startLine:e.line,startColumn:e.column,endLine:e.line,endColumn:e.column+n}),f=e=>e.range?o(e.range):d(e,1),p=(e,t)=>{let n=Ka(e),r=Ga[n];return A(r?{kind:`Internal`,builtin:r}:{kind:`Opaque`,name:n},{location:t})},m=(e,t,n,r)=>{if(e.startsWith(`<`)){let t=A({kind:`Opaque`,name:e},{location:n});return A({kind:`Bang`,expression:t,selectors:[]},{location:n})}let i=Ga[e];if(i&&t.length===0)return A({kind:`Internal`,builtin:i},{location:n});let a=e.split(`!`);if(a.length===1){let r=A({kind:`Opaque`,name:e},{location:n});return t.length===0?r:A({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=A({kind:`Opaque`,name:a[0]},{location:n});return A({kind:`Bang`,expression:o[0]===0?l:A({kind:`Apply`,operator:l,args:c(0)},{location:n}),selectors:a.slice(1).map((e,t)=>({kind:`Label`,label:Ka(e),args:c(t+1)}))},{location:n})},h=(t,n)=>t.map((r,i)=>{if(r.pattern.kind===`Tuple`)throw new e.C(`Unexpected tuple declaration`,{failure:Ya});return{name:r.pattern.name,level:`Constant`,domain:Xa(t,i)?{kind:`Ditto`}:{kind:`Domain`,expression:y(r.set,n)}}}),g=(e,t)=>e.map((n,r)=>{let i=y(n.set,t);return n.pattern.kind===`Tuple`?{kind:`Tuple`,names:n.pattern.names,domain:i}:{kind:`Name`,name:n.pattern.name,domain:Xa(e,r)?{kind:`Ditto`}:{kind:`Domain`,expression:i}}}),_=(t,n)=>{if(!i)throw new e.C(`Unexpected tuple declaration`,{failure:Ya});return A(t,{location:n})},v=e=>e.some(e=>e.pattern.kind===`Tuple`),y=(t,n)=>{let r=f(t.location),i=e=>y(e,n),o=(e,t)=>e.length===2?Ja(e[0].location,e[1].location):e.length!==1||!e[0].location?r:t===`Prefix`?Ja({...r,endLine:r.startLine,endColumn:r.startColumn+1},e[0].location):t===`Postfix`?Ja({...r,startLine:r.endLine,startColumn:r.endColumn-1},e[0].location):r,s=(e,t)=>A({kind:`Apply`,operator:{kind:`Internal`,builtin:e},args:[t]},{location:o([t],`Prefix`)});switch(t.kind){case`Number`:return A({kind:`Num`,integer:t.text??String(t.value),fraction:``},{location:r});case`Decimal`:{let[e,n]=t.text.split(`.`);return A({kind:`Num`,integer:e,fraction:n},{location:r})}case`String`:{let e=/"((?:[^"\\]|\\.)*)"$/.exec((a[r.endLine-1]??``).slice(0,r.endColumn-1));return A({kind:`String`,value:e?.[1]??t.value},{location:r})}case`Identifier`:return m(t.name,[],r);case`Apply`:{if(t.args.length===2){let e=Wa(t);if(e!==t)return i(e)}let e=t.args.map(i),n=Pi(t.operator);return n.fixity===`Nonfix`?m(t.operator,e,r,t.argumentCounts):A({kind:`Apply`,operator:p(t.operator,void 0),args:e},{location:o(e,n.fixity)})}case`OperatorReference`:return p(t.operator,r);case`Lambda`:return A({kind:`Lambda`,params:t.params.map(e=>({name:e,shape:0})),body:i(t.body)},{location:r});case`And`:case`Or`:{let e=t.operands.map(i);if(t.isBulleted)return A({kind:`List`,bullet:t.kind,items:e},{location:r});let n=t.kind===`And`?`Conj`:`Disj`;return e.reduce((e,t)=>A({kind:`Apply`,operator:{kind:`Internal`,builtin:n},args:[e,t]},{location:Ja(e.location,t.location)}))}case`Prime`:{let e=i(t.expression);return A({kind:`Apply`,operator:{kind:`Internal`,builtin:`Prime`},args:[e]},{location:o([e],`Postfix`)})}case`Unchanged`:return s(`UNCHANGED`,i(t.expression));case`Enabled`:return s(`ENABLED`,i(t.expression));case`If`:return A({kind:`If`,condition:i(t.condition),consequent:i(t.consequent),alternative:i(t.alternative)},{location:r});case`Case`:return A({kind:`Case`,arms:t.arms.map(e=>({condition:i(e.condition),body:i(e.body)})),other:t.other&&i(t.other)},{location:r});case`Let`:return A({kind:`Let`,definitions:[...t.definitions,...t.instances??[]].sort((e,t)=>e.location.line-t.location.line||e.location.column-t.location.column).map(e=>ee(e,n)),body:i(t.body)},{location:r});case`Forall`:case`Exists`:return v(t.bounds)?_(Ma(t.kind,g(t.bounds,n),i(t.body)),r):A({kind:`Quant`,quantifier:t.kind,bounds:h(t.bounds,n),body:i(t.body)},{location:r});case`UnboundedQuantifier`:{let e=i(t.body),n=t.quantifier;return t.isTemporal?A({kind:`Tquant`,quantifier:n,names:t.names,body:e},{location:r}):A({kind:`Quant`,quantifier:n,bounds:Da(t.names),body:e},{location:r})}case`Choose`:return t.pattern.kind===`Tuple`?_(Na({kind:`Choose`,domain:t.set&&i(t.set)},t.pattern.names,i(t.body)),r):A({kind:`Choose`,name:t.pattern.name,domain:t.set&&i(t.set),body:i(t.body)},{location:r});case`SetEnumeration`:return A({kind:`SetEnum`,elements:t.elements.map(i)},{location:r});case`SetFilter`:return t.bound.pattern.kind===`Tuple`?_(Na({kind:`SetSt`,domain:i(t.bound.set)},t.bound.pattern.names,i(t.predicate)),r):A({kind:`SetSt`,name:t.bound.pattern.name,domain:i(t.bound.set),body:i(t.predicate)},{location:r});case`SetMap`:return v(t.bounds)?_(Fa(i(t.expression),g(t.bounds,n)),r):A({kind:`SetOf`,element:i(t.expression),bounds:h(t.bounds,n)},{location:r});case`Tuple`:return A({kind:`Tuple`,elements:t.elements.map(i)},{location:{...r,startLine:r.endLine,startColumn:r.endColumn-2}});case`FunctionConstruction`:return v(t.bounds)?_(Ia(g(t.bounds,n),i(t.body)),r):A({kind:`Fcn`,bounds:h(t.bounds,n),body:i(t.body)},{location:r});case`FunctionSet`:return A({kind:`Arrow`,domain:i(t.domain),range:i(t.range)},{location:r});case`Record`:case`RecordSet`:return A({kind:t.kind===`Record`?`Record`:`Rect`,fields:t.fields.map(e=>({name:e.name,value:i(e.value)}))},{location:r});case`Except`:return A({kind:`Except`,function:i(t.function),specs:t.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:y(e.value,!0)}))},{location:r});case`ExceptAt`:return A({kind:`At`,isExcept:n},{location:r});case`Bracket`:throw new e.C(`Unexpected [ without a function or subscript`);case`FunctionApplication`:return A({kind:`FcnApp`,function:i(t.function),args:t.args.map(i)},{location:r});case`FieldAccess`:return A({kind:`Dot`,expression:i(t.record),field:t.field},{location:r});case`Product`:return A({kind:`Product`,factors:t.factors.map(i)},{location:r});case`Always`:case`Eventually`:{let e=t.expression;return t.kind===`Always`&&e.kind===`BoxAction`?A({kind:`Tsub`,modal:`Box`,action:i(e.action),subscript:i(e.subscript)},{location:r}):t.kind===`Eventually`&&e.kind===`AngleAction`?A({kind:`Tsub`,modal:`Dia`,action:i(e.action),subscript:i(e.subscript)},{location:r}):s(t.kind===`Always`?`BoxTrue`:`Diamond`,i(e))}case`BoxAction`:case`AngleAction`:return A({kind:`Sub`,modal:t.kind===`BoxAction`?`Box`:`Dia`,action:i(t.action),subscript:i(t.subscript)},{location:r});case`WeakFairness`:case`StrongFairness`:return A({kind:`Fair`,fairness:t.kind===`WeakFairness`?`Weak`:`Strong`,subscript:i(t.subscript),action:i(t.action)},{location:r});case`Label`:return A({kind:`Parens`,expression:i(t.body),form:{kind:`Nlabel`,label:t.name,names:t.params}},{location:r});case`Subexpression`:{let[n,...a]=t.selectors;if(n.kind!==`Name`)throw new e.C(`Unexpected subexpression reference`);let o=A({kind:`Opaque`,name:n.name},{location:r}),s=n.args.length===0?o:A({kind:`Apply`,operator:o,args:n.args.map(i)},{location:r});return A({kind:`Bang`,expression:s,selectors:a.map(e=>{switch(e.kind){case`Name`:return{kind:`Label`,label:Ka(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})}}},b=e=>({location:o(e.definitionRange??e.instanceRange),args:e.params.map(e=>e.name),module:e.module,substitutions:e.substitutions.map(e=>({name:Ka(e.name),expression:y(e.expression,!1)}))}),ee=(t,n=!1)=>{let r=f(t.location);if(t.kind===`Instance`){if(t.name===void 0)throw new e.C(`Unexpected keyword INSTANCE`);return{kind:`Instance`,name:t.name,instance:b(t),location:r}}let i=t.kind===`Operator`&&t.params.length===1&&t.name===`-`?`-.`:Ka(t.name),o=y(t.body,n);if(t.kind===`Function`&&v(t.bounds))return{kind:`Operator`,name:i,body:_(Ia(g(t.bounds,n),o),r),location:r};if(t.kind===`Function`){let e=h(t.bounds,n);return{kind:`Operator`,name:i,body:A({kind:`Fcn`,bounds:e,body:o},{location:r}),location:r}}let s=t.params.length===0?o:A({kind:`Lambda`,params:t.params.map(e=>({name:Ka(e.name),shape:e.arity,...e.location&&{location:d(e.location,e.name.length)}})),body:o},{location:r}),c=t.location.range?.end,l=c&&Ca(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}},x=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&&y(e.set,!1),domainVisibility:`Visible`,location:t}},te=e=>e.kind===`AssumeProve`?{context:e.assumptions.map(e=>{if(e.kind===`NewSymbol`)return x(e);let t=e.kind===`AssumeProve`?A({kind:`Sequent`,sequent:te(e)},{location:f(e.location)}):S(e);return ct(t,`Visible`,`Now`,t.location)}),active:y(e.conclusion,!1)}:{context:[],active:y(e,!1)},S=e=>{if(e.kind!==`Label`||e.params.length>0)return y(e,!1);let t=f(e.location);return A({kind:`Parens`,expression:y(e.body,!1),form:{kind:`Xlabel`,label:e.name,indices:[]}},{location:t})},C=t=>{if(t.kind===`ModuleFact`)throw new e.k(`MODULE facts in proof obligations are not supported`);let n=y(t,!1);return n.kind===`Bang`&&n.selectors.length===0?n.expression:n},ne=t=>{let n=f(t.location);if(t.kind===`ModuleFact`)return{kind:`Dvar`,name:t.name,location:n};if(t.kind===`Identifier`)return{kind:`Dvar`,name:Ka(t.name),location:n};if(t.kind===`OperatorReference`)return{kind:`Dvar`,name:Ka(t.operator),location:n};throw new e.k(`This DEF clause in proof obligations is not supported`)},re=e=>({facts:e.facts.map(C),defs:e.defs.map(ne)}),ie=(e,t)=>e?.[2]?{kind:`Named`,level:t,label:e[2],isAnonymous:!1}:{kind:`Unnamed`,level:t,id:bn(r)},w=(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=>qa.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=w(s.proof,i+1,l),d={proof:u,location:Ja(l,u.location),step:c};return{kind:`Steps`,steps:a,qed:d,location:a.reduce((e,t)=>Ja(e,t.location),d.location),step:d.step}}}},ae=e=>Ja(o(e.keyword),e.defs.length>0?f(e.defs[e.defs.length-1].location):void 0),oe=(t,n,r)=>{let i=o(t.head),a=t.body,s=e=>{let a=w(t.proof,r+1,i);return{...e(a),location:Ja(i,a.location),step:n}},u=e=>({...e,...l(t.head),step:n});switch(a.kind){case`Use`:case`Hide`:{let e=Ja(o({...t.head,end:t.head.start}),ae(a)),r=re(a);return a.kind===`Use`?{kind:`Use`,usable:r,isOnly:a.isOnly,location:e,step:n,method:c(a.location.range)}:{kind:`Hide`,usable:r,location:e,step:n}}case`Instance`:throw new e.C(`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:y(a.expression,!1)});case`Take`:return u({kind:`Take`,bounds:a.names.length>0?Da(a.names):h(a.bounds,!1)});case`Witness`:return u({kind:`Witness`,expressions:a.expressions.map(e=>y(e,!1))});case`Pick`:{let e=a.names.length>0?Da(a.names):h(a.bounds,!1),t=y(a.body,!1);return s(n=>({kind:`Pick`,bounds:e,expression:t,proof:n}))}case`Case`:{let e=y(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 e.k(`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:Ka(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:b(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(y(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:w(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}},Qa={start:0,end:1/0},$a=/-{4,} *MODULE/,eo=`Unexpected EOF`,to=e=>e?`${e.startLine}:${e.startColumn}:${e.endLine}:${e.endColumn}`:``,no=e=>{let n=t.Zt(e),r=e.split(`
32
+ `),i=n.at(-1)?.line??r.length,a=r.slice(0,i-1).reduce((e,t)=>e+t.length+1,0)+r[i-1].indexOf(`====`),o=e.indexOf(` `,e.search($a));if(o===-1||o>=a)return;let s=e.slice(0,o).split(`
33
+ `).length,c=o-e.lastIndexOf(`
34
+ `,o-1),l=n.findLast(e=>e.kind!==`End`&&(e.line<s||e.line===s&&e.column<c));return{offset:o,line:s,column:c,end:{reason:eo,line:l?.line??s,column:l?l.endColumn+1:c,isEnd:!0}}},ro=t=>{try{return t()}catch(t){if(!(t instanceof e.D)||!t.failure)throw t;return t.failure}},io=e=>typeof e==`object`&&!!e&&`reason`in e,ao=e=>{let n=ro(()=>no(e));if(io(n))return[n];let r=ro(()=>t.W(n?e.slice(0,n.offset):e));return n&&(!io(r)||r.isEnd)?[{reason:`Unexpected TAB character. TLAPS does not handle TAB characters in source files.`,line:n.line,column:n.column,isEnd:!1},io(r)&&r.reason===eo?r:n.end]:io(r)?[r]:r},oo=(t,n,r,i,a)=>{if(!$a.test(t.source))throw new e.C(`No tokens in file`);let o=ao(t.source);if(Array.isArray(o)){o.forEach(e=>{let n=`File ${JSON.stringify(t.file)}, line ${e.line}, character ${e.column}\n${e.reason}`;i({text:n,channel:`stderr`}),i({text:`${n}\n`,channel:`toolboxOnly`})});let n=`Could not parse ${JSON.stringify(t.file)} successfully.`;throw i({text:`${a}Error: ${n}`,channel:`stderr`}),new e.C(n,{failure:`Module.Parser.parse_file`})}let s=Za(t.file,t.source,n,r).convertModule(o),c=t.file.slice(t.file.lastIndexOf(`/`)+1),l=c.replace(/\.tla$/,``);return s.name===l?s:(i({text:`${Qe(s.location)}Warning: module name ${JSON.stringify(s.name)} does not match file name ${JSON.stringify(c)}.`,channel:`toolbox`}),{...s,name:l})},so=t=>{let n=new Map([...t].map(([e,t])=>[e,Rn(t).dependencies])),r=/* @__PURE__ */ new Set,i=[],a=o=>{if(r.has(o))return;r.add(o);let s=t.get(o);if(!s)throw new e.C(`Module "${o}" not found`);(n.get(o)??[]).forEach(a),i.push(s)};return[...t.keys()].sort(Bn).forEach(a),i},co=(e,t,n)=>t.length===0?[]:[` ${e}_proofs_count = ${t.length}`,...t.map((t,r)=>` ${e}_proof_${n+r+1} at ${Je(t)}`)],lo=(e,t,n)=>{let r=e.location;return[` ---- incomplete proof of theorem at ${r?Je({...r,endLine:r.startLine,endColumn:r.startColumn}):`<unknown location>`} ----`,...co(`missing`,e.absent,t),...co(`omitted`,e.omitted,n),` ====`]},uo=e=>{let t=e.summary,n=t.theorems.reduce((e,t)=>t.absent.length+t.omitted.length===0?e:{lines:[...e.lines,...lo(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
+ `)},fo=(t,n,r={})=>{let i=r.lines??Qa,a=r.onWarning??(()=>{}),o={value:0},s=new Map(Mn);t.forEach(e=>{let t={...oo(e,o,!0,a,`File "<unknown>":
36
+ `),isImportant:!0};s.set(t.name,t)});let c=[...s.values()].sort((e,t)=>Bn(e.name,t.name)),l=/* @__PURE__ */ new Map,u=/* @__PURE__ */ new Set;for(let e=0;e<c.length;e++){let t=Rn(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)&&!Mn.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=oo(r,o,!1,a,Ze(t.locations.get(e)));s.set(e,i),c.push(i)}}let d=[...l.keys()].filter(e=>!u.has(e)).sort(Bn);if(d.forEach(e=>a(k(l.get(e),`Unknown module ${JSON.stringify(e)}`))),d.length>0)throw new e.C(`Unknown module ${JSON.stringify(d[0])}`,{failure:`Module.Parser.load_module`});let f={anonymizer:Tn(o,(e,t)=>ti(f,e,t),a),simplify:pa(o),salts:{value:0},latestModules:/* @__PURE__ */ new Map,onWarning:a},p=so(s).map(e=>e.isStandard?e:Ln(s,e,/* @__PURE__ */ new Set)),m=sr(new Set(t.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=ni(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:`${ra(e.sequent)}\n`;return[{id:t+1,location:to(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}]})},po=async t=>{let n=[],r=[],i=/* @__PURE__ */ new Map,a=[],o={failure:void 0},s=()=>{for(;a.length>0&&r.length>0;){let e=r.reduce((e,t,n)=>t.priority<r[e].priority?n:e,0),[t]=r.splice(e,1),o=a.pop()??0;i.set(o,t),n[o].postMessage(t.request)}},c=(t,n)=>{let r=n,o=i.get(t);i.delete(t),a.push(t),`verdict`in r&&o?.resolve(r),`error`in r&&o?.reject(new e.w(r.error)),s()},l=e=>{o.failure||(o.failure={reason:e},[...r.splice(0),...i.values()].forEach(t=>t.reject(e)),i.clear(),n.forEach(e=>e.terminate()))};return n.push(...await Promise.all(Array.from({length:t},(t,n)=>e.r(new URL(`./prove-worker.js`,require("url").pathToFileURL(__filename).href),e=>c(n,e),l)))),a.push(...n.keys()),{decide:(e,t,n,i)=>new Promise((a,c)=>{if(o.failure)return c(o.failure.reason);r.push({request:{prover:e,text:t,timeLimitMs:n.timeLimitMs},priority:i,resolve:a,reject:c}),s()}),terminate:l}},mo={"!":`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_`},ho=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(` `)),go=e=>/^[A-Za-z]$/.test(e),_o=t=>{if(/^[A-Za-z0-9]$/.test(t))return;let n=mo[t];if(n===void 0)throw new e.j;return n},vo=e=>{let t=[...e];return go(t[0]??``)&&go(t.at(-1)??``)&&t.every(e=>_o(e)===void 0)&&!ho.has(e)?e:`a_${t.map(e=>_o(e)??e).join(``)}a`},yo={Leadsto:[`Leadsto`,2],ENABLED:[`ENABLED`,1],Cdot:[`\\cdot`,2],Actplus:[`-+->`,2],BoxTrue:[`[]`,1],BoxFalse:[`[]`,1],Diamond:[`<>`,1]},bo=(t,n,r)=>{if((t===`Prime`||t===`StrongPrime`||t===`UNCHANGED`)&&n===1)return new e.j;let i=yo[t];return i&&i[1]===n?new e.w(`Unsupported operator \`${i[0]}\`.\n`):new e.w(r)},xo=(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:R(1,e.domain.expression)}}:e),body:n,location:n.location}}},So=(t,n)=>{let r=t.stack.length;try{return n()}catch(n){if(!(n instanceof e.k))throw n;return Vi(t,t.stack.length-r),n}},Co=e=>`is${vo(e)}`,wo={TRUE:`TRUE`,FALSE:`FALSE`,STRING:`STRING`,BOOLEAN:`BOOLEAN`,Nat:`Nat`,Int:`Int`,Real:Co(`Real`),Infinity:Co(`Infinity`),Any:`Any`},To={Neg:`~`,DOMAIN:`DOMAIN`,SUBSET:`SUBSET`,UNION:`UNION`},Eo={Implies:`\\<Rightarrow>`,Equiv:`\\<Leftrightarrow>`,Conj:`\\<and>`,Disj:`\\<or>`,Eq:`=`,Neq:`\\<noteq>`,Subseteq:`\\<subseteq>`,Mem:`\\<in>`,Notmem:`\\<notin>`,Setminus:`\\\\`,Cap:`\\<inter>`,Cup:`\\<union>`,OneArg:`:>`,Extend:`@@`},Do={Plus:[`addint`,2],Minus:[`subint`,2],Uminus:[`minus`,1],Times:[`mult`,2],Ratio:[Co(`/`),2],Quotient:[Co(`\\div`),2],Remainder:[Co(`%`),2],Exp:[Co(`^`),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:[Co(`\\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]},Oo=[`consts`,...[[`Real`,0],[`/`,2],[`\\div`,2],[`%`,2],[`..`,2],[`Infinity`,0],[`[]`,1],[`<>`,1]].map(e=>` "${Co(e[0])}" :: ${e[1]===0?`c`:`"[${Array(e[1]).fill(`c`).join(`,`)}] => c"`}`),``].join(`
37
+ `),ko=e=>{let t=Number.parseInt(e,10);return`${`succ[`.repeat(t)}0${`]`.repeat(t)}`},Ao=(e,t)=>[`(* automatically generated -- do not edit manually *)`,`theory ${e} imports Constant Zenon begin`,...t?[`ML_command \\<open> writeln ("*** TLAPS PARSED\\n"); \\<close>`]:[],Oo],jo=t=>{let n=Ri(),r=e=>Bi(n,vo(e)),i=()=>Bi(n,``),a=(e,t)=>{let i=t(r(e));return Vi(n,1),i},o=e=>`(${p(e)})`,s=e=>e.map(o).join(`, `),c=(e,t)=>`(${e} (${s(t)}))`,l=(t,n)=>{let r=wo[t];if(r!==void 0&&n.length===0)return r;let i=To[t];if(i!==void 0&&n.length===1)return`(${i} ${o(n[0])})`;let a=Eo[t];if(a!==void 0&&n.length===2)return`(${o(n[0])} ${a} ${o(n[1])})`;let s=Do[t];if(s&&s[1]===n.length)return c(s[0],n);if(t===`Unprimable`&&n.length===1)return o(n[0]);throw t===`Irregular`&&n.length===1?new e.k(`Irregular`):bo(t,n.length,`Backend.Isabelle.pp_apply`)},u=(t,i)=>{switch(t.kind){case`Ix`:{let r=zi(n,t.index);if(t.index<=0||r===void 0)throw new e.j;return i.length===0?r:`(${r} (${s(i)}))`}case`Opaque`:{let e=vo(t.name);return i.length===0?`(${e} :: c)`:`(${e} (${s(i)}) :: c)`}case`Internal`:return l(t.builtin,i);case`Lambda`:{let e=`\\<lambda> ${t.params.map(e=>`${r(e.name)} `).join(``)}. ${o(t.body)}`;return Vi(n,t.params.length),e}default:throw new e.j}},d=(t,n,r)=>{if(n.length===0)return p(r);let i=xo(t,n,r),s=t===`Forall`?`\\<forall>`:`\\<exists>`;if(i.first.domain.kind===`NoDomain`)return a(i.first.name,e=>`${s}${e} : ${o(i.inner)}`);if(i.first.domain.kind!==`Domain`)throw new e.j;let c=o(i.first.domain.expression);return a(i.first.name,e=>`${s} ${e} \\<in> ${c} : ${o(i.inner)}`)},f=t=>{if(t.context.length===0)return o(t.active);let r=t.context[0],s=()=>f({context:t.context.slice(1),active:t.active});switch(r.kind){case`Flex`:return a(r.name,e=>`(\\<And> ${e} ${e}'.${s()})`);case`Fresh`:{if(r.domain&&r.domainVisibility===`Visible`){let e=o(r.domain);return a(r.name,t=>`(\\<And> ${t} :: c. ${t} \\<in> ${e} \\<Longrightarrow> ${s()})`)}let e=`${`c => `.repeat(r.shape)}c`;return a(r.name,t=>`(\\<And> ${t} :: ${e}. ${s()})`)}case`Fact`:{let e=r.visibility===`Visible`?o(r.expression):void 0;i();let t=e?`(${e} \\<Longrightarrow> ${s()})`:s();return Vi(n,1),t}case`Defn`:throw new e.k(`Inner definition`)}},p=t=>{switch(t.kind){case`Ix`:case`Internal`:case`Opaque`:case`Lambda`:return u(t,[]);case`Apply`:return u(t.operator,t.args);case`Bang`:throw new e.w(`Backend.Isabelle.module`);case`Sequent`:return f(t.sequent);case`With`:case`Parens`:return p(t.expression);case`Let`:throw new e.k(`LET`);case`List`:return t.bullet===`Refs`&&t.items.length===0?`TRUE`:t.bullet===`Refs`&&t.items.length===1?p(t.items[0]):t.items.map(o).join(t.bullet===`Or`?` | `:` & `);case`If`:return`cond(${o(t.condition)}, ${o(t.consequent)}, ${o(t.alternative)})`;case`Quant`:return d(t.quantifier,t.bounds,t.body);case`Tquant`:throw new e.k(t.quantifier===`Forall`?`\\\\AA`:`\\\\EE`);case`Choose`:{if(!t.domain)return a(t.name,e=>`Choice(%${e}. ${o(t.body)})`);let e=o(t.domain);return a(t.name,n=>`bChoice(${e}, %${n}. ${o(t.body)})`)}case`SetSt`:{let e=o(t.domain);return a(t.name,n=>`subsetOf(${e}, %${n}. ${o(t.body)})`)}case`SetOf`:{if(t.bounds.length===0)throw new e.j;let n=t.bounds[0];if(t.bounds.length!==1||n.domain.kind!==`Domain`)throw new e.k(`SetOf (multiple declared constants)`);let r=o(n.domain.expression);return a(n.name,e=>`setOfAll(${r}, %${e}. ${o(t.element)})`)}case`SetEnum`:return`{${s(t.elements)}}`;case`Fcn`:{let n=t.bounds[0];if(t.bounds.length!==1)throw new e.k(`function (multiple declared constants)`);if(n.domain.kind===`Ditto`)throw new e.j;let r=n.domain.kind===`Domain`?o(n.domain.expression):void 0;return a(n.name,e=>`[${r===void 0?e:` ${e} \\<in> ${r} `} \\<mapsto> ${o(t.body)}]`)}case`FcnApp`:{let e=o(t.function);return t.args.length===1?`fapply (${e}, ${o(t.args[0])})`:`fapply (${e}, <<${s(t.args)}>>)`}case`Arrow`:return`[${o(t.domain)} \\<rightarrow> ${o(t.range)}]`;case`Rect`:return`[${t.fields.map(e=>`''${e.name}'' : ${o(e.value)}`).join(`, `)}]`;case`Record`:return`(${t.fields.map(e=>`(''${e.name}'' :> ${o(e.value)})`).join(` @@ `)})`;case`Except`:{let e=t.specs.map(e=>`!${e.trail.map(e=>e.kind===`Dot`?`[''${e.field}'']`:`[${o(e.expression)}]`).join(``)} = ${o(e.value)}`);return`[${o(t.function)} EXCEPT ${e.join(`, `)}]`}case`Dot`:return`fapply (${o(t.expression)}, (''${t.field}''))`;case`Tuple`:return`<<${s(t.elements)}>>`;case`Product`:return t.factors.length===2?`(${o(t.factors[0])} \\<times> ${o(t.factors[1])})`:`Product(\\<langle>${s(t.factors)}\\<rangle>)`;case`Sub`:case`Tsub`:{let e=t.kind===`Sub`?`sub`:`tsub`;return`${t.modal===`Box`?Co(`a'box'${e}`):`a'dia'${e}`}(${o(t.action)},${o(t.subscript)})`}case`Fair`:return`${Co(t.fairness===`Weak`?`a'wf`:`a'sf`)}(${o(t.subscript)},${o(t.action)})`;case`Case`:{let e=s(t.arms.map(e=>e.condition)),n=s(t.arms.map(e=>e.body));return t.other?`CaseOther(<<${e}>>,<<${n}>>,${o(t.other)})`:`Case(<<${e}>>,<<${n}>>)`}case`String`:return`''${t.value}''`;case`Num`:if(t.fraction!==``)throw new e.k(`real constants`);return`(${ko(t.integer)})`;case`At`:throw new e.j}},m=t=>{let a=[];for(let s of t.context)switch(s.kind){case`Flex`:{let e=r(s.name);a.push(`fixes ${e} ${e}'`);break}case`Fresh`:{let e=s.domain&&s.domainVisibility===`Visible`?o(s.domain):void 0,t=r(s.name);if(a.push(`fixes ${t}`),e===void 0)break;a.push(`assumes ${t}_in : "(${t} \\<in> ${e})"`);break}case`Fact`:{let t=n.stack.length,r=s.visibility===`Visible`?So(n,()=>o(s.expression)):void 0;if(i(),r instanceof e.k){a.push(`(* omitted temporal assumption : ${r.message} *)`);break}if(r===void 0)break;a.push(`assumes v'${t}: "${r}"`);break}case`Defn`:if(s.definition.kind===`Bpragma`)return[...a,``];a.push(`(* usable definition ${s.definition.name} suppressed *)`),r(s.definition.name)}return[...a,`shows "${o(t.active)}"`]};try{let e=m(t);return{text:e.join(`
38
+ `),isAssumed:e.some(e=>e.startsWith(`assumes `))}}catch(t){throw t instanceof e.k?new e.w(`isabelle : unsupported operator ${t.message}`):t}},Mo=(e,t,n)=>{let r=jo(t);return[...Ao(`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
+ `)},No=(e,t)=>[...Ao(e,!0),...t.flatMap(e=>[`lemma ob'${e.id}:`,`${jo(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
+ `),Po=[7,12,17,22,5,9,14,20,4,11,16,23,6,10,15,21],Fo=Array.from({length:64},(e,t)=>Math.floor(Math.abs(Math.sin(t+1))*2**32)),Io=(e,t)=>e<<t|e>>>32-t,Lo=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+Fo[o]+t[l]|0;return[i,n+Io(u,Po[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(``)},Ro=(t,n)=>{let r=it(t,n-1)?.hyp;if(!r)throw new e.j;return r},zo=(e,t)=>vr(e,t).level,Bo=(e,t)=>e.kind===`Apply`&&e.operator.kind===`Internal`&&t.includes(e.operator.builtin),Vo=(e,t)=>{let n=P(void 0,(n,r)=>{let i=_t(r,t=>e(n,t),t);return[M(n,i),i]});return(t,r)=>{let i=n(t,r.context);return{context:i.context,active:e(i.state,r.active)}}},Ho=(e,t)=>{if(t.kind===`Sub`||t.kind===`Tsub`){let n=Ho(e,t.action),r=Ho(e,t.subscript),i=j(`UNCHANGED`,[r],t),a=t.modal===`Box`?j(`Disj`,[n,i],t):j(`Conj`,[n,j(`Neg`,[i],t)],t);return t.kind===`Sub`?a:j(t.modal===`Box`?`BoxTrue`:`Diamond`,[a],t)}return F(e,t,Ho,M,`all`)},Uo=(e,t)=>t.kind===`Apply`&&Bo(t,[`UNCHANGED`])&&t.args.length===1?an(t.args[0]):F(e,t,Uo,M,`all`),Wo=(e,t)=>j(e,[t],t),Go=(t,n)=>{if(n.kind===`Ix`){let e=Ro(t,n.index);return e.kind===`Fresh`&&e.level===`Constant`||e.kind===`Defn`&&e.definition.kind===`Operator`&&zo(it(t,n.index),e.definition.body)===0?n:Wo(`Prime`,n)}if(Bo(n,[`ENABLED`])||n.kind===`Opaque`||n.kind===`Sequent`||n.kind===`Let`)return Wo(`Prime`,n);if(Bo(n,[`UNCHANGED`,`Cdot`,`Leadsto`,`Actplus`,`BoxTrue`,`BoxFalse`,`Diamond`])||n.kind===`Tquant`||n.kind===`Sub`||n.kind===`Tsub`||n.kind===`Fair`)throw new e.j;return F(t,n,Go,M)},Ko=e=>{let t=e===`BoxTrue`?`Conj`:`Disj`,n=e===`BoxTrue`?`Forall`:`Exists`,r=(i,a)=>zo(i,a)===0?a:Bo(a,[t])||(a.kind===`Quant`||a.kind===`Tquant`)&&a.quantifier===n?F(i,a,r,M):Wo(e,a);return r},qo={Prime:Go,BoxTrue:Ko(`BoxTrue`),Diamond:Ko(`Diamond`)},Jo=(t,n)=>{if(n.kind===`Apply`&&n.operator.kind===`Internal`){let r=qo[n.operator.builtin];if(r){if(n.args.length!==1)throw new e.j;return r(t,n.args[0])}}return F(t,n,Jo,M,`all`)},Yo={Constant:`CONSTANT`,State:`STATE`,Action:`ACTION`,Temporal:`TEMPORAL`,Unknown:`Unknown`},Xo=[`CONSTANT`,`STATE`,`ACTION`,`TEMPORAL`],Zo=(e,t)=>`${e}_${t}_`,Qo=(t,n,r)=>{if(n.kind!==`Operator`)return n.kind===`Bpragma`?{...n,body:is(t,n.body)}:n;let i=is(t,n.body),a=Xo[r??zo(t,i)];if(a===void 0)throw new e.j;return{...n,name:Zo(a,n.name),body:i}},$o=(e,t,n)=>{switch(t.kind){case`Fresh`:return{...t,name:Zo(Yo[t.level],t.name),domain:t.domain&&is(e,t.domain)};case`Flex`:return{...t,name:Zo(`VARIABLE`,t.name)};case`Defn`:return{...t,definition:Qo(e,t.definition,n)};case`Fact`:return{...t,expression:is(e,t.expression)}}},es=(e,t)=>{if(t.kind!==`Defn`||t.definition.kind!==`Operator`)return;let n=t=>{if(!Bo(t,[`UNCHANGED`])||t.kind!==`Apply`)return zo(e,t);let n=e=>e.kind===`Tuple`?e.elements.flatMap(n):[e],r=n(t.args[0]);return zo(e,r.length===1?r[0]:t.args[0])},r=t.definition.body;return n(Bo(r,[`Prime`,`BoxTrue`,`Diamond`])&&r.kind===`Apply`&&r.args.length===1&&r.kind===`Apply`?r.args[0]:r)},ts=P({scope:void 0,original:void 0},(e,t,n)=>{let r=$o(e.scope,t,es(e.original,n));return[{scope:M(e.scope,r),original:M(e.original,n)},r]}),ns=(e,t)=>{let n=ts(t.context,e.context);return{context:n.context,active:is(n.state.scope,e.active)}},rs=(e,t)=>{let[n,r]=at(e,t.context,(e,t)=>{let n=$o(e,t);return[M(e,n),n]});return{context:r,active:is(n,t.active)}},is=(e,t)=>{switch(t.kind){case`Lambda`:{let n=t.params.map(e=>({...e,name:Zo(`Unknown`,e.name)})),r=N(e,n.map(ut));return{...t,params:n,body:is(r,t.body)}}case`Tquant`:{let n=N(e,t.names.map(e=>({kind:`Flex`,name:Zo(`VARIABLE`,e)})));return{...t,body:is(n,t.body)}}case`Choose`:{let n=t.domain&&is(e,t.domain),r=Zo(`CONSTANT`,t.name),i=n?st(r,n):ot(r,`Constant`);return{...t,name:r,domain:n,body:is(M(e,i),t.body)}}case`SetSt`:{let n=is(e,t.domain),r=Zo(`CONSTANT`,t.name),i=is(M(e,st(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:Zo(Yo[t.level],t.name),domain:t.domain.kind===`Domain`?{kind:`Domain`,expression:is(e,t.domain.expression)}:t.domain})),r=N(e,n.map(lt));return t.kind===`SetOf`?{...t,bounds:n,element:is(r,t.element)}:{...t,bounds:n,body:is(r,t.body)}}case`Let`:{let[n,r]=at(e,t.definitions,(e,t)=>{let n=Qo(e,t);return[M(e,dt(n)),n]});return{...t,definitions:r,body:is(n,t.body)}}case`Sequent`:return{...t,sequent:rs(e,t.sequent)};default:return F(e,t,is,M,`all`)}},as=/* @__PURE__ */ new WeakMap,os=(e,t)=>{let n=as.get(t);if(n)return n;let r=t.kind===`Operator`?t.body:void 0;if(r?.kind!==`Lambda`)return[];let i=N(e,r.params.map(ut)),a=r.params.map((e,t)=>ls(i,r.body,t+1,!0));return as.set(t,a),a},ss=[`Prime`,`StrongPrime`,`BoxTrue`,`BoxFalse`,`Diamond`,`ENABLED`,`UNCHANGED`],cs=[`Leadsto`,`Actplus`,`Cdot`],ls=(t,n,r,i)=>{if(n.kind===`Ix`)return i||n.index!==r;if(n.kind===`Apply`&&n.operator.kind===`Internal`){let e=n.operator.builtin;if(ss.includes(e)&&n.args.length===1||cs.includes(e)&&n.args.length===2)return n.args.every(e=>ls(t,e,r,!1))}if(n.kind===`Sub`)return[n.action,n.subscript].every(e=>ls(t,e,r,!1));if(n.kind===`Apply`&&n.operator.kind===`Ix`){let i=it(t,n.operator.index-1),a=i?.hyp;if(i&&a?.kind===`Defn`&&a.definition.kind===`Operator`){let o=os(i.rest,a.definition);return n.args.every((n,i)=>{let a=o[i];if(a===void 0)throw new e.j;return ls(t,n,r,a)})}}let a={isSubstitutive:!0};return F({scope:t,index:r},n,(e,t)=>(a.isSubstitutive&&=ls(e.scope,t,e.index,i),t),(e,t)=>({scope:M(e.scope,t),index:e.index+1}),`all`),a.isSubstitutive},us=(e,t)=>`h${Lo(Ai(ta(e,t))).slice(0,5)}`,ds=(e,t)=>A({kind:`Opaque`,name:us(nt(e),t)},t),fs=(e,t,n,r,i)=>{let a=i.map((t,r)=>zo(e,t)===0||n[i.length-r-1]?A({kind:`Opaque`,name:`*`},t):t);return ds(e,A({kind:`Apply`,operator:{kind:`Opaque`,name:t},args:a},r))},ps=[`Prime`,`StrongPrime`,`BoxTrue`,`BoxFalse`,`Diamond`,`Leadsto`,`ENABLED`,`Cdot`,`UNCHANGED`],ms=(t,n)=>{if(n.kind!==`Apply`)return F(t,n,ms,M);let r=n.operator,[i]=n.args;if(Bo(n,[`Prime`,`StrongPrime`])&&n.args.length===1&&i.kind===`Ix`){let e=Ro(t,i.index);if(e.kind===`Fresh`||e.kind===`Flex`)return A({kind:`Opaque`,name:`${e.name}#prime`},n)}if(Bo(n,ps))return ds(t,n);if(r.kind!==`Ix`)return F(t,n,ms,M);let a=it(t,r.index-1),o=a?.hyp;if(!o)throw new e.j;let s=n.args;if(o.kind===`Defn`&&o.definition.kind===`Operator`){let e=os(a.rest,o.definition);if(s.every((n,r)=>zo(t,n)===0||e[s.length-r-1]))return F(t,n,ms,M);let i=fs(t,o.definition.name,e,r,s);return A({kind:`Apply`,operator:i,args:s.map(e=>ms(t,e))},n)}if(o.kind===`Flex`)return F(t,n,ms,M);if(o.kind===`Fresh`){if(o.level===`Constant`)return A({kind:`Apply`,operator:r,args:s.map(e=>ms(t,e))},n);let e=s.map(()=>!1);return fs(t,o.name,e,r,s)}throw new e.j},hs=Vo(Ho,`all`),gs=Vo(Uo,`all`),_s=Vo(Jo,`all`),vs=Vo(ms,`visible`),ys=e=>{let t=e.context,n=gs(t,hs(t,e)),r=_s(t,n);return vs(t,ns(r,e))},bs=/* @__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(`.`),xs={And:0,Or:1,Refs:2},Ss={Forall:0,Exists:1},Cs={Box:0,Dia:1},ws={Weak:0,Strong:1},Ts={34:`\\"`,92:`\\\\`,10:`\\n`,9:`\\t`,13:`\\r`,8:`\\b`},Es=e=>`"${[...new TextEncoder().encode(e)].map(e=>Ts[e]??(e<32||e>126?`\\${String(e).padStart(3,`0`)}`:String.fromCharCode(e))).join(``)}"`,Ds=e=>e===`BoxTrue`?`$Box`:e===`BoxFalse`?`$FakeBox`:`$${bs.indexOf(e)}`,Os=e=>e.level===`Unknown`?`Unknown`:e.level.toUpperCase(),ks=t=>{let n=[],r=t=>{let r=n[n.length-t];if(!r)throw new e.j;return r},i=e=>n.push({ident:e,isUsed:!1}),a=()=>{let t=n.pop();if(!t)throw new e.j;return t},o=e=>Array.from({length:e}).forEach(()=>i({kind:`Var`})),s=e=>Array.from({length:e},a),c=t=>{if(t.ident.kind===`VarIndex`)return t.ident.index;if(t.ident.kind===`Var`)return 0;throw new e.j},l=t=>{if(t.ident.kind!==`HypIndex`)throw new e.j;return t.ident.index},u=(t,n)=>{let a=e=>u(t,e),l=e=>e.map(a).join(`,`),f=(e,t)=>t.map((t,n)=>t.domain.kind===`Domain`?`${c(e[n])}:${a(t.domain.expression)},`:``).join(``),p=(e,t)=>(o(e),{text:a(t),entries:s(e)}),m=e=>e.map(e=>`${c(e)}.`).join(``);switch(n.kind){case`Ix`:{let i=r(n.index);i.isUsed=!0;let a=i.ident;switch(a.kind){case`None`:return`$V(${n.index}SHOULD_NOT_APPEAR)`;case`Hyp`:{let e=t.hyp++;return i.ident={kind:`HypIndex`,index:e},`$${a.label}(${e})`}case`Var`:{let e=t.variable++;return i.ident={kind:`VarIndex`,index:e},`$PRM(${e})`}case`HypIndex`:return`$HYP(${a.index})`;case`VarIndex`:return`$PRM(${a.index})`;case`Pragma`:return``}throw new e.j}case`Opaque`:return n.name;case`Internal`:return Ds(n.builtin);case`Lambda`:{let e=p(n.params.length,n.body);return`$Lam(${m(e.entries.toReversed())}${e.text})`}case`Sequent`:return d(n.sequent);case`Apply`:{let e=n.operator;return e.kind===`Ix`&&r(e.index).ident.kind===`Pragma`?``:`$OpApp(${a(e)};${l(n.args)})`}case`With`:case`Parens`:return a(n.expression);case`If`:return`$If(${a(n.condition)},${a(n.consequent)},${a(n.alternative)})`;case`List`:return`$List(${xs[n.bullet]};${l(n.items)})`;case`Let`:{let t=n.definitions.map(t=>{if(t.kind!==`Operator`&&t.kind!==`Bpragma`)throw new e.j;let n=`${a(t.body)}.`;return i({kind:`Var`}),n}),r=a(n.body);return s(t.length),`${t.join(``)}${r}`}case`Quant`:{let e=p(n.bounds.length,n.body);return`$Quant(${Ss[n.quantifier]};${f(e.entries,n.bounds)}.${e.text})`}case`Tquant`:{let e=p(n.names.length,n.body);return`$Tquant(${Ss[n.quantifier]}${m(e.entries.toReversed())}${e.text})`}case`Choose`:{let e=p(1,n.body),t=c(e.entries[0]);return n.domain?`$Bch(${t}:${a(n.domain)};${e.text})`:`$Ch(${t}:${e.text})`}case`SetSt`:{let e=p(1,n.body);return`$SSt(${c(e.entries[0])}:${a(n.domain)};${e.text})`}case`SetOf`:{let e=p(n.bounds.length,n.element);return`$Sof(${f(e.entries.toReversed(),n.bounds)}.${e.text})`}case`Fcn`:{let e=p(n.bounds.length,n.body);return`$Fcn(${f(e.entries.toReversed(),n.bounds)}.${e.text})`}case`SetEnum`:return`$Set(${l(n.elements)})`;case`Tuple`:return`$Tup(${l(n.elements)})`;case`Product`:return`$Prod(${l(n.factors)})`;case`FcnApp`:return`$FcnApp(${a(n.function)};${l(n.args)})`;case`Arrow`:return`$Arrow(${a(n.domain)},${a(n.range)})`;case`Rect`:case`Record`:return`$${n.kind}(${n.fields.map(e=>`(${e.name},${a(e.value)})`).join(`,`)})`;case`Except`:return`$Except(${a(n.function)},${n.specs.map(e=>`(${e.trail.map(e=>e.kind===`Dot`?`.${e.field}`:`.${a(e.expression)}`).join(``)}=${a(e.value)})`).join(`,`)})`;case`Dot`:return`$Dot(${a(n.expression)},${n.field})`;case`Sub`:case`Tsub`:return`$${n.kind}(${Cs[n.modal]},${a(n.action)},${a(n.subscript)})`;case`Fair`:return`$Fair(${ws[n.fairness]},${a(n.subscript)},${a(n.action)})`;case`Case`:return`$Case(${n.arms.map(e=>`(${a(e.condition)},${a(e.body)})`).join(`,`)},${n.other?a(n.other):``})`;case`String`:return Es(n.value);case`Num`:return`$Num(${n.integer},${n.fraction})`;case`At`:return`$At`;case`Bang`:throw new e.j}},d=t=>{let n={hyp:1,variable:1},r=(o,s)=>{let c=t.context[o];if(!c)return`$Goal(${u(n,t.active)})`;let d=e=>(i(e),{rest:r(o+1,M(s,c)),entry:a()});switch(c.kind){case`Fresh`:{if(!c.domain){let e=Os(c),t=d({kind:`Hyp`,label:e});return t.entry.isUsed?`${t.rest}${e}${c.name}`:t.rest}let e=d({kind:`Hyp`,label:`CON`});if(c.domainVisibility===`Hidden`)return e.rest;let t=e.entry.isUsed?String(l(e.entry)):`_`;return`${e.rest}$Dom(${t};${u(n,c.domain)})`}case`Flex`:return d({kind:`Hyp`,label:`VAR`}).rest;case`Defn`:{let t=c.definition;if(t.kind===`Recursive`)return d({kind:`Hyp`,label:`CON`}).rest;if(t.kind===`Bpragma`)return d({kind:`Pragma`}).rest;if(t.kind===`Instance`)throw new e.j;let r=d({kind:`Hyp`,label:`HYP`});if(!r.entry.isUsed)return r.rest;let i=l(r.entry);return c.visibility===`Hidden`?`${r.rest}$Def(${i},${hn(s,t.body)?0:3})`:`${r.rest}$Def(${i};${u(n,t.body)})`}case`Fact`:return c.visibility===`Hidden`?d({kind:`None`}).rest:`${d({kind:`Hyp`,label:`HYP`}).rest}$Fact(${u(n,c.expression)},${c.time.toLowerCase()})`}};return r(0,void 0)};return d(t)},As=e=>Lo(ks(e)),js={kind:`Internal`,builtin:`TRUE`},Ms=(e,t)=>e.kind===`Apply`&&e.operator.kind===`Internal`&&e.operator.builtin===t&&e.args.length===2?e.args:void 0,Ns=e=>e.kind===`Apply`&&e.operator.kind===`Internal`&&e.operator.builtin===`ENABLED`&&e.args.length===1?e.args[0]:void 0,Ps=(e,t)=>{let n=Ms(e,t),r=n&&Ns(n[0]),i=n&&Ns(n[1]);return r&&i?[r,i]:void 0},Fs=(t,n)=>{let r=/* @__PURE__ */ new Set,i=(t,n)=>{let a={...t,isPrimed:!0},o=n.kind===`Apply`&&n.operator.kind===`Internal`&&n.operator,s=o&&o.builtin,c=n.kind===`Apply`?n.args:[];if((s===`Prime`&&c.length===1||s===`ENABLED`||s===`Cdot`&&c.length===2||s===`UNCHANGED`&&c.length===1||n.kind===`Sub`)&&t.isPrimed)throw new e.j;if(s===`Prime`&&c.length===1)i(a,c[0]);else if(s===`Cdot`&&c.length===2)i(t,c[1]);else if(s===`UNCHANGED`&&c.length===1)i(a,c[0]);else if(n.kind===`Sub`)i(t,n.action),i(a,n.subscript);else if(n.kind===`Ix`){let i=it(t.scope,n.index-1)?.hyp;if(!i)throw new e.j;i.kind===`Flex`&&t.isPrimed&&r.add(i.name)}else s!==`ENABLED`&&F(t,n,i,(e,t)=>({...e,scope:M(e.scope,t)}));return n};return i({scope:t,isPrimed:!1},n),r},Is=(e,t,n)=>{let r=Fs(e,t);return[...Fs(e,n)].every(e=>!r.has(e))},Ls=(t,n)=>{let r=e=>vr(t,e).level,i=(t,n)=>{if(r(t)>2||r(n)>2)throw new e.j},a=Ns(n),o=a&&Ms(a,`Disj`);if(o)return i(o[0],o[1]),{name:`abdisj_inverse`,left:o[0],right:o[1]};let s=Ps(n,`Disj`);if(s)return i(s[0],s[1]),{name:`abdisj`,left:s[0],right:s[1]};let c=a&&Ms(a,`Conj`);if(c){let e=c[0],n=c[1],a=Is(t,e,n);return i(e,n),a?{name:r(e)===2?`abconj_inverse`:`pconj_inverse`,left:e,right:n}:void 0}let l=Ps(n,`Conj`);if(l)return Is(t,l[0],l[1])?{name:`abconj`,left:l[0],right:l[1]}:void 0;let u=Ms(n,`Conj`),d=u&&Ns(u[1]);if(u&&d)return r(u[0])<=1&&r(d)<=2?{name:`pconj`,left:u[0],right:d}:void 0;let f=Ps(n,`Equiv`)??Ps(n,`Eq`);if(f)return{name:`equiv`,left:f[0],right:f[1]};let p=Ps(n,`Implies`);return p&&{name:`implies`,left:p[0],right:p[1]}},Rs=t=>{let n=N(void 0,t.context),r=Ls(n,t.active),i={isPremise:!1,isLeftBoolean:!1,isRightBoolean:!1};if(t.context.forEach((e,n)=>{if(!r||e.kind!==`Fact`||e.visibility!==`Visible`)return;let a=t.context.length-n,o=e.expression,s=e=>z(R(a,e),r.left),c=e=>z(R(a,e),r.right),l=(e,t)=>e!==void 0&&s(e[0])&&c(e[1])&&t.includes(r.name),u=Ns(o),d=u&&Ms(u,`Conj`),f=Ms(o,`Conj`),p=f&&Ns(f[1]),m=Ms(o,`Mem`),h=m?.[1].kind===`Internal`&&m[1].builtin===`BOOLEAN`;l(d,[`pconj`])||l(u&&Ms(u,`Disj`),[`abdisj`])||l(Ps(o,`Disj`),[`abdisj_inverse`])||l(d,[`abconj`])||l(Ps(o,`Conj`),[`abconj_inverse`,`pconj_inverse`])||l(f&&p&&[f[0],p],[`pconj_inverse`])?i.isPremise=!0:l(Ms(o,`Equiv`),[`equiv`])?(i.isPremise=!0,i.isLeftBoolean=!0,i.isRightBoolean=!0):l(Ms(o,`Eq`),[`equiv`])?i.isPremise=!0:m&&h&&s(m[0])?i.isLeftBoolean=!0:m&&h&&c(m[0])?i.isRightBoolean=!0:l(Ms(o,`Implies`),[`implies`])&&(i.isPremise=!0)}),!i.isPremise||!i.isLeftBoolean||!i.isRightBoolean)throw new e.w(`ENABLEDaxioms proof directive did not succeed.
41
+ `);return{...t,active:js}},zs={Constant:0,State:1,Action:2,Temporal:3},Bs=(e,t,n)=>e.every((e,r)=>r<t.length&&n(e,t[r]))&&e.length===t.length,Vs=e=>[...new Map(e.toReversed().map(e=>[e.name,e.value]))].toSorted((e,t)=>e[0]<t[0]?-1:1),Hs=(t,n)=>{let r=it(t,n-1);if(!r)throw new e.j;let i=r.hyp;if(i.kind===`Fresh`)return{name:i.name,kind:i.level,level:zs[i.level]??-1};if(i.kind===`Flex`)return{name:i.name,kind:`Variable`,level:1};if(i.kind===`Defn`&&i.definition.kind===`Operator`){let e=vr(r.rest,i.definition.body).level;return{name:i.definition.name,kind:`Definition`,level:e}}throw new e.j},Us=(e,t)=>N(e,t.map(lt)),Ws=(e,t)=>N(e,t.map(ut)),Gs=(e,t)=>N(e,t.map(dt)),Ks=(e,t)=>N(e,t.map(e=>({kind:`Flex`,name:e}))),qs=(t,n,r,i)=>{let a=/* @__PURE__ */ new Map,o=(e,t,n,r)=>{let i=Hs(e,n),o=Hs(t,r);if(i.kind===`Unknown`)return n===r;if(i.kind===`Variable`||i.kind===`Definition`)return i.name===o.name&&o.kind===i.kind;let s=zs[o.kind];if(!(s!==void 0&&s<=i.level||o.kind===`Definition`&&o.level<=i.level))return!1;let c=a.get(i.name);return c===void 0?(a.set(i.name,o.name),!0):c===o.name},s=(e,t,n,r)=>{if(n.kind===`Operator`&&r.kind===`Operator`||n.kind===`Bpragma`&&r.kind===`Bpragma`)return p(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)=>N(e,t.map(e=>ot(e,`Unknown`))),s=e=>Vs(e.substitutions.map(e=>({name:e.name,value:e.expression})));return Bs(i,a,(e,t)=>e===t)&&n.instance.module===r.instance.module&&c(o(e,i),o(t,a),s(n.instance),s(r.instance))},c=(e,t,n,r)=>Bs(n,r,(n,r)=>n[0]===r[0]&&p(e,t,n[1],r[1])),l=(e,t,n,r)=>Bs(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`?p(e,t,i.expression,a.expression):i.kind===a.kind&&i.kind!==`Domain`}),u=(e,t,n,r)=>n.kind===`Fresh`&&r.kind===`Fresh`?n.level!==r.level||n.shape!==r.shape?!1:n.domain&&r.domain?p(e,t,n.domain,r.domain):!n.domain&&!r.domain:n.kind===`Flex`&&r.kind===`Flex`?!0:n.kind===`Defn`&&r.kind===`Defn`?s(e,t,n.definition,r.definition)&&n.isLocal===r.isLocal:n.kind===`Fact`&&r.kind===`Fact`&&p(e,t,n.expression,r.expression),d=(e,t,n,r)=>n.length===0||r.length===0?n.length===r.length:u(e,t,n[0],r[0])&&d(M(e,n[0]),M(t,r[0]),n.slice(1),r.slice(1)),f=(e,t,n,r)=>!n.domain||!r.domain?!n.domain&&!r.domain&&p(M(e,ot(n.name,`Constant`)),M(t,ot(r.name,`Constant`)),n.body,r.body):p(e,t,n.domain,r.domain)&&p(M(e,st(n.name,n.domain)),M(t,st(r.name,r.domain)),n.body,r.body),p=(t,n,r,i)=>{if(r.kind===`Parens`)return p(t,n,r.expression,i);if(i.kind===`Parens`)return p(t,n,r,i.expression);let a=(e,r)=>p(t,n,e,r),u=(e,t)=>Bs(e,t,a);switch(r.kind){case`Ix`:return i.kind===`Ix`&&o(t,n,r.index,i.index);case`Opaque`:return i.kind===`Opaque`&&r.name===i.name;case`Internal`:return i.kind===`Internal`&&r.builtin===i.builtin;case`Lambda`:return i.kind===`Lambda`&&r.params.length===i.params.length&&p(Ws(t,r.params),Ws(n,i.params),r.body,i.body);case`Apply`:return i.kind===`Apply`&&a(r.operator,i.operator)&&u(r.args,i.args);case`Sequent`:return i.kind===`Sequent`&&d(t,n,r.sequent.context,i.sequent.context)&&p(N(t,r.sequent.context),N(n,i.sequent.context),r.sequent.active,i.sequent.active);case`Bang`:{if(i.kind!==`Bang`||!a(r.expression,i.expression))return!1;let t=i.selectors,n=r.selectors.every((e,n)=>{let r=t[n];return r?e.kind===`Number`&&r.kind===`Number`?e.value===r.value:e.kind===`Instance`&&r.kind===`Instance`?u(e.args,r.args):e.kind===`Label`&&r.kind===`Label`?e.label===r.label&&u(e.args,r.args):e.kind===r.kind:!0});if(n&&r.selectors.length!==t.length)throw new e.j(`Invalid_argument`);return n}case`With`:return i.kind===`With`&&a(r.expression,i.expression);case`Let`:return i.kind===`Let`&&Bs(r.definitions,i.definitions,(e,r)=>s(t,n,e,r))&&p(Gs(t,r.definitions),Gs(n,i.definitions),r.body,i.body);case`If`:return i.kind===`If`&&a(r.condition,i.condition)&&a(r.consequent,i.consequent)&&a(r.alternative,i.alternative);case`List`:return i.kind===`List`&&r.bullet===i.bullet&&u(r.items,i.items);case`Quant`:return i.kind===`Quant`&&r.quantifier===i.quantifier&&l(t,n,r.bounds,i.bounds)&&p(Us(t,r.bounds),Us(n,r.bounds),r.body,i.body);case`Tquant`:return i.kind===`Tquant`&&r.quantifier===i.quantifier&&Bs(r.names,i.names,(e,t)=>e===t)&&p(Ks(t,r.names),Ks(n,i.names),r.body,i.body);case`Choose`:case`SetSt`:return i.kind===r.kind&&f(t,n,r,i);case`SetOf`:return i.kind===`SetOf`&&p(Us(t,r.bounds),Us(n,i.bounds),r.element,i.element)&&l(t,n,r.bounds,i.bounds);case`SetEnum`:return i.kind===`SetEnum`&&u(r.elements,i.elements);case`Arrow`:return i.kind===`Arrow`&&a(r.domain,i.domain)&&a(r.range,i.range);case`Fcn`:return i.kind===`Fcn`&&l(t,n,r.bounds,i.bounds)&&p(Us(t,r.bounds),Us(n,i.bounds),r.body,i.body);case`FcnApp`:return i.kind===`FcnApp`&&u([r.function,...r.args],[i.function,...i.args]);case`Tuple`:return i.kind===`Tuple`&&u(r.elements,i.elements);case`Product`:return i.kind===`Product`&&u(r.factors,i.factors);case`Rect`:case`Record`:return i.kind===r.kind&&c(t,n,Vs(r.fields),Vs(i.fields));case`Except`:return i.kind===`Except`&&a(r.function,i.function)&&Bs(r.specs,i.specs,(e,t)=>Bs(e.trail,t.trail,(e,t)=>e.kind===`Dot`?t.kind===`Dot`&&e.field===t.field:t.kind===`Apply`&&a(e.expression,t.expression))&&a(e.value,t.value));case`Dot`:return i.kind===`Dot`&&a(r.expression,i.expression)&&r.field===i.field;case`Sub`:case`Tsub`:return i.kind===r.kind&&r.modal===i.modal&&a(r.action,i.action)&&a(r.subscript,i.subscript);case`Fair`:return i.kind===`Fair`&&r.fairness===i.fairness&&a(r.subscript,i.subscript)&&a(r.action,i.action);case`Case`:{if(i.kind!==`Case`)return!1;let e=r.arms[0],t=i.arms[0];return(e&&t?a(e.condition,t.condition)&&a(e.body,t.body):!e&&!t)?r.other&&i.other?a(r.other,i.other):!r.other&&!i.other:!1}case`String`:return i.kind===`String`&&r.value===i.value;case`Num`:return i.kind===`Num`&&r.integer===i.integer&&r.fraction===i.fraction;case`At`:return i.kind===`At`&&r.isExcept===i.isExcept}},m=p(t,n,r,i),h=nt(t),g=[...a].map(t=>t[0]===t[1]||h.reduce((n,r)=>{if(r.kind===`Fact`)return n;if(r.kind===`Defn`&&r.definition.kind!==`Operator`)throw new e.j;return n||(r.kind===`Defn`?r.definition.name:r.name)===t[0]},!1));return m&&g.every(Boolean)},Js=t=>{let n=N(void 0,t.context);if(!t.context.some((e,r)=>{if(e.kind!==`Fact`||e.visibility!==`Visible`)return!1;let i=it(n,t.context.length-r),a=e.expression;return a.kind===`Sequent`?qs(N(i,a.sequent.context),n,a.sequent.active,t.active):qs(i,n,a,t.active)}))throw new e.w(`LevelComparison proof directive did not succeed.
42
+ `);return{...t,active:{kind:`Internal`,builtin:`TRUE`}}},Ys=/* @__PURE__ */ new Set([`expandenabled`,`expandcdot`,`autouse`,`lambdify`,`enabledaxioms`,`levelcomparison`]),Xs=[{prover:`smt`,timeLimitMs:5e3},{prover:`zenon`,timeLimitMs:1e4},{prover:`isabelle`,timeLimitMs:3e4,tactic:`auto`}],Zs={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([...Ys].map(e=>[e,{prover:e,seconds:0}]))},Qs=(t,n,r,i)=>{let a=Zs[t];if(!a)throw new e.w(`Unknown prover: ${t}`);if(r!==void 0&&!a.isBudgeted)throw new e.w(`A Z3 rlimit budget ("rN") is only supported by the SMT and Z3 backends.`);return{prover:a.prover,timeLimitMs:r===void 0?(n??a.seconds)*1e3:1/0,...r!==void 0&&{rlimit:r},...a.prover===`isabelle`&&{tactic:i??`auto`}}},$s=t=>{let n=Number.parseFloat(t.slice(1));if(!/^[rR]./.test(t)||!Number.isFinite(n)||n<=0)throw new e.w(`Invalid SMT budget "${t}"`);return Math.max(1,Math.trunc(Math.min(n*3e6,4294967295)))},ec=(t,n)=>{let r=t.reduce((t,n)=>{let r=n.value,i=r.kind===`Default`?t.args[0]:void 0,a=r.kind===`Default`?t.args.slice(1):t.args;if(r.kind===`Default`&&!i)throw new e.w(`Some arguments are missing`);let o=r.kind===`String`?r.value:i?.kind===`String`?i.value:void 0;switch(n.hint){case`prover`:case`tactic`:if(o===void 0)throw new e.w(`This argument should be a string`);return{...t,args:a,[n.hint]:o};case`timeout`:if(r.kind===`Float`)return{...t,args:a,timeout:r.value};if(o!==void 0)return{...t,args:a,rlimit:$s(o)};if(i?.kind!==`Num`)throw new e.w(`This argument should be a number of seconds`);return{...t,args:a,timeout:Number(`${i.integer}.${i.fraction}`)};default:throw new e.w(`Unknown keyword in proof method definition: ${n.hint}`)}},{args:n});if(r.args.length>0)throw new e.w(`Too many arguments`);if(r.prover===void 0)throw new e.w(`Missing prover name`);return Qs(r.prover,r.timeout,r.rlimit,r.tactic)},tc=e=>Qs(e.name,e.timeout,void 0,e.tactic),nc=t=>{let n=[],r={methods:[],useLocation:null};return t.context.forEach((t,i)=>{let a=t.kind===`Fact`&&t.visibility===`Visible`&&t.expression;if(a&&a.kind===`With`){r.methods.push(tc(a.method)),n.push(void 0);return}if(t.kind===`Defn`&&t.definition.kind===`Bpragma`){n.push({kind:`Premeth`,groups:t.definition.methods});return}if(t.kind===`Defn`&&t.definition.kind===`Operator`&&t.visibility===`Visible`){let e=t.definition.body;n.push(e.kind===`With`?{kind:`Meth`,method:e.method}:void 0);return}if(n.push(void 0),!a||t.kind!==`Fact`)return;let o=a.kind===`Apply`?a.operator:a;if(o.kind!==`Ix`)return;let s=n[i-o.index];if(s?.kind===`Premeth`){t.useLocation!==r.useLocation&&(r.methods=[],r.useLocation=t.useLocation);let e=a.kind===`Apply`?a.args:[];r.methods.push(...s.groups.map(t=>ec(t,e)))}else if(s?.kind===`Meth`){if(a.kind===`Apply`)throw new e.j;r.methods.push(tc(s.method))}}),r.methods},rc=e=>{let t=e.method===void 0?nc(e.sequent):[tc(e.method)],n=t.filter(e=>!Ys.has(e.prover));return{frontends:new Set(t.flatMap(e=>Ys.has(e.prover)?[e.prover]:[])),provers:n.length>0?n:Xs}},ic=e=>P(I(0),(t,n)=>n.kind===`Defn`&&(e&&n.definition.kind===`Bpragma`||n.definition.kind===`Operator`&&n.visibility===`Visible`)?[bt(L(t,n.definition.body),t),void 0]:[St(1,t),Ot(t,n)]),ac=ic(!0),oc=ic(!1),sc=(e,t=!0)=>{let n=(t?ac:oc)(e.context);return{context:n.context,active:L(n.state,e.active)}},cc=/* @__PURE__ */ new Set([`BoxTrue`,`BoxFalse`,`Diamond`,`Actplus`,`Leadsto`,`Cdot`]),lc=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]}},uc=e=>{if(e.kind===`Tsub`||e.kind===`Fair`||e.kind===`Apply`&&e.operator.kind===`Internal`&&cc.has(e.operator.builtin))return!1;if(e.kind===`Sequent`){let t=e.sequent;return[...t.context.flatMap(lc),t.active].every(uc)}return yt(e).every(uc)},dc=t=>{if(t.kind!==`Let`)return vt(t,dc);let[n,...r]=t.definitions;if(!n)return dc(t.body);if(n.kind!==`Operator`&&n.kind!==`Bpragma`)throw new e.C(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=dc(n.body),a={...t,definitions:r};return dc(L(bt(i,I(0)),a))},fc=(e,t)=>t.kind===`Dot`?A({kind:`Dot`,expression:e,field:t.field},e):A({kind:`FcnApp`,function:e,args:[t.expression]},e),pc=(e,t)=>e.kind===`Dot`?t.kind===`Dot`&&e.field===t.field:t.kind===`Apply`&&z(e.expression,t.expression),mc=(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},hc=e=>{if(e.kind!==`Except`)return vt(e,hc);let t=e,n=(e,t)=>mc(e,t)?.value??fc(e,t),r=(e,n,r)=>{let i=mc(e,n);if(e.kind!==`Record`||!i)return A({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 A({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||!pc(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(hc(t.function),ht(t.specs,hc))},gc=P(!0,(e,t)=>[e&&lc(t).every(uc),_t(t,dc,`all`)]),_c=P(void 0,(e,t)=>[void 0,_t(t,hc,`all`)]),vc=e=>{let t=gc(e.context),n=dc(e.active);return t.state&&uc(e.active)?{context:_c(e.context,t.context).context,active:hc(n)}:{context:t.context,active:n}},yc=(t,n)=>{let r=n.has(`expandenabled`),i=n.has(`expandcdot`),a=n.has(`autouse`),o=n.has(`lambdify`);if(!r&&!i&&!o)return n.has(`levelcomparison`)?Js(t):n.has(`enabledaxioms`)?Rs(t):t;let s=Tn({value:0},()=>{throw new e.j},()=>{}),c={kind:`Sequent`,sequent:t},l=r||i?Wr(s,()=>{},void 0,c,{isEnabled:r,isCdot:i,isAutoUse:a}):Vr(s,()=>{},void 0,c,{isEnabled:!0,isCdot:!0,isAutoUse:a});if(l.kind!==`Sequent`)throw new e.j;return l.sequent},bc=(e,t=rc(e))=>yc(vc(sc(e.sequent)),t.frontends),xc=e=>e.active.kind===`Internal`&&e.active.builtin===`TRUE`||e.context.some((t,n)=>t.kind===`Fact`?z(t.expression,R(n-e.context.length,e.active)):t.kind!==`Fresh`||!t.domain?!1:z(j(`Mem`,[{kind:`Ix`,index:1},R(1,t.domain)],{}),R(n+1-e.context.length,e.active))),Sc=e=>e.domain.kind===`NoDomain`,Cc=e=>{if(e.kind===`List`&&(e.bullet===`And`||e.bullet===`Refs`)){let t=e.items.map(Cc),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=Cc(e.args[0]),n=Cc(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(Sc)){let t=Cc(e.body),n=(t,n)=>A({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]},wc=e=>{let t=[],n=e.context.reduce((e,n)=>{if(n.kind!==`Fact`||n.visibility!==`Visible`)return t.push(Ot(e,n)),St(1,e);let r=Cc(n.expression),i=[...r[1]?[r[1]]:[],...r[0]];return i.forEach((r,i)=>t.push({...n,expression:R(i,L(e,r))})),{kind:`Compose`,outer:I(i.length-1),inner:St(1,e)}},I(0));return{context:t,active:L(n,e.active)}},Tc=(e,t)=>{let[n,r]=at(e,t.context,(e,t)=>{let n=(()=>{switch(t.kind){case`Fresh`:return{...t,name:`${Yo[t.level]}_${t.name}_`,domain:t.domain&&Ec(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=Ec(e,n.body),i=Xo[vr(e,r).level];return{...t,definition:{...n,name:`${i}_${n.name}_`,body:r}}}case`Fact`:return{...t,expression:Ec(e,t.expression)}}})();return[M(e,n),n]});return{context:r,active:Ec(n,t.active)}},Ec=(e,t)=>{if(t.kind===`Sequent`)return{...t,sequent:Tc(e,t.sequent)};let n=F(e,t,Ec,M,`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:`${Yo[e.level]}_${e.name}_`}))};case`Choose`:case`SetSt`:return{...n,name:`CONSTANT_${n.name}_`};default:return n}},Dc=(e,t)=>{if(t.kind!==`Sequent`)return F(e,t,Dc,M,`all`);let n={scope:e,substitution:I(0),context:[]},r=e=>{let t=e.kind===`Fact`&&e.visibility===`Visible`&&e.time===`Always`?{...e,expression:j(`BoxTrue`,[e.expression],e.expression)}:e;n.context.push(t),n.scope=M(n.scope,t)};for(let e of t.sequent.context){let t=Ot(n.substitution,e);if(t.kind!==`Fresh`||!t.domain||e.kind!==`Fresh`||!e.domain){r(t.kind===`Fact`?{...t,expression:Dc(n.scope,t.expression)}:t),n.substitution=St(1,n.substitution);continue}let i=Dc(n.scope,t.domain);r({...t,domain:void 0}),r({kind:`Fact`,expression:j(`Mem`,[A({kind:`Ix`,index:1},i),R(1,i)],i),visibility:t.domainVisibility,time:t.level===`Constant`?_n(n.scope,e.domain):`Now`,location:t.location}),n.substitution={kind:`Compose`,outer:I(1),inner:St(1,n.substitution)}}let i=L(n.substitution,t.sequent.active);return{...t,sequent:{context:n.context,active:Dc(n.scope,i)}}},Oc={Conj:`&`,Disj:`|`,Implies:`->`,Equiv:`<->`},kc={Neg:`~`,BoxTrue:`always`,BoxFalse:`always`,Diamond:`sometime`,Prime:`next`},Ac=e=>{if(e.kind===`Internal`&&e.builtin===`TRUE`)return;if(e.kind===`List`&&e.bullet!==`Or`){let t=e.items.flatMap(e=>Ac(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=Ac(e.args[0]),n=Ac(e.args[1]);return t&&n?{...e,args:[t,n]}:t??n},jc=`(cc | ~ cc)`,Mc=e=>{let t=(e,n,r=!1)=>{let i=n=>t(e,n);switch(n.kind){case`Internal`:if(n.builtin===`TRUE`)return jc;if(n.builtin===`FALSE`)return`(cc & ~ cc)`;break;case`Apply`:{let e=n.operator,t=n.args;if(e.kind!==`Internal`)break;let r=Oc[e.builtin];if(r&&t.length===2)return`(${i(t[0])} ${r} ${i(t[1])})`;let a=kc[e.builtin];if(a&&t.length===1)return`(${a} ${i(t[0])})`;break}case`List`:{if(n.items.length===0)return jc;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?Ac(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 us(e,n)},n=Ec(void 0,{kind:`Sequent`,sequent:e});return`not (${t([],Dc(void 0,ln(sn(cn(n)))),!0)})`},Nc=(e,t)=>e<t?-1:+(e>t),Pc=(e,t)=>{if(typeof e==`number`&&typeof t==`number`)return e-t;if(typeof e==`string`&&typeof t==`string`)return Nc(e,t);if(!Array.isArray(e)||!Array.isArray(t))return 0;let n=e.findIndex((e,n)=>n>=t.length||Pc(e,t[n])!==0);return n===-1?e.length-t.length:n>=t.length?1:Pc(e[n],t[n])},Fc={"\\":`backslash_`,"+":`plussign_`,"-":`hyphen_`,"*":`asterisk_`,"/":`slash_`,"%":`percentsign_`,"^":`circumflexaccent_`,"&":`ampersand_`,"@":`atsign_`,"#":`pound_`,$:`dollarsign_`,"(":`leftparenthesis_`,")":`rightparenthesis_`,"|":`verticalbar_`,".":`period_`,":":`colon_`,"?":`questionmark_`,"!":`exclamationmark_`,"<":`lessthansign_`,">":`greaterthansign_`,"=":`equalsign_`," ":`space_`},Ic=e=>`smt__${e.replace(/[\\+\-*/%^&@#$()|.:?!<>= ]/g,e=>Fc[e]).replaceAll(`_`,`__`)}`,Lc=Ic(`TLA__`),Rc=new Map(Object.entries(Fc).map(e=>[e[1],e[0]])),zc=RegExp(`(${[...Rc.keys()].join(`|`)})`,`g`),W=e=>Ic(`TLA__${e}`),Bc=e=>e.startsWith(Lc)?e.slice(Lc.length).replaceAll(`__`,`_`).replace(zc,e=>Rc.get(e)??e):void 0,G=W(`Mem`),Vc=W(`SetExtTrigger`),Hc=W(`SubsetEq`),Uc=W(`Cup`),Wc=W(`Cap`),Gc=W(`SetMinus`),Kc=W(`Subset`),qc=W(`Union`),Jc=W(`Tt_Idv`),Yc=W(`Cast_Bool`),Xc=W(`BoolSet`),Zc=W(`StrSet`),Qc=W(`IntSet`),$c=W(`NatSet`),K=W(`Cast_Int`),q=W(`Proj_Int`),el=W(`IntLteq`),tl=W(`IntRange`),J=W(`FunApp`),nl=W(`FunDom`),rl=W(`FunIsafcn`),il=W(`FunSet`),al=W(`FunExcept`),ol=W(`TrigEq_Set$Idv$`),sl=W(`IsSetOf`),Y=W(`Seq`),X=W(`Len`),cl=W(`Cat`),ll=W(`Append`),ul=W(`Head`),dl=W(`Tail`),fl=W(`SubSeq`),pl=W(`Tuple_0`),ml={Cup:Uc,Cap:Wc,Setminus:Gc,SUBSET:Kc,UNION:qc,DOMAIN:nl,Plus:W(`IntPlus`),Minus:W(`IntMinus`),Times:W(`IntTimes`),Exp:W(`IntExp`),Quotient:W(`IntQuotient`),Remainder:W(`IntRemainder`),Uminus:W(`IntUminus`),Range:tl,Seq:Y,Len:X,BSeq:W(`BSeq`),Cat:cl,Append:ll,Head:ul,Tail:dl,SubSeq:fl},hl=(e,t)=>Array.from({length:t},(t,n)=>`${e}${n+1}`),gl=(e,t=`Idv`)=>e.map(e=>`(${e} ${t})`).join(` `),Z=(e,t,n=[],r=`Idv`)=>e.length===0?t:`(forall (${gl(e,r)}) ${n.length===0?t:`(! ${t} ${n.map(e=>`:pattern (${e.join(` `)})`).join(` `)})`})`,_l=e=>e.length===0?`true`:e.length===1?e[0]:`(and ${e.join(` `)})`,vl=e=>e.length===0?`false`:e.length===1?e[0]:`(or ${e.join(` `)})`,Q=(e,t)=>t.length===0?e:`(${e} ${t.join(` `)})`,yl=(e,t,n=`Idv`,r=`Idv`)=>`(declare-fun ${e} (${Array.from({length:t},()=>r).join(` `)}) ${n})`,bl=(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},xl=(e,t,n)=>e.replace(/[^\s()]+/g,e=>e===t?n:e),Sl=(e,t)=>t===0?e:`${e}_${t}`,Cl=()=>{let e=/* @__PURE__ */ new Map,t=/* @__PURE__ */ new Set;return{names:t,adjoin:n=>{let r=Ic(n),i=(e.get(r)??-1)+1,a=Array.from({length:t.size+1},(e,t)=>i+t).find(e=>!t.has(Sl(r,e)))??i;return{base:r,salt:a,name:Sl(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)}}}},wl=e=>{let t=Cl();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(``)}}},Tl=/* @__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(`.`),El=/* @__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(`.`),Dl=[`TIntPlus`,`TIntUminus`,`TIntMinus`,`TIntTimes`,`TIntQuotient`,`TIntRemainder`,`TIntLteq`],$=(e,t,n,r)=>({name:e,args:t,label:r??[e,...t.flat()].join(` `),formula:n}),Ol=e=>`${e.name} ${JSON.stringify(e.args)}`,kl=e=>{let t=Tl.indexOf(e.name);return t===-1?Tl.length+El.indexOf(e.name):t},Al=(e,t)=>kl(e)-kl(t)||Pc(e.args,t.args),jl={IntPlus:[`+`,2],IntMinus:[`-`,2],IntTimes:[`*`,2],IntUminus:[`-`,1],IntQuotient:[`div`,2],IntRemainder:[`mod`,2],IntLteq:[`<=`,2]},Ml=e=>{let t=jl[e][0],n=t===`div`||t===`mod`,r=jl[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`,[Dl.indexOf(`T${e}`)],Z(r,n?`(=> (> y 0) ${a})`:a,[[i]],`Int`),`Typing T${e}`)},Nl=e=>{let t=W(`SetEnum_${e}`),n=hl(`a`,e),r=Q(t,n),i=$(`EnumDefElim`,[e],Z([...n,`x`],e===0?`(not (${G} x ${r}))`:`(=> (${G} x ${r}) ${vl(n.map(e=>`(= x ${e})`))})`,[[`(${G} x ${r})`]]));return e===0?[i]:[$(`EnumDefIntro`,[e],Z(n,_l(n.map(e=>`(${G} ${e} ${r})`)),[[r]])),i]},Pl=e=>Array.from({length:e},(e,t)=>`(${K} ${t+1})`),Fl=e=>e.map(e=>W(`StrLit_${e}`)),Il=(e,t,n,r)=>{let i=hl(`x`,r.length);return r.map((r,a)=>{let o=`(${al} ${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]]))})},Ll=e=>Il(`Tup`,[e],W(`Tuple_${e}`),Pl(e)),Rl=e=>Il(`Rec`,[e],W(`Record_${e.join(`_`)}`),Fl(e)),zl=(e,t,n,r)=>{let i=hl(`x`,r.length),a=Q(n,i),o=$(`${e}Isafcn`,t,Z(i,`(${rl} ${a})`,[[a]]));return r.length===0?[o]:[o,$(`${e}DomDef`,t,Z(i,`(= (${nl} ${a}) ${Q(W(`SetEnum_${r.length}`),r)})`,[[a]])),$(`${e}AppDef`,t,Z(i,_l(r.map((e,t)=>`(= (${J} ${a} ${e}) ${i[t]})`)),[[a]]))]},Bl=(e,t)=>{let n=W(`Tuple_${e}`),r=hl(`x`,e),i=Q(n,r);return[...zl(`Tup`,[e],n,Pl(e)),$(`SeqTupTyping`,[e],Z([`a`,...r],e===0?`(${G} ${i} (${Y} a))`:`(=> ${_l(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?Ll(e):[]]},Vl=(e,t)=>[...zl(`Rec`,[e],W(`Record_${e.join(`_`)}`),Fl(e)),...t?Rl(e):[]],Hl=(e,t,n,r,i,a)=>{let o=hl(`s`,i.length),s=hl(`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],`(=> ${_l(s.map((e,t)=>`(${G} ${e} ${o[t]})`))} (${G} ${l} ${c}))`,[[l,c]])),$(`${e}Elim`,t,Z([...o,a],`(=> (${G} ${a} ${c}) ${_l([`(= ${a} ${Q(r,u)})`,...u.map((e,t)=>`(${G} ${e} ${o[t]})`)])})`,[[`(${G} ${a} ${c})`]]))]},Ul=[`Mem`,`Seq`,`Len`,`FunApp`,`NatSet`,`Cast_Int`,`Proj_Int`],Wl=(t,n)=>{let r=(e,t,n)=>({declaration:e,deps:t,axioms:n}),i=W(t),a=(e,t,n,a=`Idv`)=>r(yl(i,e,a),t,n),o=/^SetEnum_(\d+)$/.exec(t);if(o)return a(Number(o[1]),[`Mem`],Nl(Number(o[1])));let s=/^SetOf_(\d+)$/.exec(t);if(s){let e=Number(s[1]);return r(void 0,[`Mem`,`IsSetOf`],[$(`SetOfIntro`,[e],void 0),$(`SetOfElim`,[e],void 0),$(`AssertIsSetOf`,[e],void 0),$(`CompareSetOfTrigger`,[],Z([`a`,`b`],`(${Vc} a b)`,[[`(${sl} a)`,`(${sl} b)`]]))])}if(t.startsWith(`StrLit_`)){let e=t.slice(7),r=n.strings.map(t=>$(`StrLitDistinct`,[e,t],`(distinct ${i} ${W(`StrLit_${t}`)})`));return n.strings.push(e),a(0,[`Mem`,`StrSet`],[$(`StrLitIsstr`,[e],`(${G} ${i} ${Zc})`),...r])}let c=/^Tuple_(\d+)$/.exec(t);if(c){let e=Number(c[1]);return n.tuples.push(e),a(e,e===0?[`FunIsafcn`,`Cast_Int`,`Seq`,`Len`]:[`FunIsafcn`,`FunDom`,`FunApp`,`SetEnum_${e}`,`Cast_Int`,`Mem`,`Seq`,`Len`],Bl(e,n.isExcept))}let l=/^Product_(\d+)$/.exec(t);if(l){let e=Number(l[1]);return a(e,[`Mem`,`Tuple_${e}`,`FunApp`,`Cast_Int`,`Proj_Int`],Hl(`Product`,[e],i,W(`Tuple_${e}`),Pl(e),`t`))}let u=n.recordFields.get(t);if(u&&t.startsWith(`Record_`))return n.records.push(u),a(u.length,[`FunIsafcn`,`FunDom`,`FunApp`,`SetEnum_${u.length}`,...u.map(e=>`StrLit_${e}`)],Vl(u,n.isExcept));if(u&&t.startsWith(`RecordSet_`)){let e=`Record_${u.join(`_`)}`;return a(u.length,[`Mem`,e,`FunApp`,...u.map(e=>`StrLit_${e}`)],Hl(`RecSet`,[u],i,W(e),Fl(u),`r`))}let d=n.anonymous.get(t);if(d!==void 0)return a(d,[],[]);let f=jl[t];if(f)return a(f[1],[`Cast_Int`],[Ml(t)],t===`IntLteq`?`Bool`:`Idv`);switch(t){case`IntExp`:return a(2,[`Mem`,`IntSet`,`Cast_Int`,`TIntLteq`,`TIntLit_0`,`TIntLit_1`],[$(`IntExpTyping`,[],`(forall ((x Idv) (y Idv)) (! (=> (and (${G} x ${Qc}) (${G} y ${Qc}) (or (distinct x (${K} 0)) (${el} (${K} 1) y))) (${G} (${i} x y) ${Qc})) :pattern ((${i} x y))))`)]);case`SelectSeq`:return r(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 r(void 0,[],[$(`ChooseDef`,[],void 0)]);case`Mem`:return a(2,[`SetExtTrigger`],[$(`SetExt`,[],`(forall ((x Idv) (y Idv)) (! (=> (forall ((z Idv)) (= (${G} z x) (${G} z y))) (= x y)) :pattern ((${Vc} x y))))`)],`Bool`);case`SubsetEq`:return a(2,[`Mem`],[$(`SubsetEqIntro`,[],`(forall ((x Idv) (y Idv)) (! (=> (forall ((z Idv)) (=> (${G} z x) (${G} z y))) (${Hc} x y)) :pattern ((${Hc} x y))))`),$(`SubsetEqElim`,[],`(forall ((x Idv) (y Idv) (z Idv)) (! (=> (and (${Hc} x y) (${G} z x)) (${G} z y)) :pattern ((${Hc} x y) (${G} z x))))`)],`Bool`);case`Union`:return a(1,[`Mem`],[$(`UnionIntro`,[],`(forall ((a Idv) (x Idv) (y Idv)) (! (=> (and (${G} y a) (${G} x y)) (${G} x (${qc} a))) :pattern ((${G} y a) (${G} x (${qc} a))) :pattern ((${G} x y) (${G} x (${qc} a))) :pattern ((${G} y a) (${G} x y) (${qc} a))))`),$(`UnionElim`,[],`(forall ((a Idv) (x Idv)) (! (=> (${G} x (${qc} a)) (exists ((y Idv)) (and (${G} y a) (${G} x y)))) :pattern ((${G} x (${qc} a)))))`)]);case`Subset`:return a(1,[`Mem`,`SubsetEq`],[$(`SubsetDefAlt`,[],`(forall ((a Idv) (x Idv)) (! (= (${G} x (${Kc} a)) (${Hc} x a)) :pattern ((${G} x (${Kc} a))) :pattern ((${Hc} x a) (${Kc} a))))`)]);case`Cup`:case`Cap`:case`SetMinus`:{let e=t===`Cup`?`(or (MEM x a) (MEM x b))`:t===`Cap`?`(and (MEM x a) (MEM x b))`:`(and (MEM x a) (not (MEM x b)))`,n=$(`${t}Def`,[],`(forall ((a Idv) (b Idv) (x Idv)) (! (= (${G} x (${i} a b)) ${e.replaceAll(`MEM`,G)}) :pattern ((${G} x (${i} a b))) :pattern ((${G} x a) (${i} a b)) :pattern ((${G} x b) (${i} a b))))`);return t===`Cap`?a(2,[`Mem`,`SetEnum_0`,`SetExtTrigger`],[n,$(`DisjointTrigger`,[],`(forall ((x Idv) (y Idv)) (! (${Vc} (${Wc} x y) ${W(`SetEnum_0`)}) :pattern ((${Wc} x y))))`)]):a(2,[`Mem`],[n])}case`SetSt`:return r(void 0,[`Mem`,`SetEnum_0`,`SetExtTrigger`],[$(`SetStDef`,[],void 0),$(`EmptyComprehensionTrigger`,[],void 0)]);case`NatSet`:return a(0,[`IntSet`,`TIntLit_0`,`Cast_Int`,`IntLteq`],[$(`NatSetDef`,[],`(forall ((x Idv)) (! (= (${G} x ${$c}) (and (${G} x ${Qc}) (${el} (${K} 0) x))) :pattern ((${G} x ${$c}))))`)]);case`IntRange`:return a(2,[`Mem`,`IntSet`,`IntLteq`],[$(`IntRangeDef`,[],`(forall ((a Idv) (b Idv) (x Idv)) (! (= (${G} x (${tl} a b)) (and (${G} x ${Qc}) (${el} a x) (${el} x b))) :pattern ((${G} x (${tl} a b)))))`)]);case`FunIsafcn`:return a(1,[`Mem`,`FunDom`,`FunFcn`,`FunApp`],[$(`FunExt`,[],`(forall ((f Idv) (g Idv)) (! (=> (and (${rl} f) (${rl} g) (= (${nl} f) (${nl} g)) (forall ((x Idv)) (=> (${G} x (${nl} f)) (= (${J} f x) (${J} g x))))) (= f g)) :pattern ((${rl} f) (${rl} g))))`)],`Bool`);case`FunSet`:return n.isFunSet=!0,a(2,[`Mem`,`FunIsafcn`,`FunDom`,`FunApp`],[$(`FunSetIntro`,[],`(forall ((a Idv) (b Idv) (f Idv)) (! (=> (and (${rl} f) (= (${nl} f) a) (forall ((x Idv)) (=> (${G} x a) (${G} (${J} f x) b)))) (${G} f (${il} a b))) :pattern ((${G} f (${il} a b)))))`),$(`FunSetElim1`,[],`(forall ((a Idv) (b Idv) (f Idv)) (! (=> (${G} f (${il} a b)) (and (${rl} f) (= (${nl} f) a))) :pattern ((${G} f (${il} a b)))))`),$(`FunSetElim2`,[],`(forall ((a Idv) (b Idv) (f Idv) (x Idv)) (! (=> (and (${G} f (${il} a b)) (${G} x a)) (${G} (${J} f x) b)) :pattern ((${G} f (${il} a b)) (${G} x a)) :pattern ((${G} f (${il} a b)) (${J} f x))))`),...n.isFunConstr?[$(`FunTyping`,[],void 0)]:[]]);case`FunFcn`:return n.isFunConstr=!0,r(void 0,[`FunIsafcn`],[$(`FunConstrIsafcn`,[],void 0),...n.isFunSet?[$(`FunTyping`,[],void 0)]:[]]);case`FunDom`:return a(1,[`FunFcn`],[$(`FunDomDef`,[],void 0)]);case`FunApp`:return a(2,[`Mem`,`FunFcn`],[$(`FunAppDef`,[],void 0)]);case`FunExcept`:{n.isExcept=!0;let e=`(${al} f x y)`;return a(3,[`Mem`,`FunIsafcn`,`FunDom`,`FunApp`],[$(`FunExceptIsafcn`,[],`(forall ((f Idv) (x Idv) (y Idv)) (! (${rl} ${e}) :pattern (${e})))`),$(`FunExceptDomDef`,[],`(forall ((f Idv) (x Idv) (y Idv)) (! (= (${nl} ${e}) (${nl} f)) :pattern (${e})))`),$(`FunExceptAppDef1`,[],`(forall ((f Idv) (x Idv) (y Idv)) (! (=> (${G} x (${nl} f)) (= (${J} ${e} x) y)) :pattern (${e})))`),$(`FunExceptAppDef2`,[],`(forall ((f Idv) (x Idv) (y Idv) (z Idv)) (! (=> (${G} z (${nl} 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))))`),...n.tuples.flatMap(Ll),...n.records.flatMap(Rl)])}case`Seq`:return a(1,[`Mem`,`Len`,`FunIsafcn`,`FunDom`,`FunApp`,`IntSet`,`NatSet`,`IntRange`,`Cast_Int`,`Proj_Int`],[$(`SeqSetIntro`,[],`(forall ((a Idv) (s Idv)) (! (=> (and (${rl} s) (>= (${q} (${X} s)) 0) (forall ((i Idv)) (= (${G} i (${nl} s)) (and (${G} i ${Qc}) (<= 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 (${rl} s) (${G} (${X} s) ${$c}) (= (${nl} s) (${tl} (${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 a(1,[`FunDom`,`IntRange`,`Cast_Int`],[$(`SeqLenDef`,[],`(forall ((s Idv) (z Int)) (=> (and (>= z 0) (= (${nl} s) (${tl} (${K} 1) (${K} z)))) (= (${X} s) (${K} z))))`)]);case`BSeq`:return a(1,[],[]);case`Cat`:return a(2,Ul,[$(`SeqCatTyping`,[],`(forall ((a Idv) (s Idv) (t Idv)) (! (=> (and (${G} s (${Y} a)) (${G} t (${Y} a))) (${G} (${cl} s t) (${Y} a))) :pattern ((${G} s (${Y} a)) (${cl} s t)) :pattern ((${G} t (${Y} a)) (${cl} s t))))`),$(`SeqCatLen`,[],`(forall ((s Idv) (t Idv)) (! (=> (and (${G} (${X} s) ${$c}) (${G} (${X} t) ${$c})) (= (${X} (${cl} s t)) (${K} (+ (${q} (${X} s)) (${q} (${X} t)))))) :pattern ((${cl} s t))))`),$(`SeqCatApp1`,[],`(forall ((s Idv) (t Idv) (i Int)) (! (=> (and (${G} (${X} s) ${$c}) (${G} (${X} t) ${$c}) (<= 1 i) (<= i (${q} (${X} s)))) (= (${J} (${cl} s t) (${K} i)) (${J} s (${K} i)))) :pattern ((${J} (${cl} s t) (${K} i))) :pattern ((${cl} s t) (${J} s (${K} i)))))`),$(`SeqCatApp2`,[],`(forall ((s Idv) (t Idv) (i Int)) (! (=> (and (${G} (${X} s) ${$c}) (${G} (${X} t) ${$c}) (<= i (+ (${q} (${X} s)) (${q} (${X} t)))) (< (${q} (${X} s)) i)) (= (${J} (${cl} s t) (${K} i)) (${J} t (${K} (- i (${q} (${X} s))))))) :pattern ((${J} (${cl} s t) (${K} i)))))`)]);case`Append`:return a(2,Ul,[$(`SeqAppendTyping`,[],`(forall ((a Idv) (s Idv) (x Idv)) (! (=> (and (${G} s (${Y} a)) (${G} x a)) (${G} (${ll} s x) (${Y} a))) :pattern ((${G} s (${Y} a)) (${ll} s x))))`),$(`SeqAppendLen`,[],`(forall ((s Idv) (x Idv)) (! (=> (${G} (${X} s) ${$c}) (= (${X} (${ll} s x)) (${K} (+ (${q} (${X} s)) 1)))) :pattern ((${ll} s x))))`),$(`SeqAppendApp1`,[],`(forall ((s Idv) (x Idv) (i Int)) (! (=> (and (${G} (${X} s) ${$c}) (<= 1 i) (<= i (${q} (${X} s)))) (= (${J} (${ll} s x) (${K} i)) (${J} s (${K} i)))) :pattern ((${J} (${ll} s x) (${K} i))) :pattern ((${ll} s x) (${J} s (${K} i)))))`),$(`SeqAppendApp2`,[],`(forall ((s Idv) (x Idv)) (! (=> (${G} (${X} s) ${$c}) (= (${J} (${ll} s x) (${K} (+ (${q} (${X} s)) 1))) x)) :pattern ((${ll} s x))))`)]);case`Head`:return a(1,[`FunApp`,`Cast_Int`],[$(`SeqHeadDef`,[],`(forall ((s Idv)) (! (= (${ul} s) (${J} s (${K} 1))) :pattern ((${ul} s))))`)]);case`Tail`:return a(1,Ul,[$(`SeqTailTyping`,[],`(forall ((a Idv) (s Idv)) (! (=> (and (${G} s (${Y} a)) (distinct (${q} (${X} s)) 0)) (${G} (${dl} s) (${Y} a))) :pattern ((${G} s (${Y} a)) (${dl} s))))`),$(`SeqTailLen`,[],`(forall ((s Idv)) (! (=> (and (${G} (${X} s) ${$c}) (distinct (${q} (${X} s)) 0)) (= (${X} (${dl} s)) (${K} (- (${q} (${X} s)) 1)))) :pattern ((${dl} s))))`),$(`SeqTailApp`,[],`(forall ((s Idv) (i Int)) (! (=> (and (${G} (${X} s) ${$c}) (distinct (${q} (${X} s)) 0) (<= 1 i) (<= i (- (${q} (${X} s)) 1))) (= (${J} (${dl} s) (${K} i)) (${J} s (${K} (+ i 1))))) :pattern ((${J} (${dl} s) (${K} i)))))`)]);case`SubSeq`:{let e=`(${fl} s (${K} x) (${K} y))`;return a(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 r(yl(i,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) ${Qc}) :pattern ((${K} z))))`),$(`TypeGuardElim`,[`Int`],`(forall ((x Idv)) (! (=> (${G} x ${Qc}) (= x (${K} (${q} x)))) :pattern ((${G} x ${Qc}))))`)]);case`Cast_Bool`:return r(yl(i,1,`Idv`,`Bool`),[`Mem`,`BoolSet`,`Tt_Idv`],[$(`CastInjAlt`,[`Bool`],`(and (= (${Yc} true) ${Jc}) (distinct (${Yc} false) ${Jc}))`),$(`TypeGuardIntro`,[`Bool`],`(forall ((z Bool)) (! (${G} (${Yc} z) ${Xc}) :pattern ((${Yc} z))))`),$(`TypeGuardElim`,[`Bool`],`(forall ((x Idv)) (! (=> (${G} x ${Xc}) (or (= x (${Yc} true)) (= x (${Yc} false)))) :pattern ((${G} x ${Xc}))))`)]);case`Proj_Int`:return r(yl(i,1,`Int`),[],[]);case`TrigEq_Set$Idv$`:return a(2,[`SetExtTrigger`],[$(`ExtTrigEqDef`,[`Set$Idv$`],`(forall ((x Idv) (y Idv)) (! (= (${ol} x y) (= x y)) :pattern ((${ol} x y))))`),$(`ExtTrigEqTrigger`,[`Idv`],`(forall ((x Idv) (y Idv)) (! (${Vc} x y) :pattern ((${ol} x y))))`)],`Bool`);case`SetExtTrigger`:case`IsSetOf`:return a(t===`IsSetOf`?1:2,[],[],`Bool`);case`BoolSet`:case`StrSet`:case`IntSet`:case`Tt_Idv`:return a(0,[],[]);case`TIntLteq`:return r(void 0,[`IntLteq`],[Ml(`IntLteq`)]);default:if(t.startsWith(`TIntLit_`))return r(void 0,[],[]);throw new e.k(`the symbol ${t}`)}},Gl=(e,t)=>`${e}#${t}`,Kl=e=>Number(e.slice(e.lastIndexOf(`#`)+1)),ql=`?unprimable`,Jl=e=>{let t=e.indexOf(`(${ql} `);if(t===-1)return e;let n=bl(e,t);return e.slice(0,t)+Jl(e.slice(t+11+2,n))+Jl(e.slice(n+1))},Yl=(e,t)=>/\((forall|exists|ite) /.test(e)?void 0:e.replace(/[^\s()]+#(\d+)/g,(e,n)=>Number(n)<t?`#`:`#${Number(n)-t}`),Xl=()=>{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=Ic(`${l}_omitted_${e.size}`);return e.set(t,{symbol:t,kind:i,visit:Jl(a),getLines:()=>[]}),t}let u=Yl(`${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=Ic(f),m={symbol:p,kind:i,visit:Jl(a),getLines:e=>[yl(p,c),...s(p,e).map(e=>`(assert (! ${Jl(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)}},Zl=`?trigger`,Ql=/* @__PURE__ */ new Set([qc,Kc,Uc,Wc,Gc,tl,il,Y]),$l=e=>{let t=/^\(?([^\s()]+)/.exec(e)?.[1]??``;return Ql.has(t)||/^smt__TLA____(SetEnum__\d+|SetSt__flatnd__\d+|SetOf__\d+__flatnd__\d+|Product__\d+|RecordSet__)/.test(t)},eu=(e,t)=>{let n=e.indexOf(`(${Zl} `);if(n===-1)return e;let r=n+8+2,i=bl(e,r)+1,a=bl(e,i+1)+1,o=t?e.slice(r,i):e.slice(i+1,a);return e.slice(0,n)+o+eu(e.slice(a+1),t)},tu=(e,t,n,r)=>{let i=`(${ol} ${e} ${t})`,a=r?`(distinct ${e} ${t})`:`(= ${e} ${t})`;if(!$l(e)&&!$l(t))return a;let o=r?`(not ${i})`:i;return n===(r?`Positive`:`Negative`)?`(${Zl} ${o} ${a})`:o},nu=(e,t,n,r)=>{let i=Q(e,[`a`,...t]);return[$(`SetStDef`,[],Z([...t,`a`,`x`],`(= (${G} x ${i}) (and (${G} x a) ${xl(n,r,`x`)}))`,[[`(${G} x ${i})`],[`(${G} x a)`,i]]))]},ru=(e,t,n,r)=>{let i=r.length,a=hl(`a`,i),o=hl(`y`,i),s=r.reduce((e,t,n)=>xl(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],`(=> ${_l(l)} (${G} ${s} ${c}))`,[[s,c],[c,...l]])),$(`SetOfElim`,[i],Z([...t,...a,`x`],`(=> (${G} x ${c}) (exists (${gl(o)}) ${_l([...l,`(= x ${s})`])}))`,[[`(${G} x ${c})`]])),$(`AssertIsSetOf`,[i],Z([...t,...u],`(${sl} ${d})`,[[d]]))]},iu=(e,t,n,r,i)=>{let a=Q(e,[`a`,...t]),o=xl(n,r,`x`),s=i.has(Ol($(`FunTyping`,[],void 0)))?[$(`FunTyping`,[],Z([...t,`a`,`b`],`(=> (forall ((x Idv)) (=> (${G} x a) (${G} ${o} b))) (${G} ${a} (${il} a b)))`,[[a,`(${il} a b)`]]))]:[];return[$(`FunConstrIsafcn`,[],Z([...t,`a`],`(${rl} ${a})`,[[a]])),$(`FunDomDef`,[],Z([...t,`a`],`(= (${nl} ${a}) a)`,[[a]])),$(`FunAppDef`,[],Z([...t,`a`,`x`],`(=> (${G} x a) (= (${J} ${a} x) ${o}))`,[[`(${J} ${a} x)`],[`(${G} x a)`,a]])),...s]},au=(e,t,n,r)=>[$(`ChooseDef`,[],Z([...t,`x`],`(=> ${xl(n,r,`x`)} ${xl(n,r,Q(e,t))})`))],ou=(e,t,n,r)=>{let i=n=>Q(e,[n,...t]),a=e=>xl(n,r,e),o=i(`(${ll} 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) ${$c}) (<= (${q} (${X} ${i(`s`)})) (${q} (${X} s))))`,[[i(`s`)]])),$(`SeqSelectseqNil`,[],Z(t,`(= ${i(pl)} ${pl})`)),$(`SeqSelectseqApp`,[],Z([...t,`s`,`x`],`(=> (${G} x (${nl} ${i(`s`)})) ${a(`(${J} ${i(`s`)} x)`)})`,[[`(${J} ${i(`s`)} x)`]])),$(`SeqSelectseqAppend`,[],Z([...t,`s`,`x`],`(and (=> ${a(`x`)} (= ${o} (${ll} ${i(`s`)} x))) (=> (not ${a(`x`)}) (= ${o} ${i(`s`)})))`,[[o]]))]},su=t=>{let n=Xl(),r=n.flatten,i=/* @__PURE__ */ new Map,a=/* @__PURE__ */ new Map,o=Cl(),s=/* @__PURE__ */ new Map,c=e=>e.isBool?e.text:`(= ${eu(e.text,!0)} ${Jc})`,l=e=>e.isBool?`(${Yc} ${eu(e.text,!0)})`:e.text,u=e=>({isBool:!0,text:e}),d=e=>({isBool:!1,text:e}),f=(t,n)=>{let r=Array.from({length:n-1}).reduce(e=>e?.rest,t);if(!r)throw new e.k(`a reference outside the obligation`);return r.binding},p=(e,t)=>({binding:t,rest:e}),m=(e,t)=>[...new Set(e.match(/[^\s()]+#\d+/g))].filter(e=>Kl(e)<t).toSorted((e,t)=>Kl(e)-Kl(t)),h=e=>{let t=o.adjoin(e);return o.enter(t),s.set(t.name,t),t.name},g=e=>({...e,polarity:`Neither`}),_=e=>({...e,polarity:e.polarity===`Positive`?`Negative`:e.polarity===`Negative`?`Positive`:`Neither`}),v=(e,t,n)=>l(de(e,t,g(n))),y=(e,t,n)=>c(de(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:v(e,t,n)),ee=(t,n,r,i)=>b(t,n,r).map(t=>{if(t===void 0)throw new e.k(`${i} without a domain`);return t}),x=(e,t,n)=>{let r=e.map((e,t)=>Gl(e,n.depth+t));return{variables:r,env:r.reduce((e,t)=>p(e,{kind:`constant`,symbol:t}),t),mode:{...n,depth:n.depth+e.length}}},te=(e,t,n)=>{let r=b(e.bounds,t,n),i=x(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 (${gl(i.variables)}) ${o.length===0?a:`(=> ${_l(o)} ${a})`})`:`(exists (${gl(i.variables)}) ${_l([...o,a])})`},S=(e,t,n)=>{let i=v(e.domain,t,n),a=x([e.name],t,g(n)),o=y(e.body,a.env,a.mode),s=m(o,n.depth),c=r(`SetSt`,o,n,e=>nu(e,s,o,a.variables[0]),s.length+1);return d(Q(c,[i,...s]))},C=(e,t,n)=>{let i=ee(e.bounds,t,n,`a set of values`),a=x(e.bounds.map(e=>e.name),t,g(n)),o=v(e.element,a.env,a.mode),s=m(o,n.depth),c=i.length,l=r(`SetOf_${c}`,o,n,e=>ru(e,s,o,a.variables),c+s.length);return d(Q(l,[...i,...s]))},ne=(e,t,n)=>{let i=ee(e.bounds,t,n,`a function`),a=i.length===1?i[0]:Q(W(`Product_${i.length}`),i),o=Gl(i.length===1?e.bounds[0].name:`x`,n.depth),s={...g(n),depth:n.depth+1},c=i.length===1?p(t,{kind:`constant`,symbol:o}):Pl(i.length).reduce((e,t)=>p(e,{kind:`constant`,symbol:`(${J} ${o} ${t})`}),t),l=v(e.body,c,s),u=m(l,n.depth),f=r(`FunFcn`,l,n,(e,t)=>iu(e,u,l,o,t),u.length+1);return d(Q(f,[a,...u]))},re=(e,t,n)=>{let i=x([e.name],t,g(n)),a=i.variables[0],o=e.domain&&`(${G} ${a} ${v(e.domain,t,n)})`,s=y(e.body,i.env,i.mode),c=o===void 0?s:_l([o,s]),l=m(c,n.depth),u=r(`Choose`,c,n,e=>au(e,l,c,a),l.length);return d(Q(u,l))},ie=(e,t,n,r)=>tu(v(e[0],t,n),v(e[1],t,n),n.polarity,r),w=(e,t,n)=>{let r=e.kind===`Lambda`&&e.params.length===1?e:void 0,i=x([r?.params[0].name??`x1`],t,g(n));return{body:y(r?.body??{kind:`Apply`,operator:R(1,e),args:[{kind:`Ix`,index:1}]},i.env,i.mode),variable:i.variables[0]}},ae=(t,n,i,a)=>{let o=()=>n.map(e=>v(e,i,a));switch(t){case`Conj`:return u(_l(n.map(e=>y(e,i,a))));case`Disj`:return u(vl(n.map(e=>y(e,i,a))));case`Implies`:return u(`(=> ${y(n[0],i,_(a))} ${y(n[1],i,a)})`);case`Equiv`:return u(`(= ${n.map(e=>y(e,i,g(a))).join(` `)})`);case`Neg`:return u(`(not ${y(n[0],i,_(a))})`);case`Eq`:return u(ie(n,i,a,!1));case`Neq`:return u(ie(n,i,a,!0));case`Mem`:return u(Q(G,o()));case`Notmem`:return u(`(not ${Q(G,o())})`);case`Subseteq`:return u(Q(Hc,o()));case`Lteq`:return u(Q(el,o()));case`Gteq`:return u(Q(el,o().toReversed()));case`Lt`:case`Gt`:{let e=()=>t===`Lt`?o():o().toReversed();return u(`(and ${Q(el,e())} (distinct ${e().join(` `)}))`)}case`SelectSeq`:{let e=w(n[1],i,a),t=m(e.body,a.depth),o=r(`SelectSeq`,e.body,a,n=>ou(n,t,e.body,e.variable),t.length+1);return d(Q(o,[v(n[0],i,a),...t]))}case`Unprimable`:{let e=de(n[0],i,g(a));return{...e,text:`(${ql} ${e.text})`}}default:{let n=ml[t];if(n===void 0)throw new e.k(`the operator ${t}`);return d(Q(n,o()))}}},oe=(t,n,i,a)=>{switch(t.kind){case`constant`:case`variable`:if(n.length>0)throw new e.k(`an applied ${t.kind}`);return d(t.symbol);case`operator`:if(n.length!==t.arity)throw new e.k(`an operator applied to the wrong number of arguments`);return d(Q(t.symbol,n.map(e=>v(e,i,a))));case`secondOrder`:{if(n.length!==t.shapes.length)throw new e.k(`an operator applied to the wrong number of arguments`);let o=n.map((n,r)=>{if(t.shapes[r]===0)return{isFirstOrder:!0,text:v(n,i,a)};if(n.kind===`Ix`){let t=f(i,n.index);if(t.kind!==`operator`)throw new e.k(`an operator argument that isn't a LAMBDA`);return{isFirstOrder:!1,text:t.symbol}}if(n.kind!==`Lambda`)throw new e.k(`an operator argument that isn't a LAMBDA`);let o=x(n.params.map(e=>e.name),i,g(a));return{isFirstOrder:!1,text:v(n.body,o.env,o.mode)}}),s=o.flatMap(e=>e.isFirstOrder?[e.text]:[]),c=o.flatMap(e=>e.isFirstOrder?[]:[e.text]),l=m(c.join(` `),a.depth),u=r(``,c.join(` `),a,()=>[],s.length+l.length,t.name);return d(Q(u,[...s,...l]))}case`unsupported`:throw new e.k(t.reason)}},se=(t,n)=>{if(!t)throw new e.k(`a primed declaration that isn't a variable`);let r=t.binding;return r.kind===`variable`&&r.name===n?r.primed:se(t.rest,n)},T=(e,t,n,r)=>{if(t.length===0&&e.endsWith(`#prime`))return d(se(n,e.slice(0,-6)));let a=t.length===0?`Anon_OPAQUE_${e}`:`Anon_${e}`;return i.set(a,t.length),d(Q(W(a),t.map(e=>v(e,n,r))))},E=(e,t,n)=>e.specs.reduce((e,r)=>{let i=(e,a)=>{if(a.length===0)return v(r.value,t,{...n,at:e});let o=a[0],s=()=>o.kind===`Dot`?W(`StrLit_${o.field}`):v(o.expression,t,n),c=s(),l=i(`(${J} ${e} ${a.length>1?s():c})`,a.slice(1));return`(${al} ${e} ${c} ${l})`};return i(e,r.trail)},v(e.function,t,n)),ce=()=>{t.caseErrors++;let e=`Anon_incomplete_case_error_${t.caseErrors}`;return i.set(e,0),W(e)},le=(e,t,n)=>{let r=e.arms.map(e=>de(e.body,t,n)),i=e.other?de(e.other,t,n):d(ce()),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,g(n))} ${r[a].integer} ${e})`,i.integer??``);return{isBool:!1,text:`(${K} ${a})`,integer:a}}let o=e=>a?e.text:l(e);return{isBool:a,text:e.arms.reduceRight((e,i,a)=>`(ite ${y(i.condition,t,n)} ${o(r[a])} ${e})`,o(i))}},ue=(t,n,r)=>{let i=t.context.reduce((t,n)=>{switch(n.kind){case`Fresh`:{if(n.shape>0){if(!t.mode.isOmitted)throw new e.k(`a second-order ASSUME`);let r=Gl(n.name,t.mode.depth);return{env:p(t.env,{kind:`operator`,symbol:r,arity:n.shape}),mode:{...t.mode,depth:t.mode.depth+1},wrappers:[...t.wrappers,e=>`(forall ((${r} Idv)) ${e})`]}}if(n.level!==`Constant`)throw new e.k(`a NEW declaration that isn't constant`);let r=n.domain&&v(n.domain,t.env,t.mode),i=x([n.name],t.env,t.mode),a=i.variables[0],o=r&&`(${G} ${a} ${r})`;return{env:i.env,mode:i.mode,wrappers:[...t.wrappers,e=>`(forall ((${a} Idv)) ${o?`(=> ${o} ${e})`:e})`]}}case`Fact`:{let e=n.visibility===`Visible`?y(n.expression,t.env,_(t.mode)):void 0;return{env:p(t.env,{kind:`unsupported`,reason:`a reference to a fact`}),mode:t.mode,wrappers:e?[...t.wrappers,t=>`(=> ${e} ${t})`]:t.wrappers}}default:throw new e.k(`a ${n.kind} in a nested ASSUME`)}},{env:n,mode:r,wrappers:[]});return i.wrappers.reduceRight((e,t)=>t(e),y(t.active,i.env,i.mode))},de=(t,n,r)=>{switch(t.kind){case`Ix`:return oe(f(n,t.index),[],n,r);case`Internal`:switch(t.builtin){case`TRUE`:return u(`true`);case`FALSE`:return u(`false`);case`BOOLEAN`:return d(Xc);case`STRING`:return d(Zc);case`Nat`:return d($c);case`Int`:return d(Qc);default:throw new e.k(`the operator ${t.builtin}`)}case`Apply`:{let i=t.operator;if(i.kind===`Internal`)return ae(i.builtin,t.args,n,r);if(i.kind===`Ix`)return oe(f(n,i.index),t.args,n,r);if(i.kind===`Opaque`)return T(i.name,t.args,n,r);if(i.kind===`Lambda`)return de(Tt(i,t.args),n,r);throw new e.k(`an application of ${i.kind}`)}case`Sequent`:return u(ue(t.sequent,n,r));case`With`:case`Parens`:return de(t.expression,n,r);case`If`:{let e=y(t.condition,n,r),i=de(t.consequent,n,r),a=de(t.alternative,n,r);if(i.integer!==void 0&&a.integer!==void 0){let t=`(ite ${eu(e,!0)} ${i.integer} ${a.integer})`;return{isBool:!1,text:`(${K} ${t})`,integer:t}}return i.isBool&&a.isBool?u(`(ite ${e} ${i.text} ${a.text})`):d(`(ite ${e} ${l(i)} ${l(a)})`)}case`List`:{let e=t.items.map(e=>y(e,n,r));return u(t.bullet===`Or`?vl(e):_l(e))}case`Opaque`:return T(t.name,[],n,r);case`Quant`:return u(te(t,n,r));case`Choose`:return re(t,n,r);case`SetSt`:return S(t,n,r);case`SetOf`:return C(t,n,r);case`SetEnum`:return d(Q(W(`SetEnum_${t.elements.length}`),t.elements.map(e=>v(e,n,r))));case`Product`:return d(Q(W(`Product_${t.factors.length}`),t.factors.map(e=>v(e,n,r))));case`Tuple`:return d(Q(W(`Tuple_${t.elements.length}`),t.elements.map(e=>v(e,n,r))));case`Fcn`:return ne(t,n,r);case`FcnApp`:{let e=v(t.function,n,r),i=t.args.map(e=>v(e,n,r)),a=i.length===1?i[0]:Q(W(`Tuple_${i.length}`),i);return d(`(${J} ${e} ${a})`)}case`Arrow`:return d(Q(il,[v(t.domain,n,r),v(t.range,n,r)]));case`Record`:case`Rect`:{let e=t.fields.map(e=>e.name),i=e.join(`_`);return a.set(`Record_${i}`,e),a.set(`RecordSet_${i}`,e),d(Q(W(`${t.kind===`Record`?`Record`:`RecordSet`}_${i}`),t.fields.map(e=>v(e.value,n,r))))}case`Except`:return d(E(t,n,r));case`Dot`:return d(`(${J} ${v(t.expression,n,r)} ${W(`StrLit_${t.field}`)})`);case`Case`:return le(t,n,r);case`String`:return d(W(`StrLit_${t.value}`));case`Num`:if(t.fraction!==``)throw new e.k(`a real number`);return{isBool:!1,text:`(${K} ${BigInt(t.integer)})`,integer:String(BigInt(t.integer))};case`At`:if(r.at===void 0)throw new e.k(`@ outside EXCEPT`);return d(r.at);case`Tquant`:case`Tsub`:case`Fair`:throw new e.k(`a temporal formula`);default:throw new e.k(`the expression ${t.kind}`)}};return{encodeIdv:v,encodeBool:y,push:p,getEntries:e=>[...n.takeIntroduced(),Jl(eu(e,!1))],getUniqueName:h,flattened:n.flattened,anonymous:i,recordFields:a,declared:s}},cu=(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)),lu=e=>e.length===1?e[0]:j(`Conj`,[e[0],lu(e.slice(1))],e[0]),uu=(e,t,n)=>e.kind!==`Record`||t.kind!==`Record`||!cu(e,t)?j(`Eq`,[e,t],n):lu(e.fields.map(e=>uu(e.value,t.fields.find(t=>t.name===e.name)?.value??e.value,n))),du=e=>{let t=vt(e,du);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:A(uu(t.args[0],t.args[1],t),t)},fu=e=>e.kind===`Record`||e.kind===`Rect`?{...e,fields:e.fields.toSorted((e,t)=>Nc(e.name,t.name))}:vt(e,fu),pu=(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(Nc)[0];if(t.delete(e),r.has(e))continue;let a=Wl(e,n);r.set(e,a),a.deps.forEach(e=>t.add(e)),a.axioms.forEach(e=>i.set(Ol(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=Bc(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}},mu={isOmitted:!1,polarity:`Negative`,at:void 0,depth:0},hu=e=>e.definition.kind===`Bpragma`||e.definition.kind===`Operator`&&e.visibility===`Visible`,gu=e=>e.kind===`Sequent`&&e.sequent.context.some(e=>e.kind===`Fresh`&&e.shape>0),_u=(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=yl(i,n.shape);if(!n.domain||n.domainVisibility===`Hidden`)return r(a,[o]);let s=`(assert (${G} ${i} ${t.encodeIdv(n.domain,e.env,mu)}))`;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},[yl(e,0),yl(i,0)])}case`Defn`:{let e=n.definition;if(hu(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},[yl(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},[yl(o,a.length)])}case`Fact`:{let i={kind:`unsupported`,reason:`a reference to a fact`};if(n.visibility===`Hidden`)return r(i);let a=gu(n.expression),o=t.getEntries(`(assert ${t.encodeBool(n.expression,e.env,{...mu,isOmitted:a})})`);return r(i,a?o.map(e=>typeof e==`string`?{omitted:e}:e):o)}}},{env:void 0,entries:[]}),vu=(e,t)=>{let n=fu(du({kind:`Sequent`,sequent:e})),r=n.kind===`Sequent`?n.sequent:e,i=su(t),a=_u(r.context,i),o=gu(r.active)?[]:i.getEntries(`(assert (! (not ${i.encodeBool(r.active,a.env,{...mu,polarity:`Positive`})}) :named |Goal|))`),s=[...a.entries,...o],c=wl(i.declared),l=pu(s,i),u=[...l.symbols].toSorted((e,t)=>Nc(e[0],t[0])).flatMap(e=>e[1].declaration===void 0?[]:[e[1].declaration]),d=[...l.axioms.values()].toSorted(Al).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`)&&!hu(e))?[`(declare-sort Idv 0)`]:[],...p].map(c.resolve).concat(`(check-sat)`,`(exit)`).join(`
43
+ `)},yu=H(`@ `),bu={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`},xu={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]},Su=e=>{let t=Number.parseInt(e,10);return`${`(TLA.fapply TLA.Succ `.repeat(t)}0${`)`.repeat(t)}`},Cu=(t,n)=>{let r=Ri(),i=e=>Bi(r,vo(e)),a=()=>Bi(r,``),o=e=>U(e,m,yu),s=(e,t)=>H(`(%s %a)`,e,o(t)),c=(e,t,n)=>{let a=i(e),o=H(`%a((%s) %a))`,t,a,m(n));return Vi(r,1),o},l=(e,t)=>{let n=bu[e];if(n!==void 0&&t.length===0)return V(n);let r=xu[e];if(r&&r[1]===t.length)return s(r[0],t);if(t.length===2)switch(e){case`Neq`:return H(`(-. %a)`,s(`=`,t));case`Notmem`:return H(`(-. %a)`,s(`TLA.in`,t));case`Minus`:return s(`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 s(`arith.le`,t.toReversed());case`Gt`:return s(`arith.lt`,t.toReversed())}if(e===`Unprimable`&&t.length===1)return m(t[0]);throw bo(e,t.length,`Backend.Zenon.fmt_apply`)},u=(t,n)=>{switch(t.kind){case`Ix`:{let i=zi(r,t.index);if(t.index<=0||i===void 0)throw new e.j;return n.length===0?V(i):s(i,n)}case`Opaque`:{let e=vo(t.name);return n.length===0?V(e):s(e,n)}case`Internal`:return l(t.builtin,n);case`Lambda`:{let e=t.params.map(e=>H(`%s `,i(e.name))),n=H(`((%a) %a)`,e,m(t.body));return Vi(r,t.params.length),n}default:throw new e.j}},d=(t,n,r)=>{if(n.length===0)return m(r);let i=xo(t,n,r),a=t===`Forall`;if(i.first.domain.kind===`NoDomain`)return c(i.first.name,V(a?`(A. `:`(E. `),i.inner);if(i.first.domain.kind!==`Domain`)throw new e.j;let o=m(i.first.domain.expression);return c(i.first.name,H(`(%s %a `,a?`TLA.bAll`:`TLA.bEx`,o),i.inner)},f=(t,n,r,i)=>{if(n.length!==1)throw new e.k(`${i} (multiple declared constants)`);let a=n[0];if(a.domain.kind!==`Domain`)throw new e.j;return c(a.name,H(`(%s %a `,t,m(a.domain.expression)),r)},p=t=>{if(t.context.length===0)return m(t.active);let n=t.context[0],o=()=>p({context:t.context.slice(1),active:t.active});if(n.kind===`Fact`){let e=n.visibility===`Visible`?m(n.expression):void 0;a();let t=e?H(`(=> %a %a)`,e,o()):o();return Vi(r,1),t}if(n.kind===`Defn`)throw new e.j;let s=n.kind===`Fresh`&&n.domain&&n.domainVisibility===`Visible`?m(n.domain):void 0,c=i(n.name),l=n.kind===`Flex`?H(`(A. ((%s) (A. ((%s') %a))))`,c,c,o()):s?H(`(TLA.bAll %a ((%s) %a))`,s,c,o()):H(`(A. ((%s) %a))`,c,o());return Vi(r,1),l},m=t=>{switch(t.kind){case`Ix`:case`Internal`:case`Opaque`:case`Lambda`:return u(t,[]);case`Apply`:return u(t.operator,t.args);case`Sequent`:return p(t.sequent);case`With`:case`Parens`:return m(t.expression);case`If`:return H(`(TLA.cond %a %a %a)`,m(t.condition),m(t.consequent),m(t.alternative));case`List`:if(t.bullet===`Refs`&&t.items.length===0)throw new e.j;return t.bullet===`Refs`&&t.items.length===1?m(t.items[0]):H(`(%s %a)`,t.bullet===`Or`?`\\/`:`/\\`,o(t.items));case`Quant`:return d(t.quantifier,t.bounds,t.body);case`Tquant`:throw new e.k(`\\AA or \\EE`);case`Choose`:return t.domain?c(t.name,H(`(TLA.bChoice %a `,m(t.domain)),t.body):c(t.name,V(`(t. `),t.body);case`SetSt`:return c(t.name,H(`(TLA.subsetOf %a `,m(t.domain)),t.body);case`SetOf`:return f(`TLA.setOfAll`,t.bounds,t.element,`Setof`);case`Fcn`:return f(`TLA.Fcn`,t.bounds,t.body,`Fcn`);case`SetEnum`:return t.elements.length===0?V(`TLA.emptyset`):[V(`(TLA.set`),t.elements.map(e=>H(` %a`,m(e))),V(`)`)];case`FcnApp`:{let e=m(t.function);return t.args.length===1?H(`(TLA.fapply %a %a)`,e,m(t.args[0])):H(`(TLA.fapply %a (TLA.tuple %a))`,e,o(t.args))}case`Arrow`:return H(`(TLA.FuncSet %a %a)`,m(t.domain),m(t.range));case`Rect`:case`Record`:return[V(t.kind===`Rect`?`(TLA.recordset`:`(TLA.record`),t.fields.map(e=>H(` "%s" %a`,e.name,m(e.value))),V(`)`)];case`Except`:{let n=t.specs[0];if(t.specs.length!==1||n.trail.length!==1)throw new e.k(`complex EXCEPT`);let r=n.trail[0],i=r.kind===`Dot`?V(`"${r.field}"`):m(r.expression);return H(`(TLA.except %a %a %a)`,m(t.function),i,m(n.value))}case`Dot`:return H(`(TLA.fapply %a "%s")`,m(t.expression),t.field);case`Tuple`:return H(`(TLA.tuple %a)`,o(t.elements));case`Product`:return t.factors.length===2?H(`(TLA.prod %a %a)`,m(t.factors[0]),m(t.factors[1])):H(`(TLA.Product (TLA.tuple %a))`,o(t.factors));case`Sub`:case`Tsub`:case`Fair`:throw new e.k(t.kind);case`Case`:{let e=U(t.arms,e=>H(`%a %a`,m(e.condition),m(e.body)),yu);return t.other?H(`(TLA.CASE %a %a)@]`,e,m(t.other)):H(`(TLA.CASE %a )`,e)}case`String`:return H(`"%s"`,t.value);case`Num`:if(t.fraction!==``)throw new e.k(`Real number constants`);return V(Su(t.integer));case`Bang`:case`Let`:case`At`:throw new e.j}},h=t=>{switch(t.kind){case`Fresh`:{let e=t.domain&&t.domainVisibility===`Visible`?m(t.domain):void 0,n=i(t.name);return e?H(`$hyp "%s_in" (TLA.in %s %a)@
44
+ `,n,n,e):[]}case`Flex`:return i(t.name),[];case`Defn`:{let e=i(t.definition.name);return t.visibility===`Visible`?H(`; usable definition %s suppressed@.`,e):[]}case`Fact`:{let n=String(r.stack.length),i=t.visibility===`Visible`?So(r,()=>m(t.expression)):void 0;return a(),i instanceof e.k?H(`; omitted temporal assumption : %s @.`,i.message):i?H(`$hyp "v'%s" %a@
45
+ `,n,i):[]}}},g=(()=>{try{return[n.context.map(h),H(`$goal %a`,m(n.active))]}catch(t){throw t instanceof e.k?new e.w(`Zenon: unsupported operator ${t.message}`):t}})();return Ai([H(`;; obligation #%s@
46
+ `,String(t)),g])},wu=e=>wc(ys(e)),Tu=(e,t,n,r)=>(n.rlimit===void 0?``:`(set-option :rlimit ${n.rlimit})\n`)+vu(wu(t),r),Eu={smt:Tu,z3:Tu,zenon:(e,t)=>Cu(e,wu(t)),isabelle:(e,t,n)=>Mo(e,wu(t),n.tactic??`auto`),ls4:(e,t)=>Mc(t)},Du=e=>e.kind===`Case`&&e.other===void 0||yt(e).some(Du),Ou=/* @__PURE__ */ new WeakMap,ku=e=>{let t=Ou.get(e);if(t!==void 0)return t;let n=[];_t(e,e=>(n.push(e),e),`all`);let r=n.some(Du);return Ou.set(e,r),r},Au=e=>/-{4,}\s*MODULE\s+(\w+)/.exec(e)?.[1]??`Main`,ju=e=>({id:e.id,location:e.location,text:e.text}),Mu=(e,t,n,r=[])=>({obligation:{...ju(e),status:t,reason:n},attempts:r}),Nu=(e,t)=>`${ra(t?vc(sc(e.sequent,!1)):bc(e))}\n`,Pu=(e,t,n)=>No(e,t.flatMap((e,t)=>e.attempts.filter(e=>e.method.prover===`isabelle`&&e.isProved&&!e.isReused).map(r=>({id:e.obligation.id,sequent:wu(bc(n[t])),tactic:r.method.tactic??`auto`})))),Fu=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},Iu=async(t,n,r,i)=>{if(t.kind.kind===`Error`)return Mu(t,`failed`,t.kind.message);let a=rc(t),o=As(t.sequent),s=r.lastByFingerprint.get(o);r.lastByFingerprint.set(o,r.tasks[n].done),await s;let c=[],l=[],u=e=>({obligation:{...ju(t),status:`proved`,prover:e},attempts:c}),d=e=>{r.isFingerprinted(t)||r.results.delete(o);let n=r.results.get(o)?.get(e.prover);return n?.method.tactic===e.tactic?n:void 0},f=e=>e.rlimit??e.timeLimitMs/1e3,p=e=>c.push({...e,isReused:!0,timeUsedMs:void 0}),m=e=>{c.push(e),r.results.set(o,(r.results.get(o)??/* @__PURE__ */ new Map).set(e.method.prover,e))},h=(e,t)=>{c.push({method:e,isProved:!1,isReused:!1,reason:t}),l.push({reason:t,isDecided:!1})},g=d(a.provers[0]);if(g?.isProved)return p(g),u(g.method.prover);let _=bc(t,a);if(t.kind.kind===`Support`&&xc(_))return r.results.set(o,r.results.get(o)??/* @__PURE__ */ new Map),{obligation:{...ju(t),status:`trivial`},attempts:c};for(let o of a.provers){let a=d(o);if(a?.isProved)return p(a),u(o.prover);if(a&&f(a.method)>=f(o)){p(a),l.push({reason:`${o.prover} failed on an obligation with the same fingerprint`,isDecided:!0});continue}if(!r.isProving)continue;if(o.prover===`trivial`)return u(o.prover);let s=Eu[o.prover];if(!s)h(o,`tla-ts has no ${o.prover} backend`);else try{let e=s===Tu&&(_.context.some(ku)||Du(_.active))?await Fu(r,n):{caseErrors:0},a=s(t.id,_,o,e),c=await r.decide(o.prover,a,{timeLimitMs:o.timeLimitMs,signal:i},n),d=c.verdict===`unsat`;if(m({method:o,isProved:d,isReused:!1,...!d&&{reason:c.timeUsedMs>=o.timeLimitMs?`timeout`:`false`},verdict:c.verdict,timeUsedMs:c.timeUsedMs}),d)return u(o.prover);l.push({reason:`${o.prover} answered ${c.verdict}`,isDecided:!0})}catch(t){if(t instanceof e.w){m({method:o,isProved:!1,isReused:!1,reason:`false`}),l.push({reason:`${o.prover} failed: ${t.message}`,isDecided:!0});continue}if(!(t instanceof e.k))throw t;h(o,`${o.prover} can't encode ${t.message}`)}}return Mu(t,l.some(e=>e.isDecided)?`failed`:`unsupported`,l.map(e=>e.reason).join(`, `),c)},Lu=(t,n)=>{if(n instanceof e.k)return Mu(t,`unsupported`,n.message);if(n instanceof e.w)return Mu(t,`failed`,n.message);throw n},Ru=async(t,r)=>{let i=r.workers??1,a=i>1&&e.n()?await po(i):void 0,o=()=>a?.terminate(r.signal?.reason);r.signal?.addEventListener(`abort`,o);let s={tasks:[],results:r.results??/* @__PURE__ */ new Map,isFingerprinted:r.isFingerprinted??(()=>!0),isProving:r.isProving??!0,lastByFingerprint:/* @__PURE__ */ new Map,decide:a?.decide??(async(e,t,r)=>n.t(e,t,r))},c=a?i*4:1,l=[],u=[],d=/* @__PURE__ */ new Set,f=[],p=async()=>{for(;u[f.length];){r.signal?.throwIfAborted();let e=await l[f.length];f.push(e),r.onReport?.(e,t[f.length-1]),await new Promise(e=>setTimeout(e))}};try{for(let[e,n]of t.entries()){r.signal?.throwIfAborted();let t=Promise.withResolvers();s.tasks.push({done:t.promise,session:void 0});let i=Iu(n,e,s,r.signal).catch(e=>Lu(n,e));l.push(i),d.add(t.promise);let a=()=>{u[e]=!0,d.delete(t.promise),t.resolve()};i.then(a,a),d.size>=c&&await Promise.race(d),await p()}await Promise.all(d),await p()}finally{r.signal?.removeEventListener(`abort`,o),a?.terminate(new e.w(`prove stopped`))}return f},zu=(e,t)=>({...ju(e),...t??{status:`unsupported`,reason:`tlapm reported no result`}}),Bu=async t=>{let n=Au(t.source),r=/* @__PURE__ */ new Map,i=fo([{file:`${n}.tla`,source:t.source}],e=>{let n=t.loadModule?.(e);n!==void 0&&r.set(e,n);let i=n??(e===`TLAPS`?`------------------------------- 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
+ `:void 0);return i===void 0?void 0:{file:`${e}.tla`,source:i}}),a=i.flatMap(e=>e.obligations),o={missingProofCount:i.reduce((e,t)=>e+t.summary.absent.length,0),omittedProofCount:i.reduce((e,t)=>e+t.summary.omitted.length,0)};if(t.backend===`tlapm`){if(typeof process>`u`||process.versions?.node===void 0)throw new e.k(`The tlapm backend runs only in Node and Bun.`);let i=await Promise.resolve().then(()=>require("./tlapm.cjs")).then(e=>e.n),s=new Map(a.map(e=>[e.id,e])),c=await i.proveWithTlapm(n,new Map([[n,t.source],...r]),{signal:t.signal,onResult:(e,n)=>{let r=s.get(e);r&&t.onObligation?.(zu(r,n))}});return{obligations:a.map(e=>zu(e,c.get(e.id))),...o}}return{obligations:(await Ru(a,{workers:t.workers,signal:t.signal,onReport:e=>t.onObligation?.(e.obligation)})).map(e=>e.obligation),...o}};Object.defineProperty(exports,"a",{enumerable:!0,get:function(){return`------------------------------- 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
+ `}}),Object.defineProperty(exports,"c",{enumerable:!0,get:function(){return fo}}),Object.defineProperty(exports,"d",{enumerable:!0,get:function(){return Ai}}),Object.defineProperty(exports,"f",{enumerable:!0,get:function(){return Ze}}),Object.defineProperty(exports,"h",{enumerable:!0,get:function(){return p}}),Object.defineProperty(exports,"i",{enumerable:!0,get:function(){return Ru}}),Object.defineProperty(exports,"l",{enumerable:!0,get:function(){return na}}),Object.defineProperty(exports,"m",{enumerable:!0,get:function(){return qe}}),Object.defineProperty(exports,"n",{enumerable:!0,get:function(){return Nu}}),Object.defineProperty(exports,"o",{enumerable:!0,get:function(){return Qa}}),Object.defineProperty(exports,"p",{enumerable:!0,get:function(){return Ye}}),Object.defineProperty(exports,"r",{enumerable:!0,get:function(){return Bu}}),Object.defineProperty(exports,"s",{enumerable:!0,get:function(){return uo}}),Object.defineProperty(exports,"t",{enumerable:!0,get:function(){return Pu}}),Object.defineProperty(exports,"u",{enumerable:!0,get:function(){return H}});