tla-ts 0.0.9 → 0.0.10-dev.06b481ee0

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 (631) 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 +48 -44
  6. package/dist/index.cjs +1 -1
  7. package/dist/index.d.cts +122 -12
  8. package/dist/index.d.ts +122 -12
  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 +144 -31
  17. package/dist/run.js +144 -31
  18. package/dist/tlapm.cjs +2 -2
  19. package/dist/tlapm.js +2 -2
  20. package/dist/transfer.cjs +134 -104
  21. package/dist/transfer.js +134 -104
  22. package/dist/worker.cjs +7 -7
  23. package/dist/worker.js +7 -7
  24. package/package.json +3 -1
  25. package/src/ast.ts +56 -60
  26. package/src/bags.ts +128 -110
  27. package/src/builtins.ts +31 -77
  28. package/src/bundled-modules.ts +1 -8
  29. package/src/check-failure.ts +118 -0
  30. package/src/check-trace.ts +320 -0
  31. package/src/check.ts +1156 -888
  32. package/src/cli/options.ts +12 -32
  33. package/src/cli/run.ts +0 -2
  34. package/src/cli/runtime-invariants.ts +100 -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 +701 -0
  39. package/src/cli/tlc-usage.ts +360 -0
  40. package/src/cli/tlc.ts +330 -659
  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 +217 -82
  45. package/src/config.ts +140 -109
  46. package/src/coverage.ts +1019 -0
  47. package/src/dependencies.ts +101 -66
  48. package/src/dfid.ts +683 -0
  49. package/src/environment-config.ts +315 -0
  50. package/src/environment.ts +263 -370
  51. package/src/errors.ts +107 -57
  52. package/src/evaluate.ts +898 -369
  53. package/src/exit-codes.ts +63 -13
  54. package/src/fingerprints.ts +75 -11
  55. package/src/index.ts +3 -0
  56. package/src/instances.ts +137 -22
  57. package/src/java-hash.ts +21 -0
  58. package/src/java-overrides.ts +6 -21
  59. package/src/json-reader.ts +455 -0
  60. package/src/json.ts +252 -139
  61. package/src/levels.ts +231 -154
  62. package/src/lexer.ts +83 -101
  63. package/src/liveness-checker.ts +743 -322
  64. package/src/liveness.ts +230 -133
  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 +39 -20
  73. package/src/obligations/levels.ts +27 -18
  74. package/src/obligations/module.ts +28 -55
  75. package/src/obligations/normalize.ts +31 -41
  76. package/src/obligations/operators.ts +0 -3
  77. package/src/obligations/pragma.ts +52 -24
  78. package/src/obligations/printer.ts +94 -63
  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 +121 -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 +36 -60
  88. package/src/parallel.ts +64 -73
  89. package/src/parser.ts +1184 -531
  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 +226 -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 +1 -15
  118. package/src/prover/isabelle/provers/classical.ts +58 -61
  119. package/src/prover/isabelle/provers/hypsubst.ts +29 -54
  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 +34 -77
  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 +4 -47
  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 +26 -31
  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 +1021 -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 +626 -56
  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 +319 -0
  190. package/src/prover/smt/solver/array.ts +1 -3
  191. package/src/prover/smt/solver/asserted-formulas.ts +241 -99
  192. package/src/prover/smt/solver/ast-lt.ts +165 -21
  193. package/src/prover/smt/solver/ast-util.ts +160 -7
  194. package/src/prover/smt/solver/ast.ts +1480 -184
  195. package/src/prover/smt/solver/auf-solver.ts +30 -56
  196. package/src/prover/smt/solver/bit-blast-tactic.ts +608 -0
  197. package/src/prover/smt/solver/bit-blaster.ts +871 -0
  198. package/src/prover/smt/solver/blast-term-ite.ts +47 -0
  199. package/src/prover/smt/solver/bound-manager.ts +196 -0
  200. package/src/prover/smt/solver/bound-simplifier.ts +598 -0
  201. package/src/prover/smt/solver/bv-bound-chk.ts +492 -0
  202. package/src/prover/smt/solver/bv-decl-plugin.ts +341 -0
  203. package/src/prover/smt/solver/bv-divrem-bounds.ts +95 -0
  204. package/src/prover/smt/solver/bv-rewriter.ts +1901 -0
  205. package/src/prover/smt/solver/bv1-blast.ts +214 -0
  206. package/src/prover/smt/solver/bv2fpa-converter.ts +174 -0
  207. package/src/prover/smt/solver/bv2int-rewriter.ts +544 -0
  208. package/src/prover/smt/solver/bv2real-rewriter.ts +533 -0
  209. package/src/prover/smt/solver/card2bv.ts +127 -0
  210. package/src/prover/smt/solver/case-split-queue.ts +0 -10
  211. package/src/prover/smt/solver/cg-table.ts +39 -42
  212. package/src/prover/smt/solver/check-logic.ts +330 -0
  213. package/src/prover/smt/solver/clause.ts +0 -27
  214. package/src/prover/smt/solver/cofactor-elim-term-ite.ts +293 -0
  215. package/src/prover/smt/solver/conflict-resolution.ts +78 -11
  216. package/src/prover/smt/solver/context.ts +600 -187
  217. package/src/prover/smt/solver/ctx-simplify.ts +34 -52
  218. package/src/prover/smt/solver/ctx-solver-simplify.ts +122 -0
  219. package/src/prover/smt/solver/datatype-decl-plugin.ts +580 -0
  220. package/src/prover/smt/solver/datatype-rewriter.ts +82 -0
  221. package/src/prover/smt/solver/demodulator.ts +786 -0
  222. package/src/prover/smt/solver/dependent-expr-state.ts +93 -0
  223. package/src/prover/smt/solver/der.ts +39 -30
  224. package/src/prover/smt/solver/diff-neq.ts +205 -0
  225. package/src/prover/smt/solver/distribute-forall.ts +57 -0
  226. package/src/prover/smt/solver/dom-simplify.ts +511 -0
  227. package/src/prover/smt/solver/dt2bv-tactic.ts +296 -0
  228. package/src/prover/smt/solver/dyn-ack.ts +0 -11
  229. package/src/prover/smt/solver/e-matching.ts +9 -41
  230. package/src/prover/smt/solver/elim-bounds.ts +89 -0
  231. package/src/prover/smt/solver/elim-small-bv-tactic.ts +129 -0
  232. package/src/prover/smt/solver/elim-term-ite-tactic.ts +48 -0
  233. package/src/prover/smt/solver/elim-uncnstr.ts +542 -0
  234. package/src/prover/smt/solver/enode.ts +100 -23
  235. package/src/prover/smt/solver/eq2bv-tactic.ts +218 -0
  236. package/src/prover/smt/solver/euf/arith-axioms.ts +403 -0
  237. package/src/prover/smt/solver/euf/arith-internalize.ts +653 -0
  238. package/src/prover/smt/solver/euf/arith-solver.ts +889 -0
  239. package/src/prover/smt/solver/euf/array-axioms.ts +527 -0
  240. package/src/prover/smt/solver/euf/array-internalize.ts +428 -0
  241. package/src/prover/smt/solver/euf/array-solver.ts +306 -0
  242. package/src/prover/smt/solver/euf/bv-ackerman.ts +162 -0
  243. package/src/prover/smt/solver/euf/bv-internalize.ts +748 -0
  244. package/src/prover/smt/solver/euf/bv-solver.ts +449 -0
  245. package/src/prover/smt/solver/euf/dt-solver.ts +618 -0
  246. package/src/prover/smt/solver/euf/egraph.ts +901 -0
  247. package/src/prover/smt/solver/euf/euf-solver.ts +1204 -0
  248. package/src/prover/smt/solver/euf/fpa-solver.ts +317 -0
  249. package/src/prover/smt/solver/euf/mam.ts +1046 -0
  250. package/src/prover/smt/solver/euf/q-ematch.ts +829 -0
  251. package/src/prover/smt/solver/euf/q-mbi.ts +587 -0
  252. package/src/prover/smt/solver/euf/q-model-fixer.ts +296 -0
  253. package/src/prover/smt/solver/euf/q-solver.ts +361 -0
  254. package/src/prover/smt/solver/euf/th-solver.ts +328 -0
  255. package/src/prover/smt/solver/euf/th-solvers.ts +30 -0
  256. package/src/prover/smt/solver/expr-ref.ts +0 -5
  257. package/src/prover/smt/solver/expr-safe-replace.ts +26 -7
  258. package/src/prover/smt/solver/expr2polynomial.ts +271 -0
  259. package/src/prover/smt/solver/factor.ts +163 -0
  260. package/src/prover/smt/solver/fd-solver.ts +734 -0
  261. package/src/prover/smt/solver/fingerprints.ts +15 -26
  262. package/src/prover/smt/solver/fix-dl-var.ts +147 -0
  263. package/src/prover/smt/solver/flat-literals.ts +0 -9
  264. package/src/prover/smt/solver/fm-tactic.ts +884 -0
  265. package/src/prover/smt/solver/fpa-decl-plugin.ts +618 -0
  266. package/src/prover/smt/solver/fpa-rewriter.ts +639 -0
  267. package/src/prover/smt/solver/fpa2bv-converter.ts +2251 -0
  268. package/src/prover/smt/solver/fpa2bv-rewriter.ts +349 -0
  269. package/src/prover/smt/solver/fpa2bv-tactic.ts +73 -0
  270. package/src/prover/smt/solver/goal.ts +179 -28
  271. package/src/prover/smt/solver/goal2nlsat.ts +216 -0
  272. package/src/prover/smt/solver/guard-set.ts +219 -0
  273. package/src/prover/smt/solver/hash.ts +0 -9
  274. package/src/prover/smt/solver/hashtable.ts +30 -23
  275. package/src/prover/smt/solver/inf-eps.ts +63 -0
  276. package/src/prover/smt/solver/inj-axiom.ts +101 -0
  277. package/src/prover/smt/solver/internalizer.ts +113 -133
  278. package/src/prover/smt/solver/lackr.ts +381 -0
  279. package/src/prover/smt/solver/lbool.ts +0 -2
  280. package/src/prover/smt/solver/lia2card.ts +268 -0
  281. package/src/prover/smt/solver/lia2pb.ts +154 -0
  282. package/src/prover/smt/solver/literal.ts +0 -4
  283. package/src/prover/smt/solver/logic-tactics.ts +355 -0
  284. package/src/prover/smt/solver/lp/bound-propagator.ts +7 -26
  285. package/src/prover/smt/solver/lp/constraints.ts +1 -8
  286. package/src/prover/smt/solver/lp/containers.ts +18 -31
  287. package/src/prover/smt/solver/lp/core-solver.ts +35 -37
  288. package/src/prover/smt/solver/lp/cross-nested.ts +4 -21
  289. package/src/prover/smt/solver/lp/dep-intervals.ts +6 -24
  290. package/src/prover/smt/solver/lp/dependency.ts +0 -5
  291. package/src/prover/smt/solver/lp/dioph-eq.ts +8 -103
  292. package/src/prover/smt/solver/lp/explanation.ts +0 -6
  293. package/src/prover/smt/solver/lp/gomory.ts +8 -22
  294. package/src/prover/smt/solver/lp/hnf-cutter.ts +16 -23
  295. package/src/prover/smt/solver/lp/hnf.ts +10 -28
  296. package/src/prover/smt/solver/lp/int-cube.ts +17 -39
  297. package/src/prover/smt/solver/lp/int-solver.ts +3 -35
  298. package/src/prover/smt/solver/lp/lar-solver.ts +70 -83
  299. package/src/prover/smt/solver/lp/lar-term.ts +0 -5
  300. package/src/prover/smt/solver/lp/lp-settings.ts +6 -16
  301. package/src/prover/smt/solver/lp/maximize-term.ts +76 -52
  302. package/src/prover/smt/solver/lp/nex-creator.ts +7 -30
  303. package/src/prover/smt/solver/lp/nex.ts +2 -7
  304. package/src/prover/smt/solver/lp/nla-backoff.ts +0 -5
  305. package/src/prover/smt/solver/lp/nla-basics.ts +48 -30
  306. package/src/prover/smt/solver/lp/nla-core.ts +92 -136
  307. package/src/prover/smt/solver/lp/nla-divisions.ts +31 -43
  308. package/src/prover/smt/solver/lp/nla-emonics.ts +3 -21
  309. package/src/prover/smt/solver/lp/nla-factorization.ts +0 -4
  310. package/src/prover/smt/solver/lp/nla-grobner.ts +177 -149
  311. package/src/prover/smt/solver/lp/nla-horner.ts +2 -12
  312. package/src/prover/smt/solver/lp/nla-intervals.ts +1 -12
  313. package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +15 -42
  314. package/src/prover/smt/solver/lp/nla-monotone.ts +1 -6
  315. package/src/prover/smt/solver/lp/nla-order.ts +0 -13
  316. package/src/prover/smt/solver/lp/nla-patcher.ts +3 -7
  317. package/src/prover/smt/solver/lp/nla-powers.ts +220 -0
  318. package/src/prover/smt/solver/lp/nla-tangents.ts +0 -10
  319. package/src/prover/smt/solver/lp/nla-throttle.ts +0 -6
  320. package/src/prover/smt/solver/lp/nla-transcendentals.ts +324 -0
  321. package/src/prover/smt/solver/lp/nla-types.ts +0 -12
  322. package/src/prover/smt/solver/lp/nla-var-eqs.ts +4 -26
  323. package/src/prover/smt/solver/lp/nra-solver.ts +164 -147
  324. package/src/prover/smt/solver/lp/numeric-pair.ts +0 -4
  325. package/src/prover/smt/solver/lp/pdd-interval.ts +6 -5
  326. package/src/prover/smt/solver/lp/pdd-simplifier.ts +61 -34
  327. package/src/prover/smt/solver/lp/pdd-solver.ts +74 -72
  328. package/src/prover/smt/solver/lp/pdd.ts +730 -358
  329. package/src/prover/smt/solver/lp/random-updater.ts +0 -9
  330. package/src/prover/smt/solver/lp/static-matrix.ts +8 -19
  331. package/src/prover/smt/solver/lp/union-find.ts +5 -5
  332. package/src/prover/smt/solver/macro-finder.ts +530 -0
  333. package/src/prover/smt/solver/mam-compiler.ts +129 -139
  334. package/src/prover/smt/solver/mam-interpreter.ts +0 -21
  335. package/src/prover/smt/solver/max-bv-sharing-tactic.ts +17 -0
  336. package/src/prover/smt/solver/max-cliques.ts +105 -0
  337. package/src/prover/smt/solver/maxcore.ts +310 -0
  338. package/src/prover/smt/solver/maximize-ac-sharing.ts +8 -21
  339. package/src/prover/smt/solver/maxlex.ts +115 -0
  340. package/src/prover/smt/solver/maxsmt-base.ts +106 -0
  341. package/src/prover/smt/solver/maxsmt.ts +92 -0
  342. package/src/prover/smt/solver/mbp/mbp-arith.ts +467 -0
  343. package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +101 -0
  344. package/src/prover/smt/solver/mbp/mbp-plugin.ts +287 -0
  345. package/src/prover/smt/solver/mbp/mbp-qel.ts +48 -0
  346. package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +271 -0
  347. package/src/prover/smt/solver/mbp/mbp-term-graph.ts +606 -0
  348. package/src/prover/smt/solver/model-based-opt.ts +844 -0
  349. package/src/prover/smt/solver/model-checker.ts +20 -63
  350. package/src/prover/smt/solver/model-evaluator.ts +192 -40
  351. package/src/prover/smt/solver/model-finder.ts +14 -32
  352. package/src/prover/smt/solver/model-generator.ts +104 -46
  353. package/src/prover/smt/solver/model-macro-solver.ts +60 -114
  354. package/src/prover/smt/solver/model-printer.ts +214 -0
  355. package/src/prover/smt/solver/mpf.ts +709 -0
  356. package/src/prover/smt/solver/mus.ts +50 -0
  357. package/src/prover/smt/solver/muz/dl-context.ts +382 -0
  358. package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +97 -0
  359. package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +167 -0
  360. package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +125 -0
  361. package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +299 -0
  362. package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +455 -0
  363. package/src/prover/smt/solver/muz/dl-mk-slice.ts +340 -0
  364. package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +163 -0
  365. package/src/prover/smt/solver/muz/dl-rule-set.ts +273 -0
  366. package/src/prover/smt/solver/muz/dl-rule-transformer.ts +123 -0
  367. package/src/prover/smt/solver/muz/dl-rule.ts +495 -0
  368. package/src/prover/smt/solver/muz/hnf.ts +201 -0
  369. package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +176 -0
  370. package/src/prover/smt/solver/muz/horn-tactic.ts +214 -0
  371. package/src/prover/smt/solver/muz/rule-properties.ts +359 -0
  372. package/src/prover/smt/solver/muz/spacer-context.ts +1404 -0
  373. package/src/prover/smt/solver/muz/spacer-dl-interface.ts +52 -0
  374. package/src/prover/smt/solver/muz/spacer-generalizers.ts +241 -0
  375. package/src/prover/smt/solver/muz/spacer-manager.ts +127 -0
  376. package/src/prover/smt/solver/muz/spacer-pdr.ts +219 -0
  377. package/src/prover/smt/solver/muz/spacer-prop-solver.ts +333 -0
  378. package/src/prover/smt/solver/muz/spacer-util.ts +282 -0
  379. package/src/prover/smt/solver/muz/substitution.ts +203 -0
  380. package/src/prover/smt/solver/nla2bv-tactic.ts +285 -0
  381. package/src/prover/smt/solver/nlqsat.ts +484 -0
  382. package/src/prover/smt/solver/nlsat/algebraic.ts +357 -236
  383. package/src/prover/smt/solver/nlsat/atoms.ts +73 -54
  384. package/src/prover/smt/solver/nlsat/evaluator.ts +16 -22
  385. package/src/prover/smt/solver/nlsat/explain.ts +429 -275
  386. package/src/prover/smt/solver/nlsat/interval-set.ts +9 -51
  387. package/src/prover/smt/solver/nlsat/levelwise.ts +477 -344
  388. package/src/prover/smt/solver/nlsat/mpbq.ts +47 -14
  389. package/src/prover/smt/solver/nlsat/polynomial.ts +2385 -832
  390. package/src/prover/smt/solver/nlsat/solver.ts +297 -156
  391. package/src/prover/smt/solver/nlsat/transcendental-eval.ts +310 -0
  392. package/src/prover/smt/solver/nlsat/transcendentals.ts +391 -0
  393. package/src/prover/smt/solver/nlsat/types.ts +0 -9
  394. package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +9 -51
  395. package/src/prover/smt/solver/nlsat/upolynomial.ts +49 -109
  396. package/src/prover/smt/solver/nlsat-tactic.ts +82 -0
  397. package/src/prover/smt/solver/nnf.ts +112 -61
  398. package/src/prover/smt/solver/normalize-bounds.ts +53 -0
  399. package/src/prover/smt/solver/occf.ts +97 -0
  400. package/src/prover/smt/solver/opt-context.ts +801 -0
  401. package/src/prover/smt/solver/opt-nlsat.ts +386 -0
  402. package/src/prover/smt/solver/opt-pareto.ts +301 -0
  403. package/src/prover/smt/solver/opt-preprocess.ts +101 -0
  404. package/src/prover/smt/solver/opt-solver.ts +312 -0
  405. package/src/prover/smt/solver/opt-value.ts +55 -0
  406. package/src/prover/smt/solver/optsmt.ts +692 -0
  407. package/src/prover/smt/solver/parallel-tactic.ts +299 -0
  408. package/src/prover/smt/solver/pattern-inference.ts +21 -26
  409. package/src/prover/smt/solver/pb-rewriter.ts +281 -0
  410. package/src/prover/smt/solver/pb2bv-tactic.ts +540 -0
  411. package/src/prover/smt/solver/poly-rewriter.ts +261 -79
  412. package/src/prover/smt/solver/probes.ts +577 -0
  413. package/src/prover/smt/solver/propagate-values.ts +37 -30
  414. package/src/prover/smt/solver/proto-model.ts +650 -66
  415. package/src/prover/smt/solver/pull-quant.ts +28 -23
  416. package/src/prover/smt/solver/purify-arith.ts +632 -0
  417. package/src/prover/smt/solver/push-app-ite.ts +37 -0
  418. package/src/prover/smt/solver/qe-arith-plugin.ts +1096 -0
  419. package/src/prover/smt/solver/qe-lite-der.ts +2 -31
  420. package/src/prover/smt/solver/qe-lite-fm.ts +4 -28
  421. package/src/prover/smt/solver/qe-lite.ts +41 -51
  422. package/src/prover/smt/solver/qe-mbp.ts +270 -0
  423. package/src/prover/smt/solver/qe.ts +1499 -0
  424. package/src/prover/smt/solver/qel.ts +25 -0
  425. package/src/prover/smt/solver/qi-queue.ts +0 -16
  426. package/src/prover/smt/solver/qsat.ts +829 -0
  427. package/src/prover/smt/solver/quant-hoist.ts +196 -0
  428. package/src/prover/smt/solver/quant-tactics.ts +17 -74
  429. package/src/prover/smt/solver/quantifier-analyzer.ts +26 -47
  430. package/src/prover/smt/solver/quantifier-manager.ts +22 -32
  431. package/src/prover/smt/solver/quasi-macros.ts +243 -0
  432. package/src/prover/smt/solver/random-gen.ts +0 -2
  433. package/src/prover/smt/solver/rational.ts +45 -8
  434. package/src/prover/smt/solver/recfun-decl-plugin.ts +262 -0
  435. package/src/prover/smt/solver/recfun-rewriter.ts +107 -0
  436. package/src/prover/smt/solver/reduce-args.ts +225 -0
  437. package/src/prover/smt/solver/reduce-bv-size.ts +119 -0
  438. package/src/prover/smt/solver/ref-vector.ts +0 -6
  439. package/src/prover/smt/solver/relevancy.ts +2 -16
  440. package/src/prover/smt/solver/rewriter-tpl.ts +59 -135
  441. package/src/prover/smt/solver/rewriter.ts +507 -144
  442. package/src/prover/smt/solver/rlimit.ts +46 -24
  443. package/src/prover/smt/solver/sat/asymm-branch.ts +325 -0
  444. package/src/prover/smt/solver/sat/big.ts +177 -0
  445. package/src/prover/smt/solver/sat/clause-use-list.ts +71 -0
  446. package/src/prover/smt/solver/sat/clause.ts +203 -0
  447. package/src/prover/smt/solver/sat/cleaner.ts +94 -0
  448. package/src/prover/smt/solver/sat/config.ts +122 -0
  449. package/src/prover/smt/solver/sat/consequences.ts +203 -0
  450. package/src/prover/smt/solver/sat/elim-eqs.ts +142 -0
  451. package/src/prover/smt/solver/sat/goal2sat.ts +579 -0
  452. package/src/prover/smt/solver/sat/inc-sat-solver.ts +464 -0
  453. package/src/prover/smt/solver/sat/model-converter.ts +136 -0
  454. package/src/prover/smt/solver/sat/pb-constraint.ts +268 -0
  455. package/src/prover/smt/solver/sat/pb-solver.ts +1596 -0
  456. package/src/prover/smt/solver/sat/probing.ts +170 -0
  457. package/src/prover/smt/solver/sat/sat-tactic.ts +53 -0
  458. package/src/prover/smt/solver/sat/sat2goal.ts +189 -0
  459. package/src/prover/smt/solver/sat/scc.ts +142 -0
  460. package/src/prover/smt/solver/sat/simplifier.ts +1618 -0
  461. package/src/prover/smt/solver/sat/solver.ts +2107 -0
  462. package/src/prover/smt/solver/sat/var-queue.ts +117 -0
  463. package/src/prover/smt/solver/sat/watch-list.ts +140 -0
  464. package/src/prover/smt/solver/search-tree.ts +284 -0
  465. package/src/prover/smt/solver/seq-axioms.ts +995 -0
  466. package/src/prover/smt/solver/seq-decl-plugin.ts +819 -0
  467. package/src/prover/smt/solver/seq-derive.ts +1298 -0
  468. package/src/prover/smt/solver/seq-eq-approx.ts +236 -0
  469. package/src/prover/smt/solver/seq-eq-solver.ts +439 -0
  470. package/src/prover/smt/solver/seq-factory.ts +89 -0
  471. package/src/prover/smt/solver/seq-monadic.ts +730 -0
  472. package/src/prover/smt/solver/seq-range-predicate.ts +235 -0
  473. package/src/prover/smt/solver/seq-re-rewriter.ts +1171 -0
  474. package/src/prover/smt/solver/seq-re-util.ts +758 -0
  475. package/src/prover/smt/solver/seq-regex-bisim.ts +144 -0
  476. package/src/prover/smt/solver/seq-regex-live.ts +200 -0
  477. package/src/prover/smt/solver/seq-rewriter.ts +2404 -0
  478. package/src/prover/smt/solver/seq-skolem.ts +294 -0
  479. package/src/prover/smt/solver/seq-subset.ts +165 -0
  480. package/src/prover/smt/solver/seq-view-witness.ts +353 -0
  481. package/src/prover/smt/solver/smt-consequences.ts +297 -0
  482. package/src/prover/smt/solver/smt-kernel.ts +124 -0
  483. package/src/prover/smt/solver/smt-logics.ts +66 -0
  484. package/src/prover/smt/solver/smt-setup.ts +589 -0
  485. package/src/prover/smt/solver/smt2-printer.ts +765 -0
  486. package/src/prover/smt/solver/smtlib-parser.ts +3546 -406
  487. package/src/prover/smt/solver/smtlib-script.ts +2134 -0
  488. package/src/prover/smt/solver/solve-eqs.ts +928 -0
  489. package/src/prover/smt/solver/solver.ts +135 -40
  490. package/src/prover/smt/solver/sort.ts +1 -5
  491. package/src/prover/smt/solver/static-features.ts +314 -0
  492. package/src/prover/smt/solver/sticky-generations.ts +0 -6
  493. package/src/prover/smt/solver/tactic.ts +2141 -0
  494. package/src/prover/smt/solver/term-enumeration.ts +205 -0
  495. package/src/prover/smt/solver/theory-array.ts +1240 -0
  496. package/src/prover/smt/solver/theory-bv.ts +1210 -0
  497. package/src/prover/smt/solver/theory-char.ts +355 -0
  498. package/src/prover/smt/solver/theory-datatype.ts +598 -0
  499. package/src/prover/smt/solver/theory-finite-set.ts +30 -0
  500. package/src/prover/smt/solver/theory-fpa.ts +389 -0
  501. package/src/prover/smt/solver/theory-lra-axioms.ts +55 -25
  502. package/src/prover/smt/solver/theory-lra-bounds.ts +31 -11
  503. package/src/prover/smt/solver/theory-lra-final-check.ts +60 -91
  504. package/src/prover/smt/solver/theory-lra-internalize.ts +96 -53
  505. package/src/prover/smt/solver/theory-lra-model.ts +23 -53
  506. package/src/prover/smt/solver/theory-lra-propagate.ts +34 -42
  507. package/src/prover/smt/solver/theory-lra-state.ts +7 -28
  508. package/src/prover/smt/solver/theory-lra.ts +189 -9
  509. package/src/prover/smt/solver/theory-pb.ts +951 -0
  510. package/src/prover/smt/solver/theory-polymorphism.ts +58 -0
  511. package/src/prover/smt/solver/theory-recfun.ts +307 -0
  512. package/src/prover/smt/solver/theory-seq-regex.ts +867 -0
  513. package/src/prover/smt/solver/theory-seq-solve.ts +1373 -0
  514. package/src/prover/smt/solver/theory-seq-state.ts +852 -0
  515. package/src/prover/smt/solver/theory-seq.ts +961 -0
  516. package/src/prover/smt/solver/theory-without-terms.ts +24 -0
  517. package/src/prover/smt/solver/theory.ts +189 -0
  518. package/src/prover/smt/solver/tseitin-cnf.ts +486 -0
  519. package/src/prover/smt/solver/var-subst.ts +37 -39
  520. package/src/prover/smt/table.ts +3 -10
  521. package/src/prover/smt/types.ts +146 -0
  522. package/src/prover/tlapm/cache.ts +74 -48
  523. package/src/prover/tlapm/ocaml-marshal.ts +19 -21
  524. package/src/prover/tlapm/tlapm.ts +21 -20
  525. package/src/prover/tlapm-library.ts +3208 -0
  526. package/src/prover/verdict.ts +9 -2
  527. package/src/prover/zenon/check/check.ts +1 -11
  528. package/src/prover/zenon/check/definitions.ts +5 -15
  529. package/src/prover/zenon/check/equality.ts +0 -8
  530. package/src/prover/zenon/check/functions.ts +0 -4
  531. package/src/prover/zenon/check/keys.ts +0 -7
  532. package/src/prover/zenon/check/propositional.ts +0 -3
  533. package/src/prover/zenon/check/records.ts +1 -6
  534. package/src/prover/zenon/check/relations.ts +2 -14
  535. package/src/prover/zenon/check/rewrites.ts +2 -21
  536. package/src/prover/zenon/check/sets.ts +40 -61
  537. package/src/prover/zenon/check/terms.ts +1 -19
  538. package/src/prover/zenon/check/tla.ts +0 -6
  539. package/src/prover/zenon/decide.ts +10 -19
  540. package/src/prover/zenon/encode.ts +0 -9
  541. package/src/prover/zenon/eqrel.ts +2 -15
  542. package/src/prover/zenon/equality-rules.ts +24 -6
  543. package/src/prover/zenon/expr.ts +29 -28
  544. package/src/prover/zenon/index-table.ts +33 -61
  545. package/src/prover/zenon/isar-case.ts +9 -21
  546. package/src/prover/zenon/isar.ts +37 -67
  547. package/src/prover/zenon/limits.ts +0 -4
  548. package/src/prover/zenon/llproof.ts +2 -22
  549. package/src/prover/zenon/mltoll.ts +66 -106
  550. package/src/prover/zenon/node.ts +20 -15
  551. package/src/prover/zenon/ocaml.ts +1 -17
  552. package/src/prover/zenon/parse.ts +9 -13
  553. package/src/prover/zenon/phrase.ts +2 -14
  554. package/src/prover/zenon/proof.ts +0 -11
  555. package/src/prover/zenon/propositional-rules.ts +0 -7
  556. package/src/prover/zenon/rules.ts +3 -8
  557. package/src/prover/zenon/search.ts +11 -35
  558. package/src/prover/zenon/tla/functions.ts +59 -33
  559. package/src/prover/zenon/tla/llproof.ts +67 -78
  560. package/src/prover/zenon/tla/records.ts +57 -35
  561. package/src/prover/zenon/tla/rewrites.ts +12 -21
  562. package/src/prover/zenon/tla/sets.ts +88 -59
  563. package/src/prover/zenon/tla/terms.ts +0 -8
  564. package/src/prover/zenon/tla/tla.ts +66 -66
  565. package/src/randomization.ts +81 -35
  566. package/src/resolve.ts +1132 -430
  567. package/src/runtime.ts +33 -23
  568. package/src/sany/builtins.ts +11 -14
  569. package/src/sany/generation.ts +383 -0
  570. package/src/sany/generator-def-entries.ts +210 -0
  571. package/src/sany/generator-definitions.ts +688 -0
  572. package/src/sany/generator-expressions.ts +1108 -0
  573. package/src/sany/generator-proofs.ts +665 -0
  574. package/src/sany/generator.ts +192 -2764
  575. package/src/sany/levels.ts +5 -35
  576. package/src/sany/lexer.ts +61 -80
  577. package/src/sany/linter.ts +0 -10
  578. package/src/sany/modules.ts +5 -7
  579. package/src/sany/nodes.ts +6 -44
  580. package/src/sany/parse-error.ts +39 -117
  581. package/src/sany/report.ts +32 -69
  582. package/src/sany/selectors.ts +60 -82
  583. package/src/sany/source.ts +1 -17
  584. package/src/sany/xml.ts +37 -120
  585. package/src/search.ts +913 -227
  586. package/src/simulate.ts +765 -0
  587. package/src/spec-description.ts +198 -104
  588. package/src/standard-definitions.ts +4 -4
  589. package/src/standard-modules.ts +302 -99
  590. package/src/state-graph.ts +52 -33
  591. package/src/subexpressions.ts +578 -166
  592. package/src/substitution-levels.ts +7 -7
  593. package/src/successors.ts +299 -108
  594. package/src/symmetry.ts +37 -28
  595. package/src/tableau.ts +29 -26
  596. package/src/tlc/fingerprint.ts +267 -79
  597. package/src/tlc/jar-data.ts +122 -6
  598. package/src/tlc/messages.ts +127 -56
  599. package/src/tlc/order.ts +53 -72
  600. package/src/tlc/random.ts +38 -49
  601. package/src/tlc/replay.ts +579 -230
  602. package/src/tlc/summary.ts +64 -60
  603. package/src/tlc/tlc-operators.ts +83 -47
  604. package/src/tlc/tlcext-operators.ts +205 -127
  605. package/src/tlc/trace-spec.ts +235 -0
  606. package/src/tlc/value-stream.ts +139 -0
  607. package/src/tlc/version.ts +1 -4
  608. package/src/trace-liveness.ts +529 -0
  609. package/src/transfer.ts +22 -25
  610. package/src/typed-tier.ts +6556 -0
  611. package/src/typescript/actions.ts +479 -0
  612. package/src/typescript/collections.ts +614 -0
  613. package/src/typescript/compile.ts +63 -0
  614. package/src/typescript/context.ts +94 -0
  615. package/src/typescript/emit.ts +121 -0
  616. package/src/typescript/expressions.ts +496 -0
  617. package/src/typescript/formula.ts +154 -0
  618. package/src/typescript/functions.ts +284 -0
  619. package/src/typescript/model.ts +162 -0
  620. package/src/typescript/names.ts +114 -0
  621. package/src/typescript/program.ts +48 -0
  622. package/src/typescript/properties.ts +139 -0
  623. package/src/typescript/scope.ts +112 -0
  624. package/src/typescript/steps.ts +167 -0
  625. package/src/typescript/types.ts +171 -0
  626. package/src/values.ts +945 -526
  627. package/src/worker.ts +7 -8
  628. package/src/prover/isabelle/isar/statement.ts +0 -57
  629. package/src/prover/smt/solver/z3-license.txt +0 -10
  630. package/src/prover/tlaps-module.ts +0 -510
  631. package/src/prover/zenon/LICENSE +0 -32
@@ -1,10 +1,5 @@
1
- // Ported from Zenon's ext_tla.ml, as shipped in tlapm. Copyright 2008 INRIA, see LICENSE.
2
- //
3
- // The rules for sets: membership in each kind of set, set equality and inclusion.
4
-
5
1
  import { isApp, type Expr } from "../expr";
6
- import type { Priority } from "../node";
7
- import { makeRule, type Rule } from "../proof";
2
+ import { makeRule } from "../proof";
8
3
  import {
9
4
  equal,
10
5
  getBranches,
@@ -28,25 +23,36 @@ const decomposeAdd = (set: Expr): [Expr[], Expr] => {
28
23
  return [elements, rest];
29
24
  };
30
25
 
26
+ const BINARY_SET_RULES = new Map<
27
+ string,
28
+ [
29
+ "in_cup" | "in_cap" | "in_setminus",
30
+ "notin_cup" | "notin_cap" | "notin_setminus",
31
+ boolean,
32
+ boolean,
33
+ ]
34
+ >([
35
+ ["TLA.cup", ["in_cup", "notin_cup", true, false]],
36
+ ["TLA.cap", ["in_cap", "notin_cap", false, true]],
37
+ ["TLA.setminus", ["in_setminus", "notin_setminus", false, true]],
38
+ ]);
39
+
31
40
  export const getMembershipNodes = (literal: Literal): Item[] | undefined => {
32
41
  const exprs = literal.context.exprs;
33
42
  const formula = literal.formula;
34
43
  const isNegated = literal.isNegated;
35
44
  const relation = literal.relation;
36
- const node = (priority: Priority, rule: Rule, branches: Expr[][]) =>
37
- makeExtensionNode(literal, priority, rule, branches);
38
- const instance = (priority: Priority, quantified: Expr, term: Expr) =>
39
- makeInstanceNode(literal, priority, quantified, term);
40
45
  if (relation?.symbol === "TLA.in") {
41
46
  const element = relation.args[0];
42
47
  const set = relation.args[1];
43
48
  if (!isNegated && isVariable(set, "TLA.emptyset"))
44
- return node("prop", makeRule("in_emptyset", [formula, element]), []);
49
+ return makeExtensionNode(literal, "prop", makeRule("in_emptyset", [formula, element]), []);
45
50
  if (isApp(set, "TLA.upair", 2)) {
46
51
  const first = equal(exprs, element, set.args[0]);
47
52
  const second = equal(exprs, element, set.args[1]);
48
53
  return isNegated
49
- ? node(
54
+ ? makeExtensionNode(
55
+ literal,
50
56
  "prop",
51
57
  makeRule("notin_upair", [
52
58
  formula,
@@ -58,7 +64,8 @@ export const getMembershipNodes = (literal: Literal): Item[] | undefined => {
58
64
  ]),
59
65
  [[exprs.enot(first), exprs.enot(second)]],
60
66
  )
61
- : node(
67
+ : makeExtensionNode(
68
+ literal,
62
69
  "prop",
63
70
  makeRule("in_upair", [formula, first, second, element, set.args[0], set.args[1]]),
64
71
  [[first], [second]],
@@ -72,35 +79,54 @@ export const getMembershipNodes = (literal: Literal): Item[] | undefined => {
72
79
  const formulas = isEmptyRest
73
80
  ? equalities
74
81
  : [...equalities, member(exprs, element, decomposed[1])];
75
- return node("prop", makeRule("in_addElt", [formula, element, set]), getBranches(formulas));
82
+ return makeExtensionNode(
83
+ literal,
84
+ "prop",
85
+ makeRule("in_addElt", [formula, element, set]),
86
+ getBranches(formulas),
87
+ );
76
88
  }
77
89
  const inequalities = decomposed[0].map((inner) => exprs.enot(equal(exprs, element, inner)));
78
90
  const formulas = isEmptyRest
79
91
  ? inequalities
80
92
  : [exprs.enot(member(exprs, element, decomposed[1])), ...inequalities];
81
- return node("prop", makeRule("notin_addElt", [formula, element, set]), [formulas]);
93
+ return makeExtensionNode(literal, "prop", makeRule("notin_addElt", [formula, element, set]), [
94
+ formulas,
95
+ ]);
82
96
  }
83
97
  if (isApp(set, "TLA.set"))
84
98
  return isNegated
85
- ? node("prop", makeRule("notin_set", [formula, element, set]), [
99
+ ? makeExtensionNode(literal, "prop", makeRule("notin_set", [formula, element, set]), [
86
100
  set.args.map((inner) => exprs.enot(equal(exprs, element, inner))),
87
101
  ])
88
- : node(
102
+ : makeExtensionNode(
103
+ literal,
89
104
  "prop",
90
105
  makeRule("in_set", [formula, element, set]),
91
106
  getBranches(set.args.map((inner) => equal(exprs, element, inner))),
92
107
  );
93
108
  if (isNegated && set.kind === "meta")
94
- return instance({ instance: set.args[0] }, set.args[0], exprs.eapp("TLA.set", [element]));
109
+ return makeInstanceNode(
110
+ literal,
111
+ { instance: set.args[0] },
112
+ set.args[0],
113
+ exprs.eapp("TLA.set", [element]),
114
+ );
95
115
  if (isApp(set, "TLA.SUBSET", 1)) {
96
116
  const subset = exprs.eapp("TLA.subseteq", [element, set.args[0]]);
97
117
  return isNegated
98
- ? node(
118
+ ? makeExtensionNode(
119
+ literal,
99
120
  "prop",
100
121
  makeRule("notin_SUBSET", [formula, exprs.enot(subset), element, set.args[0]]),
101
122
  [[exprs.enot(subset)]],
102
123
  )
103
- : node("prop", makeRule("in_SUBSET", [formula, subset, element, set.args[0]]), [[subset]]);
124
+ : makeExtensionNode(
125
+ literal,
126
+ "prop",
127
+ makeRule("in_SUBSET", [formula, subset, element, set.args[0]]),
128
+ [[subset]],
129
+ );
104
130
  }
105
131
  if (isApp(set, "TLA.UNION", 1)) {
106
132
  const bound = exprs.newVar();
@@ -110,27 +136,20 @@ export const getMembershipNodes = (literal: Literal): Item[] | undefined => {
110
136
  exprs.eand(member(exprs, bound, set.args[0]), member(exprs, element, bound)),
111
137
  );
112
138
  return isNegated
113
- ? node(
139
+ ? makeExtensionNode(
140
+ literal,
114
141
  "arity",
115
142
  makeRule("notin_UNION", [formula, exprs.enot(exists), element, set.args[0]]),
116
143
  [[exprs.enot(exists)]],
117
144
  )
118
- : node("prop", makeRule("in_UNION", [formula, exists, element, set.args[0]]), [[exists]]);
145
+ : makeExtensionNode(
146
+ literal,
147
+ "prop",
148
+ makeRule("in_UNION", [formula, exists, element, set.args[0]]),
149
+ [[exists]],
150
+ );
119
151
  }
120
- const binarySetRules: Record<
121
- string,
122
- [
123
- "in_cup" | "in_cap" | "in_setminus",
124
- "notin_cup" | "notin_cap" | "notin_setminus",
125
- boolean,
126
- boolean,
127
- ]
128
- > = {
129
- "TLA.cup": ["in_cup", "notin_cup", true, false],
130
- "TLA.cap": ["in_cap", "notin_cap", false, true],
131
- "TLA.setminus": ["in_setminus", "notin_setminus", false, true],
132
- };
133
- const binarySetRule = set.kind === "app" ? binarySetRules[set.symbol] : undefined;
152
+ const binarySetRule = set.kind === "app" ? BINARY_SET_RULES.get(set.symbol) : undefined;
134
153
  if (binarySetRule !== undefined && set.args.length === 2) {
135
154
  const first = member(exprs, element, set.args[0]);
136
155
  const secondPositive = member(exprs, element, set.args[1]);
@@ -138,7 +157,8 @@ export const getMembershipNodes = (literal: Literal): Item[] | undefined => {
138
157
  const second = isMinus !== isNegated ? exprs.enot(secondPositive) : secondPositive;
139
158
  const firstLiteral = isNegated ? exprs.enot(first) : first;
140
159
  const isSplit = isNegated ? binarySetRule[3] : binarySetRule[2];
141
- return node(
160
+ return makeExtensionNode(
161
+ literal,
142
162
  "prop",
143
163
  makeRule(isNegated ? binarySetRule[1] : binarySetRule[0], [
144
164
  formula,
@@ -156,7 +176,8 @@ export const getMembershipNodes = (literal: Literal): Item[] | undefined => {
156
176
  const inBase = member(exprs, element, set.args[0]);
157
177
  const holds = exprs.substitute([[predicate.args[0], element]], predicate.args[1]);
158
178
  return isNegated
159
- ? node(
179
+ ? makeExtensionNode(
180
+ literal,
160
181
  "prop",
161
182
  makeRule("notin_subsetof", [
162
183
  formula,
@@ -168,7 +189,8 @@ export const getMembershipNodes = (literal: Literal): Item[] | undefined => {
168
189
  ]),
169
190
  [[exprs.enot(inBase)], [exprs.enot(holds)]],
170
191
  )
171
- : node(
192
+ : makeExtensionNode(
193
+ literal,
172
194
  "prop",
173
195
  makeRule("in_subsetof", [formula, inBase, holds, element, set.args[0], predicate]),
174
196
  [[inBase, holds]],
@@ -186,7 +208,8 @@ export const getMembershipNodes = (literal: Literal): Item[] | undefined => {
186
208
  ),
187
209
  );
188
210
  const result = isNegated ? exprs.enot(exists) : exists;
189
- return node(
211
+ return makeExtensionNode(
212
+ literal,
190
213
  { instance: result },
191
214
  makeRule(isNegated ? "notin_setofall" : "in_setofall", [
192
215
  formula,
@@ -207,20 +230,22 @@ export const getSetEqualityNodes = (literal: Literal): Item[] | undefined => {
207
230
  const formula = literal.formula;
208
231
  const isNegated = literal.isNegated;
209
232
  const relation = literal.relation;
210
- const node = (priority: Priority, rule: Rule, branches: Expr[][]) =>
211
- makeExtensionNode(literal, priority, rule, branches);
212
233
  if (relation?.symbol !== "=") return undefined;
213
234
  const left = relation.args[0];
214
235
  const right = relation.args[1];
215
236
  if (!isNegated && isVariable(right, "TLA.emptyset")) {
216
237
  const bound = exprs.newVar();
217
238
  const empty = exprs.eall(bound, "", exprs.enot(member(exprs, bound, left)));
218
- return node("arity", makeRule("setequalempty", [formula, empty, left]), [[empty]]);
239
+ return makeExtensionNode(literal, "arity", makeRule("setequalempty", [formula, empty, left]), [
240
+ [empty],
241
+ ]);
219
242
  }
220
243
  if (!isNegated && isVariable(left, "TLA.emptyset")) {
221
244
  const bound = exprs.newVar();
222
245
  const empty = exprs.eall(bound, "", exprs.enot(member(exprs, bound, right)));
223
- return node("arity", makeRule("setemptyequal", [formula, empty, right]), [[empty]]);
246
+ return makeExtensionNode(literal, "arity", makeRule("setemptyequal", [formula, empty, right]), [
247
+ [empty],
248
+ ]);
224
249
  }
225
250
  if (isConstructor(SET_CONSTRUCTORS, left) || isConstructor(SET_CONSTRUCTORS, right)) {
226
251
  const bound = exprs.newVar();
@@ -230,7 +255,8 @@ export const getSetEqualityNodes = (literal: Literal): Item[] | undefined => {
230
255
  exprs.eequiv(member(exprs, bound, left), member(exprs, bound, right)),
231
256
  );
232
257
  const result = isNegated ? exprs.enot(extensional) : extensional;
233
- return node(
258
+ return makeExtensionNode(
259
+ literal,
234
260
  { instance: result },
235
261
  makeRule(isNegated ? "notsetequal" : "setequal", [formula, result, left, right]),
236
262
  [[result]],
@@ -239,13 +265,10 @@ export const getSetEqualityNodes = (literal: Literal): Item[] | undefined => {
239
265
  return undefined;
240
266
  };
241
267
 
242
- // A metavariable in a set, against the disequalities of that set.
243
268
  export const getMetaMembershipNodes = (literal: Literal): Item[] | undefined => {
244
269
  const exprs = literal.context.exprs;
245
270
  const index = literal.context.index;
246
271
  const relation = literal.relation;
247
- const node = (priority: Priority, rule: Rule, branches: Expr[][]) =>
248
- makeExtensionNode(literal, priority, rule, branches);
249
272
  if (relation?.symbol === "TLA.in" && relation.args[0].kind === "meta") {
250
273
  const bound = exprs.newVar();
251
274
  return index.findDisequalities(relation.args[1]).flatMap((disequality) => {
@@ -257,7 +280,8 @@ export const getMetaMembershipNodes = (literal: Literal): Item[] | undefined =>
257
280
  exprs.eequiv(member(exprs, bound, sides[0]), member(exprs, bound, sides[1])),
258
281
  ),
259
282
  );
260
- return node(
283
+ return makeExtensionNode(
284
+ literal,
261
285
  { instance: different },
262
286
  makeRule("notsetequal", [disequality, different, sides[0], sides[1]]),
263
287
  [[different]],
@@ -272,8 +296,6 @@ export const getSubsetNodes = (literal: Literal): Item[] | undefined => {
272
296
  const formula = literal.formula;
273
297
  const isNegated = literal.isNegated;
274
298
  const relation = literal.relation;
275
- const node = (priority: Priority, rule: Rule, branches: Expr[][]) =>
276
- makeExtensionNode(literal, priority, rule, branches);
277
299
  if (relation?.symbol === "TLA.subseteq") {
278
300
  const left = relation.args[0];
279
301
  const right = relation.args[1];
@@ -281,23 +303,30 @@ export const getSubsetNodes = (literal: Literal): Item[] | undefined => {
281
303
  const first = exprs.eapp("TLA.subseteq", [left.args[0], right]);
282
304
  const second = exprs.eapp("TLA.subseteq", [left.args[1], right]);
283
305
  return isNegated
284
- ? node(
306
+ ? makeExtensionNode(
307
+ literal,
285
308
  "arity",
286
309
  makeRule("not_cup_subseteq", [formula, exprs.enot(first), exprs.enot(second)]),
287
310
  [[exprs.enot(first)], [exprs.enot(second)]],
288
311
  )
289
- : node("arity", makeRule("cup_subseteq", [formula, first, second]), [[first, second]]);
312
+ : makeExtensionNode(literal, "arity", makeRule("cup_subseteq", [formula, first, second]), [
313
+ [first, second],
314
+ ]);
290
315
  }
291
316
  if (isApp(right, "TLA.cap", 2)) {
292
- // Zenon builds the same subset twice here, from the second set.
293
- const subset = exprs.eapp("TLA.subseteq", [left, right.args[1]]);
317
+ // Deviation from Zenon: ext_tla.ml builds both subsets from the second set, which is unsound.
318
+ const first = exprs.eapp("TLA.subseteq", [left, right.args[0]]);
319
+ const second = exprs.eapp("TLA.subseteq", [left, right.args[1]]);
294
320
  return isNegated
295
- ? node(
321
+ ? makeExtensionNode(
322
+ literal,
296
323
  "arity",
297
- makeRule("not_subseteq_cap", [formula, exprs.enot(subset), exprs.enot(subset)]),
298
- [[exprs.enot(subset)], [exprs.enot(subset)]],
324
+ makeRule("not_subseteq_cap", [formula, exprs.enot(first), exprs.enot(second)]),
325
+ [[exprs.enot(first)], [exprs.enot(second)]],
299
326
  )
300
- : node("arity", makeRule("subseteq_cap", [formula, subset, subset]), [[subset, subset]]);
327
+ : makeExtensionNode(literal, "arity", makeRule("subseteq_cap", [formula, first, second]), [
328
+ [first, second],
329
+ ]);
301
330
  }
302
331
  }
303
332
  return undefined;
@@ -1,15 +1,9 @@
1
- // Ported from Zenon's ext_tla.ml, as shipped in tlapm. Copyright 2008 INRIA, see LICENSE.
2
- //
3
- // What the rules of the TLA+ extension share: the symbols it knows, a literal taken apart, and the
4
- // nodes it makes.
5
-
6
1
  import { TlaZenonError } from "../../../errors";
7
2
  import { isApp, isRelation, type Expr, type Expressions, type RelationExpr } from "../expr";
8
3
  import type { Index } from "../index-table";
9
4
  import type { Node, Priority } from "../node";
10
5
  import { makeRule, type Rule } from "../proof";
11
6
 
12
- // A node, or Zenon's Stop: the rules after it don't apply to the formula.
13
7
  export type Item = Node | "stop";
14
8
 
15
9
  export const SET_CONSTRUCTORS = [
@@ -88,8 +82,6 @@ export interface TlaContext {
88
82
  exprs: Expressions;
89
83
  }
90
84
 
91
- // A formula that the propositional rules look at: a literal, its atom and, when the atom relates
92
- // two terms, the atom as a relation.
93
85
  export interface Literal {
94
86
  context: TlaContext;
95
87
  formula: Expr;
@@ -1,8 +1,3 @@
1
- // Ported from Zenon's ext_tla.ml, as shipped in tlapm. Copyright 2008 INRIA, see LICENSE.
2
- //
3
- // The TLA+ extension: rules for set theory, functions, records, tuples, CHOOSE, IF and CASE, and
4
- // rewriting a subterm with an equality on the branch.
5
-
6
1
  import {
7
2
  FALSE,
8
3
  isApp,
@@ -12,9 +7,9 @@ import {
12
7
  type NegatedRelationExpr,
13
8
  type RelationExpr,
14
9
  } from "../expr";
15
- import type { Node, Priority } from "../node";
10
+ import type { Node } from "../node";
16
11
  import type { Phrase } from "../parse";
17
- import { makeRule, type Rule } from "../proof";
12
+ import { makeRule } from "../proof";
18
13
  import { getFunctionNodes, getFunctionSetNodes } from "./functions";
19
14
  import { getRecordNodes, getTupleNodes } from "./records";
20
15
  import { getRewriteNodes } from "./rewrites";
@@ -50,7 +45,6 @@ const OTHER_SYMBOLS = [
50
45
  "TLA.box",
51
46
  ];
52
47
 
53
- // The symbols that hypotheses can't define, as Zenon's predef with the tla extension.
54
48
  export const PREDEFINED_SYMBOLS = [
55
49
  "=",
56
50
  ...SET_CONSTRUCTORS,
@@ -58,7 +52,7 @@ export const PREDEFINED_SYMBOLS = [
58
52
  ...OTHER_SYMBOLS,
59
53
  ];
60
54
 
61
- const definition = (
55
+ const makeDefinition = (
62
56
  exprs: Expressions,
63
57
  name: string,
64
58
  symbol: string,
@@ -75,13 +69,12 @@ const definition = (
75
69
  },
76
70
  });
77
71
 
78
- // Zenon's built_in_defs. Expressions belong to one run of the prover, so each run builds them.
79
72
  export const getBuiltInDefinitions = (exprs: Expressions): Phrase[] => {
80
73
  const bound = exprs.evar("x");
81
- const isInSet = exprs.eapp("TLA.in", [bound, exprs.evar("S")]);
74
+ const membership = exprs.eapp("TLA.in", [bound, exprs.evar("S")]);
82
75
  const holds = exprs.eapp("P", [bound]);
83
76
  return [
84
- definition(
77
+ makeDefinition(
85
78
  exprs,
86
79
  "subset_def",
87
80
  "TLA.subseteq",
@@ -91,28 +84,28 @@ export const getBuiltInDefinitions = (exprs: Expressions): Phrase[] => {
91
84
  exprs.elam(bound, "", exprs.eapp("TLA.in", [bound, exprs.evar("B")])),
92
85
  ]),
93
86
  ),
94
- definition(
87
+ makeDefinition(
95
88
  exprs,
96
89
  "bAll_def",
97
90
  "TLA.bAll",
98
91
  ["S", "P"],
99
- exprs.eall(bound, "", exprs.eimply(isInSet, holds)),
92
+ exprs.eall(bound, "", exprs.eimply(membership, holds)),
100
93
  ),
101
- definition(
94
+ makeDefinition(
102
95
  exprs,
103
96
  "bEx_def",
104
97
  "TLA.bEx",
105
98
  ["S", "P"],
106
- exprs.eex(bound, "", exprs.eand(isInSet, holds)),
99
+ exprs.eex(bound, "", exprs.eand(membership, holds)),
107
100
  ),
108
- definition(
101
+ makeDefinition(
109
102
  exprs,
110
103
  "bChoose_def",
111
104
  "TLA.bChoice",
112
105
  ["S", "P"],
113
- exprs.etau(bound, "", exprs.eand(isInSet, holds)),
106
+ exprs.etau(bound, "", exprs.eand(membership, holds)),
114
107
  ),
115
- definition(
108
+ makeDefinition(
116
109
  exprs,
117
110
  "prod_def",
118
111
  "TLA.prod",
@@ -122,7 +115,6 @@ export const getBuiltInDefinitions = (exprs: Expressions): Phrase[] => {
122
115
  ];
123
116
  };
124
117
 
125
- // The elements of a set given by enumeration, and whether it may hold more.
126
118
  const getSetValues = (set: Expr): [Expr[], boolean] => {
127
119
  if (isVariable(set, "TLA.emptyset")) return [[], false];
128
120
  if (isApp(set, "TLA.upair", 2)) return [set.args, false];
@@ -145,34 +137,45 @@ const getBooleanNodes = (literal: Literal): Item[] | undefined => {
145
137
  const isNegated = literal.isNegated;
146
138
  const atom = literal.atom;
147
139
  const relation = literal.relation;
148
- const node = (priority: Priority, rule: Rule, branches: Expr[][]) =>
149
- makeExtensionNode(literal, priority, rule, branches);
150
- const instance = (priority: Priority, quantified: Expr, term: Expr) =>
151
- makeInstanceNode(literal, priority, quantified, term);
152
- if (atom.kind === "meta") return instance("arity", atom.args[0], isNegated ? TRUE : FALSE);
140
+ if (atom.kind === "meta")
141
+ return makeInstanceNode(literal, "arity", atom.args[0], isNegated ? TRUE : FALSE);
153
142
  if (relation?.symbol !== "=") return undefined;
154
143
  const left = relation.args[0];
155
144
  const right = relation.args[1];
156
145
  if (right.kind === "true")
157
146
  return isNegated
158
- ? node("prop", makeRule("noteq_x_true", [formula, exprs.enot(left), left]), [
159
- [exprs.enot(left)],
160
- ])
161
- : node("prop", makeRule("eq_x_true", [formula, left, left]), [[left]]);
147
+ ? makeExtensionNode(
148
+ literal,
149
+ "prop",
150
+ makeRule("noteq_x_true", [formula, exprs.enot(left), left]),
151
+ [[exprs.enot(left)]],
152
+ )
153
+ : makeExtensionNode(literal, "prop", makeRule("eq_x_true", [formula, left, left]), [[left]]);
162
154
  if (left.kind === "true")
163
155
  return isNegated
164
- ? node("prop", makeRule("noteq_true_x", [formula, exprs.enot(right), right]), [
165
- [exprs.enot(right)],
166
- ])
167
- : node("prop", makeRule("eq_true_x", [formula, right, right]), [[right]]);
156
+ ? makeExtensionNode(
157
+ literal,
158
+ "prop",
159
+ makeRule("noteq_true_x", [formula, exprs.enot(right), right]),
160
+ [[exprs.enot(right)]],
161
+ )
162
+ : makeExtensionNode(literal, "prop", makeRule("eq_true_x", [formula, right, right]), [
163
+ [right],
164
+ ]);
168
165
  if (!isNegated && right.kind === "false")
169
- return node("prop", makeRule("eq_x_false", [formula, exprs.enot(left), left]), [
170
- [exprs.enot(left)],
171
- ]);
166
+ return makeExtensionNode(
167
+ literal,
168
+ "prop",
169
+ makeRule("eq_x_false", [formula, exprs.enot(left), left]),
170
+ [[exprs.enot(left)]],
171
+ );
172
172
  if (!isNegated && left.kind === "false")
173
- return node("prop", makeRule("eq_false_x", [formula, exprs.enot(right), right]), [
174
- [exprs.enot(right)],
175
- ]);
173
+ return makeExtensionNode(
174
+ literal,
175
+ "prop",
176
+ makeRule("eq_false_x", [formula, exprs.enot(right), right]),
177
+ [[exprs.enot(right)]],
178
+ );
176
179
  return undefined;
177
180
  };
178
181
 
@@ -182,8 +185,6 @@ const getChoiceNodes = (literal: Literal): Item[] | undefined => {
182
185
  const goalness = literal.goalness;
183
186
  const isNegated = literal.isNegated;
184
187
  const relation = literal.relation;
185
- const node = (priority: Priority, rule: Rule, branches: Expr[][]) =>
186
- makeExtensionNode(literal, priority, rule, branches);
187
188
  if (relation === undefined) return undefined;
188
189
  const left = relation.args[0];
189
190
  const right = relation.args[1];
@@ -200,7 +201,8 @@ const getChoiceNodes = (literal: Literal): Item[] | undefined => {
200
201
  const leftBody = exprs.substitute([[left.args[0], bound]], left.args[1]);
201
202
  const rightBody = exprs.substitute([[right.args[0], bound]], right.args[1]);
202
203
  const differ = exprs.eex(bound, left.symbol, exprs.eapp("$notequiv", [leftBody, rightBody]));
203
- return node(
204
+ return makeExtensionNode(
205
+ literal,
204
206
  { instance: differ },
205
207
  makeRule("choose_diff_choose", [
206
208
  formula,
@@ -212,7 +214,9 @@ const getChoiceNodes = (literal: Literal): Item[] | undefined => {
212
214
  );
213
215
  }
214
216
  if (!isNegated && relation.symbol === "$notequiv")
215
- return node("arity", makeRule("notequivdef", []), [[exprs.enot(exprs.eequiv(left, right))]]);
217
+ return makeExtensionNode(literal, "arity", makeRule("notequivdef", []), [
218
+ [exprs.enot(exprs.eequiv(left, right))],
219
+ ]);
216
220
  const choice = right.kind === "tau" ? right : left.kind === "tau" ? left : undefined;
217
221
  if (isNegated && isEquality && choice !== undefined) {
218
222
  const term = right.kind === "tau" ? left : right;
@@ -238,7 +242,6 @@ const getChoiceNodes = (literal: Literal): Item[] | undefined => {
238
242
  return undefined;
239
243
  };
240
244
 
241
- // The bounded quantifier over an enumerated set in \A x : x \in S => P or ~\E x : x \in S /\ P.
242
245
  const getEnumeratedQuantifier = (formula: Expr) => {
243
246
  const isEnumerated = (set: Expr) =>
244
247
  isVariable(set, "TLA.emptyset") ||
@@ -266,14 +269,11 @@ const getEnumeratedQuantifier = (formula: Expr) => {
266
269
  };
267
270
 
268
271
  const getEnumeratedNodes = (literal: Literal): Item[] | undefined => {
269
- const formula = literal.formula;
270
- const instance = (priority: Priority, quantified: Expr, term: Expr) =>
271
- makeInstanceNode(literal, priority, quantified, term);
272
- const enumerated = getEnumeratedQuantifier(formula);
272
+ const enumerated = getEnumeratedQuantifier(literal.formula);
273
273
  if (enumerated !== undefined) {
274
274
  const values = getSetValues(enumerated.set);
275
275
  const nodes: Item[] = values[0].flatMap((value) =>
276
- instance("arity", enumerated.quantified, value),
276
+ makeInstanceNode(literal, "arity", enumerated.quantified, value),
277
277
  );
278
278
  return values[1] ? nodes : [...nodes, "stop"];
279
279
  }
@@ -285,19 +285,21 @@ const getNaturalNodes = (literal: Literal): Item[] | undefined => {
285
285
  const formula = literal.formula;
286
286
  const isNegated = literal.isNegated;
287
287
  const relation = literal.relation;
288
- const node = (priority: Priority, rule: Rule, branches: Expr[][]) =>
289
- makeExtensionNode(literal, priority, rule, branches);
290
- const instance = (priority: Priority, quantified: Expr, term: Expr) =>
291
- makeInstanceNode(literal, priority, quantified, term);
292
288
  if (isNegated && relation?.symbol === "TLA.in" && isVariable(relation.args[1], "arith.N")) {
293
289
  const left = relation.args[0];
294
- if (isVariable(left, "0")) return node("prop", makeRule("in_nat_0", [formula]), []);
290
+ if (isVariable(left, "0"))
291
+ return makeExtensionNode(literal, "prop", makeRule("in_nat_0", [formula]), []);
295
292
  if (isApp(left, "TLA.fapply", 2) && isVariable(left.args[0], "TLA.Succ")) {
296
293
  const previous = exprs.enot(member(exprs, left.args[1], exprs.evar("arith.N")));
297
- return node("prop", makeRule("in_nat_succ", [formula, previous, left.args[1]]), [[previous]]);
294
+ return makeExtensionNode(
295
+ literal,
296
+ "prop",
297
+ makeRule("in_nat_succ", [formula, previous, left.args[1]]),
298
+ [[previous]],
299
+ );
298
300
  }
299
301
  if (left.kind === "meta")
300
- return instance({ instance: left.args[0] }, left.args[0], exprs.evar("0"));
302
+ return makeInstanceNode(literal, { instance: left.args[0] }, left.args[0], exprs.evar("0"));
301
303
  }
302
304
  return undefined;
303
305
  };
@@ -326,8 +328,6 @@ const getPropNodes = (context: TlaContext, formula: Expr, goalness: number): Ite
326
328
  );
327
329
  };
328
330
 
329
- // Zenon's newnodes_inst_bounded: instantiates \A x \in S : P and ~\E x \in S : P with the terms
330
- // known to be in S.
331
331
  const getBoundedInstances = (context: TlaContext, formula: Expr, goalness: number): Node[] => {
332
332
  const exprs = context.exprs;
333
333
  const index = context.index;
@@ -408,14 +408,13 @@ const getBoundedInstances = (context: TlaContext, formula: Expr, goalness: numbe
408
408
 
409
409
  const makePropositionEqualityNode = (
410
410
  exprs: Expressions,
411
- name: "p_eq_l" | "p_eq_r" | "np_eq_l" | "np_eq_r",
411
+ isNegated: boolean,
412
+ isLeft: boolean,
412
413
  formula: Expr,
413
414
  left: Expr,
414
415
  right: Expr,
415
416
  goalness: number,
416
417
  ): Node => {
417
- const isNegated = name === "np_eq_l" || name === "np_eq_r";
418
- const isLeft = name === "p_eq_l" || name === "np_eq_l";
419
418
  const proposition = isNegated && formula.kind === "not" ? formula.args[0] : formula;
420
419
  const equality = equal(exprs, left, right);
421
420
  const differ = exprs.enot(equal(exprs, proposition, isLeft ? left : right));
@@ -424,7 +423,7 @@ const makePropositionEqualityNode = (
424
423
  return {
425
424
  conclusions: [formula, equality],
426
425
  rule: makeRule(
427
- name,
426
+ isNegated ? (isLeft ? "np_eq_l" : "np_eq_r") : isLeft ? "p_eq_l" : "p_eq_r",
428
427
  isNegated
429
428
  ? [formula, equality, differ, rest, proposition, left, right]
430
429
  : [formula, equality, differ, other, formula, left, right],
@@ -444,7 +443,8 @@ const getPropositionEqualityNodes = (context: TlaContext, formula: Expr, goalnes
444
443
  const make = (isLeft: boolean) => (entry: [RelationExpr, number]) =>
445
444
  makePropositionEqualityNode(
446
445
  exprs,
447
- isNegated ? (isLeft ? "np_eq_l" : "np_eq_r") : isLeft ? "p_eq_l" : "p_eq_r",
446
+ isNegated,
447
+ isLeft,
448
448
  formula,
449
449
  entry[0].args[0],
450
450
  entry[0].args[1],
@@ -469,7 +469,8 @@ const getEqualityPropositionNodes = (
469
469
  const make = (isNegated: boolean) => (entry: [Expr, number]) =>
470
470
  makePropositionEqualityNode(
471
471
  exprs,
472
- isNegated ? (isLeft ? "np_eq_l" : "np_eq_r") : isLeft ? "p_eq_l" : "p_eq_r",
472
+ isNegated,
473
+ isLeft,
473
474
  entry[0],
474
475
  formula.args[0],
475
476
  formula.args[1],
@@ -491,8 +492,7 @@ export const getExtensionNodes = (
491
492
  formula: Expr,
492
493
  goalness: number,
493
494
  ): ExtensionNodes => {
494
- // OCaml evaluates the operands of @ right to left, so the last rules run first. The order
495
- // decides the names of fresh variables.
495
+ // OCaml evaluates the operands of @ right to left, so the last rules run first, which decides the names of fresh variables.
496
496
  const bounded = getBoundedInstances(context, formula, goalness);
497
497
  const right = getEqualityPropositionNodes(context, formula, false);
498
498
  const left = getEqualityPropositionNodes(context, formula, true);