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,15 +1,9 @@
1
- // Ported from Zenon's eqrel.ml, as shipped in tlapm. Copyright 2004 INRIA, see LICENSE.
2
- //
3
- // Finds the hypotheses that make a relation reflexive, symmetric or transitive. The prover then
4
- // reasons with those properties directly, and drops the hypotheses that only state them. The
5
- // translation to Isar proves the properties again from the hypotheses that stated them.
6
-
7
1
  import { TRUE, type Expr, type Expressions } from "./expr";
8
2
 
9
3
  export type Direction = "left" | "right";
10
4
 
11
- // Where a hypothesis states a property: the conjunct at `directions`, with the relation's
12
- // arguments bound by the quantifiers at `variables`, counted from the outermost.
5
+ export type RelationProperty = "reflexive" | "symmetric" | "transitive";
6
+
13
7
  export interface Origin {
14
8
  formula: Expr;
15
9
  directions: Direction[];
@@ -21,7 +15,6 @@ interface RelationInfo {
21
15
  symmetric: Origin | undefined;
22
16
  transitive: Origin | undefined;
23
17
  transitiveSymmetric: Origin | undefined;
24
- // The type of the relation's arguments.
25
18
  type: string;
26
19
  }
27
20
 
@@ -30,8 +23,6 @@ interface Bound {
30
23
  type: string;
31
24
  }
32
25
 
33
- // A conjunct of a hypothesis: the variables quantified around it and the literals of its
34
- // disjunction, when they all relate two of those variables by the same symbol.
35
26
  interface Leaves {
36
27
  directions: Direction[];
37
28
  env: Bound[];
@@ -125,7 +116,6 @@ const getPair = (leaf: Expr) => {
125
116
  return [args[0].symbol, args[1].symbol];
126
117
  };
127
118
 
128
- // The leaves as Zenon's partition returns them: positive and negative, each reversed.
129
119
  const partition = (leaves: Expr[]) => ({
130
120
  positive: leaves
131
121
  .filter((leaf) => leaf.kind !== "not")
@@ -137,8 +127,6 @@ const partition = (leaves: Expr[]) => ({
137
127
  .map(getPair),
138
128
  });
139
129
 
140
- // Each check returns the variables that the translation instantiates to prove the property, or
141
- // undefined when the conjunct doesn't state it.
142
130
  const getReflexive = (leaves: Expr[]) => {
143
131
  if (leaves.length !== 1 || leaves[0].kind === "not") return undefined;
144
132
  const pair = getPair(leaves[0]);
@@ -292,7 +280,6 @@ export const createRelations = (exprs: Expressions) => {
292
280
  record.transitive !== undefined)
293
281
  );
294
282
  },
295
- // Where the hypotheses state a relation's properties, for the translation to Isar.
296
283
  get,
297
284
  };
298
285
  };
@@ -1,8 +1,3 @@
1
- // Ported from Zenon's prove.ml, as shipped in tlapm. Copyright 2002 INRIA, see LICENSE.
2
- //
3
- // The rules for equality and other relations: instances that unify a metavariable, matching a
4
- // literal against its negation, congruence, reflexivity, symmetry and transitivity.
5
-
6
1
  import { TlaZenonError } from "../../errors";
7
2
  import {
8
3
  isApp,
@@ -50,7 +45,6 @@ const makeInstance = (
50
45
  ]),
51
46
  );
52
47
  }
53
- // Zenon hands applications to the extension named by the symbol's prefix, and tla has none.
54
48
  if (quantified.kind === "app") return queue;
55
49
  throw new TlaZenonError("Zenon: make_inst on a formula that isn't quantified");
56
50
  };
@@ -1,13 +1,6 @@
1
- // Ported from Zenon's expr.ml, as shipped in tlapm. Copyright 2002 INRIA, see LICENSE.
2
- //
3
- // Formulas and terms, hash-consed so that equal expressions are the same object. Like Zenon,
4
- // equality treats bound variables up to renaming, and a hash ignores the names of bound variables.
5
- // Each run builds its expressions in its own store, so that fresh names and hashes start over.
6
-
7
1
  import { TlaZenonError } from "../../errors";
8
2
  import { combine, createHasher, toInt63, type Int63 } from "./ocaml";
9
3
 
10
- // What every expression caches about itself.
11
4
  interface ExprData {
12
5
  id: number;
13
6
  hash: number;
@@ -24,7 +17,6 @@ export interface VarExpr extends ExprData {
24
17
  args: [];
25
18
  }
26
19
 
27
- // A metavariable stands for a term that instantiates its quantifier.
28
20
  export interface MetaExpr extends ExprData {
29
21
  kind: "meta";
30
22
  symbol: "";
@@ -55,7 +47,6 @@ export interface ConstantExpr extends ExprData {
55
47
  args: [];
56
48
  }
57
49
 
58
- // `symbol` is the type of the bound variable.
59
50
  export interface BinderExpr extends ExprData {
60
51
  kind: "all" | "ex" | "tau" | "lam";
61
52
  symbol: string;
@@ -66,7 +57,6 @@ export type Expr = VarExpr | MetaExpr | AppExpr | NotExpr | BinaryExpr | Constan
66
57
 
67
58
  export type ExprKind = Expr["kind"];
68
59
 
69
- // An application to two arguments, such as an equality or another relation between two terms.
70
60
  export type RelationExpr = AppExpr & { args: [Expr, Expr] };
71
61
 
72
62
  export type NegatedRelationExpr = NotExpr & { args: [RelationExpr] };
@@ -121,8 +111,6 @@ const isBinder = (expression: Expr): expression is BinderExpr =>
121
111
  expression.kind === "tau" ||
122
112
  expression.kind === "lam";
123
113
 
124
- // Zenon's str_union: the names of the first list missing from the second, in reverse, then the
125
- // second. Hashes depend on this order.
126
114
  const unionNames = (left: string[], right: string[]) => {
127
115
  if (left.length === 0) return right;
128
116
  if (right.length === 0) return left;
@@ -139,7 +127,6 @@ const removeName = (name: string, names: string[]) => {
139
127
  export const difference = (left: Expr[], right: Expr[]) =>
140
128
  left.filter((inner) => !right.includes(inner));
141
129
 
142
- // Zenon's union on small sets: the first list's new elements in reverse, then the second list.
143
130
  export const union = (left: Expr[], right: Expr[]) => {
144
131
  const added = difference(left, right);
145
132
  return added.length === 0 ? right : [...added.reverse(), ...right];
@@ -212,7 +199,6 @@ const isEqualBody = (leftVar: Expr, rightVar: Expr, left: Expr, right: Expr) =>
212
199
  );
213
200
  };
214
201
 
215
- // Zenon's HashedExpr.equal on two binders whose children are already hash-consed.
216
202
  const isSameBinder = (left: BinderExpr, right: BinderExpr) =>
217
203
  left.kind === right.kind &&
218
204
  left.symbol === right.symbol &&
@@ -220,8 +206,6 @@ const isSameBinder = (left: BinderExpr, right: BinderExpr) =>
220
206
  ? left.args[1] === right.args[1]
221
207
  : isEqualBody(left.args[0], right.args[0], left.args[1], right.args[1]));
222
208
 
223
- // The symbol is part of the narrowed type, so a failed test for one symbol keeps the expression an
224
- // application for the next test.
225
209
  export const isApp = <Symbol extends string>(
226
210
  expression: Expr,
227
211
  symbol: Symbol,
@@ -231,6 +215,11 @@ export const isApp = <Symbol extends string>(
231
215
  expression.symbol === symbol &&
232
216
  (arity === undefined || expression.args.length === arity);
233
217
 
218
+ export const getStringName = (expression: Expr) =>
219
+ isApp(expression, "$string", 1) && expression.args[0].kind === "var"
220
+ ? expression.args[0].symbol
221
+ : undefined;
222
+
234
223
  export const isMeta = (expression: Expr): expression is MetaExpr => expression.kind === "meta";
235
224
 
236
225
  export const isRelation = (expression: Expr): expression is RelationExpr =>
@@ -239,7 +228,6 @@ export const isRelation = (expression: Expr): expression is RelationExpr =>
239
228
  export const isNegatedRelation = (expression: Expr): expression is NegatedRelationExpr =>
240
229
  expression.kind === "not" && isRelation(expression.args[0]);
241
230
 
242
- // Zenon orders by hash, and only breaks ties structurally.
243
231
  export const compareExprs = (left: Expr, right: Expr): number => {
244
232
  if (left.hash !== right.hash) return left.hash < right.hash ? -1 : 1;
245
233
  if (left === right) return 0;
@@ -263,20 +251,14 @@ const isIrrelevant = (names: string[], map: Substitution) =>
263
251
  const hasConflict = (variable: Expr, map: Substitution) =>
264
252
  map.some((pair) => pair[1].freeVars.includes(variable.symbol));
265
253
 
266
- // The store of one run's expressions, and the operations that build expressions in it.
267
254
  export const createExpressions = () => {
268
255
  const hasher = createHasher();
269
- // Binders are hash-consed by hash, since they're equal up to the names of their variables. Other
270
- // expressions are equal exactly when their kind, symbol and children are, so they're found by
271
- // those before their hash is computed.
272
256
  const binders = new Map<number, BinderExpr[]>();
273
257
  const interned = new Map<number, Expr[]>();
274
- // Numbers for the symbols, so an expression hashes by its symbol and children without strings.
275
258
  const symbolIds = new Map<string, number>();
276
259
  let nextId = FALSE.id + 1;
277
260
  let createdCount = 0;
278
- // Zenon's Ext_focal takes the first five fresh names when the program starts, for its built-in
279
- // definitions, so the first name Zenon gives out is zenon_Vf.
261
+ // Zenon's Ext_focal takes the first five fresh names at startup, so the first name Zenon gives out is zenon_Vf.
280
262
  let nameCounter = "e";
281
263
 
282
264
  const create = <Shape extends Pick<Expr, "kind" | "symbol" | "args">>(
@@ -437,8 +419,6 @@ export const createExpressions = () => {
437
419
  return evar(VAR_PREFIX + nameCounter);
438
420
  };
439
421
 
440
- // A binder's variable for a substitution, renamed when the substituted values capture it, and
441
- // the substitution to apply to its body.
442
422
  const enterBinder = (expression: BinderExpr, map: Substitution): [VarExpr, Substitution] => {
443
423
  const variable = expression.args[0];
444
424
  const rest = map.filter((pair) => pair[0] !== variable);
@@ -486,8 +466,6 @@ export const createExpressions = () => {
486
466
  return results;
487
467
  };
488
468
 
489
- // Zenon's substitute_2nd: also replaces applied symbols bound in the map, for definitions with
490
- // operator parameters. Undefined stands for Zenon's Higher_order exception.
491
469
  const substituteSecondOrder = (map: Substitution, expression: Expr): Expr | undefined => {
492
470
  switch (expression.kind) {
493
471
  case "var":
@@ -529,6 +507,8 @@ export const createExpressions = () => {
529
507
  emeta,
530
508
  eapp,
531
509
  enot,
510
+ binary,
511
+ binder,
532
512
  eand: (left: Expr, right: Expr) => binary("and", left, right),
533
513
  eor: (left: Expr, right: Expr) => binary("or", left, right),
534
514
  eimply: (left: Expr, right: Expr) => binary("imply", left, right),
@@ -1,10 +1,6 @@
1
- // Ported from Zenon's index.ml, as shipped in tlapm. Copyright 2004 INRIA, see LICENSE.
2
- //
3
- // The formulas on the current branch, indexed by head symbol, by the sides of equalities and
4
- // transitive relations, and the cache of proved lemmas. Formulas are added and removed in LIFO
5
- // order as the search descends and backtracks. Lists keep Zenon's order, latest first.
6
-
7
1
  import {
2
+ getStringName,
3
+ isApp,
8
4
  isNegatedRelation,
9
5
  isRelation,
10
6
  type Expr,
@@ -27,7 +23,6 @@ interface Suspect {
27
23
  records: LemmaRecord[];
28
24
  }
29
25
 
30
- // A stack of values per key, as a Hashtbl with Hashtbl.add and Hashtbl.remove.
31
26
  const pushValue = <Key, Value>(table: Map<Key, Value[]>, key: Key, value: Value) => {
32
27
  const values = table.get(key);
33
28
  if (values === undefined) table.set(key, [value]);
@@ -44,7 +39,6 @@ const popValue = <Key, Value>(table: Map<Key, Value[]>, key: Key) => {
44
39
  const getLatestFirst = <Key, Value>(table: Map<Key, Value[]>, key: Key) =>
45
40
  [...(table.get(key) ?? [])].reverse();
46
41
 
47
- // Zenon's head of a term, or undefined for No_head. Taus and metavariables are heads by identity.
48
42
  type Head = string | Expr;
49
43
 
50
44
  export const getHead = (expression: Expr): Head | undefined => {
@@ -68,19 +62,10 @@ export const getHead = (expression: Expr): Head | undefined => {
68
62
  }
69
63
  };
70
64
 
71
- // Zenon indexes formulas by head under a string; every tau shares "t." and every metavariable "".
72
65
  const getHeadKey = (head: Head) =>
73
66
  typeof head === "string" ? head : head.kind === "tau" ? "t." : "";
74
67
 
75
- // Zenon's add_element and remove_element on a table of lists. Removing from a one-element list
76
- // drops the key whatever the element, as Zenon does.
77
- const addElement = <Key, Value>(table: Map<Key, Value[]>, key: Key, value: Value) => {
78
- const values = table.get(key);
79
- if (values === undefined) table.set(key, [value]);
80
- else values.push(value);
81
- };
82
-
83
- // False stands for Zenon's Not_found.
68
+ // Removing from a one-element list drops the key whatever the element, as Zenon does.
84
69
  const removeElement = <Key, Value>(table: Map<Key, Value[]>, key: Key, value: Value) => {
85
70
  const values = table.get(key);
86
71
  if (values === undefined) return false;
@@ -89,9 +74,6 @@ const removeElement = <Key, Value>(table: Map<Key, Value[]>, key: Key, value: Va
89
74
  return true;
90
75
  };
91
76
 
92
- const getValues = <Key, Value>(table: Map<Key, Value[]>, key: Key) => getLatestFirst(table, key);
93
-
94
- // Keys pair a relation with a head. Heads that are expressions are told apart by identity.
95
77
  const getHeadId = (head: Head) => (typeof head === "string" ? `s${head}` : `e${head.id}`);
96
78
 
97
79
  const getRelationKey = (relation: string, head: Head) => `${relation}\u0000${getHeadId(head)}`;
@@ -129,7 +111,6 @@ export const createIndex = (exprs: Expressions) => {
129
111
  const withGoalness = <Formula extends Expr>(list: Formula[]): [Formula, number][] =>
130
112
  list.map((formula) => [formula, getGoalness(formula)]);
131
113
 
132
- // Zenon's negpos: a negation under the head of its operand, anything else under its own head.
133
114
  const actOnHead = (
134
115
  formula: Expr,
135
116
  action: <Formula extends Expr>(
@@ -147,35 +128,23 @@ export const createIndex = (exprs: Expressions) => {
147
128
  if (head !== undefined) action(positive, getHeadKey(head), formula);
148
129
  };
149
130
 
150
- const getStringLiteral = (expression: Expr) =>
151
- expression.kind === "app" &&
152
- expression.symbol === "$string" &&
153
- expression.args.length === 1 &&
154
- expression.args[0].kind === "var"
155
- ? expression.args[0].symbol
156
- : undefined;
157
-
158
131
  const getStringEquality = (formula: Expr) => {
159
- if (formula.kind !== "app" || formula.symbol !== "=" || formula.args.length !== 2)
160
- return undefined;
161
- const rightString = getStringLiteral(formula.args[1]);
132
+ if (!isApp(formula, "=", 2)) return undefined;
133
+ const rightString = getStringName(formula.args[1]);
162
134
  if (rightString !== undefined)
163
135
  return { isReversed: false, term: formula.args[0], value: rightString };
164
- const leftString = getStringLiteral(formula.args[0]);
136
+ const leftString = getStringName(formula.args[0]);
165
137
  return leftString === undefined
166
138
  ? undefined
167
139
  : { isReversed: true, term: formula.args[1], value: leftString };
168
140
  };
169
141
 
170
- const isEquality = (formula: Expr) =>
171
- formula.kind === "app" && formula.symbol === "=" && formula.args.length === 2;
172
-
173
142
  const add = (formula: Expr, goalness: number) => {
174
143
  pushValue(formulas, formula, goalness);
175
- if (isEquality(formula)) {
144
+ if (isApp(formula, "=", 2)) {
176
145
  pushValue(equalLeftRight, formula.args[0], formula.args[1]);
177
146
  pushValue(equalRightLeft, formula.args[1], formula.args[0]);
178
- } else if (formula.kind === "not" && isEquality(formula.args[0])) {
147
+ } else if (formula.kind === "not" && isApp(formula.args[0], "=", 2)) {
179
148
  pushValue(unequalLeftRight, formula.args[0].args[0], formula.args[0].args[1]);
180
149
  pushValue(unequalRightLeft, formula.args[0].args[1], formula.args[0].args[0]);
181
150
  }
@@ -187,7 +156,7 @@ export const createIndex = (exprs: Expressions) => {
187
156
  ]);
188
157
  formulaCount++;
189
158
  topFormulaCount = Math.max(topFormulaCount, formulaCount);
190
- actOnHead(formula, addElement);
159
+ actOnHead(formula, pushValue);
191
160
  const lemma = lemmas.get(formula);
192
161
  if (lemma !== undefined) lemma.isPresent = true;
193
162
  newFormulas.unshift(formula);
@@ -228,10 +197,10 @@ export const createIndex = (exprs: Expressions) => {
228
197
  const stringEquality = getStringEquality(formula);
229
198
  if (stringEquality !== undefined)
230
199
  (stringEquality.isReversed ? reversedStringEqualities : stringEqualities).shift();
231
- if (isEquality(formula)) {
200
+ if (isApp(formula, "=", 2)) {
232
201
  popValue(equalLeftRight, formula.args[0]);
233
202
  popValue(equalRightLeft, formula.args[1]);
234
- } else if (formula.kind === "not" && isEquality(formula.args[0])) {
203
+ } else if (formula.kind === "not" && isApp(formula.args[0], "=", 2)) {
235
204
  popValue(unequalLeftRight, formula.args[0].args[0]);
236
205
  popValue(unequalRightLeft, formula.args[0].args[1]);
237
206
  }
@@ -240,14 +209,13 @@ export const createIndex = (exprs: Expressions) => {
240
209
  if (lemma !== undefined) lemma.isPresent = false;
241
210
  };
242
211
 
243
- // Zenon's add_trans, which stops at the first side without a head. False means No_head.
244
212
  const addTrans = (formula: RelationExpr) => {
245
213
  const leftHead = getHead(formula.args[0]);
246
214
  if (leftHead === undefined) return false;
247
- addElement(transLeft, getRelationKey(formula.symbol, leftHead), formula);
215
+ pushValue(transLeft, getRelationKey(formula.symbol, leftHead), formula);
248
216
  const rightHead = getHead(formula.args[1]);
249
217
  if (rightHead === undefined) return false;
250
- addElement(transRight, getRelationKey(formula.symbol, rightHead), formula);
218
+ pushValue(transRight, getRelationKey(formula.symbol, rightHead), formula);
251
219
  return true;
252
220
  };
253
221
 
@@ -255,13 +223,13 @@ export const createIndex = (exprs: Expressions) => {
255
223
  const relation = formula.args[0];
256
224
  const leftHead = getHead(relation.args[0]);
257
225
  if (leftHead !== undefined) {
258
- addElement(negTransLeft, getRelationKey(relation.symbol, leftHead), formula);
259
- addElement(allNegTransLeft, getHeadId(leftHead), formula);
226
+ pushValue(negTransLeft, getRelationKey(relation.symbol, leftHead), formula);
227
+ pushValue(allNegTransLeft, getHeadId(leftHead), formula);
260
228
  }
261
229
  const rightHead = getHead(relation.args[1]);
262
230
  if (rightHead !== undefined) {
263
- addElement(negTransRight, getRelationKey(relation.symbol, rightHead), formula);
264
- addElement(allNegTransRight, getHeadId(rightHead), formula);
231
+ pushValue(negTransRight, getRelationKey(relation.symbol, rightHead), formula);
232
+ pushValue(allNegTransRight, getHeadId(rightHead), formula);
265
233
  }
266
234
  };
267
235
 
@@ -276,8 +244,6 @@ export const createIndex = (exprs: Expressions) => {
276
244
  suspects.unshift([{ proof, cursor: 0, records }]);
277
245
  };
278
246
 
279
- // A cached lemma whose conclusions are all on the branch. A lemma waits on the first conclusion
280
- // that is missing, and is checked again when that formula comes back.
281
247
  const searchLemma = (): Proof | undefined => {
282
248
  for (const formula of newFormulas) {
283
249
  const record = lemmas.get(formula);
@@ -312,8 +278,8 @@ export const createIndex = (exprs: Expressions) => {
312
278
  remove,
313
279
  isMember,
314
280
  getGoalness,
315
- findPositive: (symbol: string) => withGoalness(getValues(positive, symbol)),
316
- findNegative: (symbol: string) => withGoalness(getValues(negative, symbol)),
281
+ findPositive: (symbol: string) => withGoalness(getLatestFirst(positive, symbol)),
282
+ findNegative: (symbol: string) => withGoalness(getLatestFirst(negative, symbol)),
317
283
  findEqualRight: (term: Expr) => getLatestFirst(equalLeftRight, term),
318
284
  findEqualLeft: (term: Expr) => getLatestFirst(equalRightLeft, term),
319
285
  findDisequalities: (term: Expr) => [
@@ -329,16 +295,17 @@ export const createIndex = (exprs: Expressions) => {
329
295
  addTrans,
330
296
  addNegTrans,
331
297
  findTransLeft: (relation: string, head: Head) =>
332
- withGoalness(getValues(transLeft, getRelationKey(relation, head))),
298
+ withGoalness(getLatestFirst(transLeft, getRelationKey(relation, head))),
333
299
  findTransRight: (relation: string, head: Head) =>
334
- withGoalness(getValues(transRight, getRelationKey(relation, head))),
300
+ withGoalness(getLatestFirst(transRight, getRelationKey(relation, head))),
335
301
  findNegTransLeft: (relation: string, head: Head) =>
336
- withGoalness(getValues(negTransLeft, getRelationKey(relation, head))),
302
+ withGoalness(getLatestFirst(negTransLeft, getRelationKey(relation, head))),
337
303
  findNegTransRight: (relation: string, head: Head) =>
338
- withGoalness(getValues(negTransRight, getRelationKey(relation, head))),
339
- findAllNegTransLeft: (head: Head) => withGoalness(getValues(allNegTransLeft, getHeadId(head))),
304
+ withGoalness(getLatestFirst(negTransRight, getRelationKey(relation, head))),
305
+ findAllNegTransLeft: (head: Head) =>
306
+ withGoalness(getLatestFirst(allNegTransLeft, getHeadId(head))),
340
307
  findAllNegTransRight: (head: Head) =>
341
- withGoalness(getValues(allNegTransRight, getHeadId(head))),
308
+ withGoalness(getLatestFirst(allNegTransRight, getHeadId(head))),
342
309
  addLemma,
343
310
  searchLemma,
344
311
  addDefinition: (definition: Definition) => definitions.set(definition.symbol, definition),
@@ -1,20 +1,16 @@
1
- // Ported from Zenon's isar_case.ml and enum.ml, as shipped in tlapm. Copyright 2009 INRIA, see
2
- // LICENSE.
3
- //
4
- // The lemmas for CASE expressions and record sets with more arms or fields than Zenon.thy covers.
5
- // Each one is a template that Zenon's Enum expands for the arity: the text between @@@ and ...
6
- // repeats counting up, the text between ... and @@@ repeats counting down.
7
-
8
1
  import { TlaZenonError } from "../../errors";
9
2
 
10
- // A run of digits or of other characters.
11
3
  interface Lexeme {
12
4
  isNumber: boolean;
13
5
  text: string;
14
6
  }
15
7
 
16
- // A piece of a pattern: text, or a number that grows by its step at each repetition.
17
- type Piece = string | { base: number; step: number };
8
+ interface Progression {
9
+ base: number;
10
+ step: number;
11
+ }
12
+
13
+ type Piece = string | Progression;
18
14
 
19
15
  interface Pattern {
20
16
  pieces: Piece[];
@@ -26,7 +22,6 @@ const isDigit = (char: string | undefined) => char !== undefined && char >= "0"
26
22
  const lex = (text: string): Lexeme[] =>
27
23
  text.match(/[0-9]+|[^0-9]+/g)?.map((run) => ({ isNumber: isDigit(run[0]), text: run })) ?? [];
28
24
 
29
- // The repeated text and the separator of a pattern without numbers: its two equal halves.
30
25
  const splitText = (text: string): Pattern => {
31
26
  const half = Math.floor(text.length / 2);
32
27
  const odd = text.length % 2;
@@ -50,8 +45,6 @@ const correlate = (first: Lexeme[], second: Lexeme[]): Piece[] | undefined => {
50
45
  return pieces.every((piece) => piece !== undefined) ? pieces : undefined;
51
46
  };
52
47
 
53
- // Zenon's split_sep: the separator inside the middle text, after the end of the first instance's
54
- // last lexeme and before the start of the second instance's first.
55
48
  const splitSeparator = (
56
49
  before: Lexeme,
57
50
  middle: string,
@@ -69,7 +62,6 @@ const splitSeparator = (
69
62
  ];
70
63
  };
71
64
 
72
- // Zenon's split_sep2, for two instances that meet between two numbers.
73
65
  const splitSeparatorBetween = (
74
66
  before: Lexeme,
75
67
  first: Lexeme,
@@ -95,7 +87,6 @@ const splitSeparatorBetween = (
95
87
  throw new TlaZenonError("Zenon: a template whose instances don't meet");
96
88
  };
97
89
 
98
- // Zenon's Enum.parse: a template's text holds two instances of the pattern and the separator.
99
90
  const parsePattern = (text: string): Pattern | undefined => {
100
91
  const lexemes = lex(text);
101
92
  const length = lexemes.length;
@@ -132,10 +123,9 @@ const parsePattern = (text: string): Pattern | undefined => {
132
123
  return pieces === undefined ? undefined : { pieces, separator: split[1] };
133
124
  };
134
125
 
135
- const getInstance = (pieces: Piece[], value: (piece: { base: number; step: number }) => number) =>
136
- pieces.map((piece) => (typeof piece === "string" ? piece : String(value(piece)))).join("");
126
+ const getInstance = (pieces: Piece[], getValue: (piece: Progression) => number) =>
127
+ pieces.map((piece) => (typeof piece === "string" ? piece : String(getValue(piece)))).join("");
137
128
 
138
- // Zenon's expand_string and expand_string_rev: the pattern repeated count times.
139
129
  const expandPattern = (count: number, text: string, isReversed: boolean) => {
140
130
  const pattern = parsePattern(text);
141
131
  if (pattern === undefined) return undefined;
@@ -153,7 +143,6 @@ const expandPattern = (count: number, text: string, isReversed: boolean) => {
153
143
  .join(pattern.separator);
154
144
  };
155
145
 
156
- // Zenon's read_suffix: a count adjustment such as [n-1] after the end marker.
157
146
  const readAdjustment = (text: string, position: number): [number, number] => {
158
147
  const match = /^\[n(?:\]|([+-])([0-9]*)\])/.exec(text.slice(position));
159
148
  if (match === null) return [0, position];
@@ -168,7 +157,6 @@ const trimNewlines = (text: string) => {
168
157
  throw new TlaZenonError("Zenon: a bad template");
169
158
  };
170
159
 
171
- // Zenon's Enum.expand_text.
172
160
  const expandTemplate = (count: number, template: string) => {
173
161
  const parts: string[] = [];
174
162
  let position = 0;