tla-ts 0.0.10-dev.b4a856304 → 0.0.10-dev.d618a2d79

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 (586) 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 +37 -0
  8. package/dist/index.d.ts +37 -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 +47 -44
  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 +44 -41
  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 -41
  24. package/src/bags.ts +2 -5
  25. package/src/builtins.ts +5 -21
  26. package/src/check-failure.ts +116 -0
  27. package/src/check-trace.ts +268 -0
  28. package/src/check.ts +474 -718
  29. package/src/cli/options.ts +6 -31
  30. package/src/cli/run.ts +0 -2
  31. package/src/cli/runtime-invariants.ts +8 -7
  32. package/src/cli/shared.ts +1 -5
  33. package/src/cli/tlapm.ts +433 -70
  34. package/src/cli/tlc-arguments.ts +244 -238
  35. package/src/cli/tlc-output.ts +687 -0
  36. package/src/cli/tlc-usage.ts +3 -5
  37. package/src/cli/tlc.ts +49 -702
  38. package/src/cli/xml-exporter.ts +23 -33
  39. package/src/codegen.ts +5 -10
  40. package/src/coverage.ts +3 -10
  41. package/src/dependencies.ts +30 -14
  42. package/src/dfid.ts +16 -16
  43. package/src/environment-config.ts +315 -0
  44. package/src/environment.ts +55 -338
  45. package/src/errors.ts +33 -5
  46. package/src/evaluate.ts +31 -106
  47. package/src/exit-codes.ts +2 -0
  48. package/src/fingerprints.ts +65 -1
  49. package/src/instances.ts +47 -10
  50. package/src/java-hash.ts +7 -0
  51. package/src/java-overrides.ts +4 -9
  52. package/src/json-reader.ts +1 -2
  53. package/src/json.ts +8 -18
  54. package/src/levels.ts +46 -57
  55. package/src/lexer.ts +76 -85
  56. package/src/liveness-checker.ts +616 -306
  57. package/src/liveness.ts +104 -120
  58. package/src/obligations/action.ts +14 -17
  59. package/src/obligations/anonymize.ts +37 -16
  60. package/src/obligations/enabled-axioms.ts +218 -0
  61. package/src/obligations/equality.ts +1 -3
  62. package/src/obligations/expression.ts +36 -8
  63. package/src/obligations/format.ts +0 -2
  64. package/src/obligations/generate.ts +66 -54
  65. package/src/obligations/index.ts +38 -8
  66. package/src/obligations/levels.ts +24 -11
  67. package/src/obligations/module.ts +28 -41
  68. package/src/obligations/normalize.ts +26 -14
  69. package/src/obligations/operators.ts +0 -2
  70. package/src/obligations/pragma.ts +53 -16
  71. package/src/obligations/printer.ts +43 -13
  72. package/src/obligations/proof.ts +3 -2
  73. package/src/obligations/regroup.ts +0 -2
  74. package/src/obligations/simplify.ts +55 -50
  75. package/src/obligations/source.ts +118 -74
  76. package/src/obligations/subexpression.ts +45 -18
  77. package/src/obligations/substitution.ts +1 -3
  78. package/src/obligations/temporal.ts +5 -7
  79. package/src/obligations/tuples.ts +0 -2
  80. package/src/parallel-worker.ts +10 -30
  81. package/src/parallel.ts +50 -80
  82. package/src/parser.ts +722 -385
  83. package/src/pcal/ast.ts +53 -65
  84. package/src/pcal/parse.ts +144 -191
  85. package/src/pcal/tokenize.ts +91 -115
  86. package/src/pcal/translate.ts +83 -98
  87. package/src/pcal/validate.ts +48 -50
  88. package/src/pretty-print.ts +7 -7
  89. package/src/prover/decide-pool.ts +3 -3
  90. package/src/prover/deciders.ts +12 -9
  91. package/src/prover/isabelle/decide.ts +3 -25
  92. package/src/prover/isabelle/encode.ts +72 -42
  93. package/src/prover/isabelle/isar/attrib.ts +250 -0
  94. package/src/prover/isabelle/isar/context.ts +335 -0
  95. package/src/prover/isabelle/isar/induct.ts +382 -0
  96. package/src/prover/isabelle/isar/inner-syntax.ts +158 -7
  97. package/src/prover/isabelle/isar/method.ts +509 -212
  98. package/src/prover/isabelle/isar/proof.ts +570 -14
  99. package/src/prover/isabelle/isar/rule-cases.ts +224 -0
  100. package/src/prover/isabelle/isar/theory.ts +487 -76
  101. package/src/prover/isabelle/isar/toplevel.ts +331 -0
  102. package/src/prover/isabelle/isar/type-check.ts +89 -14
  103. package/src/prover/isabelle/provers/blast/blast.ts +7 -65
  104. package/src/prover/isabelle/provers/blast/branch.ts +0 -2
  105. package/src/prover/isabelle/provers/blast/prove.ts +0 -2
  106. package/src/prover/isabelle/provers/blast/rules.ts +0 -2
  107. package/src/prover/isabelle/provers/blast/state.ts +0 -2
  108. package/src/prover/isabelle/provers/blast/term.ts +0 -2
  109. package/src/prover/isabelle/provers/clasimp.ts +0 -2
  110. package/src/prover/isabelle/provers/classical.ts +45 -20
  111. package/src/prover/isabelle/provers/hypsubst.ts +17 -28
  112. package/src/prover/isabelle/pure/bicompose.ts +9 -27
  113. package/src/prover/isabelle/pure/consts.ts +0 -2
  114. package/src/prover/isabelle/pure/conv.ts +2 -10
  115. package/src/prover/isabelle/pure/drule.ts +72 -6
  116. package/src/prover/isabelle/pure/envir.ts +0 -2
  117. package/src/prover/isabelle/pure/goal.ts +1 -3
  118. package/src/prover/isabelle/pure/logic.ts +1 -3
  119. package/src/prover/isabelle/pure/name.ts +0 -2
  120. package/src/prover/isabelle/pure/net.ts +0 -2
  121. package/src/prover/isabelle/pure/object-logic.ts +13 -7
  122. package/src/prover/isabelle/pure/pattern.ts +0 -2
  123. package/src/prover/isabelle/pure/raw-simplifier.ts +4 -15
  124. package/src/prover/isabelle/pure/rewriter.ts +6 -17
  125. package/src/prover/isabelle/pure/search.ts +0 -2
  126. package/src/prover/isabelle/pure/seq.ts +0 -2
  127. package/src/prover/isabelle/pure/simplifier.ts +26 -7
  128. package/src/prover/isabelle/pure/table.ts +2 -3
  129. package/src/prover/isabelle/pure/tactic.ts +0 -2
  130. package/src/prover/isabelle/pure/tactical.ts +42 -37
  131. package/src/prover/isabelle/pure/term-ord.ts +0 -2
  132. package/src/prover/isabelle/pure/term.ts +0 -2
  133. package/src/prover/isabelle/pure/thm.ts +14 -13
  134. package/src/prover/isabelle/pure/type.ts +0 -2
  135. package/src/prover/isabelle/pure/unify.ts +0 -2
  136. package/src/prover/isabelle/pure/variable.ts +0 -2
  137. package/src/prover/isabelle/tla/classical-setup.ts +18 -16
  138. package/src/prover/isabelle/tla/context.ts +58 -11
  139. package/src/prover/isabelle/tla/logic-data.ts +1 -1
  140. package/src/prover/isabelle/tla/logic.ts +49 -21
  141. package/src/prover/isabelle/tla/simpdata.ts +1 -12
  142. package/src/prover/isabelle/tools/intuitionistic.ts +28 -12
  143. package/src/prover/ocaml.ts +4 -1
  144. package/src/prover/prep/action.ts +30 -31
  145. package/src/prover/prep/enabled-axioms.ts +11 -2
  146. package/src/prover/prep/fingerprint.ts +2 -5
  147. package/src/prover/prep/methods.ts +181 -51
  148. package/src/prover/prep/normalize.ts +38 -9
  149. package/src/prover/prove.ts +395 -94
  150. package/src/prover/ptl/decide.ts +95 -50
  151. package/src/prover/ptl/encode.ts +2 -3
  152. package/src/prover/ptl/tableau.ts +28 -2
  153. package/src/prover/smt/arithmetic.ts +310 -0
  154. package/src/prover/smt/axioms.ts +12 -8
  155. package/src/prover/smt/context.ts +43 -8
  156. package/src/prover/smt/data.ts +498 -379
  157. package/src/prover/smt/encode.ts +148 -57
  158. package/src/prover/smt/extensionality.ts +5 -3
  159. package/src/prover/smt/flatten.ts +4 -6
  160. package/src/prover/smt/format.ts +28 -4
  161. package/src/prover/smt/instances.ts +7 -1
  162. package/src/prover/smt/layout.ts +91 -0
  163. package/src/prover/smt/rewrite.ts +1021 -618
  164. package/src/prover/smt/simplify.ts +441 -0
  165. package/src/prover/smt/solver/ackermannize-bv-tactic.ts +61 -0
  166. package/src/prover/smt/solver/ackr-helper.ts +179 -0
  167. package/src/prover/smt/solver/ackr-model-converter.ts +105 -0
  168. package/src/prover/smt/solver/act-cache.ts +0 -1
  169. package/src/prover/smt/solver/add-bounds-tactic.ts +59 -0
  170. package/src/prover/smt/solver/aig-tactic.ts +52 -0
  171. package/src/prover/smt/solver/aig.ts +889 -0
  172. package/src/prover/smt/solver/arith-rewriter.ts +613 -6
  173. package/src/prover/smt/solver/arith-terms.ts +121 -0
  174. package/src/prover/smt/solver/array-decl-plugin.ts +175 -0
  175. package/src/prover/smt/solver/array-rewriter.ts +309 -0
  176. package/src/prover/smt/solver/asserted-formulas.ts +87 -16
  177. package/src/prover/smt/solver/ast-lt.ts +166 -12
  178. package/src/prover/smt/solver/ast-util.ts +160 -2
  179. package/src/prover/smt/solver/ast.ts +1427 -41
  180. package/src/prover/smt/solver/auf-solver.ts +2 -6
  181. package/src/prover/smt/solver/bit-blast-tactic.ts +582 -0
  182. package/src/prover/smt/solver/bit-blaster.ts +871 -0
  183. package/src/prover/smt/solver/bound-manager.ts +196 -0
  184. package/src/prover/smt/solver/bound-simplifier.ts +600 -0
  185. package/src/prover/smt/solver/bv-bound-chk.ts +492 -0
  186. package/src/prover/smt/solver/bv-decl-plugin.ts +338 -0
  187. package/src/prover/smt/solver/bv-divrem-bounds.ts +95 -0
  188. package/src/prover/smt/solver/bv-rewriter.ts +1901 -0
  189. package/src/prover/smt/solver/bv1-blast.ts +214 -0
  190. package/src/prover/smt/solver/bv2fpa-converter.ts +174 -0
  191. package/src/prover/smt/solver/bv2int-rewriter.ts +544 -0
  192. package/src/prover/smt/solver/bv2real-rewriter.ts +533 -0
  193. package/src/prover/smt/solver/card2bv.ts +110 -0
  194. package/src/prover/smt/solver/case-split-queue.ts +0 -2
  195. package/src/prover/smt/solver/cg-table.ts +39 -25
  196. package/src/prover/smt/solver/check-logic.ts +330 -0
  197. package/src/prover/smt/solver/clause.ts +0 -1
  198. package/src/prover/smt/solver/cofactor-elim-term-ite.ts +278 -0
  199. package/src/prover/smt/solver/conflict-resolution.ts +78 -2
  200. package/src/prover/smt/solver/context.ts +516 -115
  201. package/src/prover/smt/solver/ctx-simplify.ts +20 -10
  202. package/src/prover/smt/solver/ctx-solver-simplify.ts +122 -0
  203. package/src/prover/smt/solver/datatype-decl-plugin.ts +572 -0
  204. package/src/prover/smt/solver/datatype-rewriter.ts +82 -0
  205. package/src/prover/smt/solver/demodulator.ts +786 -0
  206. package/src/prover/smt/solver/dependent-expr-state.ts +81 -0
  207. package/src/prover/smt/solver/der.ts +38 -10
  208. package/src/prover/smt/solver/diff-neq.ts +206 -0
  209. package/src/prover/smt/solver/distribute-forall.ts +57 -0
  210. package/src/prover/smt/solver/dom-simplify.ts +511 -0
  211. package/src/prover/smt/solver/dt2bv-tactic.ts +260 -0
  212. package/src/prover/smt/solver/dyn-ack.ts +0 -1
  213. package/src/prover/smt/solver/e-matching.ts +7 -8
  214. package/src/prover/smt/solver/elim-small-bv-tactic.ts +129 -0
  215. package/src/prover/smt/solver/elim-uncnstr.ts +545 -0
  216. package/src/prover/smt/solver/enode.ts +100 -3
  217. package/src/prover/smt/solver/eq2bv-tactic.ts +218 -0
  218. package/src/prover/smt/solver/euf/arith-axioms.ts +403 -0
  219. package/src/prover/smt/solver/euf/arith-internalize.ts +653 -0
  220. package/src/prover/smt/solver/euf/arith-solver.ts +889 -0
  221. package/src/prover/smt/solver/euf/array-axioms.ts +527 -0
  222. package/src/prover/smt/solver/euf/array-internalize.ts +428 -0
  223. package/src/prover/smt/solver/euf/array-solver.ts +306 -0
  224. package/src/prover/smt/solver/euf/bv-ackerman.ts +162 -0
  225. package/src/prover/smt/solver/euf/bv-internalize.ts +748 -0
  226. package/src/prover/smt/solver/euf/bv-solver.ts +449 -0
  227. package/src/prover/smt/solver/euf/dt-solver.ts +618 -0
  228. package/src/prover/smt/solver/euf/egraph.ts +908 -0
  229. package/src/prover/smt/solver/euf/euf-solver.ts +1205 -0
  230. package/src/prover/smt/solver/euf/fpa-solver.ts +317 -0
  231. package/src/prover/smt/solver/euf/mam.ts +1050 -0
  232. package/src/prover/smt/solver/euf/q-ematch.ts +830 -0
  233. package/src/prover/smt/solver/euf/q-mbi.ts +587 -0
  234. package/src/prover/smt/solver/euf/q-model-fixer.ts +296 -0
  235. package/src/prover/smt/solver/euf/q-solver.ts +361 -0
  236. package/src/prover/smt/solver/euf/th-solver.ts +335 -0
  237. package/src/prover/smt/solver/euf/th-solvers.ts +30 -0
  238. package/src/prover/smt/solver/expr-ref.ts +0 -1
  239. package/src/prover/smt/solver/expr-safe-replace.ts +26 -2
  240. package/src/prover/smt/solver/expr2polynomial.ts +146 -0
  241. package/src/prover/smt/solver/factor.ts +141 -0
  242. package/src/prover/smt/solver/fd-solver.ts +265 -0
  243. package/src/prover/smt/solver/fingerprints.ts +15 -15
  244. package/src/prover/smt/solver/fix-dl-var.ts +148 -0
  245. package/src/prover/smt/solver/flat-literals.ts +0 -1
  246. package/src/prover/smt/solver/fm-tactic.ts +884 -0
  247. package/src/prover/smt/solver/fpa-decl-plugin.ts +618 -0
  248. package/src/prover/smt/solver/fpa-rewriter.ts +640 -0
  249. package/src/prover/smt/solver/fpa2bv-converter.ts +2249 -0
  250. package/src/prover/smt/solver/fpa2bv-rewriter.ts +348 -0
  251. package/src/prover/smt/solver/fpa2bv-tactic.ts +73 -0
  252. package/src/prover/smt/solver/goal.ts +175 -15
  253. package/src/prover/smt/solver/goal2nlsat.ts +189 -0
  254. package/src/prover/smt/solver/guard-set.ts +219 -0
  255. package/src/prover/smt/solver/hash.ts +0 -1
  256. package/src/prover/smt/solver/hashtable.ts +30 -16
  257. package/src/prover/smt/solver/inf-eps.ts +63 -0
  258. package/src/prover/smt/solver/inj-axiom.ts +101 -0
  259. package/src/prover/smt/solver/internalizer.ts +110 -38
  260. package/src/prover/smt/solver/lackr.ts +381 -0
  261. package/src/prover/smt/solver/lbool.ts +0 -1
  262. package/src/prover/smt/solver/lia2card.ts +268 -0
  263. package/src/prover/smt/solver/lia2pb.ts +154 -0
  264. package/src/prover/smt/solver/literal.ts +0 -1
  265. package/src/prover/smt/solver/logic-tactics.ts +345 -0
  266. package/src/prover/smt/solver/lp/bound-propagator.ts +0 -1
  267. package/src/prover/smt/solver/lp/constraints.ts +0 -1
  268. package/src/prover/smt/solver/lp/containers.ts +7 -2
  269. package/src/prover/smt/solver/lp/core-solver.ts +18 -3
  270. package/src/prover/smt/solver/lp/cross-nested.ts +1 -4
  271. package/src/prover/smt/solver/lp/dep-intervals.ts +0 -3
  272. package/src/prover/smt/solver/lp/dependency.ts +0 -2
  273. package/src/prover/smt/solver/lp/dioph-eq.ts +1 -10
  274. package/src/prover/smt/solver/lp/explanation.ts +0 -1
  275. package/src/prover/smt/solver/lp/gomory.ts +0 -1
  276. package/src/prover/smt/solver/lp/hnf-cutter.ts +1 -2
  277. package/src/prover/smt/solver/lp/hnf.ts +0 -3
  278. package/src/prover/smt/solver/lp/int-cube.ts +3 -4
  279. package/src/prover/smt/solver/lp/int-solver.ts +0 -2
  280. package/src/prover/smt/solver/lp/lar-solver.ts +40 -4
  281. package/src/prover/smt/solver/lp/lar-term.ts +0 -1
  282. package/src/prover/smt/solver/lp/lp-settings.ts +0 -1
  283. package/src/prover/smt/solver/lp/maximize-term.ts +59 -10
  284. package/src/prover/smt/solver/lp/nex-creator.ts +3 -3
  285. package/src/prover/smt/solver/lp/nex.ts +2 -2
  286. package/src/prover/smt/solver/lp/nla-backoff.ts +0 -2
  287. package/src/prover/smt/solver/lp/nla-basics.ts +46 -3
  288. package/src/prover/smt/solver/lp/nla-core.ts +67 -16
  289. package/src/prover/smt/solver/lp/nla-divisions.ts +0 -2
  290. package/src/prover/smt/solver/lp/nla-emonics.ts +0 -1
  291. package/src/prover/smt/solver/lp/nla-factorization.ts +0 -1
  292. package/src/prover/smt/solver/lp/nla-grobner.ts +9 -5
  293. package/src/prover/smt/solver/lp/nla-horner.ts +0 -2
  294. package/src/prover/smt/solver/lp/nla-intervals.ts +0 -1
  295. package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +0 -2
  296. package/src/prover/smt/solver/lp/nla-monotone.ts +0 -1
  297. package/src/prover/smt/solver/lp/nla-order.ts +0 -2
  298. package/src/prover/smt/solver/lp/nla-patcher.ts +0 -1
  299. package/src/prover/smt/solver/lp/nla-powers.ts +220 -0
  300. package/src/prover/smt/solver/lp/nla-tangents.ts +0 -2
  301. package/src/prover/smt/solver/lp/nla-throttle.ts +0 -1
  302. package/src/prover/smt/solver/lp/nla-transcendentals.ts +324 -0
  303. package/src/prover/smt/solver/lp/nla-types.ts +0 -2
  304. package/src/prover/smt/solver/lp/nla-var-eqs.ts +0 -1
  305. package/src/prover/smt/solver/lp/nra-solver.ts +122 -64
  306. package/src/prover/smt/solver/lp/numeric-pair.ts +0 -1
  307. package/src/prover/smt/solver/lp/pdd-interval.ts +0 -1
  308. package/src/prover/smt/solver/lp/pdd-simplifier.ts +0 -1
  309. package/src/prover/smt/solver/lp/pdd-solver.ts +0 -2
  310. package/src/prover/smt/solver/lp/pdd.ts +2 -2
  311. package/src/prover/smt/solver/lp/random-updater.ts +0 -2
  312. package/src/prover/smt/solver/lp/static-matrix.ts +0 -1
  313. package/src/prover/smt/solver/lp/union-find.ts +7 -2
  314. package/src/prover/smt/solver/macro-finder.ts +530 -0
  315. package/src/prover/smt/solver/mam-compiler.ts +122 -90
  316. package/src/prover/smt/solver/mam-interpreter.ts +0 -1
  317. package/src/prover/smt/solver/max-bv-sharing-tactic.ts +17 -0
  318. package/src/prover/smt/solver/max-cliques.ts +105 -0
  319. package/src/prover/smt/solver/maxcore.ts +309 -0
  320. package/src/prover/smt/solver/maximize-ac-sharing.ts +8 -6
  321. package/src/prover/smt/solver/maxlex.ts +115 -0
  322. package/src/prover/smt/solver/maxsmt-base.ts +105 -0
  323. package/src/prover/smt/solver/maxsmt.ts +92 -0
  324. package/src/prover/smt/solver/mbp/mbp-arith.ts +467 -0
  325. package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +101 -0
  326. package/src/prover/smt/solver/mbp/mbp-plugin.ts +287 -0
  327. package/src/prover/smt/solver/mbp/mbp-qel.ts +48 -0
  328. package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +271 -0
  329. package/src/prover/smt/solver/mbp/mbp-term-graph.ts +606 -0
  330. package/src/prover/smt/solver/model-based-opt.ts +844 -0
  331. package/src/prover/smt/solver/model-checker.ts +18 -27
  332. package/src/prover/smt/solver/model-evaluator.ts +188 -12
  333. package/src/prover/smt/solver/model-finder.ts +12 -18
  334. package/src/prover/smt/solver/model-generator.ts +56 -29
  335. package/src/prover/smt/solver/model-macro-solver.ts +49 -46
  336. package/src/prover/smt/solver/model-printer.ts +214 -0
  337. package/src/prover/smt/solver/mpf.ts +711 -0
  338. package/src/prover/smt/solver/mus.ts +51 -0
  339. package/src/prover/smt/solver/muz/dl-context.ts +404 -0
  340. package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +97 -0
  341. package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +167 -0
  342. package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +125 -0
  343. package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +299 -0
  344. package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +455 -0
  345. package/src/prover/smt/solver/muz/dl-mk-slice.ts +340 -0
  346. package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +163 -0
  347. package/src/prover/smt/solver/muz/dl-rule-set.ts +273 -0
  348. package/src/prover/smt/solver/muz/dl-rule-transformer.ts +123 -0
  349. package/src/prover/smt/solver/muz/dl-rule.ts +496 -0
  350. package/src/prover/smt/solver/muz/hnf.ts +201 -0
  351. package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +176 -0
  352. package/src/prover/smt/solver/muz/horn-tactic.ts +201 -0
  353. package/src/prover/smt/solver/muz/rule-properties.ts +337 -0
  354. package/src/prover/smt/solver/muz/spacer-context.ts +1406 -0
  355. package/src/prover/smt/solver/muz/spacer-dl-interface.ts +52 -0
  356. package/src/prover/smt/solver/muz/spacer-generalizers.ts +241 -0
  357. package/src/prover/smt/solver/muz/spacer-manager.ts +127 -0
  358. package/src/prover/smt/solver/muz/spacer-pdr.ts +218 -0
  359. package/src/prover/smt/solver/muz/spacer-prop-solver.ts +333 -0
  360. package/src/prover/smt/solver/muz/spacer-util.ts +282 -0
  361. package/src/prover/smt/solver/muz/substitution.ts +203 -0
  362. package/src/prover/smt/solver/nla2bv-tactic.ts +285 -0
  363. package/src/prover/smt/solver/nlqsat.ts +484 -0
  364. package/src/prover/smt/solver/nlsat/algebraic.ts +125 -12
  365. package/src/prover/smt/solver/nlsat/atoms.ts +20 -6
  366. package/src/prover/smt/solver/nlsat/evaluator.ts +0 -1
  367. package/src/prover/smt/solver/nlsat/explain.ts +63 -23
  368. package/src/prover/smt/solver/nlsat/interval-set.ts +1 -2
  369. package/src/prover/smt/solver/nlsat/levelwise.ts +3 -9
  370. package/src/prover/smt/solver/nlsat/mpbq.ts +45 -1
  371. package/src/prover/smt/solver/nlsat/polynomial.ts +13 -6
  372. package/src/prover/smt/solver/nlsat/solver.ts +236 -45
  373. package/src/prover/smt/solver/nlsat/transcendental-eval.ts +310 -0
  374. package/src/prover/smt/solver/nlsat/transcendentals.ts +367 -0
  375. package/src/prover/smt/solver/nlsat/types.ts +0 -2
  376. package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +1 -4
  377. package/src/prover/smt/solver/nlsat/upolynomial.ts +0 -2
  378. package/src/prover/smt/solver/nlsat-tactic.ts +82 -0
  379. package/src/prover/smt/solver/nnf.ts +105 -23
  380. package/src/prover/smt/solver/normalize-bounds.ts +53 -0
  381. package/src/prover/smt/solver/occf.ts +97 -0
  382. package/src/prover/smt/solver/opt-context.ts +787 -0
  383. package/src/prover/smt/solver/opt-nlsat.ts +375 -0
  384. package/src/prover/smt/solver/opt-pareto.ts +282 -0
  385. package/src/prover/smt/solver/opt-preprocess.ts +101 -0
  386. package/src/prover/smt/solver/opt-solver.ts +308 -0
  387. package/src/prover/smt/solver/opt-value.ts +55 -0
  388. package/src/prover/smt/solver/optsmt.ts +692 -0
  389. package/src/prover/smt/solver/parallel-tactic.ts +299 -0
  390. package/src/prover/smt/solver/pattern-inference.ts +19 -11
  391. package/src/prover/smt/solver/pb-rewriter.ts +284 -0
  392. package/src/prover/smt/solver/pb2bv-tactic.ts +540 -0
  393. package/src/prover/smt/solver/poly-rewriter.ts +202 -57
  394. package/src/prover/smt/solver/probes.ts +512 -0
  395. package/src/prover/smt/solver/propagate-values.ts +37 -21
  396. package/src/prover/smt/solver/proto-model.ts +648 -19
  397. package/src/prover/smt/solver/pull-quant.ts +28 -12
  398. package/src/prover/smt/solver/purify-arith.ts +632 -0
  399. package/src/prover/smt/solver/qe-arith-plugin.ts +1098 -0
  400. package/src/prover/smt/solver/qe-lite-der.ts +2 -3
  401. package/src/prover/smt/solver/qe-lite-fm.ts +3 -4
  402. package/src/prover/smt/solver/qe-lite.ts +37 -17
  403. package/src/prover/smt/solver/qe-mbp.ts +270 -0
  404. package/src/prover/smt/solver/qe.ts +1498 -0
  405. package/src/prover/smt/solver/qel.ts +25 -0
  406. package/src/prover/smt/solver/qi-queue.ts +0 -1
  407. package/src/prover/smt/solver/qsat.ts +814 -0
  408. package/src/prover/smt/solver/quant-hoist.ts +196 -0
  409. package/src/prover/smt/solver/quant-tactics.ts +16 -56
  410. package/src/prover/smt/solver/quantifier-analyzer.ts +19 -20
  411. package/src/prover/smt/solver/quantifier-manager.ts +8 -16
  412. package/src/prover/smt/solver/quasi-macros.ts +243 -0
  413. package/src/prover/smt/solver/random-gen.ts +0 -1
  414. package/src/prover/smt/solver/rational.ts +45 -1
  415. package/src/prover/smt/solver/recfun-decl-plugin.ts +261 -0
  416. package/src/prover/smt/solver/recfun-rewriter.ts +107 -0
  417. package/src/prover/smt/solver/reduce-args.ts +225 -0
  418. package/src/prover/smt/solver/reduce-bv-size.ts +119 -0
  419. package/src/prover/smt/solver/ref-vector.ts +0 -1
  420. package/src/prover/smt/solver/relevancy.ts +1 -2
  421. package/src/prover/smt/solver/rewriter-tpl.ts +77 -10
  422. package/src/prover/smt/solver/rewriter.ts +475 -36
  423. package/src/prover/smt/solver/rlimit.ts +38 -2
  424. package/src/prover/smt/solver/sat/asymm-branch.ts +325 -0
  425. package/src/prover/smt/solver/sat/big.ts +177 -0
  426. package/src/prover/smt/solver/sat/clause-use-list.ts +71 -0
  427. package/src/prover/smt/solver/sat/clause.ts +203 -0
  428. package/src/prover/smt/solver/sat/cleaner.ts +94 -0
  429. package/src/prover/smt/solver/sat/config.ts +122 -0
  430. package/src/prover/smt/solver/sat/consequences.ts +203 -0
  431. package/src/prover/smt/solver/sat/elim-eqs.ts +142 -0
  432. package/src/prover/smt/solver/sat/goal2sat.ts +526 -0
  433. package/src/prover/smt/solver/sat/inc-sat-solver.ts +378 -0
  434. package/src/prover/smt/solver/sat/model-converter.ts +136 -0
  435. package/src/prover/smt/solver/sat/pb-constraint.ts +261 -0
  436. package/src/prover/smt/solver/sat/pb-solver.ts +1577 -0
  437. package/src/prover/smt/solver/sat/probing.ts +170 -0
  438. package/src/prover/smt/solver/sat/sat-tactic.ts +43 -0
  439. package/src/prover/smt/solver/sat/sat2goal.ts +165 -0
  440. package/src/prover/smt/solver/sat/scc.ts +142 -0
  441. package/src/prover/smt/solver/sat/simplifier.ts +1618 -0
  442. package/src/prover/smt/solver/sat/solver.ts +2127 -0
  443. package/src/prover/smt/solver/sat/var-queue.ts +117 -0
  444. package/src/prover/smt/solver/sat/watch-list.ts +140 -0
  445. package/src/prover/smt/solver/search-tree.ts +284 -0
  446. package/src/prover/smt/solver/seq-axioms.ts +1010 -0
  447. package/src/prover/smt/solver/seq-decl-plugin.ts +819 -0
  448. package/src/prover/smt/solver/seq-derive.ts +1298 -0
  449. package/src/prover/smt/solver/seq-eq-approx.ts +236 -0
  450. package/src/prover/smt/solver/seq-eq-solver.ts +439 -0
  451. package/src/prover/smt/solver/seq-factory.ts +89 -0
  452. package/src/prover/smt/solver/seq-monadic.ts +728 -0
  453. package/src/prover/smt/solver/seq-range-predicate.ts +235 -0
  454. package/src/prover/smt/solver/seq-re-rewriter.ts +1170 -0
  455. package/src/prover/smt/solver/seq-re-util.ts +758 -0
  456. package/src/prover/smt/solver/seq-regex-bisim.ts +144 -0
  457. package/src/prover/smt/solver/seq-regex-live.ts +200 -0
  458. package/src/prover/smt/solver/seq-rewriter.ts +2402 -0
  459. package/src/prover/smt/solver/seq-skolem.ts +317 -0
  460. package/src/prover/smt/solver/seq-subset.ts +165 -0
  461. package/src/prover/smt/solver/seq-view-witness.ts +353 -0
  462. package/src/prover/smt/solver/smt-consequences.ts +297 -0
  463. package/src/prover/smt/solver/smt-kernel.ts +83 -0
  464. package/src/prover/smt/solver/smt-logics.ts +66 -0
  465. package/src/prover/smt/solver/smt-setup.ts +496 -0
  466. package/src/prover/smt/solver/smt2-printer.ts +765 -0
  467. package/src/prover/smt/solver/smtlib-parser.ts +3126 -316
  468. package/src/prover/smt/solver/smtlib-script.ts +1631 -0
  469. package/src/prover/smt/solver/solve-eqs.ts +929 -0
  470. package/src/prover/smt/solver/solver.ts +113 -22
  471. package/src/prover/smt/solver/static-features.ts +314 -0
  472. package/src/prover/smt/solver/sticky-generations.ts +0 -1
  473. package/src/prover/smt/solver/tactic.ts +1986 -0
  474. package/src/prover/smt/solver/term-enumeration.ts +205 -0
  475. package/src/prover/smt/solver/theory-array.ts +1240 -0
  476. package/src/prover/smt/solver/theory-bv.ts +1200 -0
  477. package/src/prover/smt/solver/theory-char.ts +355 -0
  478. package/src/prover/smt/solver/theory-datatype.ts +598 -0
  479. package/src/prover/smt/solver/theory-finite-set.ts +30 -0
  480. package/src/prover/smt/solver/theory-fpa.ts +389 -0
  481. package/src/prover/smt/solver/theory-lra-axioms.ts +53 -2
  482. package/src/prover/smt/solver/theory-lra-bounds.ts +31 -6
  483. package/src/prover/smt/solver/theory-lra-final-check.ts +56 -70
  484. package/src/prover/smt/solver/theory-lra-internalize.ts +94 -27
  485. package/src/prover/smt/solver/theory-lra-model.ts +20 -35
  486. package/src/prover/smt/solver/theory-lra-propagate.ts +24 -26
  487. package/src/prover/smt/solver/theory-lra-state.ts +6 -22
  488. package/src/prover/smt/solver/theory-lra.ts +188 -1
  489. package/src/prover/smt/solver/theory-pb.ts +934 -0
  490. package/src/prover/smt/solver/theory-polymorphism.ts +58 -0
  491. package/src/prover/smt/solver/theory-recfun.ts +307 -0
  492. package/src/prover/smt/solver/theory-seq-regex.ts +867 -0
  493. package/src/prover/smt/solver/theory-seq-solve.ts +1373 -0
  494. package/src/prover/smt/solver/theory-seq-state.ts +871 -0
  495. package/src/prover/smt/solver/theory-seq.ts +961 -0
  496. package/src/prover/smt/solver/theory.ts +189 -0
  497. package/src/prover/smt/solver/tseitin-cnf.ts +485 -0
  498. package/src/prover/smt/solver/var-subst.ts +36 -14
  499. package/src/prover/smt/table.ts +3 -2
  500. package/src/prover/smt/types.ts +146 -0
  501. package/src/prover/tlapm/cache.ts +50 -19
  502. package/src/prover/tlapm/tlapm.ts +15 -9
  503. package/src/prover/tlapm-library.ts +3208 -0
  504. package/src/prover/verdict.ts +9 -0
  505. package/src/prover/zenon/check/check.ts +1 -2
  506. package/src/prover/zenon/check/records.ts +1 -1
  507. package/src/prover/zenon/check/relations.ts +2 -1
  508. package/src/prover/zenon/check/rewrites.ts +2 -15
  509. package/src/prover/zenon/check/sets.ts +40 -58
  510. package/src/prover/zenon/check/terms.ts +1 -2
  511. package/src/prover/zenon/decide.ts +10 -7
  512. package/src/prover/zenon/encode.ts +0 -2
  513. package/src/prover/zenon/eqrel.ts +2 -2
  514. package/src/prover/zenon/equality-rules.ts +24 -2
  515. package/src/prover/zenon/expr.ts +28 -2
  516. package/src/prover/zenon/index-table.ts +11 -21
  517. package/src/prover/zenon/isar-case.ts +0 -2
  518. package/src/prover/zenon/isar.ts +35 -37
  519. package/src/prover/zenon/llproof.ts +2 -13
  520. package/src/prover/zenon/mltoll.ts +12 -30
  521. package/src/prover/zenon/node.ts +20 -5
  522. package/src/prover/zenon/parse.ts +9 -8
  523. package/src/prover/zenon/phrase.ts +0 -2
  524. package/src/prover/zenon/proof.ts +0 -2
  525. package/src/prover/zenon/propositional-rules.ts +0 -2
  526. package/src/prover/zenon/rules.ts +2 -3
  527. package/src/prover/zenon/search.ts +11 -19
  528. package/src/prover/zenon/tla/functions.ts +2 -4
  529. package/src/prover/zenon/tla/llproof.ts +9 -13
  530. package/src/prover/zenon/tla/records.ts +1 -8
  531. package/src/prover/zenon/tla/rewrites.ts +0 -2
  532. package/src/prover/zenon/tla/sets.ts +22 -22
  533. package/src/prover/zenon/tla/terms.ts +0 -2
  534. package/src/prover/zenon/tla/tla.ts +7 -8
  535. package/src/randomization.ts +1 -4
  536. package/src/resolve.ts +67 -143
  537. package/src/runtime.ts +15 -18
  538. package/src/sany/builtins.ts +1 -3
  539. package/src/sany/generation.ts +394 -0
  540. package/src/sany/generator-def-entries.ts +210 -0
  541. package/src/sany/generator-definitions.ts +686 -0
  542. package/src/sany/generator-expressions.ts +1100 -0
  543. package/src/sany/generator-proofs.ts +662 -0
  544. package/src/sany/generator.ts +160 -2683
  545. package/src/sany/levels.ts +5 -11
  546. package/src/sany/lexer.ts +57 -60
  547. package/src/sany/linter.ts +0 -3
  548. package/src/sany/nodes.ts +6 -13
  549. package/src/sany/report.ts +3 -6
  550. package/src/sany/selectors.ts +35 -38
  551. package/src/sany/xml.ts +23 -55
  552. package/src/search.ts +206 -44
  553. package/src/simulate.ts +202 -184
  554. package/src/spec-description.ts +56 -82
  555. package/src/standard-definitions.ts +4 -3
  556. package/src/standard-modules.ts +17 -44
  557. package/src/state-graph.ts +3 -17
  558. package/src/subexpressions.ts +38 -47
  559. package/src/substitution-levels.ts +5 -4
  560. package/src/successors.ts +20 -43
  561. package/src/symmetry.ts +6 -21
  562. package/src/tableau.ts +2 -2
  563. package/src/tlc/fingerprint.ts +96 -30
  564. package/src/tlc/jar-data.ts +0 -1
  565. package/src/tlc/messages.ts +22 -36
  566. package/src/tlc/order.ts +22 -47
  567. package/src/tlc/random.ts +22 -34
  568. package/src/tlc/replay.ts +21 -48
  569. package/src/tlc/summary.ts +64 -58
  570. package/src/tlc/tlc-operators.ts +6 -17
  571. package/src/tlc/tlcext-operators.ts +54 -26
  572. package/src/tlc/trace-spec.ts +26 -51
  573. package/src/tlc/value-stream.ts +9 -13
  574. package/src/tlc/version.ts +0 -1
  575. package/src/typed-tier.ts +6535 -0
  576. package/src/typescript/actions.ts +2 -4
  577. package/src/typescript/collections.ts +34 -20
  578. package/src/typescript/compile.ts +1 -3
  579. package/src/typescript/formula.ts +5 -3
  580. package/src/typescript/model.ts +4 -5
  581. package/src/typescript/steps.ts +20 -18
  582. package/src/values.ts +136 -338
  583. package/src/prover/isabelle/isar/statement.ts +0 -52
  584. package/src/prover/smt/solver/z3-license.txt +0 -10
  585. package/src/prover/tlaps-module.ts +0 -510
  586. package/src/prover/zenon/LICENSE +0 -32
@@ -1,19 +1,575 @@
1
- // Ported from Isabelle2025's Pure/goal.ML, Pure/Isar/method.ML and Pure/Isar/proof.ML. Copyright (c) 1986-2025 University of Cambridge, Technische Universitaet Muenchen, and contributors, see LICENSE.
2
-
3
- import { compIncr, forallIntrVars, protectI, revcutRl } from "../pure/drule";
4
- import { normHhf } from "../pure/simplifier";
5
- import { mkVar, propT } from "../pure/term";
6
- import { every, type Tactic } from "../pure/tactical";
1
+ import { TlaIsabelleError } from "../../../errors";
2
+ import { compIncr, forallIntrVars, protectD, protectI, revcutRl } from "../pure/drule";
3
+ import { conclude } from "../pure/goal";
7
4
  import type { Limits } from "../pure/interrupt";
8
- import { resolveTac } from "../pure/tactic";
9
- import { assume, instantiate, type Thm } from "../pure/thm";
10
- import type { Statement } from "./statement";
11
-
12
- export const initGoal = (statement: Statement) =>
13
- instantiate([{ variable: mkVar("A", 0, propT), term: statement.conclusion }], protectI);
5
+ import { isProtected, stripAssumsConcl, stripParams } from "../pure/logic";
6
+ import {
7
+ appendSeq,
8
+ emptySeq,
9
+ filterSeq,
10
+ mapSeq,
11
+ mapsSeq,
12
+ seqHead,
13
+ singleSeq,
14
+ type Seq,
15
+ } from "../pure/seq";
16
+ import { normHhf } from "../pure/simplifier";
17
+ import { eresolveTac, resolveTac } from "../pure/tactic";
18
+ import { every, subgoal, thenGoal, type GoalTactic, type Tactic } from "../pure/tactical";
19
+ import { aconv, existsSubterm, mkAbs, mkFree, mkVar, propT, type Term } from "../pure/term";
20
+ import { bicompose, incrIndexesThm, instantiate, nprems, type Thm } from "../pure/thm";
21
+ import {
22
+ addAssumptions,
23
+ addFixes,
24
+ assumptionsOf,
25
+ augment,
26
+ bindTerm,
27
+ declareTerm,
28
+ exportThm,
29
+ maybeBindTerm,
30
+ putFacts,
31
+ readTerms,
32
+ simultMatches,
33
+ updateCases,
34
+ type IsarContext,
35
+ type ReadMode,
36
+ } from "./context";
37
+ import { applyAttributes } from "./attrib";
38
+ import { evaluate, finishTac, normHhfTac, unfoldGoals, unfoldRule, type GoalState } from "./method";
39
+ import { applyCase, dropJudgment } from "./rule-cases";
40
+ import { parseType } from "./inner-syntax";
41
+ import type { AttributeSource, FixedVariable, MethodText, StatementPart } from "./theory";
14
42
 
15
- export const getFacts = (limits: Limits, statement: Statement) =>
16
- statement.assumptions.map((assumption) => normHhf(limits, assume(assumption)));
43
+ const initGoal = (prop: Term) =>
44
+ instantiate([{ variable: mkVar("A", 0, propT), term: prop }], protectI);
17
45
 
18
46
  export const insertTac = (limits: Limits, facts: readonly Thm[], index: number): Tactic =>
19
47
  every(facts.map((fact) => resolveTac(limits, [compIncr(forallIntrVars(fact), revcutRl)])(index)));
48
+
49
+ type Mode = "forward" | "chain" | "backward";
50
+
51
+ type AfterQed = (resultContext: IsarContext, results: readonly Thm[], state: State) => State;
52
+
53
+ interface Goal {
54
+ readonly props: readonly Term[];
55
+ readonly using: readonly Thm[];
56
+ readonly goal: Thm;
57
+ readonly afterQed: AfterQed;
58
+ }
59
+
60
+ interface Node {
61
+ readonly context: IsarContext;
62
+ readonly facts: readonly Thm[] | undefined;
63
+ readonly mode: Mode;
64
+ readonly goal: Goal | undefined;
65
+ }
66
+
67
+ // The stack of blocks, innermost last.
68
+ export type State = readonly Node[];
69
+
70
+ const error = (message: string) => new TlaIsabelleError("ERROR", message);
71
+
72
+ const hasVars = (term: Term) => existsSubterm((sub) => sub.kind === "Var", term);
73
+
74
+ const top = (state: State) => state[state.length - 1];
75
+
76
+ const mapTop = (state: State, map: (node: Node) => Node): State => [
77
+ ...state.slice(0, -1),
78
+ map(top(state)),
79
+ ];
80
+
81
+ export const contextOf = (state: State) => top(state).context;
82
+
83
+ const mapContext = (state: State, map: (context: IsarContext) => IsarContext) =>
84
+ mapTop(state, (node) => ({ ...node, context: map(node.context) }));
85
+
86
+ const openBlock = (state: State): State => [...state, top(state)];
87
+
88
+ const closeBlock = (state: State): State => {
89
+ if (state.length <= 1) throw error("Unbalanced block parentheses");
90
+ return state.slice(0, -1);
91
+ };
92
+
93
+ const putFactsOf = (state: State, facts: readonly Thm[] | undefined): State =>
94
+ mapTop(state, (node) => ({ ...node, facts, context: putFacts(node.context, "this", facts) }));
95
+
96
+ const theFacts = (state: State) => {
97
+ const facts = top(state).facts;
98
+ if (facts === undefined) throw error("No current facts available");
99
+ return facts;
100
+ };
101
+
102
+ const assertMode = (state: State, modes: readonly Mode[]) => {
103
+ if (!modes.includes(top(state).mode))
104
+ throw error(`Illegal application of proof command in ${top(state).mode} mode`);
105
+ return state;
106
+ };
107
+
108
+ const putMode = (state: State, mode: Mode) => mapTop(state, (node) => ({ ...node, mode }));
109
+
110
+ const findGoal = (state: State): [number, IsarContext, Goal] => {
111
+ for (let index = state.length - 1; index >= 0; index -= 1) {
112
+ const goal = state[index].goal;
113
+ if (goal !== undefined) return [index, state[index].context, goal];
114
+ }
115
+ throw error("No proof goal");
116
+ };
117
+
118
+ const mapGoal = (state: State, map: (context: IsarContext, goal: Goal) => [IsarContext, Goal]) => {
119
+ const [index, context, goal] = findGoal(state);
120
+ const [newContext, newGoal] = map(context, goal);
121
+ return state.map((node, position) =>
122
+ position === index ? { ...node, context: newContext, goal: newGoal } : node,
123
+ );
124
+ };
125
+
126
+ const provideGoal = (state: State, thm: Thm) =>
127
+ mapGoal(state, (context, goal) => [context, { ...goal, goal: thm }]);
128
+
129
+ const usingFacts = (state: State, using: readonly Thm[]) =>
130
+ mapGoal(state, (context, goal) => [context, { ...goal, using }]);
131
+
132
+ // Proof.refine: the method applies to the goal with its facts, in the given context, and its
133
+ // cases join the goal's context.
134
+ const refine = (state: State, text: MethodText): Seq<State> => {
135
+ const [, goalContext, goal] = findGoal(state);
136
+ const method = evaluate(contextOf(state), text);
137
+ return mapSeq(
138
+ (result: GoalState) => mapGoal(state, () => [result.context, { ...goal, goal: result.goal }]),
139
+ method(goal.using)({ context: goalContext, goal: goal.goal }),
140
+ );
141
+ };
142
+
143
+ const STANDARD_TEXT: MethodText = { kind: "source", name: "standard", args: [] };
144
+
145
+ export const proof = (state: State, text: MethodText | undefined): Seq<State> => {
146
+ assertMode(state, ["backward"]);
147
+ return mapSeq(
148
+ (result: State) =>
149
+ mapTop(openBlock(putMode(usingFacts(result, []), "forward")), (node) => ({
150
+ ...node,
151
+ goal: undefined,
152
+ })),
153
+ refine(state, text ?? STANDARD_TEXT),
154
+ );
155
+ };
156
+
157
+ const theResult = <Item>(seq: Seq<Item>, message: string): Item => {
158
+ const result = seqHead(seq);
159
+ if (result === undefined) throw error(message);
160
+ return result;
161
+ };
162
+
163
+ // Proof.end_proof: the closing method, then the goal must have no subgoals.
164
+ const endProof = (state: State, text: MethodText | undefined): Seq<State> => {
165
+ assertMode(state, ["forward"]);
166
+ const closed = usingFacts(closeBlock(state), []);
167
+ if (top(closed).goal === undefined) throw error("No goal in this block");
168
+ const finish: Seq<State> = text === undefined ? singleSeq(closed) : refine(closed, text);
169
+ return filterSeq(
170
+ (result: State) => nprems(findGoal(result)[2].goal) === 0,
171
+ mapsSeq(
172
+ (result: State) =>
173
+ mapSeq(
174
+ (thm: Thm) => provideGoal(result, thm),
175
+ finishTac(contextOf(result).tactics.limits)(findGoal(result)[2].goal),
176
+ ),
177
+ finish,
178
+ ),
179
+ );
180
+ };
181
+
182
+ const concludeGoal = (context: IsarContext, goal: Goal): Thm => {
183
+ if (nprems(goal.goal) !== 0) throw error("Failed to finish proof");
184
+ const thm = conclude(goal.goal);
185
+ if (thm.tpairs.length > 0) throw error("Unsupported flex-flex constraints in result");
186
+ const assumptions = assumptionsOf(context);
187
+ if (!thm.hyps.every((hyp) => assumptions.some((assumption) => aconv(hyp, assumption))))
188
+ throw error("Undeclared hyps");
189
+ if (!aconv(thm.prop, goal.props[0])) throw error("Proved a different theorem");
190
+ return thm;
191
+ };
192
+
193
+ // Proof.generic_qed and its after_qed.
194
+ const genericQed = (state: State): State => {
195
+ const [, context, goal] = findGoal(state);
196
+ if (top(state).goal === undefined) throw error("No current goal");
197
+ return goal.afterQed(context, [concludeGoal(context, goal)], closeBlock(state));
198
+ };
199
+
200
+ export const qed = (state: State, text: MethodText | undefined): State =>
201
+ genericQed(theResult(endProof(state, text), "Failed to finish proof"));
202
+
203
+ // Proof.terminal_proof, as by: the first initial result that the terminal method finishes.
204
+ export const terminalProof = (
205
+ state: State,
206
+ initial: MethodText,
207
+ terminal: MethodText | undefined,
208
+ ): State =>
209
+ genericQed(
210
+ theResult(
211
+ mapsSeq((result: State) => endProof(result, terminal), proof(state, initial)),
212
+ "Failed to finish proof",
213
+ ),
214
+ );
215
+
216
+ // Auto_Bind.goal: ?thesis is a single goal's conclusion, abstracted over its parameters.
217
+ const thesisOf = (prop: Term) =>
218
+ stripParams(prop).reduceRight(
219
+ (body, param) => mkAbs(param.name, param.type, body),
220
+ dropJudgment(stripAssumsConcl(prop)),
221
+ );
222
+
223
+ // Proof.generic_goal: a new block whose goal is the proposition.
224
+ const genericGoal = (
225
+ state: State,
226
+ goalContext: IsarContext,
227
+ props: readonly Term[],
228
+ afterQed: AfterQed,
229
+ ): State => {
230
+ if (props.length !== 1) throw error("Unsupported goal of several propositions");
231
+ const isChaining = top(state).mode === "chain";
232
+ assertMode(state, ["forward", "chain"]);
233
+ const opened = putMode(openBlock(putMode(state, "forward")), "backward");
234
+ const goalState = mapTop(opened, (node) => ({
235
+ ...node,
236
+ context: maybeBindTerm({ ...goalContext, isBody: true }, "thesis", 0, thesisOf(props[0])),
237
+ goal: { props, using: [], goal: initGoal(props[0]), afterQed },
238
+ }));
239
+ return putFactsOf(isChaining ? usingFacts(goalState, theFacts(state)) : goalState, undefined);
240
+ };
241
+
242
+ interface Statement {
243
+ readonly props: readonly (readonly Term[])[];
244
+ readonly context: IsarContext;
245
+ readonly binds: readonly [string, number, Term][];
246
+ }
247
+
248
+ // Proof_Context.read_propp: the propositions together, then their patterns, which bind.
249
+ export const readStatement = (
250
+ context: IsarContext,
251
+ parts: readonly StatementPart[],
252
+ mode: ReadMode,
253
+ ): Statement => {
254
+ const flat = parts.flatMap((part) => part.props);
255
+ const props = readTerms(
256
+ context,
257
+ flat.map((propp) => ({ text: propp.text })),
258
+ mode,
259
+ );
260
+ const propsContext = props.reduce(declareTerm, context);
261
+ const binds = flat.flatMap((propp, index) =>
262
+ propp.patterns.length === 0
263
+ ? []
264
+ : simultMatches(
265
+ propsContext,
266
+ props[index],
267
+ readTerms(
268
+ propsContext,
269
+ propp.patterns.map((pattern) => ({ text: pattern })),
270
+ "pattern",
271
+ ),
272
+ ),
273
+ );
274
+ let offset = 0;
275
+ const grouped = parts.map((part) => {
276
+ const group = props.slice(offset, offset + part.props.length);
277
+ offset += part.props.length;
278
+ return group;
279
+ });
280
+ return {
281
+ props: grouped,
282
+ context: bindAll(propsContext, binds),
283
+ binds,
284
+ };
285
+ };
286
+
287
+ const bindAll = (context: IsarContext, binds: readonly [string, number, Term][]) =>
288
+ binds.reduce((result, bind) => bindTerm(result, ...bind), context);
289
+
290
+ // Proof.local_results: the results become named facts and the current facts.
291
+ const localResults = (
292
+ state: State,
293
+ parts: readonly StatementPart[],
294
+ results: readonly (readonly Thm[])[],
295
+ ): State => {
296
+ const noted: Thm[] = [];
297
+ const named = parts.reduce((context, part, index) => {
298
+ const [declared, thms] = applyAttributes(context, part.attributes, results[index]);
299
+ noted.push(...thms);
300
+ return part.name === undefined ? declared : putFacts(declared, part.name, thms);
301
+ }, contextOf(state));
302
+ return putFactsOf(
303
+ mapContext(state, () => named),
304
+ noted,
305
+ );
306
+ };
307
+
308
+ // Proof.local_goal for have and show, whose statements are propositions only.
309
+ const localGoal = (state: State, parts: readonly StatementPart[], afterQed: AfterQed): State => {
310
+ const statement = readStatement(contextOf(state), parts, "default");
311
+ const props = statement.props.flat();
312
+ const goalContext = props.reduce(augment, statement.context);
313
+ return genericGoal(state, goalContext, props, (resultContext, results, outer) => {
314
+ const bound = mapContext(outer, (context) => bindAll(context, statement.binds));
315
+ const exported = results.map((result) =>
316
+ exportThm(resultContext, contextOf(bound), false, result),
317
+ );
318
+ let offset = 0;
319
+ const grouped = statement.props.map((group) => {
320
+ const slice = exported.slice(offset, offset + group.length);
321
+ offset += group.length;
322
+ return slice;
323
+ });
324
+ return afterQed(resultContext, results, localResults(bound, parts, grouped));
325
+ });
326
+ };
327
+
328
+ // Proof.refine_goals: the result, exported as a rule, refines some pending goal.
329
+ const finishGoalTac = (limits: Limits, count: number): GoalTactic =>
330
+ count === 0
331
+ ? () => (state) => singleSeq(state)
332
+ : thenGoal(
333
+ normHhfTac(limits),
334
+ subgoal((goal, index) =>
335
+ isProtected(stripAssumsConcl(goal))
336
+ ? (state: Thm) =>
337
+ mapsSeq(
338
+ finishGoalTac(limits, count - 1)(index),
339
+ eresolveTac(limits, [protectI])(index)(state),
340
+ )
341
+ : finishGoalTac(limits, count - 1)(index + 1),
342
+ ),
343
+ );
344
+
345
+ const goalTac = (limits: Limits, rule: Thm): GoalTactic =>
346
+ thenGoal(
347
+ thenGoal(normHhfTac(limits), resolveTac(limits, [rule])),
348
+ finishGoalTac(limits, nprems(rule)),
349
+ );
350
+
351
+ const findGoalTac =
352
+ (tactic: GoalTactic): Tactic =>
353
+ (state) => {
354
+ const find = (index: number): Seq<Thm> =>
355
+ index > nprems(state) ? emptySeq : appendSeq(tactic(index)(state), find(index + 1));
356
+ return find(1);
357
+ };
358
+
359
+ const protectPrems = (thm: Thm): Thm => {
360
+ let result = thm;
361
+ for (let index = nprems(thm); index >= 1; index -= 1) {
362
+ const protectedResult = seqHead(
363
+ bicompose(
364
+ undefined,
365
+ { flatten: false, match: false, incremented: true },
366
+ { isElim: false, rule: incrIndexesThm(result.maxidx + 1, protectD), subgoals: 1 },
367
+ index,
368
+ result,
369
+ ),
370
+ );
371
+ if (protectedResult === undefined) throw error("protect_prems");
372
+ result = protectedResult;
373
+ }
374
+ return result;
375
+ };
376
+
377
+ const refineGoals = (resultContext: IsarContext, results: readonly Thm[], state: State): State => {
378
+ const [, goalContext, goal] = findGoal(state);
379
+ const limits = goalContext.tactics.limits;
380
+ const rules = results.map((result) =>
381
+ exportThm(resultContext, goalContext, true, protectPrems(normHhf(limits, result))),
382
+ );
383
+ const refined = rules.reduce<Seq<Thm>>(
384
+ (states, rule) => mapsSeq(findGoalTac(goalTac(limits, rule)), states),
385
+ singleSeq(goal.goal),
386
+ );
387
+ return provideGoal(state, theResult(refined, "Failed to refine any pending goal"));
388
+ };
389
+
390
+ export const have = (state: State, parts: readonly StatementPart[]) =>
391
+ localGoal(state, parts, (_context, _results, result) => result);
392
+
393
+ export const show = (state: State, parts: readonly StatementPart[]) =>
394
+ localGoal(state, parts, refineGoals);
395
+
396
+ // Proof.chain: the current facts feed the next goal.
397
+ export const chain = (state: State) =>
398
+ putMode(putFactsOf(assertMode(state, ["forward"]), theFacts(state)), "chain");
399
+
400
+ // Calculation.update_calculation: the calculation belongs to the block at the current level.
401
+ const updateCalculation = (state: State, result: readonly Thm[] | undefined): State =>
402
+ mapContext(state, (context) => ({
403
+ ...putFacts(context, "calculation", result),
404
+ calculation: result === undefined ? undefined : { result, level: state.length },
405
+ }));
406
+
407
+ // Calculation.moreover and ultimately: the current facts join the calculation, which ultimately
408
+ // passes on to the next goal.
409
+ export const collect = (state: State, isFinal: boolean): State => {
410
+ const facts = theFacts(assertMode(state, isFinal ? ["forward"] : ["forward", "chain"]));
411
+ const calculation = contextOf(state).calculation;
412
+ const previous = calculation?.level === state.length ? calculation.result : undefined;
413
+ if (previous === undefined && isFinal) throw error("No calculation yet");
414
+ const result = [...(previous ?? []), ...facts];
415
+ const updated = updateCalculation(state, result);
416
+ return isFinal
417
+ ? putMode(putFactsOf(updateCalculation(updated, undefined), result), "chain")
418
+ : updated;
419
+ };
420
+
421
+ // Proof.assume: each group of propositions becomes hypotheses, which a named group names.
422
+ const assumeProps = (
423
+ state: State,
424
+ groups: readonly {
425
+ readonly name: string | undefined;
426
+ readonly attributes: readonly AttributeSource[];
427
+ readonly props: readonly Term[];
428
+ }[],
429
+ ): State => {
430
+ assertMode(state, ["forward"]);
431
+ const props = groups.flatMap((group) => group.props);
432
+ const [thms, context] = addAssumptions(contextOf(state), false, props);
433
+ let offset = 0;
434
+ const noted: Thm[] = [];
435
+ const named = groups.reduce(
436
+ (current, group) => {
437
+ const [declared, slice] = applyAttributes(
438
+ current,
439
+ group.attributes,
440
+ thms.slice(offset, offset + group.props.length),
441
+ );
442
+ offset += group.props.length;
443
+ noted.push(...slice);
444
+ return group.name === undefined ? declared : putFacts(declared, group.name, slice);
445
+ },
446
+ props.reduce(declareTerm, context),
447
+ );
448
+ return putFactsOf(
449
+ mapContext(state, () => named),
450
+ noted,
451
+ );
452
+ };
453
+
454
+ export const assume = (state: State, parts: readonly StatementPart[]): State => {
455
+ assertMode(state, ["forward"]);
456
+ const statement = readStatement(contextOf(state), parts, "default");
457
+ return assumeProps(
458
+ mapContext(state, (context) => bindAll(context, statement.binds)),
459
+ parts.map((part, index) => ({
460
+ name: part.name,
461
+ attributes: part.attributes,
462
+ props: statement.props[index],
463
+ })),
464
+ );
465
+ };
466
+
467
+ // Proof.case: the case's fixes, under the names given, its term bindings and nested cases, then
468
+ // its assumptions, which the case's name names.
469
+ export const invokeCase = (
470
+ state: State,
471
+ binding: string | undefined,
472
+ name: string,
473
+ params: readonly (string | undefined)[],
474
+ ): State => {
475
+ const context = contextOf(assertMode(state, ["forward"]));
476
+ const ruleCase = context.cases.get(name);
477
+ if (ruleCase === undefined) throw error(`Undefined case: "${name}"`);
478
+ if (params.length > ruleCase.fixes.length) throw error(`Too many parameters for case "${name}"`);
479
+ if (ruleCase.assumes.some((assumption) => assumption.props.some(hasVars)))
480
+ throw error(`Illegal schematic variable(s) in case "${name}"`);
481
+ const fixes = ruleCase.fixes.map((fix, index) => ({ ...fix, name: params[index] ?? fix.name }));
482
+ const fixed = addFixes(
483
+ {
484
+ ...context,
485
+ types: new Map([...context.types, ...fixes.map((fix) => [fix.name, fix.type] as const)]),
486
+ },
487
+ fixes.map((fix) => fix.name),
488
+ );
489
+ const applied = applyCase(
490
+ fixes.map((fix) => mkFree(fix.name, fix.type)),
491
+ ruleCase,
492
+ );
493
+ const bound = applied.binds.reduce(
494
+ (current, bind) =>
495
+ maybeBindTerm(
496
+ current,
497
+ bind.name,
498
+ bind.index,
499
+ bind.term !== undefined && hasVars(bind.term) ? undefined : bind.term,
500
+ ),
501
+ fixed,
502
+ );
503
+ const caseName = binding ?? name;
504
+ const assumed = assumeProps(
505
+ mapContext(state, () => updateCases(bound, applied.cases)),
506
+ applied.assumes.map((assumption) => ({
507
+ name: assumption.name === "" ? undefined : `${caseName}.${assumption.name}`,
508
+ attributes: [],
509
+ props: assumption.props,
510
+ })),
511
+ );
512
+ return mapContext(assumed, (current) => putFacts(current, caseName, theFacts(assumed)));
513
+ };
514
+
515
+ // Proof.fix: the variables are arbitrary but fixed from here on.
516
+ export const fix = (state: State, variables: readonly FixedVariable[]): State =>
517
+ putFactsOf(
518
+ mapContext(assertMode(state, ["forward"]), (context) => {
519
+ const types = new Map(context.types);
520
+ for (const variable of variables)
521
+ if (variable.type === undefined) types.delete(variable.name);
522
+ else types.set(variable.name, parseType(variable.type));
523
+ return addFixes(
524
+ { ...context, types },
525
+ variables.map((variable) => variable.name),
526
+ );
527
+ }),
528
+ undefined,
529
+ );
530
+
531
+ export const next = (state: State): State =>
532
+ putFactsOf(
533
+ mapTop(openBlock(closeBlock(assertMode(state, ["forward"]))), (node) => ({
534
+ ...node,
535
+ goal: undefined,
536
+ })),
537
+ undefined,
538
+ );
539
+
540
+ export const using = (state: State, facts: readonly Thm[]): State =>
541
+ usingFacts(assertMode(state, ["backward"]), [...findGoal(state)[2].using, ...facts]);
542
+
543
+ // Proof.unfolding: the facts unfold both the goal and the facts it uses.
544
+ export const unfolding = (state: State, facts: readonly Thm[]): State =>
545
+ mapGoal(assertMode(state, ["backward"]), (context, goal) => [
546
+ context,
547
+ {
548
+ ...goal,
549
+ using: goal.using.map((thm) => unfoldRule(context.tactics, facts, thm)),
550
+ goal: unfoldGoals(context.tactics, facts, goal.goal),
551
+ },
552
+ ]);
553
+
554
+ export const from = (state: State, facts: readonly Thm[], isWith: boolean): State =>
555
+ chain(
556
+ putFactsOf(assertMode(state, ["forward"]), isWith ? [...facts, ...theFacts(state)] : facts),
557
+ );
558
+
559
+ // Proof.theorem: the lemma's goal, whose result the after_qed stores.
560
+ export const theorem = (
561
+ context: IsarContext,
562
+ props: readonly Term[],
563
+ afterQed: (resultContext: IsarContext, results: readonly Thm[]) => void,
564
+ ): State =>
565
+ genericGoal(
566
+ [{ context, facts: undefined, mode: "forward", goal: undefined }],
567
+ context,
568
+ props,
569
+ (resultContext, results, state) => {
570
+ afterQed(resultContext, results);
571
+ return state;
572
+ },
573
+ );
574
+
575
+ export const isFinished = (state: State) => state.length === 1;