tla-ts 0.0.9 → 0.0.10-dev.094b9b512

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 (622) hide show
  1. package/README.md +30 -1
  2. package/dist/compile.cjs +23 -0
  3. package/dist/compile.js +23 -0
  4. package/dist/deciders.cjs +40 -37
  5. package/dist/deciders.js +47 -44
  6. package/dist/index.cjs +1 -1
  7. package/dist/index.d.cts +106 -10
  8. package/dist/index.d.ts +106 -10
  9. package/dist/index.js +1 -1
  10. package/dist/parallel-worker.cjs +1 -1
  11. package/dist/parallel-worker.js +1 -1
  12. package/dist/prove-worker.cjs +1 -1
  13. package/dist/prove-worker.js +1 -1
  14. package/dist/prove.cjs +2658 -410
  15. package/dist/prove.js +2657 -409
  16. package/dist/run.cjs +144 -31
  17. package/dist/run.js +144 -31
  18. package/dist/tlapm.cjs +2 -2
  19. package/dist/tlapm.js +2 -2
  20. package/dist/transfer.cjs +129 -104
  21. package/dist/transfer.js +129 -104
  22. package/dist/worker.cjs +6 -6
  23. package/dist/worker.js +6 -6
  24. package/package.json +3 -1
  25. package/src/ast.ts +48 -62
  26. package/src/bags.ts +99 -102
  27. package/src/builtins.ts +28 -75
  28. package/src/bundled-modules.ts +1 -8
  29. package/src/check-failure.ts +116 -0
  30. package/src/check-trace.ts +282 -0
  31. package/src/check.ts +599 -754
  32. package/src/cli/options.ts +12 -32
  33. package/src/cli/run.ts +0 -2
  34. package/src/cli/runtime-invariants.ts +136 -0
  35. package/src/cli/shared.ts +19 -12
  36. package/src/cli/tlapm.ts +208 -54
  37. package/src/cli/tlc-arguments.ts +652 -0
  38. package/src/cli/tlc-output.ts +687 -0
  39. package/src/cli/tlc-usage.ts +361 -0
  40. package/src/cli/tlc.ts +309 -658
  41. package/src/cli/typescript.ts +23 -0
  42. package/src/cli/xml-exporter.ts +27 -49
  43. package/src/cli.ts +0 -1
  44. package/src/codegen.ts +196 -74
  45. package/src/config.ts +140 -109
  46. package/src/coverage.ts +830 -0
  47. package/src/dependencies.ts +14 -53
  48. package/src/dfid.ts +618 -0
  49. package/src/environment-config.ts +315 -0
  50. package/src/environment.ts +169 -335
  51. package/src/errors.ts +100 -57
  52. package/src/evaluate.ts +598 -340
  53. package/src/exit-codes.ts +37 -3
  54. package/src/fingerprints.ts +75 -11
  55. package/src/index.ts +3 -0
  56. package/src/instances.ts +126 -21
  57. package/src/java-hash.ts +7 -0
  58. package/src/java-overrides.ts +4 -19
  59. package/src/json-reader.ts +455 -0
  60. package/src/json.ts +252 -139
  61. package/src/levels.ts +46 -58
  62. package/src/lexer.ts +83 -101
  63. package/src/liveness-checker.ts +103 -153
  64. package/src/liveness.ts +150 -109
  65. package/src/obligations/action.ts +18 -43
  66. package/src/obligations/anonymize.ts +119 -90
  67. package/src/obligations/enabled-axioms.ts +218 -0
  68. package/src/obligations/equality.ts +2 -2
  69. package/src/obligations/expression.ts +38 -25
  70. package/src/obligations/format.ts +1 -9
  71. package/src/obligations/generate.ts +67 -63
  72. package/src/obligations/index.ts +38 -20
  73. package/src/obligations/levels.ts +28 -17
  74. package/src/obligations/module.ts +29 -54
  75. package/src/obligations/normalize.ts +31 -36
  76. package/src/obligations/operators.ts +1 -2
  77. package/src/obligations/pragma.ts +53 -25
  78. package/src/obligations/printer.ts +90 -57
  79. package/src/obligations/proof.ts +4 -5
  80. package/src/obligations/regroup.ts +1 -4
  81. package/src/obligations/simplify.ts +58 -62
  82. package/src/obligations/source.ts +119 -95
  83. package/src/obligations/subexpression.ts +51 -27
  84. package/src/obligations/substitution.ts +2 -4
  85. package/src/obligations/temporal.ts +13 -19
  86. package/src/obligations/tuples.ts +3 -9
  87. package/src/parallel-worker.ts +30 -60
  88. package/src/parallel.ts +57 -71
  89. package/src/parser.ts +961 -387
  90. package/src/pcal/ast.ts +53 -86
  91. package/src/pcal/parse.ts +144 -219
  92. package/src/pcal/tokenize.ts +91 -131
  93. package/src/pcal/translate.ts +83 -130
  94. package/src/pcal/validate.ts +48 -68
  95. package/src/pretty-print.ts +7 -8
  96. package/src/prover/decide-pool.ts +8 -13
  97. package/src/prover/deciders.ts +19 -13
  98. package/src/prover/first-order.ts +0 -11
  99. package/src/prover/isabelle/decide.ts +3 -31
  100. package/src/prover/isabelle/encode.ts +82 -62
  101. package/src/prover/isabelle/isar/attrib.ts +219 -0
  102. package/src/prover/isabelle/isar/context.ts +336 -0
  103. package/src/prover/isabelle/isar/induct.ts +392 -0
  104. package/src/prover/isabelle/isar/inner-syntax.ts +262 -117
  105. package/src/prover/isabelle/isar/method.ts +513 -225
  106. package/src/prover/isabelle/isar/proof.ts +569 -23
  107. package/src/prover/isabelle/isar/rule-cases.ts +234 -0
  108. package/src/prover/isabelle/isar/theory.ts +490 -89
  109. package/src/prover/isabelle/isar/toplevel.ts +341 -0
  110. package/src/prover/isabelle/isar/type-check.ts +100 -37
  111. package/src/prover/isabelle/provers/blast/blast.ts +17 -104
  112. package/src/prover/isabelle/provers/blast/branch.ts +1 -32
  113. package/src/prover/isabelle/provers/blast/prove.ts +1 -35
  114. package/src/prover/isabelle/provers/blast/rules.ts +6 -44
  115. package/src/prover/isabelle/provers/blast/state.ts +2 -28
  116. package/src/prover/isabelle/provers/blast/term.ts +9 -36
  117. package/src/prover/isabelle/provers/clasimp.ts +1 -13
  118. package/src/prover/isabelle/provers/classical.ts +59 -60
  119. package/src/prover/isabelle/provers/hypsubst.ts +28 -51
  120. package/src/prover/isabelle/pure/bicompose.ts +25 -38
  121. package/src/prover/isabelle/pure/consts.ts +1 -7
  122. package/src/prover/isabelle/pure/conv.ts +3 -17
  123. package/src/prover/isabelle/pure/drule.ts +96 -44
  124. package/src/prover/isabelle/pure/envir.ts +3 -52
  125. package/src/prover/isabelle/pure/goal.ts +2 -8
  126. package/src/prover/isabelle/pure/interrupt.ts +0 -5
  127. package/src/prover/isabelle/pure/list.ts +0 -3
  128. package/src/prover/isabelle/pure/logic.ts +2 -15
  129. package/src/prover/isabelle/pure/name.ts +2 -9
  130. package/src/prover/isabelle/pure/net.ts +3 -59
  131. package/src/prover/isabelle/pure/object-logic.ts +16 -15
  132. package/src/prover/isabelle/pure/pattern.ts +2 -19
  133. package/src/prover/isabelle/pure/raw-simplifier.ts +17 -62
  134. package/src/prover/isabelle/pure/rewriter.ts +32 -73
  135. package/src/prover/isabelle/pure/search.ts +3 -10
  136. package/src/prover/isabelle/pure/seq.ts +1 -10
  137. package/src/prover/isabelle/pure/simplifier.ts +28 -15
  138. package/src/prover/isabelle/pure/table.ts +3 -32
  139. package/src/prover/isabelle/pure/tactic.ts +12 -22
  140. package/src/prover/isabelle/pure/tactical.ts +48 -47
  141. package/src/prover/isabelle/pure/term-ord.ts +2 -6
  142. package/src/prover/isabelle/pure/term.ts +2 -43
  143. package/src/prover/isabelle/pure/thm.ts +27 -47
  144. package/src/prover/isabelle/pure/type.ts +2 -15
  145. package/src/prover/isabelle/pure/unify.ts +20 -30
  146. package/src/prover/isabelle/pure/variable.ts +3 -7
  147. package/src/prover/isabelle/tla/classical-setup.ts +18 -24
  148. package/src/prover/isabelle/tla/context.ts +65 -26
  149. package/src/prover/isabelle/tla/logic-data.ts +1 -1
  150. package/src/prover/isabelle/tla/logic.ts +53 -32
  151. package/src/prover/isabelle/tla/simpdata.ts +46 -43
  152. package/src/prover/isabelle/tools/intuitionistic.ts +29 -20
  153. package/src/prover/ocaml.ts +0 -6
  154. package/src/prover/prep/action.ts +32 -66
  155. package/src/prover/prep/enabled-axioms.ts +22 -20
  156. package/src/prover/prep/fingerprint.ts +2 -21
  157. package/src/prover/prep/level-comparison.ts +8 -12
  158. package/src/prover/prep/md5.ts +0 -2
  159. package/src/prover/prep/methods.ts +137 -83
  160. package/src/prover/prep/normalize.ts +38 -36
  161. package/src/prover/prove-worker.ts +0 -2
  162. package/src/prover/prove.ts +371 -132
  163. package/src/prover/ptl/decide.ts +104 -44
  164. package/src/prover/ptl/encode.ts +15 -38
  165. package/src/prover/ptl/sat.ts +24 -32
  166. package/src/prover/ptl/tableau.ts +40 -28
  167. package/src/prover/smt/arithmetic.ts +310 -0
  168. package/src/prover/smt/axioms.ts +12 -15
  169. package/src/prover/smt/context.ts +61 -29
  170. package/src/prover/smt/data.ts +497 -387
  171. package/src/prover/smt/encode.ts +156 -85
  172. package/src/prover/smt/extensionality.ts +5 -13
  173. package/src/prover/smt/flatten.ts +7 -28
  174. package/src/prover/smt/format.ts +33 -14
  175. package/src/prover/smt/instances.ts +7 -11
  176. package/src/prover/smt/layout.ts +91 -0
  177. package/src/prover/smt/rewrite.ts +1025 -658
  178. package/src/prover/smt/simplify.ts +441 -0
  179. package/src/prover/smt/solver/ackermannize-bv-tactic.ts +63 -0
  180. package/src/prover/smt/solver/ackr-helper.ts +182 -0
  181. package/src/prover/smt/solver/ackr-model-converter.ts +112 -0
  182. package/src/prover/smt/solver/act-cache.ts +0 -15
  183. package/src/prover/smt/solver/add-bounds-tactic.ts +60 -0
  184. package/src/prover/smt/solver/aig-tactic.ts +43 -0
  185. package/src/prover/smt/solver/aig.ts +890 -0
  186. package/src/prover/smt/solver/arith-rewriter.ts +613 -48
  187. package/src/prover/smt/solver/arith-terms.ts +123 -0
  188. package/src/prover/smt/solver/array-decl-plugin.ts +176 -0
  189. package/src/prover/smt/solver/array-rewriter.ts +312 -0
  190. package/src/prover/smt/solver/array.ts +1 -3
  191. package/src/prover/smt/solver/asserted-formulas.ts +87 -57
  192. package/src/prover/smt/solver/ast-lt.ts +166 -21
  193. package/src/prover/smt/solver/ast-util.ts +161 -7
  194. package/src/prover/smt/solver/ast.ts +1466 -178
  195. package/src/prover/smt/solver/auf-solver.ts +8 -44
  196. package/src/prover/smt/solver/bit-blast-tactic.ts +591 -0
  197. package/src/prover/smt/solver/bit-blaster.ts +874 -0
  198. package/src/prover/smt/solver/bound-manager.ts +186 -0
  199. package/src/prover/smt/solver/bound-simplifier.ts +602 -0
  200. package/src/prover/smt/solver/bv-bound-chk.ts +500 -0
  201. package/src/prover/smt/solver/bv-decl-plugin.ts +339 -0
  202. package/src/prover/smt/solver/bv-divrem-bounds.ts +97 -0
  203. package/src/prover/smt/solver/bv-rewriter.ts +1905 -0
  204. package/src/prover/smt/solver/bv1-blast.ts +224 -0
  205. package/src/prover/smt/solver/bv2fpa-converter.ts +175 -0
  206. package/src/prover/smt/solver/bv2int-rewriter.ts +545 -0
  207. package/src/prover/smt/solver/bv2real-rewriter.ts +534 -0
  208. package/src/prover/smt/solver/card2bv.ts +112 -0
  209. package/src/prover/smt/solver/case-split-queue.ts +1 -9
  210. package/src/prover/smt/solver/cg-table.ts +28 -34
  211. package/src/prover/smt/solver/check-logic.ts +326 -0
  212. package/src/prover/smt/solver/clause.ts +1 -27
  213. package/src/prover/smt/solver/cofactor-elim-term-ite.ts +280 -0
  214. package/src/prover/smt/solver/conflict-resolution.ts +79 -12
  215. package/src/prover/smt/solver/context.ts +510 -175
  216. package/src/prover/smt/solver/ctx-simplify.ts +34 -50
  217. package/src/prover/smt/solver/ctx-solver-simplify.ts +124 -0
  218. package/src/prover/smt/solver/datatype-decl-plugin.ts +575 -0
  219. package/src/prover/smt/solver/datatype-rewriter.ts +83 -0
  220. package/src/prover/smt/solver/demodulator.ts +789 -0
  221. package/src/prover/smt/solver/dependent-expr-state.ts +68 -0
  222. package/src/prover/smt/solver/der.ts +40 -30
  223. package/src/prover/smt/solver/diff-neq.ts +207 -0
  224. package/src/prover/smt/solver/distribute-forall.ts +67 -0
  225. package/src/prover/smt/solver/dom-simplify.ts +513 -0
  226. package/src/prover/smt/solver/dt2bv-tactic.ts +267 -0
  227. package/src/prover/smt/solver/dyn-ack.ts +1 -11
  228. package/src/prover/smt/solver/e-matching.ts +4 -35
  229. package/src/prover/smt/solver/elim-small-bv-tactic.ts +130 -0
  230. package/src/prover/smt/solver/elim-uncnstr.ts +558 -0
  231. package/src/prover/smt/solver/enode.ts +93 -22
  232. package/src/prover/smt/solver/eq2bv-tactic.ts +219 -0
  233. package/src/prover/smt/solver/euf/arith-axioms.ts +404 -0
  234. package/src/prover/smt/solver/euf/arith-internalize.ts +659 -0
  235. package/src/prover/smt/solver/euf/arith-solver.ts +895 -0
  236. package/src/prover/smt/solver/euf/array-axioms.ts +528 -0
  237. package/src/prover/smt/solver/euf/array-internalize.ts +419 -0
  238. package/src/prover/smt/solver/euf/array-solver.ts +308 -0
  239. package/src/prover/smt/solver/euf/bv-ackerman.ts +164 -0
  240. package/src/prover/smt/solver/euf/bv-internalize.ts +750 -0
  241. package/src/prover/smt/solver/euf/bv-solver.ts +451 -0
  242. package/src/prover/smt/solver/euf/dt-solver.ts +620 -0
  243. package/src/prover/smt/solver/euf/egraph.ts +885 -0
  244. package/src/prover/smt/solver/euf/euf-solver.ts +1203 -0
  245. package/src/prover/smt/solver/euf/fpa-solver.ts +333 -0
  246. package/src/prover/smt/solver/euf/mam.ts +1094 -0
  247. package/src/prover/smt/solver/euf/q-ematch.ts +900 -0
  248. package/src/prover/smt/solver/euf/q-mbi.ts +587 -0
  249. package/src/prover/smt/solver/euf/q-model-fixer.ts +299 -0
  250. package/src/prover/smt/solver/euf/q-solver.ts +361 -0
  251. package/src/prover/smt/solver/euf/th-solver.ts +343 -0
  252. package/src/prover/smt/solver/euf/th-solvers.ts +31 -0
  253. package/src/prover/smt/solver/expr-ref.ts +1 -5
  254. package/src/prover/smt/solver/expr-safe-replace.ts +26 -6
  255. package/src/prover/smt/solver/expr2polynomial.ts +147 -0
  256. package/src/prover/smt/solver/factor.ts +152 -0
  257. package/src/prover/smt/solver/fd-solver.ts +269 -0
  258. package/src/prover/smt/solver/fingerprints.ts +16 -26
  259. package/src/prover/smt/solver/fix-dl-var.ts +149 -0
  260. package/src/prover/smt/solver/flat-literals.ts +1 -9
  261. package/src/prover/smt/solver/fm-tactic.ts +873 -0
  262. package/src/prover/smt/solver/fpa-decl-plugin.ts +619 -0
  263. package/src/prover/smt/solver/fpa-rewriter.ts +641 -0
  264. package/src/prover/smt/solver/fpa2bv-converter.ts +2246 -0
  265. package/src/prover/smt/solver/fpa2bv-rewriter.ts +349 -0
  266. package/src/prover/smt/solver/fpa2bv-tactic.ts +75 -0
  267. package/src/prover/smt/solver/goal.ts +177 -28
  268. package/src/prover/smt/solver/goal2nlsat.ts +191 -0
  269. package/src/prover/smt/solver/guard-set.ts +220 -0
  270. package/src/prover/smt/solver/hash.ts +0 -8
  271. package/src/prover/smt/solver/hashtable.ts +27 -23
  272. package/src/prover/smt/solver/inf-eps.ts +64 -0
  273. package/src/prover/smt/solver/inj-axiom.ts +102 -0
  274. package/src/prover/smt/solver/internalizer.ts +72 -130
  275. package/src/prover/smt/solver/lackr.ts +383 -0
  276. package/src/prover/smt/solver/lbool.ts +1 -2
  277. package/src/prover/smt/solver/lia2card.ts +269 -0
  278. package/src/prover/smt/solver/lia2pb.ts +141 -0
  279. package/src/prover/smt/solver/literal.ts +0 -3
  280. package/src/prover/smt/solver/logic-tactics.ts +349 -0
  281. package/src/prover/smt/solver/lp/bound-propagator.ts +8 -26
  282. package/src/prover/smt/solver/lp/constraints.ts +2 -8
  283. package/src/prover/smt/solver/lp/containers.ts +12 -30
  284. package/src/prover/smt/solver/lp/core-solver.ts +24 -27
  285. package/src/prover/smt/solver/lp/cross-nested.ts +6 -20
  286. package/src/prover/smt/solver/lp/dep-intervals.ts +7 -22
  287. package/src/prover/smt/solver/lp/dependency.ts +1 -4
  288. package/src/prover/smt/solver/lp/dioph-eq.ts +9 -102
  289. package/src/prover/smt/solver/lp/explanation.ts +1 -6
  290. package/src/prover/smt/solver/lp/gomory.ts +9 -22
  291. package/src/prover/smt/solver/lp/hnf-cutter.ts +17 -23
  292. package/src/prover/smt/solver/lp/hnf.ts +11 -26
  293. package/src/prover/smt/solver/lp/int-cube.ts +18 -39
  294. package/src/prover/smt/solver/lp/int-solver.ts +4 -34
  295. package/src/prover/smt/solver/lp/lar-solver.ts +70 -82
  296. package/src/prover/smt/solver/lp/lar-term.ts +1 -5
  297. package/src/prover/smt/solver/lp/lp-settings.ts +1 -14
  298. package/src/prover/smt/solver/lp/maximize-term.ts +79 -52
  299. package/src/prover/smt/solver/lp/nex-creator.ts +5 -28
  300. package/src/prover/smt/solver/lp/nex.ts +1 -6
  301. package/src/prover/smt/solver/lp/nla-backoff.ts +1 -4
  302. package/src/prover/smt/solver/lp/nla-basics.ts +5 -30
  303. package/src/prover/smt/solver/lp/nla-core.ts +69 -132
  304. package/src/prover/smt/solver/lp/nla-divisions.ts +32 -42
  305. package/src/prover/smt/solver/lp/nla-emonics.ts +4 -21
  306. package/src/prover/smt/solver/lp/nla-factorization.ts +1 -4
  307. package/src/prover/smt/solver/lp/nla-grobner.ts +24 -72
  308. package/src/prover/smt/solver/lp/nla-horner.ts +3 -11
  309. package/src/prover/smt/solver/lp/nla-intervals.ts +2 -12
  310. package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +16 -41
  311. package/src/prover/smt/solver/lp/nla-monotone.ts +2 -6
  312. package/src/prover/smt/solver/lp/nla-order.ts +2 -13
  313. package/src/prover/smt/solver/lp/nla-patcher.ts +4 -7
  314. package/src/prover/smt/solver/lp/nla-powers.ts +184 -0
  315. package/src/prover/smt/solver/lp/nla-tangents.ts +1 -9
  316. package/src/prover/smt/solver/lp/nla-throttle.ts +1 -6
  317. package/src/prover/smt/solver/lp/nla-transcendentals.ts +293 -0
  318. package/src/prover/smt/solver/lp/nla-types.ts +1 -11
  319. package/src/prover/smt/solver/lp/nla-var-eqs.ts +4 -25
  320. package/src/prover/smt/solver/lp/nra-solver.ts +30 -54
  321. package/src/prover/smt/solver/lp/numeric-pair.ts +1 -4
  322. package/src/prover/smt/solver/lp/pdd-interval.ts +1 -3
  323. package/src/prover/smt/solver/lp/pdd-simplifier.ts +2 -14
  324. package/src/prover/smt/solver/lp/pdd-solver.ts +4 -33
  325. package/src/prover/smt/solver/lp/pdd.ts +7 -70
  326. package/src/prover/smt/solver/lp/random-updater.ts +1 -8
  327. package/src/prover/smt/solver/lp/static-matrix.ts +9 -19
  328. package/src/prover/smt/solver/lp/union-find.ts +6 -5
  329. package/src/prover/smt/solver/macro-finder.ts +533 -0
  330. package/src/prover/smt/solver/mam-compiler.ts +117 -126
  331. package/src/prover/smt/solver/mam-interpreter.ts +1 -21
  332. package/src/prover/smt/solver/max-bv-sharing-tactic.ts +29 -0
  333. package/src/prover/smt/solver/max-cliques.ts +107 -0
  334. package/src/prover/smt/solver/maxcore.ts +318 -0
  335. package/src/prover/smt/solver/maximize-ac-sharing.ts +9 -20
  336. package/src/prover/smt/solver/maxlex.ts +123 -0
  337. package/src/prover/smt/solver/maxsmt-base.ts +99 -0
  338. package/src/prover/smt/solver/maxsmt.ts +93 -0
  339. package/src/prover/smt/solver/mbp/mbp-arith.ts +477 -0
  340. package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +102 -0
  341. package/src/prover/smt/solver/mbp/mbp-plugin.ts +280 -0
  342. package/src/prover/smt/solver/mbp/mbp-qel.ts +49 -0
  343. package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +280 -0
  344. package/src/prover/smt/solver/mbp/mbp-term-graph.ts +624 -0
  345. package/src/prover/smt/solver/model-based-opt.ts +845 -0
  346. package/src/prover/smt/solver/model-checker.ts +20 -62
  347. package/src/prover/smt/solver/model-evaluator.ts +186 -39
  348. package/src/prover/smt/solver/model-finder.ts +15 -32
  349. package/src/prover/smt/solver/model-generator.ts +57 -40
  350. package/src/prover/smt/solver/model-macro-solver.ts +58 -111
  351. package/src/prover/smt/solver/model-printer.ts +215 -0
  352. package/src/prover/smt/solver/mpf.ts +712 -0
  353. package/src/prover/smt/solver/mus.ts +52 -0
  354. package/src/prover/smt/solver/muz/dl-context.ts +362 -0
  355. package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +98 -0
  356. package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +121 -0
  357. package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +121 -0
  358. package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +305 -0
  359. package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +427 -0
  360. package/src/prover/smt/solver/muz/dl-mk-slice.ts +278 -0
  361. package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +158 -0
  362. package/src/prover/smt/solver/muz/dl-rule-set.ts +303 -0
  363. package/src/prover/smt/solver/muz/dl-rule-transformer.ts +127 -0
  364. package/src/prover/smt/solver/muz/dl-rule.ts +460 -0
  365. package/src/prover/smt/solver/muz/hnf.ts +201 -0
  366. package/src/prover/smt/solver/muz/horn-tactic.ts +192 -0
  367. package/src/prover/smt/solver/muz/rule-properties.ts +179 -0
  368. package/src/prover/smt/solver/muz/spacer-context.ts +1395 -0
  369. package/src/prover/smt/solver/muz/spacer-dl-interface.ts +41 -0
  370. package/src/prover/smt/solver/muz/spacer-generalizers.ts +244 -0
  371. package/src/prover/smt/solver/muz/spacer-manager.ts +133 -0
  372. package/src/prover/smt/solver/muz/spacer-pdr.ts +219 -0
  373. package/src/prover/smt/solver/muz/spacer-prop-solver.ts +344 -0
  374. package/src/prover/smt/solver/muz/spacer-util.ts +309 -0
  375. package/src/prover/smt/solver/muz/substitution.ts +154 -0
  376. package/src/prover/smt/solver/nla2bv-tactic.ts +286 -0
  377. package/src/prover/smt/solver/nlqsat.ts +484 -0
  378. package/src/prover/smt/solver/nlsat/algebraic.ts +179 -159
  379. package/src/prover/smt/solver/nlsat/atoms.ts +25 -23
  380. package/src/prover/smt/solver/nlsat/evaluator.ts +17 -22
  381. package/src/prover/smt/solver/nlsat/explain.ts +61 -69
  382. package/src/prover/smt/solver/nlsat/interval-set.ts +10 -51
  383. package/src/prover/smt/solver/nlsat/levelwise.ts +49 -135
  384. package/src/prover/smt/solver/nlsat/mpbq.ts +48 -14
  385. package/src/prover/smt/solver/nlsat/polynomial.ts +30 -160
  386. package/src/prover/smt/solver/nlsat/solver.ts +227 -99
  387. package/src/prover/smt/solver/nlsat/transcendental-eval.ts +311 -0
  388. package/src/prover/smt/solver/nlsat/transcendentals.ts +369 -0
  389. package/src/prover/smt/solver/nlsat/types.ts +1 -8
  390. package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +2 -45
  391. package/src/prover/smt/solver/nlsat/upolynomial.ts +11 -92
  392. package/src/prover/smt/solver/nlsat-tactic.ts +83 -0
  393. package/src/prover/smt/solver/nnf.ts +108 -60
  394. package/src/prover/smt/solver/normalize-bounds.ts +54 -0
  395. package/src/prover/smt/solver/occf.ts +98 -0
  396. package/src/prover/smt/solver/opt-context.ts +787 -0
  397. package/src/prover/smt/solver/opt-nlsat.ts +366 -0
  398. package/src/prover/smt/solver/opt-pareto.ts +284 -0
  399. package/src/prover/smt/solver/opt-preprocess.ts +102 -0
  400. package/src/prover/smt/solver/opt-solver.ts +300 -0
  401. package/src/prover/smt/solver/opt-value.ts +56 -0
  402. package/src/prover/smt/solver/optsmt.ts +691 -0
  403. package/src/prover/smt/solver/parallel-tactic.ts +301 -0
  404. package/src/prover/smt/solver/pattern-inference.ts +19 -23
  405. package/src/prover/smt/solver/pb-rewriter.ts +296 -0
  406. package/src/prover/smt/solver/pb2bv-tactic.ts +542 -0
  407. package/src/prover/smt/solver/poly-rewriter.ts +203 -77
  408. package/src/prover/smt/solver/probes.ts +514 -0
  409. package/src/prover/smt/solver/propagate-values.ts +34 -30
  410. package/src/prover/smt/solver/proto-model.ts +648 -63
  411. package/src/prover/smt/solver/pull-quant.ts +29 -23
  412. package/src/prover/smt/solver/purify-arith.ts +598 -0
  413. package/src/prover/smt/solver/qe-arith-plugin.ts +1099 -0
  414. package/src/prover/smt/solver/qe-lite-der.ts +3 -31
  415. package/src/prover/smt/solver/qe-lite-fm.ts +5 -28
  416. package/src/prover/smt/solver/qe-lite.ts +40 -49
  417. package/src/prover/smt/solver/qe-mbp.ts +281 -0
  418. package/src/prover/smt/solver/qe.ts +1508 -0
  419. package/src/prover/smt/solver/qel.ts +26 -0
  420. package/src/prover/smt/solver/qi-queue.ts +1 -16
  421. package/src/prover/smt/solver/qsat.ts +840 -0
  422. package/src/prover/smt/solver/quant-hoist.ts +195 -0
  423. package/src/prover/smt/solver/quant-tactics.ts +18 -74
  424. package/src/prover/smt/solver/quantifier-analyzer.ts +27 -47
  425. package/src/prover/smt/solver/quantifier-manager.ts +9 -23
  426. package/src/prover/smt/solver/quasi-macros.ts +254 -0
  427. package/src/prover/smt/solver/random-gen.ts +1 -2
  428. package/src/prover/smt/solver/rational.ts +29 -8
  429. package/src/prover/smt/solver/recfun-decl-plugin.ts +248 -0
  430. package/src/prover/smt/solver/recfun-rewriter.ts +108 -0
  431. package/src/prover/smt/solver/reduce-args.ts +226 -0
  432. package/src/prover/smt/solver/reduce-bv-size.ts +120 -0
  433. package/src/prover/smt/solver/ref-vector.ts +1 -6
  434. package/src/prover/smt/solver/relevancy.ts +3 -16
  435. package/src/prover/smt/solver/rewriter-tpl.ts +49 -129
  436. package/src/prover/smt/solver/rewriter.ts +478 -120
  437. package/src/prover/smt/solver/rlimit.ts +27 -21
  438. package/src/prover/smt/solver/sat/asymm-branch.ts +314 -0
  439. package/src/prover/smt/solver/sat/big.ts +178 -0
  440. package/src/prover/smt/solver/sat/clause-use-list.ts +79 -0
  441. package/src/prover/smt/solver/sat/clause.ts +221 -0
  442. package/src/prover/smt/solver/sat/cleaner.ts +96 -0
  443. package/src/prover/smt/solver/sat/config.ts +125 -0
  444. package/src/prover/smt/solver/sat/consequences.ts +204 -0
  445. package/src/prover/smt/solver/sat/elim-eqs.ts +144 -0
  446. package/src/prover/smt/solver/sat/goal2sat.ts +528 -0
  447. package/src/prover/smt/solver/sat/inc-sat-solver.ts +388 -0
  448. package/src/prover/smt/solver/sat/model-converter.ts +156 -0
  449. package/src/prover/smt/solver/sat/pb-constraint.ts +264 -0
  450. package/src/prover/smt/solver/sat/pb-solver.ts +1553 -0
  451. package/src/prover/smt/solver/sat/probing.ts +169 -0
  452. package/src/prover/smt/solver/sat/sat-tactic.ts +44 -0
  453. package/src/prover/smt/solver/sat/sat2goal.ts +171 -0
  454. package/src/prover/smt/solver/sat/scc.ts +143 -0
  455. package/src/prover/smt/solver/sat/simplifier.ts +1662 -0
  456. package/src/prover/smt/solver/sat/solver.ts +2128 -0
  457. package/src/prover/smt/solver/sat/var-queue.ts +119 -0
  458. package/src/prover/smt/solver/sat/watch-list.ts +136 -0
  459. package/src/prover/smt/solver/search-tree.ts +285 -0
  460. package/src/prover/smt/solver/seq-axioms.ts +1013 -0
  461. package/src/prover/smt/solver/seq-decl-plugin.ts +823 -0
  462. package/src/prover/smt/solver/seq-derive.ts +1303 -0
  463. package/src/prover/smt/solver/seq-eq-approx.ts +238 -0
  464. package/src/prover/smt/solver/seq-eq-solver.ts +440 -0
  465. package/src/prover/smt/solver/seq-factory.ts +91 -0
  466. package/src/prover/smt/solver/seq-monadic.ts +730 -0
  467. package/src/prover/smt/solver/seq-range-predicate.ts +225 -0
  468. package/src/prover/smt/solver/seq-re-rewriter.ts +1296 -0
  469. package/src/prover/smt/solver/seq-re-util.ts +777 -0
  470. package/src/prover/smt/solver/seq-regex-bisim.ts +145 -0
  471. package/src/prover/smt/solver/seq-regex-live.ts +202 -0
  472. package/src/prover/smt/solver/seq-regex-witness.ts +100 -0
  473. package/src/prover/smt/solver/seq-rewriter.ts +2407 -0
  474. package/src/prover/smt/solver/seq-skolem.ts +318 -0
  475. package/src/prover/smt/solver/seq-subset.ts +166 -0
  476. package/src/prover/smt/solver/seq-view-witness.ts +355 -0
  477. package/src/prover/smt/solver/smt-consequences.ts +299 -0
  478. package/src/prover/smt/solver/smt-kernel.ts +85 -0
  479. package/src/prover/smt/solver/smt-logics.ts +67 -0
  480. package/src/prover/smt/solver/smt-setup.ts +492 -0
  481. package/src/prover/smt/solver/smt2-printer.ts +767 -0
  482. package/src/prover/smt/solver/smtlib-parser.ts +2423 -270
  483. package/src/prover/smt/solver/smtlib-script.ts +1493 -0
  484. package/src/prover/smt/solver/solve-eqs.ts +931 -0
  485. package/src/prover/smt/solver/solver.ts +120 -39
  486. package/src/prover/smt/solver/sort.ts +1 -5
  487. package/src/prover/smt/solver/static-features.ts +319 -0
  488. package/src/prover/smt/solver/sticky-generations.ts +0 -5
  489. package/src/prover/smt/solver/tactic.ts +1936 -0
  490. package/src/prover/smt/solver/term-enumeration.ts +206 -0
  491. package/src/prover/smt/solver/theory-array.ts +1275 -0
  492. package/src/prover/smt/solver/theory-bv.ts +1239 -0
  493. package/src/prover/smt/solver/theory-char.ts +356 -0
  494. package/src/prover/smt/solver/theory-datatype.ts +599 -0
  495. package/src/prover/smt/solver/theory-finite-set.ts +30 -0
  496. package/src/prover/smt/solver/theory-fpa.ts +422 -0
  497. package/src/prover/smt/solver/theory-lra-axioms.ts +56 -25
  498. package/src/prover/smt/solver/theory-lra-bounds.ts +31 -10
  499. package/src/prover/smt/solver/theory-lra-final-check.ts +60 -91
  500. package/src/prover/smt/solver/theory-lra-internalize.ts +87 -53
  501. package/src/prover/smt/solver/theory-lra-model.ts +24 -53
  502. package/src/prover/smt/solver/theory-lra-propagate.ts +25 -40
  503. package/src/prover/smt/solver/theory-lra-state.ts +7 -27
  504. package/src/prover/smt/solver/theory-lra.ts +194 -8
  505. package/src/prover/smt/solver/theory-pb.ts +932 -0
  506. package/src/prover/smt/solver/theory-polymorphism.ts +59 -0
  507. package/src/prover/smt/solver/theory-recfun.ts +308 -0
  508. package/src/prover/smt/solver/theory-seq-regex.ts +871 -0
  509. package/src/prover/smt/solver/theory-seq-solve.ts +1375 -0
  510. package/src/prover/smt/solver/theory-seq-state.ts +880 -0
  511. package/src/prover/smt/solver/theory-seq.ts +984 -0
  512. package/src/prover/smt/solver/theory.ts +175 -0
  513. package/src/prover/smt/solver/tseitin-cnf.ts +487 -0
  514. package/src/prover/smt/solver/var-subst.ts +33 -35
  515. package/src/prover/smt/table.ts +1 -9
  516. package/src/prover/smt/types.ts +146 -0
  517. package/src/prover/tlapm/cache.ts +67 -41
  518. package/src/prover/tlapm/ocaml-marshal.ts +19 -21
  519. package/src/prover/tlapm/tlapm.ts +21 -20
  520. package/src/prover/tlapm-library.ts +3208 -0
  521. package/src/prover/verdict.ts +9 -2
  522. package/src/prover/zenon/check/check.ts +1 -11
  523. package/src/prover/zenon/check/definitions.ts +5 -15
  524. package/src/prover/zenon/check/equality.ts +0 -8
  525. package/src/prover/zenon/check/functions.ts +0 -4
  526. package/src/prover/zenon/check/keys.ts +0 -7
  527. package/src/prover/zenon/check/propositional.ts +0 -3
  528. package/src/prover/zenon/check/records.ts +1 -6
  529. package/src/prover/zenon/check/relations.ts +2 -14
  530. package/src/prover/zenon/check/rewrites.ts +2 -21
  531. package/src/prover/zenon/check/sets.ts +40 -61
  532. package/src/prover/zenon/check/terms.ts +1 -19
  533. package/src/prover/zenon/check/tla.ts +0 -6
  534. package/src/prover/zenon/decide.ts +10 -15
  535. package/src/prover/zenon/encode.ts +1 -8
  536. package/src/prover/zenon/eqrel.ts +2 -13
  537. package/src/prover/zenon/equality-rules.ts +0 -4
  538. package/src/prover/zenon/expr.ts +8 -26
  539. package/src/prover/zenon/index-table.ts +26 -57
  540. package/src/prover/zenon/isar-case.ts +9 -19
  541. package/src/prover/zenon/isar.ts +36 -64
  542. package/src/prover/zenon/limits.ts +0 -4
  543. package/src/prover/zenon/llproof.ts +2 -20
  544. package/src/prover/zenon/mltoll.ts +66 -104
  545. package/src/prover/zenon/node.ts +20 -14
  546. package/src/prover/zenon/ocaml.ts +1 -17
  547. package/src/prover/zenon/parse.ts +10 -12
  548. package/src/prover/zenon/phrase.ts +1 -11
  549. package/src/prover/zenon/proof.ts +0 -9
  550. package/src/prover/zenon/propositional-rules.ts +0 -5
  551. package/src/prover/zenon/rules.ts +2 -6
  552. package/src/prover/zenon/search.ts +11 -33
  553. package/src/prover/zenon/tla/functions.ts +59 -31
  554. package/src/prover/zenon/tla/llproof.ts +67 -76
  555. package/src/prover/zenon/tla/records.ts +57 -33
  556. package/src/prover/zenon/tla/rewrites.ts +12 -19
  557. package/src/prover/zenon/tla/sets.ts +88 -57
  558. package/src/prover/zenon/tla/terms.ts +0 -6
  559. package/src/prover/zenon/tla/tla.ts +66 -64
  560. package/src/randomization.ts +81 -35
  561. package/src/resolve.ts +67 -184
  562. package/src/runtime.ts +22 -22
  563. package/src/sany/builtins.ts +2 -5
  564. package/src/sany/generation.ts +394 -0
  565. package/src/sany/generator-def-entries.ts +210 -0
  566. package/src/sany/generator-definitions.ts +686 -0
  567. package/src/sany/generator-expressions.ts +1100 -0
  568. package/src/sany/generator-proofs.ts +662 -0
  569. package/src/sany/generator.ts +191 -2764
  570. package/src/sany/levels.ts +6 -34
  571. package/src/sany/lexer.ts +58 -77
  572. package/src/sany/linter.ts +1 -9
  573. package/src/sany/modules.ts +1 -5
  574. package/src/sany/nodes.ts +5 -43
  575. package/src/sany/parse-error.ts +39 -117
  576. package/src/sany/report.ts +32 -69
  577. package/src/sany/selectors.ts +49 -76
  578. package/src/sany/source.ts +1 -17
  579. package/src/sany/xml.ts +35 -117
  580. package/src/search.ts +541 -163
  581. package/src/simulate.ts +709 -0
  582. package/src/spec-description.ts +192 -100
  583. package/src/standard-definitions.ts +0 -4
  584. package/src/standard-modules.ts +264 -95
  585. package/src/state-graph.ts +52 -31
  586. package/src/subexpressions.ts +69 -52
  587. package/src/substitution-levels.ts +7 -7
  588. package/src/successors.ts +266 -99
  589. package/src/symmetry.ts +33 -25
  590. package/src/tableau.ts +27 -24
  591. package/src/tlc/fingerprint.ts +183 -67
  592. package/src/tlc/jar-data.ts +112 -6
  593. package/src/tlc/messages.ts +125 -54
  594. package/src/tlc/order.ts +39 -69
  595. package/src/tlc/random.ts +37 -49
  596. package/src/tlc/replay.ts +553 -228
  597. package/src/tlc/summary.ts +36 -47
  598. package/src/tlc/tlc-operators.ts +78 -44
  599. package/src/tlc/tlcext-operators.ts +139 -122
  600. package/src/tlc/trace-spec.ts +249 -0
  601. package/src/tlc/value-stream.ts +139 -0
  602. package/src/tlc/version.ts +1 -4
  603. package/src/transfer.ts +22 -25
  604. package/src/typescript/actions.ts +479 -0
  605. package/src/typescript/collections.ts +614 -0
  606. package/src/typescript/compile.ts +63 -0
  607. package/src/typescript/context.ts +94 -0
  608. package/src/typescript/emit.ts +121 -0
  609. package/src/typescript/expressions.ts +496 -0
  610. package/src/typescript/formula.ts +154 -0
  611. package/src/typescript/functions.ts +284 -0
  612. package/src/typescript/model.ts +162 -0
  613. package/src/typescript/names.ts +114 -0
  614. package/src/typescript/program.ts +48 -0
  615. package/src/typescript/properties.ts +139 -0
  616. package/src/typescript/scope.ts +112 -0
  617. package/src/typescript/steps.ts +167 -0
  618. package/src/typescript/types.ts +171 -0
  619. package/src/values.ts +832 -484
  620. package/src/worker.ts +7 -8
  621. package/src/prover/isabelle/isar/statement.ts +0 -57
  622. package/src/prover/tlaps-module.ts +0 -510
@@ -1,7 +1,3 @@
1
- // Encodes a prepared proof obligation in SMT-LIB as tlapm's SMT backend does (encode/ and
2
- // backend/smtlib.ml): TLA+ values share one sort Idv, set membership is the predicate TLA__Mem,
3
- // and each symbol the obligation uses brings the symbols and axioms encode/n_data.ml lists for it.
4
-
5
1
  import {
6
2
  applyBuiltin,
7
3
  at,
@@ -12,10 +8,27 @@ import {
12
8
  } from "../../obligations/expression";
13
9
  import { compareStrings } from "../ocaml";
14
10
  import { createPrinter } from "./context";
11
+ import { simplifySets } from "./simplify";
12
+ import { layOutCommand } from "./layout";
15
13
  import { getSymbolSpec, type CollectState, type SymbolSpec } from "./data";
16
14
  import type { Entry } from "./flatten";
17
- import { declare, getTlaName, MEM } from "./format";
18
- import { createEncoder, type Binding, type EncodingSession, type Env, type Mode } from "./rewrite";
15
+ import { declare, getTlaName, NATIVE_OPERATORS, replaceTokens } from "./format";
16
+ import { getSort } from "./types";
17
+ import {
18
+ createEncoder,
19
+ declareConstant,
20
+ encodeBool,
21
+ getEntries,
22
+ getUniqueName,
23
+ push,
24
+ searchDeclarationType,
25
+ type Binding,
26
+ type Encoder,
27
+ type EncodingSession,
28
+ type Env,
29
+ type Mode,
30
+ type SmtEncoding,
31
+ } from "./rewrite";
19
32
  import { compareAxioms, getAxiomKey, type Axiom } from "./table";
20
33
 
21
34
  type RecordExpr = Extract<Expr, { kind: "Record" }>;
@@ -25,7 +38,6 @@ const isSameFieldSet = (left: RecordExpr, right: RecordExpr) =>
25
38
  left.fields.every((field) => right.fields.some((other) => other.name === field.name)) &&
26
39
  right.fields.every((field) => left.fields.some((other) => other.name === field.name));
27
40
 
28
- // mk_conj: e1 /\ (e2 /\ ...).
29
41
  const conjoinRight = (items: Expr[]): Expr =>
30
42
  items.length === 1
31
43
  ? items[0]
@@ -45,8 +57,6 @@ const decompose = (left: Expr, right: Expr, from: Expr): Expr => {
45
57
  );
46
58
  };
47
59
 
48
- // N_rewrite.simpl_receq, before Type.Synthesize: an equality of two record constructors with the same fields is the conjunction of
49
- // the equalities of their fields, paired by name.
50
60
  const simplifyRecordEqualities = (expression: Expr): Expr => {
51
61
  const inner = mapChildren(expression, simplifyRecordEqualities);
52
62
  if (
@@ -61,8 +71,7 @@ const simplifyRecordEqualities = (expression: Expr): Expr => {
61
71
  return at(decompose(inner.args[0], inner.args[1], inner), inner);
62
72
  };
63
73
 
64
- // N_rewrite.sort_recfields: a record's or a record set's fields in order. Like tlapm, it doesn't visit the
65
- // field values, so a record inside a record keeps the order it's written in.
74
+ // tlapm doesn't visit the field values, so a record inside a record keeps its written order.
66
75
  const sortRecordFields = (expression: Expr): Expr =>
67
76
  expression.kind === "Record" || expression.kind === "Rect"
68
77
  ? {
@@ -71,12 +80,14 @@ const sortRecordFields = (expression: Expr): Expr =>
71
80
  }
72
81
  : mapChildren(expression, sortRecordFields);
73
82
 
74
- // N_axiomatize.collect: each symbol the obligation uses, in the order tlapm visits them, brings
75
- // the symbols and axioms it depends on, smallest name first.
76
83
  const collectSymbols = (entries: Entry[], encoder: Encoder) => {
77
84
  const state: CollectState = {
85
+ isArithmetic: encoder.encoding.isArithmetic,
86
+ isSetExtensional: encoder.encoding.isSetExtensional,
78
87
  recordFields: encoder.recordFields,
88
+ setTypes: encoder.setTypes,
79
89
  strings: [],
90
+ integers: [],
80
91
  isFunConstr: false,
81
92
  isFunSet: false,
82
93
  isExcept: false,
@@ -98,8 +109,6 @@ const collectSymbols = (entries: Entry[], encoder: Encoder) => {
98
109
  spec.axioms.forEach((entry) => axioms.set(getAxiomKey(entry), entry));
99
110
  }
100
111
  };
101
- // A flattened symbol stands for a builtin applied to its first-order arguments and then its
102
- // higher-order ones, so its higher-order text is visited after its arguments.
103
112
  const visit = (text: string) => {
104
113
  const tokens = text.match(/[()]|[^\s()]+/g) ?? [];
105
114
  const pending: { depth: number; text: string }[] = [];
@@ -109,7 +118,7 @@ const collectSymbols = (entries: Entry[], encoder: Encoder) => {
109
118
  if (pending.at(-1)?.depth === depth) visit(pending.pop()?.text ?? "");
110
119
  return depth - 1;
111
120
  }
112
- const flat = encoder.flattened.get(token);
121
+ const flat = encoder.flattener.flattened.get(token);
113
122
  if (!flat) {
114
123
  const builtin = getTlaName(token);
115
124
  if (builtin !== undefined) add(builtin);
@@ -128,16 +137,12 @@ const collectSymbols = (entries: Entry[], encoder: Encoder) => {
128
137
  return { symbols, axioms };
129
138
  };
130
139
 
131
- type Encoder = ReturnType<typeof createEncoder>;
132
-
133
140
  const HYPOTHESIS: Mode = { isOmitted: false, polarity: "Negative", at: undefined, depth: 0 };
134
141
 
135
- // Prep.expand_defs substitutes visible definitions and pragmas, so they declare nothing.
136
142
  const isExpanded = (hyp: Extract<Hyp, { kind: "Defn" }>) =>
137
143
  hyp.definition.kind === "Bpragma" ||
138
144
  (hyp.definition.kind === "Operator" && hyp.visibility === "Visible");
139
145
 
140
- // Smtlib.is_sndord_fact: an ASSUME that declares an operator, which tlapm leaves out.
141
146
  const isSecondOrder = (expression: Expr) =>
142
147
  expression.kind === "Sequent" &&
143
148
  expression.sequent.context.some((hyp) => hyp.kind === "Fresh" && hyp.shape > 0);
@@ -147,74 +152,114 @@ interface EncodedContext {
147
152
  entries: Entry[];
148
153
  }
149
154
 
150
- // Declares each hypothesis's names and asserts its facts, in order, as Smtlib.pp_print_obligation.
151
- const encodeContext = (context: Hyp[], encoder: Encoder) =>
152
- context.reduce<EncodedContext>(
153
- (state, hyp) => {
154
- const next = (binding: Binding, entries: Entry[] = []) => ({
155
- env: encoder.push(state.env, binding),
155
+ const encodeContext = (sequent: Sequent, encoder: Encoder) =>
156
+ sequent.context.reduce<EncodedContext>(
157
+ (state, hyp, index) => {
158
+ const extend = (binding: Binding, entries: Entry[] = []) => ({
159
+ env: push(state.env, binding),
156
160
  entries: [...state.entries, ...entries],
157
161
  });
162
+ const rest: Expr = {
163
+ kind: "Sequent",
164
+ sequent: { context: sequent.context.slice(index + 1), active: sequent.active },
165
+ };
158
166
  switch (hyp.kind) {
159
167
  case "Fresh": {
160
- const symbol = encoder.getUniqueName(hyp.name);
161
- const binding: Binding =
162
- hyp.shape === 0
163
- ? { kind: "constant", symbol }
164
- : { kind: "operator", symbol, arity: hyp.shape };
165
- const declaration = declare(symbol, hyp.shape);
166
- if (!hyp.domain || hyp.domainVisibility === "Hidden") return next(binding, [declaration]);
167
- // Rewrite.elim_bounds: NEW x \in S is NEW x and the fact x \in S.
168
- const fact = `(assert (${MEM} ${symbol} ${encoder.encodeIdv(hyp.domain, state.env, HYPOTHESIS)}))`;
169
- return next(binding, [declaration, ...encoder.getEntries(fact)]);
168
+ const symbol = getUniqueName(encoder, hyp.name);
169
+ if (hyp.shape > 0)
170
+ return extend({ kind: "operator", symbol, arity: hyp.shape }, [
171
+ declare(symbol, hyp.shape),
172
+ ]);
173
+ const declared = declareConstant(
174
+ encoder,
175
+ hyp,
176
+ hyp.domainVisibility === "Visible" ? hyp.domain : undefined,
177
+ rest.sequent,
178
+ state.env,
179
+ HYPOTHESIS,
180
+ );
181
+ const binding: Binding = { kind: "constant", symbol, type: declared.type };
182
+ const declaration = declare(symbol, 0, getSort(declared.type));
183
+ const guard = declared.getGuard(symbol);
184
+ if (guard === undefined) return extend(binding, [declaration]);
185
+ return extend(binding, [declaration, ...getEntries(encoder, `(assert ${guard})`)]);
170
186
  }
171
- // Rewrite.elim_flex: a variable is two constants, the second for its primed value.
187
+ // Rewrite.elim_flex declares a variable and then its primed copy, so the hypotheses after
188
+ // it type both.
172
189
  case "Flex": {
173
- const symbol = encoder.getUniqueName(hyp.name);
174
- const primed = encoder.getUniqueName(`${hyp.name}_prime`);
175
- return next({ kind: "variable", name: hyp.name, symbol, primed }, [
176
- declare(symbol, 0),
177
- declare(primed, 0),
190
+ const symbol = getUniqueName(encoder, hyp.name);
191
+ const primed = getUniqueName(encoder, `${hyp.name}_prime`);
192
+ const type = searchDeclarationType(encoder, rest, true, state.env, HYPOTHESIS);
193
+ const variable: Binding = { kind: "variable", name: hyp.name, symbol, primed, type };
194
+ const primedType = searchDeclarationType(
195
+ encoder,
196
+ rest,
197
+ true,
198
+ push(state.env, variable),
199
+ HYPOTHESIS,
200
+ `${hyp.name}#prime`,
201
+ );
202
+ return extend({ ...variable, primedType }, [
203
+ declare(symbol, 0, getSort(type)),
204
+ declare(primed, 0, getSort(primedType)),
178
205
  ]);
179
206
  }
180
207
  case "Defn": {
181
208
  const definition = hyp.definition;
182
209
  if (isExpanded(hyp))
183
- return next({ kind: "unsupported", reason: "an expanded definition" });
210
+ return extend({ kind: "unsupported", reason: "an expanded definition" });
184
211
  if (definition.kind === "Instance")
185
- return next({ kind: "unsupported", reason: "an instance" });
212
+ return extend({ kind: "unsupported", reason: "an instance" }, [
213
+ `; omitted declaration of '${definition.name}' (missing type)`,
214
+ ]);
186
215
  if (definition.kind === "Recursive") {
187
- const symbol = encoder.getUniqueName(`CONSTANT_${definition.name}_`);
188
- return next({ kind: "operator", symbol, arity: definition.shape }, [
216
+ const symbol = getUniqueName(encoder, `CONSTANT_${definition.name}_`);
217
+ return extend({ kind: "operator", symbol, arity: definition.shape }, [
189
218
  declare(symbol, definition.shape),
190
219
  ]);
191
220
  }
192
221
  if (definition.kind !== "Operator")
193
- return next({ kind: "unsupported", reason: "a definition" });
222
+ return extend({ kind: "unsupported", reason: "a definition" });
194
223
  const body = definition.body;
195
224
  const params = body.kind === "Lambda" ? body.params : [];
196
225
  if (params.some((param) => param.shape > 0))
197
- return next({
198
- kind: "secondOrder",
199
- name: definition.name,
200
- shapes: params.map((param) => param.shape),
201
- });
202
- const symbol = encoder.getUniqueName(definition.name);
203
- return next({ kind: "operator", symbol, arity: params.length }, [
226
+ return extend(
227
+ {
228
+ kind: "secondOrder",
229
+ name: definition.name,
230
+ shapes: params.map((param) => param.shape),
231
+ },
232
+ [`; omitted declaration of '${definition.name}' (second-order)`],
233
+ );
234
+ const symbol = getUniqueName(encoder, definition.name);
235
+ // Type.Synthesize types a hidden constant definition as it types a NEW constant.
236
+ const type =
237
+ hyp.visibility === "Hidden" && body.kind !== "Lambda"
238
+ ? searchDeclarationType(encoder, rest, true, state.env, HYPOTHESIS)
239
+ : undefined;
240
+ if (type !== undefined)
241
+ return extend({ kind: "constant", symbol, type }, [declare(symbol, 0, getSort(type))]);
242
+ return extend({ kind: "operator", symbol, arity: params.length }, [
204
243
  declare(symbol, params.length),
205
244
  ]);
206
245
  }
207
246
  case "Fact": {
208
247
  const binding: Binding = { kind: "unsupported", reason: "a reference to a fact" };
209
- if (hyp.visibility === "Hidden") return next(binding);
248
+ if (hyp.visibility === "Hidden") return extend(binding, ["; hidden fact"]);
210
249
  const isOmitted = isSecondOrder(hyp.expression);
211
- const entries = encoder.getEntries(
212
- `(assert ${encoder.encodeBool(hyp.expression, state.env, { ...HYPOTHESIS, isOmitted })})`,
250
+ const entries = getEntries(
251
+ encoder,
252
+ `(assert ${encodeBool(encoder, hyp.expression, state.env, { ...HYPOTHESIS, isOmitted })})`,
213
253
  );
214
- return next(
254
+ return extend(
215
255
  binding,
216
256
  isOmitted
217
- ? entries.map((entry) => (typeof entry === "string" ? { omitted: entry } : entry))
257
+ ? [
258
+ ...entries.map((entry) =>
259
+ typeof entry === "string" ? { omitted: entry } : entry,
260
+ ),
261
+ "; omitted fact (second-order)",
262
+ ]
218
263
  : entries,
219
264
  );
220
265
  }
@@ -223,43 +268,54 @@ const encodeContext = (context: Hyp[], encoder: Encoder) =>
223
268
  { env: undefined, entries: [] },
224
269
  );
225
270
 
226
- // Smtlib.pp_print_obligation: the logic, the sort, the builtin symbols by name, their axioms,
227
- // then the hypotheses in order, the goal last. It throws a TlaUnsupportedError for what the
228
- // encoding can't express, where tlapm's encoder fails.
229
- export const encodeSmt = (prepared: Sequent, session: EncodingSession) => {
271
+ interface SmtHeader {
272
+ version: string;
273
+ id: number;
274
+ location: string;
275
+ logic: string;
276
+ }
277
+
278
+ export const encodeSmt = (
279
+ prepared: Sequent,
280
+ session: EncodingSession,
281
+ header: SmtHeader,
282
+ encoding: SmtEncoding,
283
+ ) => {
230
284
  const simplified = sortRecordFields(
231
285
  simplifyRecordEqualities({ kind: "Sequent", sequent: prepared }),
232
286
  );
233
- const sequent = simplified.kind === "Sequent" ? simplified.sequent : prepared;
234
- const encoder = createEncoder(session);
235
- const context = encodeContext(sequent.context, encoder);
287
+ const sequent = simplifySets(
288
+ simplified.kind === "Sequent" ? simplified.sequent : prepared,
289
+ encoding.rewriteLevel,
290
+ );
291
+ const encoder = createEncoder(session, encoding);
292
+ const context = encodeContext(sequent, encoder);
236
293
  const goal = isSecondOrder(sequent.active)
237
294
  ? []
238
- : encoder.getEntries(
239
- `(assert (! (not ${encoder.encodeBool(sequent.active, context.env, { ...HYPOTHESIS, polarity: "Positive" })}) :named |Goal|))`,
295
+ : getEntries(
296
+ encoder,
297
+ `(assert (! (not ${encodeBool(encoder, sequent.active, context.env, { ...HYPOTHESIS, polarity: "Positive" })}) :named |Goal|))`,
240
298
  );
241
- const entries = [...context.entries, ...goal];
242
- const printer = createPrinter(encoder.declared);
243
- const collected = collectSymbols(entries, encoder);
299
+ const resolve = createPrinter(encoder.declared);
300
+ const collected = collectSymbols([...context.entries, ...goal], encoder);
244
301
  const declarations = [...collected.symbols]
245
302
  .toSorted((left, right) => compareStrings(left[0], right[0]))
246
303
  .flatMap((symbol) => (symbol[1].declaration === undefined ? [] : [symbol[1].declaration]));
247
304
  const axioms = [...collected.axioms.values()]
248
305
  .toSorted(compareAxioms)
249
- .flatMap((entry) =>
250
- entry.formula === undefined ? [] : [`(assert (! ${entry.formula} :named |${entry.label}|))`],
306
+ .map((entry) =>
307
+ entry.formula === undefined
308
+ ? "; omitted fact (second-order)"
309
+ : `(assert (! ${entry.formula} :named |${entry.label}|))`,
251
310
  );
252
311
  const keys = new Set(collected.axioms.keys());
253
- const lines = [
254
- ...declarations,
255
- ...axioms,
256
- ...entries.flatMap((entry) => {
312
+ const getLines = (entries: Entry[]) =>
313
+ entries.flatMap((entry) => {
257
314
  if (typeof entry === "string") return [entry];
258
315
  return "omitted" in entry ? [] : entry.getLines(keys);
259
- }),
260
- ];
261
- // Smtlib.collect_sorts declares Idv only when a symbol or a bound variable has that sort.
262
- // Type.Synthesize gives that sort to each definition left in the context, though none is printed.
316
+ });
317
+ const hypotheses = [...declarations, ...axioms, ...getLines(context.entries)];
318
+ const lines = [...hypotheses, ...getLines(goal)];
263
319
  const isIdvUsed =
264
320
  lines.some((line) => /\bIdv\b/.test(line)) ||
265
321
  sequent.context.some(
@@ -268,8 +324,23 @@ export const encodeSmt = (prepared: Sequent, session: EncodingSession) => {
268
324
  (hyp.definition.kind === "Operator" || hyp.definition.kind === "Recursive") &&
269
325
  !isExpanded(hyp),
270
326
  );
271
- return ["(set-logic UFNIA)", ...(isIdvUsed ? ["(declare-sort Idv 0)"] : []), ...lines]
272
- .map(printer.resolve)
273
- .concat("(check-sat)", "(exit)")
274
- .join("\n");
327
+ const printCommand = (line: string) => {
328
+ if (line.startsWith(";")) return line;
329
+ const command = layOutCommand(replaceTokens(resolve(line), NATIVE_OPERATORS));
330
+ const name = /:named \|([^|]*)\|\)\)$/.exec(line)?.[1];
331
+ if (name === undefined) return command;
332
+ return `;; ${name === "Goal" ? name : `Axiom: ${name}`}\n${command}`;
333
+ };
334
+ return [
335
+ `;; TLA+ Proof Manager ${header.version}\n`,
336
+ `;; Proof obligation #${header.id}\n`,
337
+ `;; Generated from ${header.location}\n\n`,
338
+ `(set-logic ${header.logic})\n\n`,
339
+ ";; Sorts\n\n",
340
+ isIdvUsed ? "(declare-sort Idv 0)\n" : "",
341
+ "\n;; Hypotheses\n\n",
342
+ hypotheses.length === 0 ? "\n" : "",
343
+ ...lines.map((line) => `${printCommand(line)}\n\n`),
344
+ "(check-sat)\n(exit)\n",
345
+ ].join("");
275
346
  };
@@ -1,6 +1,3 @@
1
- // Standardize.set_extensionality_visitor: an equality of sets where it may need proving triggers
2
- // the set extensionality axiom, through TrigEq.
3
-
4
1
  import {
5
2
  CAP,
6
3
  CUP,
@@ -16,14 +13,10 @@ import {
16
13
 
17
14
  export type Polarity = "Positive" | "Negative" | "Neither";
18
15
 
19
- // The head of a set equality whose polarity keeps it from triggering set extensionality unless a
20
- // cast encloses it: (?trigger triggered kept).
21
16
  const UNRESOLVED_TRIGGER = "?trigger";
22
17
 
23
18
  const SET_HEADS = new Set([UNION, SUBSET, CUP, CAP, SET_MINUS, INT_RANGE, FUN_SET, SEQ]);
24
19
 
25
- // Standardize.is_set: the applications of constructors whose values are sets. Standardize leaves
26
- // BOOLEAN, STRING, Int, and Nat as bare symbols, which is_set doesn't match.
27
20
  const isSetTerm = (text: string) => {
28
21
  const head = /^\(?([^\s()]+)/.exec(text)?.[1] ?? "";
29
22
  return (
@@ -34,7 +27,6 @@ const isSetTerm = (text: string) => {
34
27
  );
35
28
  };
36
29
 
37
- // Picks the triggered or the kept form of each unresolved set equality in text.
38
30
  export const resolveTriggers = (text: string, isTriggered: boolean): string => {
39
31
  const start = text.indexOf(`(${UNRESOLVED_TRIGGER} `);
40
32
  if (start === -1) return text;
@@ -47,18 +39,18 @@ export const resolveTriggers = (text: string, isTriggered: boolean): string => {
47
39
  return text.slice(0, start) + chosen + resolveTriggers(text.slice(keptEnd + 1), isTriggered);
48
40
  };
49
41
 
50
- // The equality, or disequality, of two Idv terms at a polarity.
51
42
  export const getEquality = (
52
43
  left: string,
53
44
  right: string,
54
- polarity: Polarity,
45
+ polarity: Polarity | undefined,
55
46
  isNegated: boolean,
47
+ setTrigger?: string,
56
48
  ) => {
57
- const triggered = `(${TRIG_EQ} ${left} ${right})`;
49
+ const triggered = `(${setTrigger ?? TRIG_EQ} ${left} ${right})`;
58
50
  const kept = isNegated ? `(distinct ${left} ${right})` : `(= ${left} ${right})`;
59
- if (!isSetTerm(left) && !isSetTerm(right)) return kept;
51
+ if (polarity === undefined || (setTrigger === undefined && !isSetTerm(left) && !isSetTerm(right)))
52
+ return kept;
60
53
  const text = isNegated ? `(not ${triggered})` : triggered;
61
- // A cast around the equality may still trigger it, so both forms wait for resolveTriggers.
62
54
  return polarity === (isNegated ? "Positive" : "Negative")
63
55
  ? `(${UNRESOLVED_TRIGGER} ${text} ${kept})`
64
56
  : text;
@@ -1,11 +1,6 @@
1
- // encode/n_flatten.ml: each application of a second-order construct becomes a fresh first-order
2
- // symbol, declared with its axioms before the fact that uses it.
3
-
4
- import { declare, formatName, getClosing } from "./format";
1
+ import { formatName, getClosing } from "./format";
5
2
  import type { Axiom } from "./table";
6
3
 
7
- // A symbol that Flatten introduces, with the text tlapm's collect pass visits for its
8
- // higher-order arguments.
9
4
  export interface Flattened {
10
5
  symbol: string;
11
6
  kind: string;
@@ -13,20 +8,14 @@ export interface Flattened {
13
8
  getLines: (axioms: Set<string>) => string[];
14
9
  }
15
10
 
16
- // A fact that tlapm encodes, so its symbols bring their axioms, but leaves out of the text.
17
11
  interface OmittedFact {
18
12
  omitted: string;
19
13
  }
20
14
 
21
15
  export type Entry = string | Flattened | OmittedFact;
22
16
 
23
- // A bound variable's placeholder: its name and its depth, which the printer names in scope.
24
- export const getVariable = (name: string, depth: number) => `${name}#${depth}`;
25
-
26
17
  export const getDepth = (variable: string) => Number(variable.slice(variable.lastIndexOf("#") + 1));
27
18
 
28
- // The head that marks the Unprimable WITNESS wraps around its witness, which Prep never removes:
29
- // (?unprimable term). Flatten.compare_expr tells it apart, and the printed text drops it.
30
19
  export const UNPRIMABLE = "?unprimable";
31
20
 
32
21
  export const removeUnprimable = (text: string): string => {
@@ -40,30 +29,22 @@ export const removeUnprimable = (text: string): string => {
40
29
  );
41
30
  };
42
31
 
43
- // Flatten.compare_expr: an application matches an earlier one with the same higher-order
44
- // arguments, whatever the variables bound outside them. It can't compare quantifiers or
45
- // conditionals, so an argument with one matches nothing.
46
32
  const getFlatKey = (text: string, depth: number) =>
47
- /\((forall|exists|ite) /.test(text)
33
+ /\((forall|exists|ite|let) /.test(text)
48
34
  ? undefined
49
35
  : text.replace(/[^\s()]+#(\d+)/g, (_match, found: string) =>
50
36
  Number(found) < depth ? "#" : `#${Number(found) - depth}`,
51
37
  );
52
38
 
53
- // Where an application occurs: its depth of bound variables, and whether it's in a fact that
54
- // Smtlib leaves out, which Flatten doesn't enter.
55
39
  interface Site {
56
40
  depth: number;
57
41
  isOmitted: boolean;
58
42
  }
59
43
 
60
- // The state of Flatten.main over one obligation: its blueprint count, which init_bp_count resets
61
- // for each obligation, and the symbols it introduced.
62
44
  export const createFlattener = () => {
63
45
  const flattened = new Map<string, Flattened>();
64
46
  const flatKeys = new Map<string, Flattened>();
65
- const counter = { blueprints: 0 };
66
- // The symbols that the fact being encoded introduces, declared before it.
47
+ let blueprintCount = 0;
67
48
  const introduced: Flattened[] = [];
68
49
 
69
50
  const flatten = (
@@ -71,11 +52,9 @@ export const createFlattener = () => {
71
52
  visit: string,
72
53
  site: Site,
73
54
  getAxioms: (symbol: string, axioms: Set<string>) => Axiom[],
74
- arity: number,
55
+ sorts: string[],
75
56
  name = `TLA__${kind}`,
76
57
  ) => {
77
- // Flatten.find_hoapp skips a second-order ASSUME, so the application stays and only
78
- // N_axiomatize.collect, which runs before Flatten, visits it.
79
58
  if (site.isOmitted) {
80
59
  const symbol = formatName(`${name}_omitted_${flattened.size}`);
81
60
  flattened.set(symbol, { symbol, kind, visit: removeUnprimable(visit), getLines: () => [] });
@@ -83,17 +62,17 @@ export const createFlattener = () => {
83
62
  }
84
63
  const key = getFlatKey(`${name} ${visit}`, site.depth);
85
64
  // Flatten.new_bp_id counts every application, even one that reuses an earlier symbol.
86
- counter.blueprints++;
65
+ blueprintCount++;
87
66
  const known = key === undefined ? undefined : flatKeys.get(key);
88
67
  if (known) return known.symbol;
89
- const raw = `${name}_flatnd_${counter.blueprints}`;
68
+ const raw = `${name}_flatnd_${blueprintCount}`;
90
69
  const symbol = formatName(raw);
91
70
  const flat: Flattened = {
92
71
  symbol,
93
72
  kind,
94
73
  visit: removeUnprimable(visit),
95
74
  getLines: (axioms) => [
96
- declare(symbol, arity),
75
+ `(declare-fun ${symbol} (${sorts.join(" ")}) Idv)`,
97
76
  ...getAxioms(symbol, axioms).map(
98
77
  (entry) =>
99
78
  `(assert (! ${removeUnprimable(entry.formula ?? "")} :named |${entry.label} ${raw}|))`,
@@ -1,8 +1,5 @@
1
- // backend/smtlib.ml's names and the SMT-LIB terms the encoding builds.
2
-
3
1
  import type { Builtin } from "../../obligations/expression";
4
2
 
5
- // Smtlib.format_smt: spells out each special character, then doubles each underscore.
6
3
  const SPELLED: Record<string, string> = {
7
4
  "\\": "backslash_",
8
5
  "+": "plussign_",
@@ -39,7 +36,6 @@ const SPELLED_WORDS = new RegExp(`(${[...UNSPELLED.keys()].join("|")})`, "g");
39
36
 
40
37
  export const tla = (name: string) => formatName(`TLA__${name}`);
41
38
 
42
- // The builtin a symbol that tla names stands for, or undefined for any other symbol.
43
39
  export const getTlaName = (symbol: string) =>
44
40
  symbol.startsWith(TLA_PREFIX)
45
41
  ? symbol
@@ -65,6 +61,8 @@ export const NAT_SET = tla("NatSet");
65
61
  export const CAST_INT = tla("Cast_Int");
66
62
  export const PROJ_INT = tla("Proj_Int");
67
63
  export const INT_LTEQ = tla("IntLteq");
64
+ export const INT_PLUS = tla("IntPlus");
65
+ export const INT_MINUS = tla("IntMinus");
68
66
  export const INT_RANGE = tla("IntRange");
69
67
  export const FUN_APP = tla("FunApp");
70
68
  export const FUN_DOM = tla("FunDom");
@@ -82,6 +80,19 @@ export const TAIL = tla("Tail");
82
80
  export const SUB_SEQ = tla("SubSeq");
83
81
  export const TUPLE_0 = tla("Tuple_0");
84
82
 
83
+ export const NATIVE_OPERATORS = new Map(
84
+ [
85
+ ["TIntPlus", "+"],
86
+ ["TIntMinus", "-"],
87
+ ["TIntTimes", "*"],
88
+ ["TIntUminus", "-"],
89
+ ["TIntLteq", "<="],
90
+ ["TIntLt", "<"],
91
+ ["TIntGteq", ">="],
92
+ ["TIntGt", ">"],
93
+ ].map((entry) => [tla(entry[0]), entry[1]]),
94
+ );
95
+
85
96
  export const BUILTIN_SYMBOLS: Partial<Record<Builtin, string>> = {
86
97
  Cup: CUP,
87
98
  Cap: CAP,
@@ -89,8 +100,8 @@ export const BUILTIN_SYMBOLS: Partial<Record<Builtin, string>> = {
89
100
  SUBSET,
90
101
  UNION,
91
102
  DOMAIN: FUN_DOM,
92
- Plus: tla("IntPlus"),
93
- Minus: tla("IntMinus"),
103
+ Plus: INT_PLUS,
104
+ Minus: INT_MINUS,
94
105
  Times: tla("IntTimes"),
95
106
  Exp: tla("IntExp"),
96
107
  Quotient: tla("IntQuotient"),
@@ -110,8 +121,14 @@ export const BUILTIN_SYMBOLS: Partial<Record<Builtin, string>> = {
110
121
  export const getNames = (prefix: string, count: number) =>
111
122
  Array.from({ length: count }, (_value, index) => `${prefix}${index + 1}`);
112
123
 
124
+ // A bound variable is name#depth, or name:Sort#depth when Type.Synthesize sorts it Int or Bool.
125
+ export const getVariable = (name: string, depth: number, sort = "Idv") =>
126
+ `${name}${sort === "Idv" ? "" : `:${sort}`}#${depth}`;
127
+
128
+ export const getVariableSort = (variable: string) => /:(\w+)#\d+$/.exec(variable)?.[1];
129
+
113
130
  export const getBinders = (variables: string[], sort = "Idv") =>
114
- variables.map((variable) => `(${variable} ${sort})`).join(" ");
131
+ variables.map((variable) => `(${variable} ${getVariableSort(variable) ?? sort})`).join(" ");
115
132
 
116
133
  export const forall = (
117
134
  variables: string[],
@@ -139,16 +156,18 @@ export const call = (symbol: string, args: string[]) =>
139
156
  export const declare = (symbol: string, arity: number, sort = "Idv", argSort = "Idv") =>
140
157
  `(declare-fun ${symbol} (${Array.from({ length: arity }, () => argSort).join(" ")}) ${sort})`;
141
158
 
142
- // The index of the parenthesis that closes the one at from.
143
159
  export const getClosing = (text: string, from: number) => {
144
- const state = { depth: 0, index: from };
145
- for (; state.index < text.length; state.index++) {
146
- if (text[state.index] === "(") state.depth++;
147
- if (text[state.index] === ")") state.depth--;
148
- if (state.depth === 0) return state.index;
160
+ let depth = 0;
161
+ for (let index = from; index < text.length; index++) {
162
+ if (text[index] === "(") depth++;
163
+ if (text[index] === ")") depth--;
164
+ if (depth === 0) return index;
149
165
  }
150
166
  return text.length;
151
167
  };
152
168
 
169
+ export const replaceTokens = (text: string, replacements: Map<string, string>) =>
170
+ text.replace(/[^\s()]+/g, (found) => replacements.get(found) ?? found);
171
+
153
172
  export const replaceToken = (text: string, token: string, replacement: string) =>
154
- text.replace(/[^\s()]+/g, (found) => (found === token ? replacement : found));
173
+ replaceTokens(text, new Map([[token, replacement]]));