tla-ts 0.0.4-dev.0be9567 → 0.0.4-dev.22c041b

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 +77 -122
  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 +17 -15
  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 +648 -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 +16 -20
  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 +119 -71
  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
@@ -0,0 +1,636 @@
1
+ // encode/n_data.ml: the declaration, dependencies, and axioms of each symbol tlapm's SMT encoding
2
+ // uses.
3
+
4
+ import { TlaUnsupportedError } from "../../errors";
5
+ import {
6
+ getComponentSet,
7
+ getEnumeration,
8
+ getFieldKeys,
9
+ getIntegers,
10
+ getRecordAxioms,
11
+ getRecordExcepts,
12
+ getTupleAxioms,
13
+ getTupleExcepts,
14
+ getTyping,
15
+ TYPED_OPERATORS,
16
+ } from "./axioms";
17
+ import {
18
+ APPEND,
19
+ BOOL_SET,
20
+ CAP,
21
+ CAST_BOOL,
22
+ CAST_INT,
23
+ CAT,
24
+ declare,
25
+ forall,
26
+ FUN_APP,
27
+ FUN_DOM,
28
+ FUN_EXCEPT,
29
+ FUN_ISAFCN,
30
+ FUN_SET,
31
+ HEAD,
32
+ INT_LTEQ,
33
+ INT_RANGE,
34
+ INT_SET,
35
+ IS_SET_OF,
36
+ LEN,
37
+ MEM,
38
+ NAT_SET,
39
+ PROJ_INT,
40
+ SEQ,
41
+ SET_EXT_TRIGGER,
42
+ STR_SET,
43
+ SUB_SEQ,
44
+ SUBSET,
45
+ SUBSET_EQ,
46
+ TAIL,
47
+ tla,
48
+ TRIG_EQ,
49
+ TT_IDV,
50
+ UNION,
51
+ } from "./format";
52
+ import { axiom, type Axiom } from "./table";
53
+
54
+ export interface SymbolSpec {
55
+ declaration: string | undefined;
56
+ deps: string[];
57
+ axioms: Axiom[];
58
+ }
59
+
60
+ // N_data.s: what the symbols collected so far change about the axioms of the next ones.
61
+ export interface CollectState {
62
+ // The fields of each record symbol the obligation uses.
63
+ recordFields: Map<string, string[]>;
64
+ strings: string[];
65
+ isFunConstr: boolean;
66
+ isFunSet: boolean;
67
+ isExcept: boolean;
68
+ tuples: number[];
69
+ records: string[][];
70
+ anonymous: Map<string, number>;
71
+ }
72
+
73
+ const SEQUENCE_DEPS = ["Mem", "Seq", "Len", "FunApp", "NatSet", "Cast_Int", "Proj_Int"];
74
+
75
+ // N_data.get_deps, with arithmetic and set extensionality as tlapm's SMT backend sets them.
76
+ export const getSymbolSpec = (name: string, state: CollectState): SymbolSpec => {
77
+ const spec = (declaration: string | undefined, deps: string[], axioms: Axiom[]) => ({
78
+ declaration,
79
+ deps,
80
+ axioms,
81
+ });
82
+ const symbol = tla(name);
83
+ const fixed = (arity: number, deps: string[], axioms: Axiom[], sort = "Idv") =>
84
+ spec(declare(symbol, arity, sort), deps, axioms);
85
+ const enumeration = /^SetEnum_(\d+)$/.exec(name);
86
+ if (enumeration)
87
+ return fixed(Number(enumeration[1]), ["Mem"], getEnumeration(Number(enumeration[1])));
88
+ const setOf = /^SetOf_(\d+)$/.exec(name);
89
+ if (setOf) {
90
+ const count = Number(setOf[1]);
91
+ return spec(
92
+ undefined,
93
+ ["Mem", "IsSetOf"],
94
+ [
95
+ axiom("SetOfIntro", [count], undefined),
96
+ axiom("SetOfElim", [count], undefined),
97
+ axiom("AssertIsSetOf", [count], undefined),
98
+ axiom(
99
+ "CompareSetOfTrigger",
100
+ [],
101
+ forall(["a", "b"], `(${SET_EXT_TRIGGER} a b)`, [
102
+ [`(${IS_SET_OF} a)`, `(${IS_SET_OF} b)`],
103
+ ]),
104
+ ),
105
+ ],
106
+ );
107
+ }
108
+ if (name.startsWith("StrLit_")) {
109
+ const value = name.slice("StrLit_".length);
110
+ const distinct = state.strings.map((other) =>
111
+ axiom("StrLitDistinct", [value, other], `(distinct ${symbol} ${tla(`StrLit_${other}`)})`),
112
+ );
113
+ state.strings.push(value);
114
+ return fixed(
115
+ 0,
116
+ ["Mem", "StrSet"],
117
+ [axiom("StrLitIsstr", [value], `(${MEM} ${symbol} ${STR_SET})`), ...distinct],
118
+ );
119
+ }
120
+ const tuple = /^Tuple_(\d+)$/.exec(name);
121
+ if (tuple) {
122
+ const count = Number(tuple[1]);
123
+ state.tuples.push(count);
124
+ const deps =
125
+ count === 0
126
+ ? ["FunIsafcn", "Cast_Int", "Seq", "Len"]
127
+ : ["FunIsafcn", "FunDom", "FunApp", `SetEnum_${count}`, "Cast_Int", "Mem", "Seq", "Len"];
128
+ return fixed(count, deps, getTupleAxioms(count, state.isExcept));
129
+ }
130
+ const product = /^Product_(\d+)$/.exec(name);
131
+ if (product) {
132
+ const count = Number(product[1]);
133
+ return fixed(
134
+ count,
135
+ ["Mem", `Tuple_${count}`, "FunApp", "Cast_Int", "Proj_Int"],
136
+ getComponentSet("Product", [count], symbol, tla(`Tuple_${count}`), getIntegers(count), "t"),
137
+ );
138
+ }
139
+ const fields = state.recordFields.get(name);
140
+ if (fields && name.startsWith("Record_")) {
141
+ state.records.push(fields);
142
+ return fixed(
143
+ fields.length,
144
+ [
145
+ "FunIsafcn",
146
+ "FunDom",
147
+ "FunApp",
148
+ `SetEnum_${fields.length}`,
149
+ ...fields.map((field) => `StrLit_${field}`),
150
+ ],
151
+ getRecordAxioms(fields, state.isExcept),
152
+ );
153
+ }
154
+ if (fields && name.startsWith("RecordSet_")) {
155
+ const record = `Record_${fields.join("_")}`;
156
+ return fixed(
157
+ fields.length,
158
+ ["Mem", record, "FunApp", ...fields.map((field) => `StrLit_${field}`)],
159
+ getComponentSet("RecSet", [fields], symbol, tla(record), getFieldKeys(fields), "r"),
160
+ );
161
+ }
162
+ const anonymous = state.anonymous.get(name);
163
+ if (anonymous !== undefined) return fixed(anonymous, [], []);
164
+ const typed = TYPED_OPERATORS[name];
165
+ if (typed)
166
+ return fixed(typed[1], ["Cast_Int"], [getTyping(name)], name === "IntLteq" ? "Bool" : "Idv");
167
+ switch (name) {
168
+ // SMT-LIB has no exponentiation, so IntExp keeps only its typing.
169
+ case "IntExp":
170
+ return fixed(
171
+ 2,
172
+ ["Mem", "IntSet", "Cast_Int", "TIntLteq", "TIntLit_0", "TIntLit_1"],
173
+ [
174
+ axiom(
175
+ "IntExpTyping",
176
+ [],
177
+ `(forall ((x Idv) (y Idv)) (! (=> (and (${MEM} x ${INT_SET}) (${MEM} y ${INT_SET}) (or (distinct x (${CAST_INT} 0)) (${INT_LTEQ} (${CAST_INT} 1) y))) (${MEM} (${symbol} x y) ${INT_SET})) :pattern ((${symbol} x y))))`,
178
+ ),
179
+ ],
180
+ );
181
+ case "SelectSeq":
182
+ return spec(
183
+ undefined,
184
+ [
185
+ "Mem",
186
+ "Seq",
187
+ "Len",
188
+ "Append",
189
+ "FunApp",
190
+ "FunDom",
191
+ "IntSet",
192
+ "NatSet",
193
+ "Tuple_0",
194
+ "Proj_Int",
195
+ ],
196
+ [
197
+ axiom("SeqSelectseqTyping", [], undefined),
198
+ axiom("SeqSelectseqLen", [], undefined),
199
+ axiom("SeqSelectseqNil", [], undefined),
200
+ axiom("SeqSelectseqApp", [], undefined),
201
+ axiom("SeqSelectseqAppend", [], undefined),
202
+ ],
203
+ );
204
+ case "Choose":
205
+ return spec(undefined, [], [axiom("ChooseDef", [], undefined)]);
206
+ case "Mem":
207
+ return fixed(
208
+ 2,
209
+ ["SetExtTrigger"],
210
+ [
211
+ axiom(
212
+ "SetExt",
213
+ [],
214
+ `(forall ((x Idv) (y Idv)) (! (=> (forall ((z Idv)) (= (${MEM} z x) (${MEM} z y))) (= x y)) :pattern ((${SET_EXT_TRIGGER} x y))))`,
215
+ ),
216
+ ],
217
+ "Bool",
218
+ );
219
+ case "SubsetEq":
220
+ return fixed(
221
+ 2,
222
+ ["Mem"],
223
+ [
224
+ axiom(
225
+ "SubsetEqIntro",
226
+ [],
227
+ `(forall ((x Idv) (y Idv)) (! (=> (forall ((z Idv)) (=> (${MEM} z x) (${MEM} z y))) (${SUBSET_EQ} x y)) :pattern ((${SUBSET_EQ} x y))))`,
228
+ ),
229
+ axiom(
230
+ "SubsetEqElim",
231
+ [],
232
+ `(forall ((x Idv) (y Idv) (z Idv)) (! (=> (and (${SUBSET_EQ} x y) (${MEM} z x)) (${MEM} z y)) :pattern ((${SUBSET_EQ} x y) (${MEM} z x))))`,
233
+ ),
234
+ ],
235
+ "Bool",
236
+ );
237
+ case "Union":
238
+ return fixed(
239
+ 1,
240
+ ["Mem"],
241
+ [
242
+ axiom(
243
+ "UnionIntro",
244
+ [],
245
+ `(forall ((a Idv) (x Idv) (y Idv)) (! (=> (and (${MEM} y a) (${MEM} x y)) (${MEM} x (${UNION} a))) :pattern ((${MEM} y a) (${MEM} x (${UNION} a))) :pattern ((${MEM} x y) (${MEM} x (${UNION} a))) :pattern ((${MEM} y a) (${MEM} x y) (${UNION} a))))`,
246
+ ),
247
+ axiom(
248
+ "UnionElim",
249
+ [],
250
+ `(forall ((a Idv) (x Idv)) (! (=> (${MEM} x (${UNION} a)) (exists ((y Idv)) (and (${MEM} y a) (${MEM} x y)))) :pattern ((${MEM} x (${UNION} a)))))`,
251
+ ),
252
+ ],
253
+ );
254
+ case "Subset":
255
+ return fixed(
256
+ 1,
257
+ ["Mem", "SubsetEq"],
258
+ [
259
+ axiom(
260
+ "SubsetDefAlt",
261
+ [],
262
+ `(forall ((a Idv) (x Idv)) (! (= (${MEM} x (${SUBSET} a)) (${SUBSET_EQ} x a)) :pattern ((${MEM} x (${SUBSET} a))) :pattern ((${SUBSET_EQ} x a) (${SUBSET} a))))`,
263
+ ),
264
+ ],
265
+ );
266
+ case "Cup":
267
+ case "Cap":
268
+ case "SetMinus": {
269
+ const condition =
270
+ name === "Cup"
271
+ ? "(or (MEM x a) (MEM x b))"
272
+ : name === "Cap"
273
+ ? "(and (MEM x a) (MEM x b))"
274
+ : "(and (MEM x a) (not (MEM x b)))";
275
+ const definition = axiom(
276
+ `${name}Def`,
277
+ [],
278
+ `(forall ((a Idv) (b Idv) (x Idv)) (! (= (${MEM} x (${symbol} a b)) ${condition.replaceAll("MEM", MEM)}) :pattern ((${MEM} x (${symbol} a b))) :pattern ((${MEM} x a) (${symbol} a b)) :pattern ((${MEM} x b) (${symbol} a b))))`,
279
+ );
280
+ if (name !== "Cap") return fixed(2, ["Mem"], [definition]);
281
+ return fixed(
282
+ 2,
283
+ ["Mem", "SetEnum_0", "SetExtTrigger"],
284
+ [
285
+ definition,
286
+ axiom(
287
+ "DisjointTrigger",
288
+ [],
289
+ `(forall ((x Idv) (y Idv)) (! (${SET_EXT_TRIGGER} (${CAP} x y) ${tla("SetEnum_0")}) :pattern ((${CAP} x y))))`,
290
+ ),
291
+ ],
292
+ );
293
+ }
294
+ case "SetSt":
295
+ return spec(
296
+ undefined,
297
+ ["Mem", "SetEnum_0", "SetExtTrigger"],
298
+ [axiom("SetStDef", [], undefined), axiom("EmptyComprehensionTrigger", [], undefined)],
299
+ );
300
+ case "NatSet":
301
+ return fixed(
302
+ 0,
303
+ ["IntSet", "TIntLit_0", "Cast_Int", "IntLteq"],
304
+ [
305
+ axiom(
306
+ "NatSetDef",
307
+ [],
308
+ `(forall ((x Idv)) (! (= (${MEM} x ${NAT_SET}) (and (${MEM} x ${INT_SET}) (${INT_LTEQ} (${CAST_INT} 0) x))) :pattern ((${MEM} x ${NAT_SET}))))`,
309
+ ),
310
+ ],
311
+ );
312
+ case "IntRange":
313
+ return fixed(
314
+ 2,
315
+ ["Mem", "IntSet", "IntLteq"],
316
+ [
317
+ axiom(
318
+ "IntRangeDef",
319
+ [],
320
+ `(forall ((a Idv) (b Idv) (x Idv)) (! (= (${MEM} x (${INT_RANGE} a b)) (and (${MEM} x ${INT_SET}) (${INT_LTEQ} a x) (${INT_LTEQ} x b))) :pattern ((${MEM} x (${INT_RANGE} a b)))))`,
321
+ ),
322
+ ],
323
+ );
324
+ case "FunIsafcn":
325
+ return fixed(
326
+ 1,
327
+ ["Mem", "FunDom", "FunFcn", "FunApp"],
328
+ [
329
+ axiom(
330
+ "FunExt",
331
+ [],
332
+ `(forall ((f Idv) (g Idv)) (! (=> (and (${FUN_ISAFCN} f) (${FUN_ISAFCN} g) (= (${FUN_DOM} f) (${FUN_DOM} g)) (forall ((x Idv)) (=> (${MEM} x (${FUN_DOM} f)) (= (${FUN_APP} f x) (${FUN_APP} g x))))) (= f g)) :pattern ((${FUN_ISAFCN} f) (${FUN_ISAFCN} g))))`,
333
+ ),
334
+ ],
335
+ "Bool",
336
+ );
337
+ case "FunSet":
338
+ state.isFunSet = true;
339
+ return fixed(
340
+ 2,
341
+ ["Mem", "FunIsafcn", "FunDom", "FunApp"],
342
+ [
343
+ axiom(
344
+ "FunSetIntro",
345
+ [],
346
+ `(forall ((a Idv) (b Idv) (f Idv)) (! (=> (and (${FUN_ISAFCN} f) (= (${FUN_DOM} f) a) (forall ((x Idv)) (=> (${MEM} x a) (${MEM} (${FUN_APP} f x) b)))) (${MEM} f (${FUN_SET} a b))) :pattern ((${MEM} f (${FUN_SET} a b)))))`,
347
+ ),
348
+ axiom(
349
+ "FunSetElim1",
350
+ [],
351
+ `(forall ((a Idv) (b Idv) (f Idv)) (! (=> (${MEM} f (${FUN_SET} a b)) (and (${FUN_ISAFCN} f) (= (${FUN_DOM} f) a))) :pattern ((${MEM} f (${FUN_SET} a b)))))`,
352
+ ),
353
+ axiom(
354
+ "FunSetElim2",
355
+ [],
356
+ `(forall ((a Idv) (b Idv) (f Idv) (x Idv)) (! (=> (and (${MEM} f (${FUN_SET} a b)) (${MEM} x a)) (${MEM} (${FUN_APP} f x) b)) :pattern ((${MEM} f (${FUN_SET} a b)) (${MEM} x a)) :pattern ((${MEM} f (${FUN_SET} a b)) (${FUN_APP} f x))))`,
357
+ ),
358
+ ...(state.isFunConstr ? [axiom("FunTyping", [], undefined)] : []),
359
+ ],
360
+ );
361
+ case "FunFcn":
362
+ state.isFunConstr = true;
363
+ return spec(
364
+ undefined,
365
+ ["FunIsafcn"],
366
+ [
367
+ axiom("FunConstrIsafcn", [], undefined),
368
+ ...(state.isFunSet ? [axiom("FunTyping", [], undefined)] : []),
369
+ ],
370
+ );
371
+ case "FunDom":
372
+ return fixed(1, ["FunFcn"], [axiom("FunDomDef", [], undefined)]);
373
+ case "FunApp":
374
+ return fixed(2, ["Mem", "FunFcn"], [axiom("FunAppDef", [], undefined)]);
375
+ case "FunExcept": {
376
+ state.isExcept = true;
377
+ const updated = `(${FUN_EXCEPT} f x y)`;
378
+ return fixed(
379
+ 3,
380
+ ["Mem", "FunIsafcn", "FunDom", "FunApp"],
381
+ [
382
+ axiom(
383
+ "FunExceptIsafcn",
384
+ [],
385
+ `(forall ((f Idv) (x Idv) (y Idv)) (! (${FUN_ISAFCN} ${updated}) :pattern (${updated})))`,
386
+ ),
387
+ axiom(
388
+ "FunExceptDomDef",
389
+ [],
390
+ `(forall ((f Idv) (x Idv) (y Idv)) (! (= (${FUN_DOM} ${updated}) (${FUN_DOM} f)) :pattern (${updated})))`,
391
+ ),
392
+ axiom(
393
+ "FunExceptAppDef1",
394
+ [],
395
+ `(forall ((f Idv) (x Idv) (y Idv)) (! (=> (${MEM} x (${FUN_DOM} f)) (= (${FUN_APP} ${updated} x) y)) :pattern (${updated})))`,
396
+ ),
397
+ axiom(
398
+ "FunExceptAppDef2",
399
+ [],
400
+ `(forall ((f Idv) (x Idv) (y Idv) (z Idv)) (! (=> (${MEM} z (${FUN_DOM} f)) (and (=> (= z x) (= (${FUN_APP} ${updated} z) y)) (=> (distinct z x) (= (${FUN_APP} ${updated} z) (${FUN_APP} f z))))) :pattern ((${FUN_APP} ${updated} z)) :pattern (${updated} (${FUN_APP} f z))))`,
401
+ ),
402
+ ...state.tuples.flatMap(getTupleExcepts),
403
+ ...state.records.flatMap(getRecordExcepts),
404
+ ],
405
+ );
406
+ }
407
+ // tlapm labels SeqSetElim1 and SeqSetElim2 SetSetElim1 and SetSetElim2.
408
+ case "Seq":
409
+ return fixed(
410
+ 1,
411
+ [
412
+ "Mem",
413
+ "Len",
414
+ "FunIsafcn",
415
+ "FunDom",
416
+ "FunApp",
417
+ "IntSet",
418
+ "NatSet",
419
+ "IntRange",
420
+ "Cast_Int",
421
+ "Proj_Int",
422
+ ],
423
+ [
424
+ axiom(
425
+ "SeqSetIntro",
426
+ [],
427
+ `(forall ((a Idv) (s Idv)) (! (=> (and (${FUN_ISAFCN} s) (>= (${PROJ_INT} (${LEN} s)) 0) (forall ((i Idv)) (= (${MEM} i (${FUN_DOM} s)) (and (${MEM} i ${INT_SET}) (<= 1 (${PROJ_INT} i)) (<= (${PROJ_INT} i) (${PROJ_INT} (${LEN} s)))))) (forall ((i Int)) (=> (and (<= 1 i) (<= i (${PROJ_INT} (${LEN} s)))) (${MEM} (${FUN_APP} s (${CAST_INT} i)) a)))) (${MEM} s (${SEQ} a))) :pattern ((${MEM} s (${SEQ} a)))))`,
428
+ ),
429
+ axiom(
430
+ "SeqSetElim1",
431
+ [],
432
+ `(forall ((a Idv) (s Idv)) (! (=> (${MEM} s (${SEQ} a)) (and (${FUN_ISAFCN} s) (${MEM} (${LEN} s) ${NAT_SET}) (= (${FUN_DOM} s) (${INT_RANGE} (${CAST_INT} 1) (${LEN} s))))) :pattern ((${MEM} s (${SEQ} a)))))`,
433
+ "SetSetElim1",
434
+ ),
435
+ axiom(
436
+ "SeqSetElim2",
437
+ [],
438
+ `(forall ((a Idv) (s Idv) (i Int)) (! (=> (and (${MEM} s (${SEQ} a)) (<= 1 i) (<= i (${PROJ_INT} (${LEN} s)))) (${MEM} (${FUN_APP} s (${CAST_INT} i)) a)) :pattern ((${MEM} s (${SEQ} a)) (${FUN_APP} s (${CAST_INT} i)))))`,
439
+ "SetSetElim2",
440
+ ),
441
+ ],
442
+ );
443
+ case "Len":
444
+ return fixed(
445
+ 1,
446
+ ["FunDom", "IntRange", "Cast_Int"],
447
+ [
448
+ axiom(
449
+ "SeqLenDef",
450
+ [],
451
+ `(forall ((s Idv) (z Int)) (=> (and (>= z 0) (= (${FUN_DOM} s) (${INT_RANGE} (${CAST_INT} 1) (${CAST_INT} z)))) (= (${LEN} s) (${CAST_INT} z))))`,
452
+ ),
453
+ ],
454
+ );
455
+ case "BSeq":
456
+ return fixed(1, [], []);
457
+ case "Cat":
458
+ return fixed(2, SEQUENCE_DEPS, [
459
+ axiom(
460
+ "SeqCatTyping",
461
+ [],
462
+ `(forall ((a Idv) (s Idv) (t Idv)) (! (=> (and (${MEM} s (${SEQ} a)) (${MEM} t (${SEQ} a))) (${MEM} (${CAT} s t) (${SEQ} a))) :pattern ((${MEM} s (${SEQ} a)) (${CAT} s t)) :pattern ((${MEM} t (${SEQ} a)) (${CAT} s t))))`,
463
+ ),
464
+ axiom(
465
+ "SeqCatLen",
466
+ [],
467
+ `(forall ((s Idv) (t Idv)) (! (=> (and (${MEM} (${LEN} s) ${NAT_SET}) (${MEM} (${LEN} t) ${NAT_SET})) (= (${LEN} (${CAT} s t)) (${CAST_INT} (+ (${PROJ_INT} (${LEN} s)) (${PROJ_INT} (${LEN} t)))))) :pattern ((${CAT} s t))))`,
468
+ ),
469
+ axiom(
470
+ "SeqCatApp1",
471
+ [],
472
+ `(forall ((s Idv) (t Idv) (i Int)) (! (=> (and (${MEM} (${LEN} s) ${NAT_SET}) (${MEM} (${LEN} t) ${NAT_SET}) (<= 1 i) (<= i (${PROJ_INT} (${LEN} s)))) (= (${FUN_APP} (${CAT} s t) (${CAST_INT} i)) (${FUN_APP} s (${CAST_INT} i)))) :pattern ((${FUN_APP} (${CAT} s t) (${CAST_INT} i))) :pattern ((${CAT} s t) (${FUN_APP} s (${CAST_INT} i)))))`,
473
+ ),
474
+ axiom(
475
+ "SeqCatApp2",
476
+ [],
477
+ `(forall ((s Idv) (t Idv) (i Int)) (! (=> (and (${MEM} (${LEN} s) ${NAT_SET}) (${MEM} (${LEN} t) ${NAT_SET}) (<= i (+ (${PROJ_INT} (${LEN} s)) (${PROJ_INT} (${LEN} t)))) (< (${PROJ_INT} (${LEN} s)) i)) (= (${FUN_APP} (${CAT} s t) (${CAST_INT} i)) (${FUN_APP} t (${CAST_INT} (- i (${PROJ_INT} (${LEN} s))))))) :pattern ((${FUN_APP} (${CAT} s t) (${CAST_INT} i)))))`,
478
+ ),
479
+ ]);
480
+ case "Append":
481
+ return fixed(2, SEQUENCE_DEPS, [
482
+ axiom(
483
+ "SeqAppendTyping",
484
+ [],
485
+ `(forall ((a Idv) (s Idv) (x Idv)) (! (=> (and (${MEM} s (${SEQ} a)) (${MEM} x a)) (${MEM} (${APPEND} s x) (${SEQ} a))) :pattern ((${MEM} s (${SEQ} a)) (${APPEND} s x))))`,
486
+ ),
487
+ axiom(
488
+ "SeqAppendLen",
489
+ [],
490
+ `(forall ((s Idv) (x Idv)) (! (=> (${MEM} (${LEN} s) ${NAT_SET}) (= (${LEN} (${APPEND} s x)) (${CAST_INT} (+ (${PROJ_INT} (${LEN} s)) 1)))) :pattern ((${APPEND} s x))))`,
491
+ ),
492
+ axiom(
493
+ "SeqAppendApp1",
494
+ [],
495
+ `(forall ((s Idv) (x Idv) (i Int)) (! (=> (and (${MEM} (${LEN} s) ${NAT_SET}) (<= 1 i) (<= i (${PROJ_INT} (${LEN} s)))) (= (${FUN_APP} (${APPEND} s x) (${CAST_INT} i)) (${FUN_APP} s (${CAST_INT} i)))) :pattern ((${FUN_APP} (${APPEND} s x) (${CAST_INT} i))) :pattern ((${APPEND} s x) (${FUN_APP} s (${CAST_INT} i)))))`,
496
+ ),
497
+ axiom(
498
+ "SeqAppendApp2",
499
+ [],
500
+ `(forall ((s Idv) (x Idv)) (! (=> (${MEM} (${LEN} s) ${NAT_SET}) (= (${FUN_APP} (${APPEND} s x) (${CAST_INT} (+ (${PROJ_INT} (${LEN} s)) 1))) x)) :pattern ((${APPEND} s x))))`,
501
+ ),
502
+ ]);
503
+ case "Head":
504
+ return fixed(
505
+ 1,
506
+ ["FunApp", "Cast_Int"],
507
+ [
508
+ axiom(
509
+ "SeqHeadDef",
510
+ [],
511
+ `(forall ((s Idv)) (! (= (${HEAD} s) (${FUN_APP} s (${CAST_INT} 1))) :pattern ((${HEAD} s))))`,
512
+ ),
513
+ ],
514
+ );
515
+ case "Tail":
516
+ return fixed(1, SEQUENCE_DEPS, [
517
+ axiom(
518
+ "SeqTailTyping",
519
+ [],
520
+ `(forall ((a Idv) (s Idv)) (! (=> (and (${MEM} s (${SEQ} a)) (distinct (${PROJ_INT} (${LEN} s)) 0)) (${MEM} (${TAIL} s) (${SEQ} a))) :pattern ((${MEM} s (${SEQ} a)) (${TAIL} s))))`,
521
+ ),
522
+ axiom(
523
+ "SeqTailLen",
524
+ [],
525
+ `(forall ((s Idv)) (! (=> (and (${MEM} (${LEN} s) ${NAT_SET}) (distinct (${PROJ_INT} (${LEN} s)) 0)) (= (${LEN} (${TAIL} s)) (${CAST_INT} (- (${PROJ_INT} (${LEN} s)) 1)))) :pattern ((${TAIL} s))))`,
526
+ ),
527
+ axiom(
528
+ "SeqTailApp",
529
+ [],
530
+ `(forall ((s Idv) (i Int)) (! (=> (and (${MEM} (${LEN} s) ${NAT_SET}) (distinct (${PROJ_INT} (${LEN} s)) 0) (<= 1 i) (<= i (- (${PROJ_INT} (${LEN} s)) 1))) (= (${FUN_APP} (${TAIL} s) (${CAST_INT} i)) (${FUN_APP} s (${CAST_INT} (+ i 1))))) :pattern ((${FUN_APP} (${TAIL} s) (${CAST_INT} i)))))`,
531
+ ),
532
+ ]);
533
+ case "SubSeq": {
534
+ const range = `(${SUB_SEQ} s (${CAST_INT} x) (${CAST_INT} y))`;
535
+ return fixed(
536
+ 3,
537
+ ["Mem", "Seq", "Len", "FunApp", "IntSet", "Cast_Int", "Proj_Int"],
538
+ [
539
+ axiom(
540
+ "SeqSubseqTyping",
541
+ [],
542
+ `(forall ((a Idv) (s Idv) (x Int) (y Int)) (! (=> (or (< y x) (and (${MEM} s (${SEQ} a)) (<= 1 x) (<= y (${PROJ_INT} (${LEN} s))))) (${MEM} ${range} (${SEQ} a))) :pattern ((${MEM} s (${SEQ} a)) ${range})))`,
543
+ ),
544
+ axiom(
545
+ "SeqSubseqLen",
546
+ [],
547
+ `(forall ((s Idv) (x Int) (y Int)) (! (and (=> (<= x (+ y 1)) (= (${LEN} ${range}) (${CAST_INT} (- (+ y 1) x)))) (=> (> x (+ y 1)) (= (${LEN} ${range}) (${CAST_INT} 0)))) :pattern (${range})))`,
548
+ ),
549
+ axiom(
550
+ "SeqSubseqApp",
551
+ [],
552
+ `(forall ((s Idv) (x Int) (y Int) (z Int)) (! (=> (and (<= 1 x) (<= 1 z) (<= z (- (+ y 1) x))) (= (${FUN_APP} ${range} (${CAST_INT} z)) (${FUN_APP} s (${CAST_INT} (- (+ z x) 1))))) :pattern ((${FUN_APP} ${range} (${CAST_INT} z)))))`,
553
+ ),
554
+ ],
555
+ );
556
+ }
557
+ case "Cast_Int":
558
+ return spec(
559
+ declare(symbol, 1, "Idv", "Int"),
560
+ ["Mem", "IntSet", "Proj_Int"],
561
+ [
562
+ axiom(
563
+ "CastInjAlt",
564
+ ["Int"],
565
+ `(forall ((x Int)) (! (= x (${PROJ_INT} (${CAST_INT} x))) :pattern ((${CAST_INT} x))))`,
566
+ ),
567
+ axiom(
568
+ "TypeGuardIntro",
569
+ ["Int"],
570
+ `(forall ((z Int)) (! (${MEM} (${CAST_INT} z) ${INT_SET}) :pattern ((${CAST_INT} z))))`,
571
+ ),
572
+ axiom(
573
+ "TypeGuardElim",
574
+ ["Int"],
575
+ `(forall ((x Idv)) (! (=> (${MEM} x ${INT_SET}) (= x (${CAST_INT} (${PROJ_INT} x)))) :pattern ((${MEM} x ${INT_SET}))))`,
576
+ ),
577
+ ],
578
+ );
579
+ case "Cast_Bool":
580
+ return spec(
581
+ declare(symbol, 1, "Idv", "Bool"),
582
+ ["Mem", "BoolSet", "Tt_Idv"],
583
+ [
584
+ axiom(
585
+ "CastInjAlt",
586
+ ["Bool"],
587
+ `(and (= (${CAST_BOOL} true) ${TT_IDV}) (distinct (${CAST_BOOL} false) ${TT_IDV}))`,
588
+ ),
589
+ axiom(
590
+ "TypeGuardIntro",
591
+ ["Bool"],
592
+ `(forall ((z Bool)) (! (${MEM} (${CAST_BOOL} z) ${BOOL_SET}) :pattern ((${CAST_BOOL} z))))`,
593
+ ),
594
+ axiom(
595
+ "TypeGuardElim",
596
+ ["Bool"],
597
+ `(forall ((x Idv)) (! (=> (${MEM} x ${BOOL_SET}) (or (= x (${CAST_BOOL} true)) (= x (${CAST_BOOL} false)))) :pattern ((${MEM} x ${BOOL_SET}))))`,
598
+ ),
599
+ ],
600
+ );
601
+ case "Proj_Int":
602
+ return spec(declare(symbol, 1, "Int"), [], []);
603
+ case "TrigEq_Set$Idv$":
604
+ return fixed(
605
+ 2,
606
+ ["SetExtTrigger"],
607
+ [
608
+ axiom(
609
+ "ExtTrigEqDef",
610
+ ["Set$Idv$"],
611
+ `(forall ((x Idv) (y Idv)) (! (= (${TRIG_EQ} x y) (= x y)) :pattern ((${TRIG_EQ} x y))))`,
612
+ ),
613
+ axiom(
614
+ "ExtTrigEqTrigger",
615
+ ["Idv"],
616
+ `(forall ((x Idv) (y Idv)) (! (${SET_EXT_TRIGGER} x y) :pattern ((${TRIG_EQ} x y))))`,
617
+ ),
618
+ ],
619
+ "Bool",
620
+ );
621
+ case "SetExtTrigger":
622
+ case "IsSetOf":
623
+ return fixed(name === "IsSetOf" ? 1 : 2, [], [], "Bool");
624
+ case "BoolSet":
625
+ case "StrSet":
626
+ case "IntSet":
627
+ case "Tt_Idv":
628
+ return fixed(0, [], []);
629
+ case "TIntLteq":
630
+ return spec(undefined, ["IntLteq"], [getTyping("IntLteq")]);
631
+ default:
632
+ // The rest are numerals, which SMT-LIB has natively.
633
+ if (name.startsWith("TIntLit_")) return spec(undefined, [], []);
634
+ throw new TlaUnsupportedError(`the symbol ${name}`);
635
+ }
636
+ };