tla-ts 0.0.9-dev.8298a52 → 0.0.10-dev.06b481ee0

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (631) hide show
  1. package/README.md +8 -0
  2. package/dist/compile.cjs +6 -6
  3. package/dist/compile.js +10 -10
  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 +121 -12
  8. package/dist/index.d.ts +121 -12
  9. package/dist/index.js +1 -1
  10. package/dist/parallel-worker.cjs +1 -1
  11. package/dist/parallel-worker.js +1 -1
  12. package/dist/prove-worker.cjs +1 -1
  13. package/dist/prove-worker.js +1 -1
  14. package/dist/prove.cjs +2746 -410
  15. package/dist/prove.js +2745 -409
  16. package/dist/run.cjs +144 -31
  17. package/dist/run.js +144 -31
  18. package/dist/tlapm.cjs +2 -2
  19. package/dist/tlapm.js +2 -2
  20. package/dist/transfer.cjs +134 -104
  21. package/dist/transfer.js +134 -104
  22. package/dist/worker.cjs +7 -7
  23. package/dist/worker.js +7 -7
  24. package/package.json +1 -1
  25. package/src/ast.ts +56 -60
  26. package/src/bags.ts +128 -110
  27. package/src/builtins.ts +31 -77
  28. package/src/bundled-modules.ts +1 -8
  29. package/src/check-failure.ts +118 -0
  30. package/src/check-trace.ts +320 -0
  31. package/src/check.ts +1155 -900
  32. package/src/cli/options.ts +12 -32
  33. package/src/cli/run.ts +0 -2
  34. package/src/cli/runtime-invariants.ts +100 -0
  35. package/src/cli/shared.ts +19 -12
  36. package/src/cli/tlapm.ts +433 -82
  37. package/src/cli/tlc-arguments.ts +652 -0
  38. package/src/cli/tlc-output.ts +701 -0
  39. package/src/cli/tlc-usage.ts +360 -0
  40. package/src/cli/tlc.ts +318 -656
  41. package/src/cli/typescript.ts +0 -3
  42. package/src/cli/xml-exporter.ts +27 -49
  43. package/src/cli.ts +0 -1
  44. package/src/codegen.ts +217 -82
  45. package/src/config.ts +140 -109
  46. package/src/coverage.ts +1019 -0
  47. package/src/dependencies.ts +101 -66
  48. package/src/dfid.ts +683 -0
  49. package/src/environment-config.ts +315 -0
  50. package/src/environment.ts +260 -371
  51. package/src/errors.ts +93 -58
  52. package/src/evaluate.ts +848 -374
  53. package/src/exit-codes.ts +63 -13
  54. package/src/fingerprints.ts +75 -11
  55. package/src/index.ts +3 -0
  56. package/src/instances.ts +97 -43
  57. package/src/java-hash.ts +21 -0
  58. package/src/java-overrides.ts +6 -21
  59. package/src/json-reader.ts +455 -0
  60. package/src/json.ts +252 -139
  61. package/src/levels.ts +231 -154
  62. package/src/lexer.ts +83 -101
  63. package/src/liveness-checker.ts +743 -325
  64. package/src/liveness.ts +224 -131
  65. package/src/obligations/action.ts +17 -44
  66. package/src/obligations/anonymize.ts +120 -95
  67. package/src/obligations/enabled-axioms.ts +218 -0
  68. package/src/obligations/equality.ts +1 -3
  69. package/src/obligations/expression.ts +37 -26
  70. package/src/obligations/format.ts +0 -10
  71. package/src/obligations/generate.ts +66 -64
  72. package/src/obligations/index.ts +39 -20
  73. package/src/obligations/levels.ts +27 -18
  74. package/src/obligations/module.ts +28 -55
  75. package/src/obligations/normalize.ts +31 -41
  76. package/src/obligations/operators.ts +0 -3
  77. package/src/obligations/pragma.ts +52 -24
  78. package/src/obligations/printer.ts +94 -63
  79. package/src/obligations/proof.ts +3 -6
  80. package/src/obligations/regroup.ts +0 -5
  81. package/src/obligations/simplify.ts +57 -63
  82. package/src/obligations/source.ts +121 -95
  83. package/src/obligations/subexpression.ts +49 -28
  84. package/src/obligations/substitution.ts +1 -5
  85. package/src/obligations/temporal.ts +12 -20
  86. package/src/obligations/tuples.ts +2 -10
  87. package/src/parallel-worker.ts +34 -57
  88. package/src/parallel.ts +62 -72
  89. package/src/parser.ts +1184 -531
  90. package/src/pcal/ast.ts +53 -86
  91. package/src/pcal/parse.ts +144 -219
  92. package/src/pcal/tokenize.ts +91 -131
  93. package/src/pcal/translate.ts +83 -130
  94. package/src/pcal/validate.ts +48 -68
  95. package/src/pretty-print.ts +7 -8
  96. package/src/prover/decide-pool.ts +8 -13
  97. package/src/prover/deciders.ts +12 -13
  98. package/src/prover/first-order.ts +0 -11
  99. package/src/prover/isabelle/decide.ts +3 -31
  100. package/src/prover/isabelle/encode.ts +82 -64
  101. package/src/prover/isabelle/isar/attrib.ts +250 -0
  102. package/src/prover/isabelle/isar/context.ts +335 -0
  103. package/src/prover/isabelle/isar/induct.ts +382 -0
  104. package/src/prover/isabelle/isar/inner-syntax.ts +262 -117
  105. package/src/prover/isabelle/isar/method.ts +510 -226
  106. package/src/prover/isabelle/isar/proof.ts +570 -23
  107. package/src/prover/isabelle/isar/rule-cases.ts +226 -0
  108. package/src/prover/isabelle/isar/theory.ts +488 -88
  109. package/src/prover/isabelle/isar/toplevel.ts +331 -0
  110. package/src/prover/isabelle/isar/type-check.ts +99 -38
  111. package/src/prover/isabelle/provers/blast/blast.ts +16 -105
  112. package/src/prover/isabelle/provers/blast/branch.ts +0 -33
  113. package/src/prover/isabelle/provers/blast/prove.ts +0 -36
  114. package/src/prover/isabelle/provers/blast/rules.ts +5 -45
  115. package/src/prover/isabelle/provers/blast/state.ts +1 -29
  116. package/src/prover/isabelle/provers/blast/term.ts +8 -37
  117. package/src/prover/isabelle/provers/clasimp.ts +1 -15
  118. package/src/prover/isabelle/provers/classical.ts +58 -61
  119. package/src/prover/isabelle/provers/hypsubst.ts +29 -54
  120. package/src/prover/isabelle/pure/bicompose.ts +24 -39
  121. package/src/prover/isabelle/pure/consts.ts +0 -8
  122. package/src/prover/isabelle/pure/conv.ts +2 -18
  123. package/src/prover/isabelle/pure/drule.ts +95 -45
  124. package/src/prover/isabelle/pure/envir.ts +2 -53
  125. package/src/prover/isabelle/pure/goal.ts +1 -9
  126. package/src/prover/isabelle/pure/interrupt.ts +0 -5
  127. package/src/prover/isabelle/pure/list.ts +0 -3
  128. package/src/prover/isabelle/pure/logic.ts +1 -16
  129. package/src/prover/isabelle/pure/name.ts +1 -10
  130. package/src/prover/isabelle/pure/net.ts +2 -60
  131. package/src/prover/isabelle/pure/object-logic.ts +15 -16
  132. package/src/prover/isabelle/pure/pattern.ts +1 -20
  133. package/src/prover/isabelle/pure/raw-simplifier.ts +16 -63
  134. package/src/prover/isabelle/pure/rewriter.ts +34 -77
  135. package/src/prover/isabelle/pure/search.ts +2 -11
  136. package/src/prover/isabelle/pure/seq.ts +0 -11
  137. package/src/prover/isabelle/pure/simplifier.ts +27 -16
  138. package/src/prover/isabelle/pure/table.ts +2 -33
  139. package/src/prover/isabelle/pure/tactic.ts +11 -23
  140. package/src/prover/isabelle/pure/tactical.ts +47 -48
  141. package/src/prover/isabelle/pure/term-ord.ts +1 -7
  142. package/src/prover/isabelle/pure/term.ts +4 -47
  143. package/src/prover/isabelle/pure/thm.ts +26 -48
  144. package/src/prover/isabelle/pure/type.ts +1 -16
  145. package/src/prover/isabelle/pure/unify.ts +19 -31
  146. package/src/prover/isabelle/pure/variable.ts +2 -8
  147. package/src/prover/isabelle/tla/classical-setup.ts +17 -25
  148. package/src/prover/isabelle/tla/context.ts +65 -26
  149. package/src/prover/isabelle/tla/logic-data.ts +1 -1
  150. package/src/prover/isabelle/tla/logic.ts +53 -32
  151. package/src/prover/isabelle/tla/simpdata.ts +45 -44
  152. package/src/prover/isabelle/tools/intuitionistic.ts +28 -21
  153. package/src/prover/ocaml.ts +4 -7
  154. package/src/prover/prep/action.ts +33 -66
  155. package/src/prover/prep/enabled-axioms.ts +22 -20
  156. package/src/prover/prep/fingerprint.ts +2 -21
  157. package/src/prover/prep/level-comparison.ts +8 -12
  158. package/src/prover/prep/md5.ts +26 -31
  159. package/src/prover/prep/methods.ts +189 -86
  160. package/src/prover/prep/normalize.ts +42 -37
  161. package/src/prover/prove-worker.ts +0 -2
  162. package/src/prover/prove.ts +398 -133
  163. package/src/prover/ptl/decide.ts +96 -56
  164. package/src/prover/ptl/encode.ts +15 -38
  165. package/src/prover/ptl/sat.ts +24 -32
  166. package/src/prover/ptl/tableau.ts +40 -28
  167. package/src/prover/smt/arithmetic.ts +310 -0
  168. package/src/prover/smt/axioms.ts +12 -15
  169. package/src/prover/smt/context.ts +60 -32
  170. package/src/prover/smt/data.ts +517 -401
  171. package/src/prover/smt/encode.ts +155 -85
  172. package/src/prover/smt/extensionality.ts +5 -13
  173. package/src/prover/smt/flatten.ts +7 -28
  174. package/src/prover/smt/format.ts +33 -14
  175. package/src/prover/smt/instances.ts +7 -11
  176. package/src/prover/smt/layout.ts +91 -0
  177. package/src/prover/smt/rewrite.ts +1021 -658
  178. package/src/prover/smt/simplify.ts +441 -0
  179. package/src/prover/smt/solver/ackermannize-bv-tactic.ts +61 -0
  180. package/src/prover/smt/solver/ackr-helper.ts +179 -0
  181. package/src/prover/smt/solver/ackr-model-converter.ts +105 -0
  182. package/src/prover/smt/solver/act-cache.ts +0 -16
  183. package/src/prover/smt/solver/add-bounds-tactic.ts +59 -0
  184. package/src/prover/smt/solver/aig-tactic.ts +52 -0
  185. package/src/prover/smt/solver/aig.ts +889 -0
  186. package/src/prover/smt/solver/arith-rewriter.ts +626 -56
  187. package/src/prover/smt/solver/arith-terms.ts +121 -0
  188. package/src/prover/smt/solver/array-decl-plugin.ts +175 -0
  189. package/src/prover/smt/solver/array-rewriter.ts +319 -0
  190. package/src/prover/smt/solver/array.ts +1 -3
  191. package/src/prover/smt/solver/asserted-formulas.ts +241 -99
  192. package/src/prover/smt/solver/ast-lt.ts +165 -21
  193. package/src/prover/smt/solver/ast-util.ts +160 -7
  194. package/src/prover/smt/solver/ast.ts +1480 -184
  195. package/src/prover/smt/solver/auf-solver.ts +30 -56
  196. package/src/prover/smt/solver/bit-blast-tactic.ts +608 -0
  197. package/src/prover/smt/solver/bit-blaster.ts +871 -0
  198. package/src/prover/smt/solver/blast-term-ite.ts +47 -0
  199. package/src/prover/smt/solver/bound-manager.ts +196 -0
  200. package/src/prover/smt/solver/bound-simplifier.ts +598 -0
  201. package/src/prover/smt/solver/bv-bound-chk.ts +492 -0
  202. package/src/prover/smt/solver/bv-decl-plugin.ts +341 -0
  203. package/src/prover/smt/solver/bv-divrem-bounds.ts +95 -0
  204. package/src/prover/smt/solver/bv-rewriter.ts +1901 -0
  205. package/src/prover/smt/solver/bv1-blast.ts +214 -0
  206. package/src/prover/smt/solver/bv2fpa-converter.ts +174 -0
  207. package/src/prover/smt/solver/bv2int-rewriter.ts +544 -0
  208. package/src/prover/smt/solver/bv2real-rewriter.ts +533 -0
  209. package/src/prover/smt/solver/card2bv.ts +127 -0
  210. package/src/prover/smt/solver/case-split-queue.ts +0 -10
  211. package/src/prover/smt/solver/cg-table.ts +39 -42
  212. package/src/prover/smt/solver/check-logic.ts +330 -0
  213. package/src/prover/smt/solver/clause.ts +0 -27
  214. package/src/prover/smt/solver/cofactor-elim-term-ite.ts +293 -0
  215. package/src/prover/smt/solver/conflict-resolution.ts +78 -11
  216. package/src/prover/smt/solver/context.ts +600 -187
  217. package/src/prover/smt/solver/ctx-simplify.ts +34 -52
  218. package/src/prover/smt/solver/ctx-solver-simplify.ts +122 -0
  219. package/src/prover/smt/solver/datatype-decl-plugin.ts +580 -0
  220. package/src/prover/smt/solver/datatype-rewriter.ts +82 -0
  221. package/src/prover/smt/solver/demodulator.ts +786 -0
  222. package/src/prover/smt/solver/dependent-expr-state.ts +93 -0
  223. package/src/prover/smt/solver/der.ts +39 -30
  224. package/src/prover/smt/solver/diff-neq.ts +205 -0
  225. package/src/prover/smt/solver/distribute-forall.ts +57 -0
  226. package/src/prover/smt/solver/dom-simplify.ts +511 -0
  227. package/src/prover/smt/solver/dt2bv-tactic.ts +296 -0
  228. package/src/prover/smt/solver/dyn-ack.ts +0 -11
  229. package/src/prover/smt/solver/e-matching.ts +9 -41
  230. package/src/prover/smt/solver/elim-bounds.ts +89 -0
  231. package/src/prover/smt/solver/elim-small-bv-tactic.ts +129 -0
  232. package/src/prover/smt/solver/elim-term-ite-tactic.ts +48 -0
  233. package/src/prover/smt/solver/elim-uncnstr.ts +542 -0
  234. package/src/prover/smt/solver/enode.ts +100 -23
  235. package/src/prover/smt/solver/eq2bv-tactic.ts +218 -0
  236. package/src/prover/smt/solver/euf/arith-axioms.ts +403 -0
  237. package/src/prover/smt/solver/euf/arith-internalize.ts +653 -0
  238. package/src/prover/smt/solver/euf/arith-solver.ts +889 -0
  239. package/src/prover/smt/solver/euf/array-axioms.ts +527 -0
  240. package/src/prover/smt/solver/euf/array-internalize.ts +428 -0
  241. package/src/prover/smt/solver/euf/array-solver.ts +306 -0
  242. package/src/prover/smt/solver/euf/bv-ackerman.ts +162 -0
  243. package/src/prover/smt/solver/euf/bv-internalize.ts +748 -0
  244. package/src/prover/smt/solver/euf/bv-solver.ts +449 -0
  245. package/src/prover/smt/solver/euf/dt-solver.ts +618 -0
  246. package/src/prover/smt/solver/euf/egraph.ts +901 -0
  247. package/src/prover/smt/solver/euf/euf-solver.ts +1204 -0
  248. package/src/prover/smt/solver/euf/fpa-solver.ts +317 -0
  249. package/src/prover/smt/solver/euf/mam.ts +1046 -0
  250. package/src/prover/smt/solver/euf/q-ematch.ts +829 -0
  251. package/src/prover/smt/solver/euf/q-mbi.ts +587 -0
  252. package/src/prover/smt/solver/euf/q-model-fixer.ts +296 -0
  253. package/src/prover/smt/solver/euf/q-solver.ts +361 -0
  254. package/src/prover/smt/solver/euf/th-solver.ts +328 -0
  255. package/src/prover/smt/solver/euf/th-solvers.ts +30 -0
  256. package/src/prover/smt/solver/expr-ref.ts +0 -5
  257. package/src/prover/smt/solver/expr-safe-replace.ts +26 -7
  258. package/src/prover/smt/solver/expr2polynomial.ts +271 -0
  259. package/src/prover/smt/solver/factor.ts +163 -0
  260. package/src/prover/smt/solver/fd-solver.ts +734 -0
  261. package/src/prover/smt/solver/fingerprints.ts +15 -26
  262. package/src/prover/smt/solver/fix-dl-var.ts +147 -0
  263. package/src/prover/smt/solver/flat-literals.ts +0 -9
  264. package/src/prover/smt/solver/fm-tactic.ts +884 -0
  265. package/src/prover/smt/solver/fpa-decl-plugin.ts +618 -0
  266. package/src/prover/smt/solver/fpa-rewriter.ts +639 -0
  267. package/src/prover/smt/solver/fpa2bv-converter.ts +2251 -0
  268. package/src/prover/smt/solver/fpa2bv-rewriter.ts +349 -0
  269. package/src/prover/smt/solver/fpa2bv-tactic.ts +73 -0
  270. package/src/prover/smt/solver/goal.ts +179 -28
  271. package/src/prover/smt/solver/goal2nlsat.ts +216 -0
  272. package/src/prover/smt/solver/guard-set.ts +219 -0
  273. package/src/prover/smt/solver/hash.ts +0 -9
  274. package/src/prover/smt/solver/hashtable.ts +30 -23
  275. package/src/prover/smt/solver/inf-eps.ts +63 -0
  276. package/src/prover/smt/solver/inj-axiom.ts +101 -0
  277. package/src/prover/smt/solver/internalizer.ts +113 -133
  278. package/src/prover/smt/solver/lackr.ts +381 -0
  279. package/src/prover/smt/solver/lbool.ts +0 -2
  280. package/src/prover/smt/solver/lia2card.ts +268 -0
  281. package/src/prover/smt/solver/lia2pb.ts +154 -0
  282. package/src/prover/smt/solver/literal.ts +0 -4
  283. package/src/prover/smt/solver/logic-tactics.ts +355 -0
  284. package/src/prover/smt/solver/lp/bound-propagator.ts +7 -26
  285. package/src/prover/smt/solver/lp/constraints.ts +1 -8
  286. package/src/prover/smt/solver/lp/containers.ts +18 -31
  287. package/src/prover/smt/solver/lp/core-solver.ts +35 -37
  288. package/src/prover/smt/solver/lp/cross-nested.ts +4 -21
  289. package/src/prover/smt/solver/lp/dep-intervals.ts +6 -24
  290. package/src/prover/smt/solver/lp/dependency.ts +0 -5
  291. package/src/prover/smt/solver/lp/dioph-eq.ts +8 -103
  292. package/src/prover/smt/solver/lp/explanation.ts +0 -6
  293. package/src/prover/smt/solver/lp/gomory.ts +8 -22
  294. package/src/prover/smt/solver/lp/hnf-cutter.ts +16 -23
  295. package/src/prover/smt/solver/lp/hnf.ts +10 -28
  296. package/src/prover/smt/solver/lp/int-cube.ts +17 -39
  297. package/src/prover/smt/solver/lp/int-solver.ts +3 -35
  298. package/src/prover/smt/solver/lp/lar-solver.ts +70 -83
  299. package/src/prover/smt/solver/lp/lar-term.ts +0 -5
  300. package/src/prover/smt/solver/lp/lp-settings.ts +6 -16
  301. package/src/prover/smt/solver/lp/maximize-term.ts +76 -52
  302. package/src/prover/smt/solver/lp/nex-creator.ts +7 -30
  303. package/src/prover/smt/solver/lp/nex.ts +2 -7
  304. package/src/prover/smt/solver/lp/nla-backoff.ts +0 -5
  305. package/src/prover/smt/solver/lp/nla-basics.ts +48 -30
  306. package/src/prover/smt/solver/lp/nla-core.ts +92 -136
  307. package/src/prover/smt/solver/lp/nla-divisions.ts +31 -43
  308. package/src/prover/smt/solver/lp/nla-emonics.ts +3 -21
  309. package/src/prover/smt/solver/lp/nla-factorization.ts +0 -4
  310. package/src/prover/smt/solver/lp/nla-grobner.ts +177 -149
  311. package/src/prover/smt/solver/lp/nla-horner.ts +2 -12
  312. package/src/prover/smt/solver/lp/nla-intervals.ts +1 -12
  313. package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +15 -42
  314. package/src/prover/smt/solver/lp/nla-monotone.ts +1 -6
  315. package/src/prover/smt/solver/lp/nla-order.ts +0 -13
  316. package/src/prover/smt/solver/lp/nla-patcher.ts +3 -7
  317. package/src/prover/smt/solver/lp/nla-powers.ts +220 -0
  318. package/src/prover/smt/solver/lp/nla-tangents.ts +0 -10
  319. package/src/prover/smt/solver/lp/nla-throttle.ts +0 -6
  320. package/src/prover/smt/solver/lp/nla-transcendentals.ts +324 -0
  321. package/src/prover/smt/solver/lp/nla-types.ts +0 -12
  322. package/src/prover/smt/solver/lp/nla-var-eqs.ts +4 -26
  323. package/src/prover/smt/solver/lp/nra-solver.ts +164 -147
  324. package/src/prover/smt/solver/lp/numeric-pair.ts +0 -4
  325. package/src/prover/smt/solver/lp/pdd-interval.ts +6 -5
  326. package/src/prover/smt/solver/lp/pdd-simplifier.ts +61 -34
  327. package/src/prover/smt/solver/lp/pdd-solver.ts +74 -72
  328. package/src/prover/smt/solver/lp/pdd.ts +730 -358
  329. package/src/prover/smt/solver/lp/random-updater.ts +0 -9
  330. package/src/prover/smt/solver/lp/static-matrix.ts +8 -19
  331. package/src/prover/smt/solver/lp/union-find.ts +5 -5
  332. package/src/prover/smt/solver/macro-finder.ts +530 -0
  333. package/src/prover/smt/solver/mam-compiler.ts +129 -139
  334. package/src/prover/smt/solver/mam-interpreter.ts +0 -21
  335. package/src/prover/smt/solver/max-bv-sharing-tactic.ts +17 -0
  336. package/src/prover/smt/solver/max-cliques.ts +105 -0
  337. package/src/prover/smt/solver/maxcore.ts +310 -0
  338. package/src/prover/smt/solver/maximize-ac-sharing.ts +8 -21
  339. package/src/prover/smt/solver/maxlex.ts +115 -0
  340. package/src/prover/smt/solver/maxsmt-base.ts +106 -0
  341. package/src/prover/smt/solver/maxsmt.ts +92 -0
  342. package/src/prover/smt/solver/mbp/mbp-arith.ts +467 -0
  343. package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +101 -0
  344. package/src/prover/smt/solver/mbp/mbp-plugin.ts +287 -0
  345. package/src/prover/smt/solver/mbp/mbp-qel.ts +48 -0
  346. package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +271 -0
  347. package/src/prover/smt/solver/mbp/mbp-term-graph.ts +606 -0
  348. package/src/prover/smt/solver/model-based-opt.ts +844 -0
  349. package/src/prover/smt/solver/model-checker.ts +20 -63
  350. package/src/prover/smt/solver/model-evaluator.ts +192 -40
  351. package/src/prover/smt/solver/model-finder.ts +14 -32
  352. package/src/prover/smt/solver/model-generator.ts +104 -46
  353. package/src/prover/smt/solver/model-macro-solver.ts +60 -114
  354. package/src/prover/smt/solver/model-printer.ts +214 -0
  355. package/src/prover/smt/solver/mpf.ts +709 -0
  356. package/src/prover/smt/solver/mus.ts +50 -0
  357. package/src/prover/smt/solver/muz/dl-context.ts +382 -0
  358. package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +97 -0
  359. package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +167 -0
  360. package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +125 -0
  361. package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +299 -0
  362. package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +455 -0
  363. package/src/prover/smt/solver/muz/dl-mk-slice.ts +340 -0
  364. package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +163 -0
  365. package/src/prover/smt/solver/muz/dl-rule-set.ts +273 -0
  366. package/src/prover/smt/solver/muz/dl-rule-transformer.ts +123 -0
  367. package/src/prover/smt/solver/muz/dl-rule.ts +495 -0
  368. package/src/prover/smt/solver/muz/hnf.ts +201 -0
  369. package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +176 -0
  370. package/src/prover/smt/solver/muz/horn-tactic.ts +214 -0
  371. package/src/prover/smt/solver/muz/rule-properties.ts +359 -0
  372. package/src/prover/smt/solver/muz/spacer-context.ts +1404 -0
  373. package/src/prover/smt/solver/muz/spacer-dl-interface.ts +52 -0
  374. package/src/prover/smt/solver/muz/spacer-generalizers.ts +241 -0
  375. package/src/prover/smt/solver/muz/spacer-manager.ts +127 -0
  376. package/src/prover/smt/solver/muz/spacer-pdr.ts +219 -0
  377. package/src/prover/smt/solver/muz/spacer-prop-solver.ts +333 -0
  378. package/src/prover/smt/solver/muz/spacer-util.ts +282 -0
  379. package/src/prover/smt/solver/muz/substitution.ts +203 -0
  380. package/src/prover/smt/solver/nla2bv-tactic.ts +285 -0
  381. package/src/prover/smt/solver/nlqsat.ts +484 -0
  382. package/src/prover/smt/solver/nlsat/algebraic.ts +357 -236
  383. package/src/prover/smt/solver/nlsat/atoms.ts +73 -54
  384. package/src/prover/smt/solver/nlsat/evaluator.ts +16 -22
  385. package/src/prover/smt/solver/nlsat/explain.ts +429 -275
  386. package/src/prover/smt/solver/nlsat/interval-set.ts +9 -51
  387. package/src/prover/smt/solver/nlsat/levelwise.ts +477 -344
  388. package/src/prover/smt/solver/nlsat/mpbq.ts +47 -14
  389. package/src/prover/smt/solver/nlsat/polynomial.ts +2385 -832
  390. package/src/prover/smt/solver/nlsat/solver.ts +297 -156
  391. package/src/prover/smt/solver/nlsat/transcendental-eval.ts +310 -0
  392. package/src/prover/smt/solver/nlsat/transcendentals.ts +391 -0
  393. package/src/prover/smt/solver/nlsat/types.ts +0 -9
  394. package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +9 -51
  395. package/src/prover/smt/solver/nlsat/upolynomial.ts +49 -109
  396. package/src/prover/smt/solver/nlsat-tactic.ts +82 -0
  397. package/src/prover/smt/solver/nnf.ts +112 -61
  398. package/src/prover/smt/solver/normalize-bounds.ts +53 -0
  399. package/src/prover/smt/solver/occf.ts +97 -0
  400. package/src/prover/smt/solver/opt-context.ts +801 -0
  401. package/src/prover/smt/solver/opt-nlsat.ts +386 -0
  402. package/src/prover/smt/solver/opt-pareto.ts +301 -0
  403. package/src/prover/smt/solver/opt-preprocess.ts +101 -0
  404. package/src/prover/smt/solver/opt-solver.ts +312 -0
  405. package/src/prover/smt/solver/opt-value.ts +55 -0
  406. package/src/prover/smt/solver/optsmt.ts +692 -0
  407. package/src/prover/smt/solver/parallel-tactic.ts +299 -0
  408. package/src/prover/smt/solver/pattern-inference.ts +21 -26
  409. package/src/prover/smt/solver/pb-rewriter.ts +281 -0
  410. package/src/prover/smt/solver/pb2bv-tactic.ts +540 -0
  411. package/src/prover/smt/solver/poly-rewriter.ts +261 -79
  412. package/src/prover/smt/solver/probes.ts +577 -0
  413. package/src/prover/smt/solver/propagate-values.ts +37 -30
  414. package/src/prover/smt/solver/proto-model.ts +650 -66
  415. package/src/prover/smt/solver/pull-quant.ts +28 -23
  416. package/src/prover/smt/solver/purify-arith.ts +632 -0
  417. package/src/prover/smt/solver/push-app-ite.ts +37 -0
  418. package/src/prover/smt/solver/qe-arith-plugin.ts +1096 -0
  419. package/src/prover/smt/solver/qe-lite-der.ts +2 -31
  420. package/src/prover/smt/solver/qe-lite-fm.ts +4 -28
  421. package/src/prover/smt/solver/qe-lite.ts +41 -51
  422. package/src/prover/smt/solver/qe-mbp.ts +270 -0
  423. package/src/prover/smt/solver/qe.ts +1499 -0
  424. package/src/prover/smt/solver/qel.ts +25 -0
  425. package/src/prover/smt/solver/qi-queue.ts +0 -16
  426. package/src/prover/smt/solver/qsat.ts +829 -0
  427. package/src/prover/smt/solver/quant-hoist.ts +196 -0
  428. package/src/prover/smt/solver/quant-tactics.ts +17 -74
  429. package/src/prover/smt/solver/quantifier-analyzer.ts +26 -47
  430. package/src/prover/smt/solver/quantifier-manager.ts +22 -32
  431. package/src/prover/smt/solver/quasi-macros.ts +243 -0
  432. package/src/prover/smt/solver/random-gen.ts +0 -2
  433. package/src/prover/smt/solver/rational.ts +45 -8
  434. package/src/prover/smt/solver/recfun-decl-plugin.ts +262 -0
  435. package/src/prover/smt/solver/recfun-rewriter.ts +107 -0
  436. package/src/prover/smt/solver/reduce-args.ts +225 -0
  437. package/src/prover/smt/solver/reduce-bv-size.ts +119 -0
  438. package/src/prover/smt/solver/ref-vector.ts +0 -6
  439. package/src/prover/smt/solver/relevancy.ts +2 -16
  440. package/src/prover/smt/solver/rewriter-tpl.ts +59 -135
  441. package/src/prover/smt/solver/rewriter.ts +507 -144
  442. package/src/prover/smt/solver/rlimit.ts +46 -24
  443. package/src/prover/smt/solver/sat/asymm-branch.ts +325 -0
  444. package/src/prover/smt/solver/sat/big.ts +177 -0
  445. package/src/prover/smt/solver/sat/clause-use-list.ts +71 -0
  446. package/src/prover/smt/solver/sat/clause.ts +203 -0
  447. package/src/prover/smt/solver/sat/cleaner.ts +94 -0
  448. package/src/prover/smt/solver/sat/config.ts +122 -0
  449. package/src/prover/smt/solver/sat/consequences.ts +203 -0
  450. package/src/prover/smt/solver/sat/elim-eqs.ts +142 -0
  451. package/src/prover/smt/solver/sat/goal2sat.ts +579 -0
  452. package/src/prover/smt/solver/sat/inc-sat-solver.ts +464 -0
  453. package/src/prover/smt/solver/sat/model-converter.ts +136 -0
  454. package/src/prover/smt/solver/sat/pb-constraint.ts +268 -0
  455. package/src/prover/smt/solver/sat/pb-solver.ts +1596 -0
  456. package/src/prover/smt/solver/sat/probing.ts +170 -0
  457. package/src/prover/smt/solver/sat/sat-tactic.ts +53 -0
  458. package/src/prover/smt/solver/sat/sat2goal.ts +189 -0
  459. package/src/prover/smt/solver/sat/scc.ts +142 -0
  460. package/src/prover/smt/solver/sat/simplifier.ts +1618 -0
  461. package/src/prover/smt/solver/sat/solver.ts +2107 -0
  462. package/src/prover/smt/solver/sat/var-queue.ts +117 -0
  463. package/src/prover/smt/solver/sat/watch-list.ts +140 -0
  464. package/src/prover/smt/solver/search-tree.ts +284 -0
  465. package/src/prover/smt/solver/seq-axioms.ts +995 -0
  466. package/src/prover/smt/solver/seq-decl-plugin.ts +819 -0
  467. package/src/prover/smt/solver/seq-derive.ts +1298 -0
  468. package/src/prover/smt/solver/seq-eq-approx.ts +236 -0
  469. package/src/prover/smt/solver/seq-eq-solver.ts +439 -0
  470. package/src/prover/smt/solver/seq-factory.ts +89 -0
  471. package/src/prover/smt/solver/seq-monadic.ts +730 -0
  472. package/src/prover/smt/solver/seq-range-predicate.ts +235 -0
  473. package/src/prover/smt/solver/seq-re-rewriter.ts +1171 -0
  474. package/src/prover/smt/solver/seq-re-util.ts +758 -0
  475. package/src/prover/smt/solver/seq-regex-bisim.ts +144 -0
  476. package/src/prover/smt/solver/seq-regex-live.ts +200 -0
  477. package/src/prover/smt/solver/seq-rewriter.ts +2404 -0
  478. package/src/prover/smt/solver/seq-skolem.ts +294 -0
  479. package/src/prover/smt/solver/seq-subset.ts +165 -0
  480. package/src/prover/smt/solver/seq-view-witness.ts +353 -0
  481. package/src/prover/smt/solver/smt-consequences.ts +297 -0
  482. package/src/prover/smt/solver/smt-kernel.ts +124 -0
  483. package/src/prover/smt/solver/smt-logics.ts +66 -0
  484. package/src/prover/smt/solver/smt-setup.ts +589 -0
  485. package/src/prover/smt/solver/smt2-printer.ts +765 -0
  486. package/src/prover/smt/solver/smtlib-parser.ts +3546 -406
  487. package/src/prover/smt/solver/smtlib-script.ts +2134 -0
  488. package/src/prover/smt/solver/solve-eqs.ts +928 -0
  489. package/src/prover/smt/solver/solver.ts +129 -38
  490. package/src/prover/smt/solver/sort.ts +1 -5
  491. package/src/prover/smt/solver/static-features.ts +314 -0
  492. package/src/prover/smt/solver/sticky-generations.ts +0 -6
  493. package/src/prover/smt/solver/tactic.ts +2141 -0
  494. package/src/prover/smt/solver/term-enumeration.ts +205 -0
  495. package/src/prover/smt/solver/theory-array.ts +1240 -0
  496. package/src/prover/smt/solver/theory-bv.ts +1210 -0
  497. package/src/prover/smt/solver/theory-char.ts +355 -0
  498. package/src/prover/smt/solver/theory-datatype.ts +598 -0
  499. package/src/prover/smt/solver/theory-finite-set.ts +30 -0
  500. package/src/prover/smt/solver/theory-fpa.ts +389 -0
  501. package/src/prover/smt/solver/theory-lra-axioms.ts +55 -25
  502. package/src/prover/smt/solver/theory-lra-bounds.ts +31 -11
  503. package/src/prover/smt/solver/theory-lra-final-check.ts +60 -91
  504. package/src/prover/smt/solver/theory-lra-internalize.ts +96 -53
  505. package/src/prover/smt/solver/theory-lra-model.ts +23 -53
  506. package/src/prover/smt/solver/theory-lra-propagate.ts +34 -42
  507. package/src/prover/smt/solver/theory-lra-state.ts +7 -28
  508. package/src/prover/smt/solver/theory-lra.ts +189 -9
  509. package/src/prover/smt/solver/theory-pb.ts +951 -0
  510. package/src/prover/smt/solver/theory-polymorphism.ts +58 -0
  511. package/src/prover/smt/solver/theory-recfun.ts +307 -0
  512. package/src/prover/smt/solver/theory-seq-regex.ts +867 -0
  513. package/src/prover/smt/solver/theory-seq-solve.ts +1373 -0
  514. package/src/prover/smt/solver/theory-seq-state.ts +852 -0
  515. package/src/prover/smt/solver/theory-seq.ts +961 -0
  516. package/src/prover/smt/solver/theory-without-terms.ts +24 -0
  517. package/src/prover/smt/solver/theory.ts +189 -0
  518. package/src/prover/smt/solver/tseitin-cnf.ts +486 -0
  519. package/src/prover/smt/solver/var-subst.ts +37 -39
  520. package/src/prover/smt/table.ts +3 -10
  521. package/src/prover/smt/types.ts +146 -0
  522. package/src/prover/tlapm/cache.ts +74 -48
  523. package/src/prover/tlapm/ocaml-marshal.ts +19 -21
  524. package/src/prover/tlapm/tlapm.ts +21 -20
  525. package/src/prover/tlapm-library.ts +3208 -0
  526. package/src/prover/verdict.ts +9 -2
  527. package/src/prover/zenon/check/check.ts +1 -11
  528. package/src/prover/zenon/check/definitions.ts +5 -15
  529. package/src/prover/zenon/check/equality.ts +0 -8
  530. package/src/prover/zenon/check/functions.ts +0 -4
  531. package/src/prover/zenon/check/keys.ts +0 -7
  532. package/src/prover/zenon/check/propositional.ts +0 -3
  533. package/src/prover/zenon/check/records.ts +1 -6
  534. package/src/prover/zenon/check/relations.ts +2 -14
  535. package/src/prover/zenon/check/rewrites.ts +2 -21
  536. package/src/prover/zenon/check/sets.ts +40 -61
  537. package/src/prover/zenon/check/terms.ts +1 -19
  538. package/src/prover/zenon/check/tla.ts +0 -6
  539. package/src/prover/zenon/decide.ts +10 -19
  540. package/src/prover/zenon/encode.ts +0 -9
  541. package/src/prover/zenon/eqrel.ts +2 -15
  542. package/src/prover/zenon/equality-rules.ts +24 -6
  543. package/src/prover/zenon/expr.ts +29 -28
  544. package/src/prover/zenon/index-table.ts +33 -61
  545. package/src/prover/zenon/isar-case.ts +9 -21
  546. package/src/prover/zenon/isar.ts +37 -67
  547. package/src/prover/zenon/limits.ts +0 -4
  548. package/src/prover/zenon/llproof.ts +2 -22
  549. package/src/prover/zenon/mltoll.ts +66 -106
  550. package/src/prover/zenon/node.ts +20 -15
  551. package/src/prover/zenon/ocaml.ts +1 -17
  552. package/src/prover/zenon/parse.ts +9 -13
  553. package/src/prover/zenon/phrase.ts +2 -14
  554. package/src/prover/zenon/proof.ts +0 -11
  555. package/src/prover/zenon/propositional-rules.ts +0 -7
  556. package/src/prover/zenon/rules.ts +3 -8
  557. package/src/prover/zenon/search.ts +11 -35
  558. package/src/prover/zenon/tla/functions.ts +59 -33
  559. package/src/prover/zenon/tla/llproof.ts +67 -78
  560. package/src/prover/zenon/tla/records.ts +57 -35
  561. package/src/prover/zenon/tla/rewrites.ts +12 -21
  562. package/src/prover/zenon/tla/sets.ts +88 -59
  563. package/src/prover/zenon/tla/terms.ts +0 -8
  564. package/src/prover/zenon/tla/tla.ts +66 -66
  565. package/src/randomization.ts +81 -35
  566. package/src/resolve.ts +1132 -430
  567. package/src/runtime.ts +33 -23
  568. package/src/sany/builtins.ts +11 -14
  569. package/src/sany/generation.ts +383 -0
  570. package/src/sany/generator-def-entries.ts +210 -0
  571. package/src/sany/generator-definitions.ts +688 -0
  572. package/src/sany/generator-expressions.ts +1108 -0
  573. package/src/sany/generator-proofs.ts +665 -0
  574. package/src/sany/generator.ts +192 -2764
  575. package/src/sany/levels.ts +5 -35
  576. package/src/sany/lexer.ts +61 -80
  577. package/src/sany/linter.ts +0 -10
  578. package/src/sany/modules.ts +5 -7
  579. package/src/sany/nodes.ts +6 -44
  580. package/src/sany/parse-error.ts +39 -117
  581. package/src/sany/report.ts +32 -69
  582. package/src/sany/selectors.ts +60 -82
  583. package/src/sany/source.ts +1 -17
  584. package/src/sany/xml.ts +37 -120
  585. package/src/search.ts +913 -227
  586. package/src/simulate.ts +765 -0
  587. package/src/spec-description.ts +198 -104
  588. package/src/standard-definitions.ts +4 -4
  589. package/src/standard-modules.ts +302 -99
  590. package/src/state-graph.ts +52 -33
  591. package/src/subexpressions.ts +578 -166
  592. package/src/substitution-levels.ts +7 -7
  593. package/src/successors.ts +296 -105
  594. package/src/symmetry.ts +37 -28
  595. package/src/tableau.ts +29 -26
  596. package/src/tlc/fingerprint.ts +267 -79
  597. package/src/tlc/jar-data.ts +122 -6
  598. package/src/tlc/messages.ts +127 -56
  599. package/src/tlc/order.ts +53 -72
  600. package/src/tlc/random.ts +38 -49
  601. package/src/tlc/replay.ts +579 -230
  602. package/src/tlc/summary.ts +64 -60
  603. package/src/tlc/tlc-operators.ts +83 -47
  604. package/src/tlc/tlcext-operators.ts +205 -127
  605. package/src/tlc/trace-spec.ts +235 -0
  606. package/src/tlc/value-stream.ts +139 -0
  607. package/src/tlc/version.ts +1 -4
  608. package/src/trace-liveness.ts +529 -0
  609. package/src/transfer.ts +22 -25
  610. package/src/typed-tier.ts +6556 -0
  611. package/src/typescript/actions.ts +10 -25
  612. package/src/typescript/collections.ts +34 -35
  613. package/src/typescript/compile.ts +1 -8
  614. package/src/typescript/context.ts +0 -12
  615. package/src/typescript/emit.ts +0 -1
  616. package/src/typescript/expressions.ts +0 -12
  617. package/src/typescript/formula.ts +9 -15
  618. package/src/typescript/functions.ts +6 -17
  619. package/src/typescript/model.ts +14 -16
  620. package/src/typescript/names.ts +0 -2
  621. package/src/typescript/program.ts +0 -3
  622. package/src/typescript/properties.ts +6 -8
  623. package/src/typescript/scope.ts +0 -5
  624. package/src/typescript/steps.ts +20 -28
  625. package/src/typescript/types.ts +3 -10
  626. package/src/values.ts +917 -522
  627. package/src/worker.ts +7 -8
  628. package/src/prover/isabelle/isar/statement.ts +0 -57
  629. package/src/prover/smt/solver/z3-license.txt +0 -10
  630. package/src/prover/tlaps-module.ts +0 -510
  631. package/src/prover/zenon/LICENSE +0 -32
@@ -1,17 +1,9 @@
1
- // Ported from Isabelle2025's Provers/blast.ML. Copyright (c) 1986-2025 University of Cambridge,
2
- // Technische Universitaet Muenchen, and contributors, see LICENSE.
3
- //
4
- // Paulson's generic tableau prover with proof reconstruction. It converts subgoal 1 to
5
- // prototerms, Skolemizing its parameters, searches for a tableau proof with the claset's rules,
6
- // and replays the proof with Isabelle tactics, so the kernel checks every result. Blast ignores
7
- // the claset's wrappers and the elimination rules whose conclusion is not a formula variable.
8
-
9
- import { TlaIsabelleError } from "../../../../errors";
1
+ import { isIsabelleError, TlaIsabelleError } from "../../../../errors";
10
2
  import { selectGoal } from "../../pure/goal";
11
- import { destImplies, stripParams } from "../../pure/logic";
3
+ import { destImplies, isAllAbs, stripParams } from "../../pure/logic";
12
4
  import { makeNameContext } from "../../pure/name";
13
- import { emptySeq, makeSeq, ofCell, type Cell, type Seq } from "../../pure/seq";
14
- import { eqThm, orElse, thenTac, type GoalTactic, type Tactic } from "../../pure/tactical";
5
+ import { emptySeq, ofCell, type Seq } from "../../pure/seq";
6
+ import { every, orElse, thenTac, type GoalTactic, type Tactic } from "../../pure/tactical";
15
7
  import { addFreeNames, stripComb, type Term } from "../../pure/term";
16
8
  import { nprems, type Thm } from "../../pure/thm";
17
9
  import { atomizePremsTac } from "../../pure/object-logic";
@@ -36,25 +28,16 @@ import {
36
28
  mkBlastFree,
37
29
  mkBlastSkolem,
38
30
  mkBlastVar,
39
- mkGoal,
40
- stripBlastImpConcl,
41
- stripBlastImpPrems,
31
+ splitGoalPrems,
42
32
  type BlastTerm,
43
33
  type VarEntry,
44
34
  type VarRef,
45
35
  } from "./term";
46
36
 
47
- export type { BlastContext } from "./state";
48
-
49
- // Blast's depth_limit configuration option.
50
37
  const DEPTH_LIMIT = 20;
51
38
 
52
- // TRANS: the subgoal has no translation, such as one applying an unknown to a non-parameter.
53
39
  class Trans extends Error {}
54
40
 
55
- const isTermError = (error: unknown) =>
56
- error instanceof TlaIsabelleError && error.exception === "TERM";
57
-
58
41
  const initialize = (context: BlastContext, state: Thm): BlastState => {
59
42
  for (const name of [GOAL_NAME, FALSE_NAME])
60
43
  if (context.consts.has(name))
@@ -63,32 +46,25 @@ const initialize = (context: BlastContext, state: Thm): BlastState => {
63
46
  };
64
47
 
65
48
  const discardForalls = (term: Term): Term =>
66
- term.kind === "App" &&
67
- term.fun.kind === "Const" &&
68
- term.fun.name === "Pure.all" &&
69
- term.arg.kind === "Abs"
70
- ? discardForalls(term.arg.body)
71
- : term;
49
+ isAllAbs(term) ? discardForalls(term.arg.body) : term;
72
50
 
73
51
  interface SubgoalVar {
74
52
  readonly key: string;
75
53
  readonly ref: VarRef;
76
- // The parameters the variable is applied to.
77
54
  readonly bounds: readonly number[];
78
55
  }
79
56
 
80
- // Translates a subgoal, Skolemizing all its parameters.
81
57
  const fromSubgoal = (state: BlastState, term: Term): BlastTerm => {
82
58
  const vars: SubgoalVar[] = [];
83
59
  const tvars: VarEntry[] = [];
84
- const from = (level: number, current: Term): BlastTerm => {
60
+ const convert = (level: number, current: Term): BlastTerm => {
85
61
  const [head, args] = stripComb(current);
86
62
  const apply = (blastHead: BlastTerm) =>
87
63
  listBlastComb(
88
64
  blastHead,
89
- args.map((arg) => from(level, arg)),
65
+ args.map((arg) => convert(level, arg)),
90
66
  );
91
- const bounds = () =>
67
+ const getBounds = () =>
92
68
  args.map((arg) => {
93
69
  if (arg.kind !== "Bound")
94
70
  throw new Trans("Function unknown's argument not a bound variable");
@@ -106,11 +82,11 @@ const fromSubgoal = (state: BlastState, term: Term): BlastTerm => {
106
82
  const key = `${head.name}.${head.index}`;
107
83
  const known = vars.find((entry) => entry.key === key);
108
84
  if (known === undefined) {
109
- const entry = { key, ref: { value: undefined }, bounds: bounds() };
85
+ const entry = { key, ref: { value: undefined }, bounds: getBounds() };
110
86
  vars.unshift(entry);
111
87
  return mkBlastVar(entry.ref);
112
88
  }
113
- const argBounds = bounds();
89
+ const argBounds = getBounds();
114
90
  if (
115
91
  known.bounds.length === argBounds.length &&
116
92
  known.bounds.every((bound, index) => bound === argBounds[index])
@@ -120,13 +96,13 @@ const fromSubgoal = (state: BlastState, term: Term): BlastTerm => {
120
96
  }
121
97
  case "Abs":
122
98
  if (args.length > 0) throw new Trans("argument not in normal form");
123
- return mkBlastAbs(head.name, from(level + 1, head.body));
99
+ return mkBlastAbs(head.name, convert(level + 1, head.body));
124
100
  case "App":
125
101
  throw new Trans("strip_comb");
126
102
  }
127
103
  };
128
104
  const npars = stripParams(term).length;
129
- let result = from(0, discardForalls(term));
105
+ let result = convert(0, discardForalls(term));
130
106
  for (let index = 0; index < npars; index += 1) {
131
107
  const args = vars.filter((entry) => !entry.bounds.includes(index)).map((entry) => entry.ref);
132
108
  result = blastSubstBound(mkBlastSkolem(gensym(state, "T"), args), result);
@@ -134,54 +110,6 @@ const fromSubgoal = (state: BlastState, term: Term): BlastTerm => {
134
110
  return result;
135
111
  };
136
112
 
137
- interface EveryTrail {
138
- readonly state: Thm;
139
- readonly rest: Seq<Thm>;
140
- readonly position: number;
141
- readonly next: EveryTrail | undefined;
142
- }
143
-
144
- // EVERY, as a loop: Isabelle's EVY and evyBack call each other in tail position, so backtracking
145
- // over a long reconstruction must not grow the stack.
146
- const everyTac =
147
- (tactics: readonly Tactic[]): Tactic =>
148
- (start) => {
149
- const advance = (
150
- initialTrail: EveryTrail | undefined,
151
- initialPosition: number,
152
- initialState: Thm | undefined,
153
- ): Cell<Thm> => {
154
- let trail = initialTrail;
155
- let position = initialPosition;
156
- let state = initialState;
157
- for (;;) {
158
- if (state === undefined) {
159
- if (trail === undefined) return undefined;
160
- const cell = trail.rest.pull();
161
- if (cell === undefined) trail = trail.next;
162
- else if (eqThm(trail.state, cell[0])) trail = { ...trail, rest: cell[1] };
163
- else {
164
- trail = { state: cell[0], rest: cell[1], position: trail.position, next: trail.next };
165
- position = trail.position;
166
- state = cell[0];
167
- }
168
- } else if (position === tactics.length) {
169
- const saved = trail;
170
- return [state, makeSeq(() => advance(saved, 0, undefined))];
171
- } else {
172
- const cell = tactics[position](state).pull();
173
- if (cell === undefined) state = undefined;
174
- else {
175
- trail = { state: cell[0], rest: cell[1], position: position + 1, next: trail };
176
- position += 1;
177
- state = cell[0];
178
- }
179
- }
180
- }
181
- };
182
- return makeSeq(() => advance(undefined, 0, start));
183
- };
184
-
185
113
  const initBranch = (terms: readonly BlastTerm[], lim: number): Branch => ({
186
114
  pairs: [{ safe: terms.map((term) => ({ term, md: true })), unsafe: [] }],
187
115
  lits: [],
@@ -189,7 +117,6 @@ const initBranch = (terms: readonly BlastTerm[], lim: number): Branch => ({
189
117
  lim,
190
118
  });
191
119
 
192
- // The tableau engine and proof reconstruction on subgoal 1, with depth limit lim.
193
120
  const rawBlast =
194
121
  (context: BlastContext, lim: number): Tactic =>
195
122
  (goalState) => {
@@ -200,9 +127,9 @@ const rawBlast =
200
127
  const replay: Tactic[] = [];
201
128
  for (let current = tactics; current !== undefined; current = current.tail)
202
129
  replay.push(current.head(1));
203
- return everyTac(replay.reverse())(goalState).pull();
130
+ return every(replay.reverse())(goalState).pull();
204
131
  } catch (error) {
205
- if (isTermError(error)) return backtrack(choices);
132
+ if (isIsabelleError(error, "TERM")) return backtrack(choices);
206
133
  throw error;
207
134
  }
208
135
  })();
@@ -210,27 +137,13 @@ const rawBlast =
210
137
  };
211
138
  try {
212
139
  const skoprem = fromSubgoal(state, destImplies(goalState.prop)[0]);
213
- const trueprop = context.data.trueprop;
214
- return prove(
215
- state,
216
- [
217
- initBranch(
218
- [
219
- mkGoal(stripBlastImpConcl(trueprop, skoprem)),
220
- ...stripBlastImpPrems(trueprop, skoprem),
221
- ],
222
- lim,
223
- ),
224
- ],
225
- cont,
226
- );
140
+ return prove(state, [initBranch(splitGoalPrems(context.data.trueprop, skoprem), lim)], cont);
227
141
  } catch (error) {
228
142
  if (isBacktrackTo(error, undefined) || error instanceof Trans) return emptySeq;
229
143
  throw error;
230
144
  }
231
145
  };
232
146
 
233
- // Blast.depth_tac: blast with a fixed depth limit.
234
147
  export const blastDepthTac =
235
148
  (context: BlastContext, limit: number): GoalTactic =>
236
149
  (index) =>
@@ -238,7 +151,6 @@ export const blastDepthTac =
238
151
  thenTac(atomizePremsTac(context.limits, context.data.atomize)(1), rawBlast(context, limit)),
239
152
  )(index);
240
153
 
241
- // Search.DEEPEN (1, lim) from depth m on goal 1.
242
154
  const deepen =
243
155
  (context: BlastContext, limit: number, depth: number): Tactic =>
244
156
  (state): Seq<Thm> =>
@@ -246,7 +158,6 @@ const deepen =
246
158
  ? emptySeq
247
159
  : orElse(rawBlast(context, depth), deepen(context, limit, depth + 1))(state);
248
160
 
249
- // Blast.blast_tac: iterative deepening up to the depth limit.
250
161
  export const blastTac =
251
162
  (context: BlastContext): GoalTactic =>
252
163
  (index) =>
@@ -1,9 +1,3 @@
1
- // Ported from Isabelle2025's Provers/blast.ML. Copyright (c) 1986-2025 University of Cambridge,
2
- // Technische Universitaet Muenchen, and contributors, see LICENSE.
3
- //
4
- // Operations on branches: naive substitution for equalities, closing a branch by complementary
5
- // literals, and the pruning of choice points.
6
-
7
1
  import { orElseGoal, thenGoal, type GoalTactic } from "../../pure/tactical";
8
2
  import { assumeTac, eqAssumeTac, ematchTac } from "../../pure/tactic";
9
3
  import {
@@ -33,7 +27,6 @@ import {
33
27
  const negate = (state: BlastState, term: BlastTerm) =>
34
28
  mkBlastApp(mkBlastConst(state.context.data.notName), term);
35
29
 
36
- // Converts a *Goal* to an ordinary negation.
37
30
  export const negOfGoal = (state: BlastState, term: BlastTerm) => {
38
31
  const goal = destConstApp(term, GOAL_NAME);
39
32
  return goal === undefined ? term : negate(state, goal);
@@ -44,15 +37,12 @@ const negOfGoal2 = (state: BlastState, formula: Formula): Formula => ({
44
37
  md: formula.md,
45
38
  });
46
39
 
47
- // Converts the goals to negations in the safe parts of a branch. They could have been moved there
48
- // from the literals by an equality substitution.
49
40
  export const negOfGoals = (state: BlastState, pairs: readonly Level[]): Level[] =>
50
41
  pairs.map((level) => ({
51
42
  safe: level.safe.map((formula) => negOfGoal2(state, formula)),
52
43
  unsafe: level.unsafe,
53
44
  }));
54
45
 
55
- // Replaces the atomic term old by new, returning the very same term where nothing changes.
56
46
  const substAtomic = (old: BlastTerm, replacement: BlastTerm, term: BlastTerm): BlastTerm => {
57
47
  if (term.kind === "Var" && term.ref.value !== undefined)
58
48
  return substAtomic(old, replacement, term.ref.value);
@@ -68,7 +58,6 @@ const substAtomic = (old: BlastTerm, replacement: BlastTerm, term: BlastTerm): B
68
58
  return blastAconv(term, old) ? replacement : term;
69
59
  };
70
60
 
71
- // Eta-contracts a term from outside, just enough to reduce it to an atom.
72
61
  const etaContractAtom = (term: BlastTerm): BlastTerm => {
73
62
  if (term.kind !== "Abs") return term;
74
63
  const body = etaContract2(term.body);
@@ -82,10 +71,6 @@ const etaContractAtom = (term: BlastTerm): BlastTerm => {
82
71
  const etaContract2 = (term: BlastTerm): BlastTerm =>
83
72
  term.kind === "App" ? mkBlastApp(term.fun, etaContractAtom(term.arg)) : etaContractAtom(term);
84
73
 
85
- // Can term occur in other? Does not examine the arguments of Skolem terms, which substitution does
86
- // not affect, and is reflexive because hyp_subst_tac fails on x = x. No variables may occur in
87
- // other except the arguments of a Skolem term, so that no equation that could be instantiated to
88
- // a cycle is deleted.
89
74
  const substOccur = (term: BlastTerm, other: BlastTerm) => {
90
75
  const vars = term.kind === "Skolem" ? term.args : [];
91
76
  const occEq = (current: BlastTerm): boolean => blastAconv(term, current) || occ(current);
@@ -106,8 +91,6 @@ const substOccur = (term: BlastTerm, other: BlastTerm) => {
106
91
  return occEq(other);
107
92
  };
108
93
 
109
- // Takes apart an equality and orients it to eliminate a Skolem term or a free variable, or gives
110
- // undefined (DEST_EQ) if it has no substitutable side.
111
94
  const orientEquality = (state: BlastState, term: BlastTerm): [BlastTerm, BlastTerm] | undefined => {
112
95
  if (
113
96
  term.kind !== "App" ||
@@ -132,9 +115,6 @@ interface Substituted {
132
115
  readonly kept: readonly Formula[];
133
116
  }
134
117
 
135
- // Substitutes through the branch if the formula is an equality with a substitutable variable.
136
- // Moves the affected formulae and literals back to the safe formulae, but it is not clear where
137
- // they should go: this could make proofs fail.
138
118
  export const equalSubst = (
139
119
  state: BlastState,
140
120
  formula: BlastTerm,
@@ -184,10 +164,8 @@ export const equalSubst = (
184
164
  };
185
165
  };
186
166
 
187
- // Tries to unify complementary literals, giving the tactic that closes the branch.
188
167
  const eAssumeTac = (state: BlastState) => orElseGoal(eqAssumeTac, assumeTac(state.context.limits));
189
168
 
190
- // contr_tac: trying eq_contr_tac first increases the effort, slowing reconstruction.
191
169
  const eContrTac = (state: BlastState) =>
192
170
  thenGoal(ematchTac(state.context.limits, [state.context.data.notE]), eAssumeTac(state));
193
171
 
@@ -215,7 +193,6 @@ export const tryClose = (
215
193
  return undefined;
216
194
  };
217
195
 
218
- // Were there Skolem terms in the premise? Must not chase variables.
219
196
  const hasSkolem = (term: BlastTerm): boolean => {
220
197
  switch (term.kind) {
221
198
  case "Skolem":
@@ -229,12 +206,9 @@ const hasSkolem = (term: BlastTerm): boolean => {
229
206
  }
230
207
  };
231
208
 
232
- // Attaches the may-duplicate flag to new formulae: those with Skolem terms may be duplicated.
233
209
  export const joinMd = (md: boolean, terms: readonly BlastTerm[]): Formula[] =>
234
210
  terms.map((term) => ({ term, md: hasSkolem(term) || md }));
235
211
 
236
- // Whether any of the last count assignments of the trail below top occurs in vars or their
237
- // instantiations.
238
212
  const clashVar = (state: BlastState, vars: readonly BlastTerm[], count: number, top: number) => {
239
213
  if (vars.length === 0) return false;
240
214
  for (
@@ -249,9 +223,6 @@ const clashVar = (state: BlastState, vars: readonly BlastTerm[], count: number,
249
223
  return false;
250
224
  };
251
225
 
252
- // Deletes the choice points for goals the latest inference proved, provided no variable of the
253
- // next branch was updated. nbrs is the number of branches just before closing this one. Does not
254
- // prune at the very end, to allow backtracking over bad proofs.
255
226
  export const prune = (
256
227
  state: BlastState,
257
228
  nbrs: number,
@@ -275,8 +246,6 @@ export const prune = (
275
246
  export const nextVars = (brs: readonly Branch[]) =>
276
247
  brs.length === 0 ? [] : brs[0].vars.map((ref) => mkBlastVar(ref));
277
248
 
278
- // Adds the literal, handling *Goal* and detecting duplicates. A new *Goal* turns the other goals
279
- // into negations.
280
249
  export const addLit = (state: BlastState, term: BlastTerm, lits: readonly BlastTerm[]) => {
281
250
  const goal = destConstApp(term, GOAL_NAME);
282
251
  if (goal === undefined) return insTerm(term, lits);
@@ -297,10 +266,8 @@ export const addLit = (state: BlastState, term: BlastTerm, lits: readonly BlastT
297
266
  ];
298
267
  };
299
268
 
300
- // The penalty for a branching factor: log2 seems a little too severe.
301
269
  export const log4 = (count: number): number => (count < 4 ? 0 : 1 + log4(Math.floor(count / 4)));
302
270
 
303
- // Whether term might be an instance of pattern, to detect recursive rules such as transitivity.
304
271
  export const match = (state: BlastState, pattern: BlastTerm, term: BlastTerm): boolean => {
305
272
  if (pattern.kind === "Var") return true;
306
273
  if (pattern.kind === "Const" && term.kind === "Const") {
@@ -1,11 +1,3 @@
1
- // Ported from Isabelle2025's Provers/blast.ML. Copyright (c) 1986-2025 University of Cambridge,
2
- // Technische Universitaet Muenchen, and contributors, see LICENSE.
3
- //
4
- // The tableau prover, based on leanTaP. It works on a list of branches, each with its unexpanded
5
- // formulae, its literals and a bound on unsafe expansions. Every inference records the tactic
6
- // that replays it; once all branches close, the continuation reconstructs the proof. Each
7
- // recursion level that can be backtracked to owns a token, and a choice point raises it.
8
-
9
1
  import type { Seq } from "../../pure/seq";
10
2
  import type { GoalTactic } from "../../pure/tactical";
11
3
  import { checkInterrupt } from "../../pure/interrupt";
@@ -46,13 +38,10 @@ import {
46
38
  type VarRef,
47
39
  } from "./term";
48
40
 
49
- // The tactics that replay the inferences so far, latest first.
50
41
  type Tactics = List<GoalTactic> | undefined;
51
42
 
52
43
  export type Continuation = (tactics: Tactics, choices: Choices) => Seq<Thm>;
53
44
 
54
- // A step either finishes the search or continues the same branches without a choice point, which
55
- // blast.ML does by a tail call. prv loops on the latter, so a long search can't exhaust the stack.
56
45
  type Step =
57
46
  | { readonly kind: "done"; readonly result: Seq<Thm> }
58
47
  | {
@@ -76,7 +65,6 @@ export const prove = (
76
65
  const safeList = [context.claset.safe0, context.claset.safep];
77
66
  const unsafeList = [context.claset.unsafe];
78
67
 
79
- // Applies a safe rule only, possibly allowing instantiation; defers any unsafe formulae.
80
68
  const safeStep = (tactics: Tactics, choices: Choices, brs: readonly Branch[]): Step => {
81
69
  const token = {};
82
70
  const branch = brs[0];
@@ -90,7 +78,6 @@ export const prove = (
90
78
  const nxtVars = nextVars(rest);
91
79
  const formula = norm(head.safe[0].term);
92
80
  const rules = netMkRules(state, formula, branch.vars, safeList);
93
- // Makes the new branches, decrementing lim if instantiations occur.
94
81
  const newBr = (vars: readonly VarRef[], lim: number, prems: TableauRule["prems"]): Branch[] => [
95
82
  ...prems.map((prem): Branch => {
96
83
  const level = { safe: joinMd(md, prem), unsafe: [] };
@@ -105,14 +92,11 @@ export const prove = (
105
92
  }),
106
93
  ...rest,
107
94
  ];
108
- // Seeks a matching rule; if unifiable, adds its premises to the branch. Undefined is
109
- // NEWBRANCHES.
110
95
  const deeper = (): Seq<Thm> | undefined => {
111
96
  for (let position = 0; position < rules.length; position += 1) {
112
97
  const rule = rules[position];
113
98
  if (!unify(state, addTermVars(rule.major, []), rule.major, formula)) continue;
114
99
  const isUpdated = ntrl < state.trail.length;
115
- // Discourages branching updates.
116
100
  const lim = isUpdated ? branch.lim - (1 + log4(rules.length)) : branch.lim;
117
101
  const vars = addPremsVars(rule.prems, varsInVars(branch.vars));
118
102
  const nextChoices = cons({ ntrl, nbrs, token }, choices);
@@ -120,7 +104,6 @@ export const prove = (
120
104
  try {
121
105
  if (rule.prems.length === 0)
122
106
  return prv(nextTactics, prune(state, nbrs, nxtVars, nextChoices), rest);
123
- // Faster to kill all the alternatives.
124
107
  if (lim < 0) {
125
108
  clearTo(state, ntrl);
126
109
  return undefined;
@@ -128,15 +111,12 @@ export const prove = (
128
111
  return prv(nextTactics, nextChoices, newBr(vars, lim, rule.prems));
129
112
  } catch (error) {
130
113
  if (!isBacktrackTo(error, token)) throw error;
131
- // Backtracks at this level, resetting variables and trying another rule, or to the
132
- // previous level.
133
114
  if (!isUpdated) return backtrack(choices);
134
115
  clearTo(state, ntrl);
135
116
  }
136
117
  }
137
118
  return undefined;
138
119
  };
139
- // Tries to close the branch by unifying the formula with a literal. Undefined is CLOSEF.
140
120
  const closeF = (literals: readonly BlastTerm[]): Seq<Thm> | undefined => {
141
121
  for (const literal of literals) {
142
122
  const tactic = tryClose(state, formula, literal);
@@ -151,7 +131,6 @@ export const prove = (
151
131
  }
152
132
  return undefined;
153
133
  };
154
- // Tries to unify a queued formula, safe or unsafe, with the formula.
155
134
  const closeFl = (levels: readonly Level[]): Seq<Thm> | undefined => {
156
135
  for (const level of levels) {
157
136
  const closed =
@@ -173,7 +152,6 @@ export const prove = (
173
152
  const closed = closeF(branch.lits) ?? closeFl(pairs) ?? deeper();
174
153
  if (closed !== undefined) return done(closed);
175
154
  if (netMkRules(state, formula, branch.vars, unsafeList).length === 0)
176
- // There are no plausible unsafe rules: the formula becomes a literal.
177
155
  return {
178
156
  kind: "next",
179
157
  tactics,
@@ -183,7 +161,6 @@ export const prove = (
183
161
  ...rest,
184
162
  ],
185
163
  };
186
- // The formula admits some unsafe rules: try them later.
187
164
  const deferred: Formula = { term: negOfGoal(state, formula), md };
188
165
  return {
189
166
  kind: "next",
@@ -201,7 +178,6 @@ export const prove = (
201
178
  };
202
179
  };
203
180
 
204
- // No safe steps are possible at any level: applies an unsafe rule.
205
181
  const unsafeStep = (tactics: Tactics, choices: Choices, brs: readonly Branch[]): Step => {
206
182
  const token = {};
207
183
  const branch = brs[0];
@@ -212,7 +188,6 @@ export const prove = (
212
188
  const formula = norm(queued[0].term);
213
189
  const ntrl = state.trail.length;
214
190
  const rules = netMkRules(state, formula, branch.vars, unsafeList);
215
- // The new premises of unsafe rules may not be duplicated.
216
191
  const newPrem = (
217
192
  vars: readonly VarRef[],
218
193
  pattern: BlastTerm,
@@ -223,8 +198,6 @@ export const prove = (
223
198
  const safe = prem.map((term) => ({ term, md: false }));
224
199
  const unsafe = isDup ? [...others, { term: negOfGoal(state, formula), md }] : others;
225
200
  return {
226
- // A premise recursive in the rule makes no new stack frame: its unsafe premises end up at
227
- // the back of the queue, preventing the exclusion of others.
228
201
  pairs: prem.some((term) => match(state, pattern, term))
229
202
  ? [{ safe, unsafe }]
230
203
  : [
@@ -243,16 +216,10 @@ export const prove = (
243
216
  const isUpdated = ntrl < state.trail.length;
244
217
  const vars = varsInVars(branch.vars);
245
218
  const newVars = addPremsVars(rule.prems, vars);
246
- // Duplicates the formula if md permits.
247
219
  const isDup = md;
248
- // Decrements lim extra if updates occur.
249
220
  const lim = isUpdated ? branch.lim - (1 + log4(rules.length)) : branch.lim - 1;
250
- // Allows backtracking from a rule application if other matching rules exist, if the rule
251
- // updated variables, or if it introduced no new variables, so that it is not a standard
252
- // gamma-rule. This emulates fast_tac, which allows all unsafe steps to be undone.
253
221
  const mayUndo = position + 1 < rules.length || isUpdated || sameVars(vars, newVars);
254
222
  const tactic = rule.tactic(isUpdated, isDup, true);
255
- // Faster to kill all the alternatives.
256
223
  if (lim < 0 && rule.prems.length > 0) {
257
224
  clearTo(state, ntrl);
258
225
  return undefined;
@@ -273,7 +240,6 @@ export const prove = (
273
240
  if (branch.lim < 1) return backtrack(choices);
274
241
  const closed = deeper();
275
242
  if (closed !== undefined) return done(closed);
276
- // If no rule closes the branch, the formula becomes a literal.
277
243
  return {
278
244
  kind: "next",
279
245
  tactics,
@@ -300,7 +266,6 @@ export const prove = (
300
266
  let brs = branches;
301
267
  for (;;) {
302
268
  checkInterrupt(context.limits);
303
- // All branches closed.
304
269
  if (brs.length === 0) return cont(tactics, choices);
305
270
  const branch = brs[0];
306
271
  const head = branch.pairs[0];
@@ -319,7 +284,6 @@ export const prove = (
319
284
  continue;
320
285
  }
321
286
  if (branch.pairs.length > 1) {
322
- // No more safe formulae: transfers the unsafe ones down a level.
323
287
  const below = branch.pairs[1];
324
288
  brs = [
325
289
  {