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
@@ -8,21 +8,26 @@ import {
8
8
  } from "../../obligations/expression";
9
9
  import { compareStrings } from "../ocaml";
10
10
  import { createPrinter } from "./context";
11
+ import { simplifySets } from "./simplify";
12
+ import { layOutCommand } from "./layout";
11
13
  import { getSymbolSpec, type CollectState, type SymbolSpec } from "./data";
12
14
  import type { Entry } from "./flatten";
13
- import { declare, getTlaName, MEM } from "./format";
15
+ import { declare, getTlaName, NATIVE_OPERATORS, replaceTokens } from "./format";
16
+ import { getSort } from "./types";
14
17
  import {
15
18
  createEncoder,
19
+ declareConstant,
16
20
  encodeBool,
17
- encodeIdv,
18
21
  getEntries,
19
22
  getUniqueName,
20
23
  push,
24
+ searchDeclarationType,
21
25
  type Binding,
22
26
  type Encoder,
23
27
  type EncodingSession,
24
28
  type Env,
25
29
  type Mode,
30
+ type SmtEncoding,
26
31
  } from "./rewrite";
27
32
  import { compareAxioms, getAxiomKey, type Axiom } from "./table";
28
33
 
@@ -77,8 +82,11 @@ const sortRecordFields = (expression: Expr): Expr =>
77
82
 
78
83
  const collectSymbols = (entries: Entry[], encoder: Encoder) => {
79
84
  const state: CollectState = {
85
+ encoding: encoder.encoding,
80
86
  recordFields: encoder.recordFields,
87
+ setTypes: encoder.setTypes,
81
88
  strings: [],
89
+ integers: [],
82
90
  isFunConstr: false,
83
91
  isFunSet: false,
84
92
  isExcept: false,
@@ -143,32 +151,56 @@ interface EncodedContext {
143
151
  entries: Entry[];
144
152
  }
145
153
 
146
- const encodeContext = (context: Hyp[], encoder: Encoder) =>
147
- context.reduce<EncodedContext>(
148
- (state, hyp) => {
154
+ const encodeContext = (sequent: Sequent, encoder: Encoder) =>
155
+ sequent.context.reduce<EncodedContext>(
156
+ (state, hyp, index) => {
149
157
  const extend = (binding: Binding, entries: Entry[] = []) => ({
150
158
  env: push(state.env, binding),
151
159
  entries: [...state.entries, ...entries],
152
160
  });
161
+ const rest: Expr = {
162
+ kind: "Sequent",
163
+ sequent: { context: sequent.context.slice(index + 1), active: sequent.active },
164
+ };
153
165
  switch (hyp.kind) {
154
166
  case "Fresh": {
155
167
  const symbol = getUniqueName(encoder, hyp.name);
156
- const binding: Binding =
157
- hyp.shape === 0
158
- ? { kind: "constant", symbol }
159
- : { kind: "operator", symbol, arity: hyp.shape };
160
- const declaration = declare(symbol, hyp.shape);
161
- if (!hyp.domain || hyp.domainVisibility === "Hidden")
162
- return extend(binding, [declaration]);
163
- const fact = `(assert (${MEM} ${symbol} ${encodeIdv(encoder, hyp.domain, state.env, HYPOTHESIS)}))`;
164
- return extend(binding, [declaration, ...getEntries(encoder, fact)]);
168
+ if (hyp.shape > 0)
169
+ return extend({ kind: "operator", symbol, arity: hyp.shape }, [
170
+ declare(symbol, hyp.shape),
171
+ ]);
172
+ const declared = declareConstant(
173
+ encoder,
174
+ hyp,
175
+ hyp.domainVisibility === "Visible" ? hyp.domain : undefined,
176
+ rest.sequent,
177
+ state.env,
178
+ HYPOTHESIS,
179
+ );
180
+ const binding: Binding = { kind: "constant", symbol, type: declared.type };
181
+ const declaration = declare(symbol, 0, getSort(declared.type));
182
+ const guard = declared.getGuard(symbol);
183
+ if (guard === undefined) return extend(binding, [declaration]);
184
+ return extend(binding, [declaration, ...getEntries(encoder, `(assert ${guard})`)]);
165
185
  }
186
+ // Rewrite.elim_flex declares a variable and then its primed copy, so the hypotheses after
187
+ // it type both.
166
188
  case "Flex": {
167
189
  const symbol = getUniqueName(encoder, hyp.name);
168
190
  const primed = getUniqueName(encoder, `${hyp.name}_prime`);
169
- return extend({ kind: "variable", name: hyp.name, symbol, primed }, [
170
- declare(symbol, 0),
171
- declare(primed, 0),
191
+ const type = searchDeclarationType(encoder, rest, true, state.env, HYPOTHESIS);
192
+ const variable: Binding = { kind: "variable", name: hyp.name, symbol, primed, type };
193
+ const primedType = searchDeclarationType(
194
+ encoder,
195
+ rest,
196
+ true,
197
+ push(state.env, variable),
198
+ HYPOTHESIS,
199
+ `${hyp.name}#prime`,
200
+ );
201
+ return extend({ ...variable, primedType }, [
202
+ declare(symbol, 0, getSort(type)),
203
+ declare(primed, 0, getSort(primedType)),
172
204
  ]);
173
205
  }
174
206
  case "Defn": {
@@ -176,7 +208,9 @@ const encodeContext = (context: Hyp[], encoder: Encoder) =>
176
208
  if (isExpanded(hyp))
177
209
  return extend({ kind: "unsupported", reason: "an expanded definition" });
178
210
  if (definition.kind === "Instance")
179
- return extend({ kind: "unsupported", reason: "an instance" });
211
+ return extend({ kind: "unsupported", reason: "an instance" }, [
212
+ `; omitted declaration of '${definition.name}' (missing type)`,
213
+ ]);
180
214
  if (definition.kind === "Recursive") {
181
215
  const symbol = getUniqueName(encoder, `CONSTANT_${definition.name}_`);
182
216
  return extend({ kind: "operator", symbol, arity: definition.shape }, [
@@ -188,19 +222,29 @@ const encodeContext = (context: Hyp[], encoder: Encoder) =>
188
222
  const body = definition.body;
189
223
  const params = body.kind === "Lambda" ? body.params : [];
190
224
  if (params.some((param) => param.shape > 0))
191
- return extend({
192
- kind: "secondOrder",
193
- name: definition.name,
194
- shapes: params.map((param) => param.shape),
195
- });
225
+ return extend(
226
+ {
227
+ kind: "secondOrder",
228
+ name: definition.name,
229
+ shapes: params.map((param) => param.shape),
230
+ },
231
+ [`; omitted declaration of '${definition.name}' (second-order)`],
232
+ );
196
233
  const symbol = getUniqueName(encoder, definition.name);
234
+ // Type.Synthesize types a hidden constant definition as it types a NEW constant.
235
+ const type =
236
+ hyp.visibility === "Hidden" && body.kind !== "Lambda"
237
+ ? searchDeclarationType(encoder, rest, true, state.env, HYPOTHESIS)
238
+ : undefined;
239
+ if (type !== undefined)
240
+ return extend({ kind: "constant", symbol, type }, [declare(symbol, 0, getSort(type))]);
197
241
  return extend({ kind: "operator", symbol, arity: params.length }, [
198
242
  declare(symbol, params.length),
199
243
  ]);
200
244
  }
201
245
  case "Fact": {
202
246
  const binding: Binding = { kind: "unsupported", reason: "a reference to a fact" };
203
- if (hyp.visibility === "Hidden") return extend(binding);
247
+ if (hyp.visibility === "Hidden") return extend(binding, ["; hidden fact"]);
204
248
  const isOmitted = isSecondOrder(hyp.expression);
205
249
  const entries = getEntries(
206
250
  encoder,
@@ -209,7 +253,12 @@ const encodeContext = (context: Hyp[], encoder: Encoder) =>
209
253
  return extend(
210
254
  binding,
211
255
  isOmitted
212
- ? entries.map((entry) => (typeof entry === "string" ? { omitted: entry } : entry))
256
+ ? [
257
+ ...entries.map((entry) =>
258
+ typeof entry === "string" ? { omitted: entry } : entry,
259
+ ),
260
+ "; omitted fact (second-order)",
261
+ ]
213
262
  : entries,
214
263
  );
215
264
  }
@@ -218,39 +267,54 @@ const encodeContext = (context: Hyp[], encoder: Encoder) =>
218
267
  { env: undefined, entries: [] },
219
268
  );
220
269
 
221
- export const encodeSmt = (prepared: Sequent, session: EncodingSession) => {
270
+ interface SmtHeader {
271
+ version: string;
272
+ id: number;
273
+ location: string;
274
+ logic: string;
275
+ }
276
+
277
+ export const encodeSmt = (
278
+ prepared: Sequent,
279
+ session: EncodingSession,
280
+ header: SmtHeader,
281
+ encoding: SmtEncoding,
282
+ ) => {
222
283
  const simplified = sortRecordFields(
223
284
  simplifyRecordEqualities({ kind: "Sequent", sequent: prepared }),
224
285
  );
225
- const sequent = simplified.kind === "Sequent" ? simplified.sequent : prepared;
226
- const encoder = createEncoder(session);
227
- const context = encodeContext(sequent.context, encoder);
286
+ const sequent = simplifySets(
287
+ simplified.kind === "Sequent" ? simplified.sequent : prepared,
288
+ encoding.rewriteLevel,
289
+ );
290
+ const encoder = createEncoder(session, encoding);
291
+ const context = encodeContext(sequent, encoder);
228
292
  const goal = isSecondOrder(sequent.active)
229
293
  ? []
230
294
  : getEntries(
231
295
  encoder,
232
296
  `(assert (! (not ${encodeBool(encoder, sequent.active, context.env, { ...HYPOTHESIS, polarity: "Positive" })}) :named |Goal|))`,
233
297
  );
234
- const entries = [...context.entries, ...goal];
235
298
  const resolve = createPrinter(encoder.declared);
236
- const collected = collectSymbols(entries, encoder);
299
+ const collected = collectSymbols([...context.entries, ...goal], encoder);
237
300
  const declarations = [...collected.symbols]
238
301
  .toSorted((left, right) => compareStrings(left[0], right[0]))
239
302
  .flatMap((symbol) => (symbol[1].declaration === undefined ? [] : [symbol[1].declaration]));
240
303
  const axioms = [...collected.axioms.values()]
241
304
  .toSorted(compareAxioms)
242
- .flatMap((entry) =>
243
- entry.formula === undefined ? [] : [`(assert (! ${entry.formula} :named |${entry.label}|))`],
305
+ .map((entry) =>
306
+ entry.formula === undefined
307
+ ? "; omitted fact (second-order)"
308
+ : `(assert (! ${entry.formula} :named |${entry.label}|))`,
244
309
  );
245
310
  const keys = new Set(collected.axioms.keys());
246
- const lines = [
247
- ...declarations,
248
- ...axioms,
249
- ...entries.flatMap((entry) => {
311
+ const getLines = (entries: Entry[]) =>
312
+ entries.flatMap((entry) => {
250
313
  if (typeof entry === "string") return [entry];
251
314
  return "omitted" in entry ? [] : entry.getLines(keys);
252
- }),
253
- ];
315
+ });
316
+ const hypotheses = [...declarations, ...axioms, ...getLines(context.entries)];
317
+ const lines = [...hypotheses, ...getLines(goal)];
254
318
  const isIdvUsed =
255
319
  lines.some((line) => /\bIdv\b/.test(line)) ||
256
320
  sequent.context.some(
@@ -259,8 +323,23 @@ export const encodeSmt = (prepared: Sequent, session: EncodingSession) => {
259
323
  (hyp.definition.kind === "Operator" || hyp.definition.kind === "Recursive") &&
260
324
  !isExpanded(hyp),
261
325
  );
262
- return ["(set-logic UFNIA)", ...(isIdvUsed ? ["(declare-sort Idv 0)"] : []), ...lines]
263
- .map(resolve)
264
- .concat("(check-sat)", "(exit)")
265
- .join("\n");
326
+ const printCommand = (line: string) => {
327
+ if (line.startsWith(";")) return line;
328
+ const command = layOutCommand(replaceTokens(resolve(line), NATIVE_OPERATORS));
329
+ const name = /:named \|([^|]*)\|\)\)$/.exec(line)?.[1];
330
+ if (name === undefined) return command;
331
+ return `;; ${name === "Goal" ? name : `Axiom: ${name}`}\n${command}`;
332
+ };
333
+ return [
334
+ `;; TLA+ Proof Manager ${header.version}\n`,
335
+ `;; Proof obligation #${header.id}\n`,
336
+ `;; Generated from ${header.location}\n\n`,
337
+ `(set-logic ${header.logic})\n\n`,
338
+ ";; Sorts\n\n",
339
+ isIdvUsed ? "(declare-sort Idv 0)\n" : "",
340
+ "\n;; Hypotheses\n\n",
341
+ hypotheses.length === 0 ? "\n" : "",
342
+ ...lines.map((line) => `${printCommand(line)}\n\n`),
343
+ "(check-sat)\n(exit)\n",
344
+ ].join("");
266
345
  };
@@ -42,12 +42,14 @@ export const resolveTriggers = (text: string, isTriggered: boolean): string => {
42
42
  export const getEquality = (
43
43
  left: string,
44
44
  right: string,
45
- polarity: Polarity,
45
+ polarity: Polarity | undefined,
46
46
  isNegated: boolean,
47
+ setTrigger?: string,
47
48
  ) => {
48
- const triggered = `(${TRIG_EQ} ${left} ${right})`;
49
+ const triggered = `(${setTrigger ?? TRIG_EQ} ${left} ${right})`;
49
50
  const kept = isNegated ? `(distinct ${left} ${right})` : `(= ${left} ${right})`;
50
- if (!isSetTerm(left) && !isSetTerm(right)) return kept;
51
+ if (polarity === undefined || (setTrigger === undefined && !isSetTerm(left) && !isSetTerm(right)))
52
+ return kept;
51
53
  const text = isNegated ? `(not ${triggered})` : triggered;
52
54
  return polarity === (isNegated ? "Positive" : "Negative")
53
55
  ? `(${UNRESOLVED_TRIGGER} ${text} ${kept})`
@@ -1,4 +1,4 @@
1
- import { declare, formatName, getClosing } from "./format";
1
+ import { formatName, getClosing } from "./format";
2
2
  import type { Axiom } from "./table";
3
3
 
4
4
  export interface Flattened {
@@ -14,8 +14,6 @@ interface OmittedFact {
14
14
 
15
15
  export type Entry = string | Flattened | OmittedFact;
16
16
 
17
- export const getVariable = (name: string, depth: number) => `${name}#${depth}`;
18
-
19
17
  export const getDepth = (variable: string) => Number(variable.slice(variable.lastIndexOf("#") + 1));
20
18
 
21
19
  export const UNPRIMABLE = "?unprimable";
@@ -32,7 +30,7 @@ export const removeUnprimable = (text: string): string => {
32
30
  };
33
31
 
34
32
  const getFlatKey = (text: string, depth: number) =>
35
- /\((forall|exists|ite) /.test(text)
33
+ /\((forall|exists|ite|let) /.test(text)
36
34
  ? undefined
37
35
  : text.replace(/[^\s()]+#(\d+)/g, (_match, found: string) =>
38
36
  Number(found) < depth ? "#" : `#${Number(found) - depth}`,
@@ -54,7 +52,7 @@ export const createFlattener = () => {
54
52
  visit: string,
55
53
  site: Site,
56
54
  getAxioms: (symbol: string, axioms: Set<string>) => Axiom[],
57
- arity: number,
55
+ sorts: string[],
58
56
  name = `TLA__${kind}`,
59
57
  ) => {
60
58
  if (site.isOmitted) {
@@ -74,7 +72,7 @@ export const createFlattener = () => {
74
72
  kind,
75
73
  visit: removeUnprimable(visit),
76
74
  getLines: (axioms) => [
77
- declare(symbol, arity),
75
+ `(declare-fun ${symbol} (${sorts.join(" ")}) Idv)`,
78
76
  ...getAxioms(symbol, axioms).map(
79
77
  (entry) =>
80
78
  `(assert (! ${removeUnprimable(entry.formula ?? "")} :named |${entry.label} ${raw}|))`,
@@ -61,6 +61,8 @@ export const NAT_SET = tla("NatSet");
61
61
  export const CAST_INT = tla("Cast_Int");
62
62
  export const PROJ_INT = tla("Proj_Int");
63
63
  export const INT_LTEQ = tla("IntLteq");
64
+ export const INT_PLUS = tla("IntPlus");
65
+ export const INT_MINUS = tla("IntMinus");
64
66
  export const INT_RANGE = tla("IntRange");
65
67
  export const FUN_APP = tla("FunApp");
66
68
  export const FUN_DOM = tla("FunDom");
@@ -78,6 +80,19 @@ export const TAIL = tla("Tail");
78
80
  export const SUB_SEQ = tla("SubSeq");
79
81
  export const TUPLE_0 = tla("Tuple_0");
80
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
+
81
96
  export const BUILTIN_SYMBOLS: Partial<Record<Builtin, string>> = {
82
97
  Cup: CUP,
83
98
  Cap: CAP,
@@ -85,8 +100,8 @@ export const BUILTIN_SYMBOLS: Partial<Record<Builtin, string>> = {
85
100
  SUBSET,
86
101
  UNION,
87
102
  DOMAIN: FUN_DOM,
88
- Plus: tla("IntPlus"),
89
- Minus: tla("IntMinus"),
103
+ Plus: INT_PLUS,
104
+ Minus: INT_MINUS,
90
105
  Times: tla("IntTimes"),
91
106
  Exp: tla("IntExp"),
92
107
  Quotient: tla("IntQuotient"),
@@ -106,8 +121,14 @@ export const BUILTIN_SYMBOLS: Partial<Record<Builtin, string>> = {
106
121
  export const getNames = (prefix: string, count: number) =>
107
122
  Array.from({ length: count }, (_value, index) => `${prefix}${index + 1}`);
108
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
+
109
130
  export const getBinders = (variables: string[], sort = "Idv") =>
110
- variables.map((variable) => `(${variable} ${sort})`).join(" ");
131
+ variables.map((variable) => `(${variable} ${getVariableSort(variable) ?? sort})`).join(" ");
111
132
 
112
133
  export const forall = (
113
134
  variables: string[],
@@ -145,5 +166,8 @@ export const getClosing = (text: string, from: number) => {
145
166
  return text.length;
146
167
  };
147
168
 
169
+ export const replaceTokens = (text: string, replacements: Map<string, string>) =>
170
+ text.replace(/[^\s()]+/g, (found) => replacements.get(found) ?? found);
171
+
148
172
  export const replaceToken = (text: string, token: string, replacement: string) =>
149
- text.replace(/[^\s()]+/g, (found) => (found === token ? replacement : found));
173
+ replaceTokens(text, new Map([[token, replacement]]));
@@ -9,6 +9,7 @@ import {
9
9
  FUN_SET,
10
10
  getBinders,
11
11
  getNames,
12
+ INT_LTEQ,
12
13
  IS_SET_OF,
13
14
  LEN,
14
15
  MEM,
@@ -127,6 +128,7 @@ export const getSelectSeqAxioms = (
127
128
  free: string[],
128
129
  body: string,
129
130
  variable: string,
131
+ isArithmetic: boolean,
130
132
  ) => {
131
133
  const select = (sequence: string) => call(name, [sequence, ...free]);
132
134
  const test = (term: string) => replaceToken(body, variable, term);
@@ -144,7 +146,11 @@ export const getSelectSeqAxioms = (
144
146
  [],
145
147
  forall(
146
148
  [...free, "s"],
147
- `(=> (${MEM} (${LEN} s) ${NAT_SET}) (<= (${PROJ_INT} (${LEN} ${select("s")})) (${PROJ_INT} (${LEN} s))))`,
149
+ `(=> (${MEM} (${LEN} s) ${NAT_SET}) ${
150
+ isArithmetic
151
+ ? `(<= (${PROJ_INT} (${LEN} ${select("s")})) (${PROJ_INT} (${LEN} s)))`
152
+ : `(${INT_LTEQ} (${LEN} ${select("s")}) (${LEN} s))`
153
+ })`,
148
154
  [[select("s")]],
149
155
  ),
150
156
  ),
@@ -0,0 +1,91 @@
1
+ import { format, renderDoc, text, type Doc } from "../../obligations/format";
2
+
3
+ type Sexp = string | Sexp[];
4
+
5
+ const parseSexp = (command: string): Sexp => {
6
+ const tokens = command.match(/\|[^|]*\||[()]|[^\s()|]+/g) ?? [];
7
+ const stack: Sexp[][] = [[]];
8
+ tokens.forEach((token) => {
9
+ if (token === "(") {
10
+ stack.push([]);
11
+ return;
12
+ }
13
+ if (token === ")") {
14
+ const done = stack.pop() ?? [];
15
+ stack.at(-1)?.push(done);
16
+ return;
17
+ }
18
+ stack.at(-1)?.push(token);
19
+ });
20
+ return stack[0][0];
21
+ };
22
+
23
+ const printFlat = (sexp: Sexp): string =>
24
+ typeof sexp === "string" ? sexp : `(${sexp.map(printFlat).join(" ")})`;
25
+ const printSexpr = (...docs: Doc[]): Doc => [format("@[<hov2>("), docs, format("@])")];
26
+ const printBox = (doc: Doc) => format("@[<hov0>%a@]", doc);
27
+ const printSpaced = (docs: Doc[]) =>
28
+ docs.flatMap((doc, index) => (index === 0 ? [doc] : [format("@ "), doc]));
29
+
30
+ const getList = (sexp: Sexp | undefined) => (Array.isArray(sexp) ? sexp : []);
31
+ const printAttributes = (attributes: Sexp[]): Doc[] =>
32
+ attributes.flatMap((attribute, index) => {
33
+ if (index % 2 === 1) return [];
34
+ const value = attributes[index + 1] ?? "";
35
+ return attribute === ":pattern"
36
+ ? [[text(":pattern "), printSexpr(printSpaced(getList(value).map(printTerm)))]]
37
+ : [text(`${printFlat(attribute)} ${printFlat(value)}`)];
38
+ });
39
+
40
+ const printTerm = (sexp: Sexp): Doc => printBox(printExpression(sexp));
41
+ const printExpression = (sexp: Sexp): Doc => {
42
+ if (typeof sexp === "string") return text(sexp);
43
+ const head = printFlat(sexp[0]);
44
+ const args = sexp.slice(1);
45
+ if (head === "forall" || head === "exists")
46
+ return printSexpr(
47
+ text(head),
48
+ format("@ "),
49
+ printSexpr(printSpaced(getList(args[0]).map((binding) => text(printFlat(binding))))),
50
+ format("@ "),
51
+ printTerm(args[1]),
52
+ );
53
+ if (head === "let")
54
+ return printSexpr(
55
+ text("let "),
56
+ printSexpr(
57
+ printSpaced(
58
+ getList(args[0]).map((binding) => {
59
+ const parts = getList(binding);
60
+ return [text(`(${printFlat(parts[0])} `), printExpression(parts[1]), text(")")];
61
+ }),
62
+ ),
63
+ ),
64
+ format("@ "),
65
+ printTerm(args[1]),
66
+ );
67
+ if (head === "!")
68
+ return printSexpr(
69
+ text("!"),
70
+ format("@ "),
71
+ printTerm(args[0]),
72
+ format("@ "),
73
+ printSpaced(printAttributes(args.slice(1))),
74
+ );
75
+ return printSexpr(text(head), format("@ "), printSpaced(args.map(printTerm)));
76
+ };
77
+ export const layOutCommand = (command: string) => {
78
+ const sexp = getList(parseSexp(command));
79
+ const head = sexp[0];
80
+ if (head === "declare-fun")
81
+ return renderDoc(
82
+ printSexpr(
83
+ text(`declare-fun ${printFlat(sexp[1])} (`),
84
+ printSpaced(getList(sexp[2]).map((sort) => text(printFlat(sort)))),
85
+ text(`) ${printFlat(sexp[3])}`),
86
+ ),
87
+ );
88
+ if (head === "assert")
89
+ return renderDoc(printSexpr(text("assert"), format("@ "), printTerm(sexp[1])));
90
+ return command;
91
+ };