tla-ts 0.0.10-dev.28c823e4b → 0.0.10-dev.3a85c3a9e

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 (567) hide show
  1. package/README.md +2 -1
  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 +3 -0
  8. package/dist/index.d.ts +3 -0
  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.cjs +2683 -427
  13. package/dist/prove.js +2681 -425
  14. package/dist/run.cjs +45 -42
  15. package/dist/run.js +47 -44
  16. package/dist/tlapm.cjs +2 -2
  17. package/dist/tlapm.js +2 -2
  18. package/dist/transfer.cjs +42 -39
  19. package/dist/transfer.js +44 -41
  20. package/dist/worker.cjs +7 -7
  21. package/dist/worker.js +7 -7
  22. package/package.json +1 -1
  23. package/src/ast.ts +41 -36
  24. package/src/builtins.ts +4 -13
  25. package/src/check-failure.ts +116 -0
  26. package/src/check-trace.ts +282 -0
  27. package/src/check.ts +353 -549
  28. package/src/cli/options.ts +6 -31
  29. package/src/cli/shared.ts +1 -1
  30. package/src/cli/tlapm.ts +433 -70
  31. package/src/cli/tlc-arguments.ts +222 -210
  32. package/src/cli/tlc-output.ts +687 -0
  33. package/src/cli/tlc-usage.ts +1 -2
  34. package/src/cli/tlc.ts +34 -701
  35. package/src/cli/xml-exporter.ts +23 -33
  36. package/src/codegen.ts +5 -10
  37. package/src/coverage.ts +3 -10
  38. package/src/dependencies.ts +30 -14
  39. package/src/dfid.ts +16 -16
  40. package/src/environment-config.ts +315 -0
  41. package/src/environment.ts +45 -333
  42. package/src/errors.ts +33 -5
  43. package/src/evaluate.ts +5 -4
  44. package/src/exit-codes.ts +1 -0
  45. package/src/fingerprints.ts +65 -1
  46. package/src/instances.ts +47 -10
  47. package/src/java-hash.ts +7 -0
  48. package/src/json.ts +4 -7
  49. package/src/levels.ts +39 -42
  50. package/src/lexer.ts +5 -3
  51. package/src/liveness-checker.ts +553 -237
  52. package/src/liveness.ts +94 -86
  53. package/src/obligations/action.ts +14 -17
  54. package/src/obligations/anonymize.ts +37 -16
  55. package/src/obligations/enabled-axioms.ts +218 -0
  56. package/src/obligations/equality.ts +1 -3
  57. package/src/obligations/expression.ts +36 -8
  58. package/src/obligations/format.ts +0 -2
  59. package/src/obligations/generate.ts +66 -54
  60. package/src/obligations/index.ts +38 -8
  61. package/src/obligations/levels.ts +24 -11
  62. package/src/obligations/module.ts +28 -41
  63. package/src/obligations/normalize.ts +26 -14
  64. package/src/obligations/operators.ts +0 -2
  65. package/src/obligations/pragma.ts +53 -16
  66. package/src/obligations/printer.ts +43 -13
  67. package/src/obligations/proof.ts +3 -2
  68. package/src/obligations/regroup.ts +0 -2
  69. package/src/obligations/simplify.ts +55 -50
  70. package/src/obligations/source.ts +118 -74
  71. package/src/obligations/subexpression.ts +45 -18
  72. package/src/obligations/substitution.ts +1 -3
  73. package/src/obligations/temporal.ts +5 -7
  74. package/src/obligations/tuples.ts +0 -2
  75. package/src/parallel-worker.ts +10 -30
  76. package/src/parallel.ts +24 -47
  77. package/src/parser.ts +580 -180
  78. package/src/pretty-print.ts +1 -1
  79. package/src/prover/decide-pool.ts +3 -3
  80. package/src/prover/deciders.ts +12 -9
  81. package/src/prover/isabelle/decide.ts +3 -25
  82. package/src/prover/isabelle/encode.ts +72 -42
  83. package/src/prover/isabelle/isar/attrib.ts +250 -0
  84. package/src/prover/isabelle/isar/context.ts +335 -0
  85. package/src/prover/isabelle/isar/induct.ts +382 -0
  86. package/src/prover/isabelle/isar/inner-syntax.ts +158 -7
  87. package/src/prover/isabelle/isar/method.ts +509 -212
  88. package/src/prover/isabelle/isar/proof.ts +570 -14
  89. package/src/prover/isabelle/isar/rule-cases.ts +224 -0
  90. package/src/prover/isabelle/isar/theory.ts +487 -76
  91. package/src/prover/isabelle/isar/toplevel.ts +331 -0
  92. package/src/prover/isabelle/isar/type-check.ts +89 -14
  93. package/src/prover/isabelle/provers/blast/blast.ts +7 -65
  94. package/src/prover/isabelle/provers/blast/branch.ts +0 -2
  95. package/src/prover/isabelle/provers/blast/prove.ts +0 -2
  96. package/src/prover/isabelle/provers/blast/rules.ts +0 -2
  97. package/src/prover/isabelle/provers/blast/state.ts +0 -2
  98. package/src/prover/isabelle/provers/blast/term.ts +0 -2
  99. package/src/prover/isabelle/provers/clasimp.ts +0 -2
  100. package/src/prover/isabelle/provers/classical.ts +45 -20
  101. package/src/prover/isabelle/provers/hypsubst.ts +17 -28
  102. package/src/prover/isabelle/pure/bicompose.ts +9 -27
  103. package/src/prover/isabelle/pure/consts.ts +0 -2
  104. package/src/prover/isabelle/pure/conv.ts +2 -10
  105. package/src/prover/isabelle/pure/drule.ts +72 -6
  106. package/src/prover/isabelle/pure/envir.ts +0 -2
  107. package/src/prover/isabelle/pure/goal.ts +1 -3
  108. package/src/prover/isabelle/pure/logic.ts +1 -3
  109. package/src/prover/isabelle/pure/name.ts +0 -2
  110. package/src/prover/isabelle/pure/net.ts +0 -2
  111. package/src/prover/isabelle/pure/object-logic.ts +13 -7
  112. package/src/prover/isabelle/pure/pattern.ts +0 -2
  113. package/src/prover/isabelle/pure/raw-simplifier.ts +4 -15
  114. package/src/prover/isabelle/pure/rewriter.ts +6 -17
  115. package/src/prover/isabelle/pure/search.ts +0 -2
  116. package/src/prover/isabelle/pure/seq.ts +0 -2
  117. package/src/prover/isabelle/pure/simplifier.ts +26 -7
  118. package/src/prover/isabelle/pure/table.ts +2 -3
  119. package/src/prover/isabelle/pure/tactic.ts +0 -2
  120. package/src/prover/isabelle/pure/tactical.ts +42 -37
  121. package/src/prover/isabelle/pure/term-ord.ts +0 -2
  122. package/src/prover/isabelle/pure/term.ts +0 -2
  123. package/src/prover/isabelle/pure/thm.ts +14 -13
  124. package/src/prover/isabelle/pure/type.ts +0 -2
  125. package/src/prover/isabelle/pure/unify.ts +0 -2
  126. package/src/prover/isabelle/pure/variable.ts +0 -2
  127. package/src/prover/isabelle/tla/classical-setup.ts +18 -16
  128. package/src/prover/isabelle/tla/context.ts +58 -11
  129. package/src/prover/isabelle/tla/logic-data.ts +1 -1
  130. package/src/prover/isabelle/tla/logic.ts +49 -21
  131. package/src/prover/isabelle/tla/simpdata.ts +1 -12
  132. package/src/prover/isabelle/tools/intuitionistic.ts +28 -12
  133. package/src/prover/ocaml.ts +4 -1
  134. package/src/prover/prep/action.ts +30 -31
  135. package/src/prover/prep/enabled-axioms.ts +11 -2
  136. package/src/prover/prep/fingerprint.ts +2 -5
  137. package/src/prover/prep/methods.ts +181 -51
  138. package/src/prover/prep/normalize.ts +38 -9
  139. package/src/prover/prove.ts +395 -94
  140. package/src/prover/ptl/decide.ts +95 -50
  141. package/src/prover/ptl/encode.ts +2 -3
  142. package/src/prover/ptl/tableau.ts +28 -2
  143. package/src/prover/smt/arithmetic.ts +310 -0
  144. package/src/prover/smt/axioms.ts +12 -8
  145. package/src/prover/smt/context.ts +43 -8
  146. package/src/prover/smt/data.ts +498 -379
  147. package/src/prover/smt/encode.ts +148 -57
  148. package/src/prover/smt/extensionality.ts +5 -3
  149. package/src/prover/smt/flatten.ts +4 -6
  150. package/src/prover/smt/format.ts +28 -4
  151. package/src/prover/smt/instances.ts +7 -1
  152. package/src/prover/smt/layout.ts +91 -0
  153. package/src/prover/smt/rewrite.ts +1021 -618
  154. package/src/prover/smt/simplify.ts +441 -0
  155. package/src/prover/smt/solver/ackermannize-bv-tactic.ts +61 -0
  156. package/src/prover/smt/solver/ackr-helper.ts +179 -0
  157. package/src/prover/smt/solver/ackr-model-converter.ts +105 -0
  158. package/src/prover/smt/solver/act-cache.ts +0 -1
  159. package/src/prover/smt/solver/add-bounds-tactic.ts +59 -0
  160. package/src/prover/smt/solver/aig-tactic.ts +52 -0
  161. package/src/prover/smt/solver/aig.ts +889 -0
  162. package/src/prover/smt/solver/arith-rewriter.ts +613 -6
  163. package/src/prover/smt/solver/arith-terms.ts +121 -0
  164. package/src/prover/smt/solver/array-decl-plugin.ts +175 -0
  165. package/src/prover/smt/solver/array-rewriter.ts +309 -0
  166. package/src/prover/smt/solver/asserted-formulas.ts +87 -16
  167. package/src/prover/smt/solver/ast-lt.ts +166 -12
  168. package/src/prover/smt/solver/ast-util.ts +160 -2
  169. package/src/prover/smt/solver/ast.ts +1427 -41
  170. package/src/prover/smt/solver/auf-solver.ts +2 -6
  171. package/src/prover/smt/solver/bit-blast-tactic.ts +582 -0
  172. package/src/prover/smt/solver/bit-blaster.ts +871 -0
  173. package/src/prover/smt/solver/bound-manager.ts +196 -0
  174. package/src/prover/smt/solver/bound-simplifier.ts +600 -0
  175. package/src/prover/smt/solver/bv-bound-chk.ts +492 -0
  176. package/src/prover/smt/solver/bv-decl-plugin.ts +338 -0
  177. package/src/prover/smt/solver/bv-divrem-bounds.ts +95 -0
  178. package/src/prover/smt/solver/bv-rewriter.ts +1901 -0
  179. package/src/prover/smt/solver/bv1-blast.ts +214 -0
  180. package/src/prover/smt/solver/bv2fpa-converter.ts +174 -0
  181. package/src/prover/smt/solver/bv2int-rewriter.ts +544 -0
  182. package/src/prover/smt/solver/bv2real-rewriter.ts +533 -0
  183. package/src/prover/smt/solver/card2bv.ts +110 -0
  184. package/src/prover/smt/solver/case-split-queue.ts +0 -2
  185. package/src/prover/smt/solver/cg-table.ts +39 -25
  186. package/src/prover/smt/solver/check-logic.ts +330 -0
  187. package/src/prover/smt/solver/clause.ts +0 -1
  188. package/src/prover/smt/solver/cofactor-elim-term-ite.ts +278 -0
  189. package/src/prover/smt/solver/conflict-resolution.ts +78 -2
  190. package/src/prover/smt/solver/context.ts +516 -115
  191. package/src/prover/smt/solver/ctx-simplify.ts +20 -10
  192. package/src/prover/smt/solver/ctx-solver-simplify.ts +122 -0
  193. package/src/prover/smt/solver/datatype-decl-plugin.ts +572 -0
  194. package/src/prover/smt/solver/datatype-rewriter.ts +82 -0
  195. package/src/prover/smt/solver/demodulator.ts +786 -0
  196. package/src/prover/smt/solver/dependent-expr-state.ts +81 -0
  197. package/src/prover/smt/solver/der.ts +38 -10
  198. package/src/prover/smt/solver/diff-neq.ts +206 -0
  199. package/src/prover/smt/solver/distribute-forall.ts +57 -0
  200. package/src/prover/smt/solver/dom-simplify.ts +511 -0
  201. package/src/prover/smt/solver/dt2bv-tactic.ts +260 -0
  202. package/src/prover/smt/solver/dyn-ack.ts +0 -1
  203. package/src/prover/smt/solver/e-matching.ts +7 -8
  204. package/src/prover/smt/solver/elim-small-bv-tactic.ts +129 -0
  205. package/src/prover/smt/solver/elim-uncnstr.ts +545 -0
  206. package/src/prover/smt/solver/enode.ts +100 -3
  207. package/src/prover/smt/solver/eq2bv-tactic.ts +218 -0
  208. package/src/prover/smt/solver/euf/arith-axioms.ts +403 -0
  209. package/src/prover/smt/solver/euf/arith-internalize.ts +653 -0
  210. package/src/prover/smt/solver/euf/arith-solver.ts +889 -0
  211. package/src/prover/smt/solver/euf/array-axioms.ts +527 -0
  212. package/src/prover/smt/solver/euf/array-internalize.ts +428 -0
  213. package/src/prover/smt/solver/euf/array-solver.ts +306 -0
  214. package/src/prover/smt/solver/euf/bv-ackerman.ts +162 -0
  215. package/src/prover/smt/solver/euf/bv-internalize.ts +748 -0
  216. package/src/prover/smt/solver/euf/bv-solver.ts +449 -0
  217. package/src/prover/smt/solver/euf/dt-solver.ts +618 -0
  218. package/src/prover/smt/solver/euf/egraph.ts +907 -0
  219. package/src/prover/smt/solver/euf/euf-solver.ts +1205 -0
  220. package/src/prover/smt/solver/euf/fpa-solver.ts +317 -0
  221. package/src/prover/smt/solver/euf/mam.ts +1050 -0
  222. package/src/prover/smt/solver/euf/q-ematch.ts +830 -0
  223. package/src/prover/smt/solver/euf/q-mbi.ts +587 -0
  224. package/src/prover/smt/solver/euf/q-model-fixer.ts +296 -0
  225. package/src/prover/smt/solver/euf/q-solver.ts +361 -0
  226. package/src/prover/smt/solver/euf/th-solver.ts +335 -0
  227. package/src/prover/smt/solver/euf/th-solvers.ts +30 -0
  228. package/src/prover/smt/solver/expr-ref.ts +0 -1
  229. package/src/prover/smt/solver/expr-safe-replace.ts +26 -2
  230. package/src/prover/smt/solver/expr2polynomial.ts +146 -0
  231. package/src/prover/smt/solver/factor.ts +141 -0
  232. package/src/prover/smt/solver/fd-solver.ts +265 -0
  233. package/src/prover/smt/solver/fingerprints.ts +15 -15
  234. package/src/prover/smt/solver/fix-dl-var.ts +148 -0
  235. package/src/prover/smt/solver/flat-literals.ts +0 -1
  236. package/src/prover/smt/solver/fm-tactic.ts +884 -0
  237. package/src/prover/smt/solver/fpa-decl-plugin.ts +618 -0
  238. package/src/prover/smt/solver/fpa-rewriter.ts +640 -0
  239. package/src/prover/smt/solver/fpa2bv-converter.ts +2249 -0
  240. package/src/prover/smt/solver/fpa2bv-rewriter.ts +348 -0
  241. package/src/prover/smt/solver/fpa2bv-tactic.ts +73 -0
  242. package/src/prover/smt/solver/goal.ts +175 -15
  243. package/src/prover/smt/solver/goal2nlsat.ts +189 -0
  244. package/src/prover/smt/solver/guard-set.ts +219 -0
  245. package/src/prover/smt/solver/hash.ts +0 -1
  246. package/src/prover/smt/solver/hashtable.ts +30 -16
  247. package/src/prover/smt/solver/inf-eps.ts +63 -0
  248. package/src/prover/smt/solver/inj-axiom.ts +101 -0
  249. package/src/prover/smt/solver/internalizer.ts +110 -38
  250. package/src/prover/smt/solver/lackr.ts +381 -0
  251. package/src/prover/smt/solver/lbool.ts +0 -1
  252. package/src/prover/smt/solver/lia2card.ts +268 -0
  253. package/src/prover/smt/solver/lia2pb.ts +154 -0
  254. package/src/prover/smt/solver/literal.ts +0 -1
  255. package/src/prover/smt/solver/logic-tactics.ts +345 -0
  256. package/src/prover/smt/solver/lp/bound-propagator.ts +0 -1
  257. package/src/prover/smt/solver/lp/constraints.ts +0 -1
  258. package/src/prover/smt/solver/lp/containers.ts +0 -1
  259. package/src/prover/smt/solver/lp/core-solver.ts +18 -3
  260. package/src/prover/smt/solver/lp/cross-nested.ts +0 -1
  261. package/src/prover/smt/solver/lp/dep-intervals.ts +0 -3
  262. package/src/prover/smt/solver/lp/dependency.ts +0 -2
  263. package/src/prover/smt/solver/lp/dioph-eq.ts +1 -10
  264. package/src/prover/smt/solver/lp/explanation.ts +0 -1
  265. package/src/prover/smt/solver/lp/gomory.ts +0 -1
  266. package/src/prover/smt/solver/lp/hnf-cutter.ts +1 -2
  267. package/src/prover/smt/solver/lp/hnf.ts +0 -3
  268. package/src/prover/smt/solver/lp/int-cube.ts +3 -4
  269. package/src/prover/smt/solver/lp/int-solver.ts +0 -2
  270. package/src/prover/smt/solver/lp/lar-solver.ts +40 -4
  271. package/src/prover/smt/solver/lp/lar-term.ts +0 -1
  272. package/src/prover/smt/solver/lp/lp-settings.ts +0 -1
  273. package/src/prover/smt/solver/lp/maximize-term.ts +59 -10
  274. package/src/prover/smt/solver/lp/nex-creator.ts +0 -1
  275. package/src/prover/smt/solver/lp/nex.ts +0 -1
  276. package/src/prover/smt/solver/lp/nla-backoff.ts +0 -2
  277. package/src/prover/smt/solver/lp/nla-basics.ts +0 -2
  278. package/src/prover/smt/solver/lp/nla-core.ts +42 -11
  279. package/src/prover/smt/solver/lp/nla-divisions.ts +0 -2
  280. package/src/prover/smt/solver/lp/nla-emonics.ts +0 -1
  281. package/src/prover/smt/solver/lp/nla-factorization.ts +0 -1
  282. package/src/prover/smt/solver/lp/nla-grobner.ts +9 -4
  283. package/src/prover/smt/solver/lp/nla-horner.ts +0 -2
  284. package/src/prover/smt/solver/lp/nla-intervals.ts +0 -1
  285. package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +0 -2
  286. package/src/prover/smt/solver/lp/nla-monotone.ts +0 -1
  287. package/src/prover/smt/solver/lp/nla-order.ts +0 -2
  288. package/src/prover/smt/solver/lp/nla-patcher.ts +0 -1
  289. package/src/prover/smt/solver/lp/nla-powers.ts +220 -0
  290. package/src/prover/smt/solver/lp/nla-tangents.ts +0 -2
  291. package/src/prover/smt/solver/lp/nla-throttle.ts +0 -1
  292. package/src/prover/smt/solver/lp/nla-transcendentals.ts +324 -0
  293. package/src/prover/smt/solver/lp/nla-types.ts +0 -2
  294. package/src/prover/smt/solver/lp/nla-var-eqs.ts +0 -1
  295. package/src/prover/smt/solver/lp/nra-solver.ts +25 -4
  296. package/src/prover/smt/solver/lp/numeric-pair.ts +0 -1
  297. package/src/prover/smt/solver/lp/pdd-interval.ts +0 -1
  298. package/src/prover/smt/solver/lp/pdd-simplifier.ts +0 -1
  299. package/src/prover/smt/solver/lp/pdd-solver.ts +0 -2
  300. package/src/prover/smt/solver/lp/pdd.ts +2 -2
  301. package/src/prover/smt/solver/lp/random-updater.ts +0 -2
  302. package/src/prover/smt/solver/lp/static-matrix.ts +0 -1
  303. package/src/prover/smt/solver/lp/union-find.ts +7 -2
  304. package/src/prover/smt/solver/macro-finder.ts +530 -0
  305. package/src/prover/smt/solver/mam-compiler.ts +122 -90
  306. package/src/prover/smt/solver/mam-interpreter.ts +0 -1
  307. package/src/prover/smt/solver/max-bv-sharing-tactic.ts +17 -0
  308. package/src/prover/smt/solver/max-cliques.ts +105 -0
  309. package/src/prover/smt/solver/maxcore.ts +309 -0
  310. package/src/prover/smt/solver/maximize-ac-sharing.ts +8 -6
  311. package/src/prover/smt/solver/maxlex.ts +115 -0
  312. package/src/prover/smt/solver/maxsmt-base.ts +105 -0
  313. package/src/prover/smt/solver/maxsmt.ts +92 -0
  314. package/src/prover/smt/solver/mbp/mbp-arith.ts +467 -0
  315. package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +101 -0
  316. package/src/prover/smt/solver/mbp/mbp-plugin.ts +287 -0
  317. package/src/prover/smt/solver/mbp/mbp-qel.ts +48 -0
  318. package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +271 -0
  319. package/src/prover/smt/solver/mbp/mbp-term-graph.ts +606 -0
  320. package/src/prover/smt/solver/model-based-opt.ts +844 -0
  321. package/src/prover/smt/solver/model-checker.ts +18 -27
  322. package/src/prover/smt/solver/model-evaluator.ts +188 -12
  323. package/src/prover/smt/solver/model-finder.ts +12 -18
  324. package/src/prover/smt/solver/model-generator.ts +56 -29
  325. package/src/prover/smt/solver/model-macro-solver.ts +49 -46
  326. package/src/prover/smt/solver/model-printer.ts +214 -0
  327. package/src/prover/smt/solver/mpf.ts +711 -0
  328. package/src/prover/smt/solver/mus.ts +51 -0
  329. package/src/prover/smt/solver/muz/dl-context.ts +404 -0
  330. package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +97 -0
  331. package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +167 -0
  332. package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +125 -0
  333. package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +299 -0
  334. package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +455 -0
  335. package/src/prover/smt/solver/muz/dl-mk-slice.ts +340 -0
  336. package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +163 -0
  337. package/src/prover/smt/solver/muz/dl-rule-set.ts +273 -0
  338. package/src/prover/smt/solver/muz/dl-rule-transformer.ts +123 -0
  339. package/src/prover/smt/solver/muz/dl-rule.ts +496 -0
  340. package/src/prover/smt/solver/muz/hnf.ts +201 -0
  341. package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +176 -0
  342. package/src/prover/smt/solver/muz/horn-tactic.ts +201 -0
  343. package/src/prover/smt/solver/muz/rule-properties.ts +337 -0
  344. package/src/prover/smt/solver/muz/spacer-context.ts +1406 -0
  345. package/src/prover/smt/solver/muz/spacer-dl-interface.ts +52 -0
  346. package/src/prover/smt/solver/muz/spacer-generalizers.ts +241 -0
  347. package/src/prover/smt/solver/muz/spacer-manager.ts +127 -0
  348. package/src/prover/smt/solver/muz/spacer-pdr.ts +218 -0
  349. package/src/prover/smt/solver/muz/spacer-prop-solver.ts +333 -0
  350. package/src/prover/smt/solver/muz/spacer-util.ts +282 -0
  351. package/src/prover/smt/solver/muz/substitution.ts +203 -0
  352. package/src/prover/smt/solver/nla2bv-tactic.ts +285 -0
  353. package/src/prover/smt/solver/nlqsat.ts +484 -0
  354. package/src/prover/smt/solver/nlsat/algebraic.ts +125 -12
  355. package/src/prover/smt/solver/nlsat/atoms.ts +20 -6
  356. package/src/prover/smt/solver/nlsat/evaluator.ts +0 -1
  357. package/src/prover/smt/solver/nlsat/explain.ts +63 -23
  358. package/src/prover/smt/solver/nlsat/interval-set.ts +1 -2
  359. package/src/prover/smt/solver/nlsat/levelwise.ts +3 -9
  360. package/src/prover/smt/solver/nlsat/mpbq.ts +45 -1
  361. package/src/prover/smt/solver/nlsat/polynomial.ts +13 -6
  362. package/src/prover/smt/solver/nlsat/solver.ts +234 -36
  363. package/src/prover/smt/solver/nlsat/transcendental-eval.ts +310 -0
  364. package/src/prover/smt/solver/nlsat/transcendentals.ts +367 -0
  365. package/src/prover/smt/solver/nlsat/types.ts +0 -2
  366. package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +1 -4
  367. package/src/prover/smt/solver/nlsat/upolynomial.ts +0 -2
  368. package/src/prover/smt/solver/nlsat-tactic.ts +82 -0
  369. package/src/prover/smt/solver/nnf.ts +105 -23
  370. package/src/prover/smt/solver/normalize-bounds.ts +53 -0
  371. package/src/prover/smt/solver/occf.ts +97 -0
  372. package/src/prover/smt/solver/opt-context.ts +787 -0
  373. package/src/prover/smt/solver/opt-nlsat.ts +375 -0
  374. package/src/prover/smt/solver/opt-pareto.ts +282 -0
  375. package/src/prover/smt/solver/opt-preprocess.ts +101 -0
  376. package/src/prover/smt/solver/opt-solver.ts +308 -0
  377. package/src/prover/smt/solver/opt-value.ts +55 -0
  378. package/src/prover/smt/solver/optsmt.ts +692 -0
  379. package/src/prover/smt/solver/parallel-tactic.ts +299 -0
  380. package/src/prover/smt/solver/pattern-inference.ts +19 -11
  381. package/src/prover/smt/solver/pb-rewriter.ts +284 -0
  382. package/src/prover/smt/solver/pb2bv-tactic.ts +540 -0
  383. package/src/prover/smt/solver/poly-rewriter.ts +202 -57
  384. package/src/prover/smt/solver/probes.ts +512 -0
  385. package/src/prover/smt/solver/propagate-values.ts +37 -21
  386. package/src/prover/smt/solver/proto-model.ts +648 -19
  387. package/src/prover/smt/solver/pull-quant.ts +28 -12
  388. package/src/prover/smt/solver/purify-arith.ts +632 -0
  389. package/src/prover/smt/solver/qe-arith-plugin.ts +1098 -0
  390. package/src/prover/smt/solver/qe-lite-der.ts +2 -3
  391. package/src/prover/smt/solver/qe-lite-fm.ts +3 -4
  392. package/src/prover/smt/solver/qe-lite.ts +37 -17
  393. package/src/prover/smt/solver/qe-mbp.ts +270 -0
  394. package/src/prover/smt/solver/qe.ts +1498 -0
  395. package/src/prover/smt/solver/qel.ts +25 -0
  396. package/src/prover/smt/solver/qi-queue.ts +0 -1
  397. package/src/prover/smt/solver/qsat.ts +814 -0
  398. package/src/prover/smt/solver/quant-hoist.ts +196 -0
  399. package/src/prover/smt/solver/quant-tactics.ts +16 -56
  400. package/src/prover/smt/solver/quantifier-analyzer.ts +19 -20
  401. package/src/prover/smt/solver/quantifier-manager.ts +8 -16
  402. package/src/prover/smt/solver/quasi-macros.ts +243 -0
  403. package/src/prover/smt/solver/random-gen.ts +0 -1
  404. package/src/prover/smt/solver/rational.ts +45 -1
  405. package/src/prover/smt/solver/recfun-decl-plugin.ts +261 -0
  406. package/src/prover/smt/solver/recfun-rewriter.ts +107 -0
  407. package/src/prover/smt/solver/reduce-args.ts +225 -0
  408. package/src/prover/smt/solver/reduce-bv-size.ts +119 -0
  409. package/src/prover/smt/solver/ref-vector.ts +0 -1
  410. package/src/prover/smt/solver/relevancy.ts +1 -2
  411. package/src/prover/smt/solver/rewriter-tpl.ts +77 -10
  412. package/src/prover/smt/solver/rewriter.ts +475 -36
  413. package/src/prover/smt/solver/rlimit.ts +25 -2
  414. package/src/prover/smt/solver/sat/asymm-branch.ts +325 -0
  415. package/src/prover/smt/solver/sat/big.ts +177 -0
  416. package/src/prover/smt/solver/sat/clause-use-list.ts +71 -0
  417. package/src/prover/smt/solver/sat/clause.ts +203 -0
  418. package/src/prover/smt/solver/sat/cleaner.ts +94 -0
  419. package/src/prover/smt/solver/sat/config.ts +122 -0
  420. package/src/prover/smt/solver/sat/consequences.ts +203 -0
  421. package/src/prover/smt/solver/sat/elim-eqs.ts +142 -0
  422. package/src/prover/smt/solver/sat/goal2sat.ts +526 -0
  423. package/src/prover/smt/solver/sat/inc-sat-solver.ts +378 -0
  424. package/src/prover/smt/solver/sat/model-converter.ts +136 -0
  425. package/src/prover/smt/solver/sat/pb-constraint.ts +261 -0
  426. package/src/prover/smt/solver/sat/pb-solver.ts +1577 -0
  427. package/src/prover/smt/solver/sat/probing.ts +170 -0
  428. package/src/prover/smt/solver/sat/sat-tactic.ts +43 -0
  429. package/src/prover/smt/solver/sat/sat2goal.ts +165 -0
  430. package/src/prover/smt/solver/sat/scc.ts +142 -0
  431. package/src/prover/smt/solver/sat/simplifier.ts +1618 -0
  432. package/src/prover/smt/solver/sat/solver.ts +2127 -0
  433. package/src/prover/smt/solver/sat/var-queue.ts +117 -0
  434. package/src/prover/smt/solver/sat/watch-list.ts +140 -0
  435. package/src/prover/smt/solver/search-tree.ts +284 -0
  436. package/src/prover/smt/solver/seq-axioms.ts +1010 -0
  437. package/src/prover/smt/solver/seq-decl-plugin.ts +819 -0
  438. package/src/prover/smt/solver/seq-derive.ts +1301 -0
  439. package/src/prover/smt/solver/seq-eq-approx.ts +236 -0
  440. package/src/prover/smt/solver/seq-eq-solver.ts +439 -0
  441. package/src/prover/smt/solver/seq-factory.ts +89 -0
  442. package/src/prover/smt/solver/seq-monadic.ts +728 -0
  443. package/src/prover/smt/solver/seq-range-predicate.ts +235 -0
  444. package/src/prover/smt/solver/seq-re-rewriter.ts +1170 -0
  445. package/src/prover/smt/solver/seq-re-util.ts +758 -0
  446. package/src/prover/smt/solver/seq-regex-bisim.ts +144 -0
  447. package/src/prover/smt/solver/seq-regex-live.ts +200 -0
  448. package/src/prover/smt/solver/seq-rewriter.ts +2402 -0
  449. package/src/prover/smt/solver/seq-skolem.ts +317 -0
  450. package/src/prover/smt/solver/seq-subset.ts +165 -0
  451. package/src/prover/smt/solver/seq-view-witness.ts +353 -0
  452. package/src/prover/smt/solver/smt-consequences.ts +297 -0
  453. package/src/prover/smt/solver/smt-kernel.ts +83 -0
  454. package/src/prover/smt/solver/smt-logics.ts +66 -0
  455. package/src/prover/smt/solver/smt-setup.ts +496 -0
  456. package/src/prover/smt/solver/smt2-printer.ts +765 -0
  457. package/src/prover/smt/solver/smtlib-parser.ts +3126 -316
  458. package/src/prover/smt/solver/smtlib-script.ts +1631 -0
  459. package/src/prover/smt/solver/solve-eqs.ts +929 -0
  460. package/src/prover/smt/solver/solver.ts +113 -22
  461. package/src/prover/smt/solver/static-features.ts +314 -0
  462. package/src/prover/smt/solver/sticky-generations.ts +0 -1
  463. package/src/prover/smt/solver/tactic.ts +1986 -0
  464. package/src/prover/smt/solver/term-enumeration.ts +205 -0
  465. package/src/prover/smt/solver/theory-array.ts +1240 -0
  466. package/src/prover/smt/solver/theory-bv.ts +1200 -0
  467. package/src/prover/smt/solver/theory-char.ts +355 -0
  468. package/src/prover/smt/solver/theory-datatype.ts +598 -0
  469. package/src/prover/smt/solver/theory-finite-set.ts +30 -0
  470. package/src/prover/smt/solver/theory-fpa.ts +389 -0
  471. package/src/prover/smt/solver/theory-lra-axioms.ts +53 -2
  472. package/src/prover/smt/solver/theory-lra-bounds.ts +31 -6
  473. package/src/prover/smt/solver/theory-lra-final-check.ts +56 -70
  474. package/src/prover/smt/solver/theory-lra-internalize.ts +86 -27
  475. package/src/prover/smt/solver/theory-lra-model.ts +20 -35
  476. package/src/prover/smt/solver/theory-lra-propagate.ts +24 -26
  477. package/src/prover/smt/solver/theory-lra-state.ts +6 -22
  478. package/src/prover/smt/solver/theory-lra.ts +188 -1
  479. package/src/prover/smt/solver/theory-pb.ts +934 -0
  480. package/src/prover/smt/solver/theory-polymorphism.ts +58 -0
  481. package/src/prover/smt/solver/theory-recfun.ts +307 -0
  482. package/src/prover/smt/solver/theory-seq-regex.ts +867 -0
  483. package/src/prover/smt/solver/theory-seq-solve.ts +1373 -0
  484. package/src/prover/smt/solver/theory-seq-state.ts +871 -0
  485. package/src/prover/smt/solver/theory-seq.ts +961 -0
  486. package/src/prover/smt/solver/theory.ts +189 -0
  487. package/src/prover/smt/solver/tseitin-cnf.ts +485 -0
  488. package/src/prover/smt/solver/var-subst.ts +36 -14
  489. package/src/prover/smt/table.ts +3 -2
  490. package/src/prover/smt/types.ts +146 -0
  491. package/src/prover/tlapm/cache.ts +50 -19
  492. package/src/prover/tlapm/tlapm.ts +15 -9
  493. package/src/prover/tlapm-library.ts +3208 -0
  494. package/src/prover/verdict.ts +9 -0
  495. package/src/prover/zenon/check/check.ts +1 -2
  496. package/src/prover/zenon/check/records.ts +1 -1
  497. package/src/prover/zenon/check/relations.ts +2 -1
  498. package/src/prover/zenon/check/rewrites.ts +2 -15
  499. package/src/prover/zenon/check/sets.ts +40 -58
  500. package/src/prover/zenon/check/terms.ts +1 -2
  501. package/src/prover/zenon/decide.ts +10 -7
  502. package/src/prover/zenon/encode.ts +0 -2
  503. package/src/prover/zenon/eqrel.ts +2 -2
  504. package/src/prover/zenon/equality-rules.ts +0 -2
  505. package/src/prover/zenon/expr.ts +7 -2
  506. package/src/prover/zenon/index-table.ts +9 -21
  507. package/src/prover/zenon/isar-case.ts +0 -2
  508. package/src/prover/zenon/isar.ts +35 -37
  509. package/src/prover/zenon/llproof.ts +2 -13
  510. package/src/prover/zenon/mltoll.ts +12 -30
  511. package/src/prover/zenon/node.ts +20 -5
  512. package/src/prover/zenon/parse.ts +9 -8
  513. package/src/prover/zenon/phrase.ts +0 -2
  514. package/src/prover/zenon/proof.ts +0 -2
  515. package/src/prover/zenon/propositional-rules.ts +0 -2
  516. package/src/prover/zenon/rules.ts +0 -2
  517. package/src/prover/zenon/search.ts +11 -19
  518. package/src/prover/zenon/tla/functions.ts +2 -4
  519. package/src/prover/zenon/tla/llproof.ts +9 -13
  520. package/src/prover/zenon/tla/records.ts +1 -8
  521. package/src/prover/zenon/tla/rewrites.ts +0 -2
  522. package/src/prover/zenon/tla/sets.ts +22 -22
  523. package/src/prover/zenon/tla/terms.ts +0 -2
  524. package/src/prover/zenon/tla/tla.ts +7 -8
  525. package/src/resolve.ts +55 -72
  526. package/src/sany/generation.ts +394 -0
  527. package/src/sany/generator-def-entries.ts +210 -0
  528. package/src/sany/generator-definitions.ts +686 -0
  529. package/src/sany/generator-expressions.ts +1100 -0
  530. package/src/sany/generator-proofs.ts +662 -0
  531. package/src/sany/generator.ts +155 -2625
  532. package/src/sany/levels.ts +0 -2
  533. package/src/sany/lexer.ts +17 -16
  534. package/src/sany/linter.ts +0 -2
  535. package/src/sany/nodes.ts +6 -13
  536. package/src/sany/report.ts +3 -6
  537. package/src/sany/selectors.ts +35 -38
  538. package/src/sany/xml.ts +23 -55
  539. package/src/search.ts +196 -43
  540. package/src/simulate.ts +157 -133
  541. package/src/spec-description.ts +33 -48
  542. package/src/standard-modules.ts +16 -32
  543. package/src/state-graph.ts +2 -9
  544. package/src/substitution-levels.ts +5 -4
  545. package/src/successors.ts +6 -8
  546. package/src/symmetry.ts +2 -2
  547. package/src/tableau.ts +2 -2
  548. package/src/tlc/fingerprint.ts +81 -9
  549. package/src/tlc/messages.ts +20 -15
  550. package/src/tlc/order.ts +2 -9
  551. package/src/tlc/random.ts +4 -4
  552. package/src/tlc/replay.ts +8 -15
  553. package/src/tlc/summary.ts +29 -14
  554. package/src/tlc/tlc-operators.ts +2 -3
  555. package/src/tlc/trace-spec.ts +25 -45
  556. package/src/typed-tier.ts +6535 -0
  557. package/src/typescript/actions.ts +2 -4
  558. package/src/typescript/collections.ts +34 -20
  559. package/src/typescript/compile.ts +1 -3
  560. package/src/typescript/formula.ts +5 -3
  561. package/src/typescript/model.ts +4 -5
  562. package/src/typescript/steps.ts +20 -18
  563. package/src/values.ts +63 -158
  564. package/src/prover/isabelle/isar/statement.ts +0 -52
  565. package/src/prover/smt/solver/z3-license.txt +0 -10
  566. package/src/prover/tlaps-module.ts +0 -510
  567. package/src/prover/zenon/LICENSE +0 -32
@@ -1,8 +1,6 @@
1
- // Ported from Isabelle2025's Pure/raw_simplifier.ML and Pure/conv.ML. Copyright (c) 1986-2025 University of Cambridge, Technische Universitaet Muenchen, and contributors, see LICENSE.
2
-
3
- import { TlaIsabelleError } from "../../../errors";
1
+ import { isIsabelleError, TlaIsabelleError } from "../../../errors";
4
2
  import { gconvRule, impCongRule } from "./conv";
5
- import { impCong, swapPremsEq } from "./drule";
3
+ import { betaEtaConversion, impCong, swapPremsEq } from "./drule";
6
4
  import { emptyTEnv } from "./envir";
7
5
  import {
8
6
  destEquals,
@@ -80,17 +78,9 @@ export type Prover = (context: SimpContext, thm: Thm) => Thm | undefined;
80
78
  export const simpleProver: Prover = (context, thm) =>
81
79
  seqHead(allGoals(resolveTac(context.limits, context.simpset.prems))(thm));
82
80
 
83
- const isThmError = (error: unknown) =>
84
- error instanceof TlaIsabelleError && error.exception === "THM";
85
-
86
81
  const lhsOf = (thm: Thm) => destEquals(thm.prop)[0];
87
82
  const rhsOf = (thm: Thm) => destEquals(thm.prop)[1];
88
83
 
89
- const betaEtaConversion = (term: Term) => {
90
- const beta = betaConversion(true, term);
91
- return transitive(beta, etaConversion(rhsOf(beta)));
92
- };
93
-
94
84
  const instantiateMatch = (env: MatchEnv, rule: Thm): Thm => {
95
85
  const typed = instantiateTypes(env.tyenv, rule);
96
86
  const insts: Instantiation[] = tableEntries(env.tenv).map(([key, binding]) => ({
@@ -109,18 +99,18 @@ const checkConv = (thm: Thm, next: Thm): Thm | undefined => {
109
99
  try {
110
100
  return transitive(thm, next);
111
101
  } catch (error) {
112
- if (!isThmError(error)) throw error;
102
+ if (!isIsabelleError(error, "THM")) throw error;
113
103
  }
114
104
  try {
115
105
  const normalized = transitive(symmetric(betaEtaConversion(lhsOf(next))), next);
116
106
  try {
117
107
  return transitive(thm, normalized);
118
108
  } catch (error) {
119
- if (!isThmError(error)) throw error;
109
+ if (!isIsabelleError(error, "THM")) throw error;
120
110
  return transitive(transitive(thm, betaEtaConversion(rhsOf(thm))), normalized);
121
111
  }
122
112
  } catch (error) {
123
- if (isThmError(error)) return undefined;
113
+ if (isIsabelleError(error, "THM")) return undefined;
124
114
  throw error;
125
115
  }
126
116
  };
@@ -328,9 +318,8 @@ const bottomc = (mode: RewriteMode, prover: Prover, maxidx: number) => {
328
318
  return inner === undefined ? undefined : abstractRule(term.name, variable, inner);
329
319
  }
330
320
  if (term.kind !== "App") return undefined;
321
+ if (isImplies(term)) return impc(term, context);
331
322
  const head = term.fun;
332
- if (head.kind === "App" && head.fun.kind === "Const" && head.fun.name === "Pure.imp")
333
- return impc(term, context);
334
323
  if (head.kind === "Abs") {
335
324
  const beta = betaConversion(false, term);
336
325
  const rest = subc(SKEL0, context, rhsOf(beta));
@@ -1,5 +1,3 @@
1
- // Ported from Isabelle2025's Pure/search.ML. Copyright (c) 1986-2025 University of Cambridge, Technische Universitaet Muenchen, and contributors, see LICENSE.
2
-
3
1
  import { listOfSeq, makeSeq, seqOfList } from "./seq";
4
2
  import { eqThm, hasFewerPrems, noTac, orElse, type GoalTactic, type Tactic } from "./tactical";
5
3
  import { termOrd } from "./term-ord";
@@ -1,5 +1,3 @@
1
- // Ported from Isabelle2025's Pure/General/seq.ML. Copyright (c) 1986-2025 University of Cambridge, Technische Universitaet Muenchen, and contributors, see LICENSE.
2
-
3
1
  export type Cell<Item> = readonly [Item, Seq<Item>] | undefined;
4
2
 
5
3
  type Step<Item> = Cell<Item> | Seq<Item>;
@@ -1,8 +1,7 @@
1
- // Ported from Isabelle2025's Pure/simplifier.ML and Pure/goal.ML. Copyright (c) 1986-2025 University of Cambridge, Technische Universitaet Muenchen, and contributors, see LICENSE.
2
-
3
- import { genAll, isNormHhf, normHhfEq } from "./drule";
1
+ import { genAll, isNormHhf, normHhfEq, protectCong } from "./drule";
4
2
  import { preferGoal } from "./goal";
5
- import { makeSimpContext, type SimpContext, type Solver } from "./raw-simplifier";
3
+ import { congKey, makeSimpContext, type SimpContext, type Solver } from "./raw-simplifier";
4
+ import { updateTable } from "./table";
6
5
  import { fconvRule } from "./conv";
7
6
  import {
8
7
  genericRewriteGoalTac,
@@ -80,9 +79,24 @@ const simpThm = (mode: RewriteMode, context: SimpContext, thm: Thm): Thm => {
80
79
  export const simplify = (context: SimpContext, thm: Thm) =>
81
80
  simpThm({ simprem: false, useprem: false, mutsimp: false }, context, thm);
82
81
 
83
- export const normHhf = (limits: Limits, thm: Thm): Thm => {
84
- if (isNormHhf(false, thm.prop)) return genAll(thm);
85
- const context = makeSimpContext(limits, [normHhfEq]);
82
+ // Drule.sort_constraint_eq, the other rule of hhf_ss, never applies: tlapm's terms carry no sort
83
+ // constraints.
84
+ const genNormHhf = (isProtecting: boolean, limits: Limits, thm: Thm): Thm => {
85
+ if (isNormHhf(isProtecting, thm.prop)) return genAll(thm);
86
+ const hhfContext = makeSimpContext(limits, [normHhfEq]);
87
+ const context = isProtecting
88
+ ? {
89
+ ...hhfContext,
90
+ simpset: {
91
+ ...hhfContext.simpset,
92
+ congs: updateTable(
93
+ hhfContext.simpset.congs,
94
+ congKey({ isConst: true, name: "Pure.prop" }),
95
+ protectCong,
96
+ ),
97
+ },
98
+ }
99
+ : hhfContext;
86
100
  return genAll(
87
101
  fconvRule(
88
102
  (term) =>
@@ -96,3 +110,8 @@ export const normHhf = (limits: Limits, thm: Thm): Thm => {
96
110
  ),
97
111
  );
98
112
  };
113
+
114
+ export const normHhf = (limits: Limits, thm: Thm) => genNormHhf(false, limits, thm);
115
+
116
+ // Raw_Simplifier.norm_hhf_protect leaves protected propositions alone.
117
+ export const normHhfProtect = (limits: Limits, thm: Thm) => genNormHhf(true, limits, thm);
@@ -1,5 +1,3 @@
1
- // Ported from Isabelle2025's Pure/General/table.ML. Copyright (c) 1986-2025 University of Cambridge, Technische Universitaet Muenchen, and contributors, see LICENSE.
2
-
3
1
  export type Compare<Key> = (left: Key, right: Key) => number;
4
2
 
5
3
  type Node<Key, Value> =
@@ -157,7 +155,8 @@ export const fastStringOrd = (left: string, right: string) =>
157
155
  ? -1
158
156
  : 1;
159
157
 
160
- const stringOrd = (left: string, right: string) => (left === right ? 0 : left < right ? -1 : 1);
158
+ export const stringOrd = (left: string, right: string) =>
159
+ left === right ? 0 : left < right ? -1 : 1;
161
160
 
162
161
  export interface IndexKey {
163
162
  readonly name: string;
@@ -1,5 +1,3 @@
1
- // Ported from Isabelle2025's Pure/tactic.ML. Copyright (c) 1986-2025 University of Cambridge, Technische Universitaet Muenchen, and contributors, see LICENSE.
2
-
3
1
  import { makeElim } from "./drule";
4
2
  import { checkInterrupt, type Limits } from "./interrupt";
5
3
  import { stripAssumsConcl, stripAssumsHyp } from "./logic";
@@ -1,6 +1,4 @@
1
- // Ported from Isabelle2025's Pure/tactical.ML and Pure/search.ML. Copyright (c) 1986-2025 University of Cambridge, Technische Universitaet Muenchen, and contributors, see LICENSE.
2
-
3
- import { TlaIsabelleError } from "../../../errors";
1
+ import { isIsabelleError } from "../../../errors";
4
2
  import {
5
3
  appendSeq,
6
4
  emptySeq,
@@ -94,39 +92,49 @@ export const eqThmProp = (left: Thm, right: Thm) => aconv(left.prop, right.prop)
94
92
  interface Trail {
95
93
  readonly state: Thm;
96
94
  readonly rest: Seq<Thm>;
97
- readonly tactics: readonly Tactic[];
95
+ readonly position: number;
96
+ readonly next: Trail | undefined;
98
97
  }
99
98
 
100
- export const every = (tactics: readonly Tactic[]): Tactic => {
101
- const evy = (trail: readonly Trail[], remaining: readonly Tactic[], state: Thm): Seq<Thm> => {
102
- if (remaining.length === 0) return makeSeq(() => [state, makeSeq(() => evyBack(trail).pull())]);
103
- const cell = remaining[0](state).pull();
104
- if (cell === undefined) return evyBack(trail);
105
- return evy(
106
- [{ state: cell[0], rest: cell[1], tactics: remaining.slice(1) }, ...trail],
107
- remaining.slice(1),
108
- cell[0],
109
- );
110
- };
111
- const evyBack = (trail: readonly Trail[]): Seq<Thm> => {
112
- let current = trail;
113
- while (current.length > 0) {
114
- const top = current[0];
115
- const cell = top.rest.pull();
116
- if (cell === undefined) current = current.slice(1);
117
- else if (eqThm(top.state, cell[0]))
118
- current = [{ ...top, rest: cell[1] }, ...current.slice(1)];
119
- else
120
- return evy(
121
- [{ state: cell[0], rest: cell[1], tactics: top.tactics }, ...current.slice(1)],
122
- top.tactics,
123
- cell[0],
124
- );
125
- }
126
- return emptySeq;
99
+ // EVY and evyBack as one loop: blast replays thousands of tactics, too deep for mutual recursion.
100
+ export const every =
101
+ (tactics: readonly Tactic[]): Tactic =>
102
+ (start) => {
103
+ const evy = (
104
+ initialTrail: Trail | undefined,
105
+ initialPosition: number,
106
+ initialState: Thm | undefined,
107
+ ): Cell<Thm> => {
108
+ let trail = initialTrail;
109
+ let position = initialPosition;
110
+ let state = initialState;
111
+ for (;;) {
112
+ if (state === undefined) {
113
+ if (trail === undefined) return undefined;
114
+ const cell = trail.rest.pull();
115
+ if (cell === undefined) trail = trail.next;
116
+ else if (eqThm(trail.state, cell[0])) trail = { ...trail, rest: cell[1] };
117
+ else {
118
+ trail = { state: cell[0], rest: cell[1], position: trail.position, next: trail.next };
119
+ position = trail.position;
120
+ state = cell[0];
121
+ }
122
+ } else if (position === tactics.length) {
123
+ const saved = trail;
124
+ return [state, makeSeq(() => evy(saved, 0, undefined))];
125
+ } else {
126
+ const cell = tactics[position](state).pull();
127
+ if (cell === undefined) state = undefined;
128
+ else {
129
+ trail = { state: cell[0], rest: cell[1], position: position + 1, next: trail };
130
+ position += 1;
131
+ state = cell[0];
132
+ }
133
+ }
134
+ }
135
+ };
136
+ return ofCell(evy(undefined, 0, start));
127
137
  };
128
- return (state) => evy([], tactics, state);
129
- };
130
138
 
131
139
  export const first = (tactics: readonly Tactic[]): Tactic =>
132
140
  tactics.reduceRight((rest, tactic) => orElse(tactic, rest), noTac);
@@ -182,9 +190,6 @@ export const firstGoalTac =
182
190
  return find(1)(state);
183
191
  };
184
192
 
185
- const isThmError = (error: unknown) =>
186
- error instanceof TlaIsabelleError && error.exception === "THM";
187
-
188
193
  export const subgoal =
189
194
  (build: (goal: Term, index: number) => Tactic): GoalTactic =>
190
195
  (index) =>
@@ -215,7 +220,7 @@ export const primSeq =
215
220
  try {
216
221
  return apply(state);
217
222
  } catch (error) {
218
- if (isThmError(error)) return emptySeq;
223
+ if (isIsabelleError(error, "THM")) return emptySeq;
219
224
  throw error;
220
225
  }
221
226
  };
@@ -1,5 +1,3 @@
1
- // Ported from Isabelle2025's Pure/term_ord.ML. Copyright (c) 1986-2025 University of Cambridge, Technische Universitaet Muenchen, and contributors, see LICENSE.
2
-
3
1
  import { fastIndexnameOrd, fastStringOrd, indexnameOrd } from "./table";
4
2
  import { dummyT, sizeOfTerm, type Term, type Typ } from "./term";
5
3
 
@@ -1,5 +1,3 @@
1
- // Ported from Isabelle2025's Pure/term.ML. Copyright (c) 1986-2025 University of Cambridge, Technische Universitaet Muenchen, and contributors, see LICENSE.
2
-
3
1
  import { TlaIsabelleError } from "../../../errors";
4
2
 
5
3
  export type Sort = readonly string[];
@@ -1,6 +1,4 @@
1
- // Ported from Isabelle2025's Pure/thm.ML. Copyright (c) 1986-2025 University of Cambridge, Technische Universitaet Muenchen, and contributors, see LICENSE.
2
-
3
- import { TlaIsabelleError } from "../../../errors";
1
+ import { isIsabelleError, TlaIsabelleError } from "../../../errors";
4
2
  import {
5
3
  betaNorm,
6
4
  emptyEnvir,
@@ -20,6 +18,7 @@ import {
20
18
  liftAll,
21
19
  listAll,
22
20
  listImplies,
21
+ isImplies,
23
22
  mkEquals,
24
23
  mkImplies,
25
24
  occs,
@@ -142,13 +141,7 @@ export const impliesIntr = (premise: Term, thm: Thm): Thm => {
142
141
 
143
142
  export const impliesElim = (major: Thm, minor: Thm): Thm => {
144
143
  const prop = major.prop;
145
- if (
146
- prop.kind !== "App" ||
147
- prop.fun.kind !== "App" ||
148
- prop.fun.fun.kind !== "Const" ||
149
- prop.fun.fun.name !== "Pure.imp" ||
150
- !aconv(prop.fun.arg, minor.prop)
151
- )
144
+ if (!isImplies(prop) || !aconv(prop.fun.arg, minor.prop))
152
145
  throw new TlaIsabelleError("THM", "implies_elim: major premise");
153
146
  return makeThm(
154
147
  Math.max(major.maxidx, minor.maxidx),
@@ -631,8 +624,7 @@ const bicomposeAux = (
631
624
  try {
632
625
  return stripPrems(compose.subgoals, [], orule.prop);
633
626
  } catch (error) {
634
- if (error instanceof TlaIsabelleError && error.exception === "TERM")
635
- throw new TlaIsabelleError("THM", "bicompose: rule");
627
+ if (isIsabelleError(error, "TERM")) throw new TlaIsabelleError("THM", "bicompose: rule");
636
628
  throw error;
637
629
  }
638
630
  })();
@@ -652,7 +644,7 @@ const bicomposeAux = (
652
644
  try {
653
645
  return flags.flatten ? renamed.map((premise) => flattenParams(index, premise)) : renamed;
654
646
  } catch (error) {
655
- if (error instanceof TlaIsabelleError && error.exception === "TERM")
647
+ if (isIsabelleError(error, "TERM"))
656
648
  throw new TlaIsabelleError("THM", "bicompose: 1st premise");
657
649
  throw error;
658
650
  }
@@ -758,3 +750,12 @@ export const rsn = (rule: Thm, index: number, state: Thm): Thm => {
758
750
  };
759
751
 
760
752
  export const rs = (rule: Thm, state: Thm) => rsn(rule, 1, state);
753
+
754
+ export const catchThm = <Result>(derive: () => Result): Result | undefined => {
755
+ try {
756
+ return derive();
757
+ } catch (error) {
758
+ if (isIsabelleError(error, "THM")) return undefined;
759
+ throw error;
760
+ }
761
+ };
@@ -1,5 +1,3 @@
1
- // Ported from Isabelle2025's Pure/type.ML. Copyright (c) 1986-2025 University of Cambridge, Technische Universitaet Muenchen, and contributors, see LICENSE.
2
-
3
1
  import { TlaIsabelleError } from "../../../errors";
4
2
  import {
5
3
  emptyTable,
@@ -1,5 +1,3 @@
1
- // Ported from Isabelle2025's Pure/unify.ML. Copyright (c) 1986-2025 University of Cambridge, Technische Universitaet Muenchen, and contributors, see LICENSE.
2
-
3
1
  import { checkInterrupt, type Limits } from "./interrupt";
4
2
  import { TlaIsabelleError } from "../../../errors";
5
3
  import {
@@ -1,5 +1,3 @@
1
- // Ported from Isabelle2025's Pure/variable.ML. Copyright (c) 1986-2025 University of Cambridge, Technische Universitaet Muenchen, and contributors, see LICENSE.
2
-
3
1
  import { variantList } from "./name";
4
2
  import { addFreeNames, addVars, mkFree } from "./term";
5
3
  import { generalize, instantiate, type Thm } from "./thm";
@@ -1,15 +1,19 @@
1
- // Ported from Isabelle/TLA+'s PredicateLogic.thy and SetTheory.thy, BSD licensed, see LICENSE.
2
-
3
1
  import { TlaIsabelleError } from "../../../errors";
4
2
  import { emptyNet } from "../pure/net";
5
3
  import { thenGoal } from "../pure/tactical";
6
4
  import type { Limits } from "../pure/interrupt";
7
- import { assumeTac, dresolveTac, insertTaggedBrl, type NetPair } from "../pure/tactic";
5
+ import {
6
+ assumeTac,
7
+ dresolveTac,
8
+ insertTaggedBrl,
9
+ type NetPair,
10
+ type TaggedRule,
11
+ } from "../pure/tactic";
8
12
  import type { Term } from "../pure/term";
9
13
  import type { Thm } from "../pure/thm";
10
14
  import { addbefore, type Claset, type ClassicalData } from "../provers/classical";
11
15
  import { hypSubstTac, type HypsubstData } from "../provers/hypsubst";
12
- import type { LogicNetItem, LogicNetPair, TlaLogic } from "./logic";
16
+ import type { LogicNetPair, TlaLogic } from "./logic";
13
17
 
14
18
  export const getFact = (logic: TlaLogic, name: string): Thm => {
15
19
  const thms = logic.facts.get(name);
@@ -52,19 +56,16 @@ export const getHypsubstData = (logic: TlaLogic): HypsubstData => ({
52
56
  thinRefl: getFact(logic, "PredicateLogic.thin_refl"),
53
57
  });
54
58
 
55
- export const getClassicalData = (logic: TlaLogic): ClassicalData => {
56
- const hypsubst = getHypsubstData(logic);
57
- return {
58
- impElim: getFact(logic, "PredicateLogic.impCE'"),
59
- notElim: getFact(logic, "PredicateLogic.notE"),
60
- swap: getFact(logic, "PredicateLogic.swap"),
61
- classical: getFact(logic, "PredicateLogic.classical"),
62
- judgment: "PredicateLogic.Trueprop",
63
- hypSubstTacs: [(limits: Limits) => hypSubstTac({ limits, data: hypsubst })],
64
- };
65
- };
59
+ export const getClassicalData = (logic: TlaLogic, hypsubst: HypsubstData): ClassicalData => ({
60
+ impElim: getFact(logic, "PredicateLogic.impCE'"),
61
+ notElim: getFact(logic, "PredicateLogic.notE"),
62
+ swap: getFact(logic, "PredicateLogic.swap"),
63
+ classical: getFact(logic, "PredicateLogic.classical"),
64
+ judgment: "PredicateLogic.Trueprop",
65
+ hypSubstTacs: [(limits: Limits) => hypSubstTac({ limits, data: hypsubst })],
66
+ });
66
67
 
67
- export const toNetPair = <Item extends LogicNetItem>(pair: LogicNetPair<Item>): NetPair<Item> => {
68
+ export const toNetPair = <Item extends TaggedRule>(pair: LogicNetPair<Item>): NetPair<Item> => {
68
69
  const insertAll = (items: readonly Item[], netpair: NetPair<Item>) =>
69
70
  items.reduceRight((result, item) => insertTaggedBrl(item, result), netpair);
70
71
  return insertAll(pair.elim, insertAll(pair.intro, { intro: emptyNet, elim: emptyNet }));
@@ -82,6 +83,7 @@ export const getClaset = (logic: TlaLogic, limits: Limits): Claset => {
82
83
  safep: toNetPair(logic.claset.safep),
83
84
  unsafe: toNetPair(logic.claset.unsafe),
84
85
  dup: toNetPair(logic.claset.dup),
86
+ extra: toNetPair(logic.claset.extra),
85
87
  };
86
88
  return addbefore(
87
89
  claset,
@@ -1,7 +1,10 @@
1
1
  import { TlaIsabelleError } from "../../../errors";
2
2
  import type { ProofContext } from "../isar/method";
3
+ import { normHhfEq } from "../pure/drule";
3
4
  import type { Limits } from "../pure/interrupt";
4
- import { blastDepthTac, blastTac, type BlastContext } from "../provers/blast/blast";
5
+ import { symmetric } from "../pure/thm";
6
+ import { blastDepthTac, blastTac } from "../provers/blast/blast";
7
+ import type { BlastContext } from "../provers/blast/state";
5
8
  import type { ClassicalContext } from "../provers/classical";
6
9
  import { blastHypSubstTac } from "../provers/hypsubst";
7
10
  import {
@@ -24,10 +27,27 @@ const ATOMIZE_RULES = [
24
27
  "PredicateLogic.atomize_all",
25
28
  ];
26
29
 
30
+ // PredicateLogic.thy declares these [symmetric, rulify], newest first, after Pure's norm_hhf_eq.
31
+ const RULIFY_RULES = ["PredicateLogic.atomize_imp", "PredicateLogic.atomize_all"];
32
+
33
+ // PredicateLogic.thy declares these [symmetric, defn].
34
+ const DEFN_RULES = [
35
+ "PredicateLogic.atomize_all",
36
+ "PredicateLogic.atomize_imp",
37
+ "PredicateLogic.atomize_eq",
38
+ ];
39
+
40
+ // PredicateLogic.thy's instantiation of Induct takes case_split as the default cases rule.
41
+ const CASES_DEFAULT = "PredicateLogic.case_split";
42
+
27
43
  export const getProofContext = (logic: TlaLogic, limits: Limits): ProofContext => {
28
44
  const atomizeRules = ATOMIZE_RULES.map((name) => getFact(logic, name));
29
- const classical = { limits, claset: getClaset(logic, limits), data: getClassicalData(logic) };
30
45
  const hypsubst = getHypsubstData(logic);
46
+ const classical = {
47
+ limits,
48
+ claset: getClaset(logic, limits),
49
+ data: getClassicalData(logic, hypsubst),
50
+ };
31
51
  const toBlastContext = (context: ClassicalContext): BlastContext => ({
32
52
  limits: context.limits,
33
53
  claset: context.claset,
@@ -45,22 +65,49 @@ export const getProofContext = (logic: TlaLogic, limits: Limits): ProofContext =
45
65
  atomize: atomizeRules,
46
66
  },
47
67
  });
68
+ const contextRules = [
69
+ toNetPair(logic.contextRules.bang),
70
+ toNetPair(logic.contextRules.plain),
71
+ toNetPair(logic.contextRules.query),
72
+ ];
73
+ const getTaggedFact = (name: string) => {
74
+ const fullName = logic.factNames.get(name) ?? name;
75
+ return logic.facts
76
+ .get(fullName)
77
+ ?.map((rule, index) => ({ rule, tags: logic.factTags.get(fullName)?.get(index) ?? [] }));
78
+ };
79
+ const taggedThms = new Set(
80
+ [...logic.factTags].flatMap((entry) =>
81
+ [...entry[1].keys()].map((index) => logic.facts.get(entry[0])?.[index]),
82
+ ),
83
+ );
48
84
  return {
49
85
  limits,
50
86
  simpset: getSimpset(logic),
51
87
  classical,
52
- intuitionistic: {
53
- limits,
54
- safeRules: toNetPair(logic.contextRules.bang),
55
- rules: toNetPair(logic.contextRules.plain),
56
- },
88
+ intuitionistic: { limits, safeRules: contextRules[0], rules: contextRules[1] },
57
89
  atomizeRules,
90
+ defnRules: DEFN_RULES.map((name) => symmetric(getFact(logic, name))),
91
+ rulifyRules: [...RULIFY_RULES.map((name) => symmetric(getFact(logic, name))), normHhfEq],
58
92
  blastDepthTac: (context, limit) => blastDepthTac(toBlastContext(context), limit),
59
93
  blastTac: (context) => blastTac(toBlastContext(context)),
60
- getFact: (name) => {
61
- const facts = logic.facts.get(logic.factNames.get(name) ?? name);
62
- if (facts === undefined) throw new TlaIsabelleError("ERROR", `Undefined fact: ${name}`);
63
- return facts;
94
+ contextRules,
95
+ induct: {
96
+ casesType: logic.casesRules.type,
97
+ casesPred: logic.casesRules.pred,
98
+ casesDefault: {
99
+ rule: getFact(logic, CASES_DEFAULT),
100
+ tags: getTaggedFact(CASES_DEFAULT)?.[0].tags ?? [],
101
+ },
102
+ trivialRule: getFact(logic, "PredicateLogic.cases_trueI"),
103
+ getTaggedFact,
104
+ isTagged: (thm) => taggedThms.has(thm),
64
105
  },
65
106
  };
66
107
  };
108
+
109
+ export const getLogicFact = (logic: TlaLogic, name: string) => {
110
+ const facts = logic.facts.get(logic.factNames.get(name) ?? name);
111
+ if (facts === undefined) throw new TlaIsabelleError("ERROR", `Undefined fact: ${name}`);
112
+ return facts;
113
+ };