tla-ts 0.0.10-dev.63a6693bd → 0.0.10-dev.7a3bb1545

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 (538) hide show
  1. package/README.md +2 -1
  2. package/dist/compile.cjs +3 -3
  3. package/dist/compile.js +1 -1
  4. package/dist/deciders.cjs +41 -37
  5. package/dist/deciders.js +58 -54
  6. package/dist/index.cjs +1 -1
  7. package/dist/index.d.cts +4 -1
  8. package/dist/index.d.ts +4 -1
  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 +2682 -426
  15. package/dist/prove.js +2679 -423
  16. package/dist/run.cjs +43 -42
  17. package/dist/run.js +45 -44
  18. package/dist/tlapm.cjs +1 -1
  19. package/dist/tlapm.js +2 -2
  20. package/dist/transfer.cjs +43 -40
  21. package/dist/transfer.js +43 -40
  22. package/dist/worker.cjs +7 -7
  23. package/dist/worker.js +7 -7
  24. package/package.json +1 -1
  25. package/src/ast.ts +3 -3
  26. package/src/bags.ts +46 -28
  27. package/src/check-trace.ts +2 -16
  28. package/src/check.ts +336 -88
  29. package/src/cli/runtime-invariants.ts +20 -56
  30. package/src/cli/tlapm.ts +424 -62
  31. package/src/cli/tlc-arguments.ts +2 -2
  32. package/src/cli/tlc-output.ts +4 -5
  33. package/src/cli/tlc-usage.ts +0 -1
  34. package/src/cli/tlc.ts +26 -7
  35. package/src/dependencies.ts +23 -2
  36. package/src/dfid.ts +9 -2
  37. package/src/environment.ts +27 -5
  38. package/src/errors.ts +30 -3
  39. package/src/evaluate.ts +9 -3
  40. package/src/exit-codes.ts +5 -2
  41. package/src/instances.ts +1 -1
  42. package/src/levels.ts +3 -2
  43. package/src/lexer.ts +5 -3
  44. package/src/liveness-checker.ts +572 -204
  45. package/src/liveness.ts +47 -32
  46. package/src/obligations/action.ts +10 -6
  47. package/src/obligations/anonymize.ts +33 -14
  48. package/src/obligations/enabled-axioms.ts +218 -0
  49. package/src/obligations/equality.ts +1 -3
  50. package/src/obligations/expression.ts +18 -6
  51. package/src/obligations/format.ts +0 -2
  52. package/src/obligations/generate.ts +22 -17
  53. package/src/obligations/index.ts +36 -6
  54. package/src/obligations/levels.ts +24 -11
  55. package/src/obligations/module.ts +1 -3
  56. package/src/obligations/normalize.ts +24 -13
  57. package/src/obligations/operators.ts +0 -2
  58. package/src/obligations/pragma.ts +53 -16
  59. package/src/obligations/printer.ts +43 -13
  60. package/src/obligations/proof.ts +3 -2
  61. package/src/obligations/regroup.ts +0 -2
  62. package/src/obligations/simplify.ts +17 -7
  63. package/src/obligations/source.ts +71 -17
  64. package/src/obligations/subexpression.ts +45 -18
  65. package/src/obligations/substitution.ts +1 -3
  66. package/src/obligations/temporal.ts +0 -2
  67. package/src/obligations/tuples.ts +0 -2
  68. package/src/parallel-worker.ts +8 -2
  69. package/src/parallel.ts +7 -2
  70. package/src/parser.ts +633 -186
  71. package/src/pretty-print.ts +1 -1
  72. package/src/prover/deciders.ts +11 -8
  73. package/src/prover/isabelle/decide.ts +3 -25
  74. package/src/prover/isabelle/encode.ts +71 -41
  75. package/src/prover/isabelle/isar/attrib.ts +250 -0
  76. package/src/prover/isabelle/isar/context.ts +335 -0
  77. package/src/prover/isabelle/isar/induct.ts +382 -0
  78. package/src/prover/isabelle/isar/inner-syntax.ts +149 -3
  79. package/src/prover/isabelle/isar/method.ts +506 -198
  80. package/src/prover/isabelle/isar/proof.ts +570 -14
  81. package/src/prover/isabelle/isar/rule-cases.ts +226 -0
  82. package/src/prover/isabelle/isar/theory.ts +479 -69
  83. package/src/prover/isabelle/isar/toplevel.ts +331 -0
  84. package/src/prover/isabelle/isar/type-check.ts +83 -8
  85. package/src/prover/isabelle/provers/blast/blast.ts +0 -2
  86. package/src/prover/isabelle/provers/blast/branch.ts +0 -2
  87. package/src/prover/isabelle/provers/blast/prove.ts +0 -2
  88. package/src/prover/isabelle/provers/blast/rules.ts +0 -2
  89. package/src/prover/isabelle/provers/blast/state.ts +0 -2
  90. package/src/prover/isabelle/provers/blast/term.ts +0 -2
  91. package/src/prover/isabelle/provers/clasimp.ts +1 -3
  92. package/src/prover/isabelle/provers/classical.ts +45 -20
  93. package/src/prover/isabelle/provers/hypsubst.ts +2 -4
  94. package/src/prover/isabelle/pure/bicompose.ts +0 -2
  95. package/src/prover/isabelle/pure/consts.ts +0 -2
  96. package/src/prover/isabelle/pure/conv.ts +0 -2
  97. package/src/prover/isabelle/pure/drule.ts +63 -4
  98. package/src/prover/isabelle/pure/envir.ts +0 -2
  99. package/src/prover/isabelle/pure/goal.ts +1 -3
  100. package/src/prover/isabelle/pure/logic.ts +0 -2
  101. package/src/prover/isabelle/pure/name.ts +0 -2
  102. package/src/prover/isabelle/pure/net.ts +0 -2
  103. package/src/prover/isabelle/pure/object-logic.ts +13 -7
  104. package/src/prover/isabelle/pure/pattern.ts +0 -2
  105. package/src/prover/isabelle/pure/raw-simplifier.ts +0 -2
  106. package/src/prover/isabelle/pure/rewriter.ts +1 -8
  107. package/src/prover/isabelle/pure/search.ts +0 -2
  108. package/src/prover/isabelle/pure/seq.ts +0 -2
  109. package/src/prover/isabelle/pure/simplifier.ts +26 -7
  110. package/src/prover/isabelle/pure/table.ts +0 -2
  111. package/src/prover/isabelle/pure/tactic.ts +0 -2
  112. package/src/prover/isabelle/pure/tactical.ts +0 -2
  113. package/src/prover/isabelle/pure/term-ord.ts +0 -2
  114. package/src/prover/isabelle/pure/term.ts +0 -2
  115. package/src/prover/isabelle/pure/thm.ts +0 -2
  116. package/src/prover/isabelle/pure/type.ts +0 -2
  117. package/src/prover/isabelle/pure/unify.ts +0 -2
  118. package/src/prover/isabelle/pure/variable.ts +0 -2
  119. package/src/prover/isabelle/tla/classical-setup.ts +1 -2
  120. package/src/prover/isabelle/tla/context.ts +51 -9
  121. package/src/prover/isabelle/tla/logic-data.ts +1 -1
  122. package/src/prover/isabelle/tla/logic.ts +40 -1
  123. package/src/prover/isabelle/tla/simpdata.ts +0 -2
  124. package/src/prover/isabelle/tools/intuitionistic.ts +28 -12
  125. package/src/prover/ocaml.ts +4 -1
  126. package/src/prover/prep/action.ts +19 -12
  127. package/src/prover/prep/enabled-axioms.ts +11 -2
  128. package/src/prover/prep/methods.ts +159 -50
  129. package/src/prover/prep/normalize.ts +38 -9
  130. package/src/prover/prove.ts +343 -65
  131. package/src/prover/ptl/decide.ts +95 -50
  132. package/src/prover/ptl/encode.ts +2 -3
  133. package/src/prover/ptl/tableau.ts +28 -2
  134. package/src/prover/smt/arithmetic.ts +310 -0
  135. package/src/prover/smt/axioms.ts +12 -8
  136. package/src/prover/smt/context.ts +42 -6
  137. package/src/prover/smt/data.ts +191 -84
  138. package/src/prover/smt/encode.ts +122 -43
  139. package/src/prover/smt/extensionality.ts +5 -3
  140. package/src/prover/smt/flatten.ts +4 -6
  141. package/src/prover/smt/format.ts +28 -4
  142. package/src/prover/smt/instances.ts +7 -1
  143. package/src/prover/smt/layout.ts +91 -0
  144. package/src/prover/smt/rewrite.ts +483 -116
  145. package/src/prover/smt/simplify.ts +441 -0
  146. package/src/prover/smt/solver/ackermannize-bv-tactic.ts +61 -0
  147. package/src/prover/smt/solver/ackr-helper.ts +179 -0
  148. package/src/prover/smt/solver/ackr-model-converter.ts +105 -0
  149. package/src/prover/smt/solver/act-cache.ts +0 -1
  150. package/src/prover/smt/solver/add-bounds-tactic.ts +59 -0
  151. package/src/prover/smt/solver/aig-tactic.ts +52 -0
  152. package/src/prover/smt/solver/aig.ts +889 -0
  153. package/src/prover/smt/solver/arith-rewriter.ts +613 -6
  154. package/src/prover/smt/solver/arith-terms.ts +121 -0
  155. package/src/prover/smt/solver/array-decl-plugin.ts +175 -0
  156. package/src/prover/smt/solver/array-rewriter.ts +309 -0
  157. package/src/prover/smt/solver/asserted-formulas.ts +93 -15
  158. package/src/prover/smt/solver/ast-lt.ts +165 -11
  159. package/src/prover/smt/solver/ast-util.ts +160 -2
  160. package/src/prover/smt/solver/ast.ts +1448 -41
  161. package/src/prover/smt/solver/auf-solver.ts +0 -1
  162. package/src/prover/smt/solver/bit-blast-tactic.ts +582 -0
  163. package/src/prover/smt/solver/bit-blaster.ts +871 -0
  164. package/src/prover/smt/solver/bound-manager.ts +196 -0
  165. package/src/prover/smt/solver/bound-simplifier.ts +600 -0
  166. package/src/prover/smt/solver/bv-bound-chk.ts +492 -0
  167. package/src/prover/smt/solver/bv-decl-plugin.ts +338 -0
  168. package/src/prover/smt/solver/bv-divrem-bounds.ts +95 -0
  169. package/src/prover/smt/solver/bv-rewriter.ts +1901 -0
  170. package/src/prover/smt/solver/bv1-blast.ts +214 -0
  171. package/src/prover/smt/solver/bv2fpa-converter.ts +174 -0
  172. package/src/prover/smt/solver/bv2int-rewriter.ts +544 -0
  173. package/src/prover/smt/solver/bv2real-rewriter.ts +533 -0
  174. package/src/prover/smt/solver/card2bv.ts +109 -0
  175. package/src/prover/smt/solver/case-split-queue.ts +0 -2
  176. package/src/prover/smt/solver/cg-table.ts +39 -25
  177. package/src/prover/smt/solver/check-logic.ts +330 -0
  178. package/src/prover/smt/solver/clause.ts +0 -1
  179. package/src/prover/smt/solver/cofactor-elim-term-ite.ts +278 -0
  180. package/src/prover/smt/solver/conflict-resolution.ts +78 -2
  181. package/src/prover/smt/solver/context.ts +533 -114
  182. package/src/prover/smt/solver/ctx-simplify.ts +21 -12
  183. package/src/prover/smt/solver/ctx-solver-simplify.ts +122 -0
  184. package/src/prover/smt/solver/datatype-decl-plugin.ts +572 -0
  185. package/src/prover/smt/solver/datatype-rewriter.ts +82 -0
  186. package/src/prover/smt/solver/demodulator.ts +786 -0
  187. package/src/prover/smt/solver/dependent-expr-state.ts +81 -0
  188. package/src/prover/smt/solver/der.ts +38 -10
  189. package/src/prover/smt/solver/diff-neq.ts +205 -0
  190. package/src/prover/smt/solver/distribute-forall.ts +57 -0
  191. package/src/prover/smt/solver/dom-simplify.ts +511 -0
  192. package/src/prover/smt/solver/dt2bv-tactic.ts +260 -0
  193. package/src/prover/smt/solver/dyn-ack.ts +0 -1
  194. package/src/prover/smt/solver/e-matching.ts +6 -7
  195. package/src/prover/smt/solver/elim-small-bv-tactic.ts +129 -0
  196. package/src/prover/smt/solver/elim-uncnstr.ts +542 -0
  197. package/src/prover/smt/solver/enode.ts +100 -3
  198. package/src/prover/smt/solver/eq2bv-tactic.ts +218 -0
  199. package/src/prover/smt/solver/euf/arith-axioms.ts +403 -0
  200. package/src/prover/smt/solver/euf/arith-internalize.ts +653 -0
  201. package/src/prover/smt/solver/euf/arith-solver.ts +889 -0
  202. package/src/prover/smt/solver/euf/array-axioms.ts +527 -0
  203. package/src/prover/smt/solver/euf/array-internalize.ts +428 -0
  204. package/src/prover/smt/solver/euf/array-solver.ts +306 -0
  205. package/src/prover/smt/solver/euf/bv-ackerman.ts +162 -0
  206. package/src/prover/smt/solver/euf/bv-internalize.ts +748 -0
  207. package/src/prover/smt/solver/euf/bv-solver.ts +449 -0
  208. package/src/prover/smt/solver/euf/dt-solver.ts +618 -0
  209. package/src/prover/smt/solver/euf/egraph.ts +901 -0
  210. package/src/prover/smt/solver/euf/euf-solver.ts +1204 -0
  211. package/src/prover/smt/solver/euf/fpa-solver.ts +317 -0
  212. package/src/prover/smt/solver/euf/mam.ts +1046 -0
  213. package/src/prover/smt/solver/euf/q-ematch.ts +829 -0
  214. package/src/prover/smt/solver/euf/q-mbi.ts +587 -0
  215. package/src/prover/smt/solver/euf/q-model-fixer.ts +296 -0
  216. package/src/prover/smt/solver/euf/q-solver.ts +361 -0
  217. package/src/prover/smt/solver/euf/th-solver.ts +328 -0
  218. package/src/prover/smt/solver/euf/th-solvers.ts +30 -0
  219. package/src/prover/smt/solver/expr-ref.ts +0 -1
  220. package/src/prover/smt/solver/expr-safe-replace.ts +26 -2
  221. package/src/prover/smt/solver/expr2polynomial.ts +271 -0
  222. package/src/prover/smt/solver/factor.ts +163 -0
  223. package/src/prover/smt/solver/fd-solver.ts +267 -0
  224. package/src/prover/smt/solver/fingerprints.ts +15 -15
  225. package/src/prover/smt/solver/fix-dl-var.ts +147 -0
  226. package/src/prover/smt/solver/flat-literals.ts +0 -1
  227. package/src/prover/smt/solver/fm-tactic.ts +884 -0
  228. package/src/prover/smt/solver/fpa-decl-plugin.ts +618 -0
  229. package/src/prover/smt/solver/fpa-rewriter.ts +639 -0
  230. package/src/prover/smt/solver/fpa2bv-converter.ts +2251 -0
  231. package/src/prover/smt/solver/fpa2bv-rewriter.ts +348 -0
  232. package/src/prover/smt/solver/fpa2bv-tactic.ts +73 -0
  233. package/src/prover/smt/solver/goal.ts +177 -15
  234. package/src/prover/smt/solver/goal2nlsat.ts +216 -0
  235. package/src/prover/smt/solver/guard-set.ts +219 -0
  236. package/src/prover/smt/solver/hash.ts +0 -1
  237. package/src/prover/smt/solver/hashtable.ts +30 -16
  238. package/src/prover/smt/solver/inf-eps.ts +63 -0
  239. package/src/prover/smt/solver/inj-axiom.ts +101 -0
  240. package/src/prover/smt/solver/internalizer.ts +109 -36
  241. package/src/prover/smt/solver/lackr.ts +381 -0
  242. package/src/prover/smt/solver/lbool.ts +0 -1
  243. package/src/prover/smt/solver/lia2card.ts +268 -0
  244. package/src/prover/smt/solver/lia2pb.ts +154 -0
  245. package/src/prover/smt/solver/literal.ts +0 -1
  246. package/src/prover/smt/solver/logic-tactics.ts +345 -0
  247. package/src/prover/smt/solver/lp/bound-propagator.ts +0 -1
  248. package/src/prover/smt/solver/lp/constraints.ts +0 -1
  249. package/src/prover/smt/solver/lp/containers.ts +7 -2
  250. package/src/prover/smt/solver/lp/core-solver.ts +18 -3
  251. package/src/prover/smt/solver/lp/cross-nested.ts +1 -4
  252. package/src/prover/smt/solver/lp/dep-intervals.ts +0 -3
  253. package/src/prover/smt/solver/lp/dependency.ts +0 -2
  254. package/src/prover/smt/solver/lp/dioph-eq.ts +0 -2
  255. package/src/prover/smt/solver/lp/explanation.ts +0 -1
  256. package/src/prover/smt/solver/lp/gomory.ts +0 -1
  257. package/src/prover/smt/solver/lp/hnf-cutter.ts +0 -1
  258. package/src/prover/smt/solver/lp/hnf.ts +0 -3
  259. package/src/prover/smt/solver/lp/int-cube.ts +3 -4
  260. package/src/prover/smt/solver/lp/int-solver.ts +0 -2
  261. package/src/prover/smt/solver/lp/lar-solver.ts +40 -4
  262. package/src/prover/smt/solver/lp/lar-term.ts +0 -1
  263. package/src/prover/smt/solver/lp/lp-settings.ts +0 -1
  264. package/src/prover/smt/solver/lp/maximize-term.ts +59 -10
  265. package/src/prover/smt/solver/lp/nex-creator.ts +3 -3
  266. package/src/prover/smt/solver/lp/nex.ts +2 -2
  267. package/src/prover/smt/solver/lp/nla-backoff.ts +0 -2
  268. package/src/prover/smt/solver/lp/nla-basics.ts +46 -3
  269. package/src/prover/smt/solver/lp/nla-core.ts +66 -11
  270. package/src/prover/smt/solver/lp/nla-divisions.ts +0 -2
  271. package/src/prover/smt/solver/lp/nla-emonics.ts +0 -1
  272. package/src/prover/smt/solver/lp/nla-factorization.ts +0 -1
  273. package/src/prover/smt/solver/lp/nla-grobner.ts +167 -85
  274. package/src/prover/smt/solver/lp/nla-horner.ts +0 -2
  275. package/src/prover/smt/solver/lp/nla-intervals.ts +0 -1
  276. package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +0 -2
  277. package/src/prover/smt/solver/lp/nla-monotone.ts +0 -1
  278. package/src/prover/smt/solver/lp/nla-order.ts +0 -2
  279. package/src/prover/smt/solver/lp/nla-patcher.ts +0 -1
  280. package/src/prover/smt/solver/lp/nla-powers.ts +220 -0
  281. package/src/prover/smt/solver/lp/nla-tangents.ts +0 -2
  282. package/src/prover/smt/solver/lp/nla-throttle.ts +0 -1
  283. package/src/prover/smt/solver/lp/nla-transcendentals.ts +324 -0
  284. package/src/prover/smt/solver/lp/nla-types.ts +0 -2
  285. package/src/prover/smt/solver/lp/nla-var-eqs.ts +0 -1
  286. package/src/prover/smt/solver/lp/nra-solver.ts +163 -99
  287. package/src/prover/smt/solver/lp/numeric-pair.ts +0 -1
  288. package/src/prover/smt/solver/lp/pdd-interval.ts +6 -3
  289. package/src/prover/smt/solver/lp/pdd-simplifier.ts +60 -21
  290. package/src/prover/smt/solver/lp/pdd-solver.ts +72 -41
  291. package/src/prover/smt/solver/lp/pdd.ts +725 -290
  292. package/src/prover/smt/solver/lp/random-updater.ts +0 -2
  293. package/src/prover/smt/solver/lp/static-matrix.ts +0 -1
  294. package/src/prover/smt/solver/lp/union-find.ts +7 -2
  295. package/src/prover/smt/solver/macro-finder.ts +530 -0
  296. package/src/prover/smt/solver/mam-compiler.ts +118 -88
  297. package/src/prover/smt/solver/mam-interpreter.ts +0 -1
  298. package/src/prover/smt/solver/max-bv-sharing-tactic.ts +17 -0
  299. package/src/prover/smt/solver/max-cliques.ts +105 -0
  300. package/src/prover/smt/solver/maxcore.ts +309 -0
  301. package/src/prover/smt/solver/maximize-ac-sharing.ts +8 -6
  302. package/src/prover/smt/solver/maxlex.ts +115 -0
  303. package/src/prover/smt/solver/maxsmt-base.ts +105 -0
  304. package/src/prover/smt/solver/maxsmt.ts +92 -0
  305. package/src/prover/smt/solver/mbp/mbp-arith.ts +467 -0
  306. package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +101 -0
  307. package/src/prover/smt/solver/mbp/mbp-plugin.ts +287 -0
  308. package/src/prover/smt/solver/mbp/mbp-qel.ts +48 -0
  309. package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +271 -0
  310. package/src/prover/smt/solver/mbp/mbp-term-graph.ts +606 -0
  311. package/src/prover/smt/solver/model-based-opt.ts +844 -0
  312. package/src/prover/smt/solver/model-checker.ts +17 -26
  313. package/src/prover/smt/solver/model-evaluator.ts +188 -12
  314. package/src/prover/smt/solver/model-finder.ts +0 -1
  315. package/src/prover/smt/solver/model-generator.ts +59 -30
  316. package/src/prover/smt/solver/model-macro-solver.ts +38 -27
  317. package/src/prover/smt/solver/model-printer.ts +214 -0
  318. package/src/prover/smt/solver/mpf.ts +709 -0
  319. package/src/prover/smt/solver/mus.ts +50 -0
  320. package/src/prover/smt/solver/muz/dl-context.ts +410 -0
  321. package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +97 -0
  322. package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +167 -0
  323. package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +125 -0
  324. package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +299 -0
  325. package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +455 -0
  326. package/src/prover/smt/solver/muz/dl-mk-slice.ts +340 -0
  327. package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +163 -0
  328. package/src/prover/smt/solver/muz/dl-rule-set.ts +273 -0
  329. package/src/prover/smt/solver/muz/dl-rule-transformer.ts +123 -0
  330. package/src/prover/smt/solver/muz/dl-rule.ts +496 -0
  331. package/src/prover/smt/solver/muz/hnf.ts +201 -0
  332. package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +176 -0
  333. package/src/prover/smt/solver/muz/horn-tactic.ts +201 -0
  334. package/src/prover/smt/solver/muz/rule-properties.ts +337 -0
  335. package/src/prover/smt/solver/muz/spacer-context.ts +1404 -0
  336. package/src/prover/smt/solver/muz/spacer-dl-interface.ts +52 -0
  337. package/src/prover/smt/solver/muz/spacer-generalizers.ts +241 -0
  338. package/src/prover/smt/solver/muz/spacer-manager.ts +127 -0
  339. package/src/prover/smt/solver/muz/spacer-pdr.ts +219 -0
  340. package/src/prover/smt/solver/muz/spacer-prop-solver.ts +333 -0
  341. package/src/prover/smt/solver/muz/spacer-util.ts +282 -0
  342. package/src/prover/smt/solver/muz/substitution.ts +203 -0
  343. package/src/prover/smt/solver/nla2bv-tactic.ts +285 -0
  344. package/src/prover/smt/solver/nlqsat.ts +484 -0
  345. package/src/prover/smt/solver/nlsat/algebraic.ts +305 -88
  346. package/src/prover/smt/solver/nlsat/atoms.ts +52 -35
  347. package/src/prover/smt/solver/nlsat/evaluator.ts +0 -1
  348. package/src/prover/smt/solver/nlsat/explain.ts +424 -211
  349. package/src/prover/smt/solver/nlsat/interval-set.ts +1 -2
  350. package/src/prover/smt/solver/nlsat/levelwise.ts +460 -241
  351. package/src/prover/smt/solver/nlsat/mpbq.ts +45 -1
  352. package/src/prover/smt/solver/nlsat/polynomial.ts +2366 -683
  353. package/src/prover/smt/solver/nlsat/solver.ts +282 -69
  354. package/src/prover/smt/solver/nlsat/transcendental-eval.ts +310 -0
  355. package/src/prover/smt/solver/nlsat/transcendentals.ts +391 -0
  356. package/src/prover/smt/solver/nlsat/types.ts +0 -2
  357. package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +8 -7
  358. package/src/prover/smt/solver/nlsat/upolynomial.ts +41 -20
  359. package/src/prover/smt/solver/nlsat-tactic.ts +82 -0
  360. package/src/prover/smt/solver/nnf.ts +105 -23
  361. package/src/prover/smt/solver/normalize-bounds.ts +53 -0
  362. package/src/prover/smt/solver/occf.ts +97 -0
  363. package/src/prover/smt/solver/opt-context.ts +792 -0
  364. package/src/prover/smt/solver/opt-nlsat.ts +386 -0
  365. package/src/prover/smt/solver/opt-pareto.ts +282 -0
  366. package/src/prover/smt/solver/opt-preprocess.ts +101 -0
  367. package/src/prover/smt/solver/opt-solver.ts +311 -0
  368. package/src/prover/smt/solver/opt-value.ts +55 -0
  369. package/src/prover/smt/solver/optsmt.ts +692 -0
  370. package/src/prover/smt/solver/parallel-tactic.ts +299 -0
  371. package/src/prover/smt/solver/pattern-inference.ts +19 -11
  372. package/src/prover/smt/solver/pb-rewriter.ts +281 -0
  373. package/src/prover/smt/solver/pb2bv-tactic.ts +540 -0
  374. package/src/prover/smt/solver/poly-rewriter.ts +202 -57
  375. package/src/prover/smt/solver/probes.ts +511 -0
  376. package/src/prover/smt/solver/propagate-values.ts +37 -21
  377. package/src/prover/smt/solver/proto-model.ts +650 -17
  378. package/src/prover/smt/solver/pull-quant.ts +28 -12
  379. package/src/prover/smt/solver/purify-arith.ts +632 -0
  380. package/src/prover/smt/solver/qe-arith-plugin.ts +1096 -0
  381. package/src/prover/smt/solver/qe-lite-der.ts +2 -3
  382. package/src/prover/smt/solver/qe-lite-fm.ts +3 -4
  383. package/src/prover/smt/solver/qe-lite.ts +37 -17
  384. package/src/prover/smt/solver/qe-mbp.ts +270 -0
  385. package/src/prover/smt/solver/qe.ts +1499 -0
  386. package/src/prover/smt/solver/qel.ts +25 -0
  387. package/src/prover/smt/solver/qi-queue.ts +0 -1
  388. package/src/prover/smt/solver/qsat.ts +814 -0
  389. package/src/prover/smt/solver/quant-hoist.ts +196 -0
  390. package/src/prover/smt/solver/quant-tactics.ts +16 -56
  391. package/src/prover/smt/solver/quantifier-analyzer.ts +9 -10
  392. package/src/prover/smt/solver/quantifier-manager.ts +25 -24
  393. package/src/prover/smt/solver/quasi-macros.ts +243 -0
  394. package/src/prover/smt/solver/random-gen.ts +0 -1
  395. package/src/prover/smt/solver/rational.ts +45 -1
  396. package/src/prover/smt/solver/recfun-decl-plugin.ts +262 -0
  397. package/src/prover/smt/solver/recfun-rewriter.ts +107 -0
  398. package/src/prover/smt/solver/reduce-args.ts +225 -0
  399. package/src/prover/smt/solver/reduce-bv-size.ts +119 -0
  400. package/src/prover/smt/solver/ref-vector.ts +0 -1
  401. package/src/prover/smt/solver/relevancy.ts +1 -2
  402. package/src/prover/smt/solver/rewriter-tpl.ts +77 -10
  403. package/src/prover/smt/solver/rewriter.ts +475 -36
  404. package/src/prover/smt/solver/rlimit.ts +38 -2
  405. package/src/prover/smt/solver/sat/asymm-branch.ts +325 -0
  406. package/src/prover/smt/solver/sat/big.ts +177 -0
  407. package/src/prover/smt/solver/sat/clause-use-list.ts +71 -0
  408. package/src/prover/smt/solver/sat/clause.ts +203 -0
  409. package/src/prover/smt/solver/sat/cleaner.ts +94 -0
  410. package/src/prover/smt/solver/sat/config.ts +122 -0
  411. package/src/prover/smt/solver/sat/consequences.ts +203 -0
  412. package/src/prover/smt/solver/sat/elim-eqs.ts +142 -0
  413. package/src/prover/smt/solver/sat/goal2sat.ts +526 -0
  414. package/src/prover/smt/solver/sat/inc-sat-solver.ts +378 -0
  415. package/src/prover/smt/solver/sat/model-converter.ts +136 -0
  416. package/src/prover/smt/solver/sat/pb-constraint.ts +261 -0
  417. package/src/prover/smt/solver/sat/pb-solver.ts +1577 -0
  418. package/src/prover/smt/solver/sat/probing.ts +170 -0
  419. package/src/prover/smt/solver/sat/sat-tactic.ts +44 -0
  420. package/src/prover/smt/solver/sat/sat2goal.ts +165 -0
  421. package/src/prover/smt/solver/sat/scc.ts +142 -0
  422. package/src/prover/smt/solver/sat/simplifier.ts +1618 -0
  423. package/src/prover/smt/solver/sat/solver.ts +2105 -0
  424. package/src/prover/smt/solver/sat/var-queue.ts +117 -0
  425. package/src/prover/smt/solver/sat/watch-list.ts +140 -0
  426. package/src/prover/smt/solver/search-tree.ts +284 -0
  427. package/src/prover/smt/solver/seq-axioms.ts +995 -0
  428. package/src/prover/smt/solver/seq-decl-plugin.ts +819 -0
  429. package/src/prover/smt/solver/seq-derive.ts +1298 -0
  430. package/src/prover/smt/solver/seq-eq-approx.ts +236 -0
  431. package/src/prover/smt/solver/seq-eq-solver.ts +439 -0
  432. package/src/prover/smt/solver/seq-factory.ts +89 -0
  433. package/src/prover/smt/solver/seq-monadic.ts +730 -0
  434. package/src/prover/smt/solver/seq-range-predicate.ts +235 -0
  435. package/src/prover/smt/solver/seq-re-rewriter.ts +1171 -0
  436. package/src/prover/smt/solver/seq-re-util.ts +758 -0
  437. package/src/prover/smt/solver/seq-regex-bisim.ts +144 -0
  438. package/src/prover/smt/solver/seq-regex-live.ts +200 -0
  439. package/src/prover/smt/solver/seq-rewriter.ts +2404 -0
  440. package/src/prover/smt/solver/seq-skolem.ts +294 -0
  441. package/src/prover/smt/solver/seq-subset.ts +165 -0
  442. package/src/prover/smt/solver/seq-view-witness.ts +353 -0
  443. package/src/prover/smt/solver/smt-consequences.ts +297 -0
  444. package/src/prover/smt/solver/smt-kernel.ts +90 -0
  445. package/src/prover/smt/solver/smt-logics.ts +66 -0
  446. package/src/prover/smt/solver/smt-setup.ts +496 -0
  447. package/src/prover/smt/solver/smt2-printer.ts +765 -0
  448. package/src/prover/smt/solver/smtlib-parser.ts +3154 -326
  449. package/src/prover/smt/solver/smtlib-script.ts +1702 -0
  450. package/src/prover/smt/solver/solve-eqs.ts +923 -0
  451. package/src/prover/smt/solver/solver.ts +113 -22
  452. package/src/prover/smt/solver/static-features.ts +314 -0
  453. package/src/prover/smt/solver/sticky-generations.ts +0 -1
  454. package/src/prover/smt/solver/tactic.ts +1995 -0
  455. package/src/prover/smt/solver/term-enumeration.ts +205 -0
  456. package/src/prover/smt/solver/theory-array.ts +1240 -0
  457. package/src/prover/smt/solver/theory-bv.ts +1200 -0
  458. package/src/prover/smt/solver/theory-char.ts +355 -0
  459. package/src/prover/smt/solver/theory-datatype.ts +598 -0
  460. package/src/prover/smt/solver/theory-finite-set.ts +30 -0
  461. package/src/prover/smt/solver/theory-fpa.ts +389 -0
  462. package/src/prover/smt/solver/theory-lra-axioms.ts +53 -2
  463. package/src/prover/smt/solver/theory-lra-bounds.ts +31 -5
  464. package/src/prover/smt/solver/theory-lra-final-check.ts +56 -71
  465. package/src/prover/smt/solver/theory-lra-internalize.ts +89 -11
  466. package/src/prover/smt/solver/theory-lra-model.ts +20 -35
  467. package/src/prover/smt/solver/theory-lra-propagate.ts +24 -28
  468. package/src/prover/smt/solver/theory-lra-state.ts +6 -22
  469. package/src/prover/smt/solver/theory-lra.ts +188 -2
  470. package/src/prover/smt/solver/theory-pb.ts +933 -0
  471. package/src/prover/smt/solver/theory-polymorphism.ts +58 -0
  472. package/src/prover/smt/solver/theory-recfun.ts +307 -0
  473. package/src/prover/smt/solver/theory-seq-regex.ts +867 -0
  474. package/src/prover/smt/solver/theory-seq-solve.ts +1373 -0
  475. package/src/prover/smt/solver/theory-seq-state.ts +852 -0
  476. package/src/prover/smt/solver/theory-seq.ts +961 -0
  477. package/src/prover/smt/solver/theory.ts +189 -0
  478. package/src/prover/smt/solver/tseitin-cnf.ts +485 -0
  479. package/src/prover/smt/solver/var-subst.ts +36 -14
  480. package/src/prover/smt/table.ts +3 -2
  481. package/src/prover/smt/types.ts +146 -0
  482. package/src/prover/tlapm/cache.ts +29 -8
  483. package/src/prover/tlapm-library.ts +3208 -0
  484. package/src/prover/verdict.ts +2 -0
  485. package/src/prover/zenon/decide.ts +10 -7
  486. package/src/prover/zenon/encode.ts +0 -2
  487. package/src/prover/zenon/eqrel.ts +0 -2
  488. package/src/prover/zenon/equality-rules.ts +24 -2
  489. package/src/prover/zenon/expr.ts +21 -2
  490. package/src/prover/zenon/index-table.ts +7 -4
  491. package/src/prover/zenon/isar-case.ts +1 -3
  492. package/src/prover/zenon/isar.ts +2 -4
  493. package/src/prover/zenon/llproof.ts +0 -2
  494. package/src/prover/zenon/mltoll.ts +0 -2
  495. package/src/prover/zenon/node.ts +20 -5
  496. package/src/prover/zenon/parse.ts +6 -2
  497. package/src/prover/zenon/phrase.ts +1 -3
  498. package/src/prover/zenon/proof.ts +0 -2
  499. package/src/prover/zenon/propositional-rules.ts +0 -2
  500. package/src/prover/zenon/rules.ts +2 -3
  501. package/src/prover/zenon/search.ts +7 -5
  502. package/src/prover/zenon/tla/functions.ts +0 -2
  503. package/src/prover/zenon/tla/llproof.ts +0 -2
  504. package/src/prover/zenon/tla/records.ts +0 -2
  505. package/src/prover/zenon/tla/rewrites.ts +0 -2
  506. package/src/prover/zenon/tla/sets.ts +7 -8
  507. package/src/prover/zenon/tla/terms.ts +0 -2
  508. package/src/prover/zenon/tla/tla.ts +0 -2
  509. package/src/resolve.ts +72 -36
  510. package/src/runtime.ts +6 -0
  511. package/src/sany/generation.ts +1 -13
  512. package/src/sany/generator-definitions.ts +1 -1
  513. package/src/sany/generator-expressions.ts +9 -17
  514. package/src/sany/generator-proofs.ts +1 -1
  515. package/src/sany/generator.ts +1 -1
  516. package/src/sany/levels.ts +0 -2
  517. package/src/sany/linter.ts +0 -2
  518. package/src/search.ts +198 -45
  519. package/src/simulate.ts +3 -0
  520. package/src/standard-definitions.ts +4 -0
  521. package/src/state-graph.ts +0 -2
  522. package/src/subexpressions.ts +4 -2
  523. package/src/successors.ts +1 -1
  524. package/src/symmetry.ts +2 -2
  525. package/src/tableau.ts +2 -2
  526. package/src/tlc/fingerprint.ts +81 -9
  527. package/src/tlc/jar-data.ts +12 -0
  528. package/src/tlc/order.ts +14 -3
  529. package/src/tlc/summary.ts +29 -14
  530. package/src/tlc/tlcext-operators.ts +61 -16
  531. package/src/tlc/trace-spec.ts +2 -3
  532. package/src/typed-tier.ts +6541 -0
  533. package/src/typescript/types.ts +2 -2
  534. package/src/values.ts +1 -1
  535. package/src/prover/isabelle/isar/statement.ts +0 -52
  536. package/src/prover/smt/solver/z3-license.txt +0 -10
  537. package/src/prover/tlaps-module.ts +0 -510
  538. package/src/prover/zenon/LICENSE +0 -32
@@ -1,15 +1,9 @@
1
- import { TlaUnsupportedError } from "../../errors";
1
+ import { TlaError, TlaProverError, TlaUnsupportedError } from "../../errors";
2
2
  import { normalizeApply, shiftExpr } from "../../obligations/substitution";
3
- import type { Bound, Builtin, Expr, Sequent } from "../../obligations/expression";
3
+ import type { Bound, Builtin, Expr, Hyp, Sequent } from "../../obligations/expression";
4
+ import { getNumeral } from "./axioms";
4
5
  import { createContext, type Identifier } from "./context";
5
- import {
6
- createFlattener,
7
- getDepth,
8
- getVariable,
9
- removeUnprimable,
10
- UNPRIMABLE,
11
- type Entry,
12
- } from "./flatten";
6
+ import { createFlattener, getDepth, removeUnprimable, UNPRIMABLE, type Entry } from "./flatten";
13
7
  import {
14
8
  BOOL_SET,
15
9
  BUILTIN_SYMBOLS,
@@ -20,18 +14,21 @@ import {
20
14
  disjoin,
21
15
  FUN_APP,
22
16
  FUN_EXCEPT,
17
+ FUN_ISAFCN,
23
18
  FUN_SET,
24
19
  getBinders,
20
+ getVariable,
21
+ getVariableSort,
25
22
  INT_LTEQ,
26
23
  INT_SET,
27
24
  MEM,
28
25
  NAT_SET,
26
+ PROJ_INT,
29
27
  STR_SET,
30
28
  SUBSET_EQ,
31
29
  tla,
32
30
  TT_IDV,
33
31
  } from "./format";
34
- import { getIntegers } from "./axioms";
35
32
  import { getEquality, resolveTriggers, type Polarity } from "./extensionality";
36
33
  import {
37
34
  getChooseAxioms,
@@ -40,17 +37,38 @@ import {
40
37
  getSetOfAxioms,
41
38
  getSetStAxioms,
42
39
  } from "./instances";
40
+ import {
41
+ BOOL,
42
+ getSort,
43
+ getTypeName,
44
+ IDV,
45
+ INT,
46
+ isSameType,
47
+ searchType,
48
+ STRING,
49
+ type Type,
50
+ } from "./types";
43
51
 
44
52
  interface Term {
45
53
  isBool: boolean;
46
54
  text: string;
47
55
  integer?: string;
56
+ type?: Type;
48
57
  }
49
58
 
50
59
  export interface EncodingSession {
51
60
  caseErrors: number;
52
61
  }
53
62
 
63
+ // The options of Smtlib.preprocess that tlapm's --debug flags set.
64
+ export interface SmtEncoding {
65
+ isArithmetic: boolean;
66
+ rewriteLevel: number;
67
+ isSetExtensional: boolean;
68
+ // Type level 2, which --debug smarter_types turns on.
69
+ isTyped: boolean;
70
+ }
71
+
54
72
  export interface Mode {
55
73
  isOmitted: boolean;
56
74
  polarity: Polarity;
@@ -59,8 +77,15 @@ export interface Mode {
59
77
  }
60
78
 
61
79
  export type Binding =
62
- | { kind: "constant"; symbol: string }
63
- | { kind: "variable"; name: string; symbol: string; primed: string }
80
+ | { kind: "constant"; symbol: string; type?: Type }
81
+ | {
82
+ kind: "variable";
83
+ name: string;
84
+ symbol: string;
85
+ primed: string;
86
+ type?: Type;
87
+ primedType?: Type;
88
+ }
64
89
  | { kind: "operator"; symbol: string; arity: number }
65
90
  | { kind: "secondOrder"; name: string; shapes: number[] }
66
91
  | { kind: "unsupported"; reason: string };
@@ -72,9 +97,11 @@ export interface Env {
72
97
 
73
98
  export interface Encoder {
74
99
  session: EncodingSession;
100
+ encoding: SmtEncoding;
75
101
  flattener: ReturnType<typeof createFlattener>;
76
102
  anonymous: Map<string, number>;
77
103
  recordFields: Map<string, string[]>;
104
+ setTypes: Map<string, Type>;
78
105
  context: ReturnType<typeof createContext>;
79
106
  declared: Map<string, Identifier>;
80
107
  }
@@ -85,6 +112,64 @@ interface NestedContext {
85
112
  wrappers: ((body: string) => string)[];
86
113
  }
87
114
 
115
+ const UNSUPPORTED_OPERANDS = new Set<Builtin>([
116
+ "Prime",
117
+ "StrongPrime",
118
+ "Leadsto",
119
+ "ENABLED",
120
+ "UNCHANGED",
121
+ "Cdot",
122
+ "Actplus",
123
+ "BoxTrue",
124
+ "BoxFalse",
125
+ "Diamond",
126
+ "Divides",
127
+ "Irregular",
128
+ ]);
129
+
130
+ const ARITHMETIC = new Set<Builtin>(["Plus", "Minus", "Times", "Uminus"]);
131
+
132
+ const getSetType = (element: Type): Type => ({ kind: "Set", element });
133
+
134
+ const getRecordFieldType = (type: Type, field: string) =>
135
+ type.kind === "Record" ? type.fields.find((entry) => entry.name === field)?.type : undefined;
136
+
137
+ const getFieldType = (type: Type, field: string) =>
138
+ type.kind === "Fun" && type.domain.kind === "String"
139
+ ? type.range
140
+ : getRecordFieldType(type, field);
141
+
142
+ const getComponentType = (type: Type, args: Expr[]) => {
143
+ if (args.length !== 1) return undefined;
144
+ const arg = args[0];
145
+ if (arg.kind === "String") return getRecordFieldType(type, arg.value);
146
+ return arg.kind === "Num" && arg.fraction === "" && type.kind === "Product"
147
+ ? type.items[Number(arg.integer) - 1]
148
+ : undefined;
149
+ };
150
+
151
+ const getBuiltinType = (builtin: Builtin, types: Type[]): Type | undefined => {
152
+ const first = types[0];
153
+ switch (builtin) {
154
+ case "Range":
155
+ return getSetType(INT);
156
+ case "Cup":
157
+ case "Cap":
158
+ case "Setminus":
159
+ return first.kind === "Set" && isSameType(first, types[1]) ? first : undefined;
160
+ case "UNION":
161
+ return first.kind === "Set" && first.element.kind === "Set" ? first.element : undefined;
162
+ case "SUBSET":
163
+ return first.kind === "Set" ? getSetType(first) : undefined;
164
+ case "DOMAIN":
165
+ if (first.kind === "Fun") return getSetType(first.domain);
166
+ if (first.kind === "Product") return getSetType(INT);
167
+ return first.kind === "Record" ? getSetType(STRING) : undefined;
168
+ default:
169
+ return undefined;
170
+ }
171
+ };
172
+
88
173
  const toBool = (term: Term) =>
89
174
  term.isBool ? term.text : `(= ${resolveTriggers(term.text, true)} ${TT_IDV})`;
90
175
 
@@ -93,7 +178,37 @@ const toIdv = (term: Term) =>
93
178
 
94
179
  const wrapBool = (text: string): Term => ({ isBool: true, text });
95
180
 
96
- const wrapIdv = (text: string): Term => ({ isBool: false, text });
181
+ const wrapIdv = (text: string, type?: Type): Term => ({ isBool: false, text, type });
182
+
183
+ const wrapInteger = (text: string): Term => ({
184
+ isBool: false,
185
+ text: `(${CAST_INT} ${text})`,
186
+ integer: text,
187
+ });
188
+
189
+ const getTypedOnly = (encoder: Encoder, type: Type | undefined) =>
190
+ encoder.encoding.isTyped ? type : undefined;
191
+
192
+ const getType = (term: Term) =>
193
+ term.isBool ? BOOL : term.integer === undefined ? (term.type ?? IDV) : INT;
194
+
195
+ const getTyped = (symbol: string, type: Type | undefined) => {
196
+ if (type?.kind === "Int") return wrapInteger(symbol);
197
+ return type?.kind === "Bool" ? wrapBool(symbol) : wrapIdv(symbol, type);
198
+ };
199
+
200
+ // Type.Synthesize marks a component of a tuple or record as projected into its type, and only
201
+ // Int has a projection at type level 2. tlapm leaves a Bool component an Idv it then uses as a
202
+ // Bool, so it stays an individual here.
203
+ const project = (text: string, type: Type) => {
204
+ if (type.kind === "Int") return { isBool: false, text, integer: `(${PROJ_INT} ${text})` };
205
+ return wrapIdv(text, type.kind === "Bool" ? undefined : type);
206
+ };
207
+
208
+ const getElementType = (term: Term) => {
209
+ const type = getType(term);
210
+ return type.kind === "Set" ? type.element : undefined;
211
+ };
97
212
 
98
213
  const getBinding = (env: Env | undefined, index: number): Binding => {
99
214
  const found = Array.from({ length: index - 1 }).reduce<Env | undefined>(
@@ -106,6 +221,57 @@ const getBinding = (env: Env | undefined, index: number): Binding => {
106
221
 
107
222
  export const push = (env: Env | undefined, binding: Binding): Env => ({ binding, rest: env });
108
223
 
224
+ const inferType = (
225
+ encoder: Encoder,
226
+ expression: Expr,
227
+ env: Env | undefined,
228
+ mode: Mode,
229
+ depth: number,
230
+ ) => {
231
+ const inner = Array.from({ length: depth }).reduce<Env | undefined>(
232
+ (current) => push(current, { kind: "unsupported", reason: "a declaration without a type" }),
233
+ env,
234
+ );
235
+ try {
236
+ return getType(
237
+ encode(
238
+ createEncoder({ caseErrors: encoder.session.caseErrors }, encoder.encoding),
239
+ expression,
240
+ inner,
241
+ mode,
242
+ ),
243
+ );
244
+ } catch (error) {
245
+ if (error instanceof TlaError) return undefined;
246
+ throw error;
247
+ }
248
+ };
249
+
250
+ // The type a later hypothesis gives a declaration with no domain, which the env doesn't bind yet.
251
+ // A primed variable has no index of its own, so the hypotheses name it.
252
+ export const searchDeclarationType = (
253
+ encoder: Encoder,
254
+ expression: Expr,
255
+ isPositive: boolean,
256
+ env: Env | undefined,
257
+ mode: Mode,
258
+ primed?: string,
259
+ ) =>
260
+ encoder.encoding.isTyped
261
+ ? searchType(
262
+ {
263
+ infer: (inner, depth) =>
264
+ inferType(encoder, inner, env, mode, primed === undefined ? depth + 1 : depth),
265
+ isTarget: (inner, depth) =>
266
+ primed === undefined
267
+ ? inner.kind === "Ix" && inner.index === depth + 1
268
+ : inner.kind === "Opaque" && inner.name === primed,
269
+ },
270
+ isPositive,
271
+ expression,
272
+ )
273
+ : undefined;
274
+
109
275
  const getFree = (text: string, depth: number) =>
110
276
  [...new Set(text.match(/[^\s()]+#\d+/g))]
111
277
  .filter((variable) => getDepth(variable) < depth)
@@ -130,7 +296,7 @@ const invert = (mode: Mode): Mode => ({
130
296
  : "Neither",
131
297
  });
132
298
 
133
- export const encodeIdv = (encoder: Encoder, expression: Expr, env: Env | undefined, mode: Mode) =>
299
+ const encodeIdv = (encoder: Encoder, expression: Expr, env: Env | undefined, mode: Mode) =>
134
300
  toIdv(encode(encoder, expression, env, clearPolarity(mode)));
135
301
 
136
302
  export const encodeBool = (encoder: Encoder, expression: Expr, env: Env | undefined, mode: Mode) =>
@@ -144,7 +310,9 @@ const encodeDomains = (encoder: Encoder, bounds: Bound[], env: Env | undefined,
144
310
  if (bound.domain.kind === "NoDomain") return [...domains, undefined];
145
311
  return [...domains, bound.domain.expression];
146
312
  }, [])
147
- .map((domain) => (domain === undefined ? undefined : encodeIdv(encoder, domain, env, mode)));
313
+ .map((domain) =>
314
+ domain === undefined ? undefined : encode(encoder, domain, env, clearPolarity(mode)),
315
+ );
148
316
 
149
317
  const getDomains = (
150
318
  encoder: Encoder,
@@ -158,15 +326,64 @@ const getDomains = (
158
326
  return domain;
159
327
  });
160
328
 
161
- const bindVariables = (names: string[], env: Env | undefined, mode: Mode) => {
162
- const variables = names.map((name, index) => getVariable(name, mode.depth + index));
329
+ const getSetResult = (encoder: Encoder, domains: Term[], getResult: (elements: Type[]) => Type) => {
330
+ const elements = domains.map(getElementType);
331
+ return encoder.encoding.isTyped && elements.every((element) => element !== undefined)
332
+ ? getResult(elements.filter((element) => element !== undefined))
333
+ : undefined;
334
+ };
335
+
336
+ const bindVariables = (
337
+ names: string[],
338
+ env: Env | undefined,
339
+ mode: Mode,
340
+ types: (Type | undefined)[] = [],
341
+ ) => {
342
+ const variables = names.map((name, index) =>
343
+ getVariable(name, mode.depth + index, getSort(types[index])),
344
+ );
163
345
  const inner = variables.reduce<Env | undefined>(
164
- (current, symbol) => push(current, { kind: "constant", symbol }),
346
+ (current, symbol, index) => push(current, { kind: "constant", symbol, type: types[index] }),
165
347
  env,
166
348
  );
167
349
  return { variables, env: inner, mode: { ...mode, depth: mode.depth + names.length } };
168
350
  };
169
351
 
352
+ // Type.Synthesize types a variable bounded by a set of type Set(t) as a t. A Ditto has the
353
+ // previous domain, though tlapm types it without a cast in its membership, or as Set(t) itself
354
+ // when t isn't atomic, so Z3 rejects either. A variable with no domain gets the type a hypothesis
355
+ // in the rest of the quantifier gives it.
356
+ const getBoundTypes = (
357
+ encoder: Encoder,
358
+ expression: Extract<Expr, { kind: "Quant" }>,
359
+ domains: (Term | undefined)[],
360
+ env: Env | undefined,
361
+ mode: Mode,
362
+ ) =>
363
+ expression.bounds.reduce<{ types: (Type | undefined)[]; last: Type | undefined }>(
364
+ (state, bound, index) => {
365
+ const domain = domains[index];
366
+ const next = (type: Type | undefined) => ({ types: [...state.types, type], last: type });
367
+ if (bound.domain.kind === "Domain" && domain !== undefined)
368
+ return next(getElementType(domain));
369
+ if (bound.domain.kind === "Ditto" && state.last !== undefined) return next(state.last);
370
+ const rest = expression.bounds.slice(index + 1);
371
+ const scope = rest.length === 0 ? expression.body : { ...expression, bounds: rest };
372
+ const names = expression.bounds.slice(0, index).map((innerBound) => innerBound.name);
373
+ const outer = bindVariables(names, env, mode, state.types);
374
+ return next(
375
+ searchDeclarationType(
376
+ encoder,
377
+ scope,
378
+ expression.quantifier === "Forall",
379
+ outer.env,
380
+ outer.mode,
381
+ ),
382
+ );
383
+ },
384
+ { types: [], last: undefined },
385
+ ).types;
386
+
170
387
  const encodeQuantifier = (
171
388
  encoder: Encoder,
172
389
  expression: Extract<Expr, { kind: "Quant" }>,
@@ -174,27 +391,38 @@ const encodeQuantifier = (
174
391
  mode: Mode,
175
392
  ) => {
176
393
  const domains = encodeDomains(encoder, expression.bounds, env, mode);
394
+ const types = encoder.encoding.isTyped
395
+ ? getBoundTypes(encoder, expression, domains, env, mode)
396
+ : [];
177
397
  const bound = bindVariables(
178
398
  expression.bounds.map((innerBound) => innerBound.name),
179
399
  env,
180
400
  mode,
401
+ types,
181
402
  );
182
403
  const body = encodeBool(encoder, expression.body, bound.env, bound.mode);
183
- const guards = bound.variables.flatMap((variable, index) =>
184
- domains[index] === undefined ? [] : [`(${MEM} ${variable} ${domains[index]})`],
185
- );
404
+ const guards = bound.variables.flatMap((variable, index) => {
405
+ const domain = domains[index];
406
+ if (domain === undefined) return [];
407
+ return [`(${MEM} ${toIdv(getTyped(variable, types[index]))} ${toIdv(domain)})`];
408
+ });
186
409
  return expression.quantifier === "Forall"
187
410
  ? `(forall (${getBinders(bound.variables)}) ${guards.length === 0 ? body : `(=> ${conjoin(guards)} ${body})`})`
188
411
  : `(exists (${getBinders(bound.variables)}) ${conjoin([...guards, body])})`;
189
412
  };
190
413
 
414
+ const getSorts = (count: number, free: string[]) => [
415
+ ...Array.from({ length: count }, () => "Idv"),
416
+ ...free.map((variable) => getVariableSort(variable) ?? "Idv"),
417
+ ];
418
+
191
419
  const encodeSetSt = (
192
420
  encoder: Encoder,
193
421
  expression: Extract<Expr, { kind: "SetSt" }>,
194
422
  env: Env | undefined,
195
423
  mode: Mode,
196
424
  ) => {
197
- const domain = encodeIdv(encoder, expression.domain, env, mode);
425
+ const domain = encode(encoder, expression.domain, env, clearPolarity(mode));
198
426
  const bound = bindVariables([expression.name], env, clearPolarity(mode));
199
427
  const body = encodeBool(encoder, expression.body, bound.env, bound.mode);
200
428
  const free = getFree(body, mode.depth);
@@ -203,11 +431,16 @@ const encodeSetSt = (
203
431
  body,
204
432
  mode,
205
433
  (name) => getSetStAxioms(name, free, body, bound.variables[0]),
206
- free.length + 1,
434
+ getSorts(1, free),
435
+ );
436
+ return wrapIdv(
437
+ call(symbol, [toIdv(domain), ...free]),
438
+ getSetResult(encoder, [domain], (elements) => getSetType(elements[0])),
207
439
  );
208
- return wrapIdv(call(symbol, [domain, ...free]));
209
440
  };
210
441
 
442
+ // At type level 2 tlapm also gives a set of values the types Standardize rejects, so it encodes
443
+ // none.
211
444
  const encodeSetOf = (
212
445
  encoder: Encoder,
213
446
  expression: Extract<Expr, { kind: "SetOf" }>,
@@ -220,50 +453,78 @@ const encodeSetOf = (
220
453
  env,
221
454
  clearPolarity(mode),
222
455
  );
223
- const element = encodeIdv(encoder, expression.element, bound.env, bound.mode);
224
- const free = getFree(element, mode.depth);
456
+ const element = encode(encoder, expression.element, bound.env, clearPolarity(bound.mode));
457
+ const text = toIdv(element);
458
+ const free = getFree(text, mode.depth);
225
459
  const count = domains.length;
226
460
  const symbol = encoder.flattener.flatten(
227
461
  `SetOf_${count}`,
228
- element,
462
+ text,
229
463
  mode,
230
- (name) => getSetOfAxioms(name, free, element, bound.variables),
231
- count + free.length,
464
+ (name) => getSetOfAxioms(name, free, text, bound.variables),
465
+ getSorts(count, free),
466
+ );
467
+ return wrapIdv(
468
+ call(symbol, [...domains.map(toIdv), ...free]),
469
+ getSetResult(encoder, domains, () => getSetType(getType(element))),
232
470
  );
233
- return wrapIdv(call(symbol, [...domains, ...free]));
234
471
  };
235
472
 
473
+ // tlapm binds the components of a function of several arguments in a LET. It builds every
474
+ // component from Ix 1, which inside the LET is the previous component, doesn't shift the body past
475
+ // the tuple, and indexes the tuple with untyped numbers that no axiom relates to the tuple's, so
476
+ // this binds each component to its typed index.
236
477
  const encodeFunction = (
237
478
  encoder: Encoder,
238
479
  expression: Extract<Expr, { kind: "Fcn" }>,
239
480
  env: Env | undefined,
240
481
  mode: Mode,
241
482
  ) => {
242
- const domains = getDomains(encoder, expression.bounds, env, mode, "a function");
483
+ const terms = getDomains(encoder, expression.bounds, env, mode, "a function");
484
+ const domains = terms.map(toIdv);
243
485
  const domain =
244
486
  domains.length === 1 ? domains[0] : call(tla(`Product_${domains.length}`), domains);
245
487
  const variable = getVariable(domains.length === 1 ? expression.bounds[0].name : "x", mode.depth);
246
488
  const inner = { ...clearPolarity(mode), depth: mode.depth + 1 };
247
- const bodyEnv =
248
- domains.length === 1
249
- ? push(env, { kind: "constant", symbol: variable })
250
- : getIntegers(domains.length).reduce<Env | undefined>(
251
- (current, key) =>
252
- push(current, { kind: "constant", symbol: `(${FUN_APP} ${variable} ${key})` }),
253
- env,
254
- );
255
- const body = encodeIdv(encoder, expression.body, bodyEnv, inner);
256
- const free = getFree(body, mode.depth);
489
+ const components = bindVariables(
490
+ domains.length === 1 ? [] : expression.bounds.map((bound) => bound.name),
491
+ env,
492
+ inner,
493
+ );
494
+ const term = encode(
495
+ encoder,
496
+ expression.body,
497
+ domains.length === 1 ? push(env, { kind: "constant", symbol: variable }) : components.env,
498
+ clearPolarity(components.mode),
499
+ );
500
+ const body = toIdv(term);
501
+ const definitions = components.variables.map(
502
+ (component, index) =>
503
+ `(${component} (${FUN_APP} ${variable} ${getNumeral(index + 1, encoder.encoding.isArithmetic)}))`,
504
+ );
505
+ // Smtlib prints the definitions of a LET last first, and N_axiomatize visits them in order.
506
+ const value =
507
+ domains.length === 1 ? body : `(let (${definitions.toReversed().join(" ")}) ${body})`;
508
+ const free = getFree(value, mode.depth);
257
509
  const symbol = encoder.flattener.flatten(
258
510
  "FunFcn",
259
- body,
511
+ domains.length === 1 ? body : `(let (${definitions.join(" ")}) ${body})`,
260
512
  mode,
261
- (name, axioms) => getFunctionAxioms(name, free, body, variable, axioms),
262
- free.length + 1,
513
+ (name, axioms) => getFunctionAxioms(name, free, value, variable, axioms),
514
+ getSorts(1, free),
515
+ );
516
+ return wrapIdv(
517
+ call(symbol, [domain, ...free]),
518
+ getSetResult(encoder, terms, (elements) => ({
519
+ kind: "Fun",
520
+ domain: elements.length === 1 ? elements[0] : { kind: "Product", items: elements },
521
+ range: getType(term),
522
+ })),
263
523
  );
264
- return wrapIdv(call(symbol, [domain, ...free]));
265
524
  };
266
525
 
526
+ // At type level 2 tlapm sorts the variable of a CHOOSE over a set of type Set(Int) as an Int in
527
+ // its body but an Idv in ChooseDef, which Z3 rejects, so it stays an Idv.
267
528
  const encodeChoose = (
268
529
  encoder: Encoder,
269
530
  expression: Extract<Expr, { kind: "Choose" }>,
@@ -282,24 +543,35 @@ const encodeChoose = (
282
543
  body,
283
544
  mode,
284
545
  (name) => getChooseAxioms(name, free, body, variable),
285
- free.length,
546
+ getSorts(0, free),
286
547
  );
287
548
  return wrapIdv(call(symbol, free));
288
549
  };
289
550
 
551
+ // Type.Synthesize compares values of the same type in their own sort only above type level 1,
552
+ // and Standardize triggers set extensionality on any equality of two sets of one type.
290
553
  const encodeEquality = (
291
554
  encoder: Encoder,
292
555
  args: Expr[],
293
556
  env: Env | undefined,
294
557
  mode: Mode,
295
558
  isNegated: boolean,
296
- ) =>
297
- getEquality(
298
- encodeIdv(encoder, args[0], env, mode),
299
- encodeIdv(encoder, args[1], env, mode),
300
- mode.polarity,
301
- isNegated,
302
- );
559
+ ) => {
560
+ const left = encode(encoder, args[0], env, clearPolarity(mode));
561
+ const right = encode(encoder, args[1], env, clearPolarity(mode));
562
+ const type = getType(left);
563
+ const polarity = encoder.encoding.isSetExtensional ? mode.polarity : undefined;
564
+ if (!encoder.encoding.isTyped || !isSameType(type, getType(right)))
565
+ return getEquality(toIdv(left), toIdv(right), polarity, isNegated);
566
+ if (type.kind === "Int" || type.kind === "Bool") {
567
+ const operands = [left, right].map((term) => term.integer ?? term.text).join(" ");
568
+ return isNegated ? `(distinct ${operands})` : `(= ${operands})`;
569
+ }
570
+ if (type.kind !== "Set") return getEquality(left.text, right.text, polarity, isNegated);
571
+ const name = `TrigEq_${getTypeName(type)}`;
572
+ encoder.setTypes.set(name, type);
573
+ return getEquality(left.text, right.text, polarity, isNegated, tla(name));
574
+ };
303
575
 
304
576
  const getSelectionTest = (encoder: Encoder, test: Expr, env: Env | undefined, mode: Mode) => {
305
577
  const lambda = test.kind === "Lambda" && test.params.length === 1 ? test : undefined;
@@ -324,7 +596,8 @@ const encodeBuiltin = (
324
596
  env: Env | undefined,
325
597
  mode: Mode,
326
598
  ): Term => {
327
- const encodeArgs = () => args.map((arg) => encodeIdv(encoder, arg, env, mode));
599
+ const getTerms = () => args.map((arg) => encode(encoder, arg, env, clearPolarity(mode)));
600
+ const encodeArgs = () => getTerms().map(toIdv);
328
601
  switch (builtin) {
329
602
  case "Conj":
330
603
  return wrapBool(conjoin(args.map((arg) => encodeBool(encoder, arg, env, mode))));
@@ -351,15 +624,20 @@ const encodeBuiltin = (
351
624
  case "Subseteq":
352
625
  return wrapBool(call(SUBSET_EQ, encodeArgs()));
353
626
  case "Lteq":
354
- return wrapBool(call(INT_LTEQ, encodeArgs()));
355
627
  case "Gteq":
356
- return wrapBool(call(INT_LTEQ, encodeArgs().toReversed()));
357
628
  case "Lt":
358
629
  case "Gt": {
630
+ const terms = getTerms();
631
+ const integers = terms.flatMap((term) => (term.integer === undefined ? [] : [term.integer]));
632
+ if (encoder.encoding.isTyped && integers.length === 2)
633
+ return wrapBool(call(tla(`TInt${builtin}`), integers));
634
+ const order = (operands: string[]) =>
635
+ builtin === "Lteq" || builtin === "Lt" ? operands : operands.toReversed();
636
+ const operands = order(terms.map(toIdv));
637
+ if (builtin === "Lteq" || builtin === "Gteq") return wrapBool(call(INT_LTEQ, operands));
359
638
  // Rewrite copies the operands before Flatten, which flattens each copy again.
360
- const getOperands = () => (builtin === "Lt" ? encodeArgs() : encodeArgs().toReversed());
361
639
  return wrapBool(
362
- `(and ${call(INT_LTEQ, getOperands())} (distinct ${getOperands().join(" ")}))`,
640
+ `(and ${call(INT_LTEQ, operands)} (distinct ${order(encodeArgs()).join(" ")}))`,
363
641
  );
364
642
  }
365
643
  case "SelectSeq": {
@@ -369,8 +647,9 @@ const encodeBuiltin = (
369
647
  "SelectSeq",
370
648
  test.body,
371
649
  mode,
372
- (name) => getSelectSeqAxioms(name, free, test.body, test.variable),
373
- free.length + 1,
650
+ (name) =>
651
+ getSelectSeqAxioms(name, free, test.body, test.variable, encoder.encoding.isArithmetic),
652
+ getSorts(1, free),
374
653
  );
375
654
  return wrapIdv(call(symbol, [encodeIdv(encoder, args[0], env, mode), ...free]));
376
655
  }
@@ -380,8 +659,18 @@ const encodeBuiltin = (
380
659
  }
381
660
  default: {
382
661
  const symbol = BUILTIN_SYMBOLS[builtin];
383
- if (symbol === undefined) throw new TlaUnsupportedError(`the operator ${builtin}`);
384
- return wrapIdv(call(symbol, encodeArgs()));
662
+ if (symbol === undefined)
663
+ throw new TlaProverError(
664
+ UNSUPPORTED_OPERANDS.has(builtin)
665
+ ? `Type.Synthesize: Unsupported builtin ${builtin.startsWith("Box") ? "Box" : builtin}`
666
+ : "Type.Synthesize: Unexpected left operand",
667
+ );
668
+ const terms = getTerms();
669
+ if (!encoder.encoding.isTyped) return wrapIdv(call(symbol, terms.map(toIdv)));
670
+ const integers = terms.flatMap((term) => (term.integer === undefined ? [] : [term.integer]));
671
+ if (ARITHMETIC.has(builtin) && integers.length === terms.length)
672
+ return wrapInteger(call(tla(`TInt${builtin}`), integers));
673
+ return wrapIdv(call(symbol, terms.map(toIdv)), getBuiltinType(builtin, terms.map(getType)));
385
674
  }
386
675
  }
387
676
  };
@@ -397,8 +686,10 @@ const encodeReference = (
397
686
  case "constant":
398
687
  case "variable":
399
688
  if (args.length > 0) throw new TlaUnsupportedError(`an applied ${binding.kind}`);
400
- return wrapIdv(binding.symbol);
689
+ return getTyped(binding.symbol, binding.type);
401
690
  case "operator":
691
+ if (args.length === 0 && binding.arity > 0)
692
+ throw new TlaProverError("Type.Synthesize: Impossible operator conversion");
402
693
  if (args.length !== binding.arity)
403
694
  throw new TlaUnsupportedError("an operator applied to the wrong number of arguments");
404
695
  return wrapIdv(
@@ -440,7 +731,7 @@ const encodeReference = (
440
731
  higherOrder.join(" "),
441
732
  mode,
442
733
  () => [],
443
- firstOrder.length + free.length,
734
+ getSorts(firstOrder.length, free),
444
735
  binding.name,
445
736
  );
446
737
  return wrapIdv(call(symbol, [...firstOrder, ...free]));
@@ -450,11 +741,11 @@ const encodeReference = (
450
741
  }
451
742
  };
452
743
 
453
- const getPrimed = (env: Env | undefined, name: string): string => {
744
+ const getPrimed = (env: Env | undefined, name: string): Term => {
454
745
  if (!env) throw new TlaUnsupportedError(`a primed declaration that isn't a variable`);
455
746
  const binding = env.binding;
456
747
  return binding.kind === "variable" && binding.name === name
457
- ? binding.primed
748
+ ? getTyped(binding.primed, binding.primedType)
458
749
  : getPrimed(env.rest, name);
459
750
  };
460
751
 
@@ -464,9 +755,12 @@ const encodeOpaque = (
464
755
  args: Expr[],
465
756
  env: Env | undefined,
466
757
  mode: Mode,
467
- ) => {
758
+ ): Term => {
759
+ // Rewrite.simplify_sets writes IsAFcn for the functions in a set of functions.
760
+ if (name === "IsAFcn" && args.length === 1)
761
+ return wrapBool(`(${FUN_ISAFCN} ${encodeIdv(encoder, args[0], env, mode)})`);
468
762
  if (args.length === 0 && name.endsWith("#prime"))
469
- return wrapIdv(getPrimed(env, name.slice(0, -"#prime".length)));
763
+ return getPrimed(env, name.slice(0, -"#prime".length));
470
764
  const anonymousName = args.length === 0 ? `Anon_OPAQUE_${name}` : `Anon_${name}`;
471
765
  encoder.anonymous.set(anonymousName, args.length);
472
766
  return wrapIdv(
@@ -522,10 +816,10 @@ const encodeCase = (
522
816
  const other: Term = expression.other
523
817
  ? encode(encoder, expression.other, env, mode)
524
818
  : wrapIdv(getCaseError(encoder));
525
- const isBool = other.isBool && bodies.every((body) => body.isBool);
526
- const isInteger =
527
- other.integer !== undefined && bodies.every((body) => body.integer !== undefined);
528
- if (isInteger) {
819
+ const type = getType(other);
820
+ const isUniform = bodies.every((body) => isSameType(getType(body), type));
821
+ const isBool = isUniform && type.kind === "Bool";
822
+ if (isUniform && type.kind === "Int") {
529
823
  const integer = expression.arms.reduceRight(
530
824
  (rest, arm, index) =>
531
825
  `(ite ${encodeBool(encoder, arm.condition, env, clearPolarity(mode))} ${bodies[index].integer} ${rest})`,
@@ -539,7 +833,29 @@ const encodeCase = (
539
833
  `(ite ${encodeBool(encoder, arm.condition, env, mode)} ${convert(bodies[index])} ${rest})`,
540
834
  convert(other),
541
835
  );
542
- return { isBool, text };
836
+ return { isBool, text, type: isUniform ? other.type : undefined };
837
+ };
838
+
839
+ // Type.Synthesize types a NEW constant by its visible domain, or else by a hypothesis in the rest
840
+ // of the sequent. The guard is its membership in the domain the encoding asserts.
841
+ export const declareConstant = (
842
+ encoder: Encoder,
843
+ hyp: Extract<Hyp, { kind: "Fresh" }>,
844
+ guarded: Expr | undefined,
845
+ rest: Sequent,
846
+ env: Env | undefined,
847
+ mode: Mode,
848
+ ) => {
849
+ const domain = guarded && encode(encoder, guarded, env, clearPolarity(mode));
850
+ const type =
851
+ domain !== undefined && hyp.domainVisibility === "Visible"
852
+ ? getElementType(domain)
853
+ : searchDeclarationType(encoder, { kind: "Sequent", sequent: rest }, true, env, mode);
854
+ return {
855
+ type,
856
+ getGuard: (symbol: string) =>
857
+ domain && `(${MEM} ${toIdv(getTyped(symbol, type))} ${toIdv(domain)})`,
858
+ };
543
859
  };
544
860
 
545
861
  const encodeSequent = (
@@ -549,7 +865,7 @@ const encodeSequent = (
549
865
  mode: Mode,
550
866
  ): string => {
551
867
  const steps = sequent.context.reduce<NestedContext>(
552
- (state, hyp) => {
868
+ (state, hyp, index) => {
553
869
  switch (hyp.kind) {
554
870
  case "Fresh": {
555
871
  if (hyp.shape > 0) {
@@ -563,16 +879,18 @@ const encodeSequent = (
563
879
  }
564
880
  if (hyp.level !== "Constant")
565
881
  throw new TlaUnsupportedError("a NEW declaration that isn't constant");
566
- const domain = hyp.domain && encodeIdv(encoder, hyp.domain, state.env, state.mode);
567
- const bound = bindVariables([hyp.name], state.env, state.mode);
882
+ const rest = { context: sequent.context.slice(index + 1), active: sequent.active };
883
+ const declared = declareConstant(encoder, hyp, hyp.domain, rest, state.env, state.mode);
884
+ const bound = bindVariables([hyp.name], state.env, state.mode, [declared.type]);
568
885
  const variable = bound.variables[0];
569
- const guard = domain && `(${MEM} ${variable} ${domain})`;
886
+ const guard = declared.getGuard(variable);
570
887
  return {
571
888
  env: bound.env,
572
889
  mode: bound.mode,
573
890
  wrappers: [
574
891
  ...state.wrappers,
575
- (body) => `(forall ((${variable} Idv)) ${guard ? `(=> ${guard} ${body})` : body})`,
892
+ (body) =>
893
+ `(forall (${getBinders([variable])}) ${guard ? `(=> ${guard} ${body})` : body})`,
576
894
  ],
577
895
  };
578
896
  }
@@ -610,15 +928,20 @@ const encode = (encoder: Encoder, expression: Expr, env: Env | undefined, mode:
610
928
  case "FALSE":
611
929
  return wrapBool("false");
612
930
  case "BOOLEAN":
613
- return wrapIdv(BOOL_SET);
931
+ return wrapIdv(BOOL_SET, getTypedOnly(encoder, getSetType(BOOL)));
614
932
  case "STRING":
615
- return wrapIdv(STR_SET);
933
+ return wrapIdv(STR_SET, getTypedOnly(encoder, getSetType(STRING)));
616
934
  case "Nat":
617
- return wrapIdv(NAT_SET);
935
+ return wrapIdv(NAT_SET, getTypedOnly(encoder, getSetType(INT)));
618
936
  case "Int":
619
- return wrapIdv(INT_SET);
937
+ return wrapIdv(INT_SET, getTypedOnly(encoder, getSetType(INT)));
938
+ case "Real":
939
+ case "Infinity":
940
+ throw new TlaProverError(
941
+ `Encode.Standardize: Unexpected builtin '${expression.builtin}'`,
942
+ );
620
943
  default:
621
- throw new TlaUnsupportedError(`the operator ${expression.builtin}`);
944
+ throw new TlaProverError("Type.Synthesize: Unexpected builtin");
622
945
  }
623
946
  case "Apply": {
624
947
  const operator = expression.operator;
@@ -651,9 +974,12 @@ const encode = (encoder: Encoder, expression: Expr, env: Env | undefined, mode:
651
974
  const integer = `(ite ${resolveTriggers(condition, true)} ${consequent.integer} ${alternative.integer})`;
652
975
  return { isBool: false, text: `(${CAST_INT} ${integer})`, integer };
653
976
  }
654
- return consequent.isBool && alternative.isBool
655
- ? wrapBool(`(ite ${condition} ${consequent.text} ${alternative.text})`)
656
- : wrapIdv(`(ite ${condition} ${toIdv(consequent)} ${toIdv(alternative)})`);
977
+ if (consequent.isBool && alternative.isBool)
978
+ return wrapBool(`(ite ${condition} ${consequent.text} ${alternative.text})`);
979
+ return wrapIdv(
980
+ `(ite ${condition} ${toIdv(consequent)} ${toIdv(alternative)})`,
981
+ isSameType(getType(consequent), getType(alternative)) ? consequent.type : undefined,
982
+ );
657
983
  }
658
984
  case "List": {
659
985
  const items = expression.items.map((item) => encodeBool(encoder, item, env, mode));
@@ -669,67 +995,103 @@ const encode = (encoder: Encoder, expression: Expr, env: Env | undefined, mode:
669
995
  return encodeSetSt(encoder, expression, env, mode);
670
996
  case "SetOf":
671
997
  return encodeSetOf(encoder, expression, env, mode);
672
- case "SetEnum":
998
+ case "SetEnum": {
999
+ const elements = expression.elements.map((element) =>
1000
+ encode(encoder, element, env, clearPolarity(mode)),
1001
+ );
1002
+ const types = elements.map(getType);
673
1003
  return wrapIdv(
674
- call(
675
- tla(`SetEnum_${expression.elements.length}`),
676
- expression.elements.map((element) => encodeIdv(encoder, element, env, mode)),
1004
+ call(tla(`SetEnum_${elements.length}`), elements.map(toIdv)),
1005
+ getTypedOnly(
1006
+ encoder,
1007
+ types.every((type) => isSameType(type, types[0] ?? IDV))
1008
+ ? getSetType(types[0] ?? IDV)
1009
+ : undefined,
677
1010
  ),
678
1011
  );
679
- case "Product":
1012
+ }
1013
+ case "Product": {
1014
+ const factors = expression.factors.map((factor) =>
1015
+ encode(encoder, factor, env, clearPolarity(mode)),
1016
+ );
680
1017
  return wrapIdv(
681
- call(
682
- tla(`Product_${expression.factors.length}`),
683
- expression.factors.map((factor) => encodeIdv(encoder, factor, env, mode)),
684
- ),
1018
+ call(tla(`Product_${factors.length}`), factors.map(toIdv)),
1019
+ getSetResult(encoder, factors, (items) => getSetType({ kind: "Product", items })),
1020
+ );
1021
+ }
1022
+ case "Tuple": {
1023
+ const elements = expression.elements.map((element) =>
1024
+ encode(encoder, element, env, clearPolarity(mode)),
685
1025
  );
686
- case "Tuple":
687
1026
  return wrapIdv(
688
- call(
689
- tla(`Tuple_${expression.elements.length}`),
690
- expression.elements.map((element) => encodeIdv(encoder, element, env, mode)),
691
- ),
1027
+ call(tla(`Tuple_${elements.length}`), elements.map(toIdv)),
1028
+ getTypedOnly(encoder, { kind: "Product", items: elements.map(getType) }),
692
1029
  );
1030
+ }
693
1031
  case "Fcn":
694
1032
  return encodeFunction(encoder, expression, env, mode);
695
1033
  case "FcnApp": {
696
- const encodedFunction = encodeIdv(encoder, expression.function, env, mode);
1034
+ const encodedFunction = encode(encoder, expression.function, env, clearPolarity(mode));
697
1035
  const args = expression.args.map((arg) => encodeIdv(encoder, arg, env, mode));
698
1036
  const argument = args.length === 1 ? args[0] : call(tla(`Tuple_${args.length}`), args);
699
- return wrapIdv(`(${FUN_APP} ${encodedFunction} ${argument})`);
1037
+ const text = `(${FUN_APP} ${toIdv(encodedFunction)} ${argument})`;
1038
+ const component = getTypedOnly(
1039
+ encoder,
1040
+ getComponentType(getType(encodedFunction), expression.args),
1041
+ );
1042
+ return component === undefined ? wrapIdv(text) : project(text, component);
700
1043
  }
701
- case "Arrow":
1044
+ case "Arrow": {
1045
+ const sets = [expression.domain, expression.range].map((set) =>
1046
+ encode(encoder, set, env, clearPolarity(mode)),
1047
+ );
702
1048
  return wrapIdv(
703
- call(FUN_SET, [
704
- encodeIdv(encoder, expression.domain, env, mode),
705
- encodeIdv(encoder, expression.range, env, mode),
706
- ]),
1049
+ call(FUN_SET, sets.map(toIdv)),
1050
+ getSetResult(encoder, sets, (elements) =>
1051
+ getSetType({ kind: "Fun", domain: elements[0], range: elements[1] }),
1052
+ ),
707
1053
  );
1054
+ }
708
1055
  case "Record":
709
1056
  case "Rect": {
710
1057
  const names = expression.fields.map((field) => field.name);
711
1058
  const suffix = names.join("_");
712
1059
  encoder.recordFields.set(`Record_${suffix}`, names);
713
1060
  encoder.recordFields.set(`RecordSet_${suffix}`, names);
1061
+ const values = expression.fields.map((field) =>
1062
+ encode(encoder, field.value, env, clearPolarity(mode)),
1063
+ );
1064
+ // Type.Synthesize types a set of records only at type level 3.
1065
+ const type: Type = {
1066
+ kind: "Record",
1067
+ fields: names.map((name, index) => ({ name, type: getType(values[index]) })),
1068
+ };
714
1069
  return wrapIdv(
715
1070
  call(
716
1071
  tla(`${expression.kind === "Record" ? "Record" : "RecordSet"}_${suffix}`),
717
- expression.fields.map((field) => encodeIdv(encoder, field.value, env, mode)),
1072
+ values.map(toIdv),
718
1073
  ),
1074
+ expression.kind === "Record" ? getTypedOnly(encoder, type) : undefined,
719
1075
  );
720
1076
  }
721
1077
  case "Except":
722
1078
  return wrapIdv(encodeExcept(encoder, expression, env, mode));
723
- case "Dot":
724
- return wrapIdv(
725
- `(${FUN_APP} ${encodeIdv(encoder, expression.expression, env, mode)} ${tla(`StrLit_${expression.field}`)})`,
726
- );
1079
+ case "Dot": {
1080
+ const record = encode(encoder, expression.expression, env, clearPolarity(mode));
1081
+ const text = `(${FUN_APP} ${toIdv(record)} ${tla(`StrLit_${expression.field}`)})`;
1082
+ const component = getTypedOnly(encoder, getFieldType(getType(record), expression.field));
1083
+ return component === undefined ? wrapIdv(text) : project(text, component);
1084
+ }
727
1085
  case "Case":
728
1086
  return encodeCase(encoder, expression, env, mode);
729
1087
  case "String":
730
- return wrapIdv(tla(`StrLit_${expression.value}`));
1088
+ return wrapIdv(tla(`StrLit_${expression.value}`), getTypedOnly(encoder, STRING));
731
1089
  case "Num":
732
1090
  if (expression.fraction !== "") throw new TlaUnsupportedError("a real number");
1091
+ // Deviation from tlapm: its int_of_string fails the obligation for a literal above 2^62 - 1.
1092
+ // Type.Synthesize gives a number no type when arithmetic is off.
1093
+ if (!encoder.encoding.isArithmetic)
1094
+ return wrapIdv(tla(`IntLit_${BigInt(expression.integer)}`));
733
1095
  return {
734
1096
  isBool: false,
735
1097
  text: `(${CAST_INT} ${BigInt(expression.integer)})`,
@@ -741,7 +1103,10 @@ const encode = (encoder: Encoder, expression: Expr, env: Env | undefined, mode:
741
1103
  case "Tquant":
742
1104
  case "Tsub":
743
1105
  case "Fair":
744
- throw new TlaUnsupportedError("a temporal formula");
1106
+ throw new TlaProverError("Backend.Smtlib: Unsupported expression");
1107
+ case "Lambda":
1108
+ case "Bang":
1109
+ throw new TlaProverError(`Type.Synthesize: Unexpected ${expression.kind} constructor`);
745
1110
  default:
746
1111
  throw new TlaUnsupportedError(`the expression ${expression.kind}`);
747
1112
  }
@@ -752,11 +1117,13 @@ export const getEntries = (encoder: Encoder, line: string): Entry[] => [
752
1117
  removeUnprimable(resolveTriggers(line, false)),
753
1118
  ];
754
1119
 
755
- export const createEncoder = (session: EncodingSession): Encoder => ({
1120
+ export const createEncoder = (session: EncodingSession, encoding: SmtEncoding): Encoder => ({
756
1121
  session,
1122
+ encoding,
757
1123
  flattener: createFlattener(),
758
1124
  anonymous: new Map(),
759
1125
  recordFields: new Map(),
1126
+ setTypes: new Map(),
760
1127
  context: createContext(),
761
1128
  declared: new Map(),
762
1129
  });