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

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 +45 -44
  15. package/dist/run.js +45 -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 +45 -42
  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 +578 -757
  29. package/src/cli/options.ts +6 -31
  30. package/src/cli/run.ts +0 -2
  31. package/src/cli/runtime-invariants.ts +27 -62
  32. package/src/cli/shared.ts +1 -5
  33. package/src/cli/tlapm.ts +433 -70
  34. package/src/cli/tlc-arguments.ts +246 -240
  35. package/src/cli/tlc-output.ts +686 -0
  36. package/src/cli/tlc-usage.ts +3 -5
  37. package/src/cli/tlc.ts +59 -707
  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 +73 -338
  45. package/src/errors.ts +33 -5
  46. package/src/evaluate.ts +34 -107
  47. package/src/exit-codes.ts +3 -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 +634 -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 +17 -31
  81. package/src/parallel.ts +55 -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 +165 -83
  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 +6 -3
  308. package/src/prover/smt/solver/lp/pdd-simplifier.ts +60 -21
  309. package/src/prover/smt/solver/lp/pdd-solver.ts +72 -41
  310. package/src/prover/smt/solver/lp/pdd.ts +725 -289
  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 +17 -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 +244 -53
  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 +36 -50
  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 +70 -29
  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
@@ -0,0 +1,250 @@
1
+ import { TlaIsabelleError } from "../../../errors";
2
+ import { addUnsafeDest, addUnsafeElim, addUnsafeIntro, withClaset } from "../provers/classical";
3
+ import { asmRl, compIncr, genAll, multiResolves, zeroVarIndexes } from "../pure/drule";
4
+ import { addSimps } from "../pure/raw-simplifier";
5
+ import { chopSeq } from "../pure/seq";
6
+ import { stripImpConcl } from "../pure/logic";
7
+ import { fastypeOf, type Var } from "../pure/term";
8
+ import { instantiate, instantiateTypes, type Thm } from "../pure/thm";
9
+ import { emptyTyEnv, matchTypes, substType, type TyEnv } from "../pure/type";
10
+ import { getFact, readTerms, varsOf, type IsarContext } from "./context";
11
+ import { rewriteRule, type ProofContext } from "./method";
12
+ import {
13
+ innerText,
14
+ syntaxError,
15
+ type AttributeSource,
16
+ type FactReference,
17
+ type OuterToken,
18
+ } from "./theory";
19
+
20
+ const isInnerToken = (token: OuterToken | undefined) =>
21
+ token !== undefined &&
22
+ (token.kind === "string" ||
23
+ token.kind === "cartouche" ||
24
+ token.kind === "word" ||
25
+ token.kind === "var");
26
+
27
+ export const parseFactReferences = (tokens: readonly OuterToken[]): FactReference[] => {
28
+ const references: FactReference[] = [];
29
+ let position = 0;
30
+ while (position < tokens.length) {
31
+ const token = tokens[position];
32
+ if (token.kind !== "word") throw syntaxError(token);
33
+ position += 1;
34
+ const attributes: AttributeSource[] = [];
35
+ if (tokens[position]?.kind === "symbol" && tokens[position].text === "[") {
36
+ position += 1;
37
+ for (;;) {
38
+ const attribute = tokens[position];
39
+ if (attribute?.kind !== "word") throw syntaxError(attribute);
40
+ position += 1;
41
+ const start = position;
42
+ let depth = 0;
43
+ while (
44
+ position < tokens.length &&
45
+ !(
46
+ depth === 0 &&
47
+ tokens[position].kind === "symbol" &&
48
+ (tokens[position].text === "," || tokens[position].text === "]")
49
+ )
50
+ ) {
51
+ if (tokens[position].kind === "symbol" && "([".includes(tokens[position].text))
52
+ depth += 1;
53
+ if (tokens[position].kind === "symbol" && ")]".includes(tokens[position].text))
54
+ depth -= 1;
55
+ position += 1;
56
+ }
57
+ attributes.push({ name: attribute.text, args: tokens.slice(start, position) });
58
+ if (tokens[position]?.text === "]") break;
59
+ position += 1;
60
+ }
61
+ position += 1;
62
+ }
63
+ references.push({ name: token.text, attributes });
64
+ }
65
+ return references;
66
+ };
67
+
68
+ const varsOfThm = (thm: Thm) => varsOf([...thm.tpairs.flat(), thm.prop]);
69
+
70
+ // Rule_Insts.where_rule: the terms are read against the variables' types, whose type variables
71
+ // they instantiate, then Drule.instantiate_normalize.
72
+ const whereRule = (
73
+ context: IsarContext,
74
+ insts: readonly { readonly name: string; readonly index: number; readonly text: string }[],
75
+ thm: Thm,
76
+ ): Thm => {
77
+ const vars = varsOfThm(thm);
78
+ const targets = insts.map((inst) => {
79
+ const variable = vars.find((other) => other.name === inst.name && other.index === inst.index);
80
+ if (variable === undefined)
81
+ throw new TlaIsabelleError(
82
+ "ERROR",
83
+ `No such variable in theorem: "?${inst.name}${inst.index === 0 ? "" : inst.index}"`,
84
+ );
85
+ return variable;
86
+ });
87
+ const terms = readTerms(
88
+ context,
89
+ insts.map((inst, index) => ({ text: inst.text, type: targets[index].type })),
90
+ "default",
91
+ );
92
+ const tyenv = targets.reduce<TyEnv>((env, target, index) => {
93
+ const matched = matchTypes(target.type, fastypeOf(terms[index]), env);
94
+ if (matched === undefined)
95
+ throw new TlaIsabelleError("ERROR", "Type mismatch in instantiation");
96
+ return matched;
97
+ }, emptyTyEnv);
98
+ const instantiated = instantiate(
99
+ targets.map((target, index) => ({
100
+ variable: { ...target, type: substType(tyenv, target.type) },
101
+ term: terms[index],
102
+ })),
103
+ instantiateTypes(tyenv, thm),
104
+ );
105
+ return compIncr(instantiated, asmRl);
106
+ };
107
+
108
+ // Rule_Insts.of_rule: the terms instantiate the theorem's variables in the order they occur,
109
+ // those after concl: the conclusion's.
110
+ const ofRule = (context: IsarContext, args: readonly OuterToken[], thm: Thm): Thm => {
111
+ const concl = args.findIndex(
112
+ (token, index) => token.text === "concl" && args[index + 1]?.text === ":",
113
+ );
114
+ const [premises, conclusion] =
115
+ concl < 0 ? [args, []] : [args.slice(0, concl), args.slice(concl + 2)];
116
+ const zipVars = (vars: readonly Var[], tokens: readonly OuterToken[]) => {
117
+ if (tokens.length > vars.length)
118
+ throw new TlaIsabelleError("ERROR", "More instantiations than variables in theorem");
119
+ return tokens.flatMap((token, index) => {
120
+ if (!isInnerToken(token)) throw syntaxError(token);
121
+ return token.kind === "word" && token.text === "_"
122
+ ? []
123
+ : [{ name: vars[index].name, index: vars[index].index, text: innerText(token) }];
124
+ });
125
+ };
126
+ return whereRule(
127
+ context,
128
+ [
129
+ ...zipVars(varsOfThm(thm), premises),
130
+ ...zipVars(varsOf([stripImpConcl(thm.prop)]), conclusion),
131
+ ],
132
+ thm,
133
+ );
134
+ };
135
+
136
+ const parseWhere = (args: readonly OuterToken[]) => {
137
+ const insts: { name: string; index: number; text: string }[] = [];
138
+ let position = 0;
139
+ while (position < args.length) {
140
+ const variable = args[position];
141
+ if ((variable.kind !== "word" && variable.kind !== "var") || variable.text.startsWith("'"))
142
+ throw syntaxError(variable);
143
+ const digits = /\d*$/.exec(variable.text)?.[0] ?? "";
144
+ if (args[position + 1]?.text !== "=" || !isInnerToken(args[position + 2]))
145
+ throw syntaxError(args[position + 1]);
146
+ insts.push({
147
+ name: variable.text.slice(
148
+ variable.kind === "var" ? 1 : 0,
149
+ variable.text.length - digits.length,
150
+ ),
151
+ index: Number(digits || 0),
152
+ text: innerText(args[position + 2]),
153
+ });
154
+ position += 3;
155
+ if (position < args.length) {
156
+ if (args[position].text !== "and") throw syntaxError(args[position]);
157
+ position += 1;
158
+ }
159
+ }
160
+ return insts;
161
+ };
162
+
163
+ // Drule.OF: the facts resolve against the rule's premises, from the first, with a unique result.
164
+ const ofFacts = (context: IsarContext, rule: Thm, facts: readonly Thm[]): Thm => {
165
+ const [results] = chopSeq(2, multiResolves(context.tactics.limits, facts, [rule]));
166
+ if (results.length === 0) throw new TlaIsabelleError("THM", "OF: no unifiers");
167
+ if (results.length > 1) throw new TlaIsabelleError("THM", "OF: multiple unifiers");
168
+ return results[0];
169
+ };
170
+
171
+ // Object_Logic.rulify: object-level rules become meta-level ones.
172
+ const rulify = (context: IsarContext, thm: Thm): Thm =>
173
+ zeroVarIndexes(genAll(rewriteRule(context.tactics.limits, context.tactics.rulifyRules, thm)));
174
+
175
+ // Simplifier.simp_add and Classical's unsafe_intro, unsafe_elim and unsafe_dest: the declarations
176
+ // that add the theorem to a set the methods read.
177
+ const declareRule = (tactics: ProofContext, name: string, thm: Thm): ProofContext => {
178
+ if (name === "simp")
179
+ return {
180
+ ...tactics,
181
+ simpset: addSimps({ limits: tactics.limits, simpset: tactics.simpset, bounds: 0 }, [thm]),
182
+ };
183
+ const classical = tactics.classical;
184
+ const add = name === "intro" ? addUnsafeIntro : name === "elim" ? addUnsafeElim : addUnsafeDest;
185
+ return {
186
+ ...tactics,
187
+ classical: withClaset(classical, add(classical, thm, tactics.atomizeRules)),
188
+ };
189
+ };
190
+
191
+ // Thm.apply_attribute: a rule attribute changes the theorem, a declaration the context.
192
+ const applyAttribute = (
193
+ context: IsarContext,
194
+ attribute: AttributeSource,
195
+ thm: Thm,
196
+ ): [IsarContext, Thm] => {
197
+ switch (attribute.name) {
198
+ case "of":
199
+ return [context, ofRule(context, attribute.args, thm)];
200
+ case "where":
201
+ return [context, whereRule(context, parseWhere(attribute.args), thm)];
202
+ case "rule_format":
203
+ if (attribute.args.length > 0) throw syntaxError(attribute.args[0]);
204
+ return [context, rulify(context, thm)];
205
+ case "OF":
206
+ return [
207
+ context,
208
+ ofFacts(context, thm, getThms(context, parseFactReferences(attribute.args))),
209
+ ];
210
+ case "simp":
211
+ case "intro":
212
+ case "elim":
213
+ case "dest":
214
+ if (attribute.args.length > 0)
215
+ throw new TlaIsabelleError("ERROR", `Unsupported ${attribute.name} attribute arguments`);
216
+ return [{ ...context, tactics: declareRule(context.tactics, attribute.name, thm) }, thm];
217
+ default:
218
+ throw new TlaIsabelleError("ERROR", `Unsupported attribute: ${attribute.name}`);
219
+ }
220
+ };
221
+
222
+ // Thm.proof_attributes over a fact's theorems: each attribute sees what those before it declared.
223
+ export const applyAttributes = (
224
+ context: IsarContext,
225
+ attributes: readonly AttributeSource[],
226
+ thms: readonly Thm[],
227
+ ): [IsarContext, Thm[]] =>
228
+ thms.reduce<[IsarContext, Thm[]]>(
229
+ ([current, results], thm) => {
230
+ const [declared, result] = attributes.reduce<[IsarContext, Thm]>(
231
+ ([inner, changed], attribute) => applyAttribute(inner, attribute, changed),
232
+ [current, thm],
233
+ );
234
+ return [declared, [...results, result]];
235
+ },
236
+ [context, []],
237
+ );
238
+
239
+ // The facts a command or a method cites, where the port keeps no declaration.
240
+ export const getThms = (context: IsarContext, references: readonly FactReference[]): Thm[] =>
241
+ references.flatMap((reference) => {
242
+ const [declared, thms] = applyAttributes(
243
+ context,
244
+ reference.attributes,
245
+ getFact(context, reference.name),
246
+ );
247
+ if (declared !== context)
248
+ throw new TlaIsabelleError("ERROR", "Unsupported declaration in a fact reference");
249
+ return thms;
250
+ });
@@ -0,0 +1,335 @@
1
+ import { TlaIsabelleError } from "../../../errors";
2
+ import { protectD } from "../pure/drule";
3
+ import { above, betaNorm, emptyEnvir, normTerm, type Envir } from "../pure/envir";
4
+ import { incrIndexes, protect } from "../pure/logic";
5
+ import { filterSeq, seqHead } from "../pure/seq";
6
+ import { normHhf, normHhfProtect } from "../pure/simplifier";
7
+ import {
8
+ fastypeOf,
9
+ mapAtyps,
10
+ mapTypes,
11
+ maxidxOfTerm,
12
+ mkTVar,
13
+ mkVar,
14
+ propT,
15
+ updateAbs,
16
+ updateApp,
17
+ type Term,
18
+ type Typ,
19
+ type Var,
20
+ } from "../pure/term";
21
+ import { assume, generalize, impliesElim, impliesIntr, instantiate, type Thm } from "../pure/thm";
22
+ import { smashUnifiers } from "../pure/unify";
23
+ import type { ConstInfo } from "../tla/logic";
24
+ import { parseProp, parseTerm } from "./inner-syntax";
25
+ import type { ProofContext } from "./method";
26
+ import type { Cases, RuleCase } from "./rule-cases";
27
+ import { checkProps } from "./type-check";
28
+
29
+ export interface NameScope {
30
+ readonly consts: ReadonlyMap<string, ConstInfo>;
31
+ readonly constNames: ReadonlyMap<string, string>;
32
+ }
33
+
34
+ interface Assumption {
35
+ // Assumption.assume_export discharges a goal's assumption as a protected premise, presume_export
36
+ // never does.
37
+ readonly isPresumed: boolean;
38
+ readonly props: readonly Term[];
39
+ }
40
+
41
+ export interface IsarContext {
42
+ readonly scope: NameScope;
43
+ readonly getGlobalFact: (name: string) => readonly Thm[];
44
+ readonly tactics: ProofContext;
45
+ readonly fixes: readonly string[];
46
+ // Variable.default_type: the types of the free variables the context declares.
47
+ readonly types: ReadonlyMap<string, Typ>;
48
+ readonly assumptions: readonly Assumption[];
49
+ readonly facts: ReadonlyMap<string, readonly Thm[]>;
50
+ readonly binds: ReadonlyMap<string, Term>;
51
+ // Calculation.get_calculation: the facts that moreover collects in the block at this level.
52
+ readonly calculation: { readonly result: readonly Thm[]; readonly level: number } | undefined;
53
+ // Variable.is_body: statements in a proof body fix none of their free variables.
54
+ readonly isBody: boolean;
55
+ // Proof_Context.cases_of: the named cases that the case command invokes.
56
+ readonly cases: ReadonlyMap<string, RuleCase>;
57
+ }
58
+
59
+ export type ReadMode = "default" | "schematic" | "pattern";
60
+
61
+ const bindKey = (name: string, index: number) => `${name}.${index}`;
62
+
63
+ export const getFact = (context: IsarContext, name: string): readonly Thm[] =>
64
+ context.facts.get(name) ?? context.getGlobalFact(name);
65
+
66
+ // Proof_Context.put_thms: without theorems, the name is no longer bound.
67
+ export const putFacts = (
68
+ context: IsarContext,
69
+ name: string,
70
+ thms: readonly Thm[] | undefined,
71
+ ): IsarContext => ({
72
+ ...context,
73
+ facts: new Map(
74
+ thms === undefined
75
+ ? [...context.facts].filter((entry) => entry[0] !== name)
76
+ : [...context.facts, [name, thms]],
77
+ ),
78
+ });
79
+
80
+ const freeNames = (term: Term, names: string[] = []): string[] => {
81
+ if (term.kind === "Free" && !names.includes(term.name)) names.push(term.name);
82
+ if (term.kind === "Abs") freeNames(term.body, names);
83
+ if (term.kind === "App") {
84
+ freeNames(term.fun, names);
85
+ freeNames(term.arg, names);
86
+ }
87
+ return names;
88
+ };
89
+
90
+ const freeTypes = (term: Term, types: Map<string, Typ>): Map<string, Typ> => {
91
+ if (term.kind === "Free" && !types.has(term.name)) types.set(term.name, term.type);
92
+ if (term.kind === "Abs") freeTypes(term.body, types);
93
+ if (term.kind === "App") {
94
+ freeTypes(term.fun, types);
95
+ freeTypes(term.arg, types);
96
+ }
97
+ return types;
98
+ };
99
+
100
+ // Variable.declare_term: a term's free variables keep their types.
101
+ export const declareTerm = (context: IsarContext, term: Term): IsarContext => ({
102
+ ...context,
103
+ types: freeTypes(term, new Map(context.types)),
104
+ });
105
+
106
+ export const addFixes = (context: IsarContext, names: readonly string[]): IsarContext => {
107
+ const duplicate = names.find((name, index) => names.indexOf(name) !== index);
108
+ if (duplicate !== undefined)
109
+ throw new TlaIsabelleError("ERROR", `Duplicate fixed variable(s): ${duplicate}`);
110
+ return { ...context, fixes: [...context.fixes, ...names] };
111
+ };
112
+
113
+ // Proof_Context.augment: outside a proof body, a statement fixes its free variables.
114
+ export const augment = (context: IsarContext, term: Term): IsarContext =>
115
+ declareTerm(
116
+ context.isBody
117
+ ? context
118
+ : addFixes(
119
+ context,
120
+ freeNames(term).filter((name) => !context.fixes.includes(name)),
121
+ ),
122
+ term,
123
+ );
124
+
125
+ export const bindTerm = (context: IsarContext, name: string, index: number, term: Term) =>
126
+ declareTerm(
127
+ { ...context, binds: new Map([...context.binds, [bindKey(name, index), term]]) },
128
+ term,
129
+ );
130
+
131
+ // Proof_Context.maybe_bind_term: without a term, the name is no longer bound.
132
+ export const maybeBindTerm = (
133
+ context: IsarContext,
134
+ name: string,
135
+ index: number,
136
+ term: Term | undefined,
137
+ ) =>
138
+ term === undefined
139
+ ? {
140
+ ...context,
141
+ binds: new Map([...context.binds].filter((entry) => entry[0] !== bindKey(name, index))),
142
+ }
143
+ : bindTerm(context, name, index, term);
144
+
145
+ // Proof_Context.update_cases: a case without a context is no longer defined.
146
+ export const updateCases = (context: IsarContext, cases: Cases): IsarContext => ({
147
+ ...context,
148
+ cases: cases.reduce((result, entry) => {
149
+ if (entry.name === "") return result;
150
+ const updated = new Map(result);
151
+ if (entry.case === undefined) updated.delete(entry.name);
152
+ else updated.set(entry.name, entry.case);
153
+ return updated;
154
+ }, context.cases),
155
+ });
156
+
157
+ const expandBinds = (context: IsarContext, term: Term): Term => {
158
+ const expand = (current: Term): Term => {
159
+ switch (current.kind) {
160
+ case "Var":
161
+ return context.binds.get(bindKey(current.name, current.index)) ?? current;
162
+ case "Abs":
163
+ return updateAbs(current, expand(current.body));
164
+ case "App":
165
+ return updateApp(current, expand(current.fun), expand(current.arg));
166
+ default:
167
+ return current;
168
+ }
169
+ };
170
+ return betaNorm(expand(term));
171
+ };
172
+
173
+ // Syntax.read_props and Syntax.read_terms in a mode: an item without a type is a proposition.
174
+ export const readTerms = (
175
+ context: IsarContext,
176
+ items: readonly { readonly text: string; readonly type?: Typ }[],
177
+ mode: ReadMode,
178
+ ): Term[] => {
179
+ const checked = checkProps(
180
+ context.scope,
181
+ items.map((item) => ({
182
+ ast: item.type === undefined ? parseProp(item.text) : parseTerm(item.text),
183
+ fixed: new Set(context.fixes),
184
+ type: item.type,
185
+ })),
186
+ {
187
+ fixedTypes: context.types,
188
+ varTypes:
189
+ mode === "pattern"
190
+ ? undefined
191
+ : (name, index) => {
192
+ const bound = context.binds.get(bindKey(name, index));
193
+ return bound === undefined ? undefined : fastypeOf(bound);
194
+ },
195
+ isPattern: mode === "pattern",
196
+ },
197
+ );
198
+ if (mode === "pattern") return checked;
199
+ const expanded = checked.map((term) => expandBinds(context, term));
200
+ if (mode === "default" && varsOf(expanded).length > 0)
201
+ throw new TlaIsabelleError("ERROR", "Unbound schematic variable");
202
+ return expanded;
203
+ };
204
+
205
+ // Unify.matchers: the variables that the patterns bring, above the object's, move back down.
206
+ const decrIndexes = (term: Term, maxidx: number, offset: number): Term => {
207
+ const decrType = (type: Typ) =>
208
+ mapAtyps(
209
+ (atom) =>
210
+ atom.kind === "TVar" && atom.index > maxidx
211
+ ? mkTVar(atom.name, atom.index - offset, atom.sort)
212
+ : atom,
213
+ type,
214
+ );
215
+ const decrVars = (current: Term): Term => {
216
+ switch (current.kind) {
217
+ case "Var":
218
+ return current.index > maxidx
219
+ ? mkVar(current.name, current.index - offset, current.type)
220
+ : current;
221
+ case "Abs":
222
+ return updateAbs(current, decrVars(current.body));
223
+ case "App":
224
+ return updateApp(current, decrVars(current.fun), decrVars(current.arg));
225
+ default:
226
+ return current;
227
+ }
228
+ };
229
+ return decrVars(mapTypes(decrType, term));
230
+ };
231
+
232
+ // Vars.add_vars: the variables in the order they occur.
233
+ export const varsOf = (terms: readonly Term[]): Var[] => {
234
+ const found: Var[] = [];
235
+ const visit = (term: Term) => {
236
+ if (
237
+ term.kind === "Var" &&
238
+ !found.some((other) => other.name === term.name && other.index === term.index)
239
+ )
240
+ found.push(term);
241
+ if (term.kind === "Abs") visit(term.body);
242
+ if (term.kind === "App") {
243
+ visit(term.fun);
244
+ visit(term.arg);
245
+ }
246
+ };
247
+ for (const term of terms) visit(term);
248
+ return found;
249
+ };
250
+
251
+ // Proof_Context.simult_matches by Unify.matchers: the patterns match by a unifier that leaves the
252
+ // object's variables alone, and the first one binds.
253
+ export const simultMatches = (
254
+ context: IsarContext,
255
+ object: Term,
256
+ patterns: readonly Term[],
257
+ ): [string, number, Term][] => {
258
+ const maxidx = maxidxOfTerm(object);
259
+ const offset = maxidx + 1;
260
+ const pairs = patterns.map((pattern): [Term, Term] => [incrIndexes([], offset, pattern), object]);
261
+ const envir = seqHead(
262
+ filterSeq(
263
+ (candidate: Envir) => above(candidate, maxidx),
264
+ smashUnifiers(
265
+ context.tactics.limits,
266
+ pairs,
267
+ emptyEnvir(pairs.reduce((result, pair) => Math.max(result, maxidxOfTerm(pair[0])), maxidx)),
268
+ ),
269
+ ),
270
+ );
271
+ if (envir === undefined) throw new TlaIsabelleError("ERROR", "Pattern match failed!");
272
+ return varsOf(pairs.map((pair) => pair[0])).flatMap((variable): [string, number, Term][] => {
273
+ const normalized = normTerm(envir, variable);
274
+ return normalized.kind === "Var" &&
275
+ normalized.name === variable.name &&
276
+ normalized.index === variable.index
277
+ ? []
278
+ : [[variable.name, variable.index - offset, decrIndexes(normalized, maxidx, offset)]];
279
+ });
280
+ };
281
+
282
+ // Assumption.add_assms: each proposition becomes a hypothesis.
283
+ export const addAssumptions = (
284
+ context: IsarContext,
285
+ isPresumed: boolean,
286
+ props: readonly Term[],
287
+ ): [Thm[], IsarContext] => [
288
+ props.map((prop) => normHhf(context.tactics.limits, assume(prop))),
289
+ { ...context, assumptions: [...context.assumptions, { isPresumed, props }] },
290
+ ];
291
+
292
+ export const assumptionsOf = (context: IsarContext) =>
293
+ context.assumptions.flatMap((assumption) => assumption.props);
294
+
295
+ const impliesIntrProtected = (props: readonly Term[], thm: Thm): Thm =>
296
+ props.reduceRight(
297
+ (result, prop) => impliesIntr(protect(prop), result),
298
+ props.reduce(
299
+ (result, prop) =>
300
+ impliesElim(
301
+ result,
302
+ impliesElim(
303
+ instantiate([{ variable: mkVar("A", 0, propT), term: prop }], protectD),
304
+ assume(protect(prop)),
305
+ ),
306
+ ),
307
+ props.reduceRight((result, prop) => impliesIntr(prop, result), thm),
308
+ ),
309
+ );
310
+
311
+ // Proof_Context.export_: Assumption.export, then Variable.export.
312
+ export const exportThm = (
313
+ inner: IsarContext,
314
+ outer: IsarContext,
315
+ isGoal: boolean,
316
+ thm: Thm,
317
+ ): Thm => {
318
+ const discharged = normHhfProtect(
319
+ inner.tactics.limits,
320
+ inner.assumptions
321
+ .slice(outer.assumptions.length)
322
+ .reduceRight(
323
+ (result, assumption) =>
324
+ isGoal && !assumption.isPresumed
325
+ ? impliesIntrProtected(assumption.props, result)
326
+ : assumption.props.reduceRight((current, prop) => impliesIntr(prop, current), result),
327
+ normHhfProtect(inner.tactics.limits, thm),
328
+ ),
329
+ );
330
+ return generalize(
331
+ inner.fixes.filter((name) => !outer.fixes.includes(name)),
332
+ discharged.maxidx + 1,
333
+ discharged,
334
+ );
335
+ };