tla-ts 0.0.9 → 0.0.10-dev.09e53c2a6

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (625) hide show
  1. package/README.md +30 -1
  2. package/dist/compile.cjs +23 -0
  3. package/dist/compile.js +23 -0
  4. package/dist/deciders.cjs +41 -37
  5. package/dist/deciders.js +57 -53
  6. package/dist/index.cjs +1 -1
  7. package/dist/index.d.cts +109 -10
  8. package/dist/index.d.ts +109 -10
  9. package/dist/index.js +1 -1
  10. package/dist/parallel-worker.cjs +1 -1
  11. package/dist/parallel-worker.js +1 -1
  12. package/dist/prove-worker.cjs +1 -1
  13. package/dist/prove-worker.js +1 -1
  14. package/dist/prove.cjs +2746 -410
  15. package/dist/prove.js +2745 -409
  16. package/dist/run.cjs +146 -31
  17. package/dist/run.js +146 -31
  18. package/dist/tlapm.cjs +2 -2
  19. package/dist/tlapm.js +2 -2
  20. package/dist/transfer.cjs +132 -104
  21. package/dist/transfer.js +132 -104
  22. package/dist/worker.cjs +6 -6
  23. package/dist/worker.js +6 -6
  24. package/package.json +3 -1
  25. package/src/ast.ts +45 -59
  26. package/src/bags.ts +99 -102
  27. package/src/builtins.ts +28 -75
  28. package/src/bundled-modules.ts +1 -8
  29. package/src/check-failure.ts +116 -0
  30. package/src/check-trace.ts +282 -0
  31. package/src/check.ts +797 -782
  32. package/src/cli/options.ts +12 -32
  33. package/src/cli/run.ts +0 -2
  34. package/src/cli/runtime-invariants.ts +136 -0
  35. package/src/cli/shared.ts +19 -12
  36. package/src/cli/tlapm.ts +433 -82
  37. package/src/cli/tlc-arguments.ts +652 -0
  38. package/src/cli/tlc-output.ts +687 -0
  39. package/src/cli/tlc-usage.ts +360 -0
  40. package/src/cli/tlc.ts +323 -658
  41. package/src/cli/typescript.ts +23 -0
  42. package/src/cli/xml-exporter.ts +27 -49
  43. package/src/cli.ts +0 -1
  44. package/src/codegen.ts +196 -74
  45. package/src/config.ts +140 -109
  46. package/src/coverage.ts +830 -0
  47. package/src/dependencies.ts +36 -54
  48. package/src/dfid.ts +618 -0
  49. package/src/environment-config.ts +315 -0
  50. package/src/environment.ts +178 -339
  51. package/src/errors.ts +100 -57
  52. package/src/evaluate.ts +598 -340
  53. package/src/exit-codes.ts +38 -3
  54. package/src/fingerprints.ts +75 -11
  55. package/src/index.ts +3 -0
  56. package/src/instances.ts +126 -21
  57. package/src/java-hash.ts +7 -0
  58. package/src/java-overrides.ts +4 -19
  59. package/src/json-reader.ts +455 -0
  60. package/src/json.ts +252 -139
  61. package/src/levels.ts +46 -58
  62. package/src/lexer.ts +83 -101
  63. package/src/liveness-checker.ts +590 -311
  64. package/src/liveness.ts +180 -124
  65. package/src/obligations/action.ts +17 -44
  66. package/src/obligations/anonymize.ts +120 -95
  67. package/src/obligations/enabled-axioms.ts +218 -0
  68. package/src/obligations/equality.ts +1 -3
  69. package/src/obligations/expression.ts +37 -26
  70. package/src/obligations/format.ts +0 -10
  71. package/src/obligations/generate.ts +66 -64
  72. package/src/obligations/index.ts +38 -19
  73. package/src/obligations/levels.ts +27 -18
  74. package/src/obligations/module.ts +28 -55
  75. package/src/obligations/normalize.ts +30 -37
  76. package/src/obligations/operators.ts +0 -3
  77. package/src/obligations/pragma.ts +52 -24
  78. package/src/obligations/printer.ts +89 -58
  79. package/src/obligations/proof.ts +3 -6
  80. package/src/obligations/regroup.ts +0 -5
  81. package/src/obligations/simplify.ts +57 -63
  82. package/src/obligations/source.ts +119 -95
  83. package/src/obligations/subexpression.ts +49 -28
  84. package/src/obligations/substitution.ts +1 -5
  85. package/src/obligations/temporal.ts +12 -20
  86. package/src/obligations/tuples.ts +2 -10
  87. package/src/parallel-worker.ts +30 -60
  88. package/src/parallel.ts +59 -73
  89. package/src/parser.ts +1082 -399
  90. package/src/pcal/ast.ts +53 -86
  91. package/src/pcal/parse.ts +144 -219
  92. package/src/pcal/tokenize.ts +91 -131
  93. package/src/pcal/translate.ts +83 -130
  94. package/src/pcal/validate.ts +48 -68
  95. package/src/pretty-print.ts +7 -8
  96. package/src/prover/decide-pool.ts +8 -13
  97. package/src/prover/deciders.ts +12 -13
  98. package/src/prover/first-order.ts +0 -11
  99. package/src/prover/isabelle/decide.ts +3 -31
  100. package/src/prover/isabelle/encode.ts +82 -64
  101. package/src/prover/isabelle/isar/attrib.ts +250 -0
  102. package/src/prover/isabelle/isar/context.ts +335 -0
  103. package/src/prover/isabelle/isar/induct.ts +382 -0
  104. package/src/prover/isabelle/isar/inner-syntax.ts +262 -117
  105. package/src/prover/isabelle/isar/method.ts +510 -226
  106. package/src/prover/isabelle/isar/proof.ts +570 -23
  107. package/src/prover/isabelle/isar/rule-cases.ts +224 -0
  108. package/src/prover/isabelle/isar/theory.ts +488 -88
  109. package/src/prover/isabelle/isar/toplevel.ts +331 -0
  110. package/src/prover/isabelle/isar/type-check.ts +99 -38
  111. package/src/prover/isabelle/provers/blast/blast.ts +16 -105
  112. package/src/prover/isabelle/provers/blast/branch.ts +0 -33
  113. package/src/prover/isabelle/provers/blast/prove.ts +0 -36
  114. package/src/prover/isabelle/provers/blast/rules.ts +5 -45
  115. package/src/prover/isabelle/provers/blast/state.ts +1 -29
  116. package/src/prover/isabelle/provers/blast/term.ts +8 -37
  117. package/src/prover/isabelle/provers/clasimp.ts +0 -14
  118. package/src/prover/isabelle/provers/classical.ts +58 -61
  119. package/src/prover/isabelle/provers/hypsubst.ts +27 -52
  120. package/src/prover/isabelle/pure/bicompose.ts +24 -39
  121. package/src/prover/isabelle/pure/consts.ts +0 -8
  122. package/src/prover/isabelle/pure/conv.ts +2 -18
  123. package/src/prover/isabelle/pure/drule.ts +95 -45
  124. package/src/prover/isabelle/pure/envir.ts +2 -53
  125. package/src/prover/isabelle/pure/goal.ts +1 -9
  126. package/src/prover/isabelle/pure/interrupt.ts +0 -5
  127. package/src/prover/isabelle/pure/list.ts +0 -3
  128. package/src/prover/isabelle/pure/logic.ts +1 -16
  129. package/src/prover/isabelle/pure/name.ts +1 -10
  130. package/src/prover/isabelle/pure/net.ts +2 -60
  131. package/src/prover/isabelle/pure/object-logic.ts +15 -16
  132. package/src/prover/isabelle/pure/pattern.ts +1 -20
  133. package/src/prover/isabelle/pure/raw-simplifier.ts +16 -63
  134. package/src/prover/isabelle/pure/rewriter.ts +31 -74
  135. package/src/prover/isabelle/pure/search.ts +2 -11
  136. package/src/prover/isabelle/pure/seq.ts +0 -11
  137. package/src/prover/isabelle/pure/simplifier.ts +27 -16
  138. package/src/prover/isabelle/pure/table.ts +2 -33
  139. package/src/prover/isabelle/pure/tactic.ts +11 -23
  140. package/src/prover/isabelle/pure/tactical.ts +47 -48
  141. package/src/prover/isabelle/pure/term-ord.ts +1 -7
  142. package/src/prover/isabelle/pure/term.ts +1 -44
  143. package/src/prover/isabelle/pure/thm.ts +26 -48
  144. package/src/prover/isabelle/pure/type.ts +1 -16
  145. package/src/prover/isabelle/pure/unify.ts +19 -31
  146. package/src/prover/isabelle/pure/variable.ts +2 -8
  147. package/src/prover/isabelle/tla/classical-setup.ts +17 -25
  148. package/src/prover/isabelle/tla/context.ts +65 -26
  149. package/src/prover/isabelle/tla/logic-data.ts +1 -1
  150. package/src/prover/isabelle/tla/logic.ts +53 -32
  151. package/src/prover/isabelle/tla/simpdata.ts +45 -44
  152. package/src/prover/isabelle/tools/intuitionistic.ts +28 -21
  153. package/src/prover/ocaml.ts +4 -7
  154. package/src/prover/prep/action.ts +33 -66
  155. package/src/prover/prep/enabled-axioms.ts +22 -20
  156. package/src/prover/prep/fingerprint.ts +2 -21
  157. package/src/prover/prep/level-comparison.ts +8 -12
  158. package/src/prover/prep/md5.ts +0 -2
  159. package/src/prover/prep/methods.ts +189 -86
  160. package/src/prover/prep/normalize.ts +42 -37
  161. package/src/prover/prove-worker.ts +0 -2
  162. package/src/prover/prove.ts +398 -133
  163. package/src/prover/ptl/decide.ts +96 -56
  164. package/src/prover/ptl/encode.ts +15 -38
  165. package/src/prover/ptl/sat.ts +24 -32
  166. package/src/prover/ptl/tableau.ts +40 -28
  167. package/src/prover/smt/arithmetic.ts +310 -0
  168. package/src/prover/smt/axioms.ts +12 -15
  169. package/src/prover/smt/context.ts +60 -32
  170. package/src/prover/smt/data.ts +517 -401
  171. package/src/prover/smt/encode.ts +155 -85
  172. package/src/prover/smt/extensionality.ts +5 -13
  173. package/src/prover/smt/flatten.ts +7 -28
  174. package/src/prover/smt/format.ts +33 -14
  175. package/src/prover/smt/instances.ts +7 -11
  176. package/src/prover/smt/layout.ts +91 -0
  177. package/src/prover/smt/rewrite.ts +1026 -658
  178. package/src/prover/smt/simplify.ts +441 -0
  179. package/src/prover/smt/solver/ackermannize-bv-tactic.ts +61 -0
  180. package/src/prover/smt/solver/ackr-helper.ts +179 -0
  181. package/src/prover/smt/solver/ackr-model-converter.ts +105 -0
  182. package/src/prover/smt/solver/act-cache.ts +0 -16
  183. package/src/prover/smt/solver/add-bounds-tactic.ts +59 -0
  184. package/src/prover/smt/solver/aig-tactic.ts +52 -0
  185. package/src/prover/smt/solver/aig.ts +889 -0
  186. package/src/prover/smt/solver/arith-rewriter.ts +615 -53
  187. package/src/prover/smt/solver/arith-terms.ts +121 -0
  188. package/src/prover/smt/solver/array-decl-plugin.ts +175 -0
  189. package/src/prover/smt/solver/array-rewriter.ts +309 -0
  190. package/src/prover/smt/solver/array.ts +1 -3
  191. package/src/prover/smt/solver/asserted-formulas.ts +87 -58
  192. package/src/prover/smt/solver/ast-lt.ts +166 -22
  193. package/src/prover/smt/solver/ast-util.ts +160 -7
  194. package/src/prover/smt/solver/ast.ts +1424 -180
  195. package/src/prover/smt/solver/auf-solver.ts +7 -44
  196. package/src/prover/smt/solver/bit-blast-tactic.ts +582 -0
  197. package/src/prover/smt/solver/bit-blaster.ts +871 -0
  198. package/src/prover/smt/solver/bound-manager.ts +196 -0
  199. package/src/prover/smt/solver/bound-simplifier.ts +600 -0
  200. package/src/prover/smt/solver/bv-bound-chk.ts +492 -0
  201. package/src/prover/smt/solver/bv-decl-plugin.ts +338 -0
  202. package/src/prover/smt/solver/bv-divrem-bounds.ts +95 -0
  203. package/src/prover/smt/solver/bv-rewriter.ts +1901 -0
  204. package/src/prover/smt/solver/bv1-blast.ts +214 -0
  205. package/src/prover/smt/solver/bv2fpa-converter.ts +174 -0
  206. package/src/prover/smt/solver/bv2int-rewriter.ts +544 -0
  207. package/src/prover/smt/solver/bv2real-rewriter.ts +533 -0
  208. package/src/prover/smt/solver/card2bv.ts +110 -0
  209. package/src/prover/smt/solver/case-split-queue.ts +0 -10
  210. package/src/prover/smt/solver/cg-table.ts +39 -42
  211. package/src/prover/smt/solver/check-logic.ts +330 -0
  212. package/src/prover/smt/solver/clause.ts +0 -27
  213. package/src/prover/smt/solver/cofactor-elim-term-ite.ts +278 -0
  214. package/src/prover/smt/solver/conflict-resolution.ts +78 -11
  215. package/src/prover/smt/solver/context.ts +519 -175
  216. package/src/prover/smt/solver/ctx-simplify.ts +33 -50
  217. package/src/prover/smt/solver/ctx-solver-simplify.ts +122 -0
  218. package/src/prover/smt/solver/datatype-decl-plugin.ts +572 -0
  219. package/src/prover/smt/solver/datatype-rewriter.ts +82 -0
  220. package/src/prover/smt/solver/demodulator.ts +786 -0
  221. package/src/prover/smt/solver/dependent-expr-state.ts +81 -0
  222. package/src/prover/smt/solver/der.ts +39 -30
  223. package/src/prover/smt/solver/diff-neq.ts +206 -0
  224. package/src/prover/smt/solver/distribute-forall.ts +57 -0
  225. package/src/prover/smt/solver/dom-simplify.ts +511 -0
  226. package/src/prover/smt/solver/dt2bv-tactic.ts +260 -0
  227. package/src/prover/smt/solver/dyn-ack.ts +0 -11
  228. package/src/prover/smt/solver/e-matching.ts +9 -41
  229. package/src/prover/smt/solver/elim-small-bv-tactic.ts +129 -0
  230. package/src/prover/smt/solver/elim-uncnstr.ts +545 -0
  231. package/src/prover/smt/solver/enode.ts +100 -23
  232. package/src/prover/smt/solver/eq2bv-tactic.ts +218 -0
  233. package/src/prover/smt/solver/euf/arith-axioms.ts +403 -0
  234. package/src/prover/smt/solver/euf/arith-internalize.ts +653 -0
  235. package/src/prover/smt/solver/euf/arith-solver.ts +889 -0
  236. package/src/prover/smt/solver/euf/array-axioms.ts +527 -0
  237. package/src/prover/smt/solver/euf/array-internalize.ts +428 -0
  238. package/src/prover/smt/solver/euf/array-solver.ts +306 -0
  239. package/src/prover/smt/solver/euf/bv-ackerman.ts +162 -0
  240. package/src/prover/smt/solver/euf/bv-internalize.ts +748 -0
  241. package/src/prover/smt/solver/euf/bv-solver.ts +449 -0
  242. package/src/prover/smt/solver/euf/dt-solver.ts +618 -0
  243. package/src/prover/smt/solver/euf/egraph.ts +907 -0
  244. package/src/prover/smt/solver/euf/euf-solver.ts +1205 -0
  245. package/src/prover/smt/solver/euf/fpa-solver.ts +317 -0
  246. package/src/prover/smt/solver/euf/mam.ts +1050 -0
  247. package/src/prover/smt/solver/euf/q-ematch.ts +830 -0
  248. package/src/prover/smt/solver/euf/q-mbi.ts +587 -0
  249. package/src/prover/smt/solver/euf/q-model-fixer.ts +296 -0
  250. package/src/prover/smt/solver/euf/q-solver.ts +361 -0
  251. package/src/prover/smt/solver/euf/th-solver.ts +335 -0
  252. package/src/prover/smt/solver/euf/th-solvers.ts +30 -0
  253. package/src/prover/smt/solver/expr-ref.ts +0 -5
  254. package/src/prover/smt/solver/expr-safe-replace.ts +26 -7
  255. package/src/prover/smt/solver/expr2polynomial.ts +146 -0
  256. package/src/prover/smt/solver/factor.ts +141 -0
  257. package/src/prover/smt/solver/fd-solver.ts +265 -0
  258. package/src/prover/smt/solver/fingerprints.ts +15 -26
  259. package/src/prover/smt/solver/fix-dl-var.ts +148 -0
  260. package/src/prover/smt/solver/flat-literals.ts +0 -9
  261. package/src/prover/smt/solver/fm-tactic.ts +884 -0
  262. package/src/prover/smt/solver/fpa-decl-plugin.ts +618 -0
  263. package/src/prover/smt/solver/fpa-rewriter.ts +640 -0
  264. package/src/prover/smt/solver/fpa2bv-converter.ts +2249 -0
  265. package/src/prover/smt/solver/fpa2bv-rewriter.ts +348 -0
  266. package/src/prover/smt/solver/fpa2bv-tactic.ts +73 -0
  267. package/src/prover/smt/solver/goal.ts +176 -28
  268. package/src/prover/smt/solver/goal2nlsat.ts +189 -0
  269. package/src/prover/smt/solver/guard-set.ts +219 -0
  270. package/src/prover/smt/solver/hash.ts +0 -9
  271. package/src/prover/smt/solver/hashtable.ts +26 -23
  272. package/src/prover/smt/solver/inf-eps.ts +63 -0
  273. package/src/prover/smt/solver/inj-axiom.ts +101 -0
  274. package/src/prover/smt/solver/internalizer.ts +112 -132
  275. package/src/prover/smt/solver/lackr.ts +381 -0
  276. package/src/prover/smt/solver/lbool.ts +0 -2
  277. package/src/prover/smt/solver/lia2card.ts +268 -0
  278. package/src/prover/smt/solver/lia2pb.ts +154 -0
  279. package/src/prover/smt/solver/literal.ts +0 -4
  280. package/src/prover/smt/solver/logic-tactics.ts +345 -0
  281. package/src/prover/smt/solver/lp/bound-propagator.ts +7 -26
  282. package/src/prover/smt/solver/lp/constraints.ts +1 -8
  283. package/src/prover/smt/solver/lp/containers.ts +11 -30
  284. package/src/prover/smt/solver/lp/core-solver.ts +23 -29
  285. package/src/prover/smt/solver/lp/cross-nested.ts +5 -20
  286. package/src/prover/smt/solver/lp/dep-intervals.ts +6 -24
  287. package/src/prover/smt/solver/lp/dependency.ts +0 -5
  288. package/src/prover/smt/solver/lp/dioph-eq.ts +8 -103
  289. package/src/prover/smt/solver/lp/explanation.ts +0 -6
  290. package/src/prover/smt/solver/lp/gomory.ts +8 -22
  291. package/src/prover/smt/solver/lp/hnf-cutter.ts +16 -23
  292. package/src/prover/smt/solver/lp/hnf.ts +10 -28
  293. package/src/prover/smt/solver/lp/int-cube.ts +17 -39
  294. package/src/prover/smt/solver/lp/int-solver.ts +3 -35
  295. package/src/prover/smt/solver/lp/lar-solver.ts +69 -82
  296. package/src/prover/smt/solver/lp/lar-term.ts +0 -5
  297. package/src/prover/smt/solver/lp/lp-settings.ts +0 -14
  298. package/src/prover/smt/solver/lp/maximize-term.ts +76 -52
  299. package/src/prover/smt/solver/lp/nex-creator.ts +4 -28
  300. package/src/prover/smt/solver/lp/nex.ts +0 -6
  301. package/src/prover/smt/solver/lp/nla-backoff.ts +0 -5
  302. package/src/prover/smt/solver/lp/nla-basics.ts +48 -30
  303. package/src/prover/smt/solver/lp/nla-core.ts +91 -135
  304. package/src/prover/smt/solver/lp/nla-divisions.ts +31 -43
  305. package/src/prover/smt/solver/lp/nla-emonics.ts +3 -21
  306. package/src/prover/smt/solver/lp/nla-factorization.ts +0 -4
  307. package/src/prover/smt/solver/lp/nla-grobner.ts +22 -72
  308. package/src/prover/smt/solver/lp/nla-horner.ts +2 -12
  309. package/src/prover/smt/solver/lp/nla-intervals.ts +1 -12
  310. package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +15 -42
  311. package/src/prover/smt/solver/lp/nla-monotone.ts +1 -6
  312. package/src/prover/smt/solver/lp/nla-order.ts +0 -13
  313. package/src/prover/smt/solver/lp/nla-patcher.ts +3 -7
  314. package/src/prover/smt/solver/lp/nla-powers.ts +220 -0
  315. package/src/prover/smt/solver/lp/nla-tangents.ts +0 -10
  316. package/src/prover/smt/solver/lp/nla-throttle.ts +0 -6
  317. package/src/prover/smt/solver/lp/nla-transcendentals.ts +324 -0
  318. package/src/prover/smt/solver/lp/nla-types.ts +0 -12
  319. package/src/prover/smt/solver/lp/nla-var-eqs.ts +4 -26
  320. package/src/prover/smt/solver/lp/nra-solver.ts +123 -112
  321. package/src/prover/smt/solver/lp/numeric-pair.ts +0 -4
  322. package/src/prover/smt/solver/lp/pdd-interval.ts +0 -3
  323. package/src/prover/smt/solver/lp/pdd-simplifier.ts +1 -14
  324. package/src/prover/smt/solver/lp/pdd-solver.ts +2 -33
  325. package/src/prover/smt/solver/lp/pdd.ts +7 -70
  326. package/src/prover/smt/solver/lp/random-updater.ts +0 -9
  327. package/src/prover/smt/solver/lp/static-matrix.ts +8 -19
  328. package/src/prover/smt/solver/lp/union-find.ts +5 -5
  329. package/src/prover/smt/solver/macro-finder.ts +530 -0
  330. package/src/prover/smt/solver/mam-compiler.ts +129 -139
  331. package/src/prover/smt/solver/mam-interpreter.ts +0 -21
  332. package/src/prover/smt/solver/max-bv-sharing-tactic.ts +17 -0
  333. package/src/prover/smt/solver/max-cliques.ts +105 -0
  334. package/src/prover/smt/solver/maxcore.ts +309 -0
  335. package/src/prover/smt/solver/maximize-ac-sharing.ts +8 -21
  336. package/src/prover/smt/solver/maxlex.ts +115 -0
  337. package/src/prover/smt/solver/maxsmt-base.ts +105 -0
  338. package/src/prover/smt/solver/maxsmt.ts +92 -0
  339. package/src/prover/smt/solver/mbp/mbp-arith.ts +467 -0
  340. package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +101 -0
  341. package/src/prover/smt/solver/mbp/mbp-plugin.ts +287 -0
  342. package/src/prover/smt/solver/mbp/mbp-qel.ts +48 -0
  343. package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +271 -0
  344. package/src/prover/smt/solver/mbp/mbp-term-graph.ts +606 -0
  345. package/src/prover/smt/solver/model-based-opt.ts +844 -0
  346. package/src/prover/smt/solver/model-checker.ts +19 -62
  347. package/src/prover/smt/solver/model-evaluator.ts +190 -40
  348. package/src/prover/smt/solver/model-finder.ts +14 -32
  349. package/src/prover/smt/solver/model-generator.ts +56 -40
  350. package/src/prover/smt/solver/model-macro-solver.ts +60 -114
  351. package/src/prover/smt/solver/model-printer.ts +214 -0
  352. package/src/prover/smt/solver/mpf.ts +711 -0
  353. package/src/prover/smt/solver/mus.ts +51 -0
  354. package/src/prover/smt/solver/muz/dl-context.ts +404 -0
  355. package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +97 -0
  356. package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +167 -0
  357. package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +125 -0
  358. package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +299 -0
  359. package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +455 -0
  360. package/src/prover/smt/solver/muz/dl-mk-slice.ts +340 -0
  361. package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +163 -0
  362. package/src/prover/smt/solver/muz/dl-rule-set.ts +273 -0
  363. package/src/prover/smt/solver/muz/dl-rule-transformer.ts +123 -0
  364. package/src/prover/smt/solver/muz/dl-rule.ts +496 -0
  365. package/src/prover/smt/solver/muz/hnf.ts +201 -0
  366. package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +176 -0
  367. package/src/prover/smt/solver/muz/horn-tactic.ts +201 -0
  368. package/src/prover/smt/solver/muz/rule-properties.ts +337 -0
  369. package/src/prover/smt/solver/muz/spacer-context.ts +1406 -0
  370. package/src/prover/smt/solver/muz/spacer-dl-interface.ts +52 -0
  371. package/src/prover/smt/solver/muz/spacer-generalizers.ts +241 -0
  372. package/src/prover/smt/solver/muz/spacer-manager.ts +127 -0
  373. package/src/prover/smt/solver/muz/spacer-pdr.ts +218 -0
  374. package/src/prover/smt/solver/muz/spacer-prop-solver.ts +333 -0
  375. package/src/prover/smt/solver/muz/spacer-util.ts +282 -0
  376. package/src/prover/smt/solver/muz/substitution.ts +203 -0
  377. package/src/prover/smt/solver/nla2bv-tactic.ts +285 -0
  378. package/src/prover/smt/solver/nlqsat.ts +484 -0
  379. package/src/prover/smt/solver/nlsat/algebraic.ts +177 -160
  380. package/src/prover/smt/solver/nlsat/atoms.ts +24 -24
  381. package/src/prover/smt/solver/nlsat/evaluator.ts +16 -22
  382. package/src/prover/smt/solver/nlsat/explain.ts +65 -69
  383. package/src/prover/smt/solver/nlsat/interval-set.ts +9 -51
  384. package/src/prover/smt/solver/nlsat/levelwise.ts +48 -135
  385. package/src/prover/smt/solver/nlsat/mpbq.ts +47 -14
  386. package/src/prover/smt/solver/nlsat/polynomial.ts +29 -161
  387. package/src/prover/smt/solver/nlsat/solver.ts +241 -110
  388. package/src/prover/smt/solver/nlsat/transcendental-eval.ts +310 -0
  389. package/src/prover/smt/solver/nlsat/transcendentals.ts +367 -0
  390. package/src/prover/smt/solver/nlsat/types.ts +0 -9
  391. package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +1 -47
  392. package/src/prover/smt/solver/nlsat/upolynomial.ts +10 -93
  393. package/src/prover/smt/solver/nlsat-tactic.ts +82 -0
  394. package/src/prover/smt/solver/nnf.ts +107 -60
  395. package/src/prover/smt/solver/normalize-bounds.ts +53 -0
  396. package/src/prover/smt/solver/occf.ts +97 -0
  397. package/src/prover/smt/solver/opt-context.ts +787 -0
  398. package/src/prover/smt/solver/opt-nlsat.ts +375 -0
  399. package/src/prover/smt/solver/opt-pareto.ts +282 -0
  400. package/src/prover/smt/solver/opt-preprocess.ts +101 -0
  401. package/src/prover/smt/solver/opt-solver.ts +308 -0
  402. package/src/prover/smt/solver/opt-value.ts +55 -0
  403. package/src/prover/smt/solver/optsmt.ts +692 -0
  404. package/src/prover/smt/solver/parallel-tactic.ts +299 -0
  405. package/src/prover/smt/solver/pattern-inference.ts +21 -26
  406. package/src/prover/smt/solver/pb-rewriter.ts +284 -0
  407. package/src/prover/smt/solver/pb2bv-tactic.ts +540 -0
  408. package/src/prover/smt/solver/poly-rewriter.ts +204 -79
  409. package/src/prover/smt/solver/probes.ts +512 -0
  410. package/src/prover/smt/solver/propagate-values.ts +37 -30
  411. package/src/prover/smt/solver/proto-model.ts +650 -66
  412. package/src/prover/smt/solver/pull-quant.ts +28 -23
  413. package/src/prover/smt/solver/purify-arith.ts +632 -0
  414. package/src/prover/smt/solver/qe-arith-plugin.ts +1098 -0
  415. package/src/prover/smt/solver/qe-lite-der.ts +2 -31
  416. package/src/prover/smt/solver/qe-lite-fm.ts +4 -28
  417. package/src/prover/smt/solver/qe-lite.ts +39 -49
  418. package/src/prover/smt/solver/qe-mbp.ts +270 -0
  419. package/src/prover/smt/solver/qe.ts +1498 -0
  420. package/src/prover/smt/solver/qel.ts +25 -0
  421. package/src/prover/smt/solver/qi-queue.ts +0 -16
  422. package/src/prover/smt/solver/qsat.ts +814 -0
  423. package/src/prover/smt/solver/quant-hoist.ts +196 -0
  424. package/src/prover/smt/solver/quant-tactics.ts +17 -74
  425. package/src/prover/smt/solver/quantifier-analyzer.ts +26 -47
  426. package/src/prover/smt/solver/quantifier-manager.ts +8 -23
  427. package/src/prover/smt/solver/quasi-macros.ts +243 -0
  428. package/src/prover/smt/solver/random-gen.ts +0 -2
  429. package/src/prover/smt/solver/rational.ts +45 -8
  430. package/src/prover/smt/solver/recfun-decl-plugin.ts +261 -0
  431. package/src/prover/smt/solver/recfun-rewriter.ts +107 -0
  432. package/src/prover/smt/solver/reduce-args.ts +225 -0
  433. package/src/prover/smt/solver/reduce-bv-size.ts +119 -0
  434. package/src/prover/smt/solver/ref-vector.ts +0 -6
  435. package/src/prover/smt/solver/relevancy.ts +2 -16
  436. package/src/prover/smt/solver/rewriter-tpl.ts +52 -129
  437. package/src/prover/smt/solver/rewriter.ts +477 -120
  438. package/src/prover/smt/solver/rlimit.ts +39 -21
  439. package/src/prover/smt/solver/sat/asymm-branch.ts +325 -0
  440. package/src/prover/smt/solver/sat/big.ts +177 -0
  441. package/src/prover/smt/solver/sat/clause-use-list.ts +71 -0
  442. package/src/prover/smt/solver/sat/clause.ts +203 -0
  443. package/src/prover/smt/solver/sat/cleaner.ts +94 -0
  444. package/src/prover/smt/solver/sat/config.ts +122 -0
  445. package/src/prover/smt/solver/sat/consequences.ts +203 -0
  446. package/src/prover/smt/solver/sat/elim-eqs.ts +142 -0
  447. package/src/prover/smt/solver/sat/goal2sat.ts +526 -0
  448. package/src/prover/smt/solver/sat/inc-sat-solver.ts +378 -0
  449. package/src/prover/smt/solver/sat/model-converter.ts +136 -0
  450. package/src/prover/smt/solver/sat/pb-constraint.ts +261 -0
  451. package/src/prover/smt/solver/sat/pb-solver.ts +1577 -0
  452. package/src/prover/smt/solver/sat/probing.ts +170 -0
  453. package/src/prover/smt/solver/sat/sat-tactic.ts +43 -0
  454. package/src/prover/smt/solver/sat/sat2goal.ts +165 -0
  455. package/src/prover/smt/solver/sat/scc.ts +142 -0
  456. package/src/prover/smt/solver/sat/simplifier.ts +1618 -0
  457. package/src/prover/smt/solver/sat/solver.ts +2127 -0
  458. package/src/prover/smt/solver/sat/var-queue.ts +117 -0
  459. package/src/prover/smt/solver/sat/watch-list.ts +140 -0
  460. package/src/prover/smt/solver/search-tree.ts +284 -0
  461. package/src/prover/smt/solver/seq-axioms.ts +1010 -0
  462. package/src/prover/smt/solver/seq-decl-plugin.ts +819 -0
  463. package/src/prover/smt/solver/seq-derive.ts +1301 -0
  464. package/src/prover/smt/solver/seq-eq-approx.ts +236 -0
  465. package/src/prover/smt/solver/seq-eq-solver.ts +439 -0
  466. package/src/prover/smt/solver/seq-factory.ts +89 -0
  467. package/src/prover/smt/solver/seq-monadic.ts +728 -0
  468. package/src/prover/smt/solver/seq-range-predicate.ts +235 -0
  469. package/src/prover/smt/solver/seq-re-rewriter.ts +1170 -0
  470. package/src/prover/smt/solver/seq-re-util.ts +758 -0
  471. package/src/prover/smt/solver/seq-regex-bisim.ts +144 -0
  472. package/src/prover/smt/solver/seq-regex-live.ts +200 -0
  473. package/src/prover/smt/solver/seq-rewriter.ts +2402 -0
  474. package/src/prover/smt/solver/seq-skolem.ts +317 -0
  475. package/src/prover/smt/solver/seq-subset.ts +165 -0
  476. package/src/prover/smt/solver/seq-view-witness.ts +353 -0
  477. package/src/prover/smt/solver/smt-consequences.ts +297 -0
  478. package/src/prover/smt/solver/smt-kernel.ts +83 -0
  479. package/src/prover/smt/solver/smt-logics.ts +66 -0
  480. package/src/prover/smt/solver/smt-setup.ts +496 -0
  481. package/src/prover/smt/solver/smt2-printer.ts +765 -0
  482. package/src/prover/smt/solver/smtlib-parser.ts +3140 -365
  483. package/src/prover/smt/solver/smtlib-script.ts +1631 -0
  484. package/src/prover/smt/solver/solve-eqs.ts +929 -0
  485. package/src/prover/smt/solver/solver.ts +119 -39
  486. package/src/prover/smt/solver/sort.ts +1 -5
  487. package/src/prover/smt/solver/static-features.ts +314 -0
  488. package/src/prover/smt/solver/sticky-generations.ts +0 -6
  489. package/src/prover/smt/solver/tactic.ts +1986 -0
  490. package/src/prover/smt/solver/term-enumeration.ts +205 -0
  491. package/src/prover/smt/solver/theory-array.ts +1240 -0
  492. package/src/prover/smt/solver/theory-bv.ts +1200 -0
  493. package/src/prover/smt/solver/theory-char.ts +355 -0
  494. package/src/prover/smt/solver/theory-datatype.ts +598 -0
  495. package/src/prover/smt/solver/theory-finite-set.ts +30 -0
  496. package/src/prover/smt/solver/theory-fpa.ts +389 -0
  497. package/src/prover/smt/solver/theory-lra-axioms.ts +55 -25
  498. package/src/prover/smt/solver/theory-lra-bounds.ts +31 -11
  499. package/src/prover/smt/solver/theory-lra-final-check.ts +59 -91
  500. package/src/prover/smt/solver/theory-lra-internalize.ts +94 -53
  501. package/src/prover/smt/solver/theory-lra-model.ts +23 -53
  502. package/src/prover/smt/solver/theory-lra-propagate.ts +24 -40
  503. package/src/prover/smt/solver/theory-lra-state.ts +6 -27
  504. package/src/prover/smt/solver/theory-lra.ts +188 -8
  505. package/src/prover/smt/solver/theory-pb.ts +934 -0
  506. package/src/prover/smt/solver/theory-polymorphism.ts +58 -0
  507. package/src/prover/smt/solver/theory-recfun.ts +307 -0
  508. package/src/prover/smt/solver/theory-seq-regex.ts +867 -0
  509. package/src/prover/smt/solver/theory-seq-solve.ts +1373 -0
  510. package/src/prover/smt/solver/theory-seq-state.ts +871 -0
  511. package/src/prover/smt/solver/theory-seq.ts +961 -0
  512. package/src/prover/smt/solver/theory.ts +189 -0
  513. package/src/prover/smt/solver/tseitin-cnf.ts +485 -0
  514. package/src/prover/smt/solver/var-subst.ts +37 -39
  515. package/src/prover/smt/table.ts +3 -10
  516. package/src/prover/smt/types.ts +146 -0
  517. package/src/prover/tlapm/cache.ts +67 -41
  518. package/src/prover/tlapm/ocaml-marshal.ts +19 -21
  519. package/src/prover/tlapm/tlapm.ts +21 -20
  520. package/src/prover/tlapm-library.ts +3208 -0
  521. package/src/prover/verdict.ts +9 -2
  522. package/src/prover/zenon/check/check.ts +1 -11
  523. package/src/prover/zenon/check/definitions.ts +5 -15
  524. package/src/prover/zenon/check/equality.ts +0 -8
  525. package/src/prover/zenon/check/functions.ts +0 -4
  526. package/src/prover/zenon/check/keys.ts +0 -7
  527. package/src/prover/zenon/check/propositional.ts +0 -3
  528. package/src/prover/zenon/check/records.ts +1 -6
  529. package/src/prover/zenon/check/relations.ts +2 -14
  530. package/src/prover/zenon/check/rewrites.ts +2 -21
  531. package/src/prover/zenon/check/sets.ts +40 -61
  532. package/src/prover/zenon/check/terms.ts +1 -19
  533. package/src/prover/zenon/check/tla.ts +0 -6
  534. package/src/prover/zenon/decide.ts +10 -19
  535. package/src/prover/zenon/encode.ts +0 -9
  536. package/src/prover/zenon/eqrel.ts +2 -15
  537. package/src/prover/zenon/equality-rules.ts +0 -6
  538. package/src/prover/zenon/expr.ts +8 -28
  539. package/src/prover/zenon/index-table.ts +26 -59
  540. package/src/prover/zenon/isar-case.ts +8 -20
  541. package/src/prover/zenon/isar.ts +35 -65
  542. package/src/prover/zenon/limits.ts +0 -4
  543. package/src/prover/zenon/llproof.ts +2 -22
  544. package/src/prover/zenon/mltoll.ts +66 -106
  545. package/src/prover/zenon/node.ts +20 -15
  546. package/src/prover/zenon/ocaml.ts +1 -17
  547. package/src/prover/zenon/parse.ts +9 -13
  548. package/src/prover/zenon/phrase.ts +1 -13
  549. package/src/prover/zenon/proof.ts +0 -11
  550. package/src/prover/zenon/propositional-rules.ts +0 -7
  551. package/src/prover/zenon/rules.ts +2 -8
  552. package/src/prover/zenon/search.ts +11 -35
  553. package/src/prover/zenon/tla/functions.ts +59 -33
  554. package/src/prover/zenon/tla/llproof.ts +67 -78
  555. package/src/prover/zenon/tla/records.ts +57 -35
  556. package/src/prover/zenon/tla/rewrites.ts +12 -21
  557. package/src/prover/zenon/tla/sets.ts +88 -59
  558. package/src/prover/zenon/tla/terms.ts +0 -8
  559. package/src/prover/zenon/tla/tla.ts +66 -66
  560. package/src/randomization.ts +81 -35
  561. package/src/resolve.ts +67 -185
  562. package/src/runtime.ts +26 -22
  563. package/src/sany/builtins.ts +2 -5
  564. package/src/sany/generation.ts +394 -0
  565. package/src/sany/generator-def-entries.ts +210 -0
  566. package/src/sany/generator-definitions.ts +686 -0
  567. package/src/sany/generator-expressions.ts +1100 -0
  568. package/src/sany/generator-proofs.ts +662 -0
  569. package/src/sany/generator.ts +191 -2764
  570. package/src/sany/levels.ts +5 -35
  571. package/src/sany/lexer.ts +58 -77
  572. package/src/sany/linter.ts +0 -10
  573. package/src/sany/modules.ts +1 -5
  574. package/src/sany/nodes.ts +5 -43
  575. package/src/sany/parse-error.ts +39 -117
  576. package/src/sany/report.ts +32 -69
  577. package/src/sany/selectors.ts +49 -76
  578. package/src/sany/source.ts +1 -17
  579. package/src/sany/xml.ts +35 -117
  580. package/src/search.ts +671 -169
  581. package/src/simulate.ts +712 -0
  582. package/src/spec-description.ts +192 -100
  583. package/src/standard-definitions.ts +4 -4
  584. package/src/standard-modules.ts +264 -95
  585. package/src/state-graph.ts +52 -33
  586. package/src/subexpressions.ts +69 -52
  587. package/src/substitution-levels.ts +7 -7
  588. package/src/successors.ts +267 -100
  589. package/src/symmetry.ts +35 -27
  590. package/src/tableau.ts +29 -26
  591. package/src/tlc/fingerprint.ts +267 -79
  592. package/src/tlc/jar-data.ts +112 -6
  593. package/src/tlc/messages.ts +125 -54
  594. package/src/tlc/order.ts +39 -69
  595. package/src/tlc/random.ts +37 -49
  596. package/src/tlc/replay.ts +553 -228
  597. package/src/tlc/summary.ts +64 -60
  598. package/src/tlc/tlc-operators.ts +78 -44
  599. package/src/tlc/tlcext-operators.ts +171 -122
  600. package/src/tlc/trace-spec.ts +249 -0
  601. package/src/tlc/value-stream.ts +139 -0
  602. package/src/tlc/version.ts +1 -4
  603. package/src/transfer.ts +22 -25
  604. package/src/typed-tier.ts +6535 -0
  605. package/src/typescript/actions.ts +479 -0
  606. package/src/typescript/collections.ts +614 -0
  607. package/src/typescript/compile.ts +63 -0
  608. package/src/typescript/context.ts +94 -0
  609. package/src/typescript/emit.ts +121 -0
  610. package/src/typescript/expressions.ts +496 -0
  611. package/src/typescript/formula.ts +154 -0
  612. package/src/typescript/functions.ts +284 -0
  613. package/src/typescript/model.ts +162 -0
  614. package/src/typescript/names.ts +114 -0
  615. package/src/typescript/program.ts +48 -0
  616. package/src/typescript/properties.ts +139 -0
  617. package/src/typescript/scope.ts +112 -0
  618. package/src/typescript/steps.ts +167 -0
  619. package/src/typescript/types.ts +171 -0
  620. package/src/values.ts +832 -484
  621. package/src/worker.ts +7 -8
  622. package/src/prover/isabelle/isar/statement.ts +0 -57
  623. package/src/prover/smt/solver/z3-license.txt +0 -10
  624. package/src/prover/tlaps-module.ts +0 -510
  625. package/src/prover/zenon/LICENSE +0 -32
@@ -1,14 +1,7 @@
1
- // The parts of OCaml's standard library whose exact behavior steers Zenon's search.
2
- //
3
- // Hashtbl.hash on the values Zenon hashes: strings, and the (int, string list) pairs that Expr
4
- // hashes. Zenon orders record fields by these hashes. Ints are 63-bit in OCaml, so an int is a
5
- // high part in [-2^30, 2^30) and a low part in [0, 2^32).
6
-
7
1
  const TWO_32 = 4294967296;
8
2
  const TWO_31 = 2147483648;
9
3
  const TWO_30 = 1073741824;
10
4
 
11
- // A block's header with its color bits cleared: two fields and tag 0, for a pair or a list cell.
12
5
  const PAIR_HEADER = 0x800;
13
6
 
14
7
  const MEANINGFUL_LIMIT = 10;
@@ -28,8 +21,6 @@ const finalMix = (hash: number) => {
28
21
  return ((second ^ (second >>> 16)) >>> 0) & 0x3fffffff;
29
22
  };
30
23
 
31
- // A string's UTF-8 bytes as the little-endian words that caml_hash_mix_string mixes, the last one
32
- // partial.
33
24
  interface StringWords {
34
25
  words: number[];
35
26
  length: number;
@@ -54,15 +45,12 @@ const mixWords = (hash: number, encoded: StringWords) => {
54
45
  return mixed ^ encoded.length;
55
46
  };
56
47
 
57
- // caml_hash_mix_intnat on the tagged value 2n + 1 of the int n.
58
48
  const mixInt = (hash: number, high: number, low: number) => {
59
49
  const taggedLow = (low * 2 + 1) % TWO_32;
60
50
  const taggedHigh = high * 2 + Math.floor((low * 2 + 1) / TWO_32);
61
51
  return mix(hash, (taggedHigh ^ (taggedHigh < 0 ? -1 : 0) ^ taggedLow) | 0);
62
52
  };
63
53
 
64
- // Hashtbl.hash on strings and on (int, string list) pairs. It keeps each string's words and hash,
65
- // because Zenon hashes the same variable names over and over.
66
54
  export const createHasher = () => {
67
55
  const stringWords = new Map<string, StringWords>();
68
56
  const stringHashes = new Map<string, number>();
@@ -103,7 +91,6 @@ export interface Int63 {
103
91
  low: number;
104
92
  }
105
93
 
106
- // Expr's combine: x + y * 131 + 1, wrapping like OCaml's 63-bit ints.
107
94
  export const combine = (left: Int63, right: Int63): Int63 => {
108
95
  const product = right.low * 131;
109
96
  const productCarry = Math.floor(product / TWO_32);
@@ -117,8 +104,6 @@ export const combine = (left: Int63, right: Int63): Int63 => {
117
104
 
118
105
  export const toInt63 = (value: number): Int63 => ({ high: 0, low: value });
119
106
 
120
- // The merges of OCaml's List.stable_sort, on arrays. Each returns its result reversed, as OCaml's
121
- // rev_merge and rev_merge_rev do.
122
107
  const mergeReversed = <Item>(
123
108
  first: Item[],
124
109
  second: Item[],
@@ -136,8 +121,7 @@ const mergeReversed = <Item>(
136
121
  return merged.reverse();
137
122
  };
138
123
 
139
- // OCaml's List.sort, step for step, so that a comparison that isn't a total order still gives
140
- // Zenon's result.
124
+ // OCaml's List.sort, step for step, so that a comparison that isn't a total order still gives Zenon's result.
141
125
  export const stableSort = <Item>(items: Item[], compare: (left: Item, right: Item) => number) => {
142
126
  const sortRun = (count: number, start: number, isReversed: boolean): Item[] => {
143
127
  const isBefore = (left: Item, right: Item) =>
@@ -1,8 +1,3 @@
1
- // Ported from Zenon's lexzen.mll and parsezen.mly, as shipped in tlapm. Copyright 2005 INRIA, see
2
- // LICENSE.
3
- //
4
- // Reads Zenon's native input format, the .znn files that tlapm writes.
5
-
6
1
  import { TlaZenonError } from "../../errors";
7
2
  import {
8
3
  FALSE,
@@ -109,7 +104,6 @@ const tokenize = (text: string) => {
109
104
  return tokens;
110
105
  };
111
106
 
112
- // Zenon's myfold: an n-ary connective nests to the right.
113
107
  const foldRight = (combine: (left: Expr, right: Expr) => Expr, first: Expr, rest: Expr[]): Expr =>
114
108
  rest.length === 0 ? first : combine(first, foldRight(combine, rest[0], rest.slice(1)));
115
109
 
@@ -127,18 +121,14 @@ export const parseZenon = (exprs: Expressions, text: string): Phrase[] => {
127
121
  };
128
122
  const tokens = tokenize(text);
129
123
  let position = 0;
130
- const peek = (offset = 0) => tokens[position + offset];
131
124
  const next = () => tokens[position++];
132
- const expect = (kind: TokenKind, value?: string) => {
125
+ const expect = (kind: TokenKind) => {
133
126
  const token = next();
134
- if (token.kind !== kind || (value !== undefined && token.text !== value))
135
- throw new TlaZenonError(`Zenon: line ${token.line}: syntax error`);
127
+ if (token.kind !== kind) throw new TlaZenonError(`Zenon: line ${token.line}: syntax error`);
136
128
  return token;
137
129
  };
138
- const isAt = (kind: TokenKind, value?: string) =>
139
- peek().kind === kind && (value === undefined || peek().text === value);
130
+ const isAt = (kind: TokenKind) => tokens[position].kind === kind;
140
131
 
141
- // A lambda after its first parenthesis: ((x y "type") body).
142
132
  const parseLambda = () => {
143
133
  expect("open");
144
134
  const names: string[] = [];
@@ -241,6 +231,12 @@ export const parseZenon = (exprs: Expressions, text: string): Phrase[] => {
241
231
  kind: "def",
242
232
  definition: { kind: "real", name, symbol, params, body },
243
233
  });
234
+ } else if (token.kind === "keyword" && token.text === "$sig") {
235
+ expect("ident");
236
+ expect("open");
237
+ while (isAt("string")) next();
238
+ expect("close");
239
+ expect("string");
244
240
  } else throw new TlaZenonError(`Zenon: line ${token.line}: unsupported phrase ${token.text}`);
245
241
  }
246
242
  return phrases;
@@ -1,8 +1,3 @@
1
- // Ported from Zenon's phrase.ml, as shipped in tlapm. Copyright 2004 INRIA, see LICENSE.
2
- //
3
- // Splits the input into definitions and hypotheses. A hypothesis that defines a symbol, such as
4
- // x = e or \A a, b : f(a, b) <=> e, becomes a definition that the prover unfolds.
5
-
6
1
  import type { Expr } from "./expr";
7
2
  import type { Definition, Phrase } from "./parse";
8
3
 
@@ -13,7 +8,6 @@ export interface Hypothesis {
13
8
 
14
9
  const hasName = (env: Expr[], name: string) => env.some((variable) => variable.symbol === name);
15
10
 
16
- // Zenon's check_args: the arguments are variables, and exactly the quantified ones.
17
11
  const isParameterList = (env: Expr[], args: Expr[]) => {
18
12
  if (!args.every((arg) => arg.kind === "var")) return false;
19
13
  const envNames = env.map((variable) => variable.symbol).sort();
@@ -50,8 +44,6 @@ interface Shape {
50
44
  body: Expr;
51
45
  }
52
46
 
53
- // The ways a formula can define a symbol, in the order Zenon tries them: a definiendum that is an
54
- // application with its parameters, or a constant.
55
47
  const getShapes = (expression: Expr): Shape[] => {
56
48
  const sides =
57
49
  expression.kind === "equiv" || (expression.kind === "app" && expression.symbol === "=")
@@ -79,8 +71,7 @@ const stripForall = (expression: Expr, env: Expr[]): { env: Expr[]; body: Expr }
79
71
  ? stripForall(expression.args[1], [expression.args[0], ...env])
80
72
  : { env, body: expression };
81
73
 
82
- // Zenon's is_def, then make_def. The two try the shapes with different conditions, so the shape
83
- // that defines the symbol can differ from the one that qualifies the formula.
74
+ // Zenon's is_def and make_def try the shapes with different conditions, so the defining shape can differ from the qualifying one.
84
75
  const getDefinition = (
85
76
  predefined: string[],
86
77
  hypothesis: Hypothesis,
@@ -145,8 +136,6 @@ const isLooping = (symbol: string, symbols: string[], dependencies: Dependency[]
145
136
  (symbols.includes(symbol) ||
146
137
  isLooping(symbol, followDependencies(symbols, dependencies), dependencies));
147
138
 
148
- // Zenon's separate. Definitions come before hypotheses, each in input order, except where a
149
- // symbol is defined twice: then neither formula defines it.
150
139
  export const separate = (predefined: string[], phrases: Phrase[]) => {
151
140
  let dependencies: Dependency[] = [];
152
141
  const multiple: string[] = [];
@@ -165,7 +154,6 @@ export const separate = (predefined: string[], phrases: Phrase[]) => {
165
154
  }
166
155
  const symbol = definition.symbol;
167
156
  const dependency: Dependency = [symbol, getFreeSymbols(definition.params, [], definition.body)];
168
- // The lists are reversed, as in Zenon, so a definition's index 0 is the latest.
169
157
  const previous = definitions.findIndex(
170
158
  (existing) => existing.kind === "pseudo" && existing.symbol === symbol,
171
159
  );
@@ -1,9 +1,3 @@
1
- // Ported from Zenon's mlproof.ml, as shipped in tlapm. Copyright 2004 INRIA, see LICENSE.
2
- //
3
- // The proofs that the search builds and the checker reads. Each rule takes a fixed number of
4
- // arguments, or at least a fixed number, so a rule application can't have the wrong arity. The
5
- // rules of the TLA+ extension, Zenon's Ext, sit beside the core rules: their names don't clash.
6
-
7
1
  import type { Expr } from "./expr";
8
2
  import type { Definition } from "./parse";
9
3
 
@@ -14,7 +8,6 @@ type Five<Term> = [Term, Term, Term, Term, Term];
14
8
  type Six<Term> = [Term, Term, Term, Term, Term, Term];
15
9
  type Seven<Term> = [Term, Term, Term, Term, Term, Term, Term];
16
10
 
17
- // The arguments of each rule that names neither a relation nor a definition.
18
11
  interface PlainRuleArgs<Term> {
19
12
  close: [Term];
20
13
  false: [];
@@ -141,7 +134,6 @@ interface PlainRuleArgs<Term> {
141
134
  tuple_len: Five<Term>;
142
135
  }
143
136
 
144
- // The rules that hold for any relation that the hypotheses make reflexive or symmetric.
145
137
  interface RelationRuleArgs<Term> {
146
138
  close_refl: [Term];
147
139
  close_sym: Two<Term>;
@@ -167,14 +159,11 @@ type RelationRules<Term> = {
167
159
  };
168
160
  };
169
161
 
170
- // A rule application, as in Zenon's Mlproof.rule. "definition" unfolds `definition`.
171
162
  export type Rule<Term = Expr> =
172
163
  | PlainRules<Term>[PlainRuleName]
173
164
  | RelationRules<Term>[RelationRuleName]
174
165
  | { name: "definition"; definition: Definition; args: Two<Term> };
175
166
 
176
- // A proof of the formulas in `conclusions`: the node's rule applied to `uses`, with a subproof for
177
- // each of its branches.
178
167
  export interface Proof<Term = Expr> {
179
168
  conclusions: Term[];
180
169
  rule: Rule<Term>;
@@ -1,7 +1,3 @@
1
- // Ported from Zenon's prove.ml, as shipped in tlapm. Copyright 2002 INRIA, see LICENSE.
2
- //
3
- // The rules for connectives and quantifiers, closing a branch, and unfolding definitions.
4
-
5
1
  import { getStringValue } from "./equality-rules";
6
2
  import { isApp, type Expr, type Expressions } from "./expr";
7
3
  import { insertNode, type Queue } from "./node";
@@ -9,7 +5,6 @@ import type { Definition } from "./parse";
9
5
  import { makeRelationRule, makeRule, type Rule } from "./proof";
10
6
  import { makeNode, type RuleResult, type SearchRule } from "./rules";
11
7
 
12
- // Zenon's is_conj and is_disj: how many more conjuncts or disjuncts a formula needs to reach m.
13
8
  const countConjuncts = (formula: Expr, needed: number): number => {
14
9
  if (needed <= 0) return 0;
15
10
  if (formula.kind === "and")
@@ -350,8 +345,6 @@ export const addUnfold: SearchRule = (context, queue, formula, goalness) => {
350
345
  wrap,
351
346
  );
352
347
  };
353
- // Zenon tries applications before variables, each first as the formula itself, then as either
354
- // side of a relation that is reflexive, symmetric or transitive.
355
348
  for (const kind of ["app", "var"]) {
356
349
  if (atom.kind === kind) {
357
350
  const result = tryUnfold(atom, negate);
@@ -1,8 +1,3 @@
1
- // Ported from Zenon's prove.ml, as shipped in tlapm. Copyright 2002 INRIA, see LICENSE.
2
- //
3
- // Zenon's newnodes: each rule in turn suggests nodes for a formula added to a branch, until one
4
- // says that the rest don't apply.
5
-
6
1
  import type { Relations } from "./eqrel";
7
2
  import {
8
3
  addCongruence,
@@ -12,7 +7,7 @@ import {
12
7
  addSymmetricMatches,
13
8
  addTransitivity,
14
9
  } from "./equality-rules";
15
- import { type Expr, type Expressions } from "./expr";
10
+ import type { Expr, Expressions } from "./expr";
16
11
  import type { Index } from "./index-table";
17
12
  import { insertNode, type Node, type Priority, type Queue } from "./node";
18
13
  import type { Rule } from "./proof";
@@ -62,8 +57,7 @@ const addExtensions: SearchRule = (context, queue, formula, goalness) => {
62
57
  return [insertAll(queue, result.nodes), result.isStopped];
63
58
  };
64
59
 
65
- // Zenon's newnodes_preunif comes after addReflexivity, but it never adds a node: it preunifies a
66
- // formula with its negation, whose heads always differ.
60
+ // Deviation from Zenon: newnodes_preunif is left out because it never adds a node.
67
61
  const RULES: SearchRule[] = [
68
62
  addAbsurd,
69
63
  addClosure,
@@ -1,12 +1,5 @@
1
- // Ported from Zenon's prove.ml, as shipped in tlapm. Copyright 2002 INRIA, see LICENSE.
2
- //
3
- // The tableau search. Each formula added to a branch suggests nodes, which wait in the queue by
4
- // priority. The search takes the next node, and refutes each of its branches in turn. A branch is
5
- // closed when it holds a formula and its negation. Zenon's mutually recursive search functions are
6
- // one loop here, with an explicit stack of frames.
7
-
8
1
  import { TlaZenonError } from "../../errors";
9
- import { difference, isApp, isDisjoint, isMeta, union, type Expr } from "./expr";
2
+ import { difference, isApp, isDisjoint, isMeta, isRelation, union, type Expr } from "./expr";
10
3
  import { getLimitFailure, type Limits } from "./limits";
11
4
  import { EMPTY_QUEUE, getQueueHead, removeNode, type Node, type Queue } from "./node";
12
5
  import { stableSort } from "./ocaml";
@@ -18,12 +11,10 @@ import { addNodes, type SearchContext } from "./rules";
18
11
  const isTrivial = (context: SearchContext, formula: Expr) =>
19
12
  formula.kind === "true" ||
20
13
  (formula.kind === "not" && formula.args[0].kind === "false") ||
21
- (formula.kind === "app" &&
22
- formula.args.length === 2 &&
14
+ (isRelation(formula) &&
23
15
  formula.args[0] === formula.args[1] &&
24
16
  context.relations.isReflexive(formula.symbol));
25
17
 
26
- // Zenon's reduce_list: drops the formulas a branch already has, and reverses the rest.
27
18
  const reduceBranch = (context: SearchContext, branch: Expr[]) => {
28
19
  const exprs = context.exprs;
29
20
  const index = context.index;
@@ -32,8 +23,7 @@ const reduceBranch = (context: SearchContext, branch: Expr[]) => {
32
23
  const isKnown = (formula: Expr) => index.isMember(formula) || kept.includes(formula);
33
24
  for (const formula of branch) {
34
25
  if (
35
- formula.kind === "true" ||
36
- (formula.kind === "not" && formula.args[0].kind === "false") ||
26
+ isTrivial(context, formula) ||
37
27
  (formula.kind === "not" &&
38
28
  isApp(formula.args[0], "TLA.in", 2) &&
39
29
  formula.args[0].args[1].kind === "var" &&
@@ -41,15 +31,7 @@ const reduceBranch = (context: SearchContext, branch: Expr[]) => {
41
31
  )
42
32
  continue;
43
33
  const atom = formula.kind === "not" ? formula.args[0] : formula;
44
- const isRelation = atom.kind === "app" && atom.args.length === 2;
45
- if (
46
- formula.kind === "app" &&
47
- isRelation &&
48
- formula.args[0] === formula.args[1] &&
49
- relations.isReflexive(formula.symbol)
50
- )
51
- continue;
52
- if (isRelation && relations.isSymmetric(atom.symbol)) {
34
+ if (isRelation(atom) && relations.isSymmetric(atom.symbol)) {
53
35
  const swapped = exprs.eapp(atom.symbol, [atom.args[1], atom.args[0]]);
54
36
  const reversed = formula.kind === "not" ? exprs.enot(swapped) : swapped;
55
37
  if (!isKnown(formula) && !isKnown(reversed)) kept.unshift(formula);
@@ -138,19 +120,18 @@ interface Frame {
138
120
  interface SearchStatistics {
139
121
  inferences: number;
140
122
  proofNodes: number;
141
- // The proofs that closed another branch from the lemma cache. Zenon counts the uses in mlrefc and
142
- // prints each of these proofs once, as a lemma.
143
123
  reusedProofs: Set<Proof>;
144
124
  }
145
125
 
146
126
  export type SearchFailure = "exhausted" | "time limit" | "memory limit" | "aborted";
147
127
 
148
- // Zenon gives up once its heap passes 1 GB. The port bounds the nodes that the queues of the
149
- // current branch hold instead. On the corpus files where Zenon runs out of memory, its heap passes
150
- // 1 GB with 1.9 to 5.5 million of them, and no proof that Zenon finds needs more than 1.3 million.
151
- const MAX_QUEUED_NODES = 1_900_000;
128
+ // Zenon gives up once its heap passes 1 GB. Modeled as a 2M-word formula table, 20 words per formula
129
+ // created and 1.1 per word of queued nodes, the heap is within 8% of Zenon's past 600 MB on the corpus.
130
+ const getHeapWords = (context: SearchContext, queue: Queue) =>
131
+ 2_000_000 + 20 * context.exprs.getCreatedCount() + 1.1 * queue.nodeWords;
132
+
133
+ const MAX_HEAP_WORDS = 1_000_000_000 / 8;
152
134
 
153
- // The proof of the hypotheses' inconsistency, or why the search gave up.
154
135
  export const search = (
155
136
  context: SearchContext,
156
137
  definitions: Definition[],
@@ -192,8 +173,6 @@ export const search = (
192
173
  return proof;
193
174
  };
194
175
 
195
- // Zenon's next_branch and unwind: descend into the next open branch of a node, or close the node
196
- // and pop frames until one has an open branch left.
197
176
  const advance = (
198
177
  searchNode: Node,
199
178
  nodeQueue: Queue,
@@ -227,8 +206,6 @@ export const search = (
227
206
  }
228
207
  };
229
208
 
230
- // Pops the frames that the proof closes. Returns the proof when it closes the root, and leaves the
231
- // frame to continue on top of the stack otherwise, with the proof recorded.
232
209
  const unwind = (proof: Proof): Proof | undefined => {
233
210
  for (;;) {
234
211
  const frame = stack.pop();
@@ -246,7 +223,7 @@ export const search = (
246
223
  for (;;) {
247
224
  const limitFailure = getLimitFailure(limits);
248
225
  if (limitFailure !== undefined) return limitFailure;
249
- if (queue.insertedCount > MAX_QUEUED_NODES) return "memory limit";
226
+ if (getHeapWords(context, queue) > MAX_HEAP_WORDS) return "memory limit";
250
227
  if (formIndex < forms.length) {
251
228
  const entry = forms[formIndex++];
252
229
  const formula = entry[0];
@@ -267,7 +244,6 @@ export const search = (
267
244
  if (result !== undefined) return result;
268
245
  continue;
269
246
  }
270
- // Zenon's next_node: the next node whose branches all add something new.
271
247
  for (;;) {
272
248
  statistics.inferences++;
273
249
  const removed = removeNode(queue);
@@ -1,10 +1,6 @@
1
- // Ported from Zenon's ext_tla.ml, as shipped in tlapm. Copyright 2008 INRIA, see LICENSE.
2
- //
3
- // The rules for functions: membership in a function set, isAFcn and function equality.
4
-
5
- import { isApp, type Expr } from "../expr";
1
+ import { isApp } from "../expr";
6
2
  import type { Priority } from "../node";
7
- import { makeRule, type Rule } from "../proof";
3
+ import { makeRule } from "../proof";
8
4
  import {
9
5
  domain,
10
6
  equal,
@@ -22,8 +18,6 @@ export const getFunctionSetNodes = (literal: Literal): Item[] | undefined => {
22
18
  const formula = literal.formula;
23
19
  const isNegated = literal.isNegated;
24
20
  const relation = literal.relation;
25
- const node = (priority: Priority, rule: Rule, branches: Expr[][]) =>
26
- makeExtensionNode(literal, priority, rule, branches);
27
21
  if (relation?.symbol === "TLA.in") {
28
22
  const element = relation.args[0];
29
23
  const set = relation.args[1];
@@ -31,8 +25,8 @@ export const getFunctionSetNodes = (literal: Literal): Item[] | undefined => {
31
25
  const fcn = element;
32
26
  const source = set.args[0];
33
27
  const target = set.args[1];
34
- const isFcn = exprs.eapp("TLA.isAFcn", [fcn]);
35
- const hasDomain = equal(exprs, domain(exprs, fcn), source);
28
+ const fcnFormula = exprs.eapp("TLA.isAFcn", [fcn]);
29
+ const domainFormula = equal(exprs, domain(exprs, fcn), source);
36
30
  const bound = exprs.newVar();
37
31
  const maps = exprs.eall(
38
32
  bound,
@@ -43,25 +37,36 @@ export const getFunctionSetNodes = (literal: Literal): Item[] | undefined => {
43
37
  ),
44
38
  );
45
39
  if (!isNegated) {
46
- const rule = makeRule("in_funcset", [formula, isFcn, hasDomain, maps, fcn, source, target]);
40
+ const rule = makeRule("in_funcset", [
41
+ formula,
42
+ fcnFormula,
43
+ domainFormula,
44
+ maps,
45
+ fcn,
46
+ source,
47
+ target,
48
+ ]);
47
49
  return [
48
- ...node("arity", rule, [[isFcn, hasDomain]]),
49
- ...node({ instance: maps }, rule, [[isFcn, hasDomain, maps]]),
50
+ ...makeExtensionNode(literal, "arity", rule, [[fcnFormula, domainFormula]]),
51
+ ...makeExtensionNode(literal, { instance: maps }, rule, [
52
+ [fcnFormula, domainFormula, maps],
53
+ ]),
50
54
  ];
51
55
  }
52
- const notFcn = exprs.enot(isFcn);
53
- const notDomain = exprs.enot(hasDomain);
56
+ const notFcn = exprs.enot(fcnFormula);
57
+ const notDomain = exprs.enot(domainFormula);
54
58
  const notMaps = exprs.enot(maps);
55
59
  const priority: Priority =
56
60
  fcn.kind === "app" && FUNCTION_CONSTRUCTORS.includes(fcn.symbol)
57
61
  ? "arity"
58
62
  : { instance: notMaps };
59
63
  const shortcut = isApp(fcn, "TLA.except", 3)
60
- ? node(
64
+ ? makeExtensionNode(
65
+ literal,
61
66
  "arity",
62
67
  makeRule("except_notin_funcset", [
63
68
  formula,
64
- exprs.enot(member(exprs, fcn.args[0], exprs.eapp("TLA.FuncSet", [source, target]))),
69
+ exprs.enot(member(exprs, fcn.args[0], set)),
65
70
  exprs.enot(member(exprs, fcn.args[2], target)),
66
71
  fcn.args[0],
67
72
  fcn.args[1],
@@ -70,14 +75,15 @@ export const getFunctionSetNodes = (literal: Literal): Item[] | undefined => {
70
75
  target,
71
76
  ]),
72
77
  [
73
- [exprs.enot(member(exprs, fcn.args[0], exprs.eapp("TLA.FuncSet", [source, target])))],
78
+ [exprs.enot(member(exprs, fcn.args[0], set))],
74
79
  [exprs.enot(member(exprs, fcn.args[2], target))],
75
80
  ],
76
81
  )
77
82
  : [];
78
83
  return [
79
84
  ...shortcut,
80
- ...node(
85
+ ...makeExtensionNode(
86
+ literal,
81
87
  priority,
82
88
  makeRule("notin_funcset", [formula, notFcn, notDomain, notMaps, fcn, source, target]),
83
89
  [[notFcn], [notDomain], [notMaps]],
@@ -94,22 +100,36 @@ export const getFunctionNodes = (literal: Literal): Item[] | undefined => {
94
100
  const isNegated = literal.isNegated;
95
101
  const atom = literal.atom;
96
102
  const relation = literal.relation;
97
- const node = (priority: Priority, rule: Rule, branches: Expr[][]) =>
98
- makeExtensionNode(literal, priority, rule, branches);
99
103
  if (isNegated && isApp(atom, "TLA.isAFcn", 1)) {
100
104
  const fcn = atom.args[0];
101
105
  if (isApp(fcn, "TLA.Fcn", 2))
102
- return node("prop", makeRule("notisafcn_fcn", [formula, fcn.args[0], fcn.args[1]]), []);
106
+ return makeExtensionNode(
107
+ literal,
108
+ "prop",
109
+ makeRule("notisafcn_fcn", [formula, fcn.args[0], fcn.args[1]]),
110
+ [],
111
+ );
103
112
  if (isApp(fcn, "TLA.except", 3))
104
- return node(
113
+ return makeExtensionNode(
114
+ literal,
105
115
  "prop",
106
116
  makeRule("notisafcn_except", [formula, fcn.args[0], fcn.args[1], fcn.args[2]]),
107
117
  [],
108
118
  );
109
119
  if (isApp(fcn, "TLA.oneArg", 2))
110
- return node("prop", makeRule("notisafcn_onearg", [formula, fcn.args[0], fcn.args[1]]), []);
120
+ return makeExtensionNode(
121
+ literal,
122
+ "prop",
123
+ makeRule("notisafcn_onearg", [formula, fcn.args[0], fcn.args[1]]),
124
+ [],
125
+ );
111
126
  if (isApp(fcn, "TLA.extend", 2))
112
- return node("prop", makeRule("notisafcn_extend", [formula, fcn.args[0], fcn.args[1]]), []);
127
+ return makeExtensionNode(
128
+ literal,
129
+ "prop",
130
+ makeRule("notisafcn_extend", [formula, fcn.args[0], fcn.args[1]]),
131
+ [],
132
+ );
113
133
  }
114
134
  if (relation?.symbol !== "=") return undefined;
115
135
  const left = relation.args[0];
@@ -119,15 +139,18 @@ export const getFunctionNodes = (literal: Literal): Item[] | undefined => {
119
139
  const sameDomain = equal(exprs, domain(exprs, left), domain(exprs, right));
120
140
  const sameValue = equal(exprs, fapply(exprs, left, bound), fapply(exprs, right, bound));
121
141
  if (!isNegated) {
122
- const isFcn = exprs.eequiv(
142
+ const fcnEquivalence = exprs.eequiv(
123
143
  exprs.eapp("TLA.isAFcn", [left]),
124
144
  exprs.eapp("TLA.isAFcn", [right]),
125
145
  );
126
146
  const values = exprs.eall(bound, "", sameValue);
127
- const result = exprs.eand(exprs.eand(isFcn, sameDomain), values);
128
- return node({ instance: values }, makeRule("funequal", [formula, result, left, right]), [
129
- [result],
130
- ]);
147
+ const result = exprs.eand(exprs.eand(fcnEquivalence, sameDomain), values);
148
+ return makeExtensionNode(
149
+ literal,
150
+ { instance: values },
151
+ makeRule("funequal", [formula, result, left, right]),
152
+ [[result]],
153
+ );
131
154
  }
132
155
  const values = exprs.eall(
133
156
  bound,
@@ -143,9 +166,12 @@ export const getFunctionNodes = (literal: Literal): Item[] | undefined => {
143
166
  values,
144
167
  ),
145
168
  );
146
- return node({ instance: values }, makeRule("notfunequal", [formula, result, left, right]), [
147
- [result],
148
- ]);
169
+ return makeExtensionNode(
170
+ literal,
171
+ { instance: values },
172
+ makeRule("notfunequal", [formula, result, left, right]),
173
+ [[result]],
174
+ );
149
175
  }
150
176
  return undefined;
151
177
  };