tla-ts 0.0.10-dev.63a6693bd → 0.0.10-dev.68b2c4968

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 (542) hide show
  1. package/README.md +2 -1
  2. package/dist/compile.cjs +3 -3
  3. package/dist/compile.js +1 -1
  4. package/dist/deciders.cjs +41 -37
  5. package/dist/deciders.js +45 -41
  6. package/dist/index.cjs +1 -1
  7. package/dist/index.d.cts +4 -1
  8. package/dist/index.d.ts +4 -1
  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 +2682 -426
  15. package/dist/prove.js +2679 -423
  16. package/dist/run.cjs +43 -42
  17. package/dist/run.js +44 -43
  18. package/dist/tlapm.cjs +1 -1
  19. package/dist/tlapm.js +1 -1
  20. package/dist/transfer.cjs +44 -41
  21. package/dist/transfer.js +43 -40
  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 +3 -3
  26. package/src/bags.ts +46 -28
  27. package/src/check-trace.ts +2 -16
  28. package/src/check.ts +349 -91
  29. package/src/cli/runtime-invariants.ts +20 -56
  30. package/src/cli/tlapm.ts +424 -62
  31. package/src/cli/tlc-arguments.ts +2 -2
  32. package/src/cli/tlc-output.ts +4 -5
  33. package/src/cli/tlc-usage.ts +0 -1
  34. package/src/cli/tlc.ts +26 -7
  35. package/src/codegen.ts +6 -2
  36. package/src/dependencies.ts +72 -11
  37. package/src/dfid.ts +9 -2
  38. package/src/environment.ts +27 -5
  39. package/src/errors.ts +38 -3
  40. package/src/evaluate.ts +92 -32
  41. package/src/exit-codes.ts +5 -2
  42. package/src/instances.ts +1 -1
  43. package/src/levels.ts +134 -86
  44. package/src/lexer.ts +5 -3
  45. package/src/liveness-checker.ts +572 -204
  46. package/src/liveness.ts +47 -32
  47. package/src/obligations/action.ts +10 -6
  48. package/src/obligations/anonymize.ts +33 -14
  49. package/src/obligations/enabled-axioms.ts +218 -0
  50. package/src/obligations/equality.ts +1 -3
  51. package/src/obligations/expression.ts +18 -6
  52. package/src/obligations/format.ts +0 -2
  53. package/src/obligations/generate.ts +22 -17
  54. package/src/obligations/index.ts +36 -6
  55. package/src/obligations/levels.ts +24 -11
  56. package/src/obligations/module.ts +1 -3
  57. package/src/obligations/normalize.ts +24 -13
  58. package/src/obligations/operators.ts +0 -2
  59. package/src/obligations/pragma.ts +53 -16
  60. package/src/obligations/printer.ts +43 -13
  61. package/src/obligations/proof.ts +3 -2
  62. package/src/obligations/regroup.ts +0 -2
  63. package/src/obligations/simplify.ts +17 -7
  64. package/src/obligations/source.ts +71 -17
  65. package/src/obligations/subexpression.ts +45 -18
  66. package/src/obligations/substitution.ts +1 -3
  67. package/src/obligations/temporal.ts +0 -2
  68. package/src/obligations/tuples.ts +0 -2
  69. package/src/parallel-worker.ts +8 -2
  70. package/src/parallel.ts +7 -2
  71. package/src/parser.ts +634 -186
  72. package/src/pretty-print.ts +1 -1
  73. package/src/prover/deciders.ts +11 -8
  74. package/src/prover/isabelle/decide.ts +3 -25
  75. package/src/prover/isabelle/encode.ts +71 -41
  76. package/src/prover/isabelle/isar/attrib.ts +250 -0
  77. package/src/prover/isabelle/isar/context.ts +335 -0
  78. package/src/prover/isabelle/isar/induct.ts +382 -0
  79. package/src/prover/isabelle/isar/inner-syntax.ts +149 -3
  80. package/src/prover/isabelle/isar/method.ts +506 -198
  81. package/src/prover/isabelle/isar/proof.ts +570 -14
  82. package/src/prover/isabelle/isar/rule-cases.ts +226 -0
  83. package/src/prover/isabelle/isar/theory.ts +479 -69
  84. package/src/prover/isabelle/isar/toplevel.ts +331 -0
  85. package/src/prover/isabelle/isar/type-check.ts +83 -8
  86. package/src/prover/isabelle/provers/blast/blast.ts +0 -2
  87. package/src/prover/isabelle/provers/blast/branch.ts +0 -2
  88. package/src/prover/isabelle/provers/blast/prove.ts +0 -2
  89. package/src/prover/isabelle/provers/blast/rules.ts +0 -2
  90. package/src/prover/isabelle/provers/blast/state.ts +0 -2
  91. package/src/prover/isabelle/provers/blast/term.ts +0 -2
  92. package/src/prover/isabelle/provers/clasimp.ts +1 -3
  93. package/src/prover/isabelle/provers/classical.ts +45 -20
  94. package/src/prover/isabelle/provers/hypsubst.ts +2 -4
  95. package/src/prover/isabelle/pure/bicompose.ts +0 -2
  96. package/src/prover/isabelle/pure/consts.ts +0 -2
  97. package/src/prover/isabelle/pure/conv.ts +0 -2
  98. package/src/prover/isabelle/pure/drule.ts +63 -4
  99. package/src/prover/isabelle/pure/envir.ts +0 -2
  100. package/src/prover/isabelle/pure/goal.ts +1 -3
  101. package/src/prover/isabelle/pure/logic.ts +0 -2
  102. package/src/prover/isabelle/pure/name.ts +0 -2
  103. package/src/prover/isabelle/pure/net.ts +0 -2
  104. package/src/prover/isabelle/pure/object-logic.ts +13 -7
  105. package/src/prover/isabelle/pure/pattern.ts +0 -2
  106. package/src/prover/isabelle/pure/raw-simplifier.ts +0 -2
  107. package/src/prover/isabelle/pure/rewriter.ts +1 -8
  108. package/src/prover/isabelle/pure/search.ts +0 -2
  109. package/src/prover/isabelle/pure/seq.ts +0 -2
  110. package/src/prover/isabelle/pure/simplifier.ts +26 -7
  111. package/src/prover/isabelle/pure/table.ts +0 -2
  112. package/src/prover/isabelle/pure/tactic.ts +0 -2
  113. package/src/prover/isabelle/pure/tactical.ts +0 -2
  114. package/src/prover/isabelle/pure/term-ord.ts +0 -2
  115. package/src/prover/isabelle/pure/term.ts +0 -2
  116. package/src/prover/isabelle/pure/thm.ts +0 -2
  117. package/src/prover/isabelle/pure/type.ts +0 -2
  118. package/src/prover/isabelle/pure/unify.ts +0 -2
  119. package/src/prover/isabelle/pure/variable.ts +0 -2
  120. package/src/prover/isabelle/tla/classical-setup.ts +1 -2
  121. package/src/prover/isabelle/tla/context.ts +51 -9
  122. package/src/prover/isabelle/tla/logic-data.ts +1 -1
  123. package/src/prover/isabelle/tla/logic.ts +40 -1
  124. package/src/prover/isabelle/tla/simpdata.ts +0 -2
  125. package/src/prover/isabelle/tools/intuitionistic.ts +28 -12
  126. package/src/prover/ocaml.ts +4 -1
  127. package/src/prover/prep/action.ts +19 -12
  128. package/src/prover/prep/enabled-axioms.ts +11 -2
  129. package/src/prover/prep/methods.ts +159 -50
  130. package/src/prover/prep/normalize.ts +38 -9
  131. package/src/prover/prove.ts +343 -65
  132. package/src/prover/ptl/decide.ts +95 -50
  133. package/src/prover/ptl/encode.ts +2 -3
  134. package/src/prover/ptl/tableau.ts +28 -2
  135. package/src/prover/smt/arithmetic.ts +310 -0
  136. package/src/prover/smt/axioms.ts +12 -8
  137. package/src/prover/smt/context.ts +42 -6
  138. package/src/prover/smt/data.ts +191 -84
  139. package/src/prover/smt/encode.ts +122 -43
  140. package/src/prover/smt/extensionality.ts +5 -3
  141. package/src/prover/smt/flatten.ts +4 -6
  142. package/src/prover/smt/format.ts +28 -4
  143. package/src/prover/smt/instances.ts +7 -1
  144. package/src/prover/smt/layout.ts +91 -0
  145. package/src/prover/smt/rewrite.ts +483 -116
  146. package/src/prover/smt/simplify.ts +441 -0
  147. package/src/prover/smt/solver/ackermannize-bv-tactic.ts +61 -0
  148. package/src/prover/smt/solver/ackr-helper.ts +179 -0
  149. package/src/prover/smt/solver/ackr-model-converter.ts +105 -0
  150. package/src/prover/smt/solver/act-cache.ts +0 -1
  151. package/src/prover/smt/solver/add-bounds-tactic.ts +59 -0
  152. package/src/prover/smt/solver/aig-tactic.ts +52 -0
  153. package/src/prover/smt/solver/aig.ts +889 -0
  154. package/src/prover/smt/solver/arith-rewriter.ts +613 -6
  155. package/src/prover/smt/solver/arith-terms.ts +121 -0
  156. package/src/prover/smt/solver/array-decl-plugin.ts +175 -0
  157. package/src/prover/smt/solver/array-rewriter.ts +309 -0
  158. package/src/prover/smt/solver/asserted-formulas.ts +93 -15
  159. package/src/prover/smt/solver/ast-lt.ts +165 -11
  160. package/src/prover/smt/solver/ast-util.ts +160 -2
  161. package/src/prover/smt/solver/ast.ts +1449 -41
  162. package/src/prover/smt/solver/auf-solver.ts +0 -1
  163. package/src/prover/smt/solver/bit-blast-tactic.ts +582 -0
  164. package/src/prover/smt/solver/bit-blaster.ts +871 -0
  165. package/src/prover/smt/solver/bound-manager.ts +196 -0
  166. package/src/prover/smt/solver/bound-simplifier.ts +600 -0
  167. package/src/prover/smt/solver/bv-bound-chk.ts +492 -0
  168. package/src/prover/smt/solver/bv-decl-plugin.ts +341 -0
  169. package/src/prover/smt/solver/bv-divrem-bounds.ts +95 -0
  170. package/src/prover/smt/solver/bv-rewriter.ts +1901 -0
  171. package/src/prover/smt/solver/bv1-blast.ts +214 -0
  172. package/src/prover/smt/solver/bv2fpa-converter.ts +174 -0
  173. package/src/prover/smt/solver/bv2int-rewriter.ts +544 -0
  174. package/src/prover/smt/solver/bv2real-rewriter.ts +533 -0
  175. package/src/prover/smt/solver/card2bv.ts +109 -0
  176. package/src/prover/smt/solver/case-split-queue.ts +0 -2
  177. package/src/prover/smt/solver/cg-table.ts +39 -25
  178. package/src/prover/smt/solver/check-logic.ts +330 -0
  179. package/src/prover/smt/solver/clause.ts +0 -1
  180. package/src/prover/smt/solver/cofactor-elim-term-ite.ts +278 -0
  181. package/src/prover/smt/solver/conflict-resolution.ts +78 -2
  182. package/src/prover/smt/solver/context.ts +533 -114
  183. package/src/prover/smt/solver/ctx-simplify.ts +21 -12
  184. package/src/prover/smt/solver/ctx-solver-simplify.ts +122 -0
  185. package/src/prover/smt/solver/datatype-decl-plugin.ts +572 -0
  186. package/src/prover/smt/solver/datatype-rewriter.ts +82 -0
  187. package/src/prover/smt/solver/demodulator.ts +786 -0
  188. package/src/prover/smt/solver/dependent-expr-state.ts +81 -0
  189. package/src/prover/smt/solver/der.ts +38 -10
  190. package/src/prover/smt/solver/diff-neq.ts +205 -0
  191. package/src/prover/smt/solver/distribute-forall.ts +57 -0
  192. package/src/prover/smt/solver/dom-simplify.ts +511 -0
  193. package/src/prover/smt/solver/dt2bv-tactic.ts +260 -0
  194. package/src/prover/smt/solver/dyn-ack.ts +0 -1
  195. package/src/prover/smt/solver/e-matching.ts +6 -7
  196. package/src/prover/smt/solver/elim-small-bv-tactic.ts +129 -0
  197. package/src/prover/smt/solver/elim-uncnstr.ts +542 -0
  198. package/src/prover/smt/solver/enode.ts +100 -3
  199. package/src/prover/smt/solver/eq2bv-tactic.ts +218 -0
  200. package/src/prover/smt/solver/euf/arith-axioms.ts +403 -0
  201. package/src/prover/smt/solver/euf/arith-internalize.ts +653 -0
  202. package/src/prover/smt/solver/euf/arith-solver.ts +889 -0
  203. package/src/prover/smt/solver/euf/array-axioms.ts +527 -0
  204. package/src/prover/smt/solver/euf/array-internalize.ts +428 -0
  205. package/src/prover/smt/solver/euf/array-solver.ts +306 -0
  206. package/src/prover/smt/solver/euf/bv-ackerman.ts +162 -0
  207. package/src/prover/smt/solver/euf/bv-internalize.ts +748 -0
  208. package/src/prover/smt/solver/euf/bv-solver.ts +449 -0
  209. package/src/prover/smt/solver/euf/dt-solver.ts +618 -0
  210. package/src/prover/smt/solver/euf/egraph.ts +901 -0
  211. package/src/prover/smt/solver/euf/euf-solver.ts +1204 -0
  212. package/src/prover/smt/solver/euf/fpa-solver.ts +317 -0
  213. package/src/prover/smt/solver/euf/mam.ts +1046 -0
  214. package/src/prover/smt/solver/euf/q-ematch.ts +829 -0
  215. package/src/prover/smt/solver/euf/q-mbi.ts +587 -0
  216. package/src/prover/smt/solver/euf/q-model-fixer.ts +296 -0
  217. package/src/prover/smt/solver/euf/q-solver.ts +361 -0
  218. package/src/prover/smt/solver/euf/th-solver.ts +328 -0
  219. package/src/prover/smt/solver/euf/th-solvers.ts +30 -0
  220. package/src/prover/smt/solver/expr-ref.ts +0 -1
  221. package/src/prover/smt/solver/expr-safe-replace.ts +26 -2
  222. package/src/prover/smt/solver/expr2polynomial.ts +271 -0
  223. package/src/prover/smt/solver/factor.ts +163 -0
  224. package/src/prover/smt/solver/fd-solver.ts +267 -0
  225. package/src/prover/smt/solver/fingerprints.ts +15 -15
  226. package/src/prover/smt/solver/fix-dl-var.ts +147 -0
  227. package/src/prover/smt/solver/flat-literals.ts +0 -1
  228. package/src/prover/smt/solver/fm-tactic.ts +884 -0
  229. package/src/prover/smt/solver/fpa-decl-plugin.ts +618 -0
  230. package/src/prover/smt/solver/fpa-rewriter.ts +639 -0
  231. package/src/prover/smt/solver/fpa2bv-converter.ts +2251 -0
  232. package/src/prover/smt/solver/fpa2bv-rewriter.ts +349 -0
  233. package/src/prover/smt/solver/fpa2bv-tactic.ts +73 -0
  234. package/src/prover/smt/solver/goal.ts +177 -15
  235. package/src/prover/smt/solver/goal2nlsat.ts +216 -0
  236. package/src/prover/smt/solver/guard-set.ts +219 -0
  237. package/src/prover/smt/solver/hash.ts +0 -1
  238. package/src/prover/smt/solver/hashtable.ts +30 -16
  239. package/src/prover/smt/solver/inf-eps.ts +63 -0
  240. package/src/prover/smt/solver/inj-axiom.ts +101 -0
  241. package/src/prover/smt/solver/internalizer.ts +109 -36
  242. package/src/prover/smt/solver/lackr.ts +381 -0
  243. package/src/prover/smt/solver/lbool.ts +0 -1
  244. package/src/prover/smt/solver/lia2card.ts +268 -0
  245. package/src/prover/smt/solver/lia2pb.ts +154 -0
  246. package/src/prover/smt/solver/literal.ts +0 -1
  247. package/src/prover/smt/solver/logic-tactics.ts +345 -0
  248. package/src/prover/smt/solver/lp/bound-propagator.ts +0 -1
  249. package/src/prover/smt/solver/lp/constraints.ts +0 -1
  250. package/src/prover/smt/solver/lp/containers.ts +7 -2
  251. package/src/prover/smt/solver/lp/core-solver.ts +18 -3
  252. package/src/prover/smt/solver/lp/cross-nested.ts +1 -4
  253. package/src/prover/smt/solver/lp/dep-intervals.ts +0 -3
  254. package/src/prover/smt/solver/lp/dependency.ts +0 -2
  255. package/src/prover/smt/solver/lp/dioph-eq.ts +0 -2
  256. package/src/prover/smt/solver/lp/explanation.ts +0 -1
  257. package/src/prover/smt/solver/lp/gomory.ts +0 -1
  258. package/src/prover/smt/solver/lp/hnf-cutter.ts +0 -1
  259. package/src/prover/smt/solver/lp/hnf.ts +0 -3
  260. package/src/prover/smt/solver/lp/int-cube.ts +3 -4
  261. package/src/prover/smt/solver/lp/int-solver.ts +0 -2
  262. package/src/prover/smt/solver/lp/lar-solver.ts +40 -4
  263. package/src/prover/smt/solver/lp/lar-term.ts +0 -1
  264. package/src/prover/smt/solver/lp/lp-settings.ts +0 -1
  265. package/src/prover/smt/solver/lp/maximize-term.ts +59 -10
  266. package/src/prover/smt/solver/lp/nex-creator.ts +3 -3
  267. package/src/prover/smt/solver/lp/nex.ts +2 -2
  268. package/src/prover/smt/solver/lp/nla-backoff.ts +0 -2
  269. package/src/prover/smt/solver/lp/nla-basics.ts +46 -3
  270. package/src/prover/smt/solver/lp/nla-core.ts +66 -11
  271. package/src/prover/smt/solver/lp/nla-divisions.ts +0 -2
  272. package/src/prover/smt/solver/lp/nla-emonics.ts +0 -1
  273. package/src/prover/smt/solver/lp/nla-factorization.ts +0 -1
  274. package/src/prover/smt/solver/lp/nla-grobner.ts +167 -85
  275. package/src/prover/smt/solver/lp/nla-horner.ts +0 -2
  276. package/src/prover/smt/solver/lp/nla-intervals.ts +0 -1
  277. package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +0 -2
  278. package/src/prover/smt/solver/lp/nla-monotone.ts +0 -1
  279. package/src/prover/smt/solver/lp/nla-order.ts +0 -2
  280. package/src/prover/smt/solver/lp/nla-patcher.ts +0 -1
  281. package/src/prover/smt/solver/lp/nla-powers.ts +220 -0
  282. package/src/prover/smt/solver/lp/nla-tangents.ts +0 -2
  283. package/src/prover/smt/solver/lp/nla-throttle.ts +0 -1
  284. package/src/prover/smt/solver/lp/nla-transcendentals.ts +324 -0
  285. package/src/prover/smt/solver/lp/nla-types.ts +0 -2
  286. package/src/prover/smt/solver/lp/nla-var-eqs.ts +0 -1
  287. package/src/prover/smt/solver/lp/nra-solver.ts +163 -99
  288. package/src/prover/smt/solver/lp/numeric-pair.ts +0 -1
  289. package/src/prover/smt/solver/lp/pdd-interval.ts +6 -3
  290. package/src/prover/smt/solver/lp/pdd-simplifier.ts +60 -21
  291. package/src/prover/smt/solver/lp/pdd-solver.ts +72 -41
  292. package/src/prover/smt/solver/lp/pdd.ts +725 -290
  293. package/src/prover/smt/solver/lp/random-updater.ts +0 -2
  294. package/src/prover/smt/solver/lp/static-matrix.ts +0 -1
  295. package/src/prover/smt/solver/lp/union-find.ts +7 -2
  296. package/src/prover/smt/solver/macro-finder.ts +530 -0
  297. package/src/prover/smt/solver/mam-compiler.ts +118 -88
  298. package/src/prover/smt/solver/mam-interpreter.ts +0 -1
  299. package/src/prover/smt/solver/max-bv-sharing-tactic.ts +17 -0
  300. package/src/prover/smt/solver/max-cliques.ts +105 -0
  301. package/src/prover/smt/solver/maxcore.ts +309 -0
  302. package/src/prover/smt/solver/maximize-ac-sharing.ts +8 -6
  303. package/src/prover/smt/solver/maxlex.ts +115 -0
  304. package/src/prover/smt/solver/maxsmt-base.ts +105 -0
  305. package/src/prover/smt/solver/maxsmt.ts +92 -0
  306. package/src/prover/smt/solver/mbp/mbp-arith.ts +467 -0
  307. package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +101 -0
  308. package/src/prover/smt/solver/mbp/mbp-plugin.ts +287 -0
  309. package/src/prover/smt/solver/mbp/mbp-qel.ts +48 -0
  310. package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +271 -0
  311. package/src/prover/smt/solver/mbp/mbp-term-graph.ts +606 -0
  312. package/src/prover/smt/solver/model-based-opt.ts +844 -0
  313. package/src/prover/smt/solver/model-checker.ts +17 -26
  314. package/src/prover/smt/solver/model-evaluator.ts +188 -12
  315. package/src/prover/smt/solver/model-finder.ts +0 -1
  316. package/src/prover/smt/solver/model-generator.ts +59 -30
  317. package/src/prover/smt/solver/model-macro-solver.ts +38 -27
  318. package/src/prover/smt/solver/model-printer.ts +214 -0
  319. package/src/prover/smt/solver/mpf.ts +709 -0
  320. package/src/prover/smt/solver/mus.ts +50 -0
  321. package/src/prover/smt/solver/muz/dl-context.ts +410 -0
  322. package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +97 -0
  323. package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +167 -0
  324. package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +125 -0
  325. package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +299 -0
  326. package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +455 -0
  327. package/src/prover/smt/solver/muz/dl-mk-slice.ts +340 -0
  328. package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +163 -0
  329. package/src/prover/smt/solver/muz/dl-rule-set.ts +273 -0
  330. package/src/prover/smt/solver/muz/dl-rule-transformer.ts +123 -0
  331. package/src/prover/smt/solver/muz/dl-rule.ts +496 -0
  332. package/src/prover/smt/solver/muz/hnf.ts +201 -0
  333. package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +176 -0
  334. package/src/prover/smt/solver/muz/horn-tactic.ts +201 -0
  335. package/src/prover/smt/solver/muz/rule-properties.ts +337 -0
  336. package/src/prover/smt/solver/muz/spacer-context.ts +1404 -0
  337. package/src/prover/smt/solver/muz/spacer-dl-interface.ts +52 -0
  338. package/src/prover/smt/solver/muz/spacer-generalizers.ts +241 -0
  339. package/src/prover/smt/solver/muz/spacer-manager.ts +127 -0
  340. package/src/prover/smt/solver/muz/spacer-pdr.ts +219 -0
  341. package/src/prover/smt/solver/muz/spacer-prop-solver.ts +333 -0
  342. package/src/prover/smt/solver/muz/spacer-util.ts +282 -0
  343. package/src/prover/smt/solver/muz/substitution.ts +203 -0
  344. package/src/prover/smt/solver/nla2bv-tactic.ts +285 -0
  345. package/src/prover/smt/solver/nlqsat.ts +484 -0
  346. package/src/prover/smt/solver/nlsat/algebraic.ts +305 -88
  347. package/src/prover/smt/solver/nlsat/atoms.ts +52 -35
  348. package/src/prover/smt/solver/nlsat/evaluator.ts +0 -1
  349. package/src/prover/smt/solver/nlsat/explain.ts +424 -211
  350. package/src/prover/smt/solver/nlsat/interval-set.ts +1 -2
  351. package/src/prover/smt/solver/nlsat/levelwise.ts +460 -241
  352. package/src/prover/smt/solver/nlsat/mpbq.ts +45 -1
  353. package/src/prover/smt/solver/nlsat/polynomial.ts +2366 -683
  354. package/src/prover/smt/solver/nlsat/solver.ts +282 -69
  355. package/src/prover/smt/solver/nlsat/transcendental-eval.ts +310 -0
  356. package/src/prover/smt/solver/nlsat/transcendentals.ts +391 -0
  357. package/src/prover/smt/solver/nlsat/types.ts +0 -2
  358. package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +8 -7
  359. package/src/prover/smt/solver/nlsat/upolynomial.ts +41 -20
  360. package/src/prover/smt/solver/nlsat-tactic.ts +82 -0
  361. package/src/prover/smt/solver/nnf.ts +105 -23
  362. package/src/prover/smt/solver/normalize-bounds.ts +53 -0
  363. package/src/prover/smt/solver/occf.ts +97 -0
  364. package/src/prover/smt/solver/opt-context.ts +792 -0
  365. package/src/prover/smt/solver/opt-nlsat.ts +386 -0
  366. package/src/prover/smt/solver/opt-pareto.ts +282 -0
  367. package/src/prover/smt/solver/opt-preprocess.ts +101 -0
  368. package/src/prover/smt/solver/opt-solver.ts +311 -0
  369. package/src/prover/smt/solver/opt-value.ts +55 -0
  370. package/src/prover/smt/solver/optsmt.ts +692 -0
  371. package/src/prover/smt/solver/parallel-tactic.ts +299 -0
  372. package/src/prover/smt/solver/pattern-inference.ts +19 -11
  373. package/src/prover/smt/solver/pb-rewriter.ts +281 -0
  374. package/src/prover/smt/solver/pb2bv-tactic.ts +540 -0
  375. package/src/prover/smt/solver/poly-rewriter.ts +202 -57
  376. package/src/prover/smt/solver/probes.ts +511 -0
  377. package/src/prover/smt/solver/propagate-values.ts +37 -21
  378. package/src/prover/smt/solver/proto-model.ts +650 -17
  379. package/src/prover/smt/solver/pull-quant.ts +28 -12
  380. package/src/prover/smt/solver/purify-arith.ts +632 -0
  381. package/src/prover/smt/solver/qe-arith-plugin.ts +1096 -0
  382. package/src/prover/smt/solver/qe-lite-der.ts +2 -3
  383. package/src/prover/smt/solver/qe-lite-fm.ts +3 -4
  384. package/src/prover/smt/solver/qe-lite.ts +37 -17
  385. package/src/prover/smt/solver/qe-mbp.ts +270 -0
  386. package/src/prover/smt/solver/qe.ts +1499 -0
  387. package/src/prover/smt/solver/qel.ts +25 -0
  388. package/src/prover/smt/solver/qi-queue.ts +0 -1
  389. package/src/prover/smt/solver/qsat.ts +814 -0
  390. package/src/prover/smt/solver/quant-hoist.ts +196 -0
  391. package/src/prover/smt/solver/quant-tactics.ts +16 -56
  392. package/src/prover/smt/solver/quantifier-analyzer.ts +9 -10
  393. package/src/prover/smt/solver/quantifier-manager.ts +25 -24
  394. package/src/prover/smt/solver/quasi-macros.ts +243 -0
  395. package/src/prover/smt/solver/random-gen.ts +0 -1
  396. package/src/prover/smt/solver/rational.ts +45 -1
  397. package/src/prover/smt/solver/recfun-decl-plugin.ts +262 -0
  398. package/src/prover/smt/solver/recfun-rewriter.ts +107 -0
  399. package/src/prover/smt/solver/reduce-args.ts +225 -0
  400. package/src/prover/smt/solver/reduce-bv-size.ts +119 -0
  401. package/src/prover/smt/solver/ref-vector.ts +0 -1
  402. package/src/prover/smt/solver/relevancy.ts +1 -2
  403. package/src/prover/smt/solver/rewriter-tpl.ts +77 -10
  404. package/src/prover/smt/solver/rewriter.ts +475 -36
  405. package/src/prover/smt/solver/rlimit.ts +38 -2
  406. package/src/prover/smt/solver/sat/asymm-branch.ts +325 -0
  407. package/src/prover/smt/solver/sat/big.ts +177 -0
  408. package/src/prover/smt/solver/sat/clause-use-list.ts +71 -0
  409. package/src/prover/smt/solver/sat/clause.ts +203 -0
  410. package/src/prover/smt/solver/sat/cleaner.ts +94 -0
  411. package/src/prover/smt/solver/sat/config.ts +122 -0
  412. package/src/prover/smt/solver/sat/consequences.ts +203 -0
  413. package/src/prover/smt/solver/sat/elim-eqs.ts +142 -0
  414. package/src/prover/smt/solver/sat/goal2sat.ts +526 -0
  415. package/src/prover/smt/solver/sat/inc-sat-solver.ts +378 -0
  416. package/src/prover/smt/solver/sat/model-converter.ts +136 -0
  417. package/src/prover/smt/solver/sat/pb-constraint.ts +261 -0
  418. package/src/prover/smt/solver/sat/pb-solver.ts +1577 -0
  419. package/src/prover/smt/solver/sat/probing.ts +170 -0
  420. package/src/prover/smt/solver/sat/sat-tactic.ts +44 -0
  421. package/src/prover/smt/solver/sat/sat2goal.ts +165 -0
  422. package/src/prover/smt/solver/sat/scc.ts +142 -0
  423. package/src/prover/smt/solver/sat/simplifier.ts +1618 -0
  424. package/src/prover/smt/solver/sat/solver.ts +2105 -0
  425. package/src/prover/smt/solver/sat/var-queue.ts +117 -0
  426. package/src/prover/smt/solver/sat/watch-list.ts +140 -0
  427. package/src/prover/smt/solver/search-tree.ts +284 -0
  428. package/src/prover/smt/solver/seq-axioms.ts +995 -0
  429. package/src/prover/smt/solver/seq-decl-plugin.ts +819 -0
  430. package/src/prover/smt/solver/seq-derive.ts +1298 -0
  431. package/src/prover/smt/solver/seq-eq-approx.ts +236 -0
  432. package/src/prover/smt/solver/seq-eq-solver.ts +439 -0
  433. package/src/prover/smt/solver/seq-factory.ts +89 -0
  434. package/src/prover/smt/solver/seq-monadic.ts +730 -0
  435. package/src/prover/smt/solver/seq-range-predicate.ts +235 -0
  436. package/src/prover/smt/solver/seq-re-rewriter.ts +1171 -0
  437. package/src/prover/smt/solver/seq-re-util.ts +758 -0
  438. package/src/prover/smt/solver/seq-regex-bisim.ts +144 -0
  439. package/src/prover/smt/solver/seq-regex-live.ts +200 -0
  440. package/src/prover/smt/solver/seq-rewriter.ts +2404 -0
  441. package/src/prover/smt/solver/seq-skolem.ts +294 -0
  442. package/src/prover/smt/solver/seq-subset.ts +165 -0
  443. package/src/prover/smt/solver/seq-view-witness.ts +353 -0
  444. package/src/prover/smt/solver/smt-consequences.ts +297 -0
  445. package/src/prover/smt/solver/smt-kernel.ts +90 -0
  446. package/src/prover/smt/solver/smt-logics.ts +66 -0
  447. package/src/prover/smt/solver/smt-setup.ts +544 -0
  448. package/src/prover/smt/solver/smt2-printer.ts +765 -0
  449. package/src/prover/smt/solver/smtlib-parser.ts +3228 -327
  450. package/src/prover/smt/solver/smtlib-script.ts +1843 -0
  451. package/src/prover/smt/solver/solve-eqs.ts +923 -0
  452. package/src/prover/smt/solver/solver.ts +113 -22
  453. package/src/prover/smt/solver/static-features.ts +314 -0
  454. package/src/prover/smt/solver/sticky-generations.ts +0 -1
  455. package/src/prover/smt/solver/tactic.ts +2012 -0
  456. package/src/prover/smt/solver/term-enumeration.ts +205 -0
  457. package/src/prover/smt/solver/theory-array.ts +1240 -0
  458. package/src/prover/smt/solver/theory-bv.ts +1200 -0
  459. package/src/prover/smt/solver/theory-char.ts +355 -0
  460. package/src/prover/smt/solver/theory-datatype.ts +598 -0
  461. package/src/prover/smt/solver/theory-finite-set.ts +30 -0
  462. package/src/prover/smt/solver/theory-fpa.ts +389 -0
  463. package/src/prover/smt/solver/theory-lra-axioms.ts +53 -2
  464. package/src/prover/smt/solver/theory-lra-bounds.ts +31 -5
  465. package/src/prover/smt/solver/theory-lra-final-check.ts +56 -71
  466. package/src/prover/smt/solver/theory-lra-internalize.ts +89 -11
  467. package/src/prover/smt/solver/theory-lra-model.ts +20 -35
  468. package/src/prover/smt/solver/theory-lra-propagate.ts +24 -28
  469. package/src/prover/smt/solver/theory-lra-state.ts +6 -22
  470. package/src/prover/smt/solver/theory-lra.ts +188 -2
  471. package/src/prover/smt/solver/theory-pb.ts +933 -0
  472. package/src/prover/smt/solver/theory-polymorphism.ts +58 -0
  473. package/src/prover/smt/solver/theory-recfun.ts +307 -0
  474. package/src/prover/smt/solver/theory-seq-regex.ts +867 -0
  475. package/src/prover/smt/solver/theory-seq-solve.ts +1373 -0
  476. package/src/prover/smt/solver/theory-seq-state.ts +852 -0
  477. package/src/prover/smt/solver/theory-seq.ts +961 -0
  478. package/src/prover/smt/solver/theory.ts +189 -0
  479. package/src/prover/smt/solver/tseitin-cnf.ts +485 -0
  480. package/src/prover/smt/solver/var-subst.ts +36 -14
  481. package/src/prover/smt/table.ts +3 -2
  482. package/src/prover/smt/types.ts +146 -0
  483. package/src/prover/tlapm/cache.ts +29 -8
  484. package/src/prover/tlapm-library.ts +3208 -0
  485. package/src/prover/verdict.ts +2 -0
  486. package/src/prover/zenon/decide.ts +10 -7
  487. package/src/prover/zenon/encode.ts +0 -2
  488. package/src/prover/zenon/eqrel.ts +0 -2
  489. package/src/prover/zenon/equality-rules.ts +24 -2
  490. package/src/prover/zenon/expr.ts +21 -2
  491. package/src/prover/zenon/index-table.ts +7 -4
  492. package/src/prover/zenon/isar-case.ts +1 -3
  493. package/src/prover/zenon/isar.ts +2 -4
  494. package/src/prover/zenon/llproof.ts +0 -2
  495. package/src/prover/zenon/mltoll.ts +0 -2
  496. package/src/prover/zenon/node.ts +20 -5
  497. package/src/prover/zenon/parse.ts +6 -2
  498. package/src/prover/zenon/phrase.ts +1 -3
  499. package/src/prover/zenon/proof.ts +0 -2
  500. package/src/prover/zenon/propositional-rules.ts +0 -2
  501. package/src/prover/zenon/rules.ts +2 -3
  502. package/src/prover/zenon/search.ts +7 -5
  503. package/src/prover/zenon/tla/functions.ts +0 -2
  504. package/src/prover/zenon/tla/llproof.ts +0 -2
  505. package/src/prover/zenon/tla/records.ts +0 -2
  506. package/src/prover/zenon/tla/rewrites.ts +0 -2
  507. package/src/prover/zenon/tla/sets.ts +7 -8
  508. package/src/prover/zenon/tla/terms.ts +0 -2
  509. package/src/prover/zenon/tla/tla.ts +0 -2
  510. package/src/resolve.ts +264 -77
  511. package/src/runtime.ts +6 -0
  512. package/src/sany/generation.ts +1 -13
  513. package/src/sany/generator-definitions.ts +2 -1
  514. package/src/sany/generator-expressions.ts +30 -27
  515. package/src/sany/generator-proofs.ts +1 -1
  516. package/src/sany/generator.ts +2 -1
  517. package/src/sany/levels.ts +0 -2
  518. package/src/sany/linter.ts +0 -2
  519. package/src/sany/nodes.ts +1 -1
  520. package/src/sany/selectors.ts +6 -5
  521. package/src/search.ts +209 -56
  522. package/src/simulate.ts +3 -0
  523. package/src/spec-description.ts +2 -2
  524. package/src/standard-definitions.ts +4 -0
  525. package/src/state-graph.ts +0 -2
  526. package/src/subexpressions.ts +165 -78
  527. package/src/successors.ts +2 -1
  528. package/src/symmetry.ts +2 -2
  529. package/src/tableau.ts +2 -2
  530. package/src/tlc/fingerprint.ts +81 -9
  531. package/src/tlc/jar-data.ts +12 -0
  532. package/src/tlc/order.ts +14 -3
  533. package/src/tlc/summary.ts +29 -14
  534. package/src/tlc/tlcext-operators.ts +61 -16
  535. package/src/tlc/trace-spec.ts +2 -3
  536. package/src/typed-tier.ts +6541 -0
  537. package/src/typescript/types.ts +2 -2
  538. package/src/values.ts +42 -23
  539. package/src/prover/isabelle/isar/statement.ts +0 -52
  540. package/src/prover/smt/solver/z3-license.txt +0 -10
  541. package/src/prover/tlaps-module.ts +0 -510
  542. package/src/prover/zenon/LICENSE +0 -32
@@ -0,0 +1,331 @@
1
+ import { TlaIsabelleError } from "../../../errors";
2
+ import { typargsOf } from "../pure/consts";
3
+ import { zeroVarIndexes } from "../pure/drule";
4
+ import type { Limits } from "../pure/interrupt";
5
+ import { destEquals, mkEquals } from "../pure/logic";
6
+ import { seqHead } from "../pure/seq";
7
+ import { normHhfProtect } from "../pure/simplifier";
8
+ import {
9
+ abstractOver,
10
+ aconv,
11
+ addFreeNames,
12
+ existsSubterm,
13
+ mkAbs,
14
+ mkConst,
15
+ stripComb,
16
+ type Term,
17
+ type Typ,
18
+ } from "../pure/term";
19
+ import {
20
+ axiomThm,
21
+ betaConversion,
22
+ combination,
23
+ generalize,
24
+ reflexive,
25
+ transitive,
26
+ type Thm,
27
+ } from "../pure/thm";
28
+ import { getLogicFact, getProofContext } from "../tla/context";
29
+ import type { ConstInfo, TlaLogic } from "../tla/logic";
30
+ import { applyAttributes, getThms } from "./attrib";
31
+ import {
32
+ addAssumptions,
33
+ addFixes,
34
+ augment,
35
+ exportThm,
36
+ getFact,
37
+ putFacts,
38
+ type IsarContext,
39
+ } from "./context";
40
+ import { parseType } from "./inner-syntax";
41
+ import { metaRewriteConv, type ProofContext } from "./method";
42
+ import {
43
+ assume,
44
+ chain,
45
+ collect,
46
+ contextOf,
47
+ fix,
48
+ from,
49
+ have,
50
+ invokeCase,
51
+ isFinished,
52
+ next,
53
+ proof,
54
+ qed,
55
+ readStatement,
56
+ show,
57
+ terminalProof,
58
+ theorem,
59
+ unfolding,
60
+ using,
61
+ type State,
62
+ } from "./proof";
63
+ import type { Command, FactReference, TheoryText } from "./theory";
64
+
65
+ type Free = Extract<Term, { kind: "Free" }>;
66
+
67
+ const error = (message: string) => new TlaIsabelleError("ERROR", message);
68
+
69
+ interface Theory {
70
+ readonly name: string;
71
+ readonly consts: ReadonlyMap<string, ConstInfo>;
72
+ readonly constNames: ReadonlyMap<string, string>;
73
+ readonly facts: ReadonlyMap<string, readonly Thm[]>;
74
+ readonly tactics: ProofContext;
75
+ }
76
+
77
+ const initContext = (logic: TlaLogic, theory: Theory): IsarContext => ({
78
+ scope: { consts: theory.consts, constNames: theory.constNames },
79
+ getGlobalFact: (name) => theory.facts.get(name) ?? getLogicFact(logic, name),
80
+ tactics: theory.tactics,
81
+ fixes: [],
82
+ types: new Map(),
83
+ assumptions: [],
84
+ facts: new Map(),
85
+ binds: new Map(),
86
+ calculation: undefined,
87
+ isBody: false,
88
+ cases: new Map(),
89
+ });
90
+
91
+ const addConst = (theory: Theory, base: string, type: Typ): Theory => {
92
+ const name = `${theory.name}.${base}`;
93
+ const info: ConstInfo = { type, typargs: typargsOf(type), abbreviation: undefined };
94
+ return {
95
+ ...theory,
96
+ consts: new Map([...theory.consts, [name, info]]),
97
+ constNames: new Map([...theory.constNames, [base, name]]),
98
+ };
99
+ };
100
+
101
+ interface NamedFact {
102
+ readonly name: string;
103
+ readonly thms: readonly Thm[];
104
+ }
105
+
106
+ const putTheoryFacts = (theory: Theory, name: string, thms: readonly Thm[]): Theory => ({
107
+ ...theory,
108
+ facts: new Map([...theory.facts, [name, thms]]),
109
+ });
110
+
111
+ // Primitive_Defs.dest_def: the head is new and its arguments are distinct variables, the only free
112
+ // variables of the right-hand side.
113
+ const destDef = (prop: Term): [Free, Free[], Term] => {
114
+ const [lhs, rhs] = destEquals(prop);
115
+ const [head, args] = stripComb(lhs);
116
+ if (head.kind !== "Free") throw error("Bad head of lhs: existing constant");
117
+ const frees = args.filter((arg): arg is Free => arg.kind === "Free");
118
+ if (
119
+ frees.length < args.length ||
120
+ frees.some((arg, index) => frees.slice(0, index).some((other) => aconv(other, arg)))
121
+ )
122
+ throw error("Arguments of lhs must be distinct free variables");
123
+ if (existsSubterm((term) => aconv(term, head), rhs))
124
+ throw error("Entity to be defined occurs on rhs");
125
+ if (addFreeNames(rhs, []).some((name) => !frees.some((arg) => arg.name === name)))
126
+ throw error("Extra variables on rhs");
127
+ return [head, frees, rhs];
128
+ };
129
+
130
+ // Specification.definition: the head becomes a constant, whose definitional axiom proves the
131
+ // equation as stated.
132
+ const define = (
133
+ theory: Theory,
134
+ context: IsarContext,
135
+ command: Extract<Command, { kind: "definition" }>,
136
+ ): Theory => {
137
+ const [prop] = readStatement(
138
+ command.name === undefined || command.type === undefined
139
+ ? context
140
+ : {
141
+ ...context,
142
+ types: new Map([...context.types, [command.name, parseType(command.type)]]),
143
+ },
144
+ [command.part],
145
+ "default",
146
+ ).props.flat();
147
+ const [head, args, rhs] = destDef(destEquals(metaRewriteConv(theory.tactics, prop).prop)[1]);
148
+ if (command.name !== undefined && command.name !== head.name)
149
+ throw error(`Head of definition ${head.name} differs from declaration ${command.name}`);
150
+ const axiom = axiomThm(
151
+ mkEquals(
152
+ mkConst(`${theory.name}.${head.name}`, head.type),
153
+ args.reduceRight((body, arg) => mkAbs(arg.name, arg.type, abstractOver(arg, body)), rhs),
154
+ ),
155
+ );
156
+ const applied = args.reduce((thm, arg) => {
157
+ const combined = combination(thm, reflexive(arg));
158
+ return transitive(combined, betaConversion(false, destEquals(combined.prop)[1]));
159
+ }, axiom);
160
+ const generalized = generalize(
161
+ args.map((arg) => arg.name),
162
+ applied.maxidx + 1,
163
+ applied,
164
+ );
165
+ const [declared, thms] = applyAttributes(context, command.part.attributes, [
166
+ zeroVarIndexes(generalized),
167
+ ]);
168
+ return putTheoryFacts(
169
+ { ...addConst(theory, head.name, head.type), tactics: declared.tactics },
170
+ command.part.name ?? `${head.name}_def`,
171
+ thms,
172
+ );
173
+ };
174
+
175
+ // Specification.theorems: the declarations of each fact's attributes, whose results it drops.
176
+ const declare = (context: IsarContext, references: readonly FactReference[]): ProofContext =>
177
+ references.reduce(
178
+ (current, reference) =>
179
+ applyAttributes(current, reference.attributes, getFact(current, reference.name))[0],
180
+ context,
181
+ ).tactics;
182
+
183
+ // Specification.theorem: the statement's elements, then the goal whose results the theory keeps.
184
+ const startTheorem = (
185
+ outer: IsarContext,
186
+ command: Extract<Command, { kind: "theorem" }>,
187
+ store: (tactics: ProofContext, facts: readonly NamedFact[]) => void,
188
+ ): State => {
189
+ const fixed = command.elements.reduce((context, element) => {
190
+ if (element.kind !== "fixes") return context;
191
+ const types = new Map(context.types);
192
+ for (const variable of element.variables)
193
+ if (variable.type !== undefined) types.set(variable.name, parseType(variable.type));
194
+ return addFixes(
195
+ { ...context, types },
196
+ element.variables.map((variable) => variable.name),
197
+ );
198
+ }, outer);
199
+ const assumes = command.elements.flatMap((element) =>
200
+ element.kind === "assumes" ? element.parts : [],
201
+ );
202
+ const statement = readStatement(fixed, [...assumes, ...command.shows], "schematic");
203
+ const assumeProps = statement.props.slice(0, assumes.length);
204
+ const showProps = statement.props.slice(assumes.length).flat();
205
+ const [prems, assumed] = addAssumptions(
206
+ assumeProps.flat().reduce(augment, statement.context),
207
+ false,
208
+ assumeProps.flat(),
209
+ );
210
+ let offset = 0;
211
+ const named = assumes.reduce((context, part, index) => {
212
+ const [declared, group] = applyAttributes(
213
+ context,
214
+ part.attributes,
215
+ prems.slice(offset, offset + assumeProps[index].length),
216
+ );
217
+ offset += assumeProps[index].length;
218
+ return part.name === undefined ? declared : putFacts(declared, part.name, group);
219
+ }, assumed);
220
+ const elementsContext =
221
+ prems.length === 0 ? named : putFacts(named, command.isLong ? "assms" : "that", prems);
222
+ const goalContext = showProps.reduce(augment, elementsContext);
223
+ if (showProps.length !== 1) throw error("Unsupported theorem of several propositions");
224
+ return theorem(goalContext, showProps, (resultContext, results) => {
225
+ const normalized = results.map((result) =>
226
+ zeroVarIndexes(
227
+ normHhfProtect(outer.tactics.limits, exportThm(resultContext, outer, false, result)),
228
+ ),
229
+ );
230
+ const part = command.shows[0];
231
+ const [notedContext, noted] = applyAttributes(outer, part.attributes, normalized);
232
+ const [namedContext, named] = applyAttributes(notedContext, command.attributes, noted);
233
+ store(namedContext.tactics, [
234
+ ...(part.name === undefined ? [] : [{ name: part.name, thms: noted }]),
235
+ ...(command.name === undefined ? [] : [{ name: command.name, thms: named }]),
236
+ ]);
237
+ });
238
+ };
239
+
240
+ const proofCommand = (state: State, command: Command): State => {
241
+ switch (command.kind) {
242
+ case "proof": {
243
+ const result = seqHead(proof(state, command.method));
244
+ if (result === undefined) throw error("Failed to apply initial proof method");
245
+ return result;
246
+ }
247
+ case "qed":
248
+ return qed(state, command.method);
249
+ case "by":
250
+ return terminalProof(state, command.initial, command.terminal);
251
+ case "next":
252
+ return next(state);
253
+ case "then":
254
+ return chain(state);
255
+ case "goal": {
256
+ const chained =
257
+ command.command === "hence" || command.command === "thus" ? chain(state) : state;
258
+ return command.command === "have" || command.command === "hence"
259
+ ? have(chained, command.parts)
260
+ : show(chained, command.parts);
261
+ }
262
+ case "assume":
263
+ return assume(state, command.parts);
264
+ case "fix":
265
+ return fix(state, command.variables);
266
+ case "case":
267
+ return invokeCase(state, command.binding, command.name, command.params);
268
+ case "moreover":
269
+ case "ultimately":
270
+ return collect(state, command.kind === "ultimately");
271
+ case "facts": {
272
+ const facts = getThms(contextOf(state), command.facts);
273
+ switch (command.command) {
274
+ case "from":
275
+ return from(state, facts, false);
276
+ case "with":
277
+ return from(state, facts, true);
278
+ case "using":
279
+ return using(state, facts);
280
+ case "unfolding":
281
+ return unfolding(state, facts);
282
+ }
283
+ }
284
+ default:
285
+ throw error(`Unsupported proof command: ${command.kind}`);
286
+ }
287
+ };
288
+
289
+ // Thy_Info.use_thy: the theory fails at its first failing command.
290
+ export const runTheory = (logic: TlaLogic, text: TheoryText, limits: Limits) => {
291
+ let theory: Theory = {
292
+ name: text.name,
293
+ consts: logic.consts,
294
+ constNames: logic.constNames,
295
+ facts: new Map(),
296
+ tactics: getProofContext(logic, limits),
297
+ };
298
+ let state: State | undefined;
299
+ for (const command of text.commands) {
300
+ if (state !== undefined) {
301
+ state = proofCommand(state, command);
302
+ if (isFinished(state)) state = undefined;
303
+ continue;
304
+ }
305
+ switch (command.kind) {
306
+ case "consts":
307
+ theory = command.consts.reduce(
308
+ (current, constant) => addConst(current, constant.name, parseType(constant.type)),
309
+ theory,
310
+ );
311
+ break;
312
+ case "definition":
313
+ theory = define(theory, initContext(logic, theory), command);
314
+ break;
315
+ case "declare":
316
+ theory = { ...theory, tactics: declare(initContext(logic, theory), command.facts) };
317
+ break;
318
+ case "theorem":
319
+ state = startTheorem(initContext(logic, theory), command, (tactics, facts) => {
320
+ theory = facts.reduce((current, fact) => putTheoryFacts(current, fact.name, fact.thms), {
321
+ ...theory,
322
+ tactics,
323
+ });
324
+ });
325
+ break;
326
+ default:
327
+ throw error(`Unsupported theory command: ${command.kind}`);
328
+ }
329
+ }
330
+ if (state !== undefined) throw error("Unfinished proof at end of theory");
331
+ };
@@ -1,5 +1,3 @@
1
- // Ported from Isabelle2025's Pure/type_infer_context.ML, Pure/type_infer.ML and Pure/consts.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 { bumpString } from "../pure/name";
5
3
  import {
@@ -15,6 +13,8 @@ import {
15
13
  mkTFree,
16
14
  mkTVar,
17
15
  mkType,
16
+ mkVar,
17
+ existsSubterm,
18
18
  mapTypes,
19
19
  stripComb,
20
20
  type Term,
@@ -33,12 +33,25 @@ interface NameScope {
33
33
  export interface PropToCheck {
34
34
  readonly ast: Ast;
35
35
  readonly fixed: ReadonlySet<string>;
36
+ // The type the term must have, a proposition unless given.
37
+ readonly type?: Typ;
38
+ }
39
+
40
+ export interface CheckOptions {
41
+ readonly fixedTypes: ReadonlyMap<string, Typ>;
42
+ // The types of the schematic variables a term binding gives, Variable.def_type.
43
+ readonly varTypes?: (name: string, index: number) => Typ | undefined;
44
+ // Proof_Context.mode_pattern: dummies and open type parameters become schematic.
45
+ readonly isPattern?: boolean;
36
46
  }
37
47
 
38
48
  interface Inference {
39
49
  readonly substitution: Map<number, Typ>;
40
50
  readonly freeTypes: Map<string, Typ>;
51
+ readonly varTypes: Map<string, Typ>;
52
+ readonly getVarType: (name: string, index: number) => Typ | undefined;
41
53
  nextParam: number;
54
+ nextDummy: number;
42
55
  }
43
56
 
44
57
  const createParam = (inference: Inference) => {
@@ -126,6 +139,19 @@ const instantiateScheme = (inference: Inference, type: Typ) => {
126
139
  return instantiate(type);
127
140
  };
128
141
 
142
+ // Type.mark_polymorphic: each use of a term binding instantiates its type variables afresh.
143
+ const instantiateTVars = (inference: Inference, type: Typ, params = new Map<string, Typ>()) => {
144
+ const instantiate = (current: Typ): Typ => {
145
+ if (current.kind === "Type") return mkType(current.name, current.args.map(instantiate));
146
+ if (current.kind === "TFree") return current;
147
+ const key = `${current.name}.${current.index}`;
148
+ const param = params.get(key) ?? createParam(inference);
149
+ params.set(key, param);
150
+ return param;
151
+ };
152
+ return instantiate(type);
153
+ };
154
+
129
155
  const getConstType = (scope: NameScope, name: string) => {
130
156
  const info = scope.consts.get(name);
131
157
  if (info === undefined) throw new TlaIsabelleError("ERROR", `Undeclared constant: ${name}`);
@@ -157,6 +183,21 @@ const elaborate = (
157
183
  const type = instantiateScheme(inference, getConstType(scope, ast.name));
158
184
  return [mkConst(ast.name, type), type];
159
185
  }
186
+ case "var": {
187
+ const key = `${ast.name}.${ast.index}`;
188
+ const known = inference.varTypes.get(key);
189
+ const bound = known === undefined ? inference.getVarType(ast.name, ast.index) : undefined;
190
+ const type =
191
+ known ??
192
+ (bound === undefined ? createParam(inference) : instantiateTVars(inference, bound));
193
+ inference.varTypes.set(key, type);
194
+ return [mkVar(ast.name, ast.index, type), type];
195
+ }
196
+ case "dummy": {
197
+ const type = createParam(inference);
198
+ inference.nextDummy += 1;
199
+ return [mkVar("_dummy_", inference.nextDummy, type), type];
200
+ }
160
201
  case "app": {
161
202
  const [fun, funType] = elaborate(scope, inference, fixed, bound, ast.fun);
162
203
  const [arg, argType] = elaborate(scope, inference, fixed, bound, ast.arg);
@@ -219,13 +260,37 @@ const expandAbbreviations = (scope: NameScope, term: Term): Term => {
219
260
  );
220
261
  };
221
262
 
222
- export const checkProps = (scope: NameScope, props: readonly PropToCheck[]): Term[] => {
223
- const inference: Inference = { substitution: new Map(), freeTypes: new Map(), nextParam: 0 };
263
+ export const checkProps = (
264
+ scope: NameScope,
265
+ props: readonly PropToCheck[],
266
+ options: CheckOptions,
267
+ ): Term[] => {
268
+ const inference: Inference = {
269
+ substitution: new Map(),
270
+ freeTypes: new Map(options.fixedTypes),
271
+ varTypes: new Map(),
272
+ getVarType: options.varTypes ?? (() => undefined),
273
+ nextParam: 0,
274
+ nextDummy: 0,
275
+ };
276
+ // Type_Infer.paramify_vars: the expected types' variables are open, the same in each.
277
+ const expected = new Map<string, Typ>();
224
278
  const elaborated = props.map((prop) => {
225
279
  const [term, type] = elaborate(scope, inference, prop.fixed, [], prop.ast);
226
- unify(inference, type, mkType("prop"));
280
+ unify(
281
+ inference,
282
+ type,
283
+ prop.type === undefined ? mkType("prop") : instantiateTVars(inference, prop.type, expected),
284
+ );
227
285
  return term;
228
286
  });
287
+ if (
288
+ !options.isPattern &&
289
+ elaborated.some((term) =>
290
+ existsSubterm((sub) => sub.kind === "Var" && sub.name === "_dummy_", term),
291
+ )
292
+ )
293
+ throw new TlaIsabelleError("ERROR", "Illegal dummy pattern(s) in term");
229
294
  const expanded = elaborated.map((term) =>
230
295
  expandAbbreviations(
231
296
  scope,
@@ -249,16 +314,26 @@ export const checkProps = (scope: NameScope, props: readonly PropToCheck[]): Ter
249
314
  ),
250
315
  [],
251
316
  );
317
+ const used = new Set<string>();
318
+ for (const type of options.fixedTypes.values())
319
+ foldAtyps(
320
+ (atom, current: Set<string>) => (atom.kind === "TFree" ? current.add(atom.name) : current),
321
+ type,
322
+ used,
323
+ );
324
+ const fresh = (name: string): string => (used.has(name) ? fresh(bumpString(name)) : name);
252
325
  const names = new Map<number, string>();
253
326
  params.reduce((name, param) => {
254
- names.set(param, name);
255
- return bumpString(name);
327
+ names.set(param, fresh(name));
328
+ return bumpString(fresh(name));
256
329
  }, "'a");
257
330
  const fixType = (type: Typ): Typ =>
258
331
  type.kind === "Type"
259
332
  ? mkType(type.name, type.args.map(fixType))
260
333
  : type.kind === "TVar" && isParam(type)
261
- ? mkTFree(names.get(type.index) ?? "'a")
334
+ ? options.isPattern
335
+ ? mkTVar(names.get(type.index) ?? "'a", 0)
336
+ : mkTFree(names.get(type.index) ?? "'a")
262
337
  : type;
263
338
  return expanded.map((term) => mapTypes(fixType, term));
264
339
  };
@@ -1,5 +1,3 @@
1
- // Ported from Isabelle2025's Provers/blast.ML. Copyright (c) 1986-2025 University of Cambridge, Technische Universitaet Muenchen, and contributors, see LICENSE.
2
-
3
1
  import { isIsabelleError, TlaIsabelleError } from "../../../../errors";
4
2
  import { selectGoal } from "../../pure/goal";
5
3
  import { destImplies, isAllAbs, stripParams } from "../../pure/logic";
@@ -1,5 +1,3 @@
1
- // Ported from Isabelle2025's Provers/blast.ML. Copyright (c) 1986-2025 University of Cambridge, Technische Universitaet Muenchen, and contributors, see LICENSE.
2
-
3
1
  import { orElseGoal, thenGoal, type GoalTactic } from "../../pure/tactical";
4
2
  import { assumeTac, eqAssumeTac, ematchTac } from "../../pure/tactic";
5
3
  import {
@@ -1,5 +1,3 @@
1
- // Ported from Isabelle2025's Provers/blast.ML. Copyright (c) 1986-2025 University of Cambridge, Technische Universitaet Muenchen, and contributors, see LICENSE.
2
-
3
1
  import type { Seq } from "../../pure/seq";
4
2
  import type { GoalTactic } from "../../pure/tactical";
5
3
  import { checkInterrupt } from "../../pure/interrupt";
@@ -1,5 +1,3 @@
1
- // Ported from Isabelle2025's Provers/blast.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 { revcutRl, zeroVarIndexes } from "../../pure/drule";
5
3
  import { unifyTermNet } from "../../pure/net";
@@ -1,5 +1,3 @@
1
- // Ported from Isabelle2025's Provers/blast.ML. Copyright (c) 1986-2025 University of Cambridge, Technische Universitaet Muenchen, and contributors, see LICENSE.
2
-
3
1
  import { bumpInit, bumpString } from "../../pure/name";
4
2
  import type { GoalTactic } from "../../pure/tactical";
5
3
  import type { Limits } from "../../pure/interrupt";
@@ -1,5 +1,3 @@
1
- // Ported from Isabelle2025's Provers/blast.ML. Copyright (c) 1986-2025 University of Cambridge, Technische Universitaet Muenchen, and contributors, see LICENSE.
2
-
3
1
  import { typargs, type TypargPosition } from "../../pure/consts";
4
2
  import {
5
3
  dummyT,
@@ -1,5 +1,3 @@
1
- // Ported from Isabelle2025's Provers/clasimp.ML and Pure/tactic.ML. Copyright (c) 1986-2025 University of Cambridge, Technische Universitaet Muenchen, and contributors, see LICENSE.
2
-
3
1
  import { trivForallEquality } from "../pure/drule";
4
2
  import { selectGoal } from "../pure/goal";
5
3
  import { addSimps, emptySimpset, type SimpContext } from "../pure/raw-simplifier";
@@ -93,7 +91,7 @@ const pruneParamsTac = (simp: SimpContext): Tactic => {
93
91
  const empty = { ...simp, simpset: emptySimpset };
94
92
  const context = { ...empty, simpset: addSimps(empty, [trivForallEquality]) };
95
93
  return primitive((state) =>
96
- Array.from({ length: nprems(state) }, (_, offset) => offset + 1).reduce(
94
+ Array.from({ length: nprems(state) }, (_value, offset) => offset + 1).reduce(
97
95
  (current, index) =>
98
96
  gconvRule(
99
97
  (term) =>
@@ -1,5 +1,3 @@
1
- // Ported from Isabelle2025's Provers/classical.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 { revcutRl, thinRl, zeroVarIndexes, makeElim } from "../pure/drule";
5
3
  import { selectGoal } from "../pure/goal";
@@ -7,13 +5,14 @@ import { aconv, sizeOfTerm, type Term } from "../pure/term";
7
5
  import { stripAssumsConcl, stripAssumsHyp } from "../pure/logic";
8
6
  import { listOfSeq, seqHead } from "../pure/seq";
9
7
  import { trade } from "../pure/variable";
10
- import { atomizePremsTac } from "../pure/object-logic";
8
+ import { atomizePremsTac, flatRule } from "../pure/object-logic";
11
9
  import { bestFirst } from "../pure/search";
12
10
  import {
13
11
  allGoals,
14
12
  allTac,
15
13
  appendGoal,
16
14
  condTac,
15
+ depthSolve,
17
16
  firstGoal,
18
17
  firstGoalTac,
19
18
  hasFewerPrems,
@@ -53,6 +52,7 @@ import {
53
52
  type BiresRule,
54
53
  type Thm,
55
54
  } from "../pure/thm";
55
+ import type { ContextRule } from "../tools/intuitionistic";
56
56
 
57
57
  export interface ClassicalRule {
58
58
  readonly rule: Thm;
@@ -78,6 +78,7 @@ export interface Claset {
78
78
  readonly safep: NetPair<TaggedRule>;
79
79
  readonly unsafe: NetPair<TaggedRule>;
80
80
  readonly dup: NetPair<TaggedRule>;
81
+ readonly extra: NetPair<ContextRule>;
81
82
  }
82
83
 
83
84
  export interface ClassicalData {
@@ -167,25 +168,29 @@ const insertRules = (
167
168
  ...intros.map((rule) => ({ isElim: false, rule })),
168
169
  ]).reduceRight((result, tagged) => insertTaggedBrl(tagged, result), netpair);
169
170
 
171
+ // insert' with the default weight of an unsafe rule.
172
+ const insertExtra = (
173
+ counts: readonly [number, number],
174
+ isElim: boolean,
175
+ rule: Thm,
176
+ netpair: NetPair<ContextRule>,
177
+ ) => insertTaggedBrl({ weight: 1, tag: -(counts[0] + counts[1]), isElim, rule }, netpair);
178
+
170
179
  const isMember = (rules: readonly ClassicalRule[], rule: ClassicalRule) =>
171
180
  rules.some((other) => aconv(other.rule.prop, rule.rule.prop));
172
181
 
173
- export const addUnsafeIntro = (context: ClassicalContext, rule: Thm): Claset => {
182
+ export const addUnsafeIntro = (
183
+ context: ClassicalContext,
184
+ rule: Thm,
185
+ atomizeRules: readonly Thm[],
186
+ ): Claset => {
174
187
  const claset = context.claset;
175
- if (
176
- premsOf(rule).some(
177
- (premise) =>
178
- premise.kind === "App" &&
179
- premise.fun.kind === "Const" &&
180
- premise.fun.name.startsWith("Pure."),
181
- )
182
- )
183
- throw new TlaIsabelleError("ERROR", "Rules with meta-level premises are not supported");
184
- const dup = dupIntr(context.data, rule);
188
+ const flat = flatRule(context.limits, atomizeRules, rule);
189
+ const dup = dupIntr(context.data, flat);
185
190
  const entry: ClassicalRule = {
186
191
  rule,
187
- internal: rule,
188
- swapped: swapify(context.data, [rule]),
192
+ internal: flat,
193
+ swapped: swapify(context.data, [flat]),
189
194
  dup,
190
195
  dupSwapped: swapify(context.data, [dup]),
191
196
  };
@@ -196,13 +201,22 @@ export const addUnsafeIntro = (context: ClassicalContext, rule: Thm): Claset =>
196
201
  unsafeIs: [entry, ...claset.unsafeIs],
197
202
  unsafe: insertRules(counts, [entry.internal], entry.swapped, claset.unsafe),
198
203
  dup: insertRules(counts, [entry.dup], entry.dupSwapped, claset.dup),
204
+ extra: insertExtra(counts, false, rule, claset.extra),
199
205
  };
200
206
  };
201
207
 
202
- const addUnsafeElim = (context: ClassicalContext, rule: Thm): Claset => {
208
+ export const addUnsafeElim = (
209
+ context: ClassicalContext,
210
+ rule: Thm,
211
+ atomizeRules: readonly Thm[],
212
+ ): Claset => {
203
213
  const claset = context.claset;
204
214
  if (nprems(rule) < 1) throw new TlaIsabelleError("ERROR", "Ill-formed elimination rule");
205
- const internal = classicalRule(context.data, rule, context.limits);
215
+ const internal = classicalRule(
216
+ context.data,
217
+ flatRule(context.limits, atomizeRules, rule),
218
+ context.limits,
219
+ );
206
220
  const entry: ClassicalRule = {
207
221
  rule,
208
222
  internal,
@@ -217,12 +231,17 @@ const addUnsafeElim = (context: ClassicalContext, rule: Thm): Claset => {
217
231
  unsafeEs: [entry, ...claset.unsafeEs],
218
232
  unsafe: insertRules(counts, [], [entry.internal], claset.unsafe),
219
233
  dup: insertRules(counts, [], [entry.dup], claset.dup),
234
+ extra: insertExtra(counts, true, rule, claset.extra),
220
235
  };
221
236
  };
222
237
 
223
- export const addUnsafeDest = (context: ClassicalContext, rule: Thm): Claset => {
238
+ export const addUnsafeDest = (
239
+ context: ClassicalContext,
240
+ rule: Thm,
241
+ atomizeRules: readonly Thm[],
242
+ ): Claset => {
224
243
  if (nprems(rule) < 1) throw new TlaIsabelleError("ERROR", "Ill-formed destruction rule");
225
- return addUnsafeElim(context, makeElim(rule));
244
+ return addUnsafeElim(context, makeElim(rule), atomizeRules);
226
245
  };
227
246
 
228
247
  const updateWrappers = (wrappers: readonly Wrapper[], wrapper: Wrapper) =>
@@ -348,6 +367,12 @@ const stepTac =
348
367
  appWrappers(context, orElseGoal(instStepTac(context), unsafeStepTac(context)))(index),
349
368
  );
350
369
 
370
+ export const fastTac = (context: ClassicalContext, atomizeRules: readonly Thm[]): GoalTactic =>
371
+ thenGoal(
372
+ atomizePremsTac(context.limits, atomizeRules),
373
+ selectGoal(depthSolve(stepTac(context)(1))),
374
+ );
375
+
351
376
  const sizeOfThm = (thm: Thm) =>
352
377
  thm.tpairs.reduce(
353
378
  (size, pair) => size + 2 + sizeOfTerm(pair[0]) + sizeOfTerm(pair[1]),