tla-ts 0.0.4-dev.e4c2d0e → 0.0.4-dev.ee344a5

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 (311) hide show
  1. package/README.md +45 -1
  2. package/dist/deciders.cjs +366 -0
  3. package/dist/deciders.js +366 -0
  4. package/dist/index.cjs +1 -1
  5. package/dist/index.d.cts +35 -1
  6. package/dist/index.d.ts +35 -1
  7. package/dist/index.js +1 -1
  8. package/dist/parallel-worker.cjs +1 -4
  9. package/dist/parallel-worker.js +1 -4
  10. package/dist/prove-worker.cjs +9 -0
  11. package/dist/prove-worker.d.cts +9 -0
  12. package/dist/prove-worker.d.ts +9 -0
  13. package/dist/prove-worker.js +9 -0
  14. package/dist/prove.cjs +515 -0
  15. package/dist/prove.js +515 -0
  16. package/dist/run-cli.cjs +30 -47
  17. package/dist/run-cli.js +30 -47
  18. package/dist/tlapm.cjs +10 -0
  19. package/dist/tlapm.js +10 -0
  20. package/dist/transfer.cjs +38 -44
  21. package/dist/transfer.js +38 -44
  22. package/dist/worker.cjs +21 -0
  23. package/dist/worker.js +21 -0
  24. package/package.json +21 -12
  25. package/src/check.ts +1 -0
  26. package/src/codegen.ts +26 -7
  27. package/src/errors.ts +86 -0
  28. package/src/evaluate.ts +63 -20
  29. package/src/index.ts +10 -0
  30. package/src/{obligation-action.ts → obligations/action.ts} +258 -37
  31. package/src/{obligation-anon.ts → obligations/anon.ts} +13 -7
  32. package/src/obligations/ctx.ts +64 -0
  33. package/src/{obligation-deref.ts → obligations/deref.ts} +2 -2
  34. package/src/{obligation-expression.ts → obligations/expression.ts} +54 -8
  35. package/src/{obligation-generate.ts → obligations/generate.ts} +134 -61
  36. package/src/{obligations.ts → obligations/index.ts} +26 -12
  37. package/src/{obligation-levels.ts → obligations/levels.ts} +12 -2
  38. package/src/{obligation-module.ts → obligations/module.ts} +46 -20
  39. package/src/obligations/pickle.ts +100 -0
  40. package/src/obligations/pragma.ts +189 -0
  41. package/src/{obligation-printer.ts → obligations/printer.ts} +5 -59
  42. package/src/{obligation-proof.ts → obligations/proof.ts} +7 -1
  43. package/src/{obligation-source.ts → obligations/source.ts} +91 -35
  44. package/src/obligations/temporal.ts +319 -0
  45. package/src/{obligation-tuples.ts → obligations/tuples.ts} +1 -1
  46. package/src/parallel-worker.ts +2 -18
  47. package/src/parallel.ts +10 -43
  48. package/src/prove/decide-pool.ts +100 -0
  49. package/src/prove/deciders.ts +27 -0
  50. package/src/prove/isabelle/LICENSE +36 -0
  51. package/src/prove/isabelle/LICENSE-tlapm +26 -0
  52. package/src/prove/isabelle/decide.ts +47 -0
  53. package/src/prove/isabelle/encode.ts +477 -0
  54. package/src/prove/isabelle/isar/inner-syntax.ts +579 -0
  55. package/src/prove/isabelle/isar/method.ts +367 -0
  56. package/src/prove/isabelle/isar/proof.ts +28 -0
  57. package/src/prove/isabelle/isar/statement.ts +57 -0
  58. package/src/prove/isabelle/isar/theory.ts +192 -0
  59. package/src/prove/isabelle/isar/type-check.ts +278 -0
  60. package/src/prove/isabelle/provers/blast/blast.ts +258 -0
  61. package/src/prove/isabelle/provers/blast/branch.ts +322 -0
  62. package/src/prove/isabelle/provers/blast/prove.ts +347 -0
  63. package/src/prove/isabelle/provers/blast/rules.ts +330 -0
  64. package/src/prove/isabelle/provers/blast/state.ts +180 -0
  65. package/src/prove/isabelle/provers/blast/term.ts +547 -0
  66. package/src/prove/isabelle/provers/clasimp.ts +150 -0
  67. package/src/prove/isabelle/provers/classical.ts +389 -0
  68. package/src/prove/isabelle/provers/hypsubst.ts +441 -0
  69. package/src/prove/isabelle/pure/bicompose.ts +174 -0
  70. package/src/prove/isabelle/pure/consts.ts +32 -0
  71. package/src/prove/isabelle/pure/conv.ts +79 -0
  72. package/src/prove/isabelle/pure/drule.ts +264 -0
  73. package/src/prove/isabelle/pure/envir.ts +363 -0
  74. package/src/prove/isabelle/pure/goal.ts +53 -0
  75. package/src/prove/isabelle/pure/interrupt.ts +16 -0
  76. package/src/prove/isabelle/pure/list.ts +12 -0
  77. package/src/prove/isabelle/pure/logic.ts +402 -0
  78. package/src/prove/isabelle/pure/name.ts +110 -0
  79. package/src/prove/isabelle/pure/net.ts +262 -0
  80. package/src/prove/isabelle/pure/object-logic.ts +41 -0
  81. package/src/prove/isabelle/pure/pattern.ts +650 -0
  82. package/src/prove/isabelle/pure/raw-simplifier.ts +353 -0
  83. package/src/prove/isabelle/pure/rewriter.ts +602 -0
  84. package/src/prove/isabelle/pure/search.ts +68 -0
  85. package/src/prove/isabelle/pure/seq.ts +156 -0
  86. package/src/prove/isabelle/pure/simplifier.ts +112 -0
  87. package/src/prove/isabelle/pure/table.ts +208 -0
  88. package/src/prove/isabelle/pure/tactic.ts +276 -0
  89. package/src/prove/isabelle/pure/tactical.ts +347 -0
  90. package/src/prove/isabelle/pure/term-ord.ts +159 -0
  91. package/src/prove/isabelle/pure/term.ts +808 -0
  92. package/src/prove/isabelle/pure/thm.ts +806 -0
  93. package/src/prove/isabelle/pure/type.ts +133 -0
  94. package/src/prove/isabelle/pure/unify.ts +753 -0
  95. package/src/prove/isabelle/pure/variable.ts +25 -0
  96. package/src/prove/isabelle/tla/classical-setup.ts +101 -0
  97. package/src/prove/isabelle/tla/context.ts +74 -0
  98. package/src/prove/isabelle/tla/logic-data.ts +5 -0
  99. package/src/prove/isabelle/tla/logic.ts +215 -0
  100. package/src/prove/isabelle/tla/simpdata.ts +241 -0
  101. package/src/prove/isabelle/tools/intuitionistic.ts +132 -0
  102. package/src/prove/ocaml.ts +22 -0
  103. package/src/prove/prep/action.ts +520 -0
  104. package/src/prove/prep/defs.ts +27 -0
  105. package/src/prove/prep/elab.ts +156 -0
  106. package/src/prove/prep/enabled-axioms.ts +189 -0
  107. package/src/prove/prep/enabled.ts +43 -0
  108. package/src/prove/prep/fingerprint.ts +388 -0
  109. package/src/prove/prep/flatten.ts +70 -0
  110. package/src/prove/prep/level-comparison.ts +552 -0
  111. package/src/prove/prep/md5.ts +67 -0
  112. package/src/prove/prep/pragma.ts +221 -0
  113. package/src/prove/prep/trivial.ts +22 -0
  114. package/src/prove/prove-worker.ts +29 -0
  115. package/src/prove/prove.ts +417 -0
  116. package/src/prove/ptl/decide.ts +68 -0
  117. package/src/prove/ptl/encode.ts +256 -0
  118. package/src/prove/ptl/sat.ts +151 -0
  119. package/src/prove/ptl/tableau.ts +276 -0
  120. package/src/prove/smt/axiomatize.ts +69 -0
  121. package/src/prove/smt/axioms.ts +210 -0
  122. package/src/prove/smt/context.ts +108 -0
  123. package/src/prove/smt/data.ts +665 -0
  124. package/src/prove/smt/encode.ts +169 -0
  125. package/src/prove/smt/extensionality.ts +63 -0
  126. package/src/prove/smt/flatten.ts +127 -0
  127. package/src/prove/smt/format.ts +143 -0
  128. package/src/prove/smt/instances.ts +182 -0
  129. package/src/prove/smt/rewrite.ts +784 -0
  130. package/src/prove/smt/simplify.ts +57 -0
  131. package/src/prove/smt/solver/act-cache.ts +265 -0
  132. package/src/prove/smt/solver/arith-rewriter.ts +962 -0
  133. package/src/prove/smt/solver/array.ts +22 -0
  134. package/src/prove/smt/solver/asserted-formulas.ts +469 -0
  135. package/src/prove/smt/solver/ast-lt.ts +157 -0
  136. package/src/prove/smt/solver/ast-util.ts +147 -0
  137. package/src/prove/smt/solver/ast.ts +1315 -0
  138. package/src/prove/smt/solver/auf-solver.ts +572 -0
  139. package/src/prove/smt/solver/case-split-queue.ts +178 -0
  140. package/src/prove/smt/solver/cg-table.ts +175 -0
  141. package/src/prove/smt/solver/clause.ts +276 -0
  142. package/src/prove/smt/solver/conflict-resolution.ts +343 -0
  143. package/src/prove/smt/solver/context.ts +1292 -0
  144. package/src/prove/smt/solver/ctx-simplify.ts +334 -0
  145. package/src/prove/smt/solver/der.ts +224 -0
  146. package/src/prove/smt/solver/dyn-ack.ts +141 -0
  147. package/src/prove/smt/solver/e-matching.ts +659 -0
  148. package/src/prove/smt/solver/enode.ts +259 -0
  149. package/src/prove/smt/solver/expr-ref.ts +21 -0
  150. package/src/prove/smt/solver/expr-safe-replace.ts +172 -0
  151. package/src/prove/smt/solver/fingerprints.ts +92 -0
  152. package/src/prove/smt/solver/flat-literals.ts +51 -0
  153. package/src/prove/smt/solver/goal.ts +138 -0
  154. package/src/prove/smt/solver/hash.ts +173 -0
  155. package/src/prove/smt/solver/hashtable.ts +166 -0
  156. package/src/prove/smt/solver/internalizer.ts +1381 -0
  157. package/src/prove/smt/solver/lbool.ts +5 -0
  158. package/src/prove/smt/solver/literal.ts +24 -0
  159. package/src/prove/smt/solver/lp/bound-propagator.ts +391 -0
  160. package/src/prove/smt/solver/lp/constraints.ts +78 -0
  161. package/src/prove/smt/solver/lp/containers.ts +296 -0
  162. package/src/prove/smt/solver/lp/core-solver.ts +504 -0
  163. package/src/prove/smt/solver/lp/cross-nested.ts +224 -0
  164. package/src/prove/smt/solver/lp/dep-intervals.ts +656 -0
  165. package/src/prove/smt/solver/lp/dependency.ts +51 -0
  166. package/src/prove/smt/solver/lp/dioph-eq.ts +1181 -0
  167. package/src/prove/smt/solver/lp/explanation.ts +46 -0
  168. package/src/prove/smt/solver/lp/gomory.ts +255 -0
  169. package/src/prove/smt/solver/lp/hnf-cutter.ts +125 -0
  170. package/src/prove/smt/solver/lp/hnf.ts +281 -0
  171. package/src/prove/smt/solver/lp/int-cube.ts +295 -0
  172. package/src/prove/smt/solver/lp/int-solver.ts +514 -0
  173. package/src/prove/smt/solver/lp/lar-solver.ts +816 -0
  174. package/src/prove/smt/solver/lp/lar-term.ts +62 -0
  175. package/src/prove/smt/solver/lp/lp-settings.ts +91 -0
  176. package/src/prove/smt/solver/lp/maximize-term.ts +347 -0
  177. package/src/prove/smt/solver/lp/nex-creator.ts +381 -0
  178. package/src/prove/smt/solver/lp/nex.ts +120 -0
  179. package/src/prove/smt/solver/lp/nla-backoff.ts +43 -0
  180. package/src/prove/smt/solver/lp/nla-basics.ts +398 -0
  181. package/src/prove/smt/solver/lp/nla-core.ts +968 -0
  182. package/src/prove/smt/solver/lp/nla-divisions.ts +332 -0
  183. package/src/prove/smt/solver/lp/nla-emonics.ts +373 -0
  184. package/src/prove/smt/solver/lp/nla-factorization.ts +30 -0
  185. package/src/prove/smt/solver/lp/nla-grobner.ts +904 -0
  186. package/src/prove/smt/solver/lp/nla-horner.ts +126 -0
  187. package/src/prove/smt/solver/lp/nla-intervals.ts +265 -0
  188. package/src/prove/smt/solver/lp/nla-monomial-bounds.ts +715 -0
  189. package/src/prove/smt/solver/lp/nla-monotone.ts +59 -0
  190. package/src/prove/smt/solver/lp/nla-order.ts +307 -0
  191. package/src/prove/smt/solver/lp/nla-patcher.ts +112 -0
  192. package/src/prove/smt/solver/lp/nla-tangents.ts +251 -0
  193. package/src/prove/smt/solver/lp/nla-throttle.ts +85 -0
  194. package/src/prove/smt/solver/lp/nla-types.ts +124 -0
  195. package/src/prove/smt/solver/lp/nla-var-eqs.ts +141 -0
  196. package/src/prove/smt/solver/lp/nra-solver.ts +440 -0
  197. package/src/prove/smt/solver/lp/numeric-pair.ts +65 -0
  198. package/src/prove/smt/solver/lp/pdd-interval.ts +31 -0
  199. package/src/prove/smt/solver/lp/pdd-simplifier.ts +184 -0
  200. package/src/prove/smt/solver/lp/pdd-solver.ts +408 -0
  201. package/src/prove/smt/solver/lp/pdd.ts +971 -0
  202. package/src/prove/smt/solver/lp/random-updater.ts +138 -0
  203. package/src/prove/smt/solver/lp/static-matrix.ts +246 -0
  204. package/src/prove/smt/solver/lp/union-find.ts +96 -0
  205. package/src/prove/smt/solver/mam-compiler.ts +847 -0
  206. package/src/prove/smt/solver/mam-interpreter.ts +400 -0
  207. package/src/prove/smt/solver/maximize-ac-sharing.ts +118 -0
  208. package/src/prove/smt/solver/model-checker.ts +347 -0
  209. package/src/prove/smt/solver/model-evaluator.ts +262 -0
  210. package/src/prove/smt/solver/model-finder.ts +155 -0
  211. package/src/prove/smt/solver/model-generator.ts +97 -0
  212. package/src/prove/smt/solver/model-macro-solver.ts +728 -0
  213. package/src/prove/smt/solver/nlsat/algebraic.ts +1161 -0
  214. package/src/prove/smt/solver/nlsat/atoms.ts +238 -0
  215. package/src/prove/smt/solver/nlsat/evaluator.ts +303 -0
  216. package/src/prove/smt/solver/nlsat/explain.ts +607 -0
  217. package/src/prove/smt/solver/nlsat/interval-set.ts +351 -0
  218. package/src/prove/smt/solver/nlsat/levelwise.ts +740 -0
  219. package/src/prove/smt/solver/nlsat/mpbq.ts +161 -0
  220. package/src/prove/smt/solver/nlsat/polynomial.ts +1722 -0
  221. package/src/prove/smt/solver/nlsat/solver.ts +911 -0
  222. package/src/prove/smt/solver/nlsat/types.ts +43 -0
  223. package/src/prove/smt/solver/nlsat/upolynomial-factorization.ts +648 -0
  224. package/src/prove/smt/solver/nlsat/upolynomial.ts +996 -0
  225. package/src/prove/smt/solver/nnf.ts +469 -0
  226. package/src/prove/smt/solver/pattern-inference.ts +351 -0
  227. package/src/prove/smt/solver/poly-rewriter.ts +477 -0
  228. package/src/prove/smt/solver/propagate-values.ts +83 -0
  229. package/src/prove/smt/solver/proto-model.ts +551 -0
  230. package/src/prove/smt/solver/pull-quant.ts +139 -0
  231. package/src/prove/smt/solver/qe-lite-der.ts +526 -0
  232. package/src/prove/smt/solver/qe-lite-fm.ts +576 -0
  233. package/src/prove/smt/solver/qe-lite.ts +381 -0
  234. package/src/prove/smt/solver/qi-queue.ts +362 -0
  235. package/src/prove/smt/solver/quant-tactics.ts +117 -0
  236. package/src/prove/smt/solver/quantifier-analyzer.ts +562 -0
  237. package/src/prove/smt/solver/quantifier-manager.ts +186 -0
  238. package/src/prove/smt/solver/random-gen.ts +10 -0
  239. package/src/prove/smt/solver/rational.ts +165 -0
  240. package/src/prove/smt/solver/ref-vector.ts +62 -0
  241. package/src/prove/smt/solver/relevancy.ts +247 -0
  242. package/src/prove/smt/solver/rewriter-tpl.ts +1159 -0
  243. package/src/prove/smt/solver/rewriter.ts +843 -0
  244. package/src/prove/smt/solver/rlimit.ts +79 -0
  245. package/src/prove/smt/solver/smtlib-parser.ts +526 -0
  246. package/src/prove/smt/solver/solver.ts +71 -0
  247. package/src/prove/smt/solver/sort.ts +35 -0
  248. package/src/prove/smt/solver/sticky-generations.ts +69 -0
  249. package/src/prove/smt/solver/theory-lra-axioms.ts +340 -0
  250. package/src/prove/smt/solver/theory-lra-bounds.ts +226 -0
  251. package/src/prove/smt/solver/theory-lra-final-check.ts +252 -0
  252. package/src/prove/smt/solver/theory-lra-internalize.ts +476 -0
  253. package/src/prove/smt/solver/theory-lra-model.ts +243 -0
  254. package/src/prove/smt/solver/theory-lra-propagate.ts +405 -0
  255. package/src/prove/smt/solver/theory-lra-state.ts +43 -0
  256. package/src/prove/smt/solver/theory-lra.ts +56 -0
  257. package/src/prove/smt/solver/var-subst.ts +258 -0
  258. package/src/prove/smt/solver/z3-license.txt +10 -0
  259. package/src/prove/smt/table.ts +170 -0
  260. package/src/prove/tlapm/tlapm.ts +96 -0
  261. package/src/prove/tlaps-module.ts +510 -0
  262. package/src/prove/verdict.ts +13 -0
  263. package/src/prove/zenon/LICENSE +32 -0
  264. package/src/prove/zenon/check/check.ts +105 -0
  265. package/src/prove/zenon/check/definitions.ts +144 -0
  266. package/src/prove/zenon/check/equality.ts +182 -0
  267. package/src/prove/zenon/check/functions.ts +62 -0
  268. package/src/prove/zenon/check/keys.ts +125 -0
  269. package/src/prove/zenon/check/propositional.ts +104 -0
  270. package/src/prove/zenon/check/records.ts +188 -0
  271. package/src/prove/zenon/check/relations.ts +121 -0
  272. package/src/prove/zenon/check/rewrites.ts +224 -0
  273. package/src/prove/zenon/check/sets.ts +302 -0
  274. package/src/prove/zenon/check/terms.ts +127 -0
  275. package/src/prove/zenon/check/tla.ts +126 -0
  276. package/src/prove/zenon/decide.ts +113 -0
  277. package/src/prove/zenon/encode.ts +444 -0
  278. package/src/prove/zenon/eqrel.ts +300 -0
  279. package/src/prove/zenon/equality-rules.ts +435 -0
  280. package/src/prove/zenon/expr.ts +551 -0
  281. package/src/prove/zenon/index-table.ts +350 -0
  282. package/src/prove/zenon/isar-case.ts +513 -0
  283. package/src/prove/zenon/isar.ts +1249 -0
  284. package/src/prove/zenon/limits.ts +15 -0
  285. package/src/prove/zenon/llproof.ts +173 -0
  286. package/src/prove/zenon/mltoll.ts +1566 -0
  287. package/src/prove/zenon/node.ts +297 -0
  288. package/src/prove/zenon/ocaml.ts +169 -0
  289. package/src/prove/zenon/parse.ts +247 -0
  290. package/src/prove/zenon/phrase.ts +191 -0
  291. package/src/prove/zenon/proof.ts +198 -0
  292. package/src/prove/zenon/propositional-rules.ts +387 -0
  293. package/src/prove/zenon/rules.ts +94 -0
  294. package/src/prove/zenon/search.ts +288 -0
  295. package/src/prove/zenon/tla/functions.ts +151 -0
  296. package/src/prove/zenon/tla/llproof.ts +480 -0
  297. package/src/prove/zenon/tla/records.ts +225 -0
  298. package/src/prove/zenon/tla/rewrites.ts +447 -0
  299. package/src/prove/zenon/tla/sets.ts +304 -0
  300. package/src/prove/zenon/tla/terms.ts +181 -0
  301. package/src/prove/zenon/tla/tla.ts +506 -0
  302. package/src/run-cli.ts +73 -20
  303. package/src/standard-modules.ts +5 -2
  304. package/src/successors.ts +24 -5
  305. package/src/tlc-random.ts +55 -32
  306. package/src/tlc-version.ts +8 -7
  307. package/src/values.ts +85 -41
  308. package/src/worker.ts +65 -0
  309. package/dist/parallel.cjs +0 -12
  310. package/dist/parallel.js +0 -12
  311. /package/src/{obligation-format.ts → obligations/format.ts} +0 -0
@@ -0,0 +1,665 @@
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
+ TYPINGS,
7
+ getEnumeration,
8
+ getIntegers,
9
+ getTupleAxioms,
10
+ getRecordAxioms,
11
+ getComponentExcept,
12
+ getComponentSet,
13
+ } from "./axioms";
14
+ import {
15
+ APPEND,
16
+ BOOL_SET,
17
+ CAP,
18
+ CAST_BOOL,
19
+ CAST_INT,
20
+ CAT,
21
+ declare,
22
+ formatName,
23
+ forall,
24
+ FUN_APP,
25
+ FUN_DOM,
26
+ FUN_EXCEPT,
27
+ FUN_ISAFCN,
28
+ FUN_SET,
29
+ HEAD,
30
+ INT_LTEQ,
31
+ INT_RANGE,
32
+ INT_SET,
33
+ IS_SET_OF,
34
+ LEN,
35
+ MEM,
36
+ NAT_SET,
37
+ PROJ_INT,
38
+ SEQ,
39
+ SET_EXT_TRIGGER,
40
+ STR_SET,
41
+ SUB_SEQ,
42
+ SUBSET,
43
+ SUBSET_EQ,
44
+ TAIL,
45
+ tla,
46
+ TRIG_EQ,
47
+ TT_IDV,
48
+ UNION,
49
+ } from "./format";
50
+ import { axiom, type Axiom } from "./table";
51
+
52
+ export interface SymbolSpec {
53
+ declaration: string | undefined;
54
+ deps: string[];
55
+ axioms: Axiom[];
56
+ }
57
+
58
+ // N_data.s: what the symbols collected so far change about the axioms of the next ones.
59
+ export interface CollectState {
60
+ // The fields of each record symbol the obligation uses.
61
+ recordFields: Map<string, string[]>;
62
+ strings: string[];
63
+ isFunConstr: boolean;
64
+ isFunSet: boolean;
65
+ isExcept: boolean;
66
+ tuples: number[];
67
+ records: string[][];
68
+ anonymous: Map<string, number>;
69
+ }
70
+
71
+ const SEQUENCE_DEPS = ["Mem", "Seq", "Len", "FunApp", "NatSet", "Cast_Int", "Proj_Int"];
72
+
73
+ // N_data.get_deps, with arithmetic and set extensionality as tlapm's SMT backend sets them.
74
+ export const getSymbolSpec = (name: string, state: CollectState): SymbolSpec => {
75
+ const spec = (declaration: string | undefined, deps: string[], axioms: Axiom[]) => ({
76
+ declaration,
77
+ deps,
78
+ axioms,
79
+ });
80
+ const symbol = formatName(`TLA__${name}`);
81
+ const fixed = (arity: number, deps: string[], axioms: Axiom[], sort = "Idv") =>
82
+ spec(declare(symbol, arity, sort), deps, axioms);
83
+ const enumeration = /^SetEnum_(\d+)$/.exec(name);
84
+ if (enumeration)
85
+ return fixed(Number(enumeration[1]), ["Mem"], getEnumeration(Number(enumeration[1])));
86
+ const setOf = /^SetOf_(\d+)$/.exec(name);
87
+ if (setOf) {
88
+ const count = Number(setOf[1]);
89
+ return spec(
90
+ undefined,
91
+ ["Mem", "IsSetOf"],
92
+ [
93
+ axiom("SetOfIntro", [count], undefined),
94
+ axiom("SetOfElim", [count], undefined),
95
+ axiom("AssertIsSetOf", [count], undefined),
96
+ axiom(
97
+ "CompareSetOfTrigger",
98
+ [],
99
+ forall(["a", "b"], `(${SET_EXT_TRIGGER} a b)`, [
100
+ [`(${IS_SET_OF} a)`, `(${IS_SET_OF} b)`],
101
+ ]),
102
+ ),
103
+ ],
104
+ );
105
+ }
106
+ if (name.startsWith("StrLit_")) {
107
+ const value = name.slice("StrLit_".length);
108
+ const distinct = state.strings.map((other) =>
109
+ axiom("StrLitDistinct", [value, other], `(distinct ${symbol} ${tla(`StrLit_${other}`)})`),
110
+ );
111
+ state.strings.push(value);
112
+ return fixed(
113
+ 0,
114
+ ["Mem", "StrSet"],
115
+ [axiom("StrLitIsstr", [value], `(${MEM} ${symbol} ${STR_SET})`), ...distinct],
116
+ );
117
+ }
118
+ const tuple = /^Tuple_(\d+)$/.exec(name);
119
+ if (tuple) {
120
+ const count = Number(tuple[1]);
121
+ state.tuples.push(count);
122
+ const deps =
123
+ count === 0
124
+ ? ["FunIsafcn", "Cast_Int", "Seq", "Len"]
125
+ : ["FunIsafcn", "FunDom", "FunApp", `SetEnum_${count}`, "Cast_Int", "Mem", "Seq", "Len"];
126
+ return fixed(count, deps, getTupleAxioms(count, state.isExcept));
127
+ }
128
+ const product = /^Product_(\d+)$/.exec(name);
129
+ if (product) {
130
+ const count = Number(product[1]);
131
+ return fixed(
132
+ count,
133
+ ["Mem", `Tuple_${count}`, "FunApp", "Cast_Int", "Proj_Int"],
134
+ getComponentSet("Product", [count], symbol, tla(`Tuple_${count}`), getIntegers(count), "t"),
135
+ );
136
+ }
137
+ const fields = state.recordFields.get(name);
138
+ if (fields && name.startsWith("Record_")) {
139
+ state.records.push(fields);
140
+ return fixed(
141
+ fields.length,
142
+ [
143
+ "FunIsafcn",
144
+ "FunDom",
145
+ "FunApp",
146
+ `SetEnum_${fields.length}`,
147
+ ...fields.map((field) => `StrLit_${field}`),
148
+ ],
149
+ getRecordAxioms(fields, state.isExcept),
150
+ );
151
+ }
152
+ if (fields && name.startsWith("RecordSet_")) {
153
+ const record = `Record_${fields.join("_")}`;
154
+ return fixed(
155
+ fields.length,
156
+ ["Mem", record, "FunApp", ...fields.map((field) => `StrLit_${field}`)],
157
+ getComponentSet(
158
+ "RecSet",
159
+ [fields],
160
+ symbol,
161
+ tla(record),
162
+ fields.map((field) => tla(`StrLit_${field}`)),
163
+ "r",
164
+ ),
165
+ );
166
+ }
167
+ const anonymous = state.anonymous.get(name);
168
+ if (anonymous !== undefined) return fixed(anonymous, [], []);
169
+ const typing = TYPINGS[name];
170
+ if (typing)
171
+ return fixed(
172
+ name === "IntUminus" ? 1 : 2,
173
+ ["Cast_Int"],
174
+ [typing()],
175
+ name === "IntLteq" ? "Bool" : "Idv",
176
+ );
177
+ switch (name) {
178
+ // SMT-LIB has no exponentiation, so IntExp keeps only its typing.
179
+ case "IntExp":
180
+ return fixed(
181
+ 2,
182
+ ["Mem", "IntSet", "Cast_Int", "TIntLteq", "TIntLit_0", "TIntLit_1"],
183
+ [
184
+ axiom(
185
+ "IntExpTyping",
186
+ [],
187
+ `(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))))`,
188
+ ),
189
+ ],
190
+ );
191
+ case "SelectSeq":
192
+ return spec(
193
+ undefined,
194
+ [
195
+ "Mem",
196
+ "Seq",
197
+ "Len",
198
+ "Append",
199
+ "FunApp",
200
+ "FunDom",
201
+ "IntSet",
202
+ "NatSet",
203
+ "Tuple_0",
204
+ "Proj_Int",
205
+ ],
206
+ [
207
+ axiom("SeqSelectseqTyping", [], undefined),
208
+ axiom("SeqSelectseqLen", [], undefined),
209
+ axiom("SeqSelectseqNil", [], undefined),
210
+ axiom("SeqSelectseqApp", [], undefined),
211
+ axiom("SeqSelectseqAppend", [], undefined),
212
+ ],
213
+ );
214
+ case "Choose":
215
+ return spec(undefined, [], [axiom("ChooseDef", [], undefined)]);
216
+ case "Mem":
217
+ return fixed(
218
+ 2,
219
+ ["SetExtTrigger"],
220
+ [
221
+ axiom(
222
+ "SetExt",
223
+ [],
224
+ `(forall ((x Idv) (y Idv)) (! (=> (forall ((z Idv)) (= (${MEM} z x) (${MEM} z y))) (= x y)) :pattern ((${SET_EXT_TRIGGER} x y))))`,
225
+ ),
226
+ ],
227
+ "Bool",
228
+ );
229
+ case "SubsetEq":
230
+ return fixed(
231
+ 2,
232
+ ["Mem"],
233
+ [
234
+ axiom(
235
+ "SubsetEqIntro",
236
+ [],
237
+ `(forall ((x Idv) (y Idv)) (! (=> (forall ((z Idv)) (=> (${MEM} z x) (${MEM} z y))) (${SUBSET_EQ} x y)) :pattern ((${SUBSET_EQ} x y))))`,
238
+ ),
239
+ axiom(
240
+ "SubsetEqElim",
241
+ [],
242
+ `(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))))`,
243
+ ),
244
+ ],
245
+ "Bool",
246
+ );
247
+ case "Union":
248
+ return fixed(
249
+ 1,
250
+ ["Mem"],
251
+ [
252
+ axiom(
253
+ "UnionIntro",
254
+ [],
255
+ `(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))))`,
256
+ ),
257
+ axiom(
258
+ "UnionElim",
259
+ [],
260
+ `(forall ((a Idv) (x Idv)) (! (=> (${MEM} x (${UNION} a)) (exists ((y Idv)) (and (${MEM} y a) (${MEM} x y)))) :pattern ((${MEM} x (${UNION} a)))))`,
261
+ ),
262
+ ],
263
+ );
264
+ case "Subset":
265
+ return fixed(
266
+ 1,
267
+ ["Mem", "SubsetEq"],
268
+ [
269
+ axiom(
270
+ "SubsetDefAlt",
271
+ [],
272
+ `(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))))`,
273
+ ),
274
+ ],
275
+ );
276
+ case "Cup":
277
+ case "Cap":
278
+ case "SetMinus": {
279
+ const condition =
280
+ name === "Cup"
281
+ ? "(or (MEM x a) (MEM x b))"
282
+ : name === "Cap"
283
+ ? "(and (MEM x a) (MEM x b))"
284
+ : "(and (MEM x a) (not (MEM x b)))";
285
+ const definition = axiom(
286
+ `${name}Def`,
287
+ [],
288
+ `(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))))`,
289
+ );
290
+ if (name !== "Cap") return fixed(2, ["Mem"], [definition]);
291
+ return fixed(
292
+ 2,
293
+ ["Mem", "SetEnum_0", "SetExtTrigger"],
294
+ [
295
+ definition,
296
+ axiom(
297
+ "DisjointTrigger",
298
+ [],
299
+ `(forall ((x Idv) (y Idv)) (! (${SET_EXT_TRIGGER} (${CAP} x y) ${tla("SetEnum_0")}) :pattern ((${CAP} x y))))`,
300
+ ),
301
+ ],
302
+ );
303
+ }
304
+ case "SetSt":
305
+ return spec(
306
+ undefined,
307
+ ["Mem", "SetEnum_0", "SetExtTrigger"],
308
+ [axiom("SetStDef", [], undefined), axiom("EmptyComprehensionTrigger", [], undefined)],
309
+ );
310
+ case "NatSet":
311
+ return fixed(
312
+ 0,
313
+ ["IntSet", "TIntLit_0", "Cast_Int", "IntLteq"],
314
+ [
315
+ axiom(
316
+ "NatSetDef",
317
+ [],
318
+ `(forall ((x Idv)) (! (= (${MEM} x ${NAT_SET}) (and (${MEM} x ${INT_SET}) (${INT_LTEQ} (${CAST_INT} 0) x))) :pattern ((${MEM} x ${NAT_SET}))))`,
319
+ ),
320
+ ],
321
+ );
322
+ case "IntRange":
323
+ return fixed(
324
+ 2,
325
+ ["Mem", "IntSet", "IntLteq"],
326
+ [
327
+ axiom(
328
+ "IntRangeDef",
329
+ [],
330
+ `(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)))))`,
331
+ ),
332
+ ],
333
+ );
334
+ case "FunIsafcn":
335
+ return fixed(
336
+ 1,
337
+ ["Mem", "FunDom", "FunFcn", "FunApp"],
338
+ [
339
+ axiom(
340
+ "FunExt",
341
+ [],
342
+ `(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))))`,
343
+ ),
344
+ ],
345
+ "Bool",
346
+ );
347
+ case "FunSet":
348
+ state.isFunSet = true;
349
+ return fixed(
350
+ 2,
351
+ ["Mem", "FunIsafcn", "FunDom", "FunApp"],
352
+ [
353
+ axiom(
354
+ "FunSetIntro",
355
+ [],
356
+ `(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)))))`,
357
+ ),
358
+ axiom(
359
+ "FunSetElim1",
360
+ [],
361
+ `(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)))))`,
362
+ ),
363
+ axiom(
364
+ "FunSetElim2",
365
+ [],
366
+ `(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))))`,
367
+ ),
368
+ ...(state.isFunConstr ? [axiom("FunTyping", [], undefined)] : []),
369
+ ],
370
+ );
371
+ case "FunFcn":
372
+ state.isFunConstr = true;
373
+ return spec(
374
+ undefined,
375
+ ["FunIsafcn"],
376
+ [
377
+ axiom("FunConstrIsafcn", [], undefined),
378
+ ...(state.isFunSet ? [axiom("FunTyping", [], undefined)] : []),
379
+ ],
380
+ );
381
+ case "FunDom":
382
+ return fixed(1, ["FunFcn"], [axiom("FunDomDef", [], undefined)]);
383
+ case "FunApp":
384
+ return fixed(2, ["Mem", "FunFcn"], [axiom("FunAppDef", [], undefined)]);
385
+ case "FunExcept": {
386
+ state.isExcept = true;
387
+ const updated = `(${FUN_EXCEPT} f x y)`;
388
+ return fixed(
389
+ 3,
390
+ ["Mem", "FunIsafcn", "FunDom", "FunApp"],
391
+ [
392
+ axiom(
393
+ "FunExceptIsafcn",
394
+ [],
395
+ `(forall ((f Idv) (x Idv) (y Idv)) (! (${FUN_ISAFCN} ${updated}) :pattern (${updated})))`,
396
+ ),
397
+ axiom(
398
+ "FunExceptDomDef",
399
+ [],
400
+ `(forall ((f Idv) (x Idv) (y Idv)) (! (= (${FUN_DOM} ${updated}) (${FUN_DOM} f)) :pattern (${updated})))`,
401
+ ),
402
+ axiom(
403
+ "FunExceptAppDef1",
404
+ [],
405
+ `(forall ((f Idv) (x Idv) (y Idv)) (! (=> (${MEM} x (${FUN_DOM} f)) (= (${FUN_APP} ${updated} x) y)) :pattern (${updated})))`,
406
+ ),
407
+ axiom(
408
+ "FunExceptAppDef2",
409
+ [],
410
+ `(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))))`,
411
+ ),
412
+ ...state.tuples.flatMap((count) =>
413
+ getIntegers(count).map((_key, index) =>
414
+ getComponentExcept(
415
+ "TupExcept",
416
+ [count],
417
+ tla(`Tuple_${count}`),
418
+ getIntegers(count),
419
+ index,
420
+ ),
421
+ ),
422
+ ),
423
+ ...state.records.flatMap((recordFields) =>
424
+ recordFields.map((_field, index) =>
425
+ getComponentExcept(
426
+ "RecExcept",
427
+ [recordFields],
428
+ tla(`Record_${recordFields.join("_")}`),
429
+ recordFields.map((field) => tla(`StrLit_${field}`)),
430
+ index,
431
+ ),
432
+ ),
433
+ ),
434
+ ],
435
+ );
436
+ }
437
+ case "Seq":
438
+ return fixed(
439
+ 1,
440
+ [
441
+ "Mem",
442
+ "Len",
443
+ "FunIsafcn",
444
+ "FunDom",
445
+ "FunApp",
446
+ "IntSet",
447
+ "NatSet",
448
+ "IntRange",
449
+ "Cast_Int",
450
+ "Proj_Int",
451
+ ],
452
+ [
453
+ axiom(
454
+ "SeqSetIntro",
455
+ [],
456
+ `(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)))))`,
457
+ ),
458
+ axiom(
459
+ "SeqSetElim1",
460
+ [],
461
+ `(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)))))`,
462
+ "SetSetElim1",
463
+ ),
464
+ axiom(
465
+ "SeqSetElim2",
466
+ [],
467
+ `(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)))))`,
468
+ "SetSetElim2",
469
+ ),
470
+ ],
471
+ );
472
+ case "Len":
473
+ return fixed(
474
+ 1,
475
+ ["FunDom", "IntRange", "Cast_Int"],
476
+ [
477
+ axiom(
478
+ "SeqLenDef",
479
+ [],
480
+ `(forall ((s Idv) (z Int)) (=> (and (>= z 0) (= (${FUN_DOM} s) (${INT_RANGE} (${CAST_INT} 1) (${CAST_INT} z)))) (= (${LEN} s) (${CAST_INT} z))))`,
481
+ ),
482
+ ],
483
+ );
484
+ case "BSeq":
485
+ return fixed(1, [], []);
486
+ case "Cat":
487
+ return fixed(2, SEQUENCE_DEPS, [
488
+ axiom(
489
+ "SeqCatTyping",
490
+ [],
491
+ `(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))))`,
492
+ ),
493
+ axiom(
494
+ "SeqCatLen",
495
+ [],
496
+ `(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))))`,
497
+ ),
498
+ axiom(
499
+ "SeqCatApp1",
500
+ [],
501
+ `(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)))))`,
502
+ ),
503
+ axiom(
504
+ "SeqCatApp2",
505
+ [],
506
+ `(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)))))`,
507
+ ),
508
+ ]);
509
+ case "Append":
510
+ return fixed(2, SEQUENCE_DEPS, [
511
+ axiom(
512
+ "SeqAppendTyping",
513
+ [],
514
+ `(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))))`,
515
+ ),
516
+ axiom(
517
+ "SeqAppendLen",
518
+ [],
519
+ `(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))))`,
520
+ ),
521
+ axiom(
522
+ "SeqAppendApp1",
523
+ [],
524
+ `(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)))))`,
525
+ ),
526
+ axiom(
527
+ "SeqAppendApp2",
528
+ [],
529
+ `(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))))`,
530
+ ),
531
+ ]);
532
+ case "Head":
533
+ return fixed(
534
+ 1,
535
+ ["FunApp", "Cast_Int"],
536
+ [
537
+ axiom(
538
+ "SeqHeadDef",
539
+ [],
540
+ `(forall ((s Idv)) (! (= (${HEAD} s) (${FUN_APP} s (${CAST_INT} 1))) :pattern ((${HEAD} s))))`,
541
+ ),
542
+ ],
543
+ );
544
+ case "Tail":
545
+ return fixed(1, SEQUENCE_DEPS, [
546
+ axiom(
547
+ "SeqTailTyping",
548
+ [],
549
+ `(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))))`,
550
+ ),
551
+ axiom(
552
+ "SeqTailLen",
553
+ [],
554
+ `(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))))`,
555
+ ),
556
+ axiom(
557
+ "SeqTailApp",
558
+ [],
559
+ `(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)))))`,
560
+ ),
561
+ ]);
562
+ case "SubSeq": {
563
+ const range = `(${SUB_SEQ} s (${CAST_INT} x) (${CAST_INT} y))`;
564
+ return fixed(
565
+ 3,
566
+ ["Mem", "Seq", "Len", "FunApp", "IntSet", "Cast_Int", "Proj_Int"],
567
+ [
568
+ axiom(
569
+ "SeqSubseqTyping",
570
+ [],
571
+ `(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})))`,
572
+ ),
573
+ axiom(
574
+ "SeqSubseqLen",
575
+ [],
576
+ `(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})))`,
577
+ ),
578
+ axiom(
579
+ "SeqSubseqApp",
580
+ [],
581
+ `(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)))))`,
582
+ ),
583
+ ],
584
+ );
585
+ }
586
+ case "Cast_Int":
587
+ return spec(
588
+ declare(symbol, 1, "Idv", "Int"),
589
+ ["Mem", "IntSet", "Proj_Int"],
590
+ [
591
+ axiom(
592
+ "CastInjAlt",
593
+ ["Int"],
594
+ `(forall ((x Int)) (! (= x (${PROJ_INT} (${CAST_INT} x))) :pattern ((${CAST_INT} x))))`,
595
+ ),
596
+ axiom(
597
+ "TypeGuardIntro",
598
+ ["Int"],
599
+ `(forall ((z Int)) (! (${MEM} (${CAST_INT} z) ${INT_SET}) :pattern ((${CAST_INT} z))))`,
600
+ ),
601
+ axiom(
602
+ "TypeGuardElim",
603
+ ["Int"],
604
+ `(forall ((x Idv)) (! (=> (${MEM} x ${INT_SET}) (= x (${CAST_INT} (${PROJ_INT} x)))) :pattern ((${MEM} x ${INT_SET}))))`,
605
+ ),
606
+ ],
607
+ );
608
+ case "Cast_Bool":
609
+ return spec(
610
+ declare(symbol, 1, "Idv", "Bool"),
611
+ ["Mem", "BoolSet", "Tt_Idv"],
612
+ [
613
+ axiom(
614
+ "CastInjAlt",
615
+ ["Bool"],
616
+ `(and (= (${CAST_BOOL} true) ${TT_IDV}) (distinct (${CAST_BOOL} false) ${TT_IDV}))`,
617
+ ),
618
+ axiom(
619
+ "TypeGuardIntro",
620
+ ["Bool"],
621
+ `(forall ((z Bool)) (! (${MEM} (${CAST_BOOL} z) ${BOOL_SET}) :pattern ((${CAST_BOOL} z))))`,
622
+ ),
623
+ axiom(
624
+ "TypeGuardElim",
625
+ ["Bool"],
626
+ `(forall ((x Idv)) (! (=> (${MEM} x ${BOOL_SET}) (or (= x (${CAST_BOOL} true)) (= x (${CAST_BOOL} false)))) :pattern ((${MEM} x ${BOOL_SET}))))`,
627
+ ),
628
+ ],
629
+ );
630
+ case "Proj_Int":
631
+ return spec(declare(symbol, 1, "Int"), [], []);
632
+ case "TrigEq_Set$Idv$":
633
+ return fixed(
634
+ 2,
635
+ ["SetExtTrigger"],
636
+ [
637
+ axiom(
638
+ "ExtTrigEqDef",
639
+ ["Set$Idv$"],
640
+ `(forall ((x Idv) (y Idv)) (! (= (${TRIG_EQ} x y) (= x y)) :pattern ((${TRIG_EQ} x y))))`,
641
+ ),
642
+ axiom(
643
+ "ExtTrigEqTrigger",
644
+ ["Idv"],
645
+ `(forall ((x Idv) (y Idv)) (! (${SET_EXT_TRIGGER} x y) :pattern ((${TRIG_EQ} x y))))`,
646
+ ),
647
+ ],
648
+ "Bool",
649
+ );
650
+ case "SetExtTrigger":
651
+ case "IsSetOf":
652
+ return fixed(name === "IsSetOf" ? 1 : 2, [], [], "Bool");
653
+ case "BoolSet":
654
+ case "StrSet":
655
+ case "IntSet":
656
+ case "Tt_Idv":
657
+ return fixed(0, [], []);
658
+ case "TIntLteq":
659
+ return spec(undefined, ["IntLteq"], [TYPINGS.IntLteq()]);
660
+ default:
661
+ // The rest are numerals, which SMT-LIB has natively.
662
+ if (name.startsWith("TIntLit_")) return spec(undefined, [], []);
663
+ throw new TlaUnsupportedError(`the symbol ${name}`);
664
+ }
665
+ };