tla-ts 0.0.10-dev.63a6693bd → 0.0.10-dev.6b2a6741a

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 (551) 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 +45 -41
  6. package/dist/index.cjs +1 -1
  7. package/dist/index.d.cts +5 -1
  8. package/dist/index.d.ts +5 -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 +44 -43
  18. package/dist/tlapm.cjs +1 -1
  19. package/dist/tlapm.js +1 -1
  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 +4 -3
  26. package/src/bags.ts +46 -28
  27. package/src/check-trace.ts +2 -16
  28. package/src/check.ts +349 -91
  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/cli/xml-exporter.ts +1 -1
  36. package/src/codegen.ts +9 -5
  37. package/src/dependencies.ts +72 -11
  38. package/src/dfid.ts +9 -2
  39. package/src/environment.ts +65 -36
  40. package/src/errors.ts +38 -3
  41. package/src/evaluate.ts +92 -32
  42. package/src/exit-codes.ts +5 -2
  43. package/src/instances.ts +5 -5
  44. package/src/java-overrides.ts +2 -2
  45. package/src/levels.ts +138 -90
  46. package/src/lexer.ts +5 -3
  47. package/src/liveness-checker.ts +572 -204
  48. package/src/liveness.ts +47 -32
  49. package/src/obligations/action.ts +10 -6
  50. package/src/obligations/anonymize.ts +33 -14
  51. package/src/obligations/enabled-axioms.ts +218 -0
  52. package/src/obligations/equality.ts +1 -3
  53. package/src/obligations/expression.ts +18 -6
  54. package/src/obligations/format.ts +0 -2
  55. package/src/obligations/generate.ts +22 -17
  56. package/src/obligations/index.ts +37 -7
  57. package/src/obligations/levels.ts +24 -11
  58. package/src/obligations/module.ts +1 -3
  59. package/src/obligations/normalize.ts +25 -17
  60. package/src/obligations/operators.ts +0 -2
  61. package/src/obligations/pragma.ts +53 -16
  62. package/src/obligations/printer.ts +48 -18
  63. package/src/obligations/proof.ts +3 -2
  64. package/src/obligations/regroup.ts +0 -2
  65. package/src/obligations/simplify.ts +17 -7
  66. package/src/obligations/source.ts +71 -17
  67. package/src/obligations/subexpression.ts +45 -18
  68. package/src/obligations/substitution.ts +1 -3
  69. package/src/obligations/temporal.ts +0 -2
  70. package/src/obligations/tuples.ts +0 -2
  71. package/src/parallel-worker.ts +8 -2
  72. package/src/parallel.ts +7 -2
  73. package/src/parser.ts +664 -287
  74. package/src/pretty-print.ts +1 -1
  75. package/src/prover/deciders.ts +11 -8
  76. package/src/prover/isabelle/decide.ts +3 -25
  77. package/src/prover/isabelle/encode.ts +71 -41
  78. package/src/prover/isabelle/isar/attrib.ts +250 -0
  79. package/src/prover/isabelle/isar/context.ts +335 -0
  80. package/src/prover/isabelle/isar/induct.ts +382 -0
  81. package/src/prover/isabelle/isar/inner-syntax.ts +149 -3
  82. package/src/prover/isabelle/isar/method.ts +506 -198
  83. package/src/prover/isabelle/isar/proof.ts +570 -14
  84. package/src/prover/isabelle/isar/rule-cases.ts +226 -0
  85. package/src/prover/isabelle/isar/theory.ts +479 -69
  86. package/src/prover/isabelle/isar/toplevel.ts +331 -0
  87. package/src/prover/isabelle/isar/type-check.ts +83 -8
  88. package/src/prover/isabelle/provers/blast/blast.ts +0 -2
  89. package/src/prover/isabelle/provers/blast/branch.ts +0 -2
  90. package/src/prover/isabelle/provers/blast/prove.ts +0 -2
  91. package/src/prover/isabelle/provers/blast/rules.ts +0 -2
  92. package/src/prover/isabelle/provers/blast/state.ts +0 -2
  93. package/src/prover/isabelle/provers/blast/term.ts +0 -2
  94. package/src/prover/isabelle/provers/clasimp.ts +1 -3
  95. package/src/prover/isabelle/provers/classical.ts +45 -20
  96. package/src/prover/isabelle/provers/hypsubst.ts +2 -4
  97. package/src/prover/isabelle/pure/bicompose.ts +0 -2
  98. package/src/prover/isabelle/pure/consts.ts +0 -2
  99. package/src/prover/isabelle/pure/conv.ts +0 -2
  100. package/src/prover/isabelle/pure/drule.ts +63 -4
  101. package/src/prover/isabelle/pure/envir.ts +0 -2
  102. package/src/prover/isabelle/pure/goal.ts +1 -3
  103. package/src/prover/isabelle/pure/logic.ts +0 -2
  104. package/src/prover/isabelle/pure/name.ts +0 -2
  105. package/src/prover/isabelle/pure/net.ts +0 -2
  106. package/src/prover/isabelle/pure/object-logic.ts +13 -7
  107. package/src/prover/isabelle/pure/pattern.ts +0 -2
  108. package/src/prover/isabelle/pure/raw-simplifier.ts +0 -2
  109. package/src/prover/isabelle/pure/rewriter.ts +4 -11
  110. package/src/prover/isabelle/pure/search.ts +0 -2
  111. package/src/prover/isabelle/pure/seq.ts +0 -2
  112. package/src/prover/isabelle/pure/simplifier.ts +26 -7
  113. package/src/prover/isabelle/pure/table.ts +0 -2
  114. package/src/prover/isabelle/pure/tactic.ts +0 -2
  115. package/src/prover/isabelle/pure/tactical.ts +0 -2
  116. package/src/prover/isabelle/pure/term-ord.ts +0 -2
  117. package/src/prover/isabelle/pure/term.ts +3 -5
  118. package/src/prover/isabelle/pure/thm.ts +0 -2
  119. package/src/prover/isabelle/pure/type.ts +0 -2
  120. package/src/prover/isabelle/pure/unify.ts +0 -2
  121. package/src/prover/isabelle/pure/variable.ts +0 -2
  122. package/src/prover/isabelle/tla/classical-setup.ts +1 -2
  123. package/src/prover/isabelle/tla/context.ts +51 -9
  124. package/src/prover/isabelle/tla/logic-data.ts +1 -1
  125. package/src/prover/isabelle/tla/logic.ts +40 -1
  126. package/src/prover/isabelle/tla/simpdata.ts +0 -2
  127. package/src/prover/isabelle/tools/intuitionistic.ts +28 -12
  128. package/src/prover/ocaml.ts +4 -1
  129. package/src/prover/prep/action.ts +19 -12
  130. package/src/prover/prep/enabled-axioms.ts +11 -2
  131. package/src/prover/prep/md5.ts +26 -29
  132. package/src/prover/prep/methods.ts +159 -50
  133. package/src/prover/prep/normalize.ts +38 -9
  134. package/src/prover/prove.ts +343 -65
  135. package/src/prover/ptl/decide.ts +95 -50
  136. package/src/prover/ptl/encode.ts +2 -3
  137. package/src/prover/ptl/tableau.ts +28 -2
  138. package/src/prover/smt/arithmetic.ts +310 -0
  139. package/src/prover/smt/axioms.ts +12 -8
  140. package/src/prover/smt/context.ts +42 -6
  141. package/src/prover/smt/data.ts +191 -84
  142. package/src/prover/smt/encode.ts +122 -43
  143. package/src/prover/smt/extensionality.ts +5 -3
  144. package/src/prover/smt/flatten.ts +4 -6
  145. package/src/prover/smt/format.ts +28 -4
  146. package/src/prover/smt/instances.ts +7 -1
  147. package/src/prover/smt/layout.ts +91 -0
  148. package/src/prover/smt/rewrite.ts +483 -116
  149. package/src/prover/smt/simplify.ts +441 -0
  150. package/src/prover/smt/solver/ackermannize-bv-tactic.ts +61 -0
  151. package/src/prover/smt/solver/ackr-helper.ts +179 -0
  152. package/src/prover/smt/solver/ackr-model-converter.ts +105 -0
  153. package/src/prover/smt/solver/act-cache.ts +0 -1
  154. package/src/prover/smt/solver/add-bounds-tactic.ts +59 -0
  155. package/src/prover/smt/solver/aig-tactic.ts +52 -0
  156. package/src/prover/smt/solver/aig.ts +889 -0
  157. package/src/prover/smt/solver/arith-rewriter.ts +613 -6
  158. package/src/prover/smt/solver/arith-terms.ts +121 -0
  159. package/src/prover/smt/solver/array-decl-plugin.ts +175 -0
  160. package/src/prover/smt/solver/array-rewriter.ts +309 -0
  161. package/src/prover/smt/solver/asserted-formulas.ts +93 -15
  162. package/src/prover/smt/solver/ast-lt.ts +165 -11
  163. package/src/prover/smt/solver/ast-util.ts +160 -2
  164. package/src/prover/smt/solver/ast.ts +1449 -41
  165. package/src/prover/smt/solver/auf-solver.ts +0 -1
  166. package/src/prover/smt/solver/bit-blast-tactic.ts +582 -0
  167. package/src/prover/smt/solver/bit-blaster.ts +871 -0
  168. package/src/prover/smt/solver/bound-manager.ts +196 -0
  169. package/src/prover/smt/solver/bound-simplifier.ts +600 -0
  170. package/src/prover/smt/solver/bv-bound-chk.ts +492 -0
  171. package/src/prover/smt/solver/bv-decl-plugin.ts +341 -0
  172. package/src/prover/smt/solver/bv-divrem-bounds.ts +95 -0
  173. package/src/prover/smt/solver/bv-rewriter.ts +1901 -0
  174. package/src/prover/smt/solver/bv1-blast.ts +214 -0
  175. package/src/prover/smt/solver/bv2fpa-converter.ts +174 -0
  176. package/src/prover/smt/solver/bv2int-rewriter.ts +544 -0
  177. package/src/prover/smt/solver/bv2real-rewriter.ts +533 -0
  178. package/src/prover/smt/solver/card2bv.ts +109 -0
  179. package/src/prover/smt/solver/case-split-queue.ts +0 -2
  180. package/src/prover/smt/solver/cg-table.ts +39 -25
  181. package/src/prover/smt/solver/check-logic.ts +330 -0
  182. package/src/prover/smt/solver/clause.ts +0 -1
  183. package/src/prover/smt/solver/cofactor-elim-term-ite.ts +278 -0
  184. package/src/prover/smt/solver/conflict-resolution.ts +78 -2
  185. package/src/prover/smt/solver/context.ts +533 -114
  186. package/src/prover/smt/solver/ctx-simplify.ts +21 -12
  187. package/src/prover/smt/solver/ctx-solver-simplify.ts +122 -0
  188. package/src/prover/smt/solver/datatype-decl-plugin.ts +572 -0
  189. package/src/prover/smt/solver/datatype-rewriter.ts +82 -0
  190. package/src/prover/smt/solver/demodulator.ts +786 -0
  191. package/src/prover/smt/solver/dependent-expr-state.ts +81 -0
  192. package/src/prover/smt/solver/der.ts +38 -10
  193. package/src/prover/smt/solver/diff-neq.ts +205 -0
  194. package/src/prover/smt/solver/distribute-forall.ts +57 -0
  195. package/src/prover/smt/solver/dom-simplify.ts +511 -0
  196. package/src/prover/smt/solver/dt2bv-tactic.ts +260 -0
  197. package/src/prover/smt/solver/dyn-ack.ts +0 -1
  198. package/src/prover/smt/solver/e-matching.ts +6 -7
  199. package/src/prover/smt/solver/elim-small-bv-tactic.ts +129 -0
  200. package/src/prover/smt/solver/elim-uncnstr.ts +542 -0
  201. package/src/prover/smt/solver/enode.ts +100 -3
  202. package/src/prover/smt/solver/eq2bv-tactic.ts +218 -0
  203. package/src/prover/smt/solver/euf/arith-axioms.ts +403 -0
  204. package/src/prover/smt/solver/euf/arith-internalize.ts +653 -0
  205. package/src/prover/smt/solver/euf/arith-solver.ts +889 -0
  206. package/src/prover/smt/solver/euf/array-axioms.ts +527 -0
  207. package/src/prover/smt/solver/euf/array-internalize.ts +428 -0
  208. package/src/prover/smt/solver/euf/array-solver.ts +306 -0
  209. package/src/prover/smt/solver/euf/bv-ackerman.ts +162 -0
  210. package/src/prover/smt/solver/euf/bv-internalize.ts +748 -0
  211. package/src/prover/smt/solver/euf/bv-solver.ts +449 -0
  212. package/src/prover/smt/solver/euf/dt-solver.ts +618 -0
  213. package/src/prover/smt/solver/euf/egraph.ts +901 -0
  214. package/src/prover/smt/solver/euf/euf-solver.ts +1204 -0
  215. package/src/prover/smt/solver/euf/fpa-solver.ts +317 -0
  216. package/src/prover/smt/solver/euf/mam.ts +1046 -0
  217. package/src/prover/smt/solver/euf/q-ematch.ts +829 -0
  218. package/src/prover/smt/solver/euf/q-mbi.ts +587 -0
  219. package/src/prover/smt/solver/euf/q-model-fixer.ts +296 -0
  220. package/src/prover/smt/solver/euf/q-solver.ts +361 -0
  221. package/src/prover/smt/solver/euf/th-solver.ts +328 -0
  222. package/src/prover/smt/solver/euf/th-solvers.ts +30 -0
  223. package/src/prover/smt/solver/expr-ref.ts +0 -1
  224. package/src/prover/smt/solver/expr-safe-replace.ts +26 -2
  225. package/src/prover/smt/solver/expr2polynomial.ts +271 -0
  226. package/src/prover/smt/solver/factor.ts +163 -0
  227. package/src/prover/smt/solver/fd-solver.ts +267 -0
  228. package/src/prover/smt/solver/fingerprints.ts +15 -15
  229. package/src/prover/smt/solver/fix-dl-var.ts +147 -0
  230. package/src/prover/smt/solver/flat-literals.ts +0 -1
  231. package/src/prover/smt/solver/fm-tactic.ts +884 -0
  232. package/src/prover/smt/solver/fpa-decl-plugin.ts +618 -0
  233. package/src/prover/smt/solver/fpa-rewriter.ts +639 -0
  234. package/src/prover/smt/solver/fpa2bv-converter.ts +2251 -0
  235. package/src/prover/smt/solver/fpa2bv-rewriter.ts +349 -0
  236. package/src/prover/smt/solver/fpa2bv-tactic.ts +73 -0
  237. package/src/prover/smt/solver/goal.ts +177 -15
  238. package/src/prover/smt/solver/goal2nlsat.ts +216 -0
  239. package/src/prover/smt/solver/guard-set.ts +219 -0
  240. package/src/prover/smt/solver/hash.ts +0 -1
  241. package/src/prover/smt/solver/hashtable.ts +30 -16
  242. package/src/prover/smt/solver/inf-eps.ts +63 -0
  243. package/src/prover/smt/solver/inj-axiom.ts +101 -0
  244. package/src/prover/smt/solver/internalizer.ts +109 -36
  245. package/src/prover/smt/solver/lackr.ts +381 -0
  246. package/src/prover/smt/solver/lbool.ts +0 -1
  247. package/src/prover/smt/solver/lia2card.ts +268 -0
  248. package/src/prover/smt/solver/lia2pb.ts +154 -0
  249. package/src/prover/smt/solver/literal.ts +0 -1
  250. package/src/prover/smt/solver/logic-tactics.ts +345 -0
  251. package/src/prover/smt/solver/lp/bound-propagator.ts +0 -1
  252. package/src/prover/smt/solver/lp/constraints.ts +0 -1
  253. package/src/prover/smt/solver/lp/containers.ts +7 -2
  254. package/src/prover/smt/solver/lp/core-solver.ts +18 -3
  255. package/src/prover/smt/solver/lp/cross-nested.ts +1 -4
  256. package/src/prover/smt/solver/lp/dep-intervals.ts +0 -3
  257. package/src/prover/smt/solver/lp/dependency.ts +0 -2
  258. package/src/prover/smt/solver/lp/dioph-eq.ts +0 -2
  259. package/src/prover/smt/solver/lp/explanation.ts +0 -1
  260. package/src/prover/smt/solver/lp/gomory.ts +0 -1
  261. package/src/prover/smt/solver/lp/hnf-cutter.ts +0 -1
  262. package/src/prover/smt/solver/lp/hnf.ts +0 -3
  263. package/src/prover/smt/solver/lp/int-cube.ts +3 -4
  264. package/src/prover/smt/solver/lp/int-solver.ts +0 -2
  265. package/src/prover/smt/solver/lp/lar-solver.ts +40 -4
  266. package/src/prover/smt/solver/lp/lar-term.ts +0 -1
  267. package/src/prover/smt/solver/lp/lp-settings.ts +0 -1
  268. package/src/prover/smt/solver/lp/maximize-term.ts +59 -10
  269. package/src/prover/smt/solver/lp/nex-creator.ts +3 -3
  270. package/src/prover/smt/solver/lp/nex.ts +2 -2
  271. package/src/prover/smt/solver/lp/nla-backoff.ts +0 -2
  272. package/src/prover/smt/solver/lp/nla-basics.ts +46 -3
  273. package/src/prover/smt/solver/lp/nla-core.ts +66 -11
  274. package/src/prover/smt/solver/lp/nla-divisions.ts +0 -2
  275. package/src/prover/smt/solver/lp/nla-emonics.ts +0 -1
  276. package/src/prover/smt/solver/lp/nla-factorization.ts +0 -1
  277. package/src/prover/smt/solver/lp/nla-grobner.ts +167 -85
  278. package/src/prover/smt/solver/lp/nla-horner.ts +0 -2
  279. package/src/prover/smt/solver/lp/nla-intervals.ts +0 -1
  280. package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +0 -2
  281. package/src/prover/smt/solver/lp/nla-monotone.ts +0 -1
  282. package/src/prover/smt/solver/lp/nla-order.ts +0 -2
  283. package/src/prover/smt/solver/lp/nla-patcher.ts +0 -1
  284. package/src/prover/smt/solver/lp/nla-powers.ts +220 -0
  285. package/src/prover/smt/solver/lp/nla-tangents.ts +0 -2
  286. package/src/prover/smt/solver/lp/nla-throttle.ts +0 -1
  287. package/src/prover/smt/solver/lp/nla-transcendentals.ts +324 -0
  288. package/src/prover/smt/solver/lp/nla-types.ts +0 -2
  289. package/src/prover/smt/solver/lp/nla-var-eqs.ts +0 -1
  290. package/src/prover/smt/solver/lp/nra-solver.ts +163 -99
  291. package/src/prover/smt/solver/lp/numeric-pair.ts +0 -1
  292. package/src/prover/smt/solver/lp/pdd-interval.ts +6 -3
  293. package/src/prover/smt/solver/lp/pdd-simplifier.ts +60 -21
  294. package/src/prover/smt/solver/lp/pdd-solver.ts +72 -41
  295. package/src/prover/smt/solver/lp/pdd.ts +725 -290
  296. package/src/prover/smt/solver/lp/random-updater.ts +0 -2
  297. package/src/prover/smt/solver/lp/static-matrix.ts +0 -1
  298. package/src/prover/smt/solver/lp/union-find.ts +7 -2
  299. package/src/prover/smt/solver/macro-finder.ts +530 -0
  300. package/src/prover/smt/solver/mam-compiler.ts +118 -88
  301. package/src/prover/smt/solver/mam-interpreter.ts +0 -1
  302. package/src/prover/smt/solver/max-bv-sharing-tactic.ts +17 -0
  303. package/src/prover/smt/solver/max-cliques.ts +105 -0
  304. package/src/prover/smt/solver/maxcore.ts +309 -0
  305. package/src/prover/smt/solver/maximize-ac-sharing.ts +8 -6
  306. package/src/prover/smt/solver/maxlex.ts +115 -0
  307. package/src/prover/smt/solver/maxsmt-base.ts +105 -0
  308. package/src/prover/smt/solver/maxsmt.ts +92 -0
  309. package/src/prover/smt/solver/mbp/mbp-arith.ts +467 -0
  310. package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +101 -0
  311. package/src/prover/smt/solver/mbp/mbp-plugin.ts +287 -0
  312. package/src/prover/smt/solver/mbp/mbp-qel.ts +48 -0
  313. package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +271 -0
  314. package/src/prover/smt/solver/mbp/mbp-term-graph.ts +606 -0
  315. package/src/prover/smt/solver/model-based-opt.ts +844 -0
  316. package/src/prover/smt/solver/model-checker.ts +17 -26
  317. package/src/prover/smt/solver/model-evaluator.ts +188 -12
  318. package/src/prover/smt/solver/model-finder.ts +0 -1
  319. package/src/prover/smt/solver/model-generator.ts +59 -30
  320. package/src/prover/smt/solver/model-macro-solver.ts +38 -27
  321. package/src/prover/smt/solver/model-printer.ts +214 -0
  322. package/src/prover/smt/solver/mpf.ts +709 -0
  323. package/src/prover/smt/solver/mus.ts +50 -0
  324. package/src/prover/smt/solver/muz/dl-context.ts +410 -0
  325. package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +97 -0
  326. package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +167 -0
  327. package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +125 -0
  328. package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +299 -0
  329. package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +455 -0
  330. package/src/prover/smt/solver/muz/dl-mk-slice.ts +340 -0
  331. package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +163 -0
  332. package/src/prover/smt/solver/muz/dl-rule-set.ts +273 -0
  333. package/src/prover/smt/solver/muz/dl-rule-transformer.ts +123 -0
  334. package/src/prover/smt/solver/muz/dl-rule.ts +496 -0
  335. package/src/prover/smt/solver/muz/hnf.ts +201 -0
  336. package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +176 -0
  337. package/src/prover/smt/solver/muz/horn-tactic.ts +201 -0
  338. package/src/prover/smt/solver/muz/rule-properties.ts +337 -0
  339. package/src/prover/smt/solver/muz/spacer-context.ts +1404 -0
  340. package/src/prover/smt/solver/muz/spacer-dl-interface.ts +52 -0
  341. package/src/prover/smt/solver/muz/spacer-generalizers.ts +241 -0
  342. package/src/prover/smt/solver/muz/spacer-manager.ts +127 -0
  343. package/src/prover/smt/solver/muz/spacer-pdr.ts +219 -0
  344. package/src/prover/smt/solver/muz/spacer-prop-solver.ts +333 -0
  345. package/src/prover/smt/solver/muz/spacer-util.ts +282 -0
  346. package/src/prover/smt/solver/muz/substitution.ts +203 -0
  347. package/src/prover/smt/solver/nla2bv-tactic.ts +285 -0
  348. package/src/prover/smt/solver/nlqsat.ts +484 -0
  349. package/src/prover/smt/solver/nlsat/algebraic.ts +305 -88
  350. package/src/prover/smt/solver/nlsat/atoms.ts +52 -35
  351. package/src/prover/smt/solver/nlsat/evaluator.ts +0 -1
  352. package/src/prover/smt/solver/nlsat/explain.ts +424 -211
  353. package/src/prover/smt/solver/nlsat/interval-set.ts +1 -2
  354. package/src/prover/smt/solver/nlsat/levelwise.ts +460 -241
  355. package/src/prover/smt/solver/nlsat/mpbq.ts +45 -1
  356. package/src/prover/smt/solver/nlsat/polynomial.ts +2366 -683
  357. package/src/prover/smt/solver/nlsat/solver.ts +282 -69
  358. package/src/prover/smt/solver/nlsat/transcendental-eval.ts +310 -0
  359. package/src/prover/smt/solver/nlsat/transcendentals.ts +391 -0
  360. package/src/prover/smt/solver/nlsat/types.ts +0 -2
  361. package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +8 -7
  362. package/src/prover/smt/solver/nlsat/upolynomial.ts +41 -20
  363. package/src/prover/smt/solver/nlsat-tactic.ts +82 -0
  364. package/src/prover/smt/solver/nnf.ts +105 -23
  365. package/src/prover/smt/solver/normalize-bounds.ts +53 -0
  366. package/src/prover/smt/solver/occf.ts +97 -0
  367. package/src/prover/smt/solver/opt-context.ts +792 -0
  368. package/src/prover/smt/solver/opt-nlsat.ts +386 -0
  369. package/src/prover/smt/solver/opt-pareto.ts +282 -0
  370. package/src/prover/smt/solver/opt-preprocess.ts +101 -0
  371. package/src/prover/smt/solver/opt-solver.ts +311 -0
  372. package/src/prover/smt/solver/opt-value.ts +55 -0
  373. package/src/prover/smt/solver/optsmt.ts +692 -0
  374. package/src/prover/smt/solver/parallel-tactic.ts +299 -0
  375. package/src/prover/smt/solver/pattern-inference.ts +19 -11
  376. package/src/prover/smt/solver/pb-rewriter.ts +281 -0
  377. package/src/prover/smt/solver/pb2bv-tactic.ts +540 -0
  378. package/src/prover/smt/solver/poly-rewriter.ts +202 -57
  379. package/src/prover/smt/solver/probes.ts +511 -0
  380. package/src/prover/smt/solver/propagate-values.ts +37 -21
  381. package/src/prover/smt/solver/proto-model.ts +650 -17
  382. package/src/prover/smt/solver/pull-quant.ts +28 -12
  383. package/src/prover/smt/solver/purify-arith.ts +632 -0
  384. package/src/prover/smt/solver/qe-arith-plugin.ts +1096 -0
  385. package/src/prover/smt/solver/qe-lite-der.ts +2 -3
  386. package/src/prover/smt/solver/qe-lite-fm.ts +3 -4
  387. package/src/prover/smt/solver/qe-lite.ts +37 -17
  388. package/src/prover/smt/solver/qe-mbp.ts +270 -0
  389. package/src/prover/smt/solver/qe.ts +1499 -0
  390. package/src/prover/smt/solver/qel.ts +25 -0
  391. package/src/prover/smt/solver/qi-queue.ts +0 -1
  392. package/src/prover/smt/solver/qsat.ts +814 -0
  393. package/src/prover/smt/solver/quant-hoist.ts +196 -0
  394. package/src/prover/smt/solver/quant-tactics.ts +16 -56
  395. package/src/prover/smt/solver/quantifier-analyzer.ts +9 -10
  396. package/src/prover/smt/solver/quantifier-manager.ts +25 -24
  397. package/src/prover/smt/solver/quasi-macros.ts +243 -0
  398. package/src/prover/smt/solver/random-gen.ts +0 -1
  399. package/src/prover/smt/solver/rational.ts +45 -1
  400. package/src/prover/smt/solver/recfun-decl-plugin.ts +262 -0
  401. package/src/prover/smt/solver/recfun-rewriter.ts +107 -0
  402. package/src/prover/smt/solver/reduce-args.ts +225 -0
  403. package/src/prover/smt/solver/reduce-bv-size.ts +119 -0
  404. package/src/prover/smt/solver/ref-vector.ts +0 -1
  405. package/src/prover/smt/solver/relevancy.ts +1 -2
  406. package/src/prover/smt/solver/rewriter-tpl.ts +77 -10
  407. package/src/prover/smt/solver/rewriter.ts +475 -36
  408. package/src/prover/smt/solver/rlimit.ts +38 -2
  409. package/src/prover/smt/solver/sat/asymm-branch.ts +325 -0
  410. package/src/prover/smt/solver/sat/big.ts +177 -0
  411. package/src/prover/smt/solver/sat/clause-use-list.ts +71 -0
  412. package/src/prover/smt/solver/sat/clause.ts +203 -0
  413. package/src/prover/smt/solver/sat/cleaner.ts +94 -0
  414. package/src/prover/smt/solver/sat/config.ts +122 -0
  415. package/src/prover/smt/solver/sat/consequences.ts +203 -0
  416. package/src/prover/smt/solver/sat/elim-eqs.ts +142 -0
  417. package/src/prover/smt/solver/sat/goal2sat.ts +526 -0
  418. package/src/prover/smt/solver/sat/inc-sat-solver.ts +378 -0
  419. package/src/prover/smt/solver/sat/model-converter.ts +136 -0
  420. package/src/prover/smt/solver/sat/pb-constraint.ts +261 -0
  421. package/src/prover/smt/solver/sat/pb-solver.ts +1577 -0
  422. package/src/prover/smt/solver/sat/probing.ts +170 -0
  423. package/src/prover/smt/solver/sat/sat-tactic.ts +44 -0
  424. package/src/prover/smt/solver/sat/sat2goal.ts +165 -0
  425. package/src/prover/smt/solver/sat/scc.ts +142 -0
  426. package/src/prover/smt/solver/sat/simplifier.ts +1618 -0
  427. package/src/prover/smt/solver/sat/solver.ts +2105 -0
  428. package/src/prover/smt/solver/sat/var-queue.ts +117 -0
  429. package/src/prover/smt/solver/sat/watch-list.ts +140 -0
  430. package/src/prover/smt/solver/search-tree.ts +284 -0
  431. package/src/prover/smt/solver/seq-axioms.ts +995 -0
  432. package/src/prover/smt/solver/seq-decl-plugin.ts +819 -0
  433. package/src/prover/smt/solver/seq-derive.ts +1298 -0
  434. package/src/prover/smt/solver/seq-eq-approx.ts +236 -0
  435. package/src/prover/smt/solver/seq-eq-solver.ts +439 -0
  436. package/src/prover/smt/solver/seq-factory.ts +89 -0
  437. package/src/prover/smt/solver/seq-monadic.ts +730 -0
  438. package/src/prover/smt/solver/seq-range-predicate.ts +235 -0
  439. package/src/prover/smt/solver/seq-re-rewriter.ts +1171 -0
  440. package/src/prover/smt/solver/seq-re-util.ts +758 -0
  441. package/src/prover/smt/solver/seq-regex-bisim.ts +144 -0
  442. package/src/prover/smt/solver/seq-regex-live.ts +200 -0
  443. package/src/prover/smt/solver/seq-rewriter.ts +2404 -0
  444. package/src/prover/smt/solver/seq-skolem.ts +294 -0
  445. package/src/prover/smt/solver/seq-subset.ts +165 -0
  446. package/src/prover/smt/solver/seq-view-witness.ts +353 -0
  447. package/src/prover/smt/solver/smt-consequences.ts +297 -0
  448. package/src/prover/smt/solver/smt-kernel.ts +90 -0
  449. package/src/prover/smt/solver/smt-logics.ts +66 -0
  450. package/src/prover/smt/solver/smt-setup.ts +544 -0
  451. package/src/prover/smt/solver/smt2-printer.ts +765 -0
  452. package/src/prover/smt/solver/smtlib-parser.ts +3228 -327
  453. package/src/prover/smt/solver/smtlib-script.ts +1843 -0
  454. package/src/prover/smt/solver/solve-eqs.ts +923 -0
  455. package/src/prover/smt/solver/solver.ts +113 -22
  456. package/src/prover/smt/solver/static-features.ts +314 -0
  457. package/src/prover/smt/solver/sticky-generations.ts +0 -1
  458. package/src/prover/smt/solver/tactic.ts +2012 -0
  459. package/src/prover/smt/solver/term-enumeration.ts +205 -0
  460. package/src/prover/smt/solver/theory-array.ts +1240 -0
  461. package/src/prover/smt/solver/theory-bv.ts +1200 -0
  462. package/src/prover/smt/solver/theory-char.ts +355 -0
  463. package/src/prover/smt/solver/theory-datatype.ts +598 -0
  464. package/src/prover/smt/solver/theory-finite-set.ts +30 -0
  465. package/src/prover/smt/solver/theory-fpa.ts +389 -0
  466. package/src/prover/smt/solver/theory-lra-axioms.ts +53 -2
  467. package/src/prover/smt/solver/theory-lra-bounds.ts +31 -5
  468. package/src/prover/smt/solver/theory-lra-final-check.ts +56 -71
  469. package/src/prover/smt/solver/theory-lra-internalize.ts +89 -11
  470. package/src/prover/smt/solver/theory-lra-model.ts +20 -35
  471. package/src/prover/smt/solver/theory-lra-propagate.ts +24 -28
  472. package/src/prover/smt/solver/theory-lra-state.ts +6 -22
  473. package/src/prover/smt/solver/theory-lra.ts +188 -2
  474. package/src/prover/smt/solver/theory-pb.ts +933 -0
  475. package/src/prover/smt/solver/theory-polymorphism.ts +58 -0
  476. package/src/prover/smt/solver/theory-recfun.ts +307 -0
  477. package/src/prover/smt/solver/theory-seq-regex.ts +867 -0
  478. package/src/prover/smt/solver/theory-seq-solve.ts +1373 -0
  479. package/src/prover/smt/solver/theory-seq-state.ts +852 -0
  480. package/src/prover/smt/solver/theory-seq.ts +961 -0
  481. package/src/prover/smt/solver/theory.ts +189 -0
  482. package/src/prover/smt/solver/tseitin-cnf.ts +485 -0
  483. package/src/prover/smt/solver/var-subst.ts +36 -14
  484. package/src/prover/smt/table.ts +3 -2
  485. package/src/prover/smt/types.ts +146 -0
  486. package/src/prover/tlapm/cache.ts +37 -16
  487. package/src/prover/tlapm-library.ts +3208 -0
  488. package/src/prover/verdict.ts +2 -0
  489. package/src/prover/zenon/decide.ts +10 -7
  490. package/src/prover/zenon/encode.ts +0 -2
  491. package/src/prover/zenon/eqrel.ts +0 -2
  492. package/src/prover/zenon/equality-rules.ts +24 -2
  493. package/src/prover/zenon/expr.ts +21 -2
  494. package/src/prover/zenon/index-table.ts +7 -4
  495. package/src/prover/zenon/isar-case.ts +1 -3
  496. package/src/prover/zenon/isar.ts +2 -4
  497. package/src/prover/zenon/llproof.ts +0 -2
  498. package/src/prover/zenon/mltoll.ts +0 -2
  499. package/src/prover/zenon/node.ts +20 -5
  500. package/src/prover/zenon/parse.ts +6 -2
  501. package/src/prover/zenon/phrase.ts +1 -3
  502. package/src/prover/zenon/proof.ts +0 -2
  503. package/src/prover/zenon/propositional-rules.ts +0 -2
  504. package/src/prover/zenon/rules.ts +2 -3
  505. package/src/prover/zenon/search.ts +7 -5
  506. package/src/prover/zenon/tla/functions.ts +0 -2
  507. package/src/prover/zenon/tla/llproof.ts +0 -2
  508. package/src/prover/zenon/tla/records.ts +0 -2
  509. package/src/prover/zenon/tla/rewrites.ts +0 -2
  510. package/src/prover/zenon/tla/sets.ts +7 -8
  511. package/src/prover/zenon/tla/terms.ts +0 -2
  512. package/src/prover/zenon/tla/tla.ts +0 -2
  513. package/src/resolve.ts +625 -189
  514. package/src/runtime.ts +7 -1
  515. package/src/sany/builtins.ts +10 -10
  516. package/src/sany/generation.ts +2 -13
  517. package/src/sany/generator-definitions.ts +3 -1
  518. package/src/sany/generator-expressions.ts +36 -30
  519. package/src/sany/generator-proofs.ts +5 -3
  520. package/src/sany/generator.ts +2 -1
  521. package/src/sany/levels.ts +0 -2
  522. package/src/sany/lexer.ts +3 -3
  523. package/src/sany/linter.ts +0 -2
  524. package/src/sany/modules.ts +4 -2
  525. package/src/sany/nodes.ts +1 -1
  526. package/src/sany/selectors.ts +11 -6
  527. package/src/sany/xml.ts +2 -3
  528. package/src/search.ts +209 -56
  529. package/src/simulate.ts +3 -0
  530. package/src/spec-description.ts +2 -2
  531. package/src/standard-definitions.ts +4 -0
  532. package/src/state-graph.ts +0 -2
  533. package/src/subexpressions.ts +265 -94
  534. package/src/successors.ts +2 -1
  535. package/src/symmetry.ts +3 -3
  536. package/src/tableau.ts +2 -2
  537. package/src/tlc/fingerprint.ts +81 -9
  538. package/src/tlc/jar-data.ts +10 -0
  539. package/src/tlc/messages.ts +3 -3
  540. package/src/tlc/order.ts +14 -3
  541. package/src/tlc/summary.ts +29 -14
  542. package/src/tlc/tlc-operators.ts +3 -1
  543. package/src/tlc/tlcext-operators.ts +61 -16
  544. package/src/tlc/trace-spec.ts +5 -5
  545. package/src/typed-tier.ts +6541 -0
  546. package/src/typescript/types.ts +2 -2
  547. package/src/values.ts +46 -27
  548. package/src/prover/isabelle/isar/statement.ts +0 -52
  549. package/src/prover/smt/solver/z3-license.txt +0 -10
  550. package/src/prover/tlaps-module.ts +0 -510
  551. package/src/prover/zenon/LICENSE +0 -32
@@ -16,6 +16,8 @@ import {
16
16
  type Typ,
17
17
  } from "../pure/term";
18
18
  import { typargsOf, type TypargPosition } from "../pure/consts";
19
+ import type { NamedCasesRule } from "../isar/induct";
20
+ import type { Tags } from "../isar/rule-cases";
19
21
  import { LOGIC_DATA } from "./logic-data";
20
22
 
21
23
  type TypeNode = [0, number, ...number[]] | [1, number] | [2, number, number];
@@ -29,6 +31,7 @@ type TermNode =
29
31
  type NetItem = [number, 0 | 1, number];
30
32
  type ExtraNetItem = [number, number, 0 | 1, number];
31
33
  type RawRule = [number, number, number[], number, number[]];
34
+ type RawCasesRule = [string, number, [string, string][]];
32
35
 
33
36
  interface LogicJson {
34
37
  strings: string[];
@@ -52,8 +55,15 @@ interface LogicJson {
52
55
  safep: [NetItem[], NetItem[]];
53
56
  unsafe: [NetItem[], NetItem[]];
54
57
  dup: [NetItem[], NetItem[]];
58
+ extra: [ExtraNetItem[], ExtraNetItem[]];
55
59
  };
56
- contextRules: { bang: [ExtraNetItem[], ExtraNetItem[]]; plain: [ExtraNetItem[], ExtraNetItem[]] };
60
+ contextRules: {
61
+ bang: [ExtraNetItem[], ExtraNetItem[]];
62
+ plain: [ExtraNetItem[], ExtraNetItem[]];
63
+ query: [number[], number[]];
64
+ };
65
+ factTags: [string, number, [string, string][]][];
66
+ casesRules: { type: RawCasesRule[]; pred: RawCasesRule[] };
57
67
  }
58
68
 
59
69
  export interface ConstInfo {
@@ -89,10 +99,19 @@ export interface TlaLogic {
89
99
  readonly safep: LogicNetPair<TaggedRule>;
90
100
  readonly unsafe: LogicNetPair<TaggedRule>;
91
101
  readonly dup: LogicNetPair<TaggedRule>;
102
+ readonly extra: LogicNetPair<ContextRule>;
92
103
  };
93
104
  readonly contextRules: {
94
105
  readonly bang: LogicNetPair<ContextRule>;
95
106
  readonly plain: LogicNetPair<ContextRule>;
107
+ readonly query: LogicNetPair<ContextRule>;
108
+ };
109
+ // The Rule_Cases tags of the facts that have them, by name and position.
110
+ readonly factTags: ReadonlyMap<string, ReadonlyMap<number, Tags>>;
111
+ // Induct's cases rules for types and for predicates or sets, newest first.
112
+ readonly casesRules: {
113
+ readonly type: readonly NamedCasesRule[];
114
+ readonly pred: readonly NamedCasesRule[];
96
115
  };
97
116
  }
98
117
 
@@ -157,6 +176,19 @@ const parseLogic = (): TlaLogic => {
157
176
  );
158
177
  return { intro, elim };
159
178
  };
179
+ // Isabelle hides the weights of the rules declared with "?", so their order stands in for their
180
+ // tags, which is all their unweighted retrieval reads.
181
+ const toOrderedItems = (pair: [number[], number[]]): LogicNetPair<ContextRule> => {
182
+ const [intro, elim] = pair.map((side, isElim) =>
183
+ side.map((id, tag) => ({ weight: 0, tag, isElim: isElim === 1, rule: thms[id] })),
184
+ );
185
+ return { intro, elim };
186
+ };
187
+ const toCasesRules = (rules: RawCasesRule[]) =>
188
+ rules.map((entry) => ({ name: entry[0], rule: { rule: thms[entry[1]], tags: entry[2] } }));
189
+ const factTags = new Map<string, Map<number, Tags>>();
190
+ for (const entry of data.factTags)
191
+ factTags.set(entry[0], new Map([...(factTags.get(entry[0]) ?? []), [entry[1], entry[2]]]));
160
192
  return {
161
193
  consts: new Map(
162
194
  data.consts.map((entry) => [
@@ -184,10 +216,17 @@ const parseLogic = (): TlaLogic => {
184
216
  safep: toItems(data.claset.safep),
185
217
  unsafe: toItems(data.claset.unsafe),
186
218
  dup: toItems(data.claset.dup),
219
+ extra: toExtraItems(data.claset.extra),
187
220
  },
188
221
  contextRules: {
189
222
  bang: toExtraItems(data.contextRules.bang),
190
223
  plain: toExtraItems(data.contextRules.plain),
224
+ query: toOrderedItems(data.contextRules.query),
225
+ },
226
+ factTags,
227
+ casesRules: {
228
+ type: toCasesRules(data.casesRules.type),
229
+ pred: toCasesRules(data.casesRules.pred),
191
230
  },
192
231
  };
193
232
  };
@@ -1,5 +1,3 @@
1
- // Ported from Isabelle/TLA+'s simplifier_setup.ML and PredicateLogic.thy, BSD licensed, see LICENSE.
2
-
3
1
  import { TlaIsabelleError } from "../../../errors";
4
2
  import { genAll, reflexiveThm } from "../pure/drule";
5
3
  import { emptyNet, insertTermNet, type Net } from "../pure/net";
@@ -1,7 +1,6 @@
1
- // Ported from Isabelle2025's Tools/intuitionistic.ML and Pure/Isar/context_rules.ML. Copyright (c) 1986-2025 University of Cambridge, Technische Universitaet Muenchen, and contributors, see LICENSE.
2
-
3
1
  import { remdupsRl } from "../pure/drule";
4
2
  import { selectGoal } from "../pure/goal";
3
+ import { unifyTermNet } from "../pure/net";
5
4
  import { deepen } from "../pure/search";
6
5
  import { stripAssumsConcl, stripAssumsHyp } from "../pure/logic";
7
6
  import type { Limits } from "../pure/interrupt";
@@ -45,20 +44,37 @@ interface Visited {
45
44
  readonly concl: Term;
46
45
  }
47
46
 
48
- const orderRules = (rules: ContextRule[]): BiresRule[] => {
47
+ // orderlist_no_weight sorts by tag alone.
48
+ const orderContextRules = (rules: readonly ContextRule[], isWeighted: boolean) => {
49
49
  const sorted = [...rules].sort(
50
- (left, right) => left.weight - right.weight || left.tag - right.tag,
50
+ (left, right) => (isWeighted ? left.weight - right.weight : 0) || left.tag - right.tag,
51
+ );
52
+ return sorted.filter(
53
+ (rule, index) =>
54
+ index + 1 >= sorted.length ||
55
+ sorted[index + 1].weight !== rule.weight ||
56
+ sorted[index + 1].tag !== rule.tag,
51
57
  );
52
- return sorted
53
- .filter(
54
- (rule, index) =>
55
- index + 1 >= sorted.length ||
56
- sorted[index + 1].weight !== rule.weight ||
57
- sorted[index + 1].tag !== rule.tag,
58
- )
59
- .map((rule) => ({ isElim: rule.isElim, rule: rule.rule }));
60
58
  };
61
59
 
60
+ const orderRules = (rules: ContextRule[]): BiresRule[] =>
61
+ orderContextRules(rules, true).map((rule) => ({ isElim: rule.isElim, rule: rule.rule }));
62
+
63
+ // Context_Rules.find_rules_netpair: the elimination rules for the first fact, then the
64
+ // introduction rules for the goal.
65
+ export const findRulesNetpair = (
66
+ isWeighted: boolean,
67
+ facts: readonly Thm[],
68
+ goal: Term,
69
+ netpair: NetPair<ContextRule>,
70
+ ): Thm[] =>
71
+ [
72
+ ...(facts.length === 0
73
+ ? []
74
+ : orderContextRules(unifyTermNet(netpair.elim, stripAssumsConcl(facts[0].prop)), isWeighted)),
75
+ ...orderContextRules(unifyTermNet(netpair.intro, stripAssumsConcl(goal)), isWeighted),
76
+ ].map((rule) => rule.rule);
77
+
62
78
  const countDistinct = (terms: readonly Term[]) =>
63
79
  terms.reduce<Term[]>(
64
80
  (result, term) => (result.some((other) => aconv(other, term)) ? result : [...result, term]),
@@ -1,10 +1,13 @@
1
- type OcamlValue = number | string | OcamlValue[];
1
+ // A bigint is an OCaml int beyond what a number holds exactly.
2
+ type OcamlValue = number | bigint | string | OcamlValue[];
2
3
 
3
4
  export const compareStrings = (left: string, right: string) =>
4
5
  left < right ? -1 : left > right ? 1 : 0;
5
6
 
6
7
  export const compareValues = (left: OcamlValue, right: OcamlValue): number => {
7
8
  if (typeof left === "number" && typeof right === "number") return left - right;
9
+ if (typeof left === "bigint" && typeof right === "bigint")
10
+ return left < right ? -1 : left > right ? 1 : 0;
8
11
  if (typeof left === "string" && typeof right === "string") return compareStrings(left, right);
9
12
  if (!Array.isArray(left) || !Array.isArray(right)) return 0;
10
13
  const index = left.findIndex(
@@ -426,28 +426,33 @@ const coalesceModal: Rewrite = (scope, expression) => {
426
426
  const hypScope = getScopeAt(scope, operator.index - 1);
427
427
  const hyp = hypScope?.hyp;
428
428
  if (!hyp) throw new TlapmBugError();
429
+ const applyCoalesced = (applied: Expr) =>
430
+ at(
431
+ { kind: "Apply", operator: applied, args: args.map((inner) => coalesceModal(scope, inner)) },
432
+ expression,
433
+ );
429
434
  if (hyp.kind === "Defn" && hyp.definition.kind === "Operator") {
430
435
  const substitutive = getSubstitutiveArgs(hypScope.rest, hyp.definition);
431
436
  const isKept = args.every(
432
437
  (inner, position) => getLevel(scope, inner) === 0 || substitutive[args.length - position - 1],
433
438
  );
434
439
  if (isKept) return mapScoped(scope, expression, coalesceModal, adjoin);
435
- const opaque = coalesceOperator(scope, hyp.definition.name, substitutive, operator, args);
436
- return at(
437
- { kind: "Apply", operator: opaque, args: args.map((inner) => coalesceModal(scope, inner)) },
438
- expression,
440
+ return applyCoalesced(
441
+ coalesceOperator(scope, hyp.definition.name, substitutive, operator, args),
439
442
  );
440
443
  }
441
444
  if (hyp.kind === "Flex") return mapScoped(scope, expression, coalesceModal, adjoin);
442
445
  if (hyp.kind === "Fresh") {
443
- if (hyp.level === "Constant") {
444
- return at(
445
- { kind: "Apply", operator, args: args.map((inner) => coalesceModal(scope, inner)) },
446
- expression,
447
- );
448
- }
449
- const notSubstitutive = args.map(() => false);
450
- return coalesceOperator(scope, hyp.name, notSubstitutive, operator, args);
446
+ if (hyp.level === "Constant") return applyCoalesced(operator);
447
+ return applyCoalesced(
448
+ coalesceOperator(
449
+ scope,
450
+ hyp.name,
451
+ args.map(() => false),
452
+ operator,
453
+ args,
454
+ ),
455
+ );
451
456
  }
452
457
  throw new TlapmBugError();
453
458
  };
@@ -461,6 +466,8 @@ const commuteSequent = createSequentMap(commuteSymbols, "all");
461
466
  const coalesceSequent = createSequentMap(coalesceModal, "visible");
462
467
 
463
468
  export const processObligation = (sequent: Sequent): Sequent => {
469
+ // Levels.compute_level, whose levels the passes below read on demand: only its errors matter.
470
+ getLevelInfo(undefined, { kind: "Sequent", sequent });
464
471
  const keys = sequent.context;
465
472
  const expanded = expandUnchangedSequent(keys, expandActionSequent(keys, sequent));
466
473
  const commuted = commuteSequent(keys, expanded);
@@ -6,10 +6,13 @@ import {
6
6
  adjoinAll,
7
7
  getScopeAt,
8
8
  mapScoped,
9
+ getAtPrefix,
9
10
  type Builtin,
10
11
  type Expr,
12
+ type Locus,
11
13
  type Scope,
12
14
  type Sequent,
15
+ type Warn,
13
16
  } from "../../obligations/expression";
14
17
  import { getLevelInfo } from "../../obligations/levels";
15
18
 
@@ -129,7 +132,12 @@ const getRule = (scope: Scope | undefined, goal: Expr): Rule | undefined => {
129
132
  return implication && { name: "implies", left: implication[0], right: implication[1] };
130
133
  };
131
134
 
132
- export const implicationToEnabled = (sequent: Sequent): Sequent => {
135
+ // When no rule applies, tlapm records the obligation as not tried.
136
+ export const implicationToEnabled = (
137
+ sequent: Sequent,
138
+ locus: Locus | undefined,
139
+ onWarning: Warn,
140
+ ): Sequent => {
133
141
  const goalScope = adjoinAll(undefined, sequent.context);
134
142
  const rule = getRule(goalScope, sequent.active);
135
143
  let isPremise = false;
@@ -175,8 +183,9 @@ export const implicationToEnabled = (sequent: Sequent): Sequent => {
175
183
  isPremise = true;
176
184
  }
177
185
  });
178
- if (!isPremise || !isLeftBoolean || !isRightBoolean) {
186
+ if (!rule || !isPremise || !isLeftBoolean || !isRightBoolean) {
179
187
  throw new TlaProverError("ENABLEDaxioms proof directive did not succeed.\n");
180
188
  }
189
+ onWarning({ text: `${getAtPrefix(locus)}[INFO]\nProved ${rule.name}\n`, channel: "stdout" });
181
190
  return { ...sequent, active: TRUE };
182
191
  };
@@ -20,35 +20,32 @@ export const getMd5 = (text: string): string => {
20
20
  const words = Array.from({ length: 16 }, (_value, index) =>
21
21
  view.getUint32(offset + index * 4, true),
22
22
  );
23
- const mixedState = Array.from({ length: 64 }).reduce<number[]>(
24
- ([innerA, innerB, innerC, innerD], _value, index) => {
25
- const round = Math.floor(index / 16);
26
- const mixed =
27
- round === 0
28
- ? (innerB & innerC) | (~innerB & innerD)
29
- : round === 1
30
- ? (innerD & innerB) | (~innerD & innerC)
31
- : round === 2
32
- ? innerB ^ innerC ^ innerD
33
- : innerC ^ (innerB | ~innerD);
34
- const word =
35
- round === 0
36
- ? index
37
- : round === 1
38
- ? (5 * index + 1) % 16
39
- : round === 2
40
- ? (3 * index + 5) % 16
41
- : (7 * index) % 16;
42
- const sum = (innerA + mixed + CONSTANTS[index] + words[word]) | 0;
43
- return [
44
- innerD,
45
- (innerB + rotate(sum, SHIFTS[round * 4 + (index % 4)])) | 0,
46
- innerB,
47
- innerC,
48
- ];
49
- },
50
- state,
51
- );
23
+ const mixedState = Array.from({ length: 64 }).reduce<number[]>((state, _value, index) => {
24
+ const round = Math.floor(index / 16);
25
+ const mixed =
26
+ round === 0
27
+ ? (state[1] & state[2]) | (~state[1] & state[3])
28
+ : round === 1
29
+ ? (state[3] & state[1]) | (~state[3] & state[2])
30
+ : round === 2
31
+ ? state[1] ^ state[2] ^ state[3]
32
+ : state[2] ^ (state[1] | ~state[3]);
33
+ const word =
34
+ round === 0
35
+ ? index
36
+ : round === 1
37
+ ? (5 * index + 1) % 16
38
+ : round === 2
39
+ ? (3 * index + 5) % 16
40
+ : (7 * index) % 16;
41
+ const sum = (state[0] + mixed + CONSTANTS[index] + words[word]) | 0;
42
+ return [
43
+ state[3],
44
+ (state[1] + rotate(sum, SHIFTS[round * 4 + (index % 4)])) | 0,
45
+ state[1],
46
+ state[2],
47
+ ];
48
+ }, state);
52
49
  state.splice(0, 4, ...state.map((word, index) => (word + mixedState[index]) | 0));
53
50
  }
54
51
  return state
@@ -1,4 +1,4 @@
1
- import { TlapmBugError, TlaProverError } from "../../errors";
1
+ import { TlaMethodError, TlapmBugError, TlaProverError } from "../../errors";
2
2
  import type { Expr, Locus, Sequent } from "../../obligations/expression";
3
3
  import type { OldMethod, PragmaSetting } from "../../obligations/pragma";
4
4
  import type { Backend } from "../verdict";
@@ -6,7 +6,7 @@ import type { Backend } from "../verdict";
6
6
  type Prover =
7
7
  | Backend
8
8
  | "yices"
9
- | "cvc3"
9
+ | "cvc4"
10
10
  | "cooper"
11
11
  | "fail"
12
12
  | "verit"
@@ -30,7 +30,7 @@ export interface Method {
30
30
 
31
31
  export const getBudget = (method: Method) => method.rlimit ?? method.timeLimitMs / 1000;
32
32
 
33
- const FRONTENDS = new Set<Prover>([
33
+ export const FRONTENDS = new Set<Prover>([
34
34
  "expandenabled",
35
35
  "expandcdot",
36
36
  "autouse",
@@ -60,14 +60,14 @@ const PROVERS: Record<string, { prover: Prover; seconds: number; isBudgeted?: bo
60
60
  ls4: { prover: "ls4", seconds: LS4_SECONDS },
61
61
  z3: { prover: "z3", seconds: SMT_SECONDS, isBudgeted: true },
62
62
  smt: { prover: "smt", seconds: SMT_SECONDS, isBudgeted: true },
63
- cvc3: { prover: "cvc3", seconds: SMT_SECONDS },
64
- cooper: { prover: "cooper", seconds: 0 },
65
- fail: { prover: "fail", seconds: 0 },
63
+ cvc3: { prover: "cvc4", seconds: SMT_SECONDS },
64
+ cooper: { prover: "cooper", seconds: Infinity },
65
+ fail: { prover: "fail", seconds: Infinity },
66
66
  smt2lib: { prover: "smt", seconds: SMT_SECONDS, isBudgeted: true },
67
67
  smt2z3: { prover: "z3", seconds: SMT_SECONDS, isBudgeted: true },
68
68
  smt3: { prover: "smt", seconds: SMT_SECONDS, isBudgeted: true },
69
69
  z33: { prover: "z3", seconds: SMT_SECONDS, isBudgeted: true },
70
- cvc33: { prover: "cvc3", seconds: SMT_SECONDS },
70
+ cvc33: { prover: "cvc4", seconds: SMT_SECONDS },
71
71
  yices3: { prover: "yices", seconds: SMT_SECONDS },
72
72
  verit: { prover: "verit", seconds: SMT_SECONDS },
73
73
  zipper: { prover: "zipper", seconds: 30 },
@@ -77,77 +77,152 @@ const PROVERS: Record<string, { prover: Prover; seconds: number; isBudgeted?: bo
77
77
  ...Object.fromEntries([...FRONTENDS].map((name) => [name, { prover: name, seconds: 0 }])),
78
78
  };
79
79
 
80
+ const UNTIMED_PROVERS = new Set<Prover>(["cooper", "fail", "trivial", ...FRONTENDS]);
81
+
80
82
  const getProverMethod = (
81
83
  name: string,
82
84
  timeout: number | undefined,
83
85
  rlimit: number | undefined,
84
86
  tactic: string | undefined,
85
87
  ): Method => {
86
- const known = PROVERS[name];
88
+ const known = Object.hasOwn(PROVERS, name) ? PROVERS[name] : undefined;
87
89
  if (!known) throw new TlaProverError(`Unknown prover: ${name}`);
88
- if (rlimit !== undefined && !known.isBudgeted)
89
- throw new TlaProverError(
90
- 'A Z3 rlimit budget ("rN") is only supported by the SMT and Z3 backends.',
91
- );
92
90
  return {
93
91
  prover: known.prover,
94
- timeLimitMs: rlimit === undefined ? (timeout ?? known.seconds) * 1000 : Infinity,
92
+ timeLimitMs:
93
+ rlimit !== undefined
94
+ ? Infinity
95
+ : ((UNTIMED_PROVERS.has(known.prover) ? undefined : timeout) ?? known.seconds) * 1000,
95
96
  ...(rlimit !== undefined && { rlimit }),
96
97
  ...(known.prover === "isabelle" && { tactic: tactic ?? "auto" }),
97
98
  };
98
99
  };
99
100
 
100
- const getRlimit = (budget: string) => {
101
- const count = Number.parseFloat(budget.slice(1));
102
- if (!/^[rR]./.test(budget) || !Number.isFinite(count) || count <= 0)
103
- throw new TlaProverError(`Invalid SMT budget "${budget}"`);
101
+ const BUDGET_FORMS =
102
+ 'a number of seconds (wall-clock timeout), or a deterministic Z3 rlimit budget of the form "rN" (e.g. "r5")';
103
+
104
+ const HEX_FLOAT =
105
+ /^[\t-\r ]*[+-]?0x(?=\.?[\da-f])([\da-f]*)\.?([\da-f]*)(?:p([\t-\r ]*[+-]?\d+))?$/i;
106
+ const DECIMAL_FLOAT = /^[\t-\r ]*[+-]?(?:\d+\.?\d*|\.\d+)(?:e[+-]?\d+)?$/i;
107
+ const SPECIAL_FLOAT = /^[\t-\r ]*[+-]?(?:(inf(?:inity)?)|nan(?:\([^)]*\))?)$/i;
108
+
109
+ // OCaml's float_of_string_opt: caml_float_of_string drops underscores, then reads a C99 float.
110
+ export const parseOcamlFloat = (text: string) => {
111
+ const digits = text.replaceAll("_", "");
112
+ const sign = digits.trimStart().startsWith("-") ? -1 : 1;
113
+ const hex = HEX_FLOAT.exec(digits);
114
+ if (hex) {
115
+ const mantissa = Number(BigInt(`0x${hex[1]}${hex[2]}`));
116
+ return mantissa === 0 ? 0 : sign * mantissa * 2 ** (Number(hex[3] ?? 0) - 4 * hex[2].length);
117
+ }
118
+ const special = SPECIAL_FLOAT.exec(digits);
119
+ if (special) return special[1] === undefined ? NaN : sign * Infinity;
120
+ return DECIMAL_FLOAT.test(digits) ? Number(digits) : undefined;
121
+ };
122
+
123
+ const OCAML_INT =
124
+ /^([+-]?)(?:0x([\da-f][\da-f_]*)|0o([0-7][0-7_]*)|0b([01][01_]*)|(0u)?(\d[\d_]*))$/i;
125
+
126
+ // OCaml's int_of_string_opt: only an unprefixed decimal is range-checked as a signed 63-bit integer.
127
+ export const parseOcamlInt = (text: string) => {
128
+ const match = OCAML_INT.exec(text);
129
+ if (!match) return undefined;
130
+ const isNegative = match[1] === "-";
131
+ const prefixed =
132
+ match[2] === undefined
133
+ ? match[3] === undefined
134
+ ? match[4] === undefined
135
+ ? match[6]
136
+ : `0b${match[4]}`
137
+ : `0o${match[3]}`
138
+ : `0x${match[2]}`;
139
+ const magnitude = BigInt(prefixed.replaceAll("_", ""));
140
+ const isSigned = prefixed === match[6] && match[5] === undefined;
141
+ if (magnitude > (isSigned ? 2n ** 62n - (isNegative ? 0n : 1n) : 2n ** 63n - 1n))
142
+ return undefined;
143
+ return Number(BigInt.asIntN(63, isNegative ? -magnitude : magnitude));
144
+ };
145
+
146
+ const getRlimit = (budget: string, locus: Locus | undefined) => {
147
+ const count = parseOcamlFloat(budget.slice(1));
148
+ if (!/^[rR]./s.test(budget) || count === undefined || !Number.isFinite(count) || count <= 0)
149
+ throw new TlaMethodError(
150
+ `Invalid SMT budget ${JSON.stringify(budget)}: expected ${BUDGET_FORMS}.`,
151
+ locus,
152
+ );
104
153
  return Math.max(1, Math.trunc(Math.min(count * RLIMIT_BASE, MAX_RLIMIT)));
105
154
  };
106
155
 
107
- const computeMethod = (settings: PragmaSetting[], args: Expr[]): Method => {
108
- const values = settings.reduce<{
109
- args: Expr[];
110
- prover?: string;
111
- timeout?: number;
112
- rlimit?: number;
113
- tactic?: string;
114
- }>(
156
+ interface MethodValues {
157
+ args: Expr[];
158
+ prover?: string;
159
+ proverLocus?: Locus;
160
+ timeout?: number;
161
+ rlimit?: number;
162
+ tactic?: string;
163
+ }
164
+
165
+ // Each @ takes the next argument the pragma is applied to at the use.
166
+ const computeMethod = (settings: PragmaSetting[], args: Expr[], use: Locus | undefined): Method => {
167
+ const values = settings.reduce<MethodValues>(
115
168
  (state, setting) => {
116
169
  const value = setting.value;
117
170
  const argument = value.kind === "Default" ? state.args[0] : undefined;
118
171
  const rest = value.kind === "Default" ? state.args.slice(1) : state.args;
172
+ if (setting.hint !== "prover" && setting.hint !== "tactic" && setting.hint !== "timeout")
173
+ throw new TlaMethodError(
174
+ `Unknown keyword in proof method definition: ${setting.hint}`,
175
+ setting.location,
176
+ );
119
177
  if (value.kind === "Default" && !argument)
120
- throw new TlaProverError("Some arguments are missing");
121
- const text =
122
- value.kind === "String"
123
- ? value.value
124
- : argument?.kind === "String"
125
- ? argument.value
126
- : undefined;
127
- switch (setting.hint) {
128
- case "prover":
129
- case "tactic":
130
- if (text === undefined) throw new TlaProverError(`This argument should be a string`);
131
- return { ...state, args: rest, [setting.hint]: text };
132
- case "timeout": {
133
- if (value.kind === "Float") return { ...state, args: rest, timeout: value.value };
134
- if (text !== undefined) return { ...state, args: rest, rlimit: getRlimit(text) };
135
- if (argument?.kind !== "Num")
136
- throw new TlaProverError("This argument should be a number of seconds");
178
+ throw new TlaMethodError("Some arguments are missing", use);
179
+ if (setting.hint === "timeout") {
180
+ if (value.kind === "Float") return { ...state, timeout: value.value };
181
+ if (value.kind === "String")
182
+ return { ...state, rlimit: getRlimit(value.value, setting.location) };
183
+ if (argument?.kind === "Num")
137
184
  return {
138
185
  ...state,
139
186
  args: rest,
140
187
  timeout: Number(`${argument.integer}.${argument.fraction}`),
141
188
  };
142
- }
143
- default:
144
- throw new TlaProverError(`Unknown keyword in proof method definition: ${setting.hint}`);
189
+ if (argument?.kind === "String")
190
+ return { ...state, args: rest, rlimit: getRlimit(argument.value, argument.location) };
191
+ throw new TlaMethodError(`This argument should be ${BUDGET_FORMS}`, argument?.location);
145
192
  }
193
+ if (value.kind === "Float")
194
+ throw new TlaMethodError("Argument should be a string or @", setting.location);
195
+ const text =
196
+ value.kind === "String"
197
+ ? value.value
198
+ : argument?.kind === "String"
199
+ ? argument.value
200
+ : undefined;
201
+ if (text === undefined)
202
+ throw new TlaMethodError(
203
+ `This argument should be a string (${setting.hint === "prover" ? "prover name" : "proof tactic"})`,
204
+ argument?.location,
205
+ );
206
+ if (setting.hint === "tactic") return { ...state, args: rest, tactic: text };
207
+ return {
208
+ ...state,
209
+ args: rest,
210
+ prover: text,
211
+ proverLocus: value.kind === "Default" ? use : setting.location,
212
+ };
146
213
  },
147
214
  { args },
148
215
  );
149
- if (values.args.length > 0) throw new TlaProverError("Too many arguments");
150
- if (values.prover === undefined) throw new TlaProverError("Missing prover name");
216
+ if (values.args.length > 0) throw new TlaMethodError("Too many arguments", use);
217
+ if (values.prover === undefined)
218
+ throw new TlaMethodError("Missing prover name", settings[0].location);
219
+ const known = Object.hasOwn(PROVERS, values.prover) ? PROVERS[values.prover] : undefined;
220
+ if (!known) throw new TlaMethodError(`Unknown prover: ${values.prover}`, values.proverLocus);
221
+ if (values.rlimit !== undefined && !known.isBudgeted)
222
+ throw new TlaMethodError(
223
+ 'A Z3 rlimit budget ("rN") is only supported by the SMT and Z3 backends.',
224
+ use,
225
+ );
151
226
  return getProverMethod(values.prover, values.timeout, values.rlimit, values.tactic);
152
227
  };
153
228
 
@@ -190,7 +265,7 @@ const getCitedMethods = (sequent: Sequent) => {
190
265
  useLocation = hyp.useLocation;
191
266
  }
192
267
  const args = expression.kind === "Apply" ? expression.args : [];
193
- methods.push(...entry.groups.map((group) => computeMethod(group, args)));
268
+ methods.push(...entry.groups.map((group) => computeMethod(group, args, expression.location)));
194
269
  return;
195
270
  }
196
271
  if (entry?.kind !== "Meth") return;
@@ -200,7 +275,10 @@ const getCitedMethods = (sequent: Sequent) => {
200
275
  return methods;
201
276
  };
202
277
 
203
- export const findMethods = (obligation: { sequent: Sequent; method?: OldMethod }) => {
278
+ export const findMethods = (
279
+ obligation: { sequent: Sequent; method?: OldMethod },
280
+ defaultMethods = DEFAULT_METHODS,
281
+ ) => {
204
282
  const methods =
205
283
  obligation.method === undefined
206
284
  ? getCitedMethods(obligation.sequent)
@@ -210,6 +288,37 @@ export const findMethods = (obligation: { sequent: Sequent; method?: OldMethod }
210
288
  frontends: new Set(
211
289
  methods.flatMap((method) => (FRONTENDS.has(method.prover) ? [method.prover] : [])),
212
290
  ),
213
- provers: provers.length > 0 ? provers : DEFAULT_METHODS,
291
+ provers: provers.length > 0 ? provers : defaultMethods,
214
292
  };
215
293
  };
294
+
295
+ const DEFAULT_METHOD_NAMES: Record<string, string> = {
296
+ zenon: "zenon",
297
+ smt: "smt",
298
+ z3: "z3",
299
+ cvc4: "cvc33",
300
+ yices: "yices3",
301
+ verit: "verit",
302
+ zipper: "zipper",
303
+ spass: "spass",
304
+ tptp: "tptp",
305
+ ls4: "ls4",
306
+ };
307
+
308
+ export const parseDefaultMethods = (text: string) =>
309
+ text.split(",").map((entry): Method => {
310
+ const separator = entry.indexOf(":");
311
+ const name = separator === -1 ? entry : entry.slice(0, separator);
312
+ const seconds = separator === -1 ? undefined : Number.parseFloat(entry.slice(separator + 1));
313
+ if (Number.isNaN(seconds))
314
+ throw new TlaProverError("--method: bad timeout specification: not a number");
315
+ if (name === "auto" || name === "blast" || name === "force")
316
+ return getProverMethod("isabelle", seconds, undefined, name);
317
+ if (name === "fail") return { prover: "fail", timeLimitMs: Infinity };
318
+ const known = Object.hasOwn(DEFAULT_METHOD_NAMES, name)
319
+ ? DEFAULT_METHOD_NAMES[name]
320
+ : undefined;
321
+ if (known === undefined)
322
+ throw new TlaProverError(`--method: unknown method ${JSON.stringify(name)}`);
323
+ return getProverMethod(known, seconds, undefined, undefined);
324
+ });