tla-ts 0.0.10-dev.28c823e4b → 0.0.10-dev.4a2a53c48

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 (570) hide show
  1. package/README.md +2 -1
  2. package/dist/compile.cjs +6 -6
  3. package/dist/compile.js +10 -10
  4. package/dist/deciders.cjs +41 -37
  5. package/dist/deciders.js +57 -53
  6. package/dist/index.cjs +1 -1
  7. package/dist/index.d.cts +3 -0
  8. package/dist/index.d.ts +3 -0
  9. package/dist/index.js +1 -1
  10. package/dist/parallel-worker.cjs +1 -1
  11. package/dist/parallel-worker.js +1 -1
  12. package/dist/prove.cjs +2683 -427
  13. package/dist/prove.js +2681 -425
  14. package/dist/run.cjs +45 -42
  15. package/dist/run.js +47 -44
  16. package/dist/tlapm.cjs +2 -2
  17. package/dist/tlapm.js +2 -2
  18. package/dist/transfer.cjs +42 -39
  19. package/dist/transfer.js +44 -41
  20. package/dist/worker.cjs +7 -7
  21. package/dist/worker.js +7 -7
  22. package/package.json +1 -1
  23. package/src/ast.ts +41 -36
  24. package/src/builtins.ts +4 -13
  25. package/src/check-failure.ts +116 -0
  26. package/src/check-trace.ts +282 -0
  27. package/src/check.ts +353 -549
  28. package/src/cli/options.ts +6 -31
  29. package/src/cli/shared.ts +1 -1
  30. package/src/cli/tlapm.ts +433 -70
  31. package/src/cli/tlc-arguments.ts +222 -210
  32. package/src/cli/tlc-output.ts +687 -0
  33. package/src/cli/tlc-usage.ts +1 -2
  34. package/src/cli/tlc.ts +49 -702
  35. package/src/cli/xml-exporter.ts +23 -33
  36. package/src/codegen.ts +5 -10
  37. package/src/coverage.ts +3 -10
  38. package/src/dependencies.ts +30 -14
  39. package/src/dfid.ts +16 -16
  40. package/src/environment-config.ts +315 -0
  41. package/src/environment.ts +55 -338
  42. package/src/errors.ts +33 -5
  43. package/src/evaluate.ts +5 -4
  44. package/src/exit-codes.ts +1 -0
  45. package/src/fingerprints.ts +65 -1
  46. package/src/instances.ts +47 -10
  47. package/src/java-hash.ts +7 -0
  48. package/src/json.ts +4 -7
  49. package/src/levels.ts +39 -42
  50. package/src/lexer.ts +5 -3
  51. package/src/liveness-checker.ts +553 -237
  52. package/src/liveness.ts +94 -86
  53. package/src/obligations/action.ts +14 -17
  54. package/src/obligations/anonymize.ts +37 -16
  55. package/src/obligations/enabled-axioms.ts +218 -0
  56. package/src/obligations/equality.ts +1 -3
  57. package/src/obligations/expression.ts +36 -8
  58. package/src/obligations/format.ts +0 -2
  59. package/src/obligations/generate.ts +66 -54
  60. package/src/obligations/index.ts +38 -8
  61. package/src/obligations/levels.ts +24 -11
  62. package/src/obligations/module.ts +28 -41
  63. package/src/obligations/normalize.ts +26 -14
  64. package/src/obligations/operators.ts +0 -2
  65. package/src/obligations/pragma.ts +53 -16
  66. package/src/obligations/printer.ts +43 -13
  67. package/src/obligations/proof.ts +3 -2
  68. package/src/obligations/regroup.ts +0 -2
  69. package/src/obligations/simplify.ts +55 -50
  70. package/src/obligations/source.ts +118 -74
  71. package/src/obligations/subexpression.ts +45 -18
  72. package/src/obligations/substitution.ts +1 -3
  73. package/src/obligations/temporal.ts +5 -7
  74. package/src/obligations/tuples.ts +0 -2
  75. package/src/parallel-worker.ts +10 -30
  76. package/src/parallel.ts +24 -47
  77. package/src/parser.ts +580 -180
  78. package/src/pretty-print.ts +1 -1
  79. package/src/prover/decide-pool.ts +3 -3
  80. package/src/prover/deciders.ts +12 -9
  81. package/src/prover/isabelle/decide.ts +3 -25
  82. package/src/prover/isabelle/encode.ts +72 -42
  83. package/src/prover/isabelle/isar/attrib.ts +250 -0
  84. package/src/prover/isabelle/isar/context.ts +335 -0
  85. package/src/prover/isabelle/isar/induct.ts +382 -0
  86. package/src/prover/isabelle/isar/inner-syntax.ts +158 -7
  87. package/src/prover/isabelle/isar/method.ts +509 -212
  88. package/src/prover/isabelle/isar/proof.ts +570 -14
  89. package/src/prover/isabelle/isar/rule-cases.ts +224 -0
  90. package/src/prover/isabelle/isar/theory.ts +487 -76
  91. package/src/prover/isabelle/isar/toplevel.ts +331 -0
  92. package/src/prover/isabelle/isar/type-check.ts +89 -14
  93. package/src/prover/isabelle/provers/blast/blast.ts +7 -65
  94. package/src/prover/isabelle/provers/blast/branch.ts +0 -2
  95. package/src/prover/isabelle/provers/blast/prove.ts +0 -2
  96. package/src/prover/isabelle/provers/blast/rules.ts +0 -2
  97. package/src/prover/isabelle/provers/blast/state.ts +0 -2
  98. package/src/prover/isabelle/provers/blast/term.ts +0 -2
  99. package/src/prover/isabelle/provers/clasimp.ts +0 -2
  100. package/src/prover/isabelle/provers/classical.ts +45 -20
  101. package/src/prover/isabelle/provers/hypsubst.ts +17 -28
  102. package/src/prover/isabelle/pure/bicompose.ts +9 -27
  103. package/src/prover/isabelle/pure/consts.ts +0 -2
  104. package/src/prover/isabelle/pure/conv.ts +2 -10
  105. package/src/prover/isabelle/pure/drule.ts +72 -6
  106. package/src/prover/isabelle/pure/envir.ts +0 -2
  107. package/src/prover/isabelle/pure/goal.ts +1 -3
  108. package/src/prover/isabelle/pure/logic.ts +1 -3
  109. package/src/prover/isabelle/pure/name.ts +0 -2
  110. package/src/prover/isabelle/pure/net.ts +0 -2
  111. package/src/prover/isabelle/pure/object-logic.ts +13 -7
  112. package/src/prover/isabelle/pure/pattern.ts +0 -2
  113. package/src/prover/isabelle/pure/raw-simplifier.ts +4 -15
  114. package/src/prover/isabelle/pure/rewriter.ts +6 -17
  115. package/src/prover/isabelle/pure/search.ts +0 -2
  116. package/src/prover/isabelle/pure/seq.ts +0 -2
  117. package/src/prover/isabelle/pure/simplifier.ts +26 -7
  118. package/src/prover/isabelle/pure/table.ts +2 -3
  119. package/src/prover/isabelle/pure/tactic.ts +0 -2
  120. package/src/prover/isabelle/pure/tactical.ts +42 -37
  121. package/src/prover/isabelle/pure/term-ord.ts +0 -2
  122. package/src/prover/isabelle/pure/term.ts +0 -2
  123. package/src/prover/isabelle/pure/thm.ts +14 -13
  124. package/src/prover/isabelle/pure/type.ts +0 -2
  125. package/src/prover/isabelle/pure/unify.ts +0 -2
  126. package/src/prover/isabelle/pure/variable.ts +0 -2
  127. package/src/prover/isabelle/tla/classical-setup.ts +18 -16
  128. package/src/prover/isabelle/tla/context.ts +58 -11
  129. package/src/prover/isabelle/tla/logic-data.ts +1 -1
  130. package/src/prover/isabelle/tla/logic.ts +49 -21
  131. package/src/prover/isabelle/tla/simpdata.ts +1 -12
  132. package/src/prover/isabelle/tools/intuitionistic.ts +28 -12
  133. package/src/prover/ocaml.ts +4 -1
  134. package/src/prover/prep/action.ts +30 -31
  135. package/src/prover/prep/enabled-axioms.ts +11 -2
  136. package/src/prover/prep/fingerprint.ts +2 -5
  137. package/src/prover/prep/methods.ts +181 -51
  138. package/src/prover/prep/normalize.ts +38 -9
  139. package/src/prover/prove.ts +395 -94
  140. package/src/prover/ptl/decide.ts +95 -50
  141. package/src/prover/ptl/encode.ts +2 -3
  142. package/src/prover/ptl/tableau.ts +28 -2
  143. package/src/prover/smt/arithmetic.ts +310 -0
  144. package/src/prover/smt/axioms.ts +12 -8
  145. package/src/prover/smt/context.ts +43 -8
  146. package/src/prover/smt/data.ts +498 -379
  147. package/src/prover/smt/encode.ts +148 -57
  148. package/src/prover/smt/extensionality.ts +5 -3
  149. package/src/prover/smt/flatten.ts +4 -6
  150. package/src/prover/smt/format.ts +28 -4
  151. package/src/prover/smt/instances.ts +7 -1
  152. package/src/prover/smt/layout.ts +91 -0
  153. package/src/prover/smt/rewrite.ts +1021 -618
  154. package/src/prover/smt/simplify.ts +441 -0
  155. package/src/prover/smt/solver/ackermannize-bv-tactic.ts +61 -0
  156. package/src/prover/smt/solver/ackr-helper.ts +179 -0
  157. package/src/prover/smt/solver/ackr-model-converter.ts +105 -0
  158. package/src/prover/smt/solver/act-cache.ts +0 -1
  159. package/src/prover/smt/solver/add-bounds-tactic.ts +59 -0
  160. package/src/prover/smt/solver/aig-tactic.ts +52 -0
  161. package/src/prover/smt/solver/aig.ts +889 -0
  162. package/src/prover/smt/solver/arith-rewriter.ts +613 -6
  163. package/src/prover/smt/solver/arith-terms.ts +121 -0
  164. package/src/prover/smt/solver/array-decl-plugin.ts +175 -0
  165. package/src/prover/smt/solver/array-rewriter.ts +309 -0
  166. package/src/prover/smt/solver/asserted-formulas.ts +87 -16
  167. package/src/prover/smt/solver/ast-lt.ts +166 -12
  168. package/src/prover/smt/solver/ast-util.ts +160 -2
  169. package/src/prover/smt/solver/ast.ts +1427 -41
  170. package/src/prover/smt/solver/auf-solver.ts +2 -6
  171. package/src/prover/smt/solver/bit-blast-tactic.ts +582 -0
  172. package/src/prover/smt/solver/bit-blaster.ts +871 -0
  173. package/src/prover/smt/solver/bound-manager.ts +196 -0
  174. package/src/prover/smt/solver/bound-simplifier.ts +600 -0
  175. package/src/prover/smt/solver/bv-bound-chk.ts +492 -0
  176. package/src/prover/smt/solver/bv-decl-plugin.ts +338 -0
  177. package/src/prover/smt/solver/bv-divrem-bounds.ts +95 -0
  178. package/src/prover/smt/solver/bv-rewriter.ts +1901 -0
  179. package/src/prover/smt/solver/bv1-blast.ts +214 -0
  180. package/src/prover/smt/solver/bv2fpa-converter.ts +174 -0
  181. package/src/prover/smt/solver/bv2int-rewriter.ts +544 -0
  182. package/src/prover/smt/solver/bv2real-rewriter.ts +533 -0
  183. package/src/prover/smt/solver/card2bv.ts +110 -0
  184. package/src/prover/smt/solver/case-split-queue.ts +0 -2
  185. package/src/prover/smt/solver/cg-table.ts +39 -25
  186. package/src/prover/smt/solver/check-logic.ts +330 -0
  187. package/src/prover/smt/solver/clause.ts +0 -1
  188. package/src/prover/smt/solver/cofactor-elim-term-ite.ts +278 -0
  189. package/src/prover/smt/solver/conflict-resolution.ts +78 -2
  190. package/src/prover/smt/solver/context.ts +516 -115
  191. package/src/prover/smt/solver/ctx-simplify.ts +20 -10
  192. package/src/prover/smt/solver/ctx-solver-simplify.ts +122 -0
  193. package/src/prover/smt/solver/datatype-decl-plugin.ts +572 -0
  194. package/src/prover/smt/solver/datatype-rewriter.ts +82 -0
  195. package/src/prover/smt/solver/demodulator.ts +786 -0
  196. package/src/prover/smt/solver/dependent-expr-state.ts +81 -0
  197. package/src/prover/smt/solver/der.ts +38 -10
  198. package/src/prover/smt/solver/diff-neq.ts +206 -0
  199. package/src/prover/smt/solver/distribute-forall.ts +57 -0
  200. package/src/prover/smt/solver/dom-simplify.ts +511 -0
  201. package/src/prover/smt/solver/dt2bv-tactic.ts +260 -0
  202. package/src/prover/smt/solver/dyn-ack.ts +0 -1
  203. package/src/prover/smt/solver/e-matching.ts +7 -8
  204. package/src/prover/smt/solver/elim-small-bv-tactic.ts +129 -0
  205. package/src/prover/smt/solver/elim-uncnstr.ts +545 -0
  206. package/src/prover/smt/solver/enode.ts +100 -3
  207. package/src/prover/smt/solver/eq2bv-tactic.ts +218 -0
  208. package/src/prover/smt/solver/euf/arith-axioms.ts +403 -0
  209. package/src/prover/smt/solver/euf/arith-internalize.ts +653 -0
  210. package/src/prover/smt/solver/euf/arith-solver.ts +889 -0
  211. package/src/prover/smt/solver/euf/array-axioms.ts +527 -0
  212. package/src/prover/smt/solver/euf/array-internalize.ts +428 -0
  213. package/src/prover/smt/solver/euf/array-solver.ts +306 -0
  214. package/src/prover/smt/solver/euf/bv-ackerman.ts +162 -0
  215. package/src/prover/smt/solver/euf/bv-internalize.ts +748 -0
  216. package/src/prover/smt/solver/euf/bv-solver.ts +449 -0
  217. package/src/prover/smt/solver/euf/dt-solver.ts +618 -0
  218. package/src/prover/smt/solver/euf/egraph.ts +907 -0
  219. package/src/prover/smt/solver/euf/euf-solver.ts +1205 -0
  220. package/src/prover/smt/solver/euf/fpa-solver.ts +317 -0
  221. package/src/prover/smt/solver/euf/mam.ts +1050 -0
  222. package/src/prover/smt/solver/euf/q-ematch.ts +830 -0
  223. package/src/prover/smt/solver/euf/q-mbi.ts +587 -0
  224. package/src/prover/smt/solver/euf/q-model-fixer.ts +296 -0
  225. package/src/prover/smt/solver/euf/q-solver.ts +361 -0
  226. package/src/prover/smt/solver/euf/th-solver.ts +335 -0
  227. package/src/prover/smt/solver/euf/th-solvers.ts +30 -0
  228. package/src/prover/smt/solver/expr-ref.ts +0 -1
  229. package/src/prover/smt/solver/expr-safe-replace.ts +26 -2
  230. package/src/prover/smt/solver/expr2polynomial.ts +146 -0
  231. package/src/prover/smt/solver/factor.ts +141 -0
  232. package/src/prover/smt/solver/fd-solver.ts +265 -0
  233. package/src/prover/smt/solver/fingerprints.ts +15 -15
  234. package/src/prover/smt/solver/fix-dl-var.ts +148 -0
  235. package/src/prover/smt/solver/flat-literals.ts +0 -1
  236. package/src/prover/smt/solver/fm-tactic.ts +884 -0
  237. package/src/prover/smt/solver/fpa-decl-plugin.ts +618 -0
  238. package/src/prover/smt/solver/fpa-rewriter.ts +640 -0
  239. package/src/prover/smt/solver/fpa2bv-converter.ts +2249 -0
  240. package/src/prover/smt/solver/fpa2bv-rewriter.ts +348 -0
  241. package/src/prover/smt/solver/fpa2bv-tactic.ts +73 -0
  242. package/src/prover/smt/solver/goal.ts +175 -15
  243. package/src/prover/smt/solver/goal2nlsat.ts +189 -0
  244. package/src/prover/smt/solver/guard-set.ts +219 -0
  245. package/src/prover/smt/solver/hash.ts +0 -1
  246. package/src/prover/smt/solver/hashtable.ts +30 -16
  247. package/src/prover/smt/solver/inf-eps.ts +63 -0
  248. package/src/prover/smt/solver/inj-axiom.ts +101 -0
  249. package/src/prover/smt/solver/internalizer.ts +110 -38
  250. package/src/prover/smt/solver/lackr.ts +381 -0
  251. package/src/prover/smt/solver/lbool.ts +0 -1
  252. package/src/prover/smt/solver/lia2card.ts +268 -0
  253. package/src/prover/smt/solver/lia2pb.ts +154 -0
  254. package/src/prover/smt/solver/literal.ts +0 -1
  255. package/src/prover/smt/solver/logic-tactics.ts +345 -0
  256. package/src/prover/smt/solver/lp/bound-propagator.ts +0 -1
  257. package/src/prover/smt/solver/lp/constraints.ts +0 -1
  258. package/src/prover/smt/solver/lp/containers.ts +0 -1
  259. package/src/prover/smt/solver/lp/core-solver.ts +18 -3
  260. package/src/prover/smt/solver/lp/cross-nested.ts +0 -1
  261. package/src/prover/smt/solver/lp/dep-intervals.ts +0 -3
  262. package/src/prover/smt/solver/lp/dependency.ts +0 -2
  263. package/src/prover/smt/solver/lp/dioph-eq.ts +1 -10
  264. package/src/prover/smt/solver/lp/explanation.ts +0 -1
  265. package/src/prover/smt/solver/lp/gomory.ts +0 -1
  266. package/src/prover/smt/solver/lp/hnf-cutter.ts +1 -2
  267. package/src/prover/smt/solver/lp/hnf.ts +0 -3
  268. package/src/prover/smt/solver/lp/int-cube.ts +3 -4
  269. package/src/prover/smt/solver/lp/int-solver.ts +0 -2
  270. package/src/prover/smt/solver/lp/lar-solver.ts +40 -4
  271. package/src/prover/smt/solver/lp/lar-term.ts +0 -1
  272. package/src/prover/smt/solver/lp/lp-settings.ts +0 -1
  273. package/src/prover/smt/solver/lp/maximize-term.ts +59 -10
  274. package/src/prover/smt/solver/lp/nex-creator.ts +0 -1
  275. package/src/prover/smt/solver/lp/nex.ts +0 -1
  276. package/src/prover/smt/solver/lp/nla-backoff.ts +0 -2
  277. package/src/prover/smt/solver/lp/nla-basics.ts +0 -2
  278. package/src/prover/smt/solver/lp/nla-core.ts +42 -11
  279. package/src/prover/smt/solver/lp/nla-divisions.ts +0 -2
  280. package/src/prover/smt/solver/lp/nla-emonics.ts +0 -1
  281. package/src/prover/smt/solver/lp/nla-factorization.ts +0 -1
  282. package/src/prover/smt/solver/lp/nla-grobner.ts +9 -4
  283. package/src/prover/smt/solver/lp/nla-horner.ts +0 -2
  284. package/src/prover/smt/solver/lp/nla-intervals.ts +0 -1
  285. package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +0 -2
  286. package/src/prover/smt/solver/lp/nla-monotone.ts +0 -1
  287. package/src/prover/smt/solver/lp/nla-order.ts +0 -2
  288. package/src/prover/smt/solver/lp/nla-patcher.ts +0 -1
  289. package/src/prover/smt/solver/lp/nla-powers.ts +220 -0
  290. package/src/prover/smt/solver/lp/nla-tangents.ts +0 -2
  291. package/src/prover/smt/solver/lp/nla-throttle.ts +0 -1
  292. package/src/prover/smt/solver/lp/nla-transcendentals.ts +324 -0
  293. package/src/prover/smt/solver/lp/nla-types.ts +0 -2
  294. package/src/prover/smt/solver/lp/nla-var-eqs.ts +0 -1
  295. package/src/prover/smt/solver/lp/nra-solver.ts +25 -4
  296. package/src/prover/smt/solver/lp/numeric-pair.ts +0 -1
  297. package/src/prover/smt/solver/lp/pdd-interval.ts +0 -1
  298. package/src/prover/smt/solver/lp/pdd-simplifier.ts +0 -1
  299. package/src/prover/smt/solver/lp/pdd-solver.ts +0 -2
  300. package/src/prover/smt/solver/lp/pdd.ts +2 -2
  301. package/src/prover/smt/solver/lp/random-updater.ts +0 -2
  302. package/src/prover/smt/solver/lp/static-matrix.ts +0 -1
  303. package/src/prover/smt/solver/lp/union-find.ts +7 -2
  304. package/src/prover/smt/solver/macro-finder.ts +530 -0
  305. package/src/prover/smt/solver/mam-compiler.ts +122 -90
  306. package/src/prover/smt/solver/mam-interpreter.ts +0 -1
  307. package/src/prover/smt/solver/max-bv-sharing-tactic.ts +17 -0
  308. package/src/prover/smt/solver/max-cliques.ts +105 -0
  309. package/src/prover/smt/solver/maxcore.ts +309 -0
  310. package/src/prover/smt/solver/maximize-ac-sharing.ts +8 -6
  311. package/src/prover/smt/solver/maxlex.ts +115 -0
  312. package/src/prover/smt/solver/maxsmt-base.ts +105 -0
  313. package/src/prover/smt/solver/maxsmt.ts +92 -0
  314. package/src/prover/smt/solver/mbp/mbp-arith.ts +467 -0
  315. package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +101 -0
  316. package/src/prover/smt/solver/mbp/mbp-plugin.ts +287 -0
  317. package/src/prover/smt/solver/mbp/mbp-qel.ts +48 -0
  318. package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +271 -0
  319. package/src/prover/smt/solver/mbp/mbp-term-graph.ts +606 -0
  320. package/src/prover/smt/solver/model-based-opt.ts +844 -0
  321. package/src/prover/smt/solver/model-checker.ts +18 -27
  322. package/src/prover/smt/solver/model-evaluator.ts +188 -12
  323. package/src/prover/smt/solver/model-finder.ts +12 -18
  324. package/src/prover/smt/solver/model-generator.ts +56 -29
  325. package/src/prover/smt/solver/model-macro-solver.ts +49 -46
  326. package/src/prover/smt/solver/model-printer.ts +214 -0
  327. package/src/prover/smt/solver/mpf.ts +711 -0
  328. package/src/prover/smt/solver/mus.ts +51 -0
  329. package/src/prover/smt/solver/muz/dl-context.ts +404 -0
  330. package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +97 -0
  331. package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +167 -0
  332. package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +125 -0
  333. package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +299 -0
  334. package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +455 -0
  335. package/src/prover/smt/solver/muz/dl-mk-slice.ts +340 -0
  336. package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +163 -0
  337. package/src/prover/smt/solver/muz/dl-rule-set.ts +273 -0
  338. package/src/prover/smt/solver/muz/dl-rule-transformer.ts +123 -0
  339. package/src/prover/smt/solver/muz/dl-rule.ts +496 -0
  340. package/src/prover/smt/solver/muz/hnf.ts +201 -0
  341. package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +176 -0
  342. package/src/prover/smt/solver/muz/horn-tactic.ts +201 -0
  343. package/src/prover/smt/solver/muz/rule-properties.ts +337 -0
  344. package/src/prover/smt/solver/muz/spacer-context.ts +1406 -0
  345. package/src/prover/smt/solver/muz/spacer-dl-interface.ts +52 -0
  346. package/src/prover/smt/solver/muz/spacer-generalizers.ts +241 -0
  347. package/src/prover/smt/solver/muz/spacer-manager.ts +127 -0
  348. package/src/prover/smt/solver/muz/spacer-pdr.ts +218 -0
  349. package/src/prover/smt/solver/muz/spacer-prop-solver.ts +333 -0
  350. package/src/prover/smt/solver/muz/spacer-util.ts +282 -0
  351. package/src/prover/smt/solver/muz/substitution.ts +203 -0
  352. package/src/prover/smt/solver/nla2bv-tactic.ts +285 -0
  353. package/src/prover/smt/solver/nlqsat.ts +484 -0
  354. package/src/prover/smt/solver/nlsat/algebraic.ts +125 -12
  355. package/src/prover/smt/solver/nlsat/atoms.ts +20 -6
  356. package/src/prover/smt/solver/nlsat/evaluator.ts +0 -1
  357. package/src/prover/smt/solver/nlsat/explain.ts +63 -23
  358. package/src/prover/smt/solver/nlsat/interval-set.ts +1 -2
  359. package/src/prover/smt/solver/nlsat/levelwise.ts +3 -9
  360. package/src/prover/smt/solver/nlsat/mpbq.ts +45 -1
  361. package/src/prover/smt/solver/nlsat/polynomial.ts +13 -6
  362. package/src/prover/smt/solver/nlsat/solver.ts +234 -36
  363. package/src/prover/smt/solver/nlsat/transcendental-eval.ts +310 -0
  364. package/src/prover/smt/solver/nlsat/transcendentals.ts +367 -0
  365. package/src/prover/smt/solver/nlsat/types.ts +0 -2
  366. package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +1 -4
  367. package/src/prover/smt/solver/nlsat/upolynomial.ts +0 -2
  368. package/src/prover/smt/solver/nlsat-tactic.ts +82 -0
  369. package/src/prover/smt/solver/nnf.ts +105 -23
  370. package/src/prover/smt/solver/normalize-bounds.ts +53 -0
  371. package/src/prover/smt/solver/occf.ts +97 -0
  372. package/src/prover/smt/solver/opt-context.ts +787 -0
  373. package/src/prover/smt/solver/opt-nlsat.ts +375 -0
  374. package/src/prover/smt/solver/opt-pareto.ts +282 -0
  375. package/src/prover/smt/solver/opt-preprocess.ts +101 -0
  376. package/src/prover/smt/solver/opt-solver.ts +308 -0
  377. package/src/prover/smt/solver/opt-value.ts +55 -0
  378. package/src/prover/smt/solver/optsmt.ts +692 -0
  379. package/src/prover/smt/solver/parallel-tactic.ts +299 -0
  380. package/src/prover/smt/solver/pattern-inference.ts +19 -11
  381. package/src/prover/smt/solver/pb-rewriter.ts +284 -0
  382. package/src/prover/smt/solver/pb2bv-tactic.ts +540 -0
  383. package/src/prover/smt/solver/poly-rewriter.ts +202 -57
  384. package/src/prover/smt/solver/probes.ts +512 -0
  385. package/src/prover/smt/solver/propagate-values.ts +37 -21
  386. package/src/prover/smt/solver/proto-model.ts +648 -19
  387. package/src/prover/smt/solver/pull-quant.ts +28 -12
  388. package/src/prover/smt/solver/purify-arith.ts +632 -0
  389. package/src/prover/smt/solver/qe-arith-plugin.ts +1098 -0
  390. package/src/prover/smt/solver/qe-lite-der.ts +2 -3
  391. package/src/prover/smt/solver/qe-lite-fm.ts +3 -4
  392. package/src/prover/smt/solver/qe-lite.ts +37 -17
  393. package/src/prover/smt/solver/qe-mbp.ts +270 -0
  394. package/src/prover/smt/solver/qe.ts +1498 -0
  395. package/src/prover/smt/solver/qel.ts +25 -0
  396. package/src/prover/smt/solver/qi-queue.ts +0 -1
  397. package/src/prover/smt/solver/qsat.ts +814 -0
  398. package/src/prover/smt/solver/quant-hoist.ts +196 -0
  399. package/src/prover/smt/solver/quant-tactics.ts +16 -56
  400. package/src/prover/smt/solver/quantifier-analyzer.ts +19 -20
  401. package/src/prover/smt/solver/quantifier-manager.ts +8 -16
  402. package/src/prover/smt/solver/quasi-macros.ts +243 -0
  403. package/src/prover/smt/solver/random-gen.ts +0 -1
  404. package/src/prover/smt/solver/rational.ts +45 -1
  405. package/src/prover/smt/solver/recfun-decl-plugin.ts +261 -0
  406. package/src/prover/smt/solver/recfun-rewriter.ts +107 -0
  407. package/src/prover/smt/solver/reduce-args.ts +225 -0
  408. package/src/prover/smt/solver/reduce-bv-size.ts +119 -0
  409. package/src/prover/smt/solver/ref-vector.ts +0 -1
  410. package/src/prover/smt/solver/relevancy.ts +1 -2
  411. package/src/prover/smt/solver/rewriter-tpl.ts +77 -10
  412. package/src/prover/smt/solver/rewriter.ts +475 -36
  413. package/src/prover/smt/solver/rlimit.ts +25 -2
  414. package/src/prover/smt/solver/sat/asymm-branch.ts +325 -0
  415. package/src/prover/smt/solver/sat/big.ts +177 -0
  416. package/src/prover/smt/solver/sat/clause-use-list.ts +71 -0
  417. package/src/prover/smt/solver/sat/clause.ts +203 -0
  418. package/src/prover/smt/solver/sat/cleaner.ts +94 -0
  419. package/src/prover/smt/solver/sat/config.ts +122 -0
  420. package/src/prover/smt/solver/sat/consequences.ts +203 -0
  421. package/src/prover/smt/solver/sat/elim-eqs.ts +142 -0
  422. package/src/prover/smt/solver/sat/goal2sat.ts +526 -0
  423. package/src/prover/smt/solver/sat/inc-sat-solver.ts +378 -0
  424. package/src/prover/smt/solver/sat/model-converter.ts +136 -0
  425. package/src/prover/smt/solver/sat/pb-constraint.ts +261 -0
  426. package/src/prover/smt/solver/sat/pb-solver.ts +1577 -0
  427. package/src/prover/smt/solver/sat/probing.ts +170 -0
  428. package/src/prover/smt/solver/sat/sat-tactic.ts +43 -0
  429. package/src/prover/smt/solver/sat/sat2goal.ts +165 -0
  430. package/src/prover/smt/solver/sat/scc.ts +142 -0
  431. package/src/prover/smt/solver/sat/simplifier.ts +1618 -0
  432. package/src/prover/smt/solver/sat/solver.ts +2127 -0
  433. package/src/prover/smt/solver/sat/var-queue.ts +117 -0
  434. package/src/prover/smt/solver/sat/watch-list.ts +140 -0
  435. package/src/prover/smt/solver/search-tree.ts +284 -0
  436. package/src/prover/smt/solver/seq-axioms.ts +1010 -0
  437. package/src/prover/smt/solver/seq-decl-plugin.ts +819 -0
  438. package/src/prover/smt/solver/seq-derive.ts +1301 -0
  439. package/src/prover/smt/solver/seq-eq-approx.ts +236 -0
  440. package/src/prover/smt/solver/seq-eq-solver.ts +439 -0
  441. package/src/prover/smt/solver/seq-factory.ts +89 -0
  442. package/src/prover/smt/solver/seq-monadic.ts +728 -0
  443. package/src/prover/smt/solver/seq-range-predicate.ts +235 -0
  444. package/src/prover/smt/solver/seq-re-rewriter.ts +1170 -0
  445. package/src/prover/smt/solver/seq-re-util.ts +758 -0
  446. package/src/prover/smt/solver/seq-regex-bisim.ts +144 -0
  447. package/src/prover/smt/solver/seq-regex-live.ts +200 -0
  448. package/src/prover/smt/solver/seq-rewriter.ts +2402 -0
  449. package/src/prover/smt/solver/seq-skolem.ts +317 -0
  450. package/src/prover/smt/solver/seq-subset.ts +165 -0
  451. package/src/prover/smt/solver/seq-view-witness.ts +353 -0
  452. package/src/prover/smt/solver/smt-consequences.ts +297 -0
  453. package/src/prover/smt/solver/smt-kernel.ts +83 -0
  454. package/src/prover/smt/solver/smt-logics.ts +66 -0
  455. package/src/prover/smt/solver/smt-setup.ts +496 -0
  456. package/src/prover/smt/solver/smt2-printer.ts +765 -0
  457. package/src/prover/smt/solver/smtlib-parser.ts +3126 -316
  458. package/src/prover/smt/solver/smtlib-script.ts +1631 -0
  459. package/src/prover/smt/solver/solve-eqs.ts +929 -0
  460. package/src/prover/smt/solver/solver.ts +113 -22
  461. package/src/prover/smt/solver/static-features.ts +314 -0
  462. package/src/prover/smt/solver/sticky-generations.ts +0 -1
  463. package/src/prover/smt/solver/tactic.ts +1986 -0
  464. package/src/prover/smt/solver/term-enumeration.ts +205 -0
  465. package/src/prover/smt/solver/theory-array.ts +1240 -0
  466. package/src/prover/smt/solver/theory-bv.ts +1200 -0
  467. package/src/prover/smt/solver/theory-char.ts +355 -0
  468. package/src/prover/smt/solver/theory-datatype.ts +598 -0
  469. package/src/prover/smt/solver/theory-finite-set.ts +30 -0
  470. package/src/prover/smt/solver/theory-fpa.ts +389 -0
  471. package/src/prover/smt/solver/theory-lra-axioms.ts +53 -2
  472. package/src/prover/smt/solver/theory-lra-bounds.ts +31 -6
  473. package/src/prover/smt/solver/theory-lra-final-check.ts +56 -70
  474. package/src/prover/smt/solver/theory-lra-internalize.ts +86 -27
  475. package/src/prover/smt/solver/theory-lra-model.ts +20 -35
  476. package/src/prover/smt/solver/theory-lra-propagate.ts +24 -26
  477. package/src/prover/smt/solver/theory-lra-state.ts +6 -22
  478. package/src/prover/smt/solver/theory-lra.ts +188 -1
  479. package/src/prover/smt/solver/theory-pb.ts +934 -0
  480. package/src/prover/smt/solver/theory-polymorphism.ts +58 -0
  481. package/src/prover/smt/solver/theory-recfun.ts +307 -0
  482. package/src/prover/smt/solver/theory-seq-regex.ts +867 -0
  483. package/src/prover/smt/solver/theory-seq-solve.ts +1373 -0
  484. package/src/prover/smt/solver/theory-seq-state.ts +871 -0
  485. package/src/prover/smt/solver/theory-seq.ts +961 -0
  486. package/src/prover/smt/solver/theory.ts +189 -0
  487. package/src/prover/smt/solver/tseitin-cnf.ts +485 -0
  488. package/src/prover/smt/solver/var-subst.ts +36 -14
  489. package/src/prover/smt/table.ts +3 -2
  490. package/src/prover/smt/types.ts +146 -0
  491. package/src/prover/tlapm/cache.ts +50 -19
  492. package/src/prover/tlapm/tlapm.ts +15 -9
  493. package/src/prover/tlapm-library.ts +3208 -0
  494. package/src/prover/verdict.ts +9 -0
  495. package/src/prover/zenon/check/check.ts +1 -2
  496. package/src/prover/zenon/check/records.ts +1 -1
  497. package/src/prover/zenon/check/relations.ts +2 -1
  498. package/src/prover/zenon/check/rewrites.ts +2 -15
  499. package/src/prover/zenon/check/sets.ts +40 -58
  500. package/src/prover/zenon/check/terms.ts +1 -2
  501. package/src/prover/zenon/decide.ts +10 -7
  502. package/src/prover/zenon/encode.ts +0 -2
  503. package/src/prover/zenon/eqrel.ts +2 -2
  504. package/src/prover/zenon/equality-rules.ts +0 -2
  505. package/src/prover/zenon/expr.ts +7 -2
  506. package/src/prover/zenon/index-table.ts +9 -21
  507. package/src/prover/zenon/isar-case.ts +0 -2
  508. package/src/prover/zenon/isar.ts +35 -37
  509. package/src/prover/zenon/llproof.ts +2 -13
  510. package/src/prover/zenon/mltoll.ts +12 -30
  511. package/src/prover/zenon/node.ts +20 -5
  512. package/src/prover/zenon/parse.ts +9 -8
  513. package/src/prover/zenon/phrase.ts +0 -2
  514. package/src/prover/zenon/proof.ts +0 -2
  515. package/src/prover/zenon/propositional-rules.ts +0 -2
  516. package/src/prover/zenon/rules.ts +0 -2
  517. package/src/prover/zenon/search.ts +11 -19
  518. package/src/prover/zenon/tla/functions.ts +2 -4
  519. package/src/prover/zenon/tla/llproof.ts +9 -13
  520. package/src/prover/zenon/tla/records.ts +1 -8
  521. package/src/prover/zenon/tla/rewrites.ts +0 -2
  522. package/src/prover/zenon/tla/sets.ts +22 -22
  523. package/src/prover/zenon/tla/terms.ts +0 -2
  524. package/src/prover/zenon/tla/tla.ts +7 -8
  525. package/src/resolve.ts +56 -74
  526. package/src/runtime.ts +4 -0
  527. package/src/sany/generation.ts +394 -0
  528. package/src/sany/generator-def-entries.ts +210 -0
  529. package/src/sany/generator-definitions.ts +686 -0
  530. package/src/sany/generator-expressions.ts +1100 -0
  531. package/src/sany/generator-proofs.ts +662 -0
  532. package/src/sany/generator.ts +155 -2625
  533. package/src/sany/levels.ts +0 -2
  534. package/src/sany/lexer.ts +17 -16
  535. package/src/sany/linter.ts +0 -2
  536. package/src/sany/nodes.ts +6 -13
  537. package/src/sany/report.ts +3 -6
  538. package/src/sany/selectors.ts +35 -38
  539. package/src/sany/xml.ts +23 -55
  540. package/src/search.ts +205 -43
  541. package/src/simulate.ts +160 -133
  542. package/src/spec-description.ts +33 -48
  543. package/src/standard-definitions.ts +4 -0
  544. package/src/standard-modules.ts +16 -32
  545. package/src/state-graph.ts +2 -9
  546. package/src/substitution-levels.ts +5 -4
  547. package/src/successors.ts +6 -8
  548. package/src/symmetry.ts +2 -2
  549. package/src/tableau.ts +2 -2
  550. package/src/tlc/fingerprint.ts +81 -9
  551. package/src/tlc/messages.ts +20 -15
  552. package/src/tlc/order.ts +2 -9
  553. package/src/tlc/random.ts +4 -4
  554. package/src/tlc/replay.ts +8 -15
  555. package/src/tlc/summary.ts +29 -14
  556. package/src/tlc/tlc-operators.ts +2 -3
  557. package/src/tlc/tlcext-operators.ts +44 -12
  558. package/src/tlc/trace-spec.ts +25 -45
  559. package/src/typed-tier.ts +6535 -0
  560. package/src/typescript/actions.ts +2 -4
  561. package/src/typescript/collections.ts +34 -20
  562. package/src/typescript/compile.ts +1 -3
  563. package/src/typescript/formula.ts +5 -3
  564. package/src/typescript/model.ts +4 -5
  565. package/src/typescript/steps.ts +20 -18
  566. package/src/values.ts +63 -158
  567. package/src/prover/isabelle/isar/statement.ts +0 -52
  568. package/src/prover/smt/solver/z3-license.txt +0 -10
  569. package/src/prover/tlaps-module.ts +0 -510
  570. package/src/prover/zenon/LICENSE +0 -32
@@ -1,21 +1,40 @@
1
- // Ported from Isabelle2025's Pure/Isar/method.ML and Pure/goal.ML. Copyright (c) 1986-2025 University of Cambridge, Technische Universitaet Muenchen, and contributors, see LICENSE.
2
-
3
1
  import { TlaIsabelleError } from "../../../errors";
4
- import { asmRl, isNormHhf, normHhfEq, reflexiveThm, termI } from "../pure/drule";
5
- import { isEquals, stripImpPrems, stripAssumsConcl } from "../pure/logic";
6
- import { makeSimpContext, type Simpset } from "../pure/raw-simplifier";
7
- import { genericRewriteGoalTac } from "../pure/rewriter";
8
- import { filterSeq, mapsSeq, singleSeq, type Seq } from "../pure/seq";
2
+ import {
3
+ absDef,
4
+ asmRl,
5
+ equalsCong,
6
+ isNormHhf,
7
+ multiResolves,
8
+ normHhfEq,
9
+ reflexiveThm,
10
+ termI,
11
+ } from "../pure/drule";
12
+ import { isEquals, isImplies, listImplies, stripImpPrems, stripAssumsConcl } from "../pure/logic";
13
+ import { addSimps, congKey, makeSimpContext, type Simpset } from "../pure/raw-simplifier";
14
+ import { updateTable } from "../pure/table";
15
+ import { genericRewriteGoalTac, rewriteCterm, simpleProver } from "../pure/rewriter";
16
+ import { appendSeq, emptySeq, mapSeq, mapsSeq, ofCell, singleSeq, type Seq } from "../pure/seq";
17
+ import { fconvRule, premsConv } from "../pure/conv";
9
18
  import { atomizePremsTac } from "../pure/object-logic";
10
- import { normHhf } from "../pure/simplifier";
19
+ import { asmFullSimpTac, normHhf } from "../pure/simplifier";
11
20
  import type { Limits } from "../pure/interrupt";
12
- import { assumeTac, eresolveTac, flexflexTac, matchTac, resolveTac } from "../pure/tactic";
21
+ import {
22
+ assumeTac,
23
+ eresolveTac,
24
+ flexflexTac,
25
+ matchTac,
26
+ resolveTac,
27
+ type NetPair,
28
+ } from "../pure/tactic";
13
29
  import {
14
30
  allGoals,
31
+ allTac,
15
32
  appendGoal,
16
33
  changedProp,
17
34
  noTac,
18
35
  orElse,
36
+ primitive,
37
+ primSeq,
19
38
  repeatAllNew,
20
39
  subgoal,
21
40
  thenAllNew,
@@ -26,45 +45,56 @@ import {
26
45
  } from "../pure/tactical";
27
46
  import {
28
47
  addFreeNames,
48
+ addVars,
49
+ funTs,
50
+ listComb,
51
+ mapAtyps,
29
52
  maxidxOfTerm,
53
+ mkTVar,
30
54
  mkVar,
31
55
  stripAllBody,
32
56
  stripAllVars,
57
+ stripComb,
33
58
  substBounds,
59
+ aconv,
34
60
  type Term,
61
+ type Var,
35
62
  } from "../pure/term";
36
- import { nprems, trivial, type Thm } from "../pure/thm";
37
- import { variantList } from "../pure/name";
63
+ import {
64
+ assume,
65
+ bicompose,
66
+ conclOf,
67
+ forallIntr,
68
+ impliesElim,
69
+ impliesIntr,
70
+ incrIndexesThm,
71
+ instantiate,
72
+ nprems,
73
+ premsOf,
74
+ trivial,
75
+ type Thm,
76
+ } from "../pure/thm";
77
+ import { cleanName, variantList } from "../pure/name";
38
78
  import { autoTac, clarsimpTac, forceTac, type ClasimpContext } from "../provers/clasimp";
39
79
  import {
40
80
  addUnsafeDest,
41
81
  addUnsafeIntro,
82
+ clarifyTac,
83
+ fastTac,
42
84
  withClaset,
43
85
  type ClassicalContext,
44
86
  } from "../provers/classical";
45
- import { proverTac, type IntuitionisticContext } from "../tools/intuitionistic";
87
+ import {
88
+ findRulesNetpair,
89
+ proverTac,
90
+ type ContextRule,
91
+ type IntuitionisticContext,
92
+ } from "../tools/intuitionistic";
93
+ import { getThms, parseFactReferences } from "./attrib";
94
+ import type { IsarContext } from "./context";
95
+ import { casesMethod, type InductData } from "./induct";
46
96
  import { insertTac } from "./proof";
47
- import type { OuterToken } from "./theory";
48
-
49
- interface Modifier {
50
- readonly kind: "intro" | "dest";
51
- readonly facts: readonly string[];
52
- }
53
-
54
- type MethodText =
55
- | {
56
- readonly kind: "auto" | "blast" | "force" | "clarsimp";
57
- readonly modifiers: readonly Modifier[];
58
- }
59
- | { readonly kind: "iprover" }
60
- | { readonly kind: "intro"; readonly facts: readonly string[] }
61
- | { readonly kind: "then"; readonly methods: readonly MethodText[] }
62
- | { readonly kind: "try"; readonly method: MethodText };
63
-
64
- interface ProofText {
65
- readonly initial: MethodText;
66
- readonly terminal: MethodText | undefined;
67
- }
97
+ import { syntaxError, type MethodText, type OuterToken } from "./theory";
68
98
 
69
99
  export interface ProofContext {
70
100
  readonly limits: Limits;
@@ -72,114 +102,102 @@ export interface ProofContext {
72
102
  readonly classical: ClassicalContext;
73
103
  readonly intuitionistic: IntuitionisticContext;
74
104
  readonly atomizeRules: readonly Thm[];
105
+ // PredicateLogic.thy's [symmetric, defn] rules, which Local_Defs.meta_rewrite_rule uses.
106
+ readonly defnRules: readonly Thm[];
107
+ readonly rulifyRules: readonly Thm[];
75
108
  readonly blastDepthTac: (context: ClassicalContext, limit: number) => GoalTactic;
76
109
  readonly blastTac: (context: ClassicalContext) => GoalTactic;
77
- readonly getFact: (name: string) => readonly Thm[];
110
+ // Context_Rules' netpairs: of the rules declared with "!", without a mark and with "?".
111
+ readonly contextRules: readonly NetPair<ContextRule>[];
112
+ readonly induct: InductData;
78
113
  }
79
114
 
80
- const syntaxError = (token: OuterToken | undefined) =>
81
- new TlaIsabelleError(
82
- "ERROR",
83
- `Outer syntax error at: ${token === undefined ? "end of input" : token.text}`,
84
- );
115
+ // A method refines the goal in the context of its proof block, which its cases extend.
116
+ export interface GoalState {
117
+ readonly context: IsarContext;
118
+ readonly goal: Thm;
119
+ }
85
120
 
86
- export const parseProofText = (tokens: readonly OuterToken[]): ProofText => {
87
- let position = 0;
88
- const peek = () => tokens[position];
89
- const isSymbol = (symbol: string, offset = 0) =>
90
- tokens[position + offset]?.kind === "symbol" && tokens[position + offset].text === symbol;
91
- const expectSymbol = (symbol: string) => {
92
- if (!isSymbol(symbol)) throw syntaxError(peek());
93
- position += 1;
94
- };
95
- const isWord = () => peek()?.kind === "word";
96
- const readWord = () => {
97
- const token = peek();
98
- if (token?.kind !== "word") throw syntaxError(token);
99
- position += 1;
100
- return token.text;
101
- };
102
- const isSectionStart = () => isWord() && isSymbol(":", 1);
103
- const readFacts = () => {
104
- const names: string[] = [];
105
- while (isWord() && !isSectionStart()) names.push(readWord());
106
- return names;
107
- };
108
- const readModifiers = (): Modifier[] => {
109
- const result: Modifier[] = [];
110
- while (isSectionStart()) {
111
- const kind = readWord();
112
- position += 1;
113
- if (kind !== "intro" && kind !== "dest")
114
- throw new TlaIsabelleError("ERROR", `Unsupported method modifier: ${kind}`);
115
- result.push({ kind, facts: readFacts() });
116
- }
117
- return result;
118
- };
119
- const readMethod = (name: string, hasArgs: boolean): MethodText => {
120
- switch (name) {
121
- case "auto":
122
- case "blast":
123
- case "force":
124
- case "clarsimp":
125
- return { kind: name, modifiers: hasArgs ? readModifiers() : [] };
126
- case "iprover":
127
- return { kind: "iprover" };
128
- case "intro":
129
- return { kind: "intro", facts: hasArgs ? readFacts() : [] };
130
- default:
131
- throw new TlaIsabelleError("ERROR", `Undefined method: ${name}`);
132
- }
133
- };
134
- const readSuffixed = (text: MethodText): MethodText => {
135
- if (!isSymbol("?")) return text;
136
- position += 1;
137
- return readSuffixed({ kind: "try", method: text });
138
- };
139
- const readParenthesized = (): MethodText => {
140
- expectSymbol("(");
141
- const elements = [
142
- readSuffixed(isSymbol("(") ? readParenthesized() : readMethod(readWord(), true)),
143
- ];
144
- while (isSymbol(",")) {
145
- position += 1;
146
- elements.push(
147
- readSuffixed(isSymbol("(") ? readParenthesized() : readMethod(readWord(), true)),
148
- );
149
- }
150
- expectSymbol(")");
151
- return elements.length === 1 ? elements[0] : { kind: "then", methods: elements };
121
+ type ContextTactic = (state: GoalState) => Seq<GoalState>;
122
+
123
+ export type Method = (facts: readonly Thm[]) => ContextTactic;
124
+
125
+ // Method.METHOD: a tactic that leaves the context as it is.
126
+ const toMethod =
127
+ (method: (facts: readonly Thm[]) => Tactic): Method =>
128
+ (facts) =>
129
+ (state) =>
130
+ mapSeq((goal: Thm) => ({ context: state.context, goal }), method(facts)(state.goal));
131
+
132
+ interface Modifier {
133
+ readonly kind: "intro" | "dest" | "simp";
134
+ readonly facts: readonly Thm[];
135
+ }
136
+
137
+ // Method.sections: each modifier, such as "simp add:", takes the facts up to the next one.
138
+ const parseModifiers = (isar: IsarContext, args: readonly OuterToken[]): Modifier[] => {
139
+ const headerLength = (position: number) => {
140
+ for (let length = 1; length <= 2; length += 1)
141
+ if (args[position + length]?.kind === "symbol" && args[position + length].text === ":")
142
+ return length;
143
+ return 0;
152
144
  };
153
- const readAtom = () =>
154
- readSuffixed(isSymbol("(") ? readParenthesized() : readMethod(readWord(), false));
155
- const initial = readAtom();
156
- const terminal = position < tokens.length ? readAtom() : undefined;
157
- if (position !== tokens.length) throw syntaxError(peek());
158
- return { initial, terminal };
145
+ const modifiers: Modifier[] = [];
146
+ let position = 0;
147
+ while (position < args.length) {
148
+ const length = headerLength(position);
149
+ if (length === 0) throw syntaxError(args[position]);
150
+ const header = args
151
+ .slice(position, position + length)
152
+ .map((token) => token.text)
153
+ .join(" ");
154
+ position += length + 1;
155
+ const start = position;
156
+ while (position < args.length && headerLength(position) === 0) position += 1;
157
+ const facts = getThms(isar, parseFactReferences(args.slice(start, position)));
158
+ const kind =
159
+ header === "intro"
160
+ ? "intro"
161
+ : header === "dest"
162
+ ? "dest"
163
+ : header === "simp" || header === "simp add" || header === "add"
164
+ ? "simp"
165
+ : undefined;
166
+ if (kind === undefined)
167
+ throw new TlaIsabelleError("ERROR", `Unsupported method modifier: ${header}`);
168
+ modifiers.push({ kind, facts });
169
+ }
170
+ return modifiers;
159
171
  };
160
172
 
161
- const getFacts = (context: ProofContext, names: readonly string[]) =>
162
- names.flatMap((name) => context.getFact(name));
163
-
164
173
  const withModifiers = (context: ProofContext, modifiers: readonly Modifier[]): ClassicalContext =>
165
174
  modifiers.reduce(
166
175
  (classical, modifier) =>
167
- getFacts(context, modifier.facts).reduce(
168
- (current, fact) =>
169
- withClaset(
170
- current,
171
- modifier.kind === "intro"
172
- ? addUnsafeIntro(current, fact)
173
- : addUnsafeDest(current, fact),
176
+ modifier.kind === "simp"
177
+ ? classical
178
+ : modifier.facts.reduce(
179
+ (current, fact) =>
180
+ withClaset(
181
+ current,
182
+ modifier.kind === "intro"
183
+ ? addUnsafeIntro(current, fact, context.atomizeRules)
184
+ : addUnsafeDest(current, fact, context.atomizeRules),
185
+ ),
186
+ classical,
174
187
  ),
175
- classical,
176
- ),
177
188
  context.classical,
178
189
  );
179
190
 
180
- const getClasimp = (context: ProofContext, classical: ClassicalContext): ClasimpContext => ({
181
- classical,
182
- simp: { limits: context.limits, simpset: context.simpset, bounds: 0 },
191
+ const withSimps = (context: ProofContext, modifiers: readonly Modifier[]): Simpset => {
192
+ const simps = modifiers.flatMap((modifier) => (modifier.kind === "simp" ? modifier.facts : []));
193
+ return simps.length === 0
194
+ ? context.simpset
195
+ : addSimps({ limits: context.limits, simpset: context.simpset, bounds: 0 }, simps);
196
+ };
197
+
198
+ const getClasimp = (context: ProofContext, modifiers: readonly Modifier[]): ClasimpContext => ({
199
+ classical: withModifiers(context, modifiers),
200
+ simp: { limits: context.limits, simpset: withSimps(context, modifiers), bounds: 0 },
183
201
  blastDepthTac: context.blastDepthTac,
184
202
  });
185
203
 
@@ -189,75 +207,13 @@ const insertAllTac = (context: ProofContext, facts: readonly Thm[]) =>
189
207
  const simpleMethodHead = (context: ProofContext, facts: readonly Thm[], tactic: GoalTactic) =>
190
208
  thenGoal((index) => insertTac(context.limits, facts, index), tactic)(1);
191
209
 
192
- type Method = (facts: readonly Thm[]) => Tactic;
193
-
194
- const evaluate = (context: ProofContext, text: MethodText): Method => {
195
- switch (text.kind) {
196
- case "auto":
197
- return (facts) =>
198
- thenTac(
199
- insertAllTac(context, facts),
200
- changedProp(autoTac(getClasimp(context, withModifiers(context, text.modifiers)))),
201
- );
202
- case "clarsimp":
203
- return (facts) =>
204
- simpleMethodHead(context, facts, (index) =>
205
- changedProp(
206
- clarsimpTac(getClasimp(context, withModifiers(context, text.modifiers)))(index),
207
- ),
208
- );
209
- case "force":
210
- return (facts) =>
211
- simpleMethodHead(
212
- context,
213
- facts,
214
- forceTac(
215
- getClasimp(context, withModifiers(context, text.modifiers)),
216
- context.atomizeRules,
217
- ),
218
- );
219
- case "blast":
220
- return (facts) =>
221
- simpleMethodHead(context, facts, context.blastTac(withModifiers(context, text.modifiers)));
222
- case "iprover":
223
- return (facts) =>
224
- simpleMethodHead(
225
- context,
226
- facts,
227
- thenGoal(
228
- atomizePremsTac(context.limits, context.atomizeRules),
229
- proverTac(context.intuitionistic),
230
- ),
231
- );
232
- case "intro":
233
- return (facts) => {
234
- const rules = getFacts(context, text.facts);
235
- return simpleMethodHead(context, facts, (index) =>
236
- changedProp(repeatAllNew(matchTac(context.limits, rules))(index)),
237
- );
238
- };
239
- case "then": {
240
- const methods = text.methods.map((method) => evaluate(context, method));
241
- return (facts) => (state) =>
242
- methods.reduce<Seq<Thm>>(
243
- (results, method) => mapsSeq(method(facts), results),
244
- singleSeq(state),
245
- );
246
- }
247
- case "try": {
248
- const method = evaluate(context, text.method);
249
- return (facts) => orElse(method(facts), (state) => singleSeq(state));
250
- }
251
- }
252
- };
253
-
254
- const normHhfTac = (limits: Limits): GoalTactic => {
210
+ export const normHhfTac = (limits: Limits): GoalTactic => {
255
211
  const context = makeSimpContext(limits, [normHhfEq]);
256
212
  return thenGoal(
257
213
  resolveTac(limits, [asmRl]),
258
214
  subgoal((goal, index) =>
259
215
  isNormHhf(false, goal)
260
- ? (state) => singleSeq(state)
216
+ ? allTac
261
217
  : genericRewriteGoalTac(
262
218
  { simprem: true, useprem: false, mutsimp: false },
263
219
  () => undefined,
@@ -268,6 +224,200 @@ const normHhfTac = (limits: Limits): GoalTactic => {
268
224
  );
269
225
  };
270
226
 
227
+ // Method.rule_tac: with facts, the rules first resolve against them.
228
+ const ruleTac = (limits: Limits, rules: readonly Thm[], facts: readonly Thm[]): GoalTactic =>
229
+ thenAllNew(
230
+ (index) => (state) =>
231
+ facts.length === 0
232
+ ? resolveTac(limits, rules)(index)(state)
233
+ : mapsSeq(
234
+ (rule) => resolveTac(limits, [rule])(index)(state),
235
+ multiResolves(limits, facts, rules),
236
+ ),
237
+ normHhfTac(limits),
238
+ );
239
+
240
+ // Classical.some_rule_tac: the rules of the context and the claset's extra rules that fit the
241
+ // goal, or the first fact as an elimination rule.
242
+ const someRuleTac = (context: ProofContext, facts: readonly Thm[]): GoalTactic =>
243
+ thenAllNew(
244
+ subgoal((goal, index) => {
245
+ const [bang, plain, query] = context.contextRules.map((netpair) =>
246
+ findRulesNetpair(false, facts, goal, netpair),
247
+ );
248
+ const extra = findRulesNetpair(true, facts, goal, context.classical.claset.extra);
249
+ return (state) =>
250
+ mapsSeq(
251
+ (rule) => resolveTac(context.limits, [rule])(index)(state),
252
+ multiResolves(context.limits, facts, [...bang, ...plain, ...extra, ...query]),
253
+ );
254
+ }),
255
+ normHhfTac(context.limits),
256
+ );
257
+
258
+ // Tactic.distinct_subgoals_tac: a subgoal that occurs again is solved by its first occurrence.
259
+ const distinctSubgoalsTac: Tactic = (state) => {
260
+ const prems = premsOf(state);
261
+ const distinct = prems.filter(
262
+ (prem, index) => prems.findIndex((other) => aconv(other, prem)) === index,
263
+ );
264
+ if (distinct.length === prems.length) return singleSeq(state);
265
+ const template = listImplies(prems, conclOf(state));
266
+ const rule = impliesIntr(
267
+ template,
268
+ distinct.reduceRight(
269
+ (result, prem) => impliesIntr(prem, result),
270
+ prems.reduce((result, prem) => impliesElim(result, assume(prem)), assume(template)),
271
+ ),
272
+ );
273
+ return singleSeq(impliesElim(rule, state));
274
+ };
275
+
276
+ // Class.standard_intro_classes_tac: without facts, intro_classes_tac, whose rules conclude
277
+ // OFCLASS, so they resolve with no TLA+ goal unless its conclusion is a variable.
278
+ const standardIntroClassesTac =
279
+ (facts: readonly Thm[]): Tactic =>
280
+ (state) => {
281
+ if (facts.length > 0 || nprems(state) === 0) return emptySeq;
282
+ if (premsOf(state).some((prem) => stripComb(stripAssumsConcl(prem))[0].kind === "Var"))
283
+ throw new TlaIsabelleError("ERROR", "Unsupported intro_classes on a flexible goal");
284
+ return distinctSubgoalsTac(state);
285
+ };
286
+
287
+ // Proof_Context.fact_tac: a fact closes the goal by composition, lifted over its parameters.
288
+ const factTac = (limits: Limits, facts: readonly Thm[]): GoalTactic =>
289
+ thenGoal(normHhfTac(limits), (index) =>
290
+ facts.reduceRight<Tactic>(
291
+ (rest, fact) => (state) =>
292
+ appendSeq(
293
+ primSeq((current: Thm) =>
294
+ bicompose(
295
+ limits,
296
+ { flatten: true, match: false, incremented: true },
297
+ {
298
+ isElim: false,
299
+ rule: liftAll(index, current, incrIndexesThm(current.maxidx + 1, fact)),
300
+ subgoals: 0,
301
+ },
302
+ index,
303
+ current,
304
+ ),
305
+ )(state),
306
+ rest(state),
307
+ ),
308
+ noTac,
309
+ ),
310
+ );
311
+
312
+ // Drule.lift_all: the fact's variables become functions of the goal's parameters.
313
+ const liftAll = (index: number, state: Thm, fact: Thm): Thm => {
314
+ const vars = stripAllVars(stripImpPrems(state.prop)[index - 1]);
315
+ const names = variantList(
316
+ [],
317
+ vars.map((variable) => cleanName(variable.name)),
318
+ );
319
+ const params = vars.map((variable, position) =>
320
+ mkVar(
321
+ names[position],
322
+ fact.maxidx + 1,
323
+ mapAtyps(
324
+ (atom) =>
325
+ atom.kind === "TVar" ? mkTVar(atom.name, atom.index + fact.maxidx + 1, atom.sort) : atom,
326
+ variable.type,
327
+ ),
328
+ ),
329
+ );
330
+ const factVars = [fact.prop, ...fact.tpairs.flat()].reduceRight<Var[]>(
331
+ (found, term) => addVars(term, found),
332
+ [],
333
+ );
334
+ return params.reduceRight(
335
+ (result, param) => forallIntr(param, result),
336
+ instantiate(
337
+ factVars.map((variable) => ({
338
+ variable,
339
+ term: listComb(
340
+ mkVar(
341
+ variable.name,
342
+ variable.index,
343
+ funTs(
344
+ params.map((param) => param.type),
345
+ variable.type,
346
+ ),
347
+ ),
348
+ params,
349
+ ),
350
+ })),
351
+ fact,
352
+ ),
353
+ );
354
+ };
355
+
356
+ // Local_Defs.meta_rewrite_conv: object-level equations and implications become meta-level ones,
357
+ // and Drule.equals_cong leaves meta-level equations alone.
358
+ export const metaRewriteConv = (context: ProofContext, term: Term): Thm => {
359
+ const defnContext = makeSimpContext(context.limits, context.defnRules);
360
+ return rewriteCterm(
361
+ { simprem: false, useprem: false, mutsimp: false },
362
+ () => undefined,
363
+ {
364
+ ...defnContext,
365
+ simpset: {
366
+ ...defnContext.simpset,
367
+ congs: updateTable(
368
+ defnContext.simpset.congs,
369
+ congKey({ isConst: true, name: "Pure.eq" }),
370
+ equalsCong,
371
+ ),
372
+ },
373
+ },
374
+ term,
375
+ );
376
+ };
377
+
378
+ const metaRewriteRule = (context: ProofContext, thm: Thm): Thm =>
379
+ fconvRule((term) => metaRewriteConv(context, term), thm);
380
+
381
+ export const rewriteRule = (limits: Limits, rules: readonly Thm[], thm: Thm): Thm =>
382
+ rules.length === 0
383
+ ? thm
384
+ : fconvRule(
385
+ (term) =>
386
+ rewriteCterm(
387
+ { simprem: true, useprem: false, mutsimp: false },
388
+ simpleProver,
389
+ makeSimpContext(limits, rules),
390
+ term,
391
+ ),
392
+ thm,
393
+ );
394
+
395
+ const rewriteGoalsRule = (limits: Limits, rules: readonly Thm[], state: Thm): Thm =>
396
+ fconvRule(
397
+ premsConv((term) =>
398
+ rewriteCterm(
399
+ { simprem: true, useprem: true, mutsimp: true },
400
+ simpleProver,
401
+ makeSimpContext(limits, rules),
402
+ term,
403
+ ),
404
+ ),
405
+ state,
406
+ );
407
+
408
+ // Local_Defs.gen_unfold: the rules rewrite, then again as abstractions, which unfold the constants
409
+ // they define where they are unapplied.
410
+ const genUnfold =
411
+ (rewrite: (limits: Limits, rules: readonly Thm[], thm: Thm) => Thm) =>
412
+ (context: ProofContext, rules: readonly Thm[], thm: Thm): Thm => {
413
+ const metaRules = rules.map((rule) => metaRewriteRule(context, rule));
414
+ const absRules = metaRules.map((rule) => (isEquals(rule.prop) ? absDef(rule) : rule));
415
+ return rewrite(context.limits, absRules, rewrite(context.limits, metaRules, thm));
416
+ };
417
+
418
+ export const unfoldRule = genUnfold(rewriteRule);
419
+ export const unfoldGoals = genUnfold(rewriteGoalsRule);
420
+
271
421
  const assumeRuleTac = (limits: Limits): GoalTactic =>
272
422
  thenGoal(
273
423
  normHhfTac(limits),
@@ -284,11 +434,8 @@ const assumeRuleTac = (limits: Limits): GoalTactic =>
284
434
  );
285
435
  const rules = stripImpPrems(body).filter(
286
436
  (prem) =>
287
- prem.kind === "App" &&
288
- ((prem.fun.kind === "App" &&
289
- prem.fun.fun.kind === "Const" &&
290
- prem.fun.fun.name === "Pure.imp") ||
291
- (prem.fun.kind === "Const" && prem.fun.name === "Pure.all")),
437
+ isImplies(prem) ||
438
+ (prem.kind === "App" && prem.fun.kind === "Const" && prem.fun.name === "Pure.all"),
292
439
  );
293
440
  return rules.reduceRight<GoalTactic>(
294
441
  (tactic, rule) =>
@@ -333,22 +480,172 @@ const allAssmTac =
333
480
  allAssmTac(limits)(index + 1),
334
481
  )(state);
335
482
 
336
- export const terminalProof = (
483
+ // Method.finish of an immediate proof, as qed and by are: assumptions finish the closing step.
484
+ export const finishTac =
485
+ (limits: Limits): Tactic =>
486
+ (state) =>
487
+ mapsSeq(flexflexTac(limits), allAssmTac(limits)(1)(state));
488
+
489
+ // Seq.REPEAT, depth first.
490
+ const repeat =
491
+ (tactic: ContextTactic): ContextTactic =>
492
+ (state) => {
493
+ const results = tactic(state);
494
+ const cell = results.pull();
495
+ return cell === undefined
496
+ ? singleSeq(state)
497
+ : appendSeq(repeat(tactic)(cell[0]), mapsSeq(repeat(tactic), cell[1]));
498
+ };
499
+
500
+ const orElseContext =
501
+ (first: ContextTactic, second: ContextTactic): ContextTactic =>
502
+ (state) => {
503
+ const cell = first(state).pull();
504
+ return cell === undefined ? second(state) : ofCell(cell);
505
+ };
506
+
507
+ const methodSource = (
337
508
  context: ProofContext,
338
- text: ProofText,
339
- facts: readonly Thm[],
340
- state: Thm,
341
- ): Seq<Thm> => {
342
- const initial = evaluate(context, text.initial);
343
- const terminal = text.terminal === undefined ? undefined : evaluate(context, text.terminal);
344
- const finish: Tactic = (result) =>
345
- mapsSeq(flexflexTac(context.limits), allAssmTac(context.limits)(1)(result));
346
- return filterSeq(
347
- (result) => nprems(result) === 0,
348
- mapsSeq(
349
- (result) =>
350
- mapsSeq(finish, terminal === undefined ? singleSeq(result) : terminal([])(result)),
351
- initial(facts)(state),
352
- ),
353
- );
509
+ isar: IsarContext,
510
+ name: string,
511
+ args: readonly OuterToken[],
512
+ ): ((facts: readonly Thm[]) => Tactic) => {
513
+ const thms = () => getThms(isar, parseFactReferences(args));
514
+ const noArgs = () => {
515
+ if (args.length > 0) throw syntaxError(args[0]);
516
+ };
517
+ switch (name) {
518
+ case "auto": {
519
+ const modifiers = parseModifiers(isar, args);
520
+ return (facts) =>
521
+ thenTac(insertAllTac(context, facts), changedProp(autoTac(getClasimp(context, modifiers))));
522
+ }
523
+ case "clarsimp": {
524
+ const modifiers = parseModifiers(isar, args);
525
+ return (facts) =>
526
+ simpleMethodHead(context, facts, (index) =>
527
+ changedProp(clarsimpTac(getClasimp(context, modifiers))(index)),
528
+ );
529
+ }
530
+ case "force": {
531
+ const modifiers = parseModifiers(isar, args);
532
+ return (facts) =>
533
+ simpleMethodHead(
534
+ context,
535
+ facts,
536
+ forceTac(getClasimp(context, modifiers), context.atomizeRules),
537
+ );
538
+ }
539
+ case "blast": {
540
+ const modifiers = parseModifiers(isar, args);
541
+ return (facts) =>
542
+ simpleMethodHead(context, facts, context.blastTac(withModifiers(context, modifiers)));
543
+ }
544
+ case "fast": {
545
+ const modifiers = parseModifiers(isar, args);
546
+ return (facts) =>
547
+ simpleMethodHead(
548
+ context,
549
+ facts,
550
+ fastTac(withModifiers(context, modifiers), context.atomizeRules),
551
+ );
552
+ }
553
+ case "clarify": {
554
+ const modifiers = parseModifiers(isar, args);
555
+ return (facts) =>
556
+ simpleMethodHead(context, facts, (index) =>
557
+ changedProp(clarifyTac(withModifiers(context, modifiers))(index)),
558
+ );
559
+ }
560
+ case "simp": {
561
+ const modifiers = parseModifiers(isar, args);
562
+ if (modifiers.some((modifier) => modifier.kind !== "simp"))
563
+ throw new TlaIsabelleError("ERROR", "Unsupported method modifier for simp");
564
+ const simpset = withSimps(context, modifiers);
565
+ return (facts) =>
566
+ simpleMethodHead(context, facts, (index) =>
567
+ changedProp(asmFullSimpTac({ limits: context.limits, simpset, bounds: 0 })(index)),
568
+ );
569
+ }
570
+ case "iprover":
571
+ noArgs();
572
+ return (facts) =>
573
+ simpleMethodHead(
574
+ context,
575
+ facts,
576
+ thenGoal(
577
+ atomizePremsTac(context.limits, context.atomizeRules),
578
+ proverTac(context.intuitionistic),
579
+ ),
580
+ );
581
+ case "intro": {
582
+ const rules = thms();
583
+ return (facts) =>
584
+ simpleMethodHead(context, facts, (index) =>
585
+ changedProp(repeatAllNew(matchTac(context.limits, rules))(index)),
586
+ );
587
+ }
588
+ case "rule": {
589
+ const rules = thms();
590
+ return (facts) =>
591
+ rules.length === 0
592
+ ? someRuleTac(context, facts)(1)
593
+ : ruleTac(context.limits, rules, facts)(1);
594
+ }
595
+ case "standard":
596
+ noArgs();
597
+ return (facts) => orElse(someRuleTac(context, facts)(1), standardIntroClassesTac(facts));
598
+ case "fact": {
599
+ const rules = thms();
600
+ if (rules.length === 0) throw new TlaIsabelleError("ERROR", "Unsupported method: fact");
601
+ return (facts) => simpleMethodHead(context, facts, factTac(context.limits, rules));
602
+ }
603
+ case "unfold": {
604
+ const rules = thms();
605
+ return (facts) =>
606
+ thenTac(
607
+ insertAllTac(context, facts),
608
+ changedProp(primitive((state) => unfoldGoals(context, rules, state))),
609
+ );
610
+ }
611
+ case "-":
612
+ noArgs();
613
+ return (facts) => insertAllTac(context, facts);
614
+ default:
615
+ throw new TlaIsabelleError("ERROR", `Undefined method: ${name}`);
616
+ }
617
+ };
618
+
619
+ export const evaluate = (isar: IsarContext, text: MethodText): Method => {
620
+ const context = isar.tactics;
621
+ switch (text.kind) {
622
+ case "source":
623
+ return text.name === "cases"
624
+ ? casesMethod(isar, text.args)
625
+ : toMethod(methodSource(context, isar, text.name, text.args));
626
+ case "then": {
627
+ const methods = text.texts.map((inner) => evaluate(isar, inner));
628
+ return (facts) => (state) =>
629
+ methods.reduce<Seq<GoalState>>(
630
+ (results, method) => mapsSeq(method(facts), results),
631
+ singleSeq(state),
632
+ );
633
+ }
634
+ case "orelse": {
635
+ const methods = text.texts.map((inner) => evaluate(isar, inner));
636
+ return (facts) =>
637
+ methods.reduceRight<ContextTactic>(
638
+ (rest, method) => orElseContext(method(facts), rest),
639
+ () => emptySeq,
640
+ );
641
+ }
642
+ case "try": {
643
+ const method = evaluate(isar, text.texts[0]);
644
+ return (facts) => orElseContext(method(facts), (state) => singleSeq(state));
645
+ }
646
+ case "repeat1": {
647
+ const method = evaluate(isar, text.texts[0]);
648
+ return (facts) => (state) => mapsSeq(repeat(method(facts)), method(facts)(state));
649
+ }
650
+ }
354
651
  };