tla-ts 0.0.9 → 0.0.10-dev.09e53c2a6

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 (625) hide show
  1. package/README.md +30 -1
  2. package/dist/compile.cjs +23 -0
  3. package/dist/compile.js +23 -0
  4. package/dist/deciders.cjs +41 -37
  5. package/dist/deciders.js +57 -53
  6. package/dist/index.cjs +1 -1
  7. package/dist/index.d.cts +109 -10
  8. package/dist/index.d.ts +109 -10
  9. package/dist/index.js +1 -1
  10. package/dist/parallel-worker.cjs +1 -1
  11. package/dist/parallel-worker.js +1 -1
  12. package/dist/prove-worker.cjs +1 -1
  13. package/dist/prove-worker.js +1 -1
  14. package/dist/prove.cjs +2746 -410
  15. package/dist/prove.js +2745 -409
  16. package/dist/run.cjs +146 -31
  17. package/dist/run.js +146 -31
  18. package/dist/tlapm.cjs +2 -2
  19. package/dist/tlapm.js +2 -2
  20. package/dist/transfer.cjs +132 -104
  21. package/dist/transfer.js +132 -104
  22. package/dist/worker.cjs +6 -6
  23. package/dist/worker.js +6 -6
  24. package/package.json +3 -1
  25. package/src/ast.ts +45 -59
  26. package/src/bags.ts +99 -102
  27. package/src/builtins.ts +28 -75
  28. package/src/bundled-modules.ts +1 -8
  29. package/src/check-failure.ts +116 -0
  30. package/src/check-trace.ts +282 -0
  31. package/src/check.ts +797 -782
  32. package/src/cli/options.ts +12 -32
  33. package/src/cli/run.ts +0 -2
  34. package/src/cli/runtime-invariants.ts +136 -0
  35. package/src/cli/shared.ts +19 -12
  36. package/src/cli/tlapm.ts +433 -82
  37. package/src/cli/tlc-arguments.ts +652 -0
  38. package/src/cli/tlc-output.ts +687 -0
  39. package/src/cli/tlc-usage.ts +360 -0
  40. package/src/cli/tlc.ts +323 -658
  41. package/src/cli/typescript.ts +23 -0
  42. package/src/cli/xml-exporter.ts +27 -49
  43. package/src/cli.ts +0 -1
  44. package/src/codegen.ts +196 -74
  45. package/src/config.ts +140 -109
  46. package/src/coverage.ts +830 -0
  47. package/src/dependencies.ts +36 -54
  48. package/src/dfid.ts +618 -0
  49. package/src/environment-config.ts +315 -0
  50. package/src/environment.ts +178 -339
  51. package/src/errors.ts +100 -57
  52. package/src/evaluate.ts +598 -340
  53. package/src/exit-codes.ts +38 -3
  54. package/src/fingerprints.ts +75 -11
  55. package/src/index.ts +3 -0
  56. package/src/instances.ts +126 -21
  57. package/src/java-hash.ts +7 -0
  58. package/src/java-overrides.ts +4 -19
  59. package/src/json-reader.ts +455 -0
  60. package/src/json.ts +252 -139
  61. package/src/levels.ts +46 -58
  62. package/src/lexer.ts +83 -101
  63. package/src/liveness-checker.ts +590 -311
  64. package/src/liveness.ts +180 -124
  65. package/src/obligations/action.ts +17 -44
  66. package/src/obligations/anonymize.ts +120 -95
  67. package/src/obligations/enabled-axioms.ts +218 -0
  68. package/src/obligations/equality.ts +1 -3
  69. package/src/obligations/expression.ts +37 -26
  70. package/src/obligations/format.ts +0 -10
  71. package/src/obligations/generate.ts +66 -64
  72. package/src/obligations/index.ts +38 -19
  73. package/src/obligations/levels.ts +27 -18
  74. package/src/obligations/module.ts +28 -55
  75. package/src/obligations/normalize.ts +30 -37
  76. package/src/obligations/operators.ts +0 -3
  77. package/src/obligations/pragma.ts +52 -24
  78. package/src/obligations/printer.ts +89 -58
  79. package/src/obligations/proof.ts +3 -6
  80. package/src/obligations/regroup.ts +0 -5
  81. package/src/obligations/simplify.ts +57 -63
  82. package/src/obligations/source.ts +119 -95
  83. package/src/obligations/subexpression.ts +49 -28
  84. package/src/obligations/substitution.ts +1 -5
  85. package/src/obligations/temporal.ts +12 -20
  86. package/src/obligations/tuples.ts +2 -10
  87. package/src/parallel-worker.ts +30 -60
  88. package/src/parallel.ts +59 -73
  89. package/src/parser.ts +1082 -399
  90. package/src/pcal/ast.ts +53 -86
  91. package/src/pcal/parse.ts +144 -219
  92. package/src/pcal/tokenize.ts +91 -131
  93. package/src/pcal/translate.ts +83 -130
  94. package/src/pcal/validate.ts +48 -68
  95. package/src/pretty-print.ts +7 -8
  96. package/src/prover/decide-pool.ts +8 -13
  97. package/src/prover/deciders.ts +12 -13
  98. package/src/prover/first-order.ts +0 -11
  99. package/src/prover/isabelle/decide.ts +3 -31
  100. package/src/prover/isabelle/encode.ts +82 -64
  101. package/src/prover/isabelle/isar/attrib.ts +250 -0
  102. package/src/prover/isabelle/isar/context.ts +335 -0
  103. package/src/prover/isabelle/isar/induct.ts +382 -0
  104. package/src/prover/isabelle/isar/inner-syntax.ts +262 -117
  105. package/src/prover/isabelle/isar/method.ts +510 -226
  106. package/src/prover/isabelle/isar/proof.ts +570 -23
  107. package/src/prover/isabelle/isar/rule-cases.ts +224 -0
  108. package/src/prover/isabelle/isar/theory.ts +488 -88
  109. package/src/prover/isabelle/isar/toplevel.ts +331 -0
  110. package/src/prover/isabelle/isar/type-check.ts +99 -38
  111. package/src/prover/isabelle/provers/blast/blast.ts +16 -105
  112. package/src/prover/isabelle/provers/blast/branch.ts +0 -33
  113. package/src/prover/isabelle/provers/blast/prove.ts +0 -36
  114. package/src/prover/isabelle/provers/blast/rules.ts +5 -45
  115. package/src/prover/isabelle/provers/blast/state.ts +1 -29
  116. package/src/prover/isabelle/provers/blast/term.ts +8 -37
  117. package/src/prover/isabelle/provers/clasimp.ts +0 -14
  118. package/src/prover/isabelle/provers/classical.ts +58 -61
  119. package/src/prover/isabelle/provers/hypsubst.ts +27 -52
  120. package/src/prover/isabelle/pure/bicompose.ts +24 -39
  121. package/src/prover/isabelle/pure/consts.ts +0 -8
  122. package/src/prover/isabelle/pure/conv.ts +2 -18
  123. package/src/prover/isabelle/pure/drule.ts +95 -45
  124. package/src/prover/isabelle/pure/envir.ts +2 -53
  125. package/src/prover/isabelle/pure/goal.ts +1 -9
  126. package/src/prover/isabelle/pure/interrupt.ts +0 -5
  127. package/src/prover/isabelle/pure/list.ts +0 -3
  128. package/src/prover/isabelle/pure/logic.ts +1 -16
  129. package/src/prover/isabelle/pure/name.ts +1 -10
  130. package/src/prover/isabelle/pure/net.ts +2 -60
  131. package/src/prover/isabelle/pure/object-logic.ts +15 -16
  132. package/src/prover/isabelle/pure/pattern.ts +1 -20
  133. package/src/prover/isabelle/pure/raw-simplifier.ts +16 -63
  134. package/src/prover/isabelle/pure/rewriter.ts +31 -74
  135. package/src/prover/isabelle/pure/search.ts +2 -11
  136. package/src/prover/isabelle/pure/seq.ts +0 -11
  137. package/src/prover/isabelle/pure/simplifier.ts +27 -16
  138. package/src/prover/isabelle/pure/table.ts +2 -33
  139. package/src/prover/isabelle/pure/tactic.ts +11 -23
  140. package/src/prover/isabelle/pure/tactical.ts +47 -48
  141. package/src/prover/isabelle/pure/term-ord.ts +1 -7
  142. package/src/prover/isabelle/pure/term.ts +1 -44
  143. package/src/prover/isabelle/pure/thm.ts +26 -48
  144. package/src/prover/isabelle/pure/type.ts +1 -16
  145. package/src/prover/isabelle/pure/unify.ts +19 -31
  146. package/src/prover/isabelle/pure/variable.ts +2 -8
  147. package/src/prover/isabelle/tla/classical-setup.ts +17 -25
  148. package/src/prover/isabelle/tla/context.ts +65 -26
  149. package/src/prover/isabelle/tla/logic-data.ts +1 -1
  150. package/src/prover/isabelle/tla/logic.ts +53 -32
  151. package/src/prover/isabelle/tla/simpdata.ts +45 -44
  152. package/src/prover/isabelle/tools/intuitionistic.ts +28 -21
  153. package/src/prover/ocaml.ts +4 -7
  154. package/src/prover/prep/action.ts +33 -66
  155. package/src/prover/prep/enabled-axioms.ts +22 -20
  156. package/src/prover/prep/fingerprint.ts +2 -21
  157. package/src/prover/prep/level-comparison.ts +8 -12
  158. package/src/prover/prep/md5.ts +0 -2
  159. package/src/prover/prep/methods.ts +189 -86
  160. package/src/prover/prep/normalize.ts +42 -37
  161. package/src/prover/prove-worker.ts +0 -2
  162. package/src/prover/prove.ts +398 -133
  163. package/src/prover/ptl/decide.ts +96 -56
  164. package/src/prover/ptl/encode.ts +15 -38
  165. package/src/prover/ptl/sat.ts +24 -32
  166. package/src/prover/ptl/tableau.ts +40 -28
  167. package/src/prover/smt/arithmetic.ts +310 -0
  168. package/src/prover/smt/axioms.ts +12 -15
  169. package/src/prover/smt/context.ts +60 -32
  170. package/src/prover/smt/data.ts +517 -401
  171. package/src/prover/smt/encode.ts +155 -85
  172. package/src/prover/smt/extensionality.ts +5 -13
  173. package/src/prover/smt/flatten.ts +7 -28
  174. package/src/prover/smt/format.ts +33 -14
  175. package/src/prover/smt/instances.ts +7 -11
  176. package/src/prover/smt/layout.ts +91 -0
  177. package/src/prover/smt/rewrite.ts +1026 -658
  178. package/src/prover/smt/simplify.ts +441 -0
  179. package/src/prover/smt/solver/ackermannize-bv-tactic.ts +61 -0
  180. package/src/prover/smt/solver/ackr-helper.ts +179 -0
  181. package/src/prover/smt/solver/ackr-model-converter.ts +105 -0
  182. package/src/prover/smt/solver/act-cache.ts +0 -16
  183. package/src/prover/smt/solver/add-bounds-tactic.ts +59 -0
  184. package/src/prover/smt/solver/aig-tactic.ts +52 -0
  185. package/src/prover/smt/solver/aig.ts +889 -0
  186. package/src/prover/smt/solver/arith-rewriter.ts +615 -53
  187. package/src/prover/smt/solver/arith-terms.ts +121 -0
  188. package/src/prover/smt/solver/array-decl-plugin.ts +175 -0
  189. package/src/prover/smt/solver/array-rewriter.ts +309 -0
  190. package/src/prover/smt/solver/array.ts +1 -3
  191. package/src/prover/smt/solver/asserted-formulas.ts +87 -58
  192. package/src/prover/smt/solver/ast-lt.ts +166 -22
  193. package/src/prover/smt/solver/ast-util.ts +160 -7
  194. package/src/prover/smt/solver/ast.ts +1424 -180
  195. package/src/prover/smt/solver/auf-solver.ts +7 -44
  196. package/src/prover/smt/solver/bit-blast-tactic.ts +582 -0
  197. package/src/prover/smt/solver/bit-blaster.ts +871 -0
  198. package/src/prover/smt/solver/bound-manager.ts +196 -0
  199. package/src/prover/smt/solver/bound-simplifier.ts +600 -0
  200. package/src/prover/smt/solver/bv-bound-chk.ts +492 -0
  201. package/src/prover/smt/solver/bv-decl-plugin.ts +338 -0
  202. package/src/prover/smt/solver/bv-divrem-bounds.ts +95 -0
  203. package/src/prover/smt/solver/bv-rewriter.ts +1901 -0
  204. package/src/prover/smt/solver/bv1-blast.ts +214 -0
  205. package/src/prover/smt/solver/bv2fpa-converter.ts +174 -0
  206. package/src/prover/smt/solver/bv2int-rewriter.ts +544 -0
  207. package/src/prover/smt/solver/bv2real-rewriter.ts +533 -0
  208. package/src/prover/smt/solver/card2bv.ts +110 -0
  209. package/src/prover/smt/solver/case-split-queue.ts +0 -10
  210. package/src/prover/smt/solver/cg-table.ts +39 -42
  211. package/src/prover/smt/solver/check-logic.ts +330 -0
  212. package/src/prover/smt/solver/clause.ts +0 -27
  213. package/src/prover/smt/solver/cofactor-elim-term-ite.ts +278 -0
  214. package/src/prover/smt/solver/conflict-resolution.ts +78 -11
  215. package/src/prover/smt/solver/context.ts +519 -175
  216. package/src/prover/smt/solver/ctx-simplify.ts +33 -50
  217. package/src/prover/smt/solver/ctx-solver-simplify.ts +122 -0
  218. package/src/prover/smt/solver/datatype-decl-plugin.ts +572 -0
  219. package/src/prover/smt/solver/datatype-rewriter.ts +82 -0
  220. package/src/prover/smt/solver/demodulator.ts +786 -0
  221. package/src/prover/smt/solver/dependent-expr-state.ts +81 -0
  222. package/src/prover/smt/solver/der.ts +39 -30
  223. package/src/prover/smt/solver/diff-neq.ts +206 -0
  224. package/src/prover/smt/solver/distribute-forall.ts +57 -0
  225. package/src/prover/smt/solver/dom-simplify.ts +511 -0
  226. package/src/prover/smt/solver/dt2bv-tactic.ts +260 -0
  227. package/src/prover/smt/solver/dyn-ack.ts +0 -11
  228. package/src/prover/smt/solver/e-matching.ts +9 -41
  229. package/src/prover/smt/solver/elim-small-bv-tactic.ts +129 -0
  230. package/src/prover/smt/solver/elim-uncnstr.ts +545 -0
  231. package/src/prover/smt/solver/enode.ts +100 -23
  232. package/src/prover/smt/solver/eq2bv-tactic.ts +218 -0
  233. package/src/prover/smt/solver/euf/arith-axioms.ts +403 -0
  234. package/src/prover/smt/solver/euf/arith-internalize.ts +653 -0
  235. package/src/prover/smt/solver/euf/arith-solver.ts +889 -0
  236. package/src/prover/smt/solver/euf/array-axioms.ts +527 -0
  237. package/src/prover/smt/solver/euf/array-internalize.ts +428 -0
  238. package/src/prover/smt/solver/euf/array-solver.ts +306 -0
  239. package/src/prover/smt/solver/euf/bv-ackerman.ts +162 -0
  240. package/src/prover/smt/solver/euf/bv-internalize.ts +748 -0
  241. package/src/prover/smt/solver/euf/bv-solver.ts +449 -0
  242. package/src/prover/smt/solver/euf/dt-solver.ts +618 -0
  243. package/src/prover/smt/solver/euf/egraph.ts +907 -0
  244. package/src/prover/smt/solver/euf/euf-solver.ts +1205 -0
  245. package/src/prover/smt/solver/euf/fpa-solver.ts +317 -0
  246. package/src/prover/smt/solver/euf/mam.ts +1050 -0
  247. package/src/prover/smt/solver/euf/q-ematch.ts +830 -0
  248. package/src/prover/smt/solver/euf/q-mbi.ts +587 -0
  249. package/src/prover/smt/solver/euf/q-model-fixer.ts +296 -0
  250. package/src/prover/smt/solver/euf/q-solver.ts +361 -0
  251. package/src/prover/smt/solver/euf/th-solver.ts +335 -0
  252. package/src/prover/smt/solver/euf/th-solvers.ts +30 -0
  253. package/src/prover/smt/solver/expr-ref.ts +0 -5
  254. package/src/prover/smt/solver/expr-safe-replace.ts +26 -7
  255. package/src/prover/smt/solver/expr2polynomial.ts +146 -0
  256. package/src/prover/smt/solver/factor.ts +141 -0
  257. package/src/prover/smt/solver/fd-solver.ts +265 -0
  258. package/src/prover/smt/solver/fingerprints.ts +15 -26
  259. package/src/prover/smt/solver/fix-dl-var.ts +148 -0
  260. package/src/prover/smt/solver/flat-literals.ts +0 -9
  261. package/src/prover/smt/solver/fm-tactic.ts +884 -0
  262. package/src/prover/smt/solver/fpa-decl-plugin.ts +618 -0
  263. package/src/prover/smt/solver/fpa-rewriter.ts +640 -0
  264. package/src/prover/smt/solver/fpa2bv-converter.ts +2249 -0
  265. package/src/prover/smt/solver/fpa2bv-rewriter.ts +348 -0
  266. package/src/prover/smt/solver/fpa2bv-tactic.ts +73 -0
  267. package/src/prover/smt/solver/goal.ts +176 -28
  268. package/src/prover/smt/solver/goal2nlsat.ts +189 -0
  269. package/src/prover/smt/solver/guard-set.ts +219 -0
  270. package/src/prover/smt/solver/hash.ts +0 -9
  271. package/src/prover/smt/solver/hashtable.ts +26 -23
  272. package/src/prover/smt/solver/inf-eps.ts +63 -0
  273. package/src/prover/smt/solver/inj-axiom.ts +101 -0
  274. package/src/prover/smt/solver/internalizer.ts +112 -132
  275. package/src/prover/smt/solver/lackr.ts +381 -0
  276. package/src/prover/smt/solver/lbool.ts +0 -2
  277. package/src/prover/smt/solver/lia2card.ts +268 -0
  278. package/src/prover/smt/solver/lia2pb.ts +154 -0
  279. package/src/prover/smt/solver/literal.ts +0 -4
  280. package/src/prover/smt/solver/logic-tactics.ts +345 -0
  281. package/src/prover/smt/solver/lp/bound-propagator.ts +7 -26
  282. package/src/prover/smt/solver/lp/constraints.ts +1 -8
  283. package/src/prover/smt/solver/lp/containers.ts +11 -30
  284. package/src/prover/smt/solver/lp/core-solver.ts +23 -29
  285. package/src/prover/smt/solver/lp/cross-nested.ts +5 -20
  286. package/src/prover/smt/solver/lp/dep-intervals.ts +6 -24
  287. package/src/prover/smt/solver/lp/dependency.ts +0 -5
  288. package/src/prover/smt/solver/lp/dioph-eq.ts +8 -103
  289. package/src/prover/smt/solver/lp/explanation.ts +0 -6
  290. package/src/prover/smt/solver/lp/gomory.ts +8 -22
  291. package/src/prover/smt/solver/lp/hnf-cutter.ts +16 -23
  292. package/src/prover/smt/solver/lp/hnf.ts +10 -28
  293. package/src/prover/smt/solver/lp/int-cube.ts +17 -39
  294. package/src/prover/smt/solver/lp/int-solver.ts +3 -35
  295. package/src/prover/smt/solver/lp/lar-solver.ts +69 -82
  296. package/src/prover/smt/solver/lp/lar-term.ts +0 -5
  297. package/src/prover/smt/solver/lp/lp-settings.ts +0 -14
  298. package/src/prover/smt/solver/lp/maximize-term.ts +76 -52
  299. package/src/prover/smt/solver/lp/nex-creator.ts +4 -28
  300. package/src/prover/smt/solver/lp/nex.ts +0 -6
  301. package/src/prover/smt/solver/lp/nla-backoff.ts +0 -5
  302. package/src/prover/smt/solver/lp/nla-basics.ts +48 -30
  303. package/src/prover/smt/solver/lp/nla-core.ts +91 -135
  304. package/src/prover/smt/solver/lp/nla-divisions.ts +31 -43
  305. package/src/prover/smt/solver/lp/nla-emonics.ts +3 -21
  306. package/src/prover/smt/solver/lp/nla-factorization.ts +0 -4
  307. package/src/prover/smt/solver/lp/nla-grobner.ts +22 -72
  308. package/src/prover/smt/solver/lp/nla-horner.ts +2 -12
  309. package/src/prover/smt/solver/lp/nla-intervals.ts +1 -12
  310. package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +15 -42
  311. package/src/prover/smt/solver/lp/nla-monotone.ts +1 -6
  312. package/src/prover/smt/solver/lp/nla-order.ts +0 -13
  313. package/src/prover/smt/solver/lp/nla-patcher.ts +3 -7
  314. package/src/prover/smt/solver/lp/nla-powers.ts +220 -0
  315. package/src/prover/smt/solver/lp/nla-tangents.ts +0 -10
  316. package/src/prover/smt/solver/lp/nla-throttle.ts +0 -6
  317. package/src/prover/smt/solver/lp/nla-transcendentals.ts +324 -0
  318. package/src/prover/smt/solver/lp/nla-types.ts +0 -12
  319. package/src/prover/smt/solver/lp/nla-var-eqs.ts +4 -26
  320. package/src/prover/smt/solver/lp/nra-solver.ts +123 -112
  321. package/src/prover/smt/solver/lp/numeric-pair.ts +0 -4
  322. package/src/prover/smt/solver/lp/pdd-interval.ts +0 -3
  323. package/src/prover/smt/solver/lp/pdd-simplifier.ts +1 -14
  324. package/src/prover/smt/solver/lp/pdd-solver.ts +2 -33
  325. package/src/prover/smt/solver/lp/pdd.ts +7 -70
  326. package/src/prover/smt/solver/lp/random-updater.ts +0 -9
  327. package/src/prover/smt/solver/lp/static-matrix.ts +8 -19
  328. package/src/prover/smt/solver/lp/union-find.ts +5 -5
  329. package/src/prover/smt/solver/macro-finder.ts +530 -0
  330. package/src/prover/smt/solver/mam-compiler.ts +129 -139
  331. package/src/prover/smt/solver/mam-interpreter.ts +0 -21
  332. package/src/prover/smt/solver/max-bv-sharing-tactic.ts +17 -0
  333. package/src/prover/smt/solver/max-cliques.ts +105 -0
  334. package/src/prover/smt/solver/maxcore.ts +309 -0
  335. package/src/prover/smt/solver/maximize-ac-sharing.ts +8 -21
  336. package/src/prover/smt/solver/maxlex.ts +115 -0
  337. package/src/prover/smt/solver/maxsmt-base.ts +105 -0
  338. package/src/prover/smt/solver/maxsmt.ts +92 -0
  339. package/src/prover/smt/solver/mbp/mbp-arith.ts +467 -0
  340. package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +101 -0
  341. package/src/prover/smt/solver/mbp/mbp-plugin.ts +287 -0
  342. package/src/prover/smt/solver/mbp/mbp-qel.ts +48 -0
  343. package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +271 -0
  344. package/src/prover/smt/solver/mbp/mbp-term-graph.ts +606 -0
  345. package/src/prover/smt/solver/model-based-opt.ts +844 -0
  346. package/src/prover/smt/solver/model-checker.ts +19 -62
  347. package/src/prover/smt/solver/model-evaluator.ts +190 -40
  348. package/src/prover/smt/solver/model-finder.ts +14 -32
  349. package/src/prover/smt/solver/model-generator.ts +56 -40
  350. package/src/prover/smt/solver/model-macro-solver.ts +60 -114
  351. package/src/prover/smt/solver/model-printer.ts +214 -0
  352. package/src/prover/smt/solver/mpf.ts +711 -0
  353. package/src/prover/smt/solver/mus.ts +51 -0
  354. package/src/prover/smt/solver/muz/dl-context.ts +404 -0
  355. package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +97 -0
  356. package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +167 -0
  357. package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +125 -0
  358. package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +299 -0
  359. package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +455 -0
  360. package/src/prover/smt/solver/muz/dl-mk-slice.ts +340 -0
  361. package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +163 -0
  362. package/src/prover/smt/solver/muz/dl-rule-set.ts +273 -0
  363. package/src/prover/smt/solver/muz/dl-rule-transformer.ts +123 -0
  364. package/src/prover/smt/solver/muz/dl-rule.ts +496 -0
  365. package/src/prover/smt/solver/muz/hnf.ts +201 -0
  366. package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +176 -0
  367. package/src/prover/smt/solver/muz/horn-tactic.ts +201 -0
  368. package/src/prover/smt/solver/muz/rule-properties.ts +337 -0
  369. package/src/prover/smt/solver/muz/spacer-context.ts +1406 -0
  370. package/src/prover/smt/solver/muz/spacer-dl-interface.ts +52 -0
  371. package/src/prover/smt/solver/muz/spacer-generalizers.ts +241 -0
  372. package/src/prover/smt/solver/muz/spacer-manager.ts +127 -0
  373. package/src/prover/smt/solver/muz/spacer-pdr.ts +218 -0
  374. package/src/prover/smt/solver/muz/spacer-prop-solver.ts +333 -0
  375. package/src/prover/smt/solver/muz/spacer-util.ts +282 -0
  376. package/src/prover/smt/solver/muz/substitution.ts +203 -0
  377. package/src/prover/smt/solver/nla2bv-tactic.ts +285 -0
  378. package/src/prover/smt/solver/nlqsat.ts +484 -0
  379. package/src/prover/smt/solver/nlsat/algebraic.ts +177 -160
  380. package/src/prover/smt/solver/nlsat/atoms.ts +24 -24
  381. package/src/prover/smt/solver/nlsat/evaluator.ts +16 -22
  382. package/src/prover/smt/solver/nlsat/explain.ts +65 -69
  383. package/src/prover/smt/solver/nlsat/interval-set.ts +9 -51
  384. package/src/prover/smt/solver/nlsat/levelwise.ts +48 -135
  385. package/src/prover/smt/solver/nlsat/mpbq.ts +47 -14
  386. package/src/prover/smt/solver/nlsat/polynomial.ts +29 -161
  387. package/src/prover/smt/solver/nlsat/solver.ts +241 -110
  388. package/src/prover/smt/solver/nlsat/transcendental-eval.ts +310 -0
  389. package/src/prover/smt/solver/nlsat/transcendentals.ts +367 -0
  390. package/src/prover/smt/solver/nlsat/types.ts +0 -9
  391. package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +1 -47
  392. package/src/prover/smt/solver/nlsat/upolynomial.ts +10 -93
  393. package/src/prover/smt/solver/nlsat-tactic.ts +82 -0
  394. package/src/prover/smt/solver/nnf.ts +107 -60
  395. package/src/prover/smt/solver/normalize-bounds.ts +53 -0
  396. package/src/prover/smt/solver/occf.ts +97 -0
  397. package/src/prover/smt/solver/opt-context.ts +787 -0
  398. package/src/prover/smt/solver/opt-nlsat.ts +375 -0
  399. package/src/prover/smt/solver/opt-pareto.ts +282 -0
  400. package/src/prover/smt/solver/opt-preprocess.ts +101 -0
  401. package/src/prover/smt/solver/opt-solver.ts +308 -0
  402. package/src/prover/smt/solver/opt-value.ts +55 -0
  403. package/src/prover/smt/solver/optsmt.ts +692 -0
  404. package/src/prover/smt/solver/parallel-tactic.ts +299 -0
  405. package/src/prover/smt/solver/pattern-inference.ts +21 -26
  406. package/src/prover/smt/solver/pb-rewriter.ts +284 -0
  407. package/src/prover/smt/solver/pb2bv-tactic.ts +540 -0
  408. package/src/prover/smt/solver/poly-rewriter.ts +204 -79
  409. package/src/prover/smt/solver/probes.ts +512 -0
  410. package/src/prover/smt/solver/propagate-values.ts +37 -30
  411. package/src/prover/smt/solver/proto-model.ts +650 -66
  412. package/src/prover/smt/solver/pull-quant.ts +28 -23
  413. package/src/prover/smt/solver/purify-arith.ts +632 -0
  414. package/src/prover/smt/solver/qe-arith-plugin.ts +1098 -0
  415. package/src/prover/smt/solver/qe-lite-der.ts +2 -31
  416. package/src/prover/smt/solver/qe-lite-fm.ts +4 -28
  417. package/src/prover/smt/solver/qe-lite.ts +39 -49
  418. package/src/prover/smt/solver/qe-mbp.ts +270 -0
  419. package/src/prover/smt/solver/qe.ts +1498 -0
  420. package/src/prover/smt/solver/qel.ts +25 -0
  421. package/src/prover/smt/solver/qi-queue.ts +0 -16
  422. package/src/prover/smt/solver/qsat.ts +814 -0
  423. package/src/prover/smt/solver/quant-hoist.ts +196 -0
  424. package/src/prover/smt/solver/quant-tactics.ts +17 -74
  425. package/src/prover/smt/solver/quantifier-analyzer.ts +26 -47
  426. package/src/prover/smt/solver/quantifier-manager.ts +8 -23
  427. package/src/prover/smt/solver/quasi-macros.ts +243 -0
  428. package/src/prover/smt/solver/random-gen.ts +0 -2
  429. package/src/prover/smt/solver/rational.ts +45 -8
  430. package/src/prover/smt/solver/recfun-decl-plugin.ts +261 -0
  431. package/src/prover/smt/solver/recfun-rewriter.ts +107 -0
  432. package/src/prover/smt/solver/reduce-args.ts +225 -0
  433. package/src/prover/smt/solver/reduce-bv-size.ts +119 -0
  434. package/src/prover/smt/solver/ref-vector.ts +0 -6
  435. package/src/prover/smt/solver/relevancy.ts +2 -16
  436. package/src/prover/smt/solver/rewriter-tpl.ts +52 -129
  437. package/src/prover/smt/solver/rewriter.ts +477 -120
  438. package/src/prover/smt/solver/rlimit.ts +39 -21
  439. package/src/prover/smt/solver/sat/asymm-branch.ts +325 -0
  440. package/src/prover/smt/solver/sat/big.ts +177 -0
  441. package/src/prover/smt/solver/sat/clause-use-list.ts +71 -0
  442. package/src/prover/smt/solver/sat/clause.ts +203 -0
  443. package/src/prover/smt/solver/sat/cleaner.ts +94 -0
  444. package/src/prover/smt/solver/sat/config.ts +122 -0
  445. package/src/prover/smt/solver/sat/consequences.ts +203 -0
  446. package/src/prover/smt/solver/sat/elim-eqs.ts +142 -0
  447. package/src/prover/smt/solver/sat/goal2sat.ts +526 -0
  448. package/src/prover/smt/solver/sat/inc-sat-solver.ts +378 -0
  449. package/src/prover/smt/solver/sat/model-converter.ts +136 -0
  450. package/src/prover/smt/solver/sat/pb-constraint.ts +261 -0
  451. package/src/prover/smt/solver/sat/pb-solver.ts +1577 -0
  452. package/src/prover/smt/solver/sat/probing.ts +170 -0
  453. package/src/prover/smt/solver/sat/sat-tactic.ts +43 -0
  454. package/src/prover/smt/solver/sat/sat2goal.ts +165 -0
  455. package/src/prover/smt/solver/sat/scc.ts +142 -0
  456. package/src/prover/smt/solver/sat/simplifier.ts +1618 -0
  457. package/src/prover/smt/solver/sat/solver.ts +2127 -0
  458. package/src/prover/smt/solver/sat/var-queue.ts +117 -0
  459. package/src/prover/smt/solver/sat/watch-list.ts +140 -0
  460. package/src/prover/smt/solver/search-tree.ts +284 -0
  461. package/src/prover/smt/solver/seq-axioms.ts +1010 -0
  462. package/src/prover/smt/solver/seq-decl-plugin.ts +819 -0
  463. package/src/prover/smt/solver/seq-derive.ts +1301 -0
  464. package/src/prover/smt/solver/seq-eq-approx.ts +236 -0
  465. package/src/prover/smt/solver/seq-eq-solver.ts +439 -0
  466. package/src/prover/smt/solver/seq-factory.ts +89 -0
  467. package/src/prover/smt/solver/seq-monadic.ts +728 -0
  468. package/src/prover/smt/solver/seq-range-predicate.ts +235 -0
  469. package/src/prover/smt/solver/seq-re-rewriter.ts +1170 -0
  470. package/src/prover/smt/solver/seq-re-util.ts +758 -0
  471. package/src/prover/smt/solver/seq-regex-bisim.ts +144 -0
  472. package/src/prover/smt/solver/seq-regex-live.ts +200 -0
  473. package/src/prover/smt/solver/seq-rewriter.ts +2402 -0
  474. package/src/prover/smt/solver/seq-skolem.ts +317 -0
  475. package/src/prover/smt/solver/seq-subset.ts +165 -0
  476. package/src/prover/smt/solver/seq-view-witness.ts +353 -0
  477. package/src/prover/smt/solver/smt-consequences.ts +297 -0
  478. package/src/prover/smt/solver/smt-kernel.ts +83 -0
  479. package/src/prover/smt/solver/smt-logics.ts +66 -0
  480. package/src/prover/smt/solver/smt-setup.ts +496 -0
  481. package/src/prover/smt/solver/smt2-printer.ts +765 -0
  482. package/src/prover/smt/solver/smtlib-parser.ts +3140 -365
  483. package/src/prover/smt/solver/smtlib-script.ts +1631 -0
  484. package/src/prover/smt/solver/solve-eqs.ts +929 -0
  485. package/src/prover/smt/solver/solver.ts +119 -39
  486. package/src/prover/smt/solver/sort.ts +1 -5
  487. package/src/prover/smt/solver/static-features.ts +314 -0
  488. package/src/prover/smt/solver/sticky-generations.ts +0 -6
  489. package/src/prover/smt/solver/tactic.ts +1986 -0
  490. package/src/prover/smt/solver/term-enumeration.ts +205 -0
  491. package/src/prover/smt/solver/theory-array.ts +1240 -0
  492. package/src/prover/smt/solver/theory-bv.ts +1200 -0
  493. package/src/prover/smt/solver/theory-char.ts +355 -0
  494. package/src/prover/smt/solver/theory-datatype.ts +598 -0
  495. package/src/prover/smt/solver/theory-finite-set.ts +30 -0
  496. package/src/prover/smt/solver/theory-fpa.ts +389 -0
  497. package/src/prover/smt/solver/theory-lra-axioms.ts +55 -25
  498. package/src/prover/smt/solver/theory-lra-bounds.ts +31 -11
  499. package/src/prover/smt/solver/theory-lra-final-check.ts +59 -91
  500. package/src/prover/smt/solver/theory-lra-internalize.ts +94 -53
  501. package/src/prover/smt/solver/theory-lra-model.ts +23 -53
  502. package/src/prover/smt/solver/theory-lra-propagate.ts +24 -40
  503. package/src/prover/smt/solver/theory-lra-state.ts +6 -27
  504. package/src/prover/smt/solver/theory-lra.ts +188 -8
  505. package/src/prover/smt/solver/theory-pb.ts +934 -0
  506. package/src/prover/smt/solver/theory-polymorphism.ts +58 -0
  507. package/src/prover/smt/solver/theory-recfun.ts +307 -0
  508. package/src/prover/smt/solver/theory-seq-regex.ts +867 -0
  509. package/src/prover/smt/solver/theory-seq-solve.ts +1373 -0
  510. package/src/prover/smt/solver/theory-seq-state.ts +871 -0
  511. package/src/prover/smt/solver/theory-seq.ts +961 -0
  512. package/src/prover/smt/solver/theory.ts +189 -0
  513. package/src/prover/smt/solver/tseitin-cnf.ts +485 -0
  514. package/src/prover/smt/solver/var-subst.ts +37 -39
  515. package/src/prover/smt/table.ts +3 -10
  516. package/src/prover/smt/types.ts +146 -0
  517. package/src/prover/tlapm/cache.ts +67 -41
  518. package/src/prover/tlapm/ocaml-marshal.ts +19 -21
  519. package/src/prover/tlapm/tlapm.ts +21 -20
  520. package/src/prover/tlapm-library.ts +3208 -0
  521. package/src/prover/verdict.ts +9 -2
  522. package/src/prover/zenon/check/check.ts +1 -11
  523. package/src/prover/zenon/check/definitions.ts +5 -15
  524. package/src/prover/zenon/check/equality.ts +0 -8
  525. package/src/prover/zenon/check/functions.ts +0 -4
  526. package/src/prover/zenon/check/keys.ts +0 -7
  527. package/src/prover/zenon/check/propositional.ts +0 -3
  528. package/src/prover/zenon/check/records.ts +1 -6
  529. package/src/prover/zenon/check/relations.ts +2 -14
  530. package/src/prover/zenon/check/rewrites.ts +2 -21
  531. package/src/prover/zenon/check/sets.ts +40 -61
  532. package/src/prover/zenon/check/terms.ts +1 -19
  533. package/src/prover/zenon/check/tla.ts +0 -6
  534. package/src/prover/zenon/decide.ts +10 -19
  535. package/src/prover/zenon/encode.ts +0 -9
  536. package/src/prover/zenon/eqrel.ts +2 -15
  537. package/src/prover/zenon/equality-rules.ts +0 -6
  538. package/src/prover/zenon/expr.ts +8 -28
  539. package/src/prover/zenon/index-table.ts +26 -59
  540. package/src/prover/zenon/isar-case.ts +8 -20
  541. package/src/prover/zenon/isar.ts +35 -65
  542. package/src/prover/zenon/limits.ts +0 -4
  543. package/src/prover/zenon/llproof.ts +2 -22
  544. package/src/prover/zenon/mltoll.ts +66 -106
  545. package/src/prover/zenon/node.ts +20 -15
  546. package/src/prover/zenon/ocaml.ts +1 -17
  547. package/src/prover/zenon/parse.ts +9 -13
  548. package/src/prover/zenon/phrase.ts +1 -13
  549. package/src/prover/zenon/proof.ts +0 -11
  550. package/src/prover/zenon/propositional-rules.ts +0 -7
  551. package/src/prover/zenon/rules.ts +2 -8
  552. package/src/prover/zenon/search.ts +11 -35
  553. package/src/prover/zenon/tla/functions.ts +59 -33
  554. package/src/prover/zenon/tla/llproof.ts +67 -78
  555. package/src/prover/zenon/tla/records.ts +57 -35
  556. package/src/prover/zenon/tla/rewrites.ts +12 -21
  557. package/src/prover/zenon/tla/sets.ts +88 -59
  558. package/src/prover/zenon/tla/terms.ts +0 -8
  559. package/src/prover/zenon/tla/tla.ts +66 -66
  560. package/src/randomization.ts +81 -35
  561. package/src/resolve.ts +67 -185
  562. package/src/runtime.ts +26 -22
  563. package/src/sany/builtins.ts +2 -5
  564. package/src/sany/generation.ts +394 -0
  565. package/src/sany/generator-def-entries.ts +210 -0
  566. package/src/sany/generator-definitions.ts +686 -0
  567. package/src/sany/generator-expressions.ts +1100 -0
  568. package/src/sany/generator-proofs.ts +662 -0
  569. package/src/sany/generator.ts +191 -2764
  570. package/src/sany/levels.ts +5 -35
  571. package/src/sany/lexer.ts +58 -77
  572. package/src/sany/linter.ts +0 -10
  573. package/src/sany/modules.ts +1 -5
  574. package/src/sany/nodes.ts +5 -43
  575. package/src/sany/parse-error.ts +39 -117
  576. package/src/sany/report.ts +32 -69
  577. package/src/sany/selectors.ts +49 -76
  578. package/src/sany/source.ts +1 -17
  579. package/src/sany/xml.ts +35 -117
  580. package/src/search.ts +671 -169
  581. package/src/simulate.ts +712 -0
  582. package/src/spec-description.ts +192 -100
  583. package/src/standard-definitions.ts +4 -4
  584. package/src/standard-modules.ts +264 -95
  585. package/src/state-graph.ts +52 -33
  586. package/src/subexpressions.ts +69 -52
  587. package/src/substitution-levels.ts +7 -7
  588. package/src/successors.ts +267 -100
  589. package/src/symmetry.ts +35 -27
  590. package/src/tableau.ts +29 -26
  591. package/src/tlc/fingerprint.ts +267 -79
  592. package/src/tlc/jar-data.ts +112 -6
  593. package/src/tlc/messages.ts +125 -54
  594. package/src/tlc/order.ts +39 -69
  595. package/src/tlc/random.ts +37 -49
  596. package/src/tlc/replay.ts +553 -228
  597. package/src/tlc/summary.ts +64 -60
  598. package/src/tlc/tlc-operators.ts +78 -44
  599. package/src/tlc/tlcext-operators.ts +171 -122
  600. package/src/tlc/trace-spec.ts +249 -0
  601. package/src/tlc/value-stream.ts +139 -0
  602. package/src/tlc/version.ts +1 -4
  603. package/src/transfer.ts +22 -25
  604. package/src/typed-tier.ts +6535 -0
  605. package/src/typescript/actions.ts +479 -0
  606. package/src/typescript/collections.ts +614 -0
  607. package/src/typescript/compile.ts +63 -0
  608. package/src/typescript/context.ts +94 -0
  609. package/src/typescript/emit.ts +121 -0
  610. package/src/typescript/expressions.ts +496 -0
  611. package/src/typescript/formula.ts +154 -0
  612. package/src/typescript/functions.ts +284 -0
  613. package/src/typescript/model.ts +162 -0
  614. package/src/typescript/names.ts +114 -0
  615. package/src/typescript/program.ts +48 -0
  616. package/src/typescript/properties.ts +139 -0
  617. package/src/typescript/scope.ts +112 -0
  618. package/src/typescript/steps.ts +167 -0
  619. package/src/typescript/types.ts +171 -0
  620. package/src/values.ts +832 -484
  621. package/src/worker.ts +7 -8
  622. package/src/prover/isabelle/isar/statement.ts +0 -57
  623. package/src/prover/smt/solver/z3-license.txt +0 -10
  624. package/src/prover/tlaps-module.ts +0 -510
  625. package/src/prover/zenon/LICENSE +0 -32
@@ -1,14 +1,8 @@
1
- // Ported from Zenon's ext_tla.ml, as shipped in tlapm. Copyright 2008 INRIA, see LICENSE.
2
- //
3
- // Zenon's to_llproof for the TLA+ extension: each rule becomes an extension rule of the low-level
4
- // proof, named after the lemma in Zenon.thy that justifies it.
5
-
6
1
  import { TlaZenonError } from "../../../errors";
7
2
  import { difference, union, type Expr, type Expressions } from "../expr";
8
- import { connect, type Lemma, type LlProof, type LlRule } from "../llproof";
3
+ import type { Lemma, LlProof, LlRule } from "../llproof";
9
4
  import type { MlProof, Translated } from "../mltoll";
10
5
 
11
- // The lemma's name, the terms it's instantiated with, the conclusions it uses and its branches.
12
6
  type LlArgs = [string, Expr[], Expr[], Expr[][]];
13
7
 
14
8
  type Shape = (name: string, args: Expr[]) => LlArgs;
@@ -72,7 +66,6 @@ const binbeta: Shape = (name, args) => {
72
66
  return [`zenon_${name}`, rest, [first, second], [[hypothesisA], [hypothesisB]]];
73
67
  };
74
68
 
75
- // A conclusion, two terms and then the hypotheses, in one branch or one branch each.
76
69
  const withTerms =
77
70
  (isSplit: boolean): Shape =>
78
71
  (name, args) => {
@@ -86,7 +79,6 @@ const withTerms =
86
79
  ];
87
80
  };
88
81
 
89
- // A conclusion and then the hypotheses, in one branch or one branch each.
90
82
  const withoutTerms =
91
83
  (isSplit: boolean): Shape =>
92
84
  (name, args) => {
@@ -107,7 +99,6 @@ const getCaseBranches = (args: Expr[]): Expr[][] =>
107
99
  : [args]
108
100
  : [args.slice(0, 2), ...getCaseBranches(args.slice(2))];
109
101
 
110
- // Zenon's to_llargs, by rule name. The rules missing here take one hypothesis.
111
102
  const SHAPES: Record<string, Shape> = {
112
103
  in_emptyset: (name, args) => [`zenon_${name}`, args.slice(1), args.slice(0, 1), []],
113
104
  in_nat_0: close,
@@ -128,11 +119,7 @@ const SHAPES: Record<string, Shape> = {
128
119
  if (third === undefined) throw getShapeError(name);
129
120
  return [`zenon_${name}`, rest, [conclusion], [[first, second, third]]];
130
121
  },
131
- except_notin_funcset: (name, args) => {
132
- const [conclusion, first, second, ...rest] = args;
133
- if (second === undefined) throw getShapeError(name);
134
- return [`zenon_${name}`, rest, [conclusion], [[first], [second]]];
135
- },
122
+ except_notin_funcset: beta,
136
123
  notin_funcset: (name, args) => {
137
124
  const [conclusion, first, second, third, ...rest] = args;
138
125
  if (third === undefined) throw getShapeError(name);
@@ -194,14 +181,12 @@ const SHAPES: Record<string, Shape> = {
194
181
  record_notisafcn: close,
195
182
  };
196
183
 
197
- // Zenon's Ext_tla.to_llproof, for a rule of the extension and its translated subproofs.
198
184
  export const getTlaLlProof = (
199
185
  translateExpr: (expression: Expr) => Expr,
200
186
  exprs: Expressions,
201
187
  proof: MlProof,
202
188
  subproofs: Translated[],
203
189
  ): Translated => {
204
- const tr = translateExpr;
205
190
  const rule = proof.rule;
206
191
  const member = (element: Expr, set: Expr) => exprs.eapp("TLA.in", [element, set]);
207
192
  const equal = (left: Expr, right: Expr) => exprs.eapp("=", [left, right]);
@@ -213,18 +198,24 @@ export const getTlaLlProof = (
213
198
  branches: Expr[][],
214
199
  nodeSubproofs: LlProof[],
215
200
  ): LlProof => ({
216
- conclusions: conclusions.map(tr),
201
+ conclusions: conclusions.map(translateExpr),
217
202
  rule: {
218
203
  kind: "extension",
219
204
  name,
220
- args: args.map(tr),
221
- conclusions: ruleConclusions.map(tr),
222
- branches: branches.map((branch) => branch.map(tr)),
205
+ args: args.map(translateExpr),
206
+ conclusions: ruleConclusions.map(translateExpr),
207
+ branches: branches.map((branch) => branch.map(translateExpr)),
223
208
  },
224
209
  subproofs: nodeSubproofs,
225
210
  });
226
211
 
227
- // The membership in an enumerated set, one element at a time.
212
+ const splitSet = (set: Expr, isSetOf: boolean) =>
213
+ set.kind === "app" &&
214
+ set.symbol === (isSetOf ? "TLA.set" : "TLA.addElt") &&
215
+ set.args.length >= (isSetOf ? 1 : 2)
216
+ ? [set.args[0], isSetOf ? exprs.eapp("TLA.set", set.args.slice(1)) : set.args[1]]
217
+ : undefined;
218
+
228
219
  const getMembership = (
229
220
  element: Expr,
230
221
  set: Expr,
@@ -240,12 +231,7 @@ export const getTlaLlProof = (
240
231
  extension(conclusions, "zenon_in_emptyset", [element], [member(element, set)], [], []),
241
232
  [],
242
233
  ];
243
- const split =
244
- set.kind === "app" &&
245
- set.symbol === (isSetOf ? "TLA.set" : "TLA.addElt") &&
246
- set.args.length >= (isSetOf ? 1 : 2)
247
- ? [set.args[0], isSetOf ? exprs.eapp("TLA.set", set.args.slice(1)) : set.args[1]]
248
- : undefined;
234
+ const split = splitSet(set, isSetOf);
249
235
  const first = remaining[0];
250
236
  if (split === undefined || first === undefined) {
251
237
  if (!isSetOf && remaining.length === 1) return remaining[0];
@@ -254,13 +240,13 @@ export const getTlaLlProof = (
254
240
  const value = split[0];
255
241
  const rest = split[1];
256
242
  const conclusion = member(element, set);
257
- const isValue = equal(element, value);
258
- const isInRest = member(element, rest);
243
+ const valueEquality = equal(element, value);
244
+ const restMembership = member(element, rest);
259
245
  const next = getMembership(
260
246
  element,
261
247
  rest,
262
248
  remaining.slice(1),
263
- [isInRest, ...conclusions],
249
+ [restMembership, ...conclusions],
264
250
  isSetOf,
265
251
  );
266
252
  const extras = difference(union(first[1], next[1]), conclusions);
@@ -270,14 +256,13 @@ export const getTlaLlProof = (
270
256
  "zenon_in_addElt",
271
257
  [element, value, rest],
272
258
  [conclusion],
273
- [[isValue], [isInRest]],
259
+ [[valueEquality], [restMembership]],
274
260
  [first[0], next[0]],
275
261
  ),
276
262
  extras,
277
263
  ];
278
264
  };
279
265
 
280
- // The non-membership in an enumerated set, one element at a time.
281
266
  const getNonMembership = (
282
267
  element: Expr,
283
268
  set: Expr,
@@ -285,23 +270,18 @@ export const getTlaLlProof = (
285
270
  conclusions: Expr[],
286
271
  isSetOf: boolean,
287
272
  ): Translated => {
288
- const split =
289
- set.kind === "app" &&
290
- set.symbol === (isSetOf ? "TLA.set" : "TLA.addElt") &&
291
- set.args.length >= (isSetOf ? 1 : 2)
292
- ? [set.args[0], isSetOf ? exprs.eapp("TLA.set", set.args.slice(1)) : set.args[1]]
293
- : undefined;
273
+ const split = splitSet(set, isSetOf);
294
274
  if (split === undefined) return sub;
295
275
  const value = split[0];
296
276
  const rest = split[1];
297
277
  const conclusion = exprs.enot(member(element, set));
298
- const isNotValue = exprs.enot(equal(element, value));
299
- const isNotInRest = exprs.enot(member(element, rest));
278
+ const valueInequality = exprs.enot(equal(element, value));
279
+ const restNonMembership = exprs.enot(member(element, rest));
300
280
  const next = getNonMembership(
301
281
  element,
302
282
  rest,
303
283
  sub,
304
- [isNotValue, isNotInRest, ...conclusions],
284
+ [valueInequality, restNonMembership, ...conclusions],
305
285
  isSetOf,
306
286
  );
307
287
  const extras = difference(next[1], conclusions);
@@ -311,7 +291,7 @@ export const getTlaLlProof = (
311
291
  "zenon_notin_addElt",
312
292
  [element, value, rest],
313
293
  [conclusion],
314
- [[isNotValue, isNotInRest]],
294
+ [[valueInequality, restNonMembership]],
315
295
  [next[0]],
316
296
  ),
317
297
  extras,
@@ -367,10 +347,9 @@ export const getTlaLlProof = (
367
347
  }
368
348
  };
369
349
 
370
- // Zenon's Ext_tla.postprocess: the lemmas with each $notequiv written as a negated equivalence.
371
350
  export const postprocessTla = (exprs: Expressions, lemmas: Lemma[]): Lemma[] => {
372
351
  const cache = new Map<Expr, Expr>();
373
- const pp = (expression: Expr): Expr => {
352
+ const postprocess = (expression: Expr): Expr => {
374
353
  const cached = cache.get(expression);
375
354
  if (cached !== undefined) return cached;
376
355
  const result = ((): Expr => {
@@ -383,35 +362,37 @@ export const postprocessTla = (exprs: Expressions, lemmas: Lemma[]): Lemma[] =>
383
362
  throw new TlaZenonError("Zenon: a metavariable in a low-level proof");
384
363
  case "app": {
385
364
  if (expression.symbol !== "$notequiv")
386
- return exprs.eapp(expression.symbol, expression.args.map(pp));
365
+ return exprs.eapp(expression.symbol, expression.args.map(postprocess));
387
366
  if (expression.args.length !== 2)
388
367
  throw new TlaZenonError("Zenon: $notequiv without two arguments");
389
- const right = pp(expression.args[1]);
390
- return exprs.enot(exprs.eequiv(pp(expression.args[0]), right));
368
+ const right = postprocess(expression.args[1]);
369
+ return exprs.enot(exprs.eequiv(postprocess(expression.args[0]), right));
391
370
  }
392
371
  case "not":
393
- return exprs.enot(pp(expression.args[0]));
372
+ return exprs.enot(postprocess(expression.args[0]));
394
373
  case "and":
395
374
  case "or":
396
375
  case "imply":
397
376
  case "equiv": {
398
- const right = pp(expression.args[1]);
399
- return connect(exprs, expression.kind, pp(expression.args[0]), right);
377
+ const right = postprocess(expression.args[1]);
378
+ return exprs.binary(expression.kind, postprocess(expression.args[0]), right);
400
379
  }
401
380
  case "all":
402
- return exprs.eall(expression.args[0], expression.symbol, pp(expression.args[1]));
403
381
  case "ex":
404
- return exprs.eex(expression.args[0], expression.symbol, pp(expression.args[1]));
405
382
  case "tau":
406
- return exprs.etau(expression.args[0], expression.symbol, pp(expression.args[1]));
407
383
  case "lam":
408
- return exprs.elam(expression.args[0], expression.symbol, pp(expression.args[1]));
384
+ return exprs.binder(
385
+ expression.kind,
386
+ expression.args[0],
387
+ expression.symbol,
388
+ postprocess(expression.args[1]),
389
+ );
409
390
  }
410
391
  })();
411
392
  cache.set(expression, result);
412
393
  return result;
413
394
  };
414
- const ppRule = (rule: LlRule): LlRule => {
395
+ const postprocessRule = (rule: LlRule): LlRule => {
415
396
  switch (rule.kind) {
416
397
  case "false":
417
398
  case "nottrue":
@@ -419,62 +400,70 @@ export const postprocessTla = (exprs: Expressions, lemmas: Lemma[]): Lemma[] =>
419
400
  case "axiom":
420
401
  case "cut":
421
402
  case "notnot":
422
- return { kind: rule.kind, formula: pp(rule.formula) };
403
+ return { kind: rule.kind, formula: postprocess(rule.formula) };
423
404
  case "noteq":
424
- return { kind: "noteq", term: pp(rule.term) };
405
+ return { kind: "noteq", term: postprocess(rule.term) };
425
406
  case "eqsym":
426
407
  case "notequal":
427
- return { kind: rule.kind, left: pp(rule.left), right: pp(rule.right) };
408
+ return { kind: rule.kind, left: postprocess(rule.left), right: postprocess(rule.right) };
428
409
  case "connect":
429
410
  case "notconnect":
430
411
  return {
431
412
  kind: rule.kind,
432
413
  connective: rule.connective,
433
- left: pp(rule.left),
434
- right: pp(rule.right),
414
+ left: postprocess(rule.left),
415
+ right: postprocess(rule.right),
435
416
  };
436
417
  case "ex":
437
418
  case "all":
438
419
  case "notex":
439
420
  case "notall":
440
- return { kind: rule.kind, quantified: pp(rule.quantified), term: pp(rule.term) };
421
+ return {
422
+ kind: rule.kind,
423
+ quantified: postprocess(rule.quantified),
424
+ term: postprocess(rule.term),
425
+ };
441
426
  case "pnotp":
442
- return { kind: "pnotp", positive: pp(rule.positive), negative: pp(rule.negative) };
427
+ return {
428
+ kind: "pnotp",
429
+ positive: postprocess(rule.positive),
430
+ negative: postprocess(rule.negative),
431
+ };
443
432
  case "congruencelr":
444
433
  case "congruencerl":
445
434
  return {
446
435
  kind: rule.kind,
447
- context: pp(rule.context),
448
- left: pp(rule.left),
449
- right: pp(rule.right),
436
+ context: postprocess(rule.context),
437
+ left: postprocess(rule.left),
438
+ right: postprocess(rule.right),
450
439
  };
451
440
  case "definition":
452
441
  return {
453
442
  kind: "definition",
454
443
  name: rule.name,
455
- folded: pp(rule.folded),
456
- unfolded: pp(rule.unfolded),
444
+ folded: postprocess(rule.folded),
445
+ unfolded: postprocess(rule.unfolded),
457
446
  };
458
447
  case "extension":
459
448
  return {
460
449
  kind: "extension",
461
450
  name: rule.name,
462
- args: rule.args.map(pp),
463
- conclusions: rule.conclusions.map(pp),
464
- branches: rule.branches.map((branch) => branch.map(pp)),
451
+ args: rule.args.map(postprocess),
452
+ conclusions: rule.conclusions.map(postprocess),
453
+ branches: rule.branches.map((branch) => branch.map(postprocess)),
465
454
  };
466
455
  case "lemma":
467
- return { kind: "lemma", name: rule.name, args: rule.args.map(pp) };
456
+ return { kind: "lemma", name: rule.name, args: rule.args.map(postprocess) };
468
457
  }
469
458
  };
470
- const ppTree = (tree: LlProof): LlProof => ({
471
- conclusions: tree.conclusions.map(pp),
472
- rule: ppRule(tree.rule),
473
- subproofs: tree.subproofs.map(ppTree),
459
+ const postprocessTree = (tree: LlProof): LlProof => ({
460
+ conclusions: tree.conclusions.map(postprocess),
461
+ rule: postprocessRule(tree.rule),
462
+ subproofs: tree.subproofs.map(postprocessTree),
474
463
  });
475
464
  return lemmas.map((lemma) => ({
476
465
  name: lemma.name,
477
- params: lemma.params.map((param): [string, Expr] => [param[0], pp(param[1])]),
478
- proof: ppTree(lemma.proof),
466
+ params: lemma.params.map((param): [string, Expr] => [param[0], postprocess(param[1])]),
467
+ proof: postprocessTree(lemma.proof),
479
468
  }));
480
469
  };
@@ -1,11 +1,6 @@
1
- // Ported from Zenon's ext_tla.ml, as shipped in tlapm. Copyright 2008 INRIA, see LICENSE.
2
- //
3
- // The rules for tuples and records.
4
-
5
- import { compareExprs, isApp, type Expr } from "../expr";
1
+ import { compareExprs, getStringName, isApp, type Expr } from "../expr";
6
2
  import { stableSort } from "../ocaml";
7
- import type { Priority } from "../node";
8
- import { makeRule, type Rule } from "../proof";
3
+ import { makeRule } from "../proof";
9
4
  import {
10
5
  domain,
11
6
  equal,
@@ -20,12 +15,6 @@ import {
20
15
  type Literal,
21
16
  } from "./terms";
22
17
 
23
- const getStringName = (expression: Expr) =>
24
- isApp(expression, "$string", 1) && expression.args[0].kind === "var"
25
- ? expression.args[0].symbol
26
- : undefined;
27
-
28
- // Zenon's check_record_labels on sorted fields: false for Invalid_record, a repeated label.
29
18
  const hasDistinctLabels = (pairs: [Expr, Expr][]) => {
30
19
  for (let index = 0; index + 1 < pairs.length; index++) {
31
20
  const left = pairs[index][0];
@@ -56,10 +45,8 @@ export const getTupleNodes = (literal: Literal): Item[] | undefined => {
56
45
  const isNegated = literal.isNegated;
57
46
  const atom = literal.atom;
58
47
  const relation = literal.relation;
59
- const node = (priority: Priority, rule: Rule, branches: Expr[][]) =>
60
- makeExtensionNode(literal, priority, rule, branches);
61
48
  if (isNegated && isApp(atom, "TLA.isASeq", 1) && isApp(atom.args[0], "TLA.tuple"))
62
- return node("prop", makeRule("tuple_notisaseq", [formula]), []);
49
+ return makeExtensionNode(literal, "prop", makeRule("tuple_notisaseq", [formula]), []);
63
50
  if (relation === undefined) return undefined;
64
51
  const left = relation.args[0];
65
52
  const right = relation.args[1];
@@ -67,11 +54,21 @@ export const getTupleNodes = (literal: Literal): Item[] | undefined => {
67
54
  const isMembership = relation.symbol === "TLA.in";
68
55
  if (!isNegated && isEquality && isApp(left, "TLA.tuple") && isApp(right, "TLA.tuple")) {
69
56
  if (left.args.length !== right.args.length)
70
- return node("prop", makeRule("tuple_eq_mismatch", [formula, formula]), []);
57
+ return makeExtensionNode(
58
+ literal,
59
+ "prop",
60
+ makeRule("tuple_eq_mismatch", [formula, formula]),
61
+ [],
62
+ );
71
63
  const equalities = left.args.map((inner, position) =>
72
64
  equal(exprs, inner, right.args[position]),
73
65
  );
74
- return node("prop", makeRule("tuple_eq_match", [formula, ...equalities]), [equalities]);
66
+ return makeExtensionNode(
67
+ literal,
68
+ "prop",
69
+ makeRule("tuple_eq_match", [formula, ...equalities]),
70
+ [equalities],
71
+ );
75
72
  }
76
73
  if (isMembership && isApp(right, "TLA.Product", 1) && isApp(right.args[0], "TLA.tuple")) {
77
74
  const element = left;
@@ -80,16 +77,24 @@ export const getTupleNodes = (literal: Literal): Item[] | undefined => {
80
77
  const components = tuple.args.map((inner, position) =>
81
78
  member(exprs, fapply(exprs, element, makeNatural(exprs, position + 1)), inner),
82
79
  );
83
- const isSequence = exprs.eapp("TLA.isASeq", [element]);
84
- const hasLength = equal(
80
+ const sequenceFormula = exprs.eapp("TLA.isASeq", [element]);
81
+ const lengthFormula = equal(
85
82
  exprs,
86
83
  exprs.eapp("TLA.Len", [element]),
87
84
  makeNatural(exprs, tuple.args.length),
88
85
  );
89
- return node(
86
+ return makeExtensionNode(
87
+ literal,
90
88
  "prop",
91
- makeRule("in_product", [formula, element, tuple, isSequence, hasLength, ...components]),
92
- [[isSequence, hasLength, ...components]],
89
+ makeRule("in_product", [
90
+ formula,
91
+ element,
92
+ tuple,
93
+ sequenceFormula,
94
+ lengthFormula,
95
+ ...components,
96
+ ]),
97
+ [[sequenceFormula, lengthFormula, ...components]],
93
98
  );
94
99
  }
95
100
  if (
@@ -108,7 +113,8 @@ export const getTupleNodes = (literal: Literal): Item[] | undefined => {
108
113
  ),
109
114
  ...components,
110
115
  ];
111
- return node(
116
+ return makeExtensionNode(
117
+ literal,
112
118
  "prop",
113
119
  makeRule("notin_product", [formula, element, tuple, ...formulas]),
114
120
  getBranches(formulas),
@@ -123,10 +129,8 @@ export const getRecordNodes = (literal: Literal): Item[] | undefined => {
123
129
  const isNegated = literal.isNegated;
124
130
  const atom = literal.atom;
125
131
  const relation = literal.relation;
126
- const node = (priority: Priority, rule: Rule, branches: Expr[][]) =>
127
- makeExtensionNode(literal, priority, rule, branches);
128
132
  if (isNegated && isApp(atom, "TLA.isAFcn", 1) && isApp(atom.args[0], "TLA.record"))
129
- return node("prop", makeRule("record_notisafcn", [formula]), []);
133
+ return makeExtensionNode(literal, "prop", makeRule("record_notisafcn", [formula]), []);
130
134
  if (relation === undefined) return undefined;
131
135
  const left = relation.args[0];
132
136
  const right = relation.args[1];
@@ -140,14 +144,27 @@ export const getRecordNodes = (literal: Literal): Item[] | undefined => {
140
144
  leftFields.length === rightFields.length &&
141
145
  leftFields.every((field, position) => field[0] === rightFields[position][0]);
142
146
  if (!isMatch)
143
- return isNegated ? [] : node("prop", makeRule("record_eq_mismatch", [formula, formula]), []);
147
+ return isNegated
148
+ ? []
149
+ : makeExtensionNode(
150
+ literal,
151
+ "prop",
152
+ makeRule("record_eq_mismatch", [formula, formula]),
153
+ [],
154
+ );
144
155
  const equalities = leftFields.map((field, position) =>
145
156
  equal(exprs, field[1], rightFields[position][1]),
146
157
  );
147
158
  if (!isNegated)
148
- return node("prop", makeRule("record_eq_match", [formula, ...equalities]), [equalities]);
159
+ return makeExtensionNode(
160
+ literal,
161
+ "prop",
162
+ makeRule("record_eq_match", [formula, ...equalities]),
163
+ [equalities],
164
+ );
149
165
  const inequalities = equalities.map((inner) => exprs.enot(inner));
150
- return node(
166
+ return makeExtensionNode(
167
+ literal,
151
168
  "prop",
152
169
  makeRule("record_neq_match", [formula, ...inequalities]),
153
170
  getBranches(inequalities),
@@ -171,7 +188,8 @@ export const getRecordNodes = (literal: Literal): Item[] | undefined => {
171
188
  ),
172
189
  ...pairs.map((pair) => exprs.enot(equal(exprs, fapply(exprs, other, pair[0]), pair[1]))),
173
190
  ];
174
- return node(
191
+ return makeExtensionNode(
192
+ literal,
175
193
  "prop",
176
194
  makeRule(record === right ? "neq_record" : "record_neq", [
177
195
  formula,
@@ -194,9 +212,12 @@ export const getRecordNodes = (literal: Literal): Item[] | undefined => {
194
212
  equal(exprs, domain(exprs, left), labels),
195
213
  ...pairs.map((pair) => member(exprs, fapply(exprs, left, pair[0]), pair[1])),
196
214
  ];
197
- return node("prop", makeRule("in_recordset", [formula, left, right, ...formulas]), [
198
- formulas,
199
- ]);
215
+ return makeExtensionNode(
216
+ literal,
217
+ "prop",
218
+ makeRule("in_recordset", [formula, left, right, ...formulas]),
219
+ [formulas],
220
+ );
200
221
  }
201
222
  if (isApp(left, "TLA.record")) {
202
223
  const leftLabels = getSortedLabels(left.args);
@@ -215,7 +236,8 @@ export const getRecordNodes = (literal: Literal): Item[] | undefined => {
215
236
  exprs.enot(equal(exprs, domain(exprs, left), labels)),
216
237
  ...pairs.map((pair) => exprs.enot(member(exprs, fapply(exprs, left, pair[0]), pair[1]))),
217
238
  ];
218
- return node(
239
+ return makeExtensionNode(
240
+ literal,
219
241
  "prop",
220
242
  makeRule("notin_recordset", [formula, left, right, ...formulas]),
221
243
  getBranches(formulas),
@@ -1,8 +1,3 @@
1
- // Ported from Zenon's ext_tla.ml, as shipped in tlapm. Copyright 2008 INRIA, see LICENSE.
2
- //
3
- // Rewriting a subterm: unfolding a definition, evaluating a function application, IF, CASE or a
4
- // formula used as a term, or replacing the subterm with an equal one from the branch.
5
-
6
1
  import { TlaZenonError } from "../../../errors";
7
2
  import {
8
3
  FALSE,
@@ -29,8 +24,7 @@ import {
29
24
  type TlaContext,
30
25
  } from "./terms";
31
26
 
32
- // OCaml's int_of_string, for the numerals that tlapm writes as variables.
33
- const parseInteger = (text: string) =>
27
+ const parseOcamlInteger = (text: string) =>
34
28
  /^[-+]?(0[xX][0-9a-fA-F_]+|0[oO][0-7_]+|0[bB][01_]+|0[uU][0-9_]+|[0-9][0-9_]*)$/.test(text)
35
29
  ? Number(text.replace(/_/g, "").replace(/^([-+]?)0[uU]/, "$1"))
36
30
  : undefined;
@@ -43,7 +37,7 @@ const getNaturalConstant = (expression: Expr): number | undefined => {
43
37
  current = current.args[1];
44
38
  }
45
39
  if (current.kind !== "var") return undefined;
46
- const value = parseInteger(current.symbol);
40
+ const value = parseOcamlInteger(current.symbol);
47
41
  return value === undefined ? undefined : accumulator + value;
48
42
  };
49
43
 
@@ -100,20 +94,19 @@ const getRewrites = (
100
94
  const lambda = exprs.elam(hole, "", frame);
101
95
  const fill = (inner: Expr) => exprs.substitute([[hole, inner]], frame);
102
96
  const makeBoolCase = (getRule: (prefix: [Expr, Expr, Expr, Expr, Expr, Expr]) => Rule) => {
103
- const isTrue = equal(exprs, term, TRUE);
97
+ const trueEquality = equal(exprs, term, TRUE);
104
98
  const whenTrue = fill(TRUE);
105
- const isFalse = equal(exprs, term, FALSE);
99
+ const falseEquality = equal(exprs, term, FALSE);
106
100
  const whenFalse = fill(FALSE);
107
101
  return make(
108
- getRule([fill(term), isTrue, whenTrue, isFalse, whenFalse, lambda]),
102
+ getRule([fill(term), trueEquality, whenTrue, falseEquality, whenFalse, lambda]),
109
103
  [],
110
104
  [
111
- [isTrue, whenTrue],
112
- [isFalse, whenFalse],
105
+ [trueEquality, whenTrue],
106
+ [falseEquality, whenFalse],
113
107
  ],
114
108
  );
115
109
  };
116
- // Rewrites the term with the equalities on the branch whose other side has one of these heads.
117
110
  const makeEqualityRewrites = (wrapped: Expr, heads: string[], subterm: Expr) => {
118
111
  const hasGoodHead = (other: Expr) =>
119
112
  (other.kind === "app" || other.kind === "var") &&
@@ -199,19 +192,19 @@ const getRewrites = (
199
192
  const point = fcn.args[1];
200
193
  const value = fcn.args[2];
201
194
  const inDomain = member(exprs, argument, domain(exprs, base));
202
- const isPoint = equal(exprs, point, argument);
195
+ const pointEquality = equal(exprs, point, argument);
203
196
  const changed = fill(value);
204
- const isOther = exprs.enot(equal(exprs, point, argument));
197
+ const pointInequality = exprs.enot(equal(exprs, point, argument));
205
198
  const unchanged = fill(fapply(exprs, base, argument));
206
199
  const outside = exprs.enot(inDomain);
207
200
  return make(
208
201
  makeRule("fapplyexcept", [
209
202
  fill(term),
210
203
  inDomain,
211
- isPoint,
204
+ pointEquality,
212
205
  changed,
213
206
  inDomain,
214
- isOther,
207
+ pointInequality,
215
208
  unchanged,
216
209
  outside,
217
210
  lambda,
@@ -221,7 +214,7 @@ const getRewrites = (
221
214
  argument,
222
215
  ]),
223
216
  [],
224
- [[inDomain, isPoint, changed], [inDomain, isOther, unchanged], [outside]],
217
+ [[inDomain, pointEquality, changed], [inDomain, pointInequality, unchanged], [outside]],
225
218
  );
226
219
  }
227
220
  if (isApp(fcn, "TLA.tuple") && isInOneTo(argument, fcn.args.length)) {
@@ -394,8 +387,6 @@ const hasExistential = (exprs: Expressions, index: Index, choice: BinderExpr) =>
394
387
  return index.isMember(exprs.eex(choice.args[0], choice.symbol, body));
395
388
  };
396
389
 
397
- // Zenon's find_rewrites: the rewrites of the outermost subterm that has some, looking through
398
- // applications and negations.
399
390
  const findRewrites = (
400
391
  context: TlaContext,
401
392
  isInTerm: boolean,