tla-ts 0.0.10-dev.63a6693bd → 0.0.10-dev.7a3bb1545

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 (538) hide show
  1. package/README.md +2 -1
  2. package/dist/compile.cjs +3 -3
  3. package/dist/compile.js +1 -1
  4. package/dist/deciders.cjs +41 -37
  5. package/dist/deciders.js +58 -54
  6. package/dist/index.cjs +1 -1
  7. package/dist/index.d.cts +4 -1
  8. package/dist/index.d.ts +4 -1
  9. package/dist/index.js +1 -1
  10. package/dist/parallel-worker.cjs +1 -1
  11. package/dist/parallel-worker.js +1 -1
  12. package/dist/prove-worker.cjs +1 -1
  13. package/dist/prove-worker.js +1 -1
  14. package/dist/prove.cjs +2682 -426
  15. package/dist/prove.js +2679 -423
  16. package/dist/run.cjs +43 -42
  17. package/dist/run.js +45 -44
  18. package/dist/tlapm.cjs +1 -1
  19. package/dist/tlapm.js +2 -2
  20. package/dist/transfer.cjs +43 -40
  21. package/dist/transfer.js +43 -40
  22. package/dist/worker.cjs +7 -7
  23. package/dist/worker.js +7 -7
  24. package/package.json +1 -1
  25. package/src/ast.ts +3 -3
  26. package/src/bags.ts +46 -28
  27. package/src/check-trace.ts +2 -16
  28. package/src/check.ts +336 -88
  29. package/src/cli/runtime-invariants.ts +20 -56
  30. package/src/cli/tlapm.ts +424 -62
  31. package/src/cli/tlc-arguments.ts +2 -2
  32. package/src/cli/tlc-output.ts +4 -5
  33. package/src/cli/tlc-usage.ts +0 -1
  34. package/src/cli/tlc.ts +26 -7
  35. package/src/dependencies.ts +23 -2
  36. package/src/dfid.ts +9 -2
  37. package/src/environment.ts +27 -5
  38. package/src/errors.ts +30 -3
  39. package/src/evaluate.ts +9 -3
  40. package/src/exit-codes.ts +5 -2
  41. package/src/instances.ts +1 -1
  42. package/src/levels.ts +3 -2
  43. package/src/lexer.ts +5 -3
  44. package/src/liveness-checker.ts +572 -204
  45. package/src/liveness.ts +47 -32
  46. package/src/obligations/action.ts +10 -6
  47. package/src/obligations/anonymize.ts +33 -14
  48. package/src/obligations/enabled-axioms.ts +218 -0
  49. package/src/obligations/equality.ts +1 -3
  50. package/src/obligations/expression.ts +18 -6
  51. package/src/obligations/format.ts +0 -2
  52. package/src/obligations/generate.ts +22 -17
  53. package/src/obligations/index.ts +36 -6
  54. package/src/obligations/levels.ts +24 -11
  55. package/src/obligations/module.ts +1 -3
  56. package/src/obligations/normalize.ts +24 -13
  57. package/src/obligations/operators.ts +0 -2
  58. package/src/obligations/pragma.ts +53 -16
  59. package/src/obligations/printer.ts +43 -13
  60. package/src/obligations/proof.ts +3 -2
  61. package/src/obligations/regroup.ts +0 -2
  62. package/src/obligations/simplify.ts +17 -7
  63. package/src/obligations/source.ts +71 -17
  64. package/src/obligations/subexpression.ts +45 -18
  65. package/src/obligations/substitution.ts +1 -3
  66. package/src/obligations/temporal.ts +0 -2
  67. package/src/obligations/tuples.ts +0 -2
  68. package/src/parallel-worker.ts +8 -2
  69. package/src/parallel.ts +7 -2
  70. package/src/parser.ts +633 -186
  71. package/src/pretty-print.ts +1 -1
  72. package/src/prover/deciders.ts +11 -8
  73. package/src/prover/isabelle/decide.ts +3 -25
  74. package/src/prover/isabelle/encode.ts +71 -41
  75. package/src/prover/isabelle/isar/attrib.ts +250 -0
  76. package/src/prover/isabelle/isar/context.ts +335 -0
  77. package/src/prover/isabelle/isar/induct.ts +382 -0
  78. package/src/prover/isabelle/isar/inner-syntax.ts +149 -3
  79. package/src/prover/isabelle/isar/method.ts +506 -198
  80. package/src/prover/isabelle/isar/proof.ts +570 -14
  81. package/src/prover/isabelle/isar/rule-cases.ts +226 -0
  82. package/src/prover/isabelle/isar/theory.ts +479 -69
  83. package/src/prover/isabelle/isar/toplevel.ts +331 -0
  84. package/src/prover/isabelle/isar/type-check.ts +83 -8
  85. package/src/prover/isabelle/provers/blast/blast.ts +0 -2
  86. package/src/prover/isabelle/provers/blast/branch.ts +0 -2
  87. package/src/prover/isabelle/provers/blast/prove.ts +0 -2
  88. package/src/prover/isabelle/provers/blast/rules.ts +0 -2
  89. package/src/prover/isabelle/provers/blast/state.ts +0 -2
  90. package/src/prover/isabelle/provers/blast/term.ts +0 -2
  91. package/src/prover/isabelle/provers/clasimp.ts +1 -3
  92. package/src/prover/isabelle/provers/classical.ts +45 -20
  93. package/src/prover/isabelle/provers/hypsubst.ts +2 -4
  94. package/src/prover/isabelle/pure/bicompose.ts +0 -2
  95. package/src/prover/isabelle/pure/consts.ts +0 -2
  96. package/src/prover/isabelle/pure/conv.ts +0 -2
  97. package/src/prover/isabelle/pure/drule.ts +63 -4
  98. package/src/prover/isabelle/pure/envir.ts +0 -2
  99. package/src/prover/isabelle/pure/goal.ts +1 -3
  100. package/src/prover/isabelle/pure/logic.ts +0 -2
  101. package/src/prover/isabelle/pure/name.ts +0 -2
  102. package/src/prover/isabelle/pure/net.ts +0 -2
  103. package/src/prover/isabelle/pure/object-logic.ts +13 -7
  104. package/src/prover/isabelle/pure/pattern.ts +0 -2
  105. package/src/prover/isabelle/pure/raw-simplifier.ts +0 -2
  106. package/src/prover/isabelle/pure/rewriter.ts +1 -8
  107. package/src/prover/isabelle/pure/search.ts +0 -2
  108. package/src/prover/isabelle/pure/seq.ts +0 -2
  109. package/src/prover/isabelle/pure/simplifier.ts +26 -7
  110. package/src/prover/isabelle/pure/table.ts +0 -2
  111. package/src/prover/isabelle/pure/tactic.ts +0 -2
  112. package/src/prover/isabelle/pure/tactical.ts +0 -2
  113. package/src/prover/isabelle/pure/term-ord.ts +0 -2
  114. package/src/prover/isabelle/pure/term.ts +0 -2
  115. package/src/prover/isabelle/pure/thm.ts +0 -2
  116. package/src/prover/isabelle/pure/type.ts +0 -2
  117. package/src/prover/isabelle/pure/unify.ts +0 -2
  118. package/src/prover/isabelle/pure/variable.ts +0 -2
  119. package/src/prover/isabelle/tla/classical-setup.ts +1 -2
  120. package/src/prover/isabelle/tla/context.ts +51 -9
  121. package/src/prover/isabelle/tla/logic-data.ts +1 -1
  122. package/src/prover/isabelle/tla/logic.ts +40 -1
  123. package/src/prover/isabelle/tla/simpdata.ts +0 -2
  124. package/src/prover/isabelle/tools/intuitionistic.ts +28 -12
  125. package/src/prover/ocaml.ts +4 -1
  126. package/src/prover/prep/action.ts +19 -12
  127. package/src/prover/prep/enabled-axioms.ts +11 -2
  128. package/src/prover/prep/methods.ts +159 -50
  129. package/src/prover/prep/normalize.ts +38 -9
  130. package/src/prover/prove.ts +343 -65
  131. package/src/prover/ptl/decide.ts +95 -50
  132. package/src/prover/ptl/encode.ts +2 -3
  133. package/src/prover/ptl/tableau.ts +28 -2
  134. package/src/prover/smt/arithmetic.ts +310 -0
  135. package/src/prover/smt/axioms.ts +12 -8
  136. package/src/prover/smt/context.ts +42 -6
  137. package/src/prover/smt/data.ts +191 -84
  138. package/src/prover/smt/encode.ts +122 -43
  139. package/src/prover/smt/extensionality.ts +5 -3
  140. package/src/prover/smt/flatten.ts +4 -6
  141. package/src/prover/smt/format.ts +28 -4
  142. package/src/prover/smt/instances.ts +7 -1
  143. package/src/prover/smt/layout.ts +91 -0
  144. package/src/prover/smt/rewrite.ts +483 -116
  145. package/src/prover/smt/simplify.ts +441 -0
  146. package/src/prover/smt/solver/ackermannize-bv-tactic.ts +61 -0
  147. package/src/prover/smt/solver/ackr-helper.ts +179 -0
  148. package/src/prover/smt/solver/ackr-model-converter.ts +105 -0
  149. package/src/prover/smt/solver/act-cache.ts +0 -1
  150. package/src/prover/smt/solver/add-bounds-tactic.ts +59 -0
  151. package/src/prover/smt/solver/aig-tactic.ts +52 -0
  152. package/src/prover/smt/solver/aig.ts +889 -0
  153. package/src/prover/smt/solver/arith-rewriter.ts +613 -6
  154. package/src/prover/smt/solver/arith-terms.ts +121 -0
  155. package/src/prover/smt/solver/array-decl-plugin.ts +175 -0
  156. package/src/prover/smt/solver/array-rewriter.ts +309 -0
  157. package/src/prover/smt/solver/asserted-formulas.ts +93 -15
  158. package/src/prover/smt/solver/ast-lt.ts +165 -11
  159. package/src/prover/smt/solver/ast-util.ts +160 -2
  160. package/src/prover/smt/solver/ast.ts +1448 -41
  161. package/src/prover/smt/solver/auf-solver.ts +0 -1
  162. package/src/prover/smt/solver/bit-blast-tactic.ts +582 -0
  163. package/src/prover/smt/solver/bit-blaster.ts +871 -0
  164. package/src/prover/smt/solver/bound-manager.ts +196 -0
  165. package/src/prover/smt/solver/bound-simplifier.ts +600 -0
  166. package/src/prover/smt/solver/bv-bound-chk.ts +492 -0
  167. package/src/prover/smt/solver/bv-decl-plugin.ts +338 -0
  168. package/src/prover/smt/solver/bv-divrem-bounds.ts +95 -0
  169. package/src/prover/smt/solver/bv-rewriter.ts +1901 -0
  170. package/src/prover/smt/solver/bv1-blast.ts +214 -0
  171. package/src/prover/smt/solver/bv2fpa-converter.ts +174 -0
  172. package/src/prover/smt/solver/bv2int-rewriter.ts +544 -0
  173. package/src/prover/smt/solver/bv2real-rewriter.ts +533 -0
  174. package/src/prover/smt/solver/card2bv.ts +109 -0
  175. package/src/prover/smt/solver/case-split-queue.ts +0 -2
  176. package/src/prover/smt/solver/cg-table.ts +39 -25
  177. package/src/prover/smt/solver/check-logic.ts +330 -0
  178. package/src/prover/smt/solver/clause.ts +0 -1
  179. package/src/prover/smt/solver/cofactor-elim-term-ite.ts +278 -0
  180. package/src/prover/smt/solver/conflict-resolution.ts +78 -2
  181. package/src/prover/smt/solver/context.ts +533 -114
  182. package/src/prover/smt/solver/ctx-simplify.ts +21 -12
  183. package/src/prover/smt/solver/ctx-solver-simplify.ts +122 -0
  184. package/src/prover/smt/solver/datatype-decl-plugin.ts +572 -0
  185. package/src/prover/smt/solver/datatype-rewriter.ts +82 -0
  186. package/src/prover/smt/solver/demodulator.ts +786 -0
  187. package/src/prover/smt/solver/dependent-expr-state.ts +81 -0
  188. package/src/prover/smt/solver/der.ts +38 -10
  189. package/src/prover/smt/solver/diff-neq.ts +205 -0
  190. package/src/prover/smt/solver/distribute-forall.ts +57 -0
  191. package/src/prover/smt/solver/dom-simplify.ts +511 -0
  192. package/src/prover/smt/solver/dt2bv-tactic.ts +260 -0
  193. package/src/prover/smt/solver/dyn-ack.ts +0 -1
  194. package/src/prover/smt/solver/e-matching.ts +6 -7
  195. package/src/prover/smt/solver/elim-small-bv-tactic.ts +129 -0
  196. package/src/prover/smt/solver/elim-uncnstr.ts +542 -0
  197. package/src/prover/smt/solver/enode.ts +100 -3
  198. package/src/prover/smt/solver/eq2bv-tactic.ts +218 -0
  199. package/src/prover/smt/solver/euf/arith-axioms.ts +403 -0
  200. package/src/prover/smt/solver/euf/arith-internalize.ts +653 -0
  201. package/src/prover/smt/solver/euf/arith-solver.ts +889 -0
  202. package/src/prover/smt/solver/euf/array-axioms.ts +527 -0
  203. package/src/prover/smt/solver/euf/array-internalize.ts +428 -0
  204. package/src/prover/smt/solver/euf/array-solver.ts +306 -0
  205. package/src/prover/smt/solver/euf/bv-ackerman.ts +162 -0
  206. package/src/prover/smt/solver/euf/bv-internalize.ts +748 -0
  207. package/src/prover/smt/solver/euf/bv-solver.ts +449 -0
  208. package/src/prover/smt/solver/euf/dt-solver.ts +618 -0
  209. package/src/prover/smt/solver/euf/egraph.ts +901 -0
  210. package/src/prover/smt/solver/euf/euf-solver.ts +1204 -0
  211. package/src/prover/smt/solver/euf/fpa-solver.ts +317 -0
  212. package/src/prover/smt/solver/euf/mam.ts +1046 -0
  213. package/src/prover/smt/solver/euf/q-ematch.ts +829 -0
  214. package/src/prover/smt/solver/euf/q-mbi.ts +587 -0
  215. package/src/prover/smt/solver/euf/q-model-fixer.ts +296 -0
  216. package/src/prover/smt/solver/euf/q-solver.ts +361 -0
  217. package/src/prover/smt/solver/euf/th-solver.ts +328 -0
  218. package/src/prover/smt/solver/euf/th-solvers.ts +30 -0
  219. package/src/prover/smt/solver/expr-ref.ts +0 -1
  220. package/src/prover/smt/solver/expr-safe-replace.ts +26 -2
  221. package/src/prover/smt/solver/expr2polynomial.ts +271 -0
  222. package/src/prover/smt/solver/factor.ts +163 -0
  223. package/src/prover/smt/solver/fd-solver.ts +267 -0
  224. package/src/prover/smt/solver/fingerprints.ts +15 -15
  225. package/src/prover/smt/solver/fix-dl-var.ts +147 -0
  226. package/src/prover/smt/solver/flat-literals.ts +0 -1
  227. package/src/prover/smt/solver/fm-tactic.ts +884 -0
  228. package/src/prover/smt/solver/fpa-decl-plugin.ts +618 -0
  229. package/src/prover/smt/solver/fpa-rewriter.ts +639 -0
  230. package/src/prover/smt/solver/fpa2bv-converter.ts +2251 -0
  231. package/src/prover/smt/solver/fpa2bv-rewriter.ts +348 -0
  232. package/src/prover/smt/solver/fpa2bv-tactic.ts +73 -0
  233. package/src/prover/smt/solver/goal.ts +177 -15
  234. package/src/prover/smt/solver/goal2nlsat.ts +216 -0
  235. package/src/prover/smt/solver/guard-set.ts +219 -0
  236. package/src/prover/smt/solver/hash.ts +0 -1
  237. package/src/prover/smt/solver/hashtable.ts +30 -16
  238. package/src/prover/smt/solver/inf-eps.ts +63 -0
  239. package/src/prover/smt/solver/inj-axiom.ts +101 -0
  240. package/src/prover/smt/solver/internalizer.ts +109 -36
  241. package/src/prover/smt/solver/lackr.ts +381 -0
  242. package/src/prover/smt/solver/lbool.ts +0 -1
  243. package/src/prover/smt/solver/lia2card.ts +268 -0
  244. package/src/prover/smt/solver/lia2pb.ts +154 -0
  245. package/src/prover/smt/solver/literal.ts +0 -1
  246. package/src/prover/smt/solver/logic-tactics.ts +345 -0
  247. package/src/prover/smt/solver/lp/bound-propagator.ts +0 -1
  248. package/src/prover/smt/solver/lp/constraints.ts +0 -1
  249. package/src/prover/smt/solver/lp/containers.ts +7 -2
  250. package/src/prover/smt/solver/lp/core-solver.ts +18 -3
  251. package/src/prover/smt/solver/lp/cross-nested.ts +1 -4
  252. package/src/prover/smt/solver/lp/dep-intervals.ts +0 -3
  253. package/src/prover/smt/solver/lp/dependency.ts +0 -2
  254. package/src/prover/smt/solver/lp/dioph-eq.ts +0 -2
  255. package/src/prover/smt/solver/lp/explanation.ts +0 -1
  256. package/src/prover/smt/solver/lp/gomory.ts +0 -1
  257. package/src/prover/smt/solver/lp/hnf-cutter.ts +0 -1
  258. package/src/prover/smt/solver/lp/hnf.ts +0 -3
  259. package/src/prover/smt/solver/lp/int-cube.ts +3 -4
  260. package/src/prover/smt/solver/lp/int-solver.ts +0 -2
  261. package/src/prover/smt/solver/lp/lar-solver.ts +40 -4
  262. package/src/prover/smt/solver/lp/lar-term.ts +0 -1
  263. package/src/prover/smt/solver/lp/lp-settings.ts +0 -1
  264. package/src/prover/smt/solver/lp/maximize-term.ts +59 -10
  265. package/src/prover/smt/solver/lp/nex-creator.ts +3 -3
  266. package/src/prover/smt/solver/lp/nex.ts +2 -2
  267. package/src/prover/smt/solver/lp/nla-backoff.ts +0 -2
  268. package/src/prover/smt/solver/lp/nla-basics.ts +46 -3
  269. package/src/prover/smt/solver/lp/nla-core.ts +66 -11
  270. package/src/prover/smt/solver/lp/nla-divisions.ts +0 -2
  271. package/src/prover/smt/solver/lp/nla-emonics.ts +0 -1
  272. package/src/prover/smt/solver/lp/nla-factorization.ts +0 -1
  273. package/src/prover/smt/solver/lp/nla-grobner.ts +167 -85
  274. package/src/prover/smt/solver/lp/nla-horner.ts +0 -2
  275. package/src/prover/smt/solver/lp/nla-intervals.ts +0 -1
  276. package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +0 -2
  277. package/src/prover/smt/solver/lp/nla-monotone.ts +0 -1
  278. package/src/prover/smt/solver/lp/nla-order.ts +0 -2
  279. package/src/prover/smt/solver/lp/nla-patcher.ts +0 -1
  280. package/src/prover/smt/solver/lp/nla-powers.ts +220 -0
  281. package/src/prover/smt/solver/lp/nla-tangents.ts +0 -2
  282. package/src/prover/smt/solver/lp/nla-throttle.ts +0 -1
  283. package/src/prover/smt/solver/lp/nla-transcendentals.ts +324 -0
  284. package/src/prover/smt/solver/lp/nla-types.ts +0 -2
  285. package/src/prover/smt/solver/lp/nla-var-eqs.ts +0 -1
  286. package/src/prover/smt/solver/lp/nra-solver.ts +163 -99
  287. package/src/prover/smt/solver/lp/numeric-pair.ts +0 -1
  288. package/src/prover/smt/solver/lp/pdd-interval.ts +6 -3
  289. package/src/prover/smt/solver/lp/pdd-simplifier.ts +60 -21
  290. package/src/prover/smt/solver/lp/pdd-solver.ts +72 -41
  291. package/src/prover/smt/solver/lp/pdd.ts +725 -290
  292. package/src/prover/smt/solver/lp/random-updater.ts +0 -2
  293. package/src/prover/smt/solver/lp/static-matrix.ts +0 -1
  294. package/src/prover/smt/solver/lp/union-find.ts +7 -2
  295. package/src/prover/smt/solver/macro-finder.ts +530 -0
  296. package/src/prover/smt/solver/mam-compiler.ts +118 -88
  297. package/src/prover/smt/solver/mam-interpreter.ts +0 -1
  298. package/src/prover/smt/solver/max-bv-sharing-tactic.ts +17 -0
  299. package/src/prover/smt/solver/max-cliques.ts +105 -0
  300. package/src/prover/smt/solver/maxcore.ts +309 -0
  301. package/src/prover/smt/solver/maximize-ac-sharing.ts +8 -6
  302. package/src/prover/smt/solver/maxlex.ts +115 -0
  303. package/src/prover/smt/solver/maxsmt-base.ts +105 -0
  304. package/src/prover/smt/solver/maxsmt.ts +92 -0
  305. package/src/prover/smt/solver/mbp/mbp-arith.ts +467 -0
  306. package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +101 -0
  307. package/src/prover/smt/solver/mbp/mbp-plugin.ts +287 -0
  308. package/src/prover/smt/solver/mbp/mbp-qel.ts +48 -0
  309. package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +271 -0
  310. package/src/prover/smt/solver/mbp/mbp-term-graph.ts +606 -0
  311. package/src/prover/smt/solver/model-based-opt.ts +844 -0
  312. package/src/prover/smt/solver/model-checker.ts +17 -26
  313. package/src/prover/smt/solver/model-evaluator.ts +188 -12
  314. package/src/prover/smt/solver/model-finder.ts +0 -1
  315. package/src/prover/smt/solver/model-generator.ts +59 -30
  316. package/src/prover/smt/solver/model-macro-solver.ts +38 -27
  317. package/src/prover/smt/solver/model-printer.ts +214 -0
  318. package/src/prover/smt/solver/mpf.ts +709 -0
  319. package/src/prover/smt/solver/mus.ts +50 -0
  320. package/src/prover/smt/solver/muz/dl-context.ts +410 -0
  321. package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +97 -0
  322. package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +167 -0
  323. package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +125 -0
  324. package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +299 -0
  325. package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +455 -0
  326. package/src/prover/smt/solver/muz/dl-mk-slice.ts +340 -0
  327. package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +163 -0
  328. package/src/prover/smt/solver/muz/dl-rule-set.ts +273 -0
  329. package/src/prover/smt/solver/muz/dl-rule-transformer.ts +123 -0
  330. package/src/prover/smt/solver/muz/dl-rule.ts +496 -0
  331. package/src/prover/smt/solver/muz/hnf.ts +201 -0
  332. package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +176 -0
  333. package/src/prover/smt/solver/muz/horn-tactic.ts +201 -0
  334. package/src/prover/smt/solver/muz/rule-properties.ts +337 -0
  335. package/src/prover/smt/solver/muz/spacer-context.ts +1404 -0
  336. package/src/prover/smt/solver/muz/spacer-dl-interface.ts +52 -0
  337. package/src/prover/smt/solver/muz/spacer-generalizers.ts +241 -0
  338. package/src/prover/smt/solver/muz/spacer-manager.ts +127 -0
  339. package/src/prover/smt/solver/muz/spacer-pdr.ts +219 -0
  340. package/src/prover/smt/solver/muz/spacer-prop-solver.ts +333 -0
  341. package/src/prover/smt/solver/muz/spacer-util.ts +282 -0
  342. package/src/prover/smt/solver/muz/substitution.ts +203 -0
  343. package/src/prover/smt/solver/nla2bv-tactic.ts +285 -0
  344. package/src/prover/smt/solver/nlqsat.ts +484 -0
  345. package/src/prover/smt/solver/nlsat/algebraic.ts +305 -88
  346. package/src/prover/smt/solver/nlsat/atoms.ts +52 -35
  347. package/src/prover/smt/solver/nlsat/evaluator.ts +0 -1
  348. package/src/prover/smt/solver/nlsat/explain.ts +424 -211
  349. package/src/prover/smt/solver/nlsat/interval-set.ts +1 -2
  350. package/src/prover/smt/solver/nlsat/levelwise.ts +460 -241
  351. package/src/prover/smt/solver/nlsat/mpbq.ts +45 -1
  352. package/src/prover/smt/solver/nlsat/polynomial.ts +2366 -683
  353. package/src/prover/smt/solver/nlsat/solver.ts +282 -69
  354. package/src/prover/smt/solver/nlsat/transcendental-eval.ts +310 -0
  355. package/src/prover/smt/solver/nlsat/transcendentals.ts +391 -0
  356. package/src/prover/smt/solver/nlsat/types.ts +0 -2
  357. package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +8 -7
  358. package/src/prover/smt/solver/nlsat/upolynomial.ts +41 -20
  359. package/src/prover/smt/solver/nlsat-tactic.ts +82 -0
  360. package/src/prover/smt/solver/nnf.ts +105 -23
  361. package/src/prover/smt/solver/normalize-bounds.ts +53 -0
  362. package/src/prover/smt/solver/occf.ts +97 -0
  363. package/src/prover/smt/solver/opt-context.ts +792 -0
  364. package/src/prover/smt/solver/opt-nlsat.ts +386 -0
  365. package/src/prover/smt/solver/opt-pareto.ts +282 -0
  366. package/src/prover/smt/solver/opt-preprocess.ts +101 -0
  367. package/src/prover/smt/solver/opt-solver.ts +311 -0
  368. package/src/prover/smt/solver/opt-value.ts +55 -0
  369. package/src/prover/smt/solver/optsmt.ts +692 -0
  370. package/src/prover/smt/solver/parallel-tactic.ts +299 -0
  371. package/src/prover/smt/solver/pattern-inference.ts +19 -11
  372. package/src/prover/smt/solver/pb-rewriter.ts +281 -0
  373. package/src/prover/smt/solver/pb2bv-tactic.ts +540 -0
  374. package/src/prover/smt/solver/poly-rewriter.ts +202 -57
  375. package/src/prover/smt/solver/probes.ts +511 -0
  376. package/src/prover/smt/solver/propagate-values.ts +37 -21
  377. package/src/prover/smt/solver/proto-model.ts +650 -17
  378. package/src/prover/smt/solver/pull-quant.ts +28 -12
  379. package/src/prover/smt/solver/purify-arith.ts +632 -0
  380. package/src/prover/smt/solver/qe-arith-plugin.ts +1096 -0
  381. package/src/prover/smt/solver/qe-lite-der.ts +2 -3
  382. package/src/prover/smt/solver/qe-lite-fm.ts +3 -4
  383. package/src/prover/smt/solver/qe-lite.ts +37 -17
  384. package/src/prover/smt/solver/qe-mbp.ts +270 -0
  385. package/src/prover/smt/solver/qe.ts +1499 -0
  386. package/src/prover/smt/solver/qel.ts +25 -0
  387. package/src/prover/smt/solver/qi-queue.ts +0 -1
  388. package/src/prover/smt/solver/qsat.ts +814 -0
  389. package/src/prover/smt/solver/quant-hoist.ts +196 -0
  390. package/src/prover/smt/solver/quant-tactics.ts +16 -56
  391. package/src/prover/smt/solver/quantifier-analyzer.ts +9 -10
  392. package/src/prover/smt/solver/quantifier-manager.ts +25 -24
  393. package/src/prover/smt/solver/quasi-macros.ts +243 -0
  394. package/src/prover/smt/solver/random-gen.ts +0 -1
  395. package/src/prover/smt/solver/rational.ts +45 -1
  396. package/src/prover/smt/solver/recfun-decl-plugin.ts +262 -0
  397. package/src/prover/smt/solver/recfun-rewriter.ts +107 -0
  398. package/src/prover/smt/solver/reduce-args.ts +225 -0
  399. package/src/prover/smt/solver/reduce-bv-size.ts +119 -0
  400. package/src/prover/smt/solver/ref-vector.ts +0 -1
  401. package/src/prover/smt/solver/relevancy.ts +1 -2
  402. package/src/prover/smt/solver/rewriter-tpl.ts +77 -10
  403. package/src/prover/smt/solver/rewriter.ts +475 -36
  404. package/src/prover/smt/solver/rlimit.ts +38 -2
  405. package/src/prover/smt/solver/sat/asymm-branch.ts +325 -0
  406. package/src/prover/smt/solver/sat/big.ts +177 -0
  407. package/src/prover/smt/solver/sat/clause-use-list.ts +71 -0
  408. package/src/prover/smt/solver/sat/clause.ts +203 -0
  409. package/src/prover/smt/solver/sat/cleaner.ts +94 -0
  410. package/src/prover/smt/solver/sat/config.ts +122 -0
  411. package/src/prover/smt/solver/sat/consequences.ts +203 -0
  412. package/src/prover/smt/solver/sat/elim-eqs.ts +142 -0
  413. package/src/prover/smt/solver/sat/goal2sat.ts +526 -0
  414. package/src/prover/smt/solver/sat/inc-sat-solver.ts +378 -0
  415. package/src/prover/smt/solver/sat/model-converter.ts +136 -0
  416. package/src/prover/smt/solver/sat/pb-constraint.ts +261 -0
  417. package/src/prover/smt/solver/sat/pb-solver.ts +1577 -0
  418. package/src/prover/smt/solver/sat/probing.ts +170 -0
  419. package/src/prover/smt/solver/sat/sat-tactic.ts +44 -0
  420. package/src/prover/smt/solver/sat/sat2goal.ts +165 -0
  421. package/src/prover/smt/solver/sat/scc.ts +142 -0
  422. package/src/prover/smt/solver/sat/simplifier.ts +1618 -0
  423. package/src/prover/smt/solver/sat/solver.ts +2105 -0
  424. package/src/prover/smt/solver/sat/var-queue.ts +117 -0
  425. package/src/prover/smt/solver/sat/watch-list.ts +140 -0
  426. package/src/prover/smt/solver/search-tree.ts +284 -0
  427. package/src/prover/smt/solver/seq-axioms.ts +995 -0
  428. package/src/prover/smt/solver/seq-decl-plugin.ts +819 -0
  429. package/src/prover/smt/solver/seq-derive.ts +1298 -0
  430. package/src/prover/smt/solver/seq-eq-approx.ts +236 -0
  431. package/src/prover/smt/solver/seq-eq-solver.ts +439 -0
  432. package/src/prover/smt/solver/seq-factory.ts +89 -0
  433. package/src/prover/smt/solver/seq-monadic.ts +730 -0
  434. package/src/prover/smt/solver/seq-range-predicate.ts +235 -0
  435. package/src/prover/smt/solver/seq-re-rewriter.ts +1171 -0
  436. package/src/prover/smt/solver/seq-re-util.ts +758 -0
  437. package/src/prover/smt/solver/seq-regex-bisim.ts +144 -0
  438. package/src/prover/smt/solver/seq-regex-live.ts +200 -0
  439. package/src/prover/smt/solver/seq-rewriter.ts +2404 -0
  440. package/src/prover/smt/solver/seq-skolem.ts +294 -0
  441. package/src/prover/smt/solver/seq-subset.ts +165 -0
  442. package/src/prover/smt/solver/seq-view-witness.ts +353 -0
  443. package/src/prover/smt/solver/smt-consequences.ts +297 -0
  444. package/src/prover/smt/solver/smt-kernel.ts +90 -0
  445. package/src/prover/smt/solver/smt-logics.ts +66 -0
  446. package/src/prover/smt/solver/smt-setup.ts +496 -0
  447. package/src/prover/smt/solver/smt2-printer.ts +765 -0
  448. package/src/prover/smt/solver/smtlib-parser.ts +3154 -326
  449. package/src/prover/smt/solver/smtlib-script.ts +1702 -0
  450. package/src/prover/smt/solver/solve-eqs.ts +923 -0
  451. package/src/prover/smt/solver/solver.ts +113 -22
  452. package/src/prover/smt/solver/static-features.ts +314 -0
  453. package/src/prover/smt/solver/sticky-generations.ts +0 -1
  454. package/src/prover/smt/solver/tactic.ts +1995 -0
  455. package/src/prover/smt/solver/term-enumeration.ts +205 -0
  456. package/src/prover/smt/solver/theory-array.ts +1240 -0
  457. package/src/prover/smt/solver/theory-bv.ts +1200 -0
  458. package/src/prover/smt/solver/theory-char.ts +355 -0
  459. package/src/prover/smt/solver/theory-datatype.ts +598 -0
  460. package/src/prover/smt/solver/theory-finite-set.ts +30 -0
  461. package/src/prover/smt/solver/theory-fpa.ts +389 -0
  462. package/src/prover/smt/solver/theory-lra-axioms.ts +53 -2
  463. package/src/prover/smt/solver/theory-lra-bounds.ts +31 -5
  464. package/src/prover/smt/solver/theory-lra-final-check.ts +56 -71
  465. package/src/prover/smt/solver/theory-lra-internalize.ts +89 -11
  466. package/src/prover/smt/solver/theory-lra-model.ts +20 -35
  467. package/src/prover/smt/solver/theory-lra-propagate.ts +24 -28
  468. package/src/prover/smt/solver/theory-lra-state.ts +6 -22
  469. package/src/prover/smt/solver/theory-lra.ts +188 -2
  470. package/src/prover/smt/solver/theory-pb.ts +933 -0
  471. package/src/prover/smt/solver/theory-polymorphism.ts +58 -0
  472. package/src/prover/smt/solver/theory-recfun.ts +307 -0
  473. package/src/prover/smt/solver/theory-seq-regex.ts +867 -0
  474. package/src/prover/smt/solver/theory-seq-solve.ts +1373 -0
  475. package/src/prover/smt/solver/theory-seq-state.ts +852 -0
  476. package/src/prover/smt/solver/theory-seq.ts +961 -0
  477. package/src/prover/smt/solver/theory.ts +189 -0
  478. package/src/prover/smt/solver/tseitin-cnf.ts +485 -0
  479. package/src/prover/smt/solver/var-subst.ts +36 -14
  480. package/src/prover/smt/table.ts +3 -2
  481. package/src/prover/smt/types.ts +146 -0
  482. package/src/prover/tlapm/cache.ts +29 -8
  483. package/src/prover/tlapm-library.ts +3208 -0
  484. package/src/prover/verdict.ts +2 -0
  485. package/src/prover/zenon/decide.ts +10 -7
  486. package/src/prover/zenon/encode.ts +0 -2
  487. package/src/prover/zenon/eqrel.ts +0 -2
  488. package/src/prover/zenon/equality-rules.ts +24 -2
  489. package/src/prover/zenon/expr.ts +21 -2
  490. package/src/prover/zenon/index-table.ts +7 -4
  491. package/src/prover/zenon/isar-case.ts +1 -3
  492. package/src/prover/zenon/isar.ts +2 -4
  493. package/src/prover/zenon/llproof.ts +0 -2
  494. package/src/prover/zenon/mltoll.ts +0 -2
  495. package/src/prover/zenon/node.ts +20 -5
  496. package/src/prover/zenon/parse.ts +6 -2
  497. package/src/prover/zenon/phrase.ts +1 -3
  498. package/src/prover/zenon/proof.ts +0 -2
  499. package/src/prover/zenon/propositional-rules.ts +0 -2
  500. package/src/prover/zenon/rules.ts +2 -3
  501. package/src/prover/zenon/search.ts +7 -5
  502. package/src/prover/zenon/tla/functions.ts +0 -2
  503. package/src/prover/zenon/tla/llproof.ts +0 -2
  504. package/src/prover/zenon/tla/records.ts +0 -2
  505. package/src/prover/zenon/tla/rewrites.ts +0 -2
  506. package/src/prover/zenon/tla/sets.ts +7 -8
  507. package/src/prover/zenon/tla/terms.ts +0 -2
  508. package/src/prover/zenon/tla/tla.ts +0 -2
  509. package/src/resolve.ts +72 -36
  510. package/src/runtime.ts +6 -0
  511. package/src/sany/generation.ts +1 -13
  512. package/src/sany/generator-definitions.ts +1 -1
  513. package/src/sany/generator-expressions.ts +9 -17
  514. package/src/sany/generator-proofs.ts +1 -1
  515. package/src/sany/generator.ts +1 -1
  516. package/src/sany/levels.ts +0 -2
  517. package/src/sany/linter.ts +0 -2
  518. package/src/search.ts +198 -45
  519. package/src/simulate.ts +3 -0
  520. package/src/standard-definitions.ts +4 -0
  521. package/src/state-graph.ts +0 -2
  522. package/src/subexpressions.ts +4 -2
  523. package/src/successors.ts +1 -1
  524. package/src/symmetry.ts +2 -2
  525. package/src/tableau.ts +2 -2
  526. package/src/tlc/fingerprint.ts +81 -9
  527. package/src/tlc/jar-data.ts +12 -0
  528. package/src/tlc/order.ts +14 -3
  529. package/src/tlc/summary.ts +29 -14
  530. package/src/tlc/tlcext-operators.ts +61 -16
  531. package/src/tlc/trace-spec.ts +2 -3
  532. package/src/typed-tier.ts +6541 -0
  533. package/src/typescript/types.ts +2 -2
  534. package/src/values.ts +1 -1
  535. package/src/prover/isabelle/isar/statement.ts +0 -52
  536. package/src/prover/smt/solver/z3-license.txt +0 -10
  537. package/src/prover/tlaps-module.ts +0 -510
  538. package/src/prover/zenon/LICENSE +0 -32
@@ -0,0 +1,382 @@
1
+ import { TlaIsabelleError } from "../../../errors";
2
+ import { fconvRule, premsConv } from "../pure/conv";
3
+ import { asmRl, compIncr, normHhfEq } from "../pure/drule";
4
+ import { emptyNet, insertTermNet, unifyTermNet, type Net } from "../pure/net";
5
+ import { addSimps, emptySimpset } from "../pure/raw-simplifier";
6
+ import { rewriteCterm } from "../pure/rewriter";
7
+ import { mapSeq, mapsSeq, seqOfList, singleSeq, type Seq } from "../pure/seq";
8
+ import { matchTac, resolveTac } from "../pure/tactic";
9
+ import { allTac, thenAllNew, tryTac, type GoalTactic } from "../pure/tactical";
10
+ import {
11
+ aconv,
12
+ dummyT,
13
+ existsSubterm,
14
+ fastypeOf,
15
+ listComb,
16
+ mkConst,
17
+ mkFree,
18
+ mkTVar,
19
+ mkVar,
20
+ type Term,
21
+ type Typ,
22
+ type Var,
23
+ } from "../pure/term";
24
+ import {
25
+ conclOf,
26
+ instantiate,
27
+ instantiateTypes,
28
+ majorPremOf,
29
+ premsOf,
30
+ type Thm,
31
+ } from "../pure/thm";
32
+ import { emptyTyEnv, normType, unifyTypes, type TyEnv } from "../pure/type";
33
+ import { stripAssumsConcl } from "../pure/logic";
34
+ import { getThms, parseFactReferences } from "./attrib";
35
+ import { readTerms, updateCases, type IsarContext } from "./context";
36
+ import type { Method } from "./method";
37
+ import { insertTac } from "./proof";
38
+ import {
39
+ consume,
40
+ dropJudgment,
41
+ getCases,
42
+ getConstraints,
43
+ internalizeParams,
44
+ makeCommon,
45
+ type CaseInfo,
46
+ type CasesRule,
47
+ } from "./rule-cases";
48
+ import { innerText, syntaxError, type OuterToken } from "./theory";
49
+
50
+ export interface NamedCasesRule {
51
+ readonly name: string;
52
+ readonly rule: CasesRule;
53
+ }
54
+
55
+ export interface InductData {
56
+ // Newest first, as Item_Net.content lists them.
57
+ readonly casesType: readonly NamedCasesRule[];
58
+ readonly casesPred: readonly NamedCasesRule[];
59
+ readonly casesDefault: CasesRule;
60
+ readonly trivialRule: Thm;
61
+ // The theorems of a fact of the logic with their tags.
62
+ readonly getTaggedFact: (name: string) => readonly CasesRule[] | undefined;
63
+ // Whether some fact of the logic tags this theorem.
64
+ readonly isTagged: (thm: Thm) => boolean;
65
+ }
66
+
67
+ interface CasesArgs {
68
+ readonly isSimp: boolean;
69
+ readonly insts: readonly (readonly (Term | undefined)[])[];
70
+ readonly rule: CasesRule | undefined;
71
+ }
72
+
73
+ const error = (message: string) => new TlaIsabelleError("ERROR", message);
74
+
75
+ const isInductConst = (term: Term) =>
76
+ term.kind === "Const" && term.name.startsWith("PredicateLogic.cases_");
77
+
78
+ // Induct.vars_of: the variables left to right, each where it occurs last.
79
+ const varsOf = (term: Term): Var[] => {
80
+ const occurrences: Var[] = [];
81
+ const visit = (current: Term) => {
82
+ if (current.kind === "Var") occurrences.unshift(current);
83
+ if (current.kind === "Abs") visit(current.body);
84
+ if (current.kind === "App") {
85
+ visit(current.fun);
86
+ visit(current.arg);
87
+ }
88
+ };
89
+ visit(term);
90
+ return occurrences
91
+ .filter(
92
+ (variable, index) =>
93
+ occurrences.findIndex(
94
+ (other) => other.name === variable.name && other.index === variable.index,
95
+ ) === index,
96
+ )
97
+ .reverse();
98
+ };
99
+
100
+ // Net.encode_type: a type as a term, for indexing.
101
+ const encodeType = (type: Typ): Term => {
102
+ switch (type.kind) {
103
+ case "Type":
104
+ return listComb(mkConst(type.name, dummyT), type.args.map(encodeType));
105
+ case "TFree":
106
+ return mkFree(type.name, dummyT);
107
+ case "TVar":
108
+ return mkVar(type.name, type.index, dummyT);
109
+ }
110
+ };
111
+
112
+ const leftVarPrem = (rule: Thm): Term => {
113
+ const prems = premsOf(rule);
114
+ const variable = prems.length === 0 ? undefined : varsOf(prems[0])[0];
115
+ if (variable === undefined)
116
+ throw new TlaIsabelleError("THM", "No variables in major premise of rule");
117
+ return encodeType(variable.type);
118
+ };
119
+
120
+ // Item_Net.retrieve: the rules whose index could unify with the term, newest first.
121
+ const retrieve = (
122
+ rules: readonly NamedCasesRule[],
123
+ index: (rule: Thm) => Term,
124
+ term: Term,
125
+ ): CasesRule[] =>
126
+ unifyTermNet(
127
+ rules.reduce<Net<number>>(
128
+ (net, entry, position) => insertTermNet(index(entry.rule.rule), position, net),
129
+ emptyNet,
130
+ ),
131
+ term,
132
+ )
133
+ .sort((left, right) => left - right)
134
+ .map((position) => rules[position].rule);
135
+
136
+ const lookupRule = (rules: readonly NamedCasesRule[], kind: string, name: string): CasesRule => {
137
+ const found = rules.find((entry) => entry.name === name || entry.name.endsWith(`.${name}`));
138
+ if (found === undefined) throw error(`No rule for ${kind} "${name}"`);
139
+ return found.rule;
140
+ };
141
+
142
+ // Object_Logic.elim_concl: an elimination rule concludes a variable that a premise concludes.
143
+ const isElimRule = (rule: Thm) =>
144
+ dropJudgment(conclOf(rule)).kind === "Var" &&
145
+ premsOf(rule).some((prem) => aconv(conclOf(rule), stripAssumsConcl(prem)));
146
+
147
+ const readRule = (isar: IsarContext, tokens: readonly OuterToken[]): CasesRule => {
148
+ const induct = isar.tactics.induct;
149
+ const [keyword, colon, ...rest] = tokens;
150
+ if (colon?.kind !== "symbol" || colon.text !== ":") throw syntaxError(colon);
151
+ if (keyword.text === "rule") {
152
+ const references = parseFactReferences(rest);
153
+ const thms = getThms(isar, references);
154
+ if (thms.length !== 1) throw error("Single rule expected");
155
+ if (references[0].attributes.length > 0) throw error("Unsupported cases rule with attributes");
156
+ const tagged = induct
157
+ .getTaggedFact(references[0].name)
158
+ ?.find((entry) => entry.rule === thms[0] && !isar.facts.has(references[0].name));
159
+ return tagged ?? { rule: thms[0], tags: [] };
160
+ }
161
+ const name = rest[0];
162
+ if (name === undefined || rest.length !== 1 || name.kind === "symbol") throw syntaxError(name);
163
+ if (keyword.text === "type") return lookupRule(induct.casesType, "type", name.text);
164
+ if (keyword.text === "pred" || keyword.text === "set")
165
+ return lookupRule(
166
+ induct.casesPred,
167
+ keyword.text,
168
+ isar.scope.constNames.get(name.text) ?? name.text,
169
+ );
170
+ throw syntaxError(keyword);
171
+ };
172
+
173
+ const RULE_KEYWORDS = new Set(["arbitrary", "taking", "type", "pred", "set", "rule"]);
174
+
175
+ // The cases method's syntax: (no_simp)?, instantiations separated by "and", then a rule.
176
+ const parseCasesArgs = (isar: IsarContext, tokens: readonly OuterToken[]): CasesArgs => {
177
+ const isSymbol = (position: number, text: string) =>
178
+ tokens[position]?.kind === "symbol" && tokens[position].text === text;
179
+ const isSimp = !(
180
+ isSymbol(0, "(") &&
181
+ tokens[1]?.kind === "word" &&
182
+ tokens[1].text === "no_simp" &&
183
+ isSymbol(2, ")")
184
+ );
185
+ let position = isSimp ? 0 : 3;
186
+ const insts: (Term | undefined)[][] = [[]];
187
+ while (
188
+ position < tokens.length &&
189
+ !(RULE_KEYWORDS.has(tokens[position].text) && isSymbol(position + 1, ":"))
190
+ ) {
191
+ const token = tokens[position];
192
+ position += 1;
193
+ if (token.kind === "word" && token.text === "and") insts.push([]);
194
+ else if (token.kind === "word" && token.text === "_") insts[insts.length - 1].push(undefined);
195
+ else if (token.kind === "symbol") throw syntaxError(token);
196
+ else
197
+ insts[insts.length - 1].push(
198
+ readTerms(
199
+ isar,
200
+ [
201
+ {
202
+ text: innerText(token),
203
+ type: mkTVar("'a", 0),
204
+ },
205
+ ],
206
+ "default",
207
+ )[0],
208
+ );
209
+ }
210
+ return {
211
+ isSimp,
212
+ insts: insts.length === 1 && insts[0].length === 0 ? [] : insts,
213
+ rule: position < tokens.length ? readRule(isar, tokens.slice(position)) : undefined,
214
+ };
215
+ };
216
+
217
+ const alignLeft = <Left, Right>(
218
+ message: string,
219
+ lefts: readonly Left[],
220
+ rights: readonly Right[],
221
+ ): [Left, Right][] => {
222
+ if (lefts.length < rights.length) throw error(message);
223
+ return rights.map((right, index) => [lefts[index], right]);
224
+ };
225
+
226
+ // Drule.infer_instantiate: the variables' types unify with their instances', then
227
+ // Drule.instantiate_normalize.
228
+ const inferInstantiate = (pairs: readonly [Var, Term][], rule: Thm): Thm => {
229
+ if (pairs.length === 0) return rule;
230
+ const tyenv = pairs.reduce<TyEnv>((env, pair) => {
231
+ const unified = unifyTypes(pair[0].type, fastypeOf(pair[1]), env);
232
+ if (unified === undefined) throw error("Ill-typed instantiation");
233
+ return unified;
234
+ }, emptyTyEnv);
235
+ return compIncr(
236
+ instantiate(
237
+ pairs.map((pair) => ({
238
+ variable: { ...pair[0], type: normType(tyenv, pair[0].type) },
239
+ term: pair[1],
240
+ })),
241
+ instantiateTypes(tyenv, rule),
242
+ ),
243
+ asmRl,
244
+ );
245
+ };
246
+
247
+ // Induct.simplified_rule' with the induct simpset. Its other rules and simprocs rewrite only
248
+ // PredicateLogic's cases_* constants, which no premise here mentions.
249
+ const simplifiedRule = (isar: IsarContext, rule: Thm): Thm => {
250
+ if (premsOf(rule).some((prem) => existsSubterm(isInductConst, prem)))
251
+ throw error("Unsupported cases rule with induct constraints");
252
+ const limits = isar.tactics.limits;
253
+ const empty = { limits, simpset: emptySimpset, bounds: 0 };
254
+ const context = { ...empty, simpset: addSimps(empty, [normHhfEq]) };
255
+ return fconvRule(
256
+ premsConv((term) =>
257
+ rewriteCterm(
258
+ { simprem: false, useprem: false, mutsimp: false },
259
+ () => undefined,
260
+ context,
261
+ term,
262
+ ),
263
+ ),
264
+ rule,
265
+ );
266
+ };
267
+
268
+ const firstResult = <Item>(seq: Seq<Item>): Seq<Item> => {
269
+ const cell = seq.pull();
270
+ return cell === undefined ? seq : singleSeq(cell[0]);
271
+ };
272
+
273
+ // Induct.cases_context_tactic on the first goal, as the cases method runs it under Seq.DETERM.
274
+ export const casesMethod = (isar: IsarContext, tokens: readonly OuterToken[]): Method => {
275
+ const args = parseCasesArgs(isar, tokens);
276
+ const induct = isar.tactics.induct;
277
+ const limits = isar.tactics.limits;
278
+ const instRule = (rule: CasesRule): [CaseInfo, number, CasesRule] => {
279
+ const instantiated =
280
+ args.insts.length === 0
281
+ ? rule.rule
282
+ : inferInstantiate(
283
+ alignLeft(
284
+ "Rule has fewer premises than arguments given",
285
+ premsOf(rule.rule),
286
+ args.insts,
287
+ ).flatMap((pair) =>
288
+ alignLeft(
289
+ "Rule has fewer variables than instantiations given",
290
+ varsOf(pair[0]),
291
+ pair[1],
292
+ ).flatMap((inst): [Var, Term][] => {
293
+ const term = inst[1];
294
+ if (term === undefined) return [];
295
+ if (unifyTypes(fastypeOf(term), inst[0].type, emptyTyEnv) === undefined)
296
+ throw error("Ill-typed instantiation");
297
+ return [[inst[0], term]];
298
+ }),
299
+ ),
300
+ rule.rule,
301
+ );
302
+ const [info, consumes] = getCases(rule);
303
+ return [
304
+ info,
305
+ consumes,
306
+ { rule: instantiated, tags: instantiated === rule.rule ? rule.tags : [] },
307
+ ];
308
+ };
309
+ return (facts) => (state) => {
310
+ const [rule, ruleFacts] =
311
+ args.rule === undefined && facts.length > 0 && isElimRule(facts[0])
312
+ ? [{ rule: facts[0], tags: [] }, facts.slice(1)]
313
+ : [args.rule, facts];
314
+ if (rule !== undefined && rule.tags.length === 0 && induct.isTagged(rule.rule))
315
+ throw error("Unsupported cases rule whose case names come from a fact");
316
+ const firstInst = args.insts[0]?.[0];
317
+ const checkSupported = (candidate: CasesRule) => {
318
+ if (args.isSimp && getConstraints(candidate.tags) > 0)
319
+ throw error("Unsupported cases rule with equality constraints");
320
+ return candidate;
321
+ };
322
+ const candidates: Seq<[CaseInfo, number, CasesRule]> =
323
+ rule !== undefined
324
+ ? singleSeq(instRule(checkSupported(rule)))
325
+ : mapsSeq(
326
+ (candidate: CasesRule) => {
327
+ checkSupported(candidate);
328
+ try {
329
+ return singleSeq(instRule(candidate));
330
+ } catch (caught) {
331
+ // Seq.try: any failure but an interrupt drops the candidate.
332
+ if (caught instanceof TlaIsabelleError && caught.exception !== "Interrupt")
333
+ return seqOfList([]);
334
+ throw caught;
335
+ }
336
+ },
337
+ seqOfList([
338
+ ...(ruleFacts.length === 0
339
+ ? []
340
+ : retrieve(induct.casesPred, majorPremOf, conclOf(ruleFacts[0]))),
341
+ ...(firstInst === undefined
342
+ ? []
343
+ : retrieve(induct.casesType, leftVarPrem, encodeType(fastypeOf(firstInst)))),
344
+ induct.casesDefault,
345
+ ]),
346
+ );
347
+ return firstResult(
348
+ mapsSeq(
349
+ (candidate: [CaseInfo, number, CasesRule]) =>
350
+ mapsSeq(
351
+ (consumed) => {
352
+ const [info, , remaining, consumedRule] = consumed;
353
+ const simplified = args.isSimp ? simplifiedRule(isar, consumedRule) : consumedRule;
354
+ const cases = makeCommon(
355
+ limits,
356
+ internalizeParams({
357
+ rule: simplified,
358
+ tags: simplified === candidate[2].rule ? candidate[2].tags : [],
359
+ }).prop,
360
+ info,
361
+ );
362
+ const tactic: GoalTactic = thenAllNew(
363
+ (index) => (goal) =>
364
+ mapsSeq(
365
+ resolveTac(limits, [simplified])(index),
366
+ insertTac(limits, remaining, index)(goal),
367
+ ),
368
+ (index) =>
369
+ args.isSimp ? tryTac(matchTac(limits, [induct.trivialRule])(index)) : allTac,
370
+ );
371
+ return mapSeq(
372
+ (goal: Thm) => ({ context: updateCases(state.context, cases), goal }),
373
+ tactic(1)(state.goal),
374
+ );
375
+ },
376
+ consume(limits, ruleFacts, candidate[0], candidate[1], candidate[2].rule),
377
+ ),
378
+ candidates,
379
+ ),
380
+ );
381
+ };
382
+ };
@@ -6,6 +6,8 @@ const TLA_TYPE = mkType("PredicateLogic.c");
6
6
  export type Ast =
7
7
  | { readonly kind: "name"; readonly name: string }
8
8
  | { readonly kind: "const"; readonly name: string }
9
+ | { readonly kind: "var"; readonly name: string; readonly index: number }
10
+ | { readonly kind: "dummy" }
9
11
  | { readonly kind: "app"; readonly fun: Ast; readonly arg: Ast }
10
12
  | {
11
13
  readonly kind: "abs";
@@ -19,8 +21,24 @@ type Token =
19
21
  | { readonly kind: "id"; readonly text: string }
20
22
  | { readonly kind: "delimiter"; readonly text: string }
21
23
  | { readonly kind: "string"; readonly text: string }
24
+ | { readonly kind: "var"; readonly text: string }
22
25
  | { readonly kind: "end" };
23
26
 
27
+ // The ASCII notations of the Isabelle/TLA+ theories, as the symbols they share a constant with.
28
+ const ASCII_DELIMITERS = new Map([
29
+ ["\\subseteq", "\\<subseteq>"],
30
+ ["\\notin", "\\<notin>"],
31
+ ["\\inter", "\\<inter>"],
32
+ ["\\union", "\\<union>"],
33
+ ["\\cup", "\\cup"],
34
+ ["\\in", "\\<in>"],
35
+ ["\\A", "\\<forall>"],
36
+ ["\\E", "\\<exists>"],
37
+ ["<=>", "\\<Leftrightarrow>"],
38
+ ["==", "\\<equiv>"],
39
+ ["~=", "~="],
40
+ ]);
41
+
24
42
  const DELIMITERS = [
25
43
  "::",
26
44
  ":>",
@@ -47,7 +65,7 @@ const DELIMITERS = [
47
65
  "0",
48
66
  ];
49
67
 
50
- const KEYWORDS = new Set(["EXCEPT", "DOMAIN", "SUBSET", "UNION", "PROP"]);
68
+ const KEYWORDS = new Set(["EXCEPT", "DOMAIN", "SUBSET", "UNION", "PROP", "CHOOSE"]);
51
69
 
52
70
  const isLetter = (char: string) => /[A-Za-z]/.test(char);
53
71
  const isIdChar = (char: string) => /[A-Za-z0-9_']/.test(char);
@@ -79,6 +97,26 @@ const tokenize = (text: string): Token[] => {
79
97
  position = end + 1;
80
98
  continue;
81
99
  }
100
+ if (char === "?" && isLetter(text[position + 1] ?? "")) {
101
+ let end = position + 2;
102
+ while (end < text.length && isIdChar(text[end])) end += 1;
103
+ tokens.push({ kind: "var", text: text.slice(position + 1, end) });
104
+ position = end;
105
+ continue;
106
+ }
107
+ if (char === "_" && !isIdChar(text[position + 1] ?? "")) {
108
+ tokens.push({ kind: "delimiter", text: "_" });
109
+ position += 1;
110
+ continue;
111
+ }
112
+ const ascii = [...ASCII_DELIMITERS.keys()].find((candidate) =>
113
+ text.startsWith(candidate, position),
114
+ );
115
+ if (ascii !== undefined) {
116
+ tokens.push({ kind: "delimiter", text: ASCII_DELIMITERS.get(ascii) ?? ascii });
117
+ position += ascii.length;
118
+ continue;
119
+ }
82
120
  if (isLetter(char)) {
83
121
  let end = position + 1;
84
122
  while (
@@ -106,6 +144,12 @@ const tokenize = (text: string): Token[] => {
106
144
  return tokens;
107
145
  };
108
146
 
147
+ // Lexicon.read_indexname: trailing digits are the index.
148
+ const readIndexname = (text: string) => {
149
+ const digits = /\d*$/.exec(text)?.[0] ?? "";
150
+ return { name: text.slice(0, text.length - digits.length), index: Number(digits || 0) };
151
+ };
152
+
109
153
  const toConstant = (name: string): Ast => ({ kind: "const", name });
110
154
  const apply = (fun: Ast, ...args: Ast[]) =>
111
155
  args.reduce<Ast>((result, arg) => ({ kind: "app", fun: result, arg }), fun);
@@ -156,6 +200,7 @@ const INFIXES = new Map<string, Infix>([
156
200
  ["\\<Rightarrow>", infixr("PredicateLogic.imp", 25)],
157
201
  ["=>", infixr("PredicateLogic.imp", 25)],
158
202
  ["\\<Leftrightarrow>", infixr("PredicateLogic.iff", 25)],
203
+ ["~=", { constant: "PredicateLogic.not_equal", left: 51, right: 51, priority: 50 }],
159
204
  ["\\<or>", infixr("PredicateLogic.disj", 30)],
160
205
  ["|", infixr("PredicateLogic.disj", 30)],
161
206
  ["\\<and>", infixr("PredicateLogic.conj", 35)],
@@ -166,7 +211,9 @@ const INFIXES = new Map<string, Infix>([
166
211
  ["\\<notin>", infixl("SetTheory.notin", 50)],
167
212
  ["\\<subseteq>", infixl("SetTheory.subset", 50)],
168
213
  ["\\<union>", infixl("SetTheory.union", 65)],
214
+ ["\\cup", infixl("Zenon.cup", 65)],
169
215
  ["\\", infixl("SetTheory.setminus", 65)],
216
+ ["\\<setminus>", infixl("SetTheory.setminus", 65)],
170
217
  ["\\<inter>", infixl("SetTheory.inter", 70)],
171
218
  ["@@", infixl("Functions.extend", 70)],
172
219
  [":>", infixl("Functions.oneArg", 75)],
@@ -336,6 +383,17 @@ class Parser {
336
383
  };
337
384
  continue;
338
385
  }
386
+ if (token.text === "\\<equiv>") {
387
+ if (minimum > 2 || left.priority < 3) return left;
388
+ this.position += 1;
389
+ const right = this.parseExpression(3);
390
+ left = {
391
+ ast: apply(toConstant("Pure.eq"), left.ast, right.ast),
392
+ priority: 2,
393
+ isProp: true,
394
+ };
395
+ continue;
396
+ }
339
397
  if (left.isProp) return left;
340
398
  if (token.text === "::") {
341
399
  if (minimum > 3 || left.priority < 4) return left;
@@ -391,6 +449,7 @@ class Parser {
391
449
  throw this.syntaxError();
392
450
  }
393
451
  if (token.kind === "id") return toTerm({ kind: "name", name: token.text });
452
+ if (token.kind === "var") return toTerm({ kind: "var", ...readIndexname(token.text) });
394
453
  if (token.kind === "string") return toTerm(toStringTerm(token.text));
395
454
  switch (token.text) {
396
455
  case "(": {
@@ -400,17 +459,102 @@ class Parser {
400
459
  }
401
460
  case "0":
402
461
  return toTerm(toConstant("Integers.zero"));
403
- case "{":
462
+ case "_":
463
+ return toTerm({ kind: "dummy" });
464
+ case "PROP": {
465
+ if (minimum > 1000) throw this.syntaxError();
466
+ const next = this.next();
467
+ if (next.kind === "id")
468
+ return { ast: { kind: "name", name: next.text }, priority: 1000, isProp: true };
469
+ if (next.kind === "var")
470
+ return {
471
+ ast: { kind: "var", ...readIndexname(next.text) },
472
+ priority: 1000,
473
+ isProp: true,
474
+ };
475
+ this.position -= 1;
476
+ throw this.syntaxError();
477
+ }
478
+ case "CHOOSE": {
479
+ if (minimum > 10) throw this.syntaxError();
480
+ const name = this.parseIdentifier();
481
+ if (this.isDelimiter("\\<in>")) {
482
+ this.position += 1;
483
+ const domain = this.parseLogic(0);
484
+ this.expect(":");
485
+ const body = this.parseLogic(0);
486
+ return toTerm(
487
+ apply(toConstant("SetTheory.bChoose"), domain, {
488
+ kind: "abs",
489
+ name,
490
+ type: undefined,
491
+ body,
492
+ }),
493
+ 10,
494
+ );
495
+ }
496
+ this.expect(":");
497
+ const body = this.parseLogic(10);
498
+ return toTerm(
499
+ apply(toConstant("PredicateLogic.Choice"), { kind: "abs", name, type: undefined, body }),
500
+ 10,
501
+ );
502
+ }
503
+ case "{": {
404
504
  if (this.isDelimiter("}")) {
405
505
  this.position += 1;
406
506
  return toTerm(toConstant("SetTheory.emptyset"), 100);
407
507
  }
508
+ // SetTheory's {x \<in> S : P} and {e : x \<in> S}, then an enumeration.
509
+ if (this.peek().kind === "id" && this.isDelimiter("\\<in>", 1)) {
510
+ const start = this.position;
511
+ const name = this.parseIdentifier();
512
+ this.position += 1;
513
+ const set = this.parseLogic(0);
514
+ if (this.isDelimiter(":")) {
515
+ this.position += 1;
516
+ const body = this.parseLogic(0);
517
+ this.expect("}");
518
+ return toTerm(
519
+ apply(toConstant("SetTheory.subsetOf"), set, {
520
+ kind: "abs",
521
+ name,
522
+ type: undefined,
523
+ body,
524
+ }),
525
+ );
526
+ }
527
+ this.position = start;
528
+ }
529
+ const first = this.parseLogic(0);
530
+ if (this.isDelimiter(":")) {
531
+ this.position += 1;
532
+ const name = this.parseIdentifier();
533
+ this.expect("\\<in>");
534
+ const set = this.parseLogic(0);
535
+ this.expect("}");
536
+ return toTerm(
537
+ apply(toConstant("SetTheory.setOfAll"), set, {
538
+ kind: "abs",
539
+ name,
540
+ type: undefined,
541
+ body: first,
542
+ }),
543
+ );
544
+ }
545
+ const elements = [first];
546
+ while (this.isDelimiter(",")) {
547
+ this.position += 1;
548
+ elements.push(this.parseLogic(0));
549
+ }
550
+ this.expect("}");
408
551
  return toTerm(
409
- this.parseCommaList("}").reduceRight(
552
+ elements.reduceRight(
410
553
  (set, element) => apply(toConstant("SetTheory.addElt"), element, set),
411
554
  toConstant("SetTheory.emptyset"),
412
555
  ),
413
556
  );
557
+ }
414
558
  case "<<":
415
559
  return toTerm(toTuple(this.parseCommaList(">>")));
416
560
  case "\\<langle>":
@@ -575,4 +719,6 @@ const parseWith = <Result>(text: string, parse: (parser: Parser) => Result): Res
575
719
 
576
720
  export const parseProp = (text: string) => parseWith(text, (parser) => parser.parseProp(0));
577
721
 
722
+ export const parseTerm = (text: string) => parseWith(text, (parser) => parser.parseLogic(0));
723
+
578
724
  export const parseType = (text: string) => parseWith(text, (parser) => parser.parseType());