tla-ts 0.0.9 → 0.0.10-dev.09e53c2a6

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 (625) hide show
  1. package/README.md +30 -1
  2. package/dist/compile.cjs +23 -0
  3. package/dist/compile.js +23 -0
  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 +109 -10
  8. package/dist/index.d.ts +109 -10
  9. package/dist/index.js +1 -1
  10. package/dist/parallel-worker.cjs +1 -1
  11. package/dist/parallel-worker.js +1 -1
  12. package/dist/prove-worker.cjs +1 -1
  13. package/dist/prove-worker.js +1 -1
  14. package/dist/prove.cjs +2746 -410
  15. package/dist/prove.js +2745 -409
  16. package/dist/run.cjs +146 -31
  17. package/dist/run.js +146 -31
  18. package/dist/tlapm.cjs +2 -2
  19. package/dist/tlapm.js +2 -2
  20. package/dist/transfer.cjs +132 -104
  21. package/dist/transfer.js +132 -104
  22. package/dist/worker.cjs +6 -6
  23. package/dist/worker.js +6 -6
  24. package/package.json +3 -1
  25. package/src/ast.ts +45 -59
  26. package/src/bags.ts +99 -102
  27. package/src/builtins.ts +28 -75
  28. package/src/bundled-modules.ts +1 -8
  29. package/src/check-failure.ts +116 -0
  30. package/src/check-trace.ts +282 -0
  31. package/src/check.ts +797 -782
  32. package/src/cli/options.ts +12 -32
  33. package/src/cli/run.ts +0 -2
  34. package/src/cli/runtime-invariants.ts +136 -0
  35. package/src/cli/shared.ts +19 -12
  36. package/src/cli/tlapm.ts +433 -82
  37. package/src/cli/tlc-arguments.ts +652 -0
  38. package/src/cli/tlc-output.ts +687 -0
  39. package/src/cli/tlc-usage.ts +360 -0
  40. package/src/cli/tlc.ts +323 -658
  41. package/src/cli/typescript.ts +23 -0
  42. package/src/cli/xml-exporter.ts +27 -49
  43. package/src/cli.ts +0 -1
  44. package/src/codegen.ts +196 -74
  45. package/src/config.ts +140 -109
  46. package/src/coverage.ts +830 -0
  47. package/src/dependencies.ts +36 -54
  48. package/src/dfid.ts +618 -0
  49. package/src/environment-config.ts +315 -0
  50. package/src/environment.ts +178 -339
  51. package/src/errors.ts +100 -57
  52. package/src/evaluate.ts +598 -340
  53. package/src/exit-codes.ts +38 -3
  54. package/src/fingerprints.ts +75 -11
  55. package/src/index.ts +3 -0
  56. package/src/instances.ts +126 -21
  57. package/src/java-hash.ts +7 -0
  58. package/src/java-overrides.ts +4 -19
  59. package/src/json-reader.ts +455 -0
  60. package/src/json.ts +252 -139
  61. package/src/levels.ts +46 -58
  62. package/src/lexer.ts +83 -101
  63. package/src/liveness-checker.ts +590 -311
  64. package/src/liveness.ts +180 -124
  65. package/src/obligations/action.ts +17 -44
  66. package/src/obligations/anonymize.ts +120 -95
  67. package/src/obligations/enabled-axioms.ts +218 -0
  68. package/src/obligations/equality.ts +1 -3
  69. package/src/obligations/expression.ts +37 -26
  70. package/src/obligations/format.ts +0 -10
  71. package/src/obligations/generate.ts +66 -64
  72. package/src/obligations/index.ts +38 -19
  73. package/src/obligations/levels.ts +27 -18
  74. package/src/obligations/module.ts +28 -55
  75. package/src/obligations/normalize.ts +30 -37
  76. package/src/obligations/operators.ts +0 -3
  77. package/src/obligations/pragma.ts +52 -24
  78. package/src/obligations/printer.ts +89 -58
  79. package/src/obligations/proof.ts +3 -6
  80. package/src/obligations/regroup.ts +0 -5
  81. package/src/obligations/simplify.ts +57 -63
  82. package/src/obligations/source.ts +119 -95
  83. package/src/obligations/subexpression.ts +49 -28
  84. package/src/obligations/substitution.ts +1 -5
  85. package/src/obligations/temporal.ts +12 -20
  86. package/src/obligations/tuples.ts +2 -10
  87. package/src/parallel-worker.ts +30 -60
  88. package/src/parallel.ts +59 -73
  89. package/src/parser.ts +1082 -399
  90. package/src/pcal/ast.ts +53 -86
  91. package/src/pcal/parse.ts +144 -219
  92. package/src/pcal/tokenize.ts +91 -131
  93. package/src/pcal/translate.ts +83 -130
  94. package/src/pcal/validate.ts +48 -68
  95. package/src/pretty-print.ts +7 -8
  96. package/src/prover/decide-pool.ts +8 -13
  97. package/src/prover/deciders.ts +12 -13
  98. package/src/prover/first-order.ts +0 -11
  99. package/src/prover/isabelle/decide.ts +3 -31
  100. package/src/prover/isabelle/encode.ts +82 -64
  101. package/src/prover/isabelle/isar/attrib.ts +250 -0
  102. package/src/prover/isabelle/isar/context.ts +335 -0
  103. package/src/prover/isabelle/isar/induct.ts +382 -0
  104. package/src/prover/isabelle/isar/inner-syntax.ts +262 -117
  105. package/src/prover/isabelle/isar/method.ts +510 -226
  106. package/src/prover/isabelle/isar/proof.ts +570 -23
  107. package/src/prover/isabelle/isar/rule-cases.ts +224 -0
  108. package/src/prover/isabelle/isar/theory.ts +488 -88
  109. package/src/prover/isabelle/isar/toplevel.ts +331 -0
  110. package/src/prover/isabelle/isar/type-check.ts +99 -38
  111. package/src/prover/isabelle/provers/blast/blast.ts +16 -105
  112. package/src/prover/isabelle/provers/blast/branch.ts +0 -33
  113. package/src/prover/isabelle/provers/blast/prove.ts +0 -36
  114. package/src/prover/isabelle/provers/blast/rules.ts +5 -45
  115. package/src/prover/isabelle/provers/blast/state.ts +1 -29
  116. package/src/prover/isabelle/provers/blast/term.ts +8 -37
  117. package/src/prover/isabelle/provers/clasimp.ts +0 -14
  118. package/src/prover/isabelle/provers/classical.ts +58 -61
  119. package/src/prover/isabelle/provers/hypsubst.ts +27 -52
  120. package/src/prover/isabelle/pure/bicompose.ts +24 -39
  121. package/src/prover/isabelle/pure/consts.ts +0 -8
  122. package/src/prover/isabelle/pure/conv.ts +2 -18
  123. package/src/prover/isabelle/pure/drule.ts +95 -45
  124. package/src/prover/isabelle/pure/envir.ts +2 -53
  125. package/src/prover/isabelle/pure/goal.ts +1 -9
  126. package/src/prover/isabelle/pure/interrupt.ts +0 -5
  127. package/src/prover/isabelle/pure/list.ts +0 -3
  128. package/src/prover/isabelle/pure/logic.ts +1 -16
  129. package/src/prover/isabelle/pure/name.ts +1 -10
  130. package/src/prover/isabelle/pure/net.ts +2 -60
  131. package/src/prover/isabelle/pure/object-logic.ts +15 -16
  132. package/src/prover/isabelle/pure/pattern.ts +1 -20
  133. package/src/prover/isabelle/pure/raw-simplifier.ts +16 -63
  134. package/src/prover/isabelle/pure/rewriter.ts +31 -74
  135. package/src/prover/isabelle/pure/search.ts +2 -11
  136. package/src/prover/isabelle/pure/seq.ts +0 -11
  137. package/src/prover/isabelle/pure/simplifier.ts +27 -16
  138. package/src/prover/isabelle/pure/table.ts +2 -33
  139. package/src/prover/isabelle/pure/tactic.ts +11 -23
  140. package/src/prover/isabelle/pure/tactical.ts +47 -48
  141. package/src/prover/isabelle/pure/term-ord.ts +1 -7
  142. package/src/prover/isabelle/pure/term.ts +1 -44
  143. package/src/prover/isabelle/pure/thm.ts +26 -48
  144. package/src/prover/isabelle/pure/type.ts +1 -16
  145. package/src/prover/isabelle/pure/unify.ts +19 -31
  146. package/src/prover/isabelle/pure/variable.ts +2 -8
  147. package/src/prover/isabelle/tla/classical-setup.ts +17 -25
  148. package/src/prover/isabelle/tla/context.ts +65 -26
  149. package/src/prover/isabelle/tla/logic-data.ts +1 -1
  150. package/src/prover/isabelle/tla/logic.ts +53 -32
  151. package/src/prover/isabelle/tla/simpdata.ts +45 -44
  152. package/src/prover/isabelle/tools/intuitionistic.ts +28 -21
  153. package/src/prover/ocaml.ts +4 -7
  154. package/src/prover/prep/action.ts +33 -66
  155. package/src/prover/prep/enabled-axioms.ts +22 -20
  156. package/src/prover/prep/fingerprint.ts +2 -21
  157. package/src/prover/prep/level-comparison.ts +8 -12
  158. package/src/prover/prep/md5.ts +0 -2
  159. package/src/prover/prep/methods.ts +189 -86
  160. package/src/prover/prep/normalize.ts +42 -37
  161. package/src/prover/prove-worker.ts +0 -2
  162. package/src/prover/prove.ts +398 -133
  163. package/src/prover/ptl/decide.ts +96 -56
  164. package/src/prover/ptl/encode.ts +15 -38
  165. package/src/prover/ptl/sat.ts +24 -32
  166. package/src/prover/ptl/tableau.ts +40 -28
  167. package/src/prover/smt/arithmetic.ts +310 -0
  168. package/src/prover/smt/axioms.ts +12 -15
  169. package/src/prover/smt/context.ts +60 -32
  170. package/src/prover/smt/data.ts +517 -401
  171. package/src/prover/smt/encode.ts +155 -85
  172. package/src/prover/smt/extensionality.ts +5 -13
  173. package/src/prover/smt/flatten.ts +7 -28
  174. package/src/prover/smt/format.ts +33 -14
  175. package/src/prover/smt/instances.ts +7 -11
  176. package/src/prover/smt/layout.ts +91 -0
  177. package/src/prover/smt/rewrite.ts +1026 -658
  178. package/src/prover/smt/simplify.ts +441 -0
  179. package/src/prover/smt/solver/ackermannize-bv-tactic.ts +61 -0
  180. package/src/prover/smt/solver/ackr-helper.ts +179 -0
  181. package/src/prover/smt/solver/ackr-model-converter.ts +105 -0
  182. package/src/prover/smt/solver/act-cache.ts +0 -16
  183. package/src/prover/smt/solver/add-bounds-tactic.ts +59 -0
  184. package/src/prover/smt/solver/aig-tactic.ts +52 -0
  185. package/src/prover/smt/solver/aig.ts +889 -0
  186. package/src/prover/smt/solver/arith-rewriter.ts +615 -53
  187. package/src/prover/smt/solver/arith-terms.ts +121 -0
  188. package/src/prover/smt/solver/array-decl-plugin.ts +175 -0
  189. package/src/prover/smt/solver/array-rewriter.ts +309 -0
  190. package/src/prover/smt/solver/array.ts +1 -3
  191. package/src/prover/smt/solver/asserted-formulas.ts +87 -58
  192. package/src/prover/smt/solver/ast-lt.ts +166 -22
  193. package/src/prover/smt/solver/ast-util.ts +160 -7
  194. package/src/prover/smt/solver/ast.ts +1424 -180
  195. package/src/prover/smt/solver/auf-solver.ts +7 -44
  196. package/src/prover/smt/solver/bit-blast-tactic.ts +582 -0
  197. package/src/prover/smt/solver/bit-blaster.ts +871 -0
  198. package/src/prover/smt/solver/bound-manager.ts +196 -0
  199. package/src/prover/smt/solver/bound-simplifier.ts +600 -0
  200. package/src/prover/smt/solver/bv-bound-chk.ts +492 -0
  201. package/src/prover/smt/solver/bv-decl-plugin.ts +338 -0
  202. package/src/prover/smt/solver/bv-divrem-bounds.ts +95 -0
  203. package/src/prover/smt/solver/bv-rewriter.ts +1901 -0
  204. package/src/prover/smt/solver/bv1-blast.ts +214 -0
  205. package/src/prover/smt/solver/bv2fpa-converter.ts +174 -0
  206. package/src/prover/smt/solver/bv2int-rewriter.ts +544 -0
  207. package/src/prover/smt/solver/bv2real-rewriter.ts +533 -0
  208. package/src/prover/smt/solver/card2bv.ts +110 -0
  209. package/src/prover/smt/solver/case-split-queue.ts +0 -10
  210. package/src/prover/smt/solver/cg-table.ts +39 -42
  211. package/src/prover/smt/solver/check-logic.ts +330 -0
  212. package/src/prover/smt/solver/clause.ts +0 -27
  213. package/src/prover/smt/solver/cofactor-elim-term-ite.ts +278 -0
  214. package/src/prover/smt/solver/conflict-resolution.ts +78 -11
  215. package/src/prover/smt/solver/context.ts +519 -175
  216. package/src/prover/smt/solver/ctx-simplify.ts +33 -50
  217. package/src/prover/smt/solver/ctx-solver-simplify.ts +122 -0
  218. package/src/prover/smt/solver/datatype-decl-plugin.ts +572 -0
  219. package/src/prover/smt/solver/datatype-rewriter.ts +82 -0
  220. package/src/prover/smt/solver/demodulator.ts +786 -0
  221. package/src/prover/smt/solver/dependent-expr-state.ts +81 -0
  222. package/src/prover/smt/solver/der.ts +39 -30
  223. package/src/prover/smt/solver/diff-neq.ts +206 -0
  224. package/src/prover/smt/solver/distribute-forall.ts +57 -0
  225. package/src/prover/smt/solver/dom-simplify.ts +511 -0
  226. package/src/prover/smt/solver/dt2bv-tactic.ts +260 -0
  227. package/src/prover/smt/solver/dyn-ack.ts +0 -11
  228. package/src/prover/smt/solver/e-matching.ts +9 -41
  229. package/src/prover/smt/solver/elim-small-bv-tactic.ts +129 -0
  230. package/src/prover/smt/solver/elim-uncnstr.ts +545 -0
  231. package/src/prover/smt/solver/enode.ts +100 -23
  232. package/src/prover/smt/solver/eq2bv-tactic.ts +218 -0
  233. package/src/prover/smt/solver/euf/arith-axioms.ts +403 -0
  234. package/src/prover/smt/solver/euf/arith-internalize.ts +653 -0
  235. package/src/prover/smt/solver/euf/arith-solver.ts +889 -0
  236. package/src/prover/smt/solver/euf/array-axioms.ts +527 -0
  237. package/src/prover/smt/solver/euf/array-internalize.ts +428 -0
  238. package/src/prover/smt/solver/euf/array-solver.ts +306 -0
  239. package/src/prover/smt/solver/euf/bv-ackerman.ts +162 -0
  240. package/src/prover/smt/solver/euf/bv-internalize.ts +748 -0
  241. package/src/prover/smt/solver/euf/bv-solver.ts +449 -0
  242. package/src/prover/smt/solver/euf/dt-solver.ts +618 -0
  243. package/src/prover/smt/solver/euf/egraph.ts +907 -0
  244. package/src/prover/smt/solver/euf/euf-solver.ts +1205 -0
  245. package/src/prover/smt/solver/euf/fpa-solver.ts +317 -0
  246. package/src/prover/smt/solver/euf/mam.ts +1050 -0
  247. package/src/prover/smt/solver/euf/q-ematch.ts +830 -0
  248. package/src/prover/smt/solver/euf/q-mbi.ts +587 -0
  249. package/src/prover/smt/solver/euf/q-model-fixer.ts +296 -0
  250. package/src/prover/smt/solver/euf/q-solver.ts +361 -0
  251. package/src/prover/smt/solver/euf/th-solver.ts +335 -0
  252. package/src/prover/smt/solver/euf/th-solvers.ts +30 -0
  253. package/src/prover/smt/solver/expr-ref.ts +0 -5
  254. package/src/prover/smt/solver/expr-safe-replace.ts +26 -7
  255. package/src/prover/smt/solver/expr2polynomial.ts +146 -0
  256. package/src/prover/smt/solver/factor.ts +141 -0
  257. package/src/prover/smt/solver/fd-solver.ts +265 -0
  258. package/src/prover/smt/solver/fingerprints.ts +15 -26
  259. package/src/prover/smt/solver/fix-dl-var.ts +148 -0
  260. package/src/prover/smt/solver/flat-literals.ts +0 -9
  261. package/src/prover/smt/solver/fm-tactic.ts +884 -0
  262. package/src/prover/smt/solver/fpa-decl-plugin.ts +618 -0
  263. package/src/prover/smt/solver/fpa-rewriter.ts +640 -0
  264. package/src/prover/smt/solver/fpa2bv-converter.ts +2249 -0
  265. package/src/prover/smt/solver/fpa2bv-rewriter.ts +348 -0
  266. package/src/prover/smt/solver/fpa2bv-tactic.ts +73 -0
  267. package/src/prover/smt/solver/goal.ts +176 -28
  268. package/src/prover/smt/solver/goal2nlsat.ts +189 -0
  269. package/src/prover/smt/solver/guard-set.ts +219 -0
  270. package/src/prover/smt/solver/hash.ts +0 -9
  271. package/src/prover/smt/solver/hashtable.ts +26 -23
  272. package/src/prover/smt/solver/inf-eps.ts +63 -0
  273. package/src/prover/smt/solver/inj-axiom.ts +101 -0
  274. package/src/prover/smt/solver/internalizer.ts +112 -132
  275. package/src/prover/smt/solver/lackr.ts +381 -0
  276. package/src/prover/smt/solver/lbool.ts +0 -2
  277. package/src/prover/smt/solver/lia2card.ts +268 -0
  278. package/src/prover/smt/solver/lia2pb.ts +154 -0
  279. package/src/prover/smt/solver/literal.ts +0 -4
  280. package/src/prover/smt/solver/logic-tactics.ts +345 -0
  281. package/src/prover/smt/solver/lp/bound-propagator.ts +7 -26
  282. package/src/prover/smt/solver/lp/constraints.ts +1 -8
  283. package/src/prover/smt/solver/lp/containers.ts +11 -30
  284. package/src/prover/smt/solver/lp/core-solver.ts +23 -29
  285. package/src/prover/smt/solver/lp/cross-nested.ts +5 -20
  286. package/src/prover/smt/solver/lp/dep-intervals.ts +6 -24
  287. package/src/prover/smt/solver/lp/dependency.ts +0 -5
  288. package/src/prover/smt/solver/lp/dioph-eq.ts +8 -103
  289. package/src/prover/smt/solver/lp/explanation.ts +0 -6
  290. package/src/prover/smt/solver/lp/gomory.ts +8 -22
  291. package/src/prover/smt/solver/lp/hnf-cutter.ts +16 -23
  292. package/src/prover/smt/solver/lp/hnf.ts +10 -28
  293. package/src/prover/smt/solver/lp/int-cube.ts +17 -39
  294. package/src/prover/smt/solver/lp/int-solver.ts +3 -35
  295. package/src/prover/smt/solver/lp/lar-solver.ts +69 -82
  296. package/src/prover/smt/solver/lp/lar-term.ts +0 -5
  297. package/src/prover/smt/solver/lp/lp-settings.ts +0 -14
  298. package/src/prover/smt/solver/lp/maximize-term.ts +76 -52
  299. package/src/prover/smt/solver/lp/nex-creator.ts +4 -28
  300. package/src/prover/smt/solver/lp/nex.ts +0 -6
  301. package/src/prover/smt/solver/lp/nla-backoff.ts +0 -5
  302. package/src/prover/smt/solver/lp/nla-basics.ts +48 -30
  303. package/src/prover/smt/solver/lp/nla-core.ts +91 -135
  304. package/src/prover/smt/solver/lp/nla-divisions.ts +31 -43
  305. package/src/prover/smt/solver/lp/nla-emonics.ts +3 -21
  306. package/src/prover/smt/solver/lp/nla-factorization.ts +0 -4
  307. package/src/prover/smt/solver/lp/nla-grobner.ts +22 -72
  308. package/src/prover/smt/solver/lp/nla-horner.ts +2 -12
  309. package/src/prover/smt/solver/lp/nla-intervals.ts +1 -12
  310. package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +15 -42
  311. package/src/prover/smt/solver/lp/nla-monotone.ts +1 -6
  312. package/src/prover/smt/solver/lp/nla-order.ts +0 -13
  313. package/src/prover/smt/solver/lp/nla-patcher.ts +3 -7
  314. package/src/prover/smt/solver/lp/nla-powers.ts +220 -0
  315. package/src/prover/smt/solver/lp/nla-tangents.ts +0 -10
  316. package/src/prover/smt/solver/lp/nla-throttle.ts +0 -6
  317. package/src/prover/smt/solver/lp/nla-transcendentals.ts +324 -0
  318. package/src/prover/smt/solver/lp/nla-types.ts +0 -12
  319. package/src/prover/smt/solver/lp/nla-var-eqs.ts +4 -26
  320. package/src/prover/smt/solver/lp/nra-solver.ts +123 -112
  321. package/src/prover/smt/solver/lp/numeric-pair.ts +0 -4
  322. package/src/prover/smt/solver/lp/pdd-interval.ts +0 -3
  323. package/src/prover/smt/solver/lp/pdd-simplifier.ts +1 -14
  324. package/src/prover/smt/solver/lp/pdd-solver.ts +2 -33
  325. package/src/prover/smt/solver/lp/pdd.ts +7 -70
  326. package/src/prover/smt/solver/lp/random-updater.ts +0 -9
  327. package/src/prover/smt/solver/lp/static-matrix.ts +8 -19
  328. package/src/prover/smt/solver/lp/union-find.ts +5 -5
  329. package/src/prover/smt/solver/macro-finder.ts +530 -0
  330. package/src/prover/smt/solver/mam-compiler.ts +129 -139
  331. package/src/prover/smt/solver/mam-interpreter.ts +0 -21
  332. package/src/prover/smt/solver/max-bv-sharing-tactic.ts +17 -0
  333. package/src/prover/smt/solver/max-cliques.ts +105 -0
  334. package/src/prover/smt/solver/maxcore.ts +309 -0
  335. package/src/prover/smt/solver/maximize-ac-sharing.ts +8 -21
  336. package/src/prover/smt/solver/maxlex.ts +115 -0
  337. package/src/prover/smt/solver/maxsmt-base.ts +105 -0
  338. package/src/prover/smt/solver/maxsmt.ts +92 -0
  339. package/src/prover/smt/solver/mbp/mbp-arith.ts +467 -0
  340. package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +101 -0
  341. package/src/prover/smt/solver/mbp/mbp-plugin.ts +287 -0
  342. package/src/prover/smt/solver/mbp/mbp-qel.ts +48 -0
  343. package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +271 -0
  344. package/src/prover/smt/solver/mbp/mbp-term-graph.ts +606 -0
  345. package/src/prover/smt/solver/model-based-opt.ts +844 -0
  346. package/src/prover/smt/solver/model-checker.ts +19 -62
  347. package/src/prover/smt/solver/model-evaluator.ts +190 -40
  348. package/src/prover/smt/solver/model-finder.ts +14 -32
  349. package/src/prover/smt/solver/model-generator.ts +56 -40
  350. package/src/prover/smt/solver/model-macro-solver.ts +60 -114
  351. package/src/prover/smt/solver/model-printer.ts +214 -0
  352. package/src/prover/smt/solver/mpf.ts +711 -0
  353. package/src/prover/smt/solver/mus.ts +51 -0
  354. package/src/prover/smt/solver/muz/dl-context.ts +404 -0
  355. package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +97 -0
  356. package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +167 -0
  357. package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +125 -0
  358. package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +299 -0
  359. package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +455 -0
  360. package/src/prover/smt/solver/muz/dl-mk-slice.ts +340 -0
  361. package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +163 -0
  362. package/src/prover/smt/solver/muz/dl-rule-set.ts +273 -0
  363. package/src/prover/smt/solver/muz/dl-rule-transformer.ts +123 -0
  364. package/src/prover/smt/solver/muz/dl-rule.ts +496 -0
  365. package/src/prover/smt/solver/muz/hnf.ts +201 -0
  366. package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +176 -0
  367. package/src/prover/smt/solver/muz/horn-tactic.ts +201 -0
  368. package/src/prover/smt/solver/muz/rule-properties.ts +337 -0
  369. package/src/prover/smt/solver/muz/spacer-context.ts +1406 -0
  370. package/src/prover/smt/solver/muz/spacer-dl-interface.ts +52 -0
  371. package/src/prover/smt/solver/muz/spacer-generalizers.ts +241 -0
  372. package/src/prover/smt/solver/muz/spacer-manager.ts +127 -0
  373. package/src/prover/smt/solver/muz/spacer-pdr.ts +218 -0
  374. package/src/prover/smt/solver/muz/spacer-prop-solver.ts +333 -0
  375. package/src/prover/smt/solver/muz/spacer-util.ts +282 -0
  376. package/src/prover/smt/solver/muz/substitution.ts +203 -0
  377. package/src/prover/smt/solver/nla2bv-tactic.ts +285 -0
  378. package/src/prover/smt/solver/nlqsat.ts +484 -0
  379. package/src/prover/smt/solver/nlsat/algebraic.ts +177 -160
  380. package/src/prover/smt/solver/nlsat/atoms.ts +24 -24
  381. package/src/prover/smt/solver/nlsat/evaluator.ts +16 -22
  382. package/src/prover/smt/solver/nlsat/explain.ts +65 -69
  383. package/src/prover/smt/solver/nlsat/interval-set.ts +9 -51
  384. package/src/prover/smt/solver/nlsat/levelwise.ts +48 -135
  385. package/src/prover/smt/solver/nlsat/mpbq.ts +47 -14
  386. package/src/prover/smt/solver/nlsat/polynomial.ts +29 -161
  387. package/src/prover/smt/solver/nlsat/solver.ts +241 -110
  388. package/src/prover/smt/solver/nlsat/transcendental-eval.ts +310 -0
  389. package/src/prover/smt/solver/nlsat/transcendentals.ts +367 -0
  390. package/src/prover/smt/solver/nlsat/types.ts +0 -9
  391. package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +1 -47
  392. package/src/prover/smt/solver/nlsat/upolynomial.ts +10 -93
  393. package/src/prover/smt/solver/nlsat-tactic.ts +82 -0
  394. package/src/prover/smt/solver/nnf.ts +107 -60
  395. package/src/prover/smt/solver/normalize-bounds.ts +53 -0
  396. package/src/prover/smt/solver/occf.ts +97 -0
  397. package/src/prover/smt/solver/opt-context.ts +787 -0
  398. package/src/prover/smt/solver/opt-nlsat.ts +375 -0
  399. package/src/prover/smt/solver/opt-pareto.ts +282 -0
  400. package/src/prover/smt/solver/opt-preprocess.ts +101 -0
  401. package/src/prover/smt/solver/opt-solver.ts +308 -0
  402. package/src/prover/smt/solver/opt-value.ts +55 -0
  403. package/src/prover/smt/solver/optsmt.ts +692 -0
  404. package/src/prover/smt/solver/parallel-tactic.ts +299 -0
  405. package/src/prover/smt/solver/pattern-inference.ts +21 -26
  406. package/src/prover/smt/solver/pb-rewriter.ts +284 -0
  407. package/src/prover/smt/solver/pb2bv-tactic.ts +540 -0
  408. package/src/prover/smt/solver/poly-rewriter.ts +204 -79
  409. package/src/prover/smt/solver/probes.ts +512 -0
  410. package/src/prover/smt/solver/propagate-values.ts +37 -30
  411. package/src/prover/smt/solver/proto-model.ts +650 -66
  412. package/src/prover/smt/solver/pull-quant.ts +28 -23
  413. package/src/prover/smt/solver/purify-arith.ts +632 -0
  414. package/src/prover/smt/solver/qe-arith-plugin.ts +1098 -0
  415. package/src/prover/smt/solver/qe-lite-der.ts +2 -31
  416. package/src/prover/smt/solver/qe-lite-fm.ts +4 -28
  417. package/src/prover/smt/solver/qe-lite.ts +39 -49
  418. package/src/prover/smt/solver/qe-mbp.ts +270 -0
  419. package/src/prover/smt/solver/qe.ts +1498 -0
  420. package/src/prover/smt/solver/qel.ts +25 -0
  421. package/src/prover/smt/solver/qi-queue.ts +0 -16
  422. package/src/prover/smt/solver/qsat.ts +814 -0
  423. package/src/prover/smt/solver/quant-hoist.ts +196 -0
  424. package/src/prover/smt/solver/quant-tactics.ts +17 -74
  425. package/src/prover/smt/solver/quantifier-analyzer.ts +26 -47
  426. package/src/prover/smt/solver/quantifier-manager.ts +8 -23
  427. package/src/prover/smt/solver/quasi-macros.ts +243 -0
  428. package/src/prover/smt/solver/random-gen.ts +0 -2
  429. package/src/prover/smt/solver/rational.ts +45 -8
  430. package/src/prover/smt/solver/recfun-decl-plugin.ts +261 -0
  431. package/src/prover/smt/solver/recfun-rewriter.ts +107 -0
  432. package/src/prover/smt/solver/reduce-args.ts +225 -0
  433. package/src/prover/smt/solver/reduce-bv-size.ts +119 -0
  434. package/src/prover/smt/solver/ref-vector.ts +0 -6
  435. package/src/prover/smt/solver/relevancy.ts +2 -16
  436. package/src/prover/smt/solver/rewriter-tpl.ts +52 -129
  437. package/src/prover/smt/solver/rewriter.ts +477 -120
  438. package/src/prover/smt/solver/rlimit.ts +39 -21
  439. package/src/prover/smt/solver/sat/asymm-branch.ts +325 -0
  440. package/src/prover/smt/solver/sat/big.ts +177 -0
  441. package/src/prover/smt/solver/sat/clause-use-list.ts +71 -0
  442. package/src/prover/smt/solver/sat/clause.ts +203 -0
  443. package/src/prover/smt/solver/sat/cleaner.ts +94 -0
  444. package/src/prover/smt/solver/sat/config.ts +122 -0
  445. package/src/prover/smt/solver/sat/consequences.ts +203 -0
  446. package/src/prover/smt/solver/sat/elim-eqs.ts +142 -0
  447. package/src/prover/smt/solver/sat/goal2sat.ts +526 -0
  448. package/src/prover/smt/solver/sat/inc-sat-solver.ts +378 -0
  449. package/src/prover/smt/solver/sat/model-converter.ts +136 -0
  450. package/src/prover/smt/solver/sat/pb-constraint.ts +261 -0
  451. package/src/prover/smt/solver/sat/pb-solver.ts +1577 -0
  452. package/src/prover/smt/solver/sat/probing.ts +170 -0
  453. package/src/prover/smt/solver/sat/sat-tactic.ts +43 -0
  454. package/src/prover/smt/solver/sat/sat2goal.ts +165 -0
  455. package/src/prover/smt/solver/sat/scc.ts +142 -0
  456. package/src/prover/smt/solver/sat/simplifier.ts +1618 -0
  457. package/src/prover/smt/solver/sat/solver.ts +2127 -0
  458. package/src/prover/smt/solver/sat/var-queue.ts +117 -0
  459. package/src/prover/smt/solver/sat/watch-list.ts +140 -0
  460. package/src/prover/smt/solver/search-tree.ts +284 -0
  461. package/src/prover/smt/solver/seq-axioms.ts +1010 -0
  462. package/src/prover/smt/solver/seq-decl-plugin.ts +819 -0
  463. package/src/prover/smt/solver/seq-derive.ts +1301 -0
  464. package/src/prover/smt/solver/seq-eq-approx.ts +236 -0
  465. package/src/prover/smt/solver/seq-eq-solver.ts +439 -0
  466. package/src/prover/smt/solver/seq-factory.ts +89 -0
  467. package/src/prover/smt/solver/seq-monadic.ts +728 -0
  468. package/src/prover/smt/solver/seq-range-predicate.ts +235 -0
  469. package/src/prover/smt/solver/seq-re-rewriter.ts +1170 -0
  470. package/src/prover/smt/solver/seq-re-util.ts +758 -0
  471. package/src/prover/smt/solver/seq-regex-bisim.ts +144 -0
  472. package/src/prover/smt/solver/seq-regex-live.ts +200 -0
  473. package/src/prover/smt/solver/seq-rewriter.ts +2402 -0
  474. package/src/prover/smt/solver/seq-skolem.ts +317 -0
  475. package/src/prover/smt/solver/seq-subset.ts +165 -0
  476. package/src/prover/smt/solver/seq-view-witness.ts +353 -0
  477. package/src/prover/smt/solver/smt-consequences.ts +297 -0
  478. package/src/prover/smt/solver/smt-kernel.ts +83 -0
  479. package/src/prover/smt/solver/smt-logics.ts +66 -0
  480. package/src/prover/smt/solver/smt-setup.ts +496 -0
  481. package/src/prover/smt/solver/smt2-printer.ts +765 -0
  482. package/src/prover/smt/solver/smtlib-parser.ts +3140 -365
  483. package/src/prover/smt/solver/smtlib-script.ts +1631 -0
  484. package/src/prover/smt/solver/solve-eqs.ts +929 -0
  485. package/src/prover/smt/solver/solver.ts +119 -39
  486. package/src/prover/smt/solver/sort.ts +1 -5
  487. package/src/prover/smt/solver/static-features.ts +314 -0
  488. package/src/prover/smt/solver/sticky-generations.ts +0 -6
  489. package/src/prover/smt/solver/tactic.ts +1986 -0
  490. package/src/prover/smt/solver/term-enumeration.ts +205 -0
  491. package/src/prover/smt/solver/theory-array.ts +1240 -0
  492. package/src/prover/smt/solver/theory-bv.ts +1200 -0
  493. package/src/prover/smt/solver/theory-char.ts +355 -0
  494. package/src/prover/smt/solver/theory-datatype.ts +598 -0
  495. package/src/prover/smt/solver/theory-finite-set.ts +30 -0
  496. package/src/prover/smt/solver/theory-fpa.ts +389 -0
  497. package/src/prover/smt/solver/theory-lra-axioms.ts +55 -25
  498. package/src/prover/smt/solver/theory-lra-bounds.ts +31 -11
  499. package/src/prover/smt/solver/theory-lra-final-check.ts +59 -91
  500. package/src/prover/smt/solver/theory-lra-internalize.ts +94 -53
  501. package/src/prover/smt/solver/theory-lra-model.ts +23 -53
  502. package/src/prover/smt/solver/theory-lra-propagate.ts +24 -40
  503. package/src/prover/smt/solver/theory-lra-state.ts +6 -27
  504. package/src/prover/smt/solver/theory-lra.ts +188 -8
  505. package/src/prover/smt/solver/theory-pb.ts +934 -0
  506. package/src/prover/smt/solver/theory-polymorphism.ts +58 -0
  507. package/src/prover/smt/solver/theory-recfun.ts +307 -0
  508. package/src/prover/smt/solver/theory-seq-regex.ts +867 -0
  509. package/src/prover/smt/solver/theory-seq-solve.ts +1373 -0
  510. package/src/prover/smt/solver/theory-seq-state.ts +871 -0
  511. package/src/prover/smt/solver/theory-seq.ts +961 -0
  512. package/src/prover/smt/solver/theory.ts +189 -0
  513. package/src/prover/smt/solver/tseitin-cnf.ts +485 -0
  514. package/src/prover/smt/solver/var-subst.ts +37 -39
  515. package/src/prover/smt/table.ts +3 -10
  516. package/src/prover/smt/types.ts +146 -0
  517. package/src/prover/tlapm/cache.ts +67 -41
  518. package/src/prover/tlapm/ocaml-marshal.ts +19 -21
  519. package/src/prover/tlapm/tlapm.ts +21 -20
  520. package/src/prover/tlapm-library.ts +3208 -0
  521. package/src/prover/verdict.ts +9 -2
  522. package/src/prover/zenon/check/check.ts +1 -11
  523. package/src/prover/zenon/check/definitions.ts +5 -15
  524. package/src/prover/zenon/check/equality.ts +0 -8
  525. package/src/prover/zenon/check/functions.ts +0 -4
  526. package/src/prover/zenon/check/keys.ts +0 -7
  527. package/src/prover/zenon/check/propositional.ts +0 -3
  528. package/src/prover/zenon/check/records.ts +1 -6
  529. package/src/prover/zenon/check/relations.ts +2 -14
  530. package/src/prover/zenon/check/rewrites.ts +2 -21
  531. package/src/prover/zenon/check/sets.ts +40 -61
  532. package/src/prover/zenon/check/terms.ts +1 -19
  533. package/src/prover/zenon/check/tla.ts +0 -6
  534. package/src/prover/zenon/decide.ts +10 -19
  535. package/src/prover/zenon/encode.ts +0 -9
  536. package/src/prover/zenon/eqrel.ts +2 -15
  537. package/src/prover/zenon/equality-rules.ts +0 -6
  538. package/src/prover/zenon/expr.ts +8 -28
  539. package/src/prover/zenon/index-table.ts +26 -59
  540. package/src/prover/zenon/isar-case.ts +8 -20
  541. package/src/prover/zenon/isar.ts +35 -65
  542. package/src/prover/zenon/limits.ts +0 -4
  543. package/src/prover/zenon/llproof.ts +2 -22
  544. package/src/prover/zenon/mltoll.ts +66 -106
  545. package/src/prover/zenon/node.ts +20 -15
  546. package/src/prover/zenon/ocaml.ts +1 -17
  547. package/src/prover/zenon/parse.ts +9 -13
  548. package/src/prover/zenon/phrase.ts +1 -13
  549. package/src/prover/zenon/proof.ts +0 -11
  550. package/src/prover/zenon/propositional-rules.ts +0 -7
  551. package/src/prover/zenon/rules.ts +2 -8
  552. package/src/prover/zenon/search.ts +11 -35
  553. package/src/prover/zenon/tla/functions.ts +59 -33
  554. package/src/prover/zenon/tla/llproof.ts +67 -78
  555. package/src/prover/zenon/tla/records.ts +57 -35
  556. package/src/prover/zenon/tla/rewrites.ts +12 -21
  557. package/src/prover/zenon/tla/sets.ts +88 -59
  558. package/src/prover/zenon/tla/terms.ts +0 -8
  559. package/src/prover/zenon/tla/tla.ts +66 -66
  560. package/src/randomization.ts +81 -35
  561. package/src/resolve.ts +67 -185
  562. package/src/runtime.ts +26 -22
  563. package/src/sany/builtins.ts +2 -5
  564. package/src/sany/generation.ts +394 -0
  565. package/src/sany/generator-def-entries.ts +210 -0
  566. package/src/sany/generator-definitions.ts +686 -0
  567. package/src/sany/generator-expressions.ts +1100 -0
  568. package/src/sany/generator-proofs.ts +662 -0
  569. package/src/sany/generator.ts +191 -2764
  570. package/src/sany/levels.ts +5 -35
  571. package/src/sany/lexer.ts +58 -77
  572. package/src/sany/linter.ts +0 -10
  573. package/src/sany/modules.ts +1 -5
  574. package/src/sany/nodes.ts +5 -43
  575. package/src/sany/parse-error.ts +39 -117
  576. package/src/sany/report.ts +32 -69
  577. package/src/sany/selectors.ts +49 -76
  578. package/src/sany/source.ts +1 -17
  579. package/src/sany/xml.ts +35 -117
  580. package/src/search.ts +671 -169
  581. package/src/simulate.ts +712 -0
  582. package/src/spec-description.ts +192 -100
  583. package/src/standard-definitions.ts +4 -4
  584. package/src/standard-modules.ts +264 -95
  585. package/src/state-graph.ts +52 -33
  586. package/src/subexpressions.ts +69 -52
  587. package/src/substitution-levels.ts +7 -7
  588. package/src/successors.ts +267 -100
  589. package/src/symmetry.ts +35 -27
  590. package/src/tableau.ts +29 -26
  591. package/src/tlc/fingerprint.ts +267 -79
  592. package/src/tlc/jar-data.ts +112 -6
  593. package/src/tlc/messages.ts +125 -54
  594. package/src/tlc/order.ts +39 -69
  595. package/src/tlc/random.ts +37 -49
  596. package/src/tlc/replay.ts +553 -228
  597. package/src/tlc/summary.ts +64 -60
  598. package/src/tlc/tlc-operators.ts +78 -44
  599. package/src/tlc/tlcext-operators.ts +171 -122
  600. package/src/tlc/trace-spec.ts +249 -0
  601. package/src/tlc/value-stream.ts +139 -0
  602. package/src/tlc/version.ts +1 -4
  603. package/src/transfer.ts +22 -25
  604. package/src/typed-tier.ts +6535 -0
  605. package/src/typescript/actions.ts +479 -0
  606. package/src/typescript/collections.ts +614 -0
  607. package/src/typescript/compile.ts +63 -0
  608. package/src/typescript/context.ts +94 -0
  609. package/src/typescript/emit.ts +121 -0
  610. package/src/typescript/expressions.ts +496 -0
  611. package/src/typescript/formula.ts +154 -0
  612. package/src/typescript/functions.ts +284 -0
  613. package/src/typescript/model.ts +162 -0
  614. package/src/typescript/names.ts +114 -0
  615. package/src/typescript/program.ts +48 -0
  616. package/src/typescript/properties.ts +139 -0
  617. package/src/typescript/scope.ts +112 -0
  618. package/src/typescript/steps.ts +167 -0
  619. package/src/typescript/types.ts +171 -0
  620. package/src/values.ts +832 -484
  621. package/src/worker.ts +7 -8
  622. package/src/prover/isabelle/isar/statement.ts +0 -57
  623. package/src/prover/smt/solver/z3-license.txt +0 -10
  624. package/src/prover/tlaps-module.ts +0 -510
  625. package/src/prover/zenon/LICENSE +0 -32
@@ -1,15 +1,11 @@
1
- // Ported from Isabelle2025's Pure/net.ML, discrimination nets. Copyright (c) 1986-2025 University
2
- // of Cambridge, Technische Universitaet Muenchen, and contributors, see LICENSE.
3
-
1
+ import type { List } from "./list";
4
2
  import { boundName } from "./name";
5
3
  import {
6
4
  emptyTable,
7
5
  fastStringOrd,
8
6
  foldTable,
9
- isEmptyTable,
10
7
  lookupTable,
11
8
  updateTable,
12
- deleteTable,
13
9
  type Table,
14
10
  } from "./table";
15
11
  import { headOf, type Term } from "./term";
@@ -33,8 +29,6 @@ export type Net<Item> =
33
29
 
34
30
  export const emptyNet: Net<never> = { kind: "Leaf", items: [] };
35
31
 
36
- const isEmptyNet = <Item>(net: Net<Item>) => net.kind === "Leaf" && net.items.length === 0;
37
-
38
32
  const makeNode = <Item>(): Extract<Net<Item>, { kind: "Net" }> => ({
39
33
  kind: "Net",
40
34
  comb: emptyNet,
@@ -42,7 +36,6 @@ const makeNode = <Item>(): Extract<Net<Item>, { kind: "Net" }> => ({
42
36
  atoms: emptyTable(fastStringOrd),
43
37
  });
44
38
 
45
- // Net.key_of_term: preorder keys, with any term headed by a variable or an abstraction as a Var.
46
39
  export const keyOfTerm = (term: Term): NetKey[] => {
47
40
  const keys: NetKey[] = [];
48
41
  const add = (current: Term) => {
@@ -68,8 +61,6 @@ export const keyOfTerm = (term: Term): NetKey[] => {
68
61
  return keys;
69
62
  };
70
63
 
71
- // Net.insert: raises nothing on a duplicate here; insert_safe semantics with eq. It walks down
72
- // the keys and rebuilds the path bottom-up, so a long key list can't exhaust the stack.
73
64
  export const insertNet = <Item>(
74
65
  isEqual: (left: Item, right: Item) => boolean,
75
66
  keys: readonly NetKey[],
@@ -104,56 +95,7 @@ export const insertNet = <Item>(
104
95
  export const insertTermNet = <Item>(term: Term, item: Item, net: Net<Item>) =>
105
96
  insertNet(() => false, keyOfTerm(term), item, net) ?? net;
106
97
 
107
- const newNet = <Item>(node: Extract<Net<Item>, { kind: "Net" }>): Net<Item> =>
108
- isEmptyNet(node.comb) && isEmptyNet(node.var) && isEmptyTable(node.atoms) ? emptyNet : node;
109
-
110
- // Net.delete: undefined where Isabelle raises DELETE.
111
- const deleteNet = <Item>(
112
- isEqual: (left: Item, right: Item) => boolean,
113
- keys: readonly NetKey[],
114
- item: Item,
115
- net: Net<Item>,
116
- ): Net<Item> | undefined => {
117
- const del = (position: number, node: Net<Item>): Net<Item> | undefined => {
118
- if (node.kind === "Leaf") {
119
- if (position < keys.length) return undefined;
120
- const index = node.items.findIndex((other) => isEqual(other, item));
121
- if (index === -1) return undefined;
122
- return { kind: "Leaf", items: node.items.filter((other) => !isEqual(other, item)) };
123
- }
124
- if (position === keys.length) return undefined;
125
- const key = keys[position];
126
- if (key.kind === "Comb") {
127
- const comb = del(position + 1, node.comb);
128
- return comb && newNet({ ...node, comb });
129
- }
130
- if (key.kind === "Var") {
131
- const child = del(position + 1, node.var);
132
- return child && newNet({ ...node, var: child });
133
- }
134
- const existing = lookupTable(node.atoms, key.name);
135
- if (existing === undefined) return undefined;
136
- const child = del(position + 1, existing);
137
- if (child === undefined) return undefined;
138
- return newNet({
139
- ...node,
140
- atoms: isEmptyNet(child)
141
- ? deleteTable(node.atoms, key.name)
142
- : updateTable(node.atoms, key.name, child),
143
- });
144
- };
145
- return del(0, net);
146
- };
147
-
148
- export const deleteTermSafe = <Item>(
149
- isEqual: (left: Item, right: Item) => boolean,
150
- term: Term,
151
- item: Item,
152
- net: Net<Item>,
153
- ) => deleteNet(isEqual, keyOfTerm(term), item, net) ?? net;
154
-
155
- // The lists of nets that matching conses up, as Isabelle's lists.
156
- type Nets<Item> = { readonly head: Net<Item>; readonly tail: Nets<Item> } | undefined;
98
+ type Nets<Item> = List<Net<Item>> | undefined;
157
99
 
158
100
  const toArray = <Item>(nets: Nets<Item>) => {
159
101
  const array: Net<Item>[] = [];
@@ -1,35 +1,34 @@
1
- // Ported from Isabelle2025's Pure/Isar/object_logic.ML, atomize_prems_tac, and the CONVERSION of
2
- // Pure/tactic.ML. Copyright (c) 1986-2025 University of Cambridge, Technische Universitaet
3
- // Muenchen, and contributors, see LICENSE.
4
-
5
1
  import { TlaIsabelleError } from "../../../errors";
6
- import { gconvRule, paramsConv, premsConv } from "./conv";
2
+ import { fconvRule, gconvRule, paramsConv, premsConv } from "./conv";
7
3
  import { hasMetaPrems } from "./logic";
8
- import { addSimps, emptySimpset } from "./raw-simplifier";
4
+ import { makeSimpContext } from "./raw-simplifier";
9
5
  import { rewriteCterm, simpleProver } from "./rewriter";
10
6
  import { emptySeq, singleSeq } from "./seq";
11
7
  import type { Limits } from "./interrupt";
12
8
  import type { GoalTactic } from "./tactical";
9
+ import type { Term } from "./term";
13
10
  import { reflexive, type Thm } from "./thm";
14
11
 
15
- // Object_Logic.atomize_prems_tac: rewrites the premises of a goal with the atomize rules, newest
16
- // first as Object_Logic keeps them, which turns meta-level premises into object-level formulas.
17
- export const atomizePremsTac = (limits: Limits, rules: readonly Thm[]): GoalTactic => {
18
- const empty = { limits, simpset: emptySimpset, bounds: 0 };
19
- const context = { ...empty, simpset: addSimps(empty, rules) };
20
- // Raw_Simplifier.rewrite ctxt true: full rewriting, with a prover that proves no premises.
12
+ // The atomize rules apply newest first, as Object_Logic keeps them.
13
+ const atomizePrems = (limits: Limits, rules: readonly Thm[]) => {
14
+ const context = makeSimpContext(limits, rules);
21
15
  const atomize = paramsConv(
22
16
  premsConv((term) =>
23
17
  rewriteCterm({ simprem: true, useprem: false, mutsimp: false }, simpleProver, context, term),
24
18
  ),
25
19
  );
20
+ return (term: Term) => (hasMetaPrems(term) ? atomize(term) : reflexive(term));
21
+ };
22
+
23
+ export const flatRule = (limits: Limits, rules: readonly Thm[], rule: Thm) =>
24
+ fconvRule(premsConv(atomizePrems(limits, rules)), rule);
25
+
26
+ export const atomizePremsTac = (limits: Limits, rules: readonly Thm[]): GoalTactic => {
27
+ const atomize = atomizePrems(limits, rules);
26
28
  return (index) => (state) => {
27
29
  try {
28
- return singleSeq(
29
- gconvRule((term) => (hasMetaPrems(term) ? atomize(term) : reflexive(term)), index, state),
30
- );
30
+ return singleSeq(gconvRule(atomize, index, state));
31
31
  } catch (error) {
32
- // CONVERSION fails on THM, CTERM, TERM and TYPE.
33
32
  if (
34
33
  error instanceof TlaIsabelleError &&
35
34
  (error.exception === "THM" || error.exception === "TERM" || error.exception === "TYPE")
@@ -1,12 +1,6 @@
1
- // Ported from Isabelle2025's Pure/pattern.ML and Pure/more_pattern.ML. Copyright (c) 1986-2025
2
- // University of Cambridge, Technische Universitaet Muenchen, and contributors, see LICENSE.
3
- //
4
- // Unification and matching of higher-order patterns. Isabelle signals failure with the
5
- // exceptions Unif, Pattern and MATCH; here they stay inside this module and the exported
6
- // functions return undefined instead.
7
-
8
1
  import { TlaIsabelleError } from "../../../errors";
9
2
  import { aeconv, genvar, headNorm, lookup, lookup1, update, type Envir, type TEnv } from "./envir";
3
+ import type { Binder } from "./logic";
10
4
  import { hasKey, indexnameOrd, updateTable } from "./table";
11
5
  import {
12
6
  eqTyp,
@@ -32,11 +26,6 @@ class Unif {}
32
26
  class NotPattern {}
33
27
  class Match {}
34
28
 
35
- interface Binder {
36
- name: string;
37
- type: Typ;
38
- }
39
-
40
29
  const occurs = (variable: Var, term: Term, envir: Envir): boolean => {
41
30
  const visit = (current: Term): boolean => {
42
31
  if ((flagsOf(current) & HAS_VAR) === 0) return false;
@@ -156,7 +145,6 @@ const mkNewHnf = (
156
145
  return update(variable, mkHnf(binders, indexes, fresh, args), updated);
157
146
  };
158
147
 
159
- // downto0 (is, n): whether is is [n, n - 1, ..., 0].
160
148
  const isDownto0 = (indexes: readonly number[], count: number) =>
161
149
  indexes.length === count + 1 && indexes.every((index, position) => index === count - position);
162
150
 
@@ -306,7 +294,6 @@ const flexflex2 = (
306
294
  : assign(rightVar, rightIndexes, leftVar, leftIndexes);
307
295
  };
308
296
 
309
- // Pattern.unify_types: undefined where Isabelle raises Unif.
310
297
  export const unifyTypesEnvir = (left: Typ, right: Typ, envir: Envir): Envir | undefined => {
311
298
  if (eqTyp(left, right)) return envir;
312
299
  const tyenv = unifyTypes(right, left, envir.tyenv);
@@ -420,7 +407,6 @@ type PatternUnifyResult =
420
407
  | { kind: "clash" }
421
408
  | { kind: "not a pattern" };
422
409
 
423
- // Pattern.unify: distinguishes a clash (Unif) from terms outside the pattern fragment (Pattern).
424
410
  export const unifyPattern = (left: Term, right: Term, envir: Envir): PatternUnifyResult => {
425
411
  try {
426
412
  return { kind: "unified", envir: unif([], left, right, envir) };
@@ -595,22 +581,18 @@ const catchMatch = (run: () => MatchEnv): MatchEnv | undefined => {
595
581
  }
596
582
  };
597
583
 
598
- // Pattern.match: undefined where Isabelle raises MATCH.
599
584
  export const matchPattern = (pattern: Term, object: Term, env: MatchEnv): MatchEnv | undefined =>
600
585
  catchMatch(() => higherOrderMatch(pattern, object, env));
601
586
 
602
- // Pattern.first_order_match
603
587
  export const firstOrderMatchPattern = (
604
588
  pattern: Term,
605
589
  object: Term,
606
590
  env: MatchEnv,
607
591
  ): MatchEnv | undefined => catchMatch(() => firstOrderMatch(pattern, object, env));
608
592
 
609
- // Pattern.matches
610
593
  export const matches = (pattern: Term, object: Term, tyenv: TyEnv, tenv: TEnv) =>
611
594
  matchPattern(pattern, object, { tyenv, tenv }) !== undefined;
612
595
 
613
- // Pattern.pattern
614
596
  export const isPattern = (term: Term): boolean => {
615
597
  if (term.kind === "Abs") return isPattern(term.body);
616
598
  const [head, args] = stripComb(term);
@@ -622,7 +604,6 @@ export const isPattern = (term: Term): boolean => {
622
604
  return args.every(isPattern);
623
605
  };
624
606
 
625
- // Pattern.first_order
626
607
  export const isFirstOrder = (term: Term): boolean => {
627
608
  if (term.kind === "Abs") return isFirstOrder(term.body);
628
609
  if (term.kind === "App")
@@ -1,30 +1,24 @@
1
- // Ported from Isabelle2025's Pure/raw_simplifier.ML, the simpset and its rewrite rules. Copyright
2
- // (c) 1986-2025 University of Cambridge, Technische Universitaet Muenchen, and contributors, see
3
- // LICENSE.
4
- //
5
- // Isabelle/TLA+ declares no congruence procedures, so the simpset leaves them out.
6
-
7
1
  import { TlaIsabelleError } from "../../../errors";
8
- import { etaContract } from "./envir";
2
+ import { emptyTEnv, etaContract } from "./envir";
9
3
  import { symmetricThm } from "./drule";
10
4
  import { destEquals, isEquals, occs, stripImpConcl, stripImpPrems } from "./logic";
11
5
  import { emptyNet, insertNet, keyOfTerm, type Net } from "./net";
12
6
  import { isFirstOrder, isPattern, matches } from "./pattern";
13
- import { emptyTable, type Table } from "./table";
14
- import { emptyTEnv } from "./envir";
7
+ import { emptyTable, stringOrd, type Table } from "./table";
15
8
  import { emptyTyEnv } from "./type";
16
9
  import {
17
10
  aconv,
18
11
  existsSubterm,
19
12
  existsType,
20
13
  foldVars,
14
+ eqTerm,
21
15
  eqTyp,
22
16
  headOf,
23
17
  type Term,
24
18
  type Typ,
25
19
  type Var,
26
20
  } from "./term";
27
- import { rs, type Thm } from "./thm";
21
+ import { catchThm, rs, type Thm } from "./thm";
28
22
  import { eqThmProp, noTac, type GoalTactic } from "./tactical";
29
23
  import type { Limits } from "./interrupt";
30
24
 
@@ -75,8 +69,6 @@ export interface Simpset {
75
69
  readonly safeSolvers: readonly Solver[];
76
70
  }
77
71
 
78
- // The part of an Isabelle proof context that the simplifier reads: the simpset, the time limits,
79
- // and the counter that names the free variables standing for bound ones.
80
72
  export interface SimpContext {
81
73
  readonly limits: Limits;
82
74
  readonly simpset: Simpset;
@@ -94,9 +86,10 @@ export const congName = (term: Term): CongName | undefined =>
94
86
  ? { isConst: false, name: term.name }
95
87
  : undefined;
96
88
 
97
- const varsOf = (term: Term) => foldVars((atom, result: Var[]) => [...result, atom], term, []);
89
+ export const varsOf = (term: Term): Var[] =>
90
+ foldVars((atom, result: Var[]) => [...result, atom], term, []);
98
91
 
99
- const hasVar = (vars: readonly Var[], variable: Var) =>
92
+ export const hasVar = (vars: readonly Var[], variable: Var) =>
100
93
  vars.some(
101
94
  (other) =>
102
95
  other.name === variable.name &&
@@ -116,8 +109,6 @@ const hasNewTVar = (type: Typ, keys: ReadonlySet<string>): boolean => {
116
109
  return false;
117
110
  };
118
111
 
119
- // rewrite_rule_extra_vars: whether the right-hand sides have variables outside the left-hand side
120
- // and the premises.
121
112
  const rewriteRuleExtraVars = (prems: readonly Term[], elhs: Term, erhss: readonly Term[]) => {
122
113
  const terms = [elhs, ...prems];
123
114
  const vars = terms.flatMap(varsOf);
@@ -151,36 +142,7 @@ const vperm = (left: Term, right: Term): boolean => {
151
142
  if (left.kind === "Abs" && right.kind === "Abs") return vperm(left.body, right.body);
152
143
  if (left.kind === "App" && right.kind === "App")
153
144
  return vperm(left.fun, right.fun) && vperm(left.arg, right.arg);
154
- return aconvExact(left, right);
155
- };
156
-
157
- const aconvExact = (left: Term, right: Term): boolean => {
158
- if (left.kind !== right.kind) return false;
159
- switch (left.kind) {
160
- case "Const":
161
- case "Free":
162
- return right.kind === left.kind && left.name === right.name && eqTyp(left.type, right.type);
163
- case "Var":
164
- return (
165
- right.kind === "Var" &&
166
- left.name === right.name &&
167
- left.index === right.index &&
168
- eqTyp(left.type, right.type)
169
- );
170
- case "Bound":
171
- return right.kind === "Bound" && left.index === right.index;
172
- case "Abs":
173
- return (
174
- right.kind === "Abs" &&
175
- left.name === right.name &&
176
- eqTyp(left.type, right.type) &&
177
- aconvExact(left.body, right.body)
178
- );
179
- case "App":
180
- return (
181
- right.kind === "App" && aconvExact(left.fun, right.fun) && aconvExact(left.arg, right.arg)
182
- );
183
- }
145
+ return eqTerm(left, right);
184
146
  };
185
147
 
186
148
  const isVarPerm = (left: Term, right: Term) => {
@@ -212,7 +174,7 @@ const decompSimp = (thm: Thm): Decomposed => {
212
174
  return { prems, lhs, elhs, rhs, perm };
213
175
  };
214
176
 
215
- interface RawRrule {
177
+ export interface RawRrule {
216
178
  readonly thm: Thm;
217
179
  readonly lhs: Term;
218
180
  readonly elhs: Term;
@@ -249,7 +211,6 @@ const mkRrule = (context: SimpContext, thm: Thm): RawRrule[] => {
249
211
  return rruleEqTrue(context, thm, decomposed.lhs, decomposed.elhs, decomposed.rhs, thm);
250
212
  };
251
213
 
252
- // default_reorient: catches looping rules and stupid orientations.
253
214
  const defaultReorient = (prems: readonly Term[], lhs: Term, rhs: Term) =>
254
215
  rewriteRuleExtraVars(prems, lhs, [rhs]) ||
255
216
  headOf(lhs).kind === "Var" ||
@@ -264,20 +225,12 @@ const orientRrule = (context: SimpContext, thm: Thm): RawRrule[] => {
264
225
  return rruleEqTrue(context, thm, decomposed.lhs, decomposed.elhs, decomposed.rhs, thm);
265
226
  if (defaultReorient(decomposed.prems, decomposed.rhs, decomposed.lhs))
266
227
  return mkEqTrue(context, thm);
267
- const symmetric = (() => {
268
- try {
269
- return rs(thm, symmetricThm);
270
- } catch (error) {
271
- if (error instanceof TlaIsabelleError && error.exception === "THM") return undefined;
272
- throw error;
273
- }
274
- })();
228
+ const symmetric = catchThm(() => rs(thm, symmetricThm));
275
229
  if (symmetric === undefined) return [];
276
230
  const flipped = decompSimp(symmetric);
277
231
  return rruleEqTrue(context, symmetric, flipped.lhs, flipped.elhs, flipped.rhs, thm);
278
232
  };
279
233
 
280
- // extract_safe_rrules: the rewrite rules of an assumption, oriented to avoid loops.
281
234
  export const extractSafeRrules = (context: SimpContext, thm: Thm): RawRrule[] =>
282
235
  context.simpset.mkRews.mk(thm, context).flatMap((rew) => orientRrule(context, rew));
283
236
 
@@ -295,7 +248,6 @@ export const addSimps = (context: SimpContext, thms: readonly Thm[]): Simpset =>
295
248
  .flatMap((rew) => mkRrule(context, rew))
296
249
  .reduce((simpset, raw) => insertRrule(raw, simpset), context.simpset);
297
250
 
298
- // mk_procrule: the rewrite rule a simplification procedure proves.
299
251
  export const mkProcrule = (thm: Thm): Rrule[] => {
300
252
  const decomposed = decompSimp(thm);
301
253
  if (rewriteRuleExtraVars(decomposed.prems, decomposed.lhs, [decomposed.rhs])) return [];
@@ -307,7 +259,6 @@ export const addPrems = (thms: readonly Thm[], simpset: Simpset): Simpset => ({
307
259
  prems: [...thms, ...simpset.prems],
308
260
  });
309
261
 
310
- // Rebuilds a rule net from Net.entries, as the reference simpset lists them.
311
262
  export const rulesFromEntries = (thms: readonly Thm[]): Net<Rrule> =>
312
263
  thms.reduceRight<Net<Rrule>>((net, thm) => {
313
264
  const decomposed = decompSimp(thm);
@@ -315,11 +266,8 @@ export const rulesFromEntries = (thms: readonly Thm[]): Net<Rrule> =>
315
266
  return insertNet(() => false, keyOfTerm(rrule.elhs), rrule, net) ?? net;
316
267
  }, emptyNet);
317
268
 
318
- export const emptyCongs: Table<string, Thm> = emptyTable((left: string, right: string) =>
319
- left === right ? 0 : left < right ? -1 : 1,
320
- );
269
+ export const emptyCongs: Table<string, Thm> = emptyTable(stringOrd);
321
270
 
322
- // empty_ss: rewrites with meta-equalities only, and solves no subgoal.
323
271
  export const emptySimpset: Simpset = {
324
272
  rules: emptyNet,
325
273
  prems: [],
@@ -336,3 +284,8 @@ export const emptySimpset: Simpset = {
336
284
  unsafeSolvers: [],
337
285
  safeSolvers: [],
338
286
  };
287
+
288
+ export const makeSimpContext = (limits: Limits, rules: readonly Thm[]): SimpContext => {
289
+ const empty = { limits, simpset: emptySimpset, bounds: 0 };
290
+ return { ...empty, simpset: addSimps(empty, rules) };
291
+ };