tla-ts 0.0.10-dev.63a6693bd → 0.0.10-dev.68b2c4968

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 (542) 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 +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 +44 -43
  18. package/dist/tlapm.cjs +1 -1
  19. package/dist/tlapm.js +1 -1
  20. package/dist/transfer.cjs +44 -41
  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 +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/codegen.ts +6 -2
  36. package/src/dependencies.ts +72 -11
  37. package/src/dfid.ts +9 -2
  38. package/src/environment.ts +27 -5
  39. package/src/errors.ts +38 -3
  40. package/src/evaluate.ts +92 -32
  41. package/src/exit-codes.ts +5 -2
  42. package/src/instances.ts +1 -1
  43. package/src/levels.ts +134 -86
  44. package/src/lexer.ts +5 -3
  45. package/src/liveness-checker.ts +572 -204
  46. package/src/liveness.ts +47 -32
  47. package/src/obligations/action.ts +10 -6
  48. package/src/obligations/anonymize.ts +33 -14
  49. package/src/obligations/enabled-axioms.ts +218 -0
  50. package/src/obligations/equality.ts +1 -3
  51. package/src/obligations/expression.ts +18 -6
  52. package/src/obligations/format.ts +0 -2
  53. package/src/obligations/generate.ts +22 -17
  54. package/src/obligations/index.ts +36 -6
  55. package/src/obligations/levels.ts +24 -11
  56. package/src/obligations/module.ts +1 -3
  57. package/src/obligations/normalize.ts +24 -13
  58. package/src/obligations/operators.ts +0 -2
  59. package/src/obligations/pragma.ts +53 -16
  60. package/src/obligations/printer.ts +43 -13
  61. package/src/obligations/proof.ts +3 -2
  62. package/src/obligations/regroup.ts +0 -2
  63. package/src/obligations/simplify.ts +17 -7
  64. package/src/obligations/source.ts +71 -17
  65. package/src/obligations/subexpression.ts +45 -18
  66. package/src/obligations/substitution.ts +1 -3
  67. package/src/obligations/temporal.ts +0 -2
  68. package/src/obligations/tuples.ts +0 -2
  69. package/src/parallel-worker.ts +8 -2
  70. package/src/parallel.ts +7 -2
  71. package/src/parser.ts +634 -186
  72. package/src/pretty-print.ts +1 -1
  73. package/src/prover/deciders.ts +11 -8
  74. package/src/prover/isabelle/decide.ts +3 -25
  75. package/src/prover/isabelle/encode.ts +71 -41
  76. package/src/prover/isabelle/isar/attrib.ts +250 -0
  77. package/src/prover/isabelle/isar/context.ts +335 -0
  78. package/src/prover/isabelle/isar/induct.ts +382 -0
  79. package/src/prover/isabelle/isar/inner-syntax.ts +149 -3
  80. package/src/prover/isabelle/isar/method.ts +506 -198
  81. package/src/prover/isabelle/isar/proof.ts +570 -14
  82. package/src/prover/isabelle/isar/rule-cases.ts +226 -0
  83. package/src/prover/isabelle/isar/theory.ts +479 -69
  84. package/src/prover/isabelle/isar/toplevel.ts +331 -0
  85. package/src/prover/isabelle/isar/type-check.ts +83 -8
  86. package/src/prover/isabelle/provers/blast/blast.ts +0 -2
  87. package/src/prover/isabelle/provers/blast/branch.ts +0 -2
  88. package/src/prover/isabelle/provers/blast/prove.ts +0 -2
  89. package/src/prover/isabelle/provers/blast/rules.ts +0 -2
  90. package/src/prover/isabelle/provers/blast/state.ts +0 -2
  91. package/src/prover/isabelle/provers/blast/term.ts +0 -2
  92. package/src/prover/isabelle/provers/clasimp.ts +1 -3
  93. package/src/prover/isabelle/provers/classical.ts +45 -20
  94. package/src/prover/isabelle/provers/hypsubst.ts +2 -4
  95. package/src/prover/isabelle/pure/bicompose.ts +0 -2
  96. package/src/prover/isabelle/pure/consts.ts +0 -2
  97. package/src/prover/isabelle/pure/conv.ts +0 -2
  98. package/src/prover/isabelle/pure/drule.ts +63 -4
  99. package/src/prover/isabelle/pure/envir.ts +0 -2
  100. package/src/prover/isabelle/pure/goal.ts +1 -3
  101. package/src/prover/isabelle/pure/logic.ts +0 -2
  102. package/src/prover/isabelle/pure/name.ts +0 -2
  103. package/src/prover/isabelle/pure/net.ts +0 -2
  104. package/src/prover/isabelle/pure/object-logic.ts +13 -7
  105. package/src/prover/isabelle/pure/pattern.ts +0 -2
  106. package/src/prover/isabelle/pure/raw-simplifier.ts +0 -2
  107. package/src/prover/isabelle/pure/rewriter.ts +1 -8
  108. package/src/prover/isabelle/pure/search.ts +0 -2
  109. package/src/prover/isabelle/pure/seq.ts +0 -2
  110. package/src/prover/isabelle/pure/simplifier.ts +26 -7
  111. package/src/prover/isabelle/pure/table.ts +0 -2
  112. package/src/prover/isabelle/pure/tactic.ts +0 -2
  113. package/src/prover/isabelle/pure/tactical.ts +0 -2
  114. package/src/prover/isabelle/pure/term-ord.ts +0 -2
  115. package/src/prover/isabelle/pure/term.ts +0 -2
  116. package/src/prover/isabelle/pure/thm.ts +0 -2
  117. package/src/prover/isabelle/pure/type.ts +0 -2
  118. package/src/prover/isabelle/pure/unify.ts +0 -2
  119. package/src/prover/isabelle/pure/variable.ts +0 -2
  120. package/src/prover/isabelle/tla/classical-setup.ts +1 -2
  121. package/src/prover/isabelle/tla/context.ts +51 -9
  122. package/src/prover/isabelle/tla/logic-data.ts +1 -1
  123. package/src/prover/isabelle/tla/logic.ts +40 -1
  124. package/src/prover/isabelle/tla/simpdata.ts +0 -2
  125. package/src/prover/isabelle/tools/intuitionistic.ts +28 -12
  126. package/src/prover/ocaml.ts +4 -1
  127. package/src/prover/prep/action.ts +19 -12
  128. package/src/prover/prep/enabled-axioms.ts +11 -2
  129. package/src/prover/prep/methods.ts +159 -50
  130. package/src/prover/prep/normalize.ts +38 -9
  131. package/src/prover/prove.ts +343 -65
  132. package/src/prover/ptl/decide.ts +95 -50
  133. package/src/prover/ptl/encode.ts +2 -3
  134. package/src/prover/ptl/tableau.ts +28 -2
  135. package/src/prover/smt/arithmetic.ts +310 -0
  136. package/src/prover/smt/axioms.ts +12 -8
  137. package/src/prover/smt/context.ts +42 -6
  138. package/src/prover/smt/data.ts +191 -84
  139. package/src/prover/smt/encode.ts +122 -43
  140. package/src/prover/smt/extensionality.ts +5 -3
  141. package/src/prover/smt/flatten.ts +4 -6
  142. package/src/prover/smt/format.ts +28 -4
  143. package/src/prover/smt/instances.ts +7 -1
  144. package/src/prover/smt/layout.ts +91 -0
  145. package/src/prover/smt/rewrite.ts +483 -116
  146. package/src/prover/smt/simplify.ts +441 -0
  147. package/src/prover/smt/solver/ackermannize-bv-tactic.ts +61 -0
  148. package/src/prover/smt/solver/ackr-helper.ts +179 -0
  149. package/src/prover/smt/solver/ackr-model-converter.ts +105 -0
  150. package/src/prover/smt/solver/act-cache.ts +0 -1
  151. package/src/prover/smt/solver/add-bounds-tactic.ts +59 -0
  152. package/src/prover/smt/solver/aig-tactic.ts +52 -0
  153. package/src/prover/smt/solver/aig.ts +889 -0
  154. package/src/prover/smt/solver/arith-rewriter.ts +613 -6
  155. package/src/prover/smt/solver/arith-terms.ts +121 -0
  156. package/src/prover/smt/solver/array-decl-plugin.ts +175 -0
  157. package/src/prover/smt/solver/array-rewriter.ts +309 -0
  158. package/src/prover/smt/solver/asserted-formulas.ts +93 -15
  159. package/src/prover/smt/solver/ast-lt.ts +165 -11
  160. package/src/prover/smt/solver/ast-util.ts +160 -2
  161. package/src/prover/smt/solver/ast.ts +1449 -41
  162. package/src/prover/smt/solver/auf-solver.ts +0 -1
  163. package/src/prover/smt/solver/bit-blast-tactic.ts +582 -0
  164. package/src/prover/smt/solver/bit-blaster.ts +871 -0
  165. package/src/prover/smt/solver/bound-manager.ts +196 -0
  166. package/src/prover/smt/solver/bound-simplifier.ts +600 -0
  167. package/src/prover/smt/solver/bv-bound-chk.ts +492 -0
  168. package/src/prover/smt/solver/bv-decl-plugin.ts +341 -0
  169. package/src/prover/smt/solver/bv-divrem-bounds.ts +95 -0
  170. package/src/prover/smt/solver/bv-rewriter.ts +1901 -0
  171. package/src/prover/smt/solver/bv1-blast.ts +214 -0
  172. package/src/prover/smt/solver/bv2fpa-converter.ts +174 -0
  173. package/src/prover/smt/solver/bv2int-rewriter.ts +544 -0
  174. package/src/prover/smt/solver/bv2real-rewriter.ts +533 -0
  175. package/src/prover/smt/solver/card2bv.ts +109 -0
  176. package/src/prover/smt/solver/case-split-queue.ts +0 -2
  177. package/src/prover/smt/solver/cg-table.ts +39 -25
  178. package/src/prover/smt/solver/check-logic.ts +330 -0
  179. package/src/prover/smt/solver/clause.ts +0 -1
  180. package/src/prover/smt/solver/cofactor-elim-term-ite.ts +278 -0
  181. package/src/prover/smt/solver/conflict-resolution.ts +78 -2
  182. package/src/prover/smt/solver/context.ts +533 -114
  183. package/src/prover/smt/solver/ctx-simplify.ts +21 -12
  184. package/src/prover/smt/solver/ctx-solver-simplify.ts +122 -0
  185. package/src/prover/smt/solver/datatype-decl-plugin.ts +572 -0
  186. package/src/prover/smt/solver/datatype-rewriter.ts +82 -0
  187. package/src/prover/smt/solver/demodulator.ts +786 -0
  188. package/src/prover/smt/solver/dependent-expr-state.ts +81 -0
  189. package/src/prover/smt/solver/der.ts +38 -10
  190. package/src/prover/smt/solver/diff-neq.ts +205 -0
  191. package/src/prover/smt/solver/distribute-forall.ts +57 -0
  192. package/src/prover/smt/solver/dom-simplify.ts +511 -0
  193. package/src/prover/smt/solver/dt2bv-tactic.ts +260 -0
  194. package/src/prover/smt/solver/dyn-ack.ts +0 -1
  195. package/src/prover/smt/solver/e-matching.ts +6 -7
  196. package/src/prover/smt/solver/elim-small-bv-tactic.ts +129 -0
  197. package/src/prover/smt/solver/elim-uncnstr.ts +542 -0
  198. package/src/prover/smt/solver/enode.ts +100 -3
  199. package/src/prover/smt/solver/eq2bv-tactic.ts +218 -0
  200. package/src/prover/smt/solver/euf/arith-axioms.ts +403 -0
  201. package/src/prover/smt/solver/euf/arith-internalize.ts +653 -0
  202. package/src/prover/smt/solver/euf/arith-solver.ts +889 -0
  203. package/src/prover/smt/solver/euf/array-axioms.ts +527 -0
  204. package/src/prover/smt/solver/euf/array-internalize.ts +428 -0
  205. package/src/prover/smt/solver/euf/array-solver.ts +306 -0
  206. package/src/prover/smt/solver/euf/bv-ackerman.ts +162 -0
  207. package/src/prover/smt/solver/euf/bv-internalize.ts +748 -0
  208. package/src/prover/smt/solver/euf/bv-solver.ts +449 -0
  209. package/src/prover/smt/solver/euf/dt-solver.ts +618 -0
  210. package/src/prover/smt/solver/euf/egraph.ts +901 -0
  211. package/src/prover/smt/solver/euf/euf-solver.ts +1204 -0
  212. package/src/prover/smt/solver/euf/fpa-solver.ts +317 -0
  213. package/src/prover/smt/solver/euf/mam.ts +1046 -0
  214. package/src/prover/smt/solver/euf/q-ematch.ts +829 -0
  215. package/src/prover/smt/solver/euf/q-mbi.ts +587 -0
  216. package/src/prover/smt/solver/euf/q-model-fixer.ts +296 -0
  217. package/src/prover/smt/solver/euf/q-solver.ts +361 -0
  218. package/src/prover/smt/solver/euf/th-solver.ts +328 -0
  219. package/src/prover/smt/solver/euf/th-solvers.ts +30 -0
  220. package/src/prover/smt/solver/expr-ref.ts +0 -1
  221. package/src/prover/smt/solver/expr-safe-replace.ts +26 -2
  222. package/src/prover/smt/solver/expr2polynomial.ts +271 -0
  223. package/src/prover/smt/solver/factor.ts +163 -0
  224. package/src/prover/smt/solver/fd-solver.ts +267 -0
  225. package/src/prover/smt/solver/fingerprints.ts +15 -15
  226. package/src/prover/smt/solver/fix-dl-var.ts +147 -0
  227. package/src/prover/smt/solver/flat-literals.ts +0 -1
  228. package/src/prover/smt/solver/fm-tactic.ts +884 -0
  229. package/src/prover/smt/solver/fpa-decl-plugin.ts +618 -0
  230. package/src/prover/smt/solver/fpa-rewriter.ts +639 -0
  231. package/src/prover/smt/solver/fpa2bv-converter.ts +2251 -0
  232. package/src/prover/smt/solver/fpa2bv-rewriter.ts +349 -0
  233. package/src/prover/smt/solver/fpa2bv-tactic.ts +73 -0
  234. package/src/prover/smt/solver/goal.ts +177 -15
  235. package/src/prover/smt/solver/goal2nlsat.ts +216 -0
  236. package/src/prover/smt/solver/guard-set.ts +219 -0
  237. package/src/prover/smt/solver/hash.ts +0 -1
  238. package/src/prover/smt/solver/hashtable.ts +30 -16
  239. package/src/prover/smt/solver/inf-eps.ts +63 -0
  240. package/src/prover/smt/solver/inj-axiom.ts +101 -0
  241. package/src/prover/smt/solver/internalizer.ts +109 -36
  242. package/src/prover/smt/solver/lackr.ts +381 -0
  243. package/src/prover/smt/solver/lbool.ts +0 -1
  244. package/src/prover/smt/solver/lia2card.ts +268 -0
  245. package/src/prover/smt/solver/lia2pb.ts +154 -0
  246. package/src/prover/smt/solver/literal.ts +0 -1
  247. package/src/prover/smt/solver/logic-tactics.ts +345 -0
  248. package/src/prover/smt/solver/lp/bound-propagator.ts +0 -1
  249. package/src/prover/smt/solver/lp/constraints.ts +0 -1
  250. package/src/prover/smt/solver/lp/containers.ts +7 -2
  251. package/src/prover/smt/solver/lp/core-solver.ts +18 -3
  252. package/src/prover/smt/solver/lp/cross-nested.ts +1 -4
  253. package/src/prover/smt/solver/lp/dep-intervals.ts +0 -3
  254. package/src/prover/smt/solver/lp/dependency.ts +0 -2
  255. package/src/prover/smt/solver/lp/dioph-eq.ts +0 -2
  256. package/src/prover/smt/solver/lp/explanation.ts +0 -1
  257. package/src/prover/smt/solver/lp/gomory.ts +0 -1
  258. package/src/prover/smt/solver/lp/hnf-cutter.ts +0 -1
  259. package/src/prover/smt/solver/lp/hnf.ts +0 -3
  260. package/src/prover/smt/solver/lp/int-cube.ts +3 -4
  261. package/src/prover/smt/solver/lp/int-solver.ts +0 -2
  262. package/src/prover/smt/solver/lp/lar-solver.ts +40 -4
  263. package/src/prover/smt/solver/lp/lar-term.ts +0 -1
  264. package/src/prover/smt/solver/lp/lp-settings.ts +0 -1
  265. package/src/prover/smt/solver/lp/maximize-term.ts +59 -10
  266. package/src/prover/smt/solver/lp/nex-creator.ts +3 -3
  267. package/src/prover/smt/solver/lp/nex.ts +2 -2
  268. package/src/prover/smt/solver/lp/nla-backoff.ts +0 -2
  269. package/src/prover/smt/solver/lp/nla-basics.ts +46 -3
  270. package/src/prover/smt/solver/lp/nla-core.ts +66 -11
  271. package/src/prover/smt/solver/lp/nla-divisions.ts +0 -2
  272. package/src/prover/smt/solver/lp/nla-emonics.ts +0 -1
  273. package/src/prover/smt/solver/lp/nla-factorization.ts +0 -1
  274. package/src/prover/smt/solver/lp/nla-grobner.ts +167 -85
  275. package/src/prover/smt/solver/lp/nla-horner.ts +0 -2
  276. package/src/prover/smt/solver/lp/nla-intervals.ts +0 -1
  277. package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +0 -2
  278. package/src/prover/smt/solver/lp/nla-monotone.ts +0 -1
  279. package/src/prover/smt/solver/lp/nla-order.ts +0 -2
  280. package/src/prover/smt/solver/lp/nla-patcher.ts +0 -1
  281. package/src/prover/smt/solver/lp/nla-powers.ts +220 -0
  282. package/src/prover/smt/solver/lp/nla-tangents.ts +0 -2
  283. package/src/prover/smt/solver/lp/nla-throttle.ts +0 -1
  284. package/src/prover/smt/solver/lp/nla-transcendentals.ts +324 -0
  285. package/src/prover/smt/solver/lp/nla-types.ts +0 -2
  286. package/src/prover/smt/solver/lp/nla-var-eqs.ts +0 -1
  287. package/src/prover/smt/solver/lp/nra-solver.ts +163 -99
  288. package/src/prover/smt/solver/lp/numeric-pair.ts +0 -1
  289. package/src/prover/smt/solver/lp/pdd-interval.ts +6 -3
  290. package/src/prover/smt/solver/lp/pdd-simplifier.ts +60 -21
  291. package/src/prover/smt/solver/lp/pdd-solver.ts +72 -41
  292. package/src/prover/smt/solver/lp/pdd.ts +725 -290
  293. package/src/prover/smt/solver/lp/random-updater.ts +0 -2
  294. package/src/prover/smt/solver/lp/static-matrix.ts +0 -1
  295. package/src/prover/smt/solver/lp/union-find.ts +7 -2
  296. package/src/prover/smt/solver/macro-finder.ts +530 -0
  297. package/src/prover/smt/solver/mam-compiler.ts +118 -88
  298. package/src/prover/smt/solver/mam-interpreter.ts +0 -1
  299. package/src/prover/smt/solver/max-bv-sharing-tactic.ts +17 -0
  300. package/src/prover/smt/solver/max-cliques.ts +105 -0
  301. package/src/prover/smt/solver/maxcore.ts +309 -0
  302. package/src/prover/smt/solver/maximize-ac-sharing.ts +8 -6
  303. package/src/prover/smt/solver/maxlex.ts +115 -0
  304. package/src/prover/smt/solver/maxsmt-base.ts +105 -0
  305. package/src/prover/smt/solver/maxsmt.ts +92 -0
  306. package/src/prover/smt/solver/mbp/mbp-arith.ts +467 -0
  307. package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +101 -0
  308. package/src/prover/smt/solver/mbp/mbp-plugin.ts +287 -0
  309. package/src/prover/smt/solver/mbp/mbp-qel.ts +48 -0
  310. package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +271 -0
  311. package/src/prover/smt/solver/mbp/mbp-term-graph.ts +606 -0
  312. package/src/prover/smt/solver/model-based-opt.ts +844 -0
  313. package/src/prover/smt/solver/model-checker.ts +17 -26
  314. package/src/prover/smt/solver/model-evaluator.ts +188 -12
  315. package/src/prover/smt/solver/model-finder.ts +0 -1
  316. package/src/prover/smt/solver/model-generator.ts +59 -30
  317. package/src/prover/smt/solver/model-macro-solver.ts +38 -27
  318. package/src/prover/smt/solver/model-printer.ts +214 -0
  319. package/src/prover/smt/solver/mpf.ts +709 -0
  320. package/src/prover/smt/solver/mus.ts +50 -0
  321. package/src/prover/smt/solver/muz/dl-context.ts +410 -0
  322. package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +97 -0
  323. package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +167 -0
  324. package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +125 -0
  325. package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +299 -0
  326. package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +455 -0
  327. package/src/prover/smt/solver/muz/dl-mk-slice.ts +340 -0
  328. package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +163 -0
  329. package/src/prover/smt/solver/muz/dl-rule-set.ts +273 -0
  330. package/src/prover/smt/solver/muz/dl-rule-transformer.ts +123 -0
  331. package/src/prover/smt/solver/muz/dl-rule.ts +496 -0
  332. package/src/prover/smt/solver/muz/hnf.ts +201 -0
  333. package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +176 -0
  334. package/src/prover/smt/solver/muz/horn-tactic.ts +201 -0
  335. package/src/prover/smt/solver/muz/rule-properties.ts +337 -0
  336. package/src/prover/smt/solver/muz/spacer-context.ts +1404 -0
  337. package/src/prover/smt/solver/muz/spacer-dl-interface.ts +52 -0
  338. package/src/prover/smt/solver/muz/spacer-generalizers.ts +241 -0
  339. package/src/prover/smt/solver/muz/spacer-manager.ts +127 -0
  340. package/src/prover/smt/solver/muz/spacer-pdr.ts +219 -0
  341. package/src/prover/smt/solver/muz/spacer-prop-solver.ts +333 -0
  342. package/src/prover/smt/solver/muz/spacer-util.ts +282 -0
  343. package/src/prover/smt/solver/muz/substitution.ts +203 -0
  344. package/src/prover/smt/solver/nla2bv-tactic.ts +285 -0
  345. package/src/prover/smt/solver/nlqsat.ts +484 -0
  346. package/src/prover/smt/solver/nlsat/algebraic.ts +305 -88
  347. package/src/prover/smt/solver/nlsat/atoms.ts +52 -35
  348. package/src/prover/smt/solver/nlsat/evaluator.ts +0 -1
  349. package/src/prover/smt/solver/nlsat/explain.ts +424 -211
  350. package/src/prover/smt/solver/nlsat/interval-set.ts +1 -2
  351. package/src/prover/smt/solver/nlsat/levelwise.ts +460 -241
  352. package/src/prover/smt/solver/nlsat/mpbq.ts +45 -1
  353. package/src/prover/smt/solver/nlsat/polynomial.ts +2366 -683
  354. package/src/prover/smt/solver/nlsat/solver.ts +282 -69
  355. package/src/prover/smt/solver/nlsat/transcendental-eval.ts +310 -0
  356. package/src/prover/smt/solver/nlsat/transcendentals.ts +391 -0
  357. package/src/prover/smt/solver/nlsat/types.ts +0 -2
  358. package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +8 -7
  359. package/src/prover/smt/solver/nlsat/upolynomial.ts +41 -20
  360. package/src/prover/smt/solver/nlsat-tactic.ts +82 -0
  361. package/src/prover/smt/solver/nnf.ts +105 -23
  362. package/src/prover/smt/solver/normalize-bounds.ts +53 -0
  363. package/src/prover/smt/solver/occf.ts +97 -0
  364. package/src/prover/smt/solver/opt-context.ts +792 -0
  365. package/src/prover/smt/solver/opt-nlsat.ts +386 -0
  366. package/src/prover/smt/solver/opt-pareto.ts +282 -0
  367. package/src/prover/smt/solver/opt-preprocess.ts +101 -0
  368. package/src/prover/smt/solver/opt-solver.ts +311 -0
  369. package/src/prover/smt/solver/opt-value.ts +55 -0
  370. package/src/prover/smt/solver/optsmt.ts +692 -0
  371. package/src/prover/smt/solver/parallel-tactic.ts +299 -0
  372. package/src/prover/smt/solver/pattern-inference.ts +19 -11
  373. package/src/prover/smt/solver/pb-rewriter.ts +281 -0
  374. package/src/prover/smt/solver/pb2bv-tactic.ts +540 -0
  375. package/src/prover/smt/solver/poly-rewriter.ts +202 -57
  376. package/src/prover/smt/solver/probes.ts +511 -0
  377. package/src/prover/smt/solver/propagate-values.ts +37 -21
  378. package/src/prover/smt/solver/proto-model.ts +650 -17
  379. package/src/prover/smt/solver/pull-quant.ts +28 -12
  380. package/src/prover/smt/solver/purify-arith.ts +632 -0
  381. package/src/prover/smt/solver/qe-arith-plugin.ts +1096 -0
  382. package/src/prover/smt/solver/qe-lite-der.ts +2 -3
  383. package/src/prover/smt/solver/qe-lite-fm.ts +3 -4
  384. package/src/prover/smt/solver/qe-lite.ts +37 -17
  385. package/src/prover/smt/solver/qe-mbp.ts +270 -0
  386. package/src/prover/smt/solver/qe.ts +1499 -0
  387. package/src/prover/smt/solver/qel.ts +25 -0
  388. package/src/prover/smt/solver/qi-queue.ts +0 -1
  389. package/src/prover/smt/solver/qsat.ts +814 -0
  390. package/src/prover/smt/solver/quant-hoist.ts +196 -0
  391. package/src/prover/smt/solver/quant-tactics.ts +16 -56
  392. package/src/prover/smt/solver/quantifier-analyzer.ts +9 -10
  393. package/src/prover/smt/solver/quantifier-manager.ts +25 -24
  394. package/src/prover/smt/solver/quasi-macros.ts +243 -0
  395. package/src/prover/smt/solver/random-gen.ts +0 -1
  396. package/src/prover/smt/solver/rational.ts +45 -1
  397. package/src/prover/smt/solver/recfun-decl-plugin.ts +262 -0
  398. package/src/prover/smt/solver/recfun-rewriter.ts +107 -0
  399. package/src/prover/smt/solver/reduce-args.ts +225 -0
  400. package/src/prover/smt/solver/reduce-bv-size.ts +119 -0
  401. package/src/prover/smt/solver/ref-vector.ts +0 -1
  402. package/src/prover/smt/solver/relevancy.ts +1 -2
  403. package/src/prover/smt/solver/rewriter-tpl.ts +77 -10
  404. package/src/prover/smt/solver/rewriter.ts +475 -36
  405. package/src/prover/smt/solver/rlimit.ts +38 -2
  406. package/src/prover/smt/solver/sat/asymm-branch.ts +325 -0
  407. package/src/prover/smt/solver/sat/big.ts +177 -0
  408. package/src/prover/smt/solver/sat/clause-use-list.ts +71 -0
  409. package/src/prover/smt/solver/sat/clause.ts +203 -0
  410. package/src/prover/smt/solver/sat/cleaner.ts +94 -0
  411. package/src/prover/smt/solver/sat/config.ts +122 -0
  412. package/src/prover/smt/solver/sat/consequences.ts +203 -0
  413. package/src/prover/smt/solver/sat/elim-eqs.ts +142 -0
  414. package/src/prover/smt/solver/sat/goal2sat.ts +526 -0
  415. package/src/prover/smt/solver/sat/inc-sat-solver.ts +378 -0
  416. package/src/prover/smt/solver/sat/model-converter.ts +136 -0
  417. package/src/prover/smt/solver/sat/pb-constraint.ts +261 -0
  418. package/src/prover/smt/solver/sat/pb-solver.ts +1577 -0
  419. package/src/prover/smt/solver/sat/probing.ts +170 -0
  420. package/src/prover/smt/solver/sat/sat-tactic.ts +44 -0
  421. package/src/prover/smt/solver/sat/sat2goal.ts +165 -0
  422. package/src/prover/smt/solver/sat/scc.ts +142 -0
  423. package/src/prover/smt/solver/sat/simplifier.ts +1618 -0
  424. package/src/prover/smt/solver/sat/solver.ts +2105 -0
  425. package/src/prover/smt/solver/sat/var-queue.ts +117 -0
  426. package/src/prover/smt/solver/sat/watch-list.ts +140 -0
  427. package/src/prover/smt/solver/search-tree.ts +284 -0
  428. package/src/prover/smt/solver/seq-axioms.ts +995 -0
  429. package/src/prover/smt/solver/seq-decl-plugin.ts +819 -0
  430. package/src/prover/smt/solver/seq-derive.ts +1298 -0
  431. package/src/prover/smt/solver/seq-eq-approx.ts +236 -0
  432. package/src/prover/smt/solver/seq-eq-solver.ts +439 -0
  433. package/src/prover/smt/solver/seq-factory.ts +89 -0
  434. package/src/prover/smt/solver/seq-monadic.ts +730 -0
  435. package/src/prover/smt/solver/seq-range-predicate.ts +235 -0
  436. package/src/prover/smt/solver/seq-re-rewriter.ts +1171 -0
  437. package/src/prover/smt/solver/seq-re-util.ts +758 -0
  438. package/src/prover/smt/solver/seq-regex-bisim.ts +144 -0
  439. package/src/prover/smt/solver/seq-regex-live.ts +200 -0
  440. package/src/prover/smt/solver/seq-rewriter.ts +2404 -0
  441. package/src/prover/smt/solver/seq-skolem.ts +294 -0
  442. package/src/prover/smt/solver/seq-subset.ts +165 -0
  443. package/src/prover/smt/solver/seq-view-witness.ts +353 -0
  444. package/src/prover/smt/solver/smt-consequences.ts +297 -0
  445. package/src/prover/smt/solver/smt-kernel.ts +90 -0
  446. package/src/prover/smt/solver/smt-logics.ts +66 -0
  447. package/src/prover/smt/solver/smt-setup.ts +544 -0
  448. package/src/prover/smt/solver/smt2-printer.ts +765 -0
  449. package/src/prover/smt/solver/smtlib-parser.ts +3228 -327
  450. package/src/prover/smt/solver/smtlib-script.ts +1843 -0
  451. package/src/prover/smt/solver/solve-eqs.ts +923 -0
  452. package/src/prover/smt/solver/solver.ts +113 -22
  453. package/src/prover/smt/solver/static-features.ts +314 -0
  454. package/src/prover/smt/solver/sticky-generations.ts +0 -1
  455. package/src/prover/smt/solver/tactic.ts +2012 -0
  456. package/src/prover/smt/solver/term-enumeration.ts +205 -0
  457. package/src/prover/smt/solver/theory-array.ts +1240 -0
  458. package/src/prover/smt/solver/theory-bv.ts +1200 -0
  459. package/src/prover/smt/solver/theory-char.ts +355 -0
  460. package/src/prover/smt/solver/theory-datatype.ts +598 -0
  461. package/src/prover/smt/solver/theory-finite-set.ts +30 -0
  462. package/src/prover/smt/solver/theory-fpa.ts +389 -0
  463. package/src/prover/smt/solver/theory-lra-axioms.ts +53 -2
  464. package/src/prover/smt/solver/theory-lra-bounds.ts +31 -5
  465. package/src/prover/smt/solver/theory-lra-final-check.ts +56 -71
  466. package/src/prover/smt/solver/theory-lra-internalize.ts +89 -11
  467. package/src/prover/smt/solver/theory-lra-model.ts +20 -35
  468. package/src/prover/smt/solver/theory-lra-propagate.ts +24 -28
  469. package/src/prover/smt/solver/theory-lra-state.ts +6 -22
  470. package/src/prover/smt/solver/theory-lra.ts +188 -2
  471. package/src/prover/smt/solver/theory-pb.ts +933 -0
  472. package/src/prover/smt/solver/theory-polymorphism.ts +58 -0
  473. package/src/prover/smt/solver/theory-recfun.ts +307 -0
  474. package/src/prover/smt/solver/theory-seq-regex.ts +867 -0
  475. package/src/prover/smt/solver/theory-seq-solve.ts +1373 -0
  476. package/src/prover/smt/solver/theory-seq-state.ts +852 -0
  477. package/src/prover/smt/solver/theory-seq.ts +961 -0
  478. package/src/prover/smt/solver/theory.ts +189 -0
  479. package/src/prover/smt/solver/tseitin-cnf.ts +485 -0
  480. package/src/prover/smt/solver/var-subst.ts +36 -14
  481. package/src/prover/smt/table.ts +3 -2
  482. package/src/prover/smt/types.ts +146 -0
  483. package/src/prover/tlapm/cache.ts +29 -8
  484. package/src/prover/tlapm-library.ts +3208 -0
  485. package/src/prover/verdict.ts +2 -0
  486. package/src/prover/zenon/decide.ts +10 -7
  487. package/src/prover/zenon/encode.ts +0 -2
  488. package/src/prover/zenon/eqrel.ts +0 -2
  489. package/src/prover/zenon/equality-rules.ts +24 -2
  490. package/src/prover/zenon/expr.ts +21 -2
  491. package/src/prover/zenon/index-table.ts +7 -4
  492. package/src/prover/zenon/isar-case.ts +1 -3
  493. package/src/prover/zenon/isar.ts +2 -4
  494. package/src/prover/zenon/llproof.ts +0 -2
  495. package/src/prover/zenon/mltoll.ts +0 -2
  496. package/src/prover/zenon/node.ts +20 -5
  497. package/src/prover/zenon/parse.ts +6 -2
  498. package/src/prover/zenon/phrase.ts +1 -3
  499. package/src/prover/zenon/proof.ts +0 -2
  500. package/src/prover/zenon/propositional-rules.ts +0 -2
  501. package/src/prover/zenon/rules.ts +2 -3
  502. package/src/prover/zenon/search.ts +7 -5
  503. package/src/prover/zenon/tla/functions.ts +0 -2
  504. package/src/prover/zenon/tla/llproof.ts +0 -2
  505. package/src/prover/zenon/tla/records.ts +0 -2
  506. package/src/prover/zenon/tla/rewrites.ts +0 -2
  507. package/src/prover/zenon/tla/sets.ts +7 -8
  508. package/src/prover/zenon/tla/terms.ts +0 -2
  509. package/src/prover/zenon/tla/tla.ts +0 -2
  510. package/src/resolve.ts +264 -77
  511. package/src/runtime.ts +6 -0
  512. package/src/sany/generation.ts +1 -13
  513. package/src/sany/generator-definitions.ts +2 -1
  514. package/src/sany/generator-expressions.ts +30 -27
  515. package/src/sany/generator-proofs.ts +1 -1
  516. package/src/sany/generator.ts +2 -1
  517. package/src/sany/levels.ts +0 -2
  518. package/src/sany/linter.ts +0 -2
  519. package/src/sany/nodes.ts +1 -1
  520. package/src/sany/selectors.ts +6 -5
  521. package/src/search.ts +209 -56
  522. package/src/simulate.ts +3 -0
  523. package/src/spec-description.ts +2 -2
  524. package/src/standard-definitions.ts +4 -0
  525. package/src/state-graph.ts +0 -2
  526. package/src/subexpressions.ts +165 -78
  527. package/src/successors.ts +2 -1
  528. package/src/symmetry.ts +2 -2
  529. package/src/tableau.ts +2 -2
  530. package/src/tlc/fingerprint.ts +81 -9
  531. package/src/tlc/jar-data.ts +12 -0
  532. package/src/tlc/order.ts +14 -3
  533. package/src/tlc/summary.ts +29 -14
  534. package/src/tlc/tlcext-operators.ts +61 -16
  535. package/src/tlc/trace-spec.ts +2 -3
  536. package/src/typed-tier.ts +6541 -0
  537. package/src/typescript/types.ts +2 -2
  538. package/src/values.ts +42 -23
  539. package/src/prover/isabelle/isar/statement.ts +0 -52
  540. package/src/prover/smt/solver/z3-license.txt +0 -10
  541. package/src/prover/tlaps-module.ts +0 -510
  542. package/src/prover/zenon/LICENSE +0 -32
@@ -1,63 +1,108 @@
1
- import { TlaSyntaxError } from "../../errors";
2
1
  import type { DecideOptions, Verdict } from "../verdict";
3
- import { getSatisfiability, type PtlFormula } from "./tableau";
2
+ import { getSatisfiability, type BinaryKind, type PtlFormula } from "./tableau";
4
3
 
5
- const parseLs4 = (text: string): PtlFormula => {
6
- const tokens = text.match(/<->|->|[()~&|]|[\w']+|\S/g) ?? [];
4
+ // ptl_to_trp's binary operators, from the loosest.
5
+ const BINARY_LEVELS = [
6
+ new Map<string, BinaryKind>([["until", "Until"]]),
7
+ new Map<string, BinaryKind>([["unless", "Unless"]]),
8
+ new Map<string, BinaryKind>([
9
+ ["<=>", "Equiv"],
10
+ ["<->", "Equiv"],
11
+ ]),
12
+ new Map<string, BinaryKind>([["|", "Or"]]),
13
+ new Map<string, BinaryKind>([
14
+ ["=>", "Implies"],
15
+ ["->", "Implies"],
16
+ ]),
17
+ new Map<string, BinaryKind>([["&", "And"]]),
18
+ ];
19
+
20
+ const PREFIX_OPERATORS = new Map<string, "Not" | "Always" | "Eventually" | "Next" | "Past">([
21
+ ["~", "Not"],
22
+ ["not", "Not"],
23
+ ["always", "Always"],
24
+ ["sometime", "Eventually"],
25
+ ["next", "Next"],
26
+ ["alwaysp", "Past"],
27
+ ["sometimep", "Past"],
28
+ ]);
29
+
30
+ const KEYWORDS = new Set([
31
+ ...PREFIX_OPERATORS.keys(),
32
+ ...BINARY_LEVELS.flatMap((operators) => [...operators.keys()]),
33
+ "True",
34
+ "False",
35
+ ]);
36
+
37
+ const RESERVED = /^(skolem|hidden|constant|NV_V\w*|NVV\w*)$/;
38
+
39
+ const MAX_LS4_IDENTIFIER = 31;
40
+
41
+ // ptl_to_trp and LS4 reach no verdict on text that this reads as undefined.
42
+ const parseLs4 = (text: string): PtlFormula | undefined => {
43
+ const tokens = text.replace(/;.*/g, "").match(/<=>|<->|=>|->|[A-Za-z]\w*|\S/g) ?? [];
7
44
  let position = 0;
8
- const take = (expected?: string) => {
9
- const token = tokens[position++];
10
- if (token === undefined || (expected !== undefined && token !== expected))
11
- throw new TlaSyntaxError(
12
- `Expected ${expected ?? "a formula"} in LS4 input, found ${token ?? "the end"}`,
13
- );
14
- return token;
15
- };
16
- const parseUnary = (): PtlFormula => {
17
- const token = take();
18
- if (token === "(") {
19
- const inner = parseEquiv();
20
- take(")");
21
- return inner;
45
+ const isIdentifier = (token: string | undefined): token is string =>
46
+ token !== undefined && /^[A-Za-z]/.test(token) && !KEYWORDS.has(token) && !RESERVED.test(token);
47
+ const takeList = () => {
48
+ const items: string[] = [];
49
+ for (;;) {
50
+ const token = tokens[position++];
51
+ if (!isIdentifier(token)) return undefined;
52
+ items.push(token);
53
+ if (tokens[position] !== ",") return items;
54
+ position += 1;
22
55
  }
23
- if (token === "~" || token === "not") return { kind: "Not", body: parseUnary() };
24
- if (token === "always") return { kind: "Always", body: parseUnary() };
25
- if (token === "sometime") return { kind: "Eventually", body: parseUnary() };
26
- if (token === "next") return { kind: "Next", body: parseUnary() };
27
- if (!/^[\w']+$/.test(token))
28
- throw new TlaSyntaxError(`Expected a formula in LS4 input, found ${token}`);
29
- return { kind: "Atom", name: token };
30
56
  };
31
- const parseJunction = (operator: string, kind: "And" | "Or", parseOperand: () => PtlFormula) => {
32
- const operands = [parseOperand()];
33
- while (tokens[position] === operator) {
34
- take();
35
- operands.push(parseOperand());
57
+ const parsePrefix = (): PtlFormula | undefined => {
58
+ const token = tokens[position++];
59
+ if (token === undefined) return undefined;
60
+ const prefix = PREFIX_OPERATORS.get(token);
61
+ if (prefix !== undefined) {
62
+ const body = parsePrefix();
63
+ // ptl_to_trp does not translate the past operators.
64
+ return body === undefined || prefix === "Past" ? undefined : { kind: prefix, body };
36
65
  }
37
- return operands.reduce((left, right) => ({ kind, left, right }));
38
- };
39
- const parseImplies = (): PtlFormula => {
40
- const left = parseJunction("|", "Or", () => parseJunction("&", "And", parseUnary));
41
- if (tokens[position] !== "->") return left;
42
- take();
43
- return { kind: "Implies", left, right: parseImplies() };
66
+ if (token === "!" || token === "?") {
67
+ if (tokens[position++] !== "[") return undefined;
68
+ const variables = takeList();
69
+ // foyacc.mly checks only that the last variable of the list is uppercase.
70
+ return variables !== undefined &&
71
+ /^[A-Z]/.test(variables[variables.length - 1]) &&
72
+ tokens[position++] === "]"
73
+ ? parsePrefix()
74
+ : undefined;
75
+ }
76
+ if (token === "(") {
77
+ const inner = parseBinary(0);
78
+ return tokens[position++] === ")" ? inner : undefined;
79
+ }
80
+ if (token === "True" || token === "False") return { kind: "Constant", value: token === "True" };
81
+ // LS4 reads no predicate with arguments and no identifier longer than 31 characters.
82
+ return isIdentifier(token) && tokens[position] !== "(" && token.length <= MAX_LS4_IDENTIFIER
83
+ ? { kind: "Atom", name: token }
84
+ : undefined;
44
85
  };
45
- const parseEquiv = (): PtlFormula => {
46
- const left = parseImplies();
47
- if (tokens[position] !== "<->") return left;
48
- take();
49
- return { kind: "Equiv", left, right: parseEquiv() };
86
+ const parseOperators = (level: number, left: PtlFormula | undefined): PtlFormula | undefined => {
87
+ const kind = BINARY_LEVELS[level].get(tokens[position] ?? "");
88
+ if (left === undefined || kind === undefined) return left;
89
+ position += 1;
90
+ const right = parseBinary(level + 1);
91
+ return right === undefined ? undefined : parseOperators(level, { kind, left, right });
50
92
  };
51
- const formula = parseEquiv();
52
- if (position < tokens.length)
53
- throw new TlaSyntaxError(`Expected the end of LS4 input, found ${tokens[position]}`);
54
- return formula;
93
+ const parseBinary = (level: number): PtlFormula | undefined =>
94
+ level === BINARY_LEVELS.length ? parsePrefix() : parseOperators(level, parseBinary(level + 1));
95
+ const formula = parseBinary(0);
96
+ return position < tokens.length ? undefined : formula;
55
97
  };
56
98
 
57
99
  export const decidePtl = (text: string, options: DecideOptions): Verdict => {
58
100
  const deadline = performance.now() + options.timeLimitMs;
59
- return getSatisfiability(
60
- parseLs4(text),
61
- () => options.signal?.aborted === true || performance.now() > deadline,
62
- );
101
+ const formula = parseLs4(text);
102
+ return formula === undefined
103
+ ? "unknown"
104
+ : getSatisfiability(
105
+ formula,
106
+ () => options.signal?.aborted === true || performance.now() > deadline,
107
+ );
63
108
  };
@@ -101,7 +101,7 @@ const prepareHyps = (scope: Scope | undefined, expression: Expr): Expr => {
101
101
  };
102
102
  for (const original of expression.sequent.context) {
103
103
  const hyp = substituteHyp(substitution, original);
104
- if (hyp.kind !== "Fresh" || !hyp.domain || original.kind !== "Fresh" || !original.domain) {
104
+ if (hyp.kind !== "Fresh" || !hyp.domain) {
105
105
  push(
106
106
  hyp.kind === "Fact" ? { ...hyp, expression: prepareHyps(innerScope, hyp.expression) } : hyp,
107
107
  );
@@ -110,7 +110,6 @@ const prepareHyps = (scope: Scope | undefined, expression: Expr): Expr => {
110
110
  }
111
111
  const domain = prepareHyps(innerScope, hyp.domain);
112
112
  push({ ...hyp, domain: undefined });
113
- // tlapm judges the time of the domain as written, one hypothesis too deep.
114
113
  push({
115
114
  kind: "Fact",
116
115
  expression: applyBuiltin(
@@ -119,7 +118,7 @@ const prepareHyps = (scope: Scope | undefined, expression: Expr): Expr => {
119
118
  domain,
120
119
  ),
121
120
  visibility: hyp.domainVisibility,
122
- time: hyp.level === "Constant" ? getTime(innerScope, original.domain) : "Now",
121
+ time: hyp.level === "Constant" ? getTime(innerScope, shiftExpr(1, domain)) : "Now",
123
122
  location: hyp.location,
124
123
  });
125
124
  substitution = {
@@ -1,16 +1,20 @@
1
1
  import type { Verdict } from "../verdict";
2
2
  import { createSolver } from "./sat";
3
3
 
4
+ export type BinaryKind = "And" | "Or" | "Implies" | "Equiv" | "Until" | "Unless";
5
+
4
6
  export type PtlFormula =
5
7
  | { kind: "Atom"; name: string }
8
+ | { kind: "Constant"; value: boolean }
6
9
  | { kind: "Not" | "Next" | "Always" | "Eventually"; body: PtlFormula }
7
- | { kind: "And" | "Or" | "Implies" | "Equiv"; left: PtlFormula; right: PtlFormula };
10
+ | { kind: BinaryKind; left: PtlFormula; right: PtlFormula };
8
11
 
9
12
  type Normal =
10
13
  | { kind: "Constant"; value: boolean }
11
14
  | { kind: "Literal"; atom: string; isPositive: boolean }
12
15
  | { kind: "And" | "Or"; children: number[] }
13
- | { kind: "Next" | "Always" | "Eventually"; body: number };
16
+ | { kind: "Next" | "Always" | "Eventually"; body: number }
17
+ | { kind: "Until" | "Unless"; left: number; right: number };
14
18
 
15
19
  interface Step {
16
20
  next: number[];
@@ -55,6 +59,8 @@ const createTable = () => {
55
59
  if (normal.kind === "Constant" || (kind !== "Next" && normal.kind === kind)) return body;
56
60
  return intern(`${kind}(${body})`, { kind, body });
57
61
  };
62
+ const getUntil = (kind: "Until" | "Unless", left: number, right: number) =>
63
+ intern(`${kind}(${left},${right})`, { kind, left, right });
58
64
  const memo = [new WeakMap<PtlFormula, number>(), new WeakMap<PtlFormula, number>()];
59
65
  const normalize = (formula: PtlFormula, isNegated: boolean): number => {
60
66
  const cache = memo[isNegated ? 1 : 0];
@@ -68,6 +74,8 @@ const createTable = () => {
68
74
  atom: formula.name,
69
75
  isPositive: !isNegated,
70
76
  });
77
+ case "Constant":
78
+ return getConstant(formula.value !== isNegated);
71
79
  case "Not":
72
80
  return normalize(formula.body, !isNegated);
73
81
  case "Next":
@@ -100,6 +108,15 @@ const createTable = () => {
100
108
  normalize(formula.right, !isNegated),
101
109
  ]),
102
110
  ]);
111
+ case "Until":
112
+ case "Unless": {
113
+ // translate/fofunctions.ml#negate: ~(f until g) is ~g unless (~f & ~g), and dually.
114
+ const kind = (formula.kind === "Until") === isNegated ? "Unless" : "Until";
115
+ const right = normalize(formula.right, isNegated);
116
+ return isNegated
117
+ ? getUntil(kind, right, getJunction("And", [normalize(formula.left, true), right]))
118
+ : getUntil(kind, normalize(formula.left, false), right);
119
+ }
103
120
  }
104
121
  })();
105
122
  cache.set(formula, result);
@@ -166,6 +183,15 @@ const getSteps = (
166
183
  clauses.push([-variable, body, next], [-next, body, getVariable(pendings, formula)]);
167
184
  return variable;
168
185
  }
186
+ case "Until":
187
+ case "Unless": {
188
+ const variable = createVariable();
189
+ const right = encode(normal.right);
190
+ const next = getVariable(nexts, formula);
191
+ clauses.push([-variable, right, encode(normal.left)], [-variable, right, next]);
192
+ if (normal.kind === "Until") clauses.push([-next, right, getVariable(pendings, formula)]);
193
+ return variable;
194
+ }
169
195
  }
170
196
  })();
171
197
  literals.set(formula, literal);
@@ -0,0 +1,310 @@
1
+ // N_data.untyped_deps and N_axioms with disable_arithmetic, where integers are values of sort Idv
2
+ // that only these axioms describe.
3
+
4
+ import {
5
+ APPEND,
6
+ CAT,
7
+ declare,
8
+ FUN_APP,
9
+ FUN_DOM,
10
+ FUN_ISAFCN,
11
+ HEAD,
12
+ INT_LTEQ,
13
+ INT_MINUS,
14
+ INT_PLUS,
15
+ INT_RANGE,
16
+ INT_SET,
17
+ LEN,
18
+ MEM,
19
+ NAT_SET,
20
+ SEQ,
21
+ SUB_SEQ,
22
+ TAIL,
23
+ tla,
24
+ } from "./format";
25
+ import type { SymbolSpec } from "./data";
26
+ import { axiom, type Axiom } from "./table";
27
+
28
+ const ZERO = tla("IntLit_0");
29
+ const ONE = tla("IntLit_1");
30
+
31
+ const SEQUENCE_DEPS = ["Mem", "Seq", "Len", "FunApp", "IntSet", "NatSet", "IntPlus", "IntLteq"];
32
+
33
+ const getTyping = (name: string, operator: string, set: string) =>
34
+ axiom(
35
+ name,
36
+ [],
37
+ `(forall ((x Idv) (y Idv)) (! (=> (and (${MEM} x ${set}) (${MEM} y ${set})) (${MEM} (${operator} x y) ${set})) :pattern ((${operator} x y))))`,
38
+ );
39
+
40
+ export const getUntypedSpec = (name: string): SymbolSpec | undefined => {
41
+ const symbol = tla(name);
42
+ const fixed = (arity: number, deps: string[], axioms: Axiom[], sort = "Idv") => ({
43
+ declaration: declare(symbol, arity, sort),
44
+ deps,
45
+ axioms,
46
+ });
47
+ switch (name) {
48
+ case "NatSet":
49
+ return fixed(
50
+ 0,
51
+ ["IntSet", "IntLit_0", "IntLteq"],
52
+ [
53
+ axiom(
54
+ "NatSetDef",
55
+ [],
56
+ `(forall ((x Idv)) (! (= (${MEM} x ${NAT_SET}) (and (${MEM} x ${INT_SET}) (${INT_LTEQ} ${ZERO} x))) :pattern ((${MEM} x ${NAT_SET}))))`,
57
+ ),
58
+ ],
59
+ );
60
+ case "IntPlus":
61
+ case "IntTimes": {
62
+ const typing = name === "IntPlus" ? "Plus" : "Times";
63
+ return fixed(
64
+ 2,
65
+ ["Mem", "IntSet", "NatSet"],
66
+ [
67
+ getTyping(`Int${typing}Typing`, symbol, INT_SET),
68
+ getTyping(`Nat${typing}Typing`, symbol, NAT_SET),
69
+ ],
70
+ );
71
+ }
72
+ case "IntMinus":
73
+ return fixed(2, ["Mem", "IntSet"], [getTyping("IntMinusTyping", symbol, INT_SET)]);
74
+ case "IntUminus":
75
+ return fixed(
76
+ 1,
77
+ ["Mem", "IntSet"],
78
+ [
79
+ axiom(
80
+ "IntUminusTyping",
81
+ [],
82
+ `(forall ((x Idv)) (! (=> (${MEM} x ${INT_SET}) (${MEM} (${symbol} x) ${INT_SET})) :pattern ((${symbol} x))))`,
83
+ ),
84
+ ],
85
+ );
86
+ case "IntQuotient":
87
+ case "IntRemainder": {
88
+ const isQuotient = name === "IntQuotient";
89
+ return fixed(
90
+ 2,
91
+ isQuotient
92
+ ? ["Mem", "IntSet", "NatSet", "IntLteq", "IntLit_0"]
93
+ : ["Mem", "IntSet", "NatSet", "IntLteq", "IntLit_0", "IntLit_1", "IntRange", "IntMinus"],
94
+ [
95
+ axiom(
96
+ `${name}Typing`,
97
+ [],
98
+ `(forall ((x Idv) (y Idv)) (! (=> (and (${MEM} x ${INT_SET}) (${MEM} y ${NAT_SET}) (${INT_LTEQ} ${ZERO} y)) (${MEM} (${symbol} x y) ${isQuotient ? NAT_SET : `(${INT_RANGE} ${ZERO} (${INT_MINUS} y ${ONE}))`})) :pattern ((${symbol} x y))))`,
99
+ ),
100
+ ],
101
+ );
102
+ }
103
+ case "IntExp":
104
+ return fixed(
105
+ 2,
106
+ ["Mem", "IntSet", "IntLteq", "IntLit_0", "IntLit_1"],
107
+ [
108
+ axiom(
109
+ "IntExpTyping",
110
+ [],
111
+ `(forall ((x Idv) (y Idv)) (! (=> (and (${MEM} x ${INT_SET}) (${MEM} y ${INT_SET}) (${INT_LTEQ} ${ZERO} y) (or (distinct x ${ZERO}) (${INT_LTEQ} ${ONE} y))) (${MEM} (${symbol} x y) ${INT_SET})) :pattern ((${symbol} x y))))`,
112
+ ),
113
+ ],
114
+ );
115
+ case "IntLteq":
116
+ return fixed(
117
+ 2,
118
+ ["Mem", "IntSet"],
119
+ [
120
+ axiom(
121
+ "LteqReflexive",
122
+ [],
123
+ `(forall ((x Idv)) (=> (${MEM} x ${INT_SET}) (${INT_LTEQ} x x)))`,
124
+ ),
125
+ axiom(
126
+ "LteqTransitive",
127
+ [],
128
+ `(forall ((x Idv) (y Idv) (z Idv)) (=> (and (${MEM} x ${INT_SET}) (${MEM} y ${INT_SET}) (${MEM} z ${INT_SET}) (${INT_LTEQ} x y) (${INT_LTEQ} y z)) (${INT_LTEQ} x z)))`,
129
+ ),
130
+ axiom(
131
+ "LteqAntisym",
132
+ [],
133
+ `(forall ((x Idv) (y Idv)) (=> (and (${MEM} x ${INT_SET}) (${MEM} y ${INT_SET}) (${INT_LTEQ} x y) (${INT_LTEQ} y x)) (= x y)))`,
134
+ ),
135
+ ],
136
+ "Bool",
137
+ );
138
+ // tlapm labels SeqSetElim1 and SeqSetElim2 SetSetElim1 and SetSetElim2.
139
+ case "Seq":
140
+ return fixed(
141
+ 1,
142
+ [
143
+ "Mem",
144
+ "Len",
145
+ "FunIsafcn",
146
+ "FunDom",
147
+ "FunApp",
148
+ "IntSet",
149
+ "NatSet",
150
+ "IntRange",
151
+ "IntLteq",
152
+ "IntLit_1",
153
+ ],
154
+ [
155
+ axiom(
156
+ "SeqSetIntro",
157
+ [],
158
+ `(forall ((a Idv) (s Idv)) (! (=> (and (${FUN_ISAFCN} s) (${MEM} (${LEN} s) ${NAT_SET}) (forall ((i Idv)) (= (${MEM} i (${FUN_DOM} s)) (and (${MEM} i ${INT_SET}) (${INT_LTEQ} ${ONE} i) (${INT_LTEQ} i (${LEN} s))))) (forall ((i Idv)) (=> (and (${MEM} i ${INT_SET}) (${INT_LTEQ} ${ONE} i) (${INT_LTEQ} i (${LEN} s))) (${MEM} (${FUN_APP} s i) a)))) (${MEM} s (${SEQ} a))) :pattern ((${MEM} s (${SEQ} a)))))`,
159
+ ),
160
+ axiom(
161
+ "SeqSetElim1",
162
+ [],
163
+ `(forall ((a Idv) (s Idv)) (! (=> (${MEM} s (${SEQ} a)) (and (${FUN_ISAFCN} s) (${MEM} (${LEN} s) ${NAT_SET}) (= (${FUN_DOM} s) (${INT_RANGE} ${ONE} (${LEN} s))))) :pattern ((${MEM} s (${SEQ} a)))))`,
164
+ "SetSetElim1",
165
+ ),
166
+ axiom(
167
+ "SeqSetElim2",
168
+ [],
169
+ `(forall ((a Idv) (s Idv) (i Idv)) (! (=> (and (${MEM} s (${SEQ} a)) (${MEM} i ${INT_SET}) (${INT_LTEQ} ${ONE} i) (${INT_LTEQ} i (${LEN} s))) (${MEM} (${FUN_APP} s i) a)) :pattern ((${MEM} s (${SEQ} a)) (${FUN_APP} s i))))`,
170
+ "SetSetElim2",
171
+ ),
172
+ ],
173
+ );
174
+ case "Len":
175
+ return fixed(
176
+ 1,
177
+ ["Mem", "FunDom", "IntRange", "NatSet", "IntLit_1"],
178
+ [
179
+ axiom(
180
+ "SeqLenDef",
181
+ [],
182
+ `(forall ((s Idv) (z Idv)) (=> (and (${MEM} z ${NAT_SET}) (= (${FUN_DOM} s) (${INT_RANGE} ${ONE} z))) (= (${LEN} s) z)))`,
183
+ ),
184
+ ],
185
+ );
186
+ case "Cat":
187
+ return fixed(
188
+ 2,
189
+ [...SEQUENCE_DEPS, "IntLit_1"],
190
+ [
191
+ axiom(
192
+ "SeqCatTyping",
193
+ [],
194
+ `(forall ((a Idv) (s Idv) (t Idv)) (! (=> (and (${MEM} s (${SEQ} a)) (${MEM} t (${SEQ} a))) (${MEM} (${CAT} s t) (${SEQ} a))) :pattern ((${MEM} s (${SEQ} a)) (${CAT} s t)) :pattern ((${MEM} t (${SEQ} a)) (${CAT} s t))))`,
195
+ ),
196
+ axiom(
197
+ "SeqCatLen",
198
+ [],
199
+ `(forall ((s Idv) (t Idv)) (! (=> (and (${MEM} (${LEN} s) ${NAT_SET}) (${MEM} (${LEN} t) ${NAT_SET})) (= (${LEN} (${CAT} s t)) (${INT_PLUS} (${LEN} s) (${LEN} t)))) :pattern ((${CAT} s t))))`,
200
+ ),
201
+ axiom(
202
+ "SeqCatApp1",
203
+ [],
204
+ `(forall ((s Idv) (t Idv) (i Idv)) (! (=> (and (${MEM} (${LEN} s) ${NAT_SET}) (${MEM} (${LEN} t) ${NAT_SET}) (${MEM} i ${INT_SET}) (${INT_LTEQ} ${ONE} i) (${INT_LTEQ} i (${LEN} s))) (= (${FUN_APP} (${CAT} s t) i) (${FUN_APP} s i))) :pattern ((${FUN_APP} (${CAT} s t) i)) :pattern ((${CAT} s t) (${FUN_APP} s i))))`,
205
+ ),
206
+ axiom(
207
+ "SeqCatApp2",
208
+ [],
209
+ `(forall ((s Idv) (t Idv) (i Idv)) (! (=> (and (${MEM} (${LEN} s) ${NAT_SET}) (${MEM} (${LEN} t) ${NAT_SET}) (${MEM} i ${INT_SET}) (${INT_LTEQ} i (${INT_PLUS} (${LEN} s) (${LEN} t))) (${INT_LTEQ} (${LEN} s) i) (distinct (${LEN} s) i)) (= (${FUN_APP} (${CAT} s t) i) (${FUN_APP} t (${INT_MINUS} i (${LEN} s))))) :pattern ((${FUN_APP} (${CAT} s t) i))))`,
210
+ ),
211
+ ],
212
+ );
213
+ case "Append":
214
+ return fixed(
215
+ 2,
216
+ [...SEQUENCE_DEPS, "IntLit_1"],
217
+ [
218
+ axiom(
219
+ "SeqAppendTyping",
220
+ [],
221
+ `(forall ((a Idv) (s Idv) (x Idv)) (! (=> (and (${MEM} s (${SEQ} a)) (${MEM} x a)) (${MEM} (${APPEND} s x) (${SEQ} a))) :pattern ((${MEM} s (${SEQ} a)) (${APPEND} s x))))`,
222
+ ),
223
+ axiom(
224
+ "SeqAppendLen",
225
+ [],
226
+ `(forall ((s Idv) (x Idv)) (! (=> (${MEM} (${LEN} s) ${NAT_SET}) (= (${LEN} (${APPEND} s x)) (${INT_PLUS} (${LEN} s) ${ONE}))) :pattern ((${APPEND} s x))))`,
227
+ ),
228
+ axiom(
229
+ "SeqAppendApp1",
230
+ [],
231
+ `(forall ((s Idv) (x Idv) (i Idv)) (! (=> (and (${MEM} (${LEN} s) ${NAT_SET}) (${MEM} i ${INT_SET}) (${INT_LTEQ} ${ONE} i) (${INT_LTEQ} i (${LEN} s))) (= (${FUN_APP} (${APPEND} s x) i) (${FUN_APP} s i))) :pattern ((${FUN_APP} (${APPEND} s x) i)) :pattern ((${APPEND} s x) (${FUN_APP} s i))))`,
232
+ ),
233
+ axiom(
234
+ "SeqAppendApp2",
235
+ [],
236
+ `(forall ((s Idv) (x Idv)) (! (=> (${MEM} (${LEN} s) ${NAT_SET}) (= (${FUN_APP} (${APPEND} s x) (${INT_PLUS} (${LEN} s) ${ONE})) x)) :pattern ((${APPEND} s x))))`,
237
+ ),
238
+ ],
239
+ );
240
+ case "Head":
241
+ return fixed(
242
+ 1,
243
+ ["FunApp", "IntLit_1"],
244
+ [
245
+ axiom(
246
+ "SeqHeadDef",
247
+ [],
248
+ `(forall ((s Idv)) (! (= (${HEAD} s) (${FUN_APP} s ${ONE})) :pattern ((${HEAD} s))))`,
249
+ ),
250
+ ],
251
+ );
252
+ case "Tail":
253
+ return fixed(
254
+ 1,
255
+ [...SEQUENCE_DEPS, "IntMinus", "IntLit_0", "IntLit_1"],
256
+ [
257
+ axiom(
258
+ "SeqTailTyping",
259
+ [],
260
+ `(forall ((a Idv) (s Idv)) (! (=> (and (${MEM} s (${SEQ} a)) (distinct (${LEN} s) ${ZERO})) (${MEM} (${TAIL} s) (${SEQ} a))) :pattern ((${MEM} s (${SEQ} a)) (${TAIL} s))))`,
261
+ ),
262
+ axiom(
263
+ "SeqTailLen",
264
+ [],
265
+ `(forall ((s Idv)) (! (=> (and (${MEM} (${LEN} s) ${NAT_SET}) (distinct (${LEN} s) ${ZERO})) (= (${LEN} (${TAIL} s)) (${INT_MINUS} (${LEN} s) ${ONE}))) :pattern ((${TAIL} s))))`,
266
+ ),
267
+ axiom(
268
+ "SeqTailApp",
269
+ [],
270
+ `(forall ((s Idv) (i Idv)) (! (=> (and (${MEM} (${LEN} s) ${NAT_SET}) (distinct (${LEN} s) ${ZERO}) (${MEM} i ${INT_SET}) (${INT_LTEQ} ${ONE} i) (${INT_LTEQ} i (${INT_MINUS} (${LEN} s) ${ONE}))) (= (${FUN_APP} (${TAIL} s) i) (${FUN_APP} s (${INT_PLUS} i ${ONE})))) :pattern ((${FUN_APP} (${TAIL} s) i))))`,
271
+ ),
272
+ ],
273
+ );
274
+ case "SubSeq":
275
+ return fixed(
276
+ 3,
277
+ [
278
+ "Mem",
279
+ "Seq",
280
+ "Len",
281
+ "FunApp",
282
+ "IntSet",
283
+ "IntPlus",
284
+ "IntMinus",
285
+ "IntLteq",
286
+ "IntLit_0",
287
+ "IntLit_1",
288
+ ],
289
+ [
290
+ axiom(
291
+ "SeqSubseqTyping",
292
+ [],
293
+ `(forall ((a Idv) (s Idv) (x Idv) (y Idv)) (! (=> (or (and (${MEM} x ${INT_SET}) (${MEM} y ${INT_SET}) (${INT_LTEQ} y x) (distinct y x)) (and (${MEM} s (${SEQ} a)) (${MEM} x ${INT_SET}) (${MEM} y ${INT_SET}) (${INT_LTEQ} ${ONE} x) (${INT_LTEQ} y (${LEN} s)))) (${MEM} (${SUB_SEQ} s x y) (${SEQ} a))) :pattern ((${MEM} s (${SEQ} a)) (${SUB_SEQ} s x y))))`,
294
+ ),
295
+ axiom(
296
+ "SeqSubseqLen",
297
+ [],
298
+ `(forall ((s Idv) (x Idv) (y Idv)) (! (=> (and (${MEM} x ${INT_SET}) (${MEM} y ${INT_SET})) (and (=> (${INT_LTEQ} x (${INT_PLUS} y ${ONE})) (= (${LEN} (${SUB_SEQ} s x y)) (${INT_MINUS} (${INT_PLUS} y ${ONE}) x))) (=> (not (${INT_LTEQ} x (${INT_PLUS} y ${ONE}))) (= (${LEN} (${SUB_SEQ} s x y)) ${ZERO})))) :pattern ((${SUB_SEQ} s x y))))`,
299
+ ),
300
+ axiom(
301
+ "SeqSubseqApp",
302
+ [],
303
+ `(forall ((s Idv) (x Idv) (y Idv) (z Idv)) (! (=> (and (${MEM} x ${INT_SET}) (${MEM} y ${INT_SET}) (${MEM} z ${INT_SET}) (${INT_LTEQ} ${ONE} x) (${INT_LTEQ} ${ONE} z) (${INT_LTEQ} z (${INT_MINUS} (${INT_PLUS} y ${ONE}) x))) (= (${FUN_APP} (${SUB_SEQ} s x y) z) (${FUN_APP} s (${INT_MINUS} (${INT_PLUS} z x) ${ONE})))) :pattern ((${FUN_APP} (${SUB_SEQ} s x y) z))))`,
304
+ ),
305
+ ],
306
+ );
307
+ default:
308
+ return undefined;
309
+ }
310
+ };
@@ -71,8 +71,12 @@ export const getEnumeration = (count: number) => {
71
71
  return [intro, elim];
72
72
  };
73
73
 
74
- export const getIntegers = (count: number) =>
75
- Array.from({ length: count }, (_value, index) => `(${CAST_INT} ${index + 1})`);
74
+ // Standardize writes a typed number as a cast and an untyped one as an IntLit.
75
+ export const getNumeral = (value: number, isArithmetic: boolean) =>
76
+ isArithmetic ? `(${CAST_INT} ${value})` : tla(`IntLit_${value}`);
77
+
78
+ export const getIntegers = (count: number, isArithmetic: boolean) =>
79
+ Array.from({ length: count }, (_value, index) => getNumeral(index + 1, isArithmetic));
76
80
 
77
81
  export const getFieldKeys = (fields: string[]) => fields.map((field) => tla(`StrLit_${field}`));
78
82
 
@@ -94,8 +98,8 @@ const getComponentExcepts = (
94
98
  });
95
99
  };
96
100
 
97
- export const getTupleExcepts = (count: number) =>
98
- getComponentExcepts("Tup", [count], tla(`Tuple_${count}`), getIntegers(count));
101
+ export const getTupleExcepts = (count: number, isArithmetic: boolean) =>
102
+ getComponentExcepts("Tup", [count], tla(`Tuple_${count}`), getIntegers(count, isArithmetic));
99
103
 
100
104
  export const getRecordExcepts = (fields: string[]) =>
101
105
  getComponentExcepts("Rec", [fields], tla(`Record_${fields.join("_")}`), getFieldKeys(fields));
@@ -135,12 +139,12 @@ const getComponentFunction = (
135
139
  ];
136
140
  };
137
141
 
138
- export const getTupleAxioms = (count: number, isExcept: boolean) => {
142
+ export const getTupleAxioms = (count: number, isExcept: boolean, isArithmetic: boolean) => {
139
143
  const symbol = tla(`Tuple_${count}`);
140
144
  const elements = getNames("x", count);
141
145
  const value = call(symbol, elements);
142
146
  return [
143
- ...getComponentFunction("Tup", [count], symbol, getIntegers(count)),
147
+ ...getComponentFunction("Tup", [count], symbol, getIntegers(count, isArithmetic)),
144
148
  axiom(
145
149
  "SeqTupTyping",
146
150
  [count],
@@ -155,9 +159,9 @@ export const getTupleAxioms = (count: number, isExcept: boolean) => {
155
159
  axiom(
156
160
  "SeqTupLen",
157
161
  [count],
158
- forall(elements, `(= (${LEN} ${value}) (${CAST_INT} ${count}))`, [[value]]),
162
+ forall(elements, `(= (${LEN} ${value}) ${getNumeral(count, isArithmetic)})`, [[value]]),
159
163
  ),
160
- ...(isExcept ? getTupleExcepts(count) : []),
164
+ ...(isExcept ? getTupleExcepts(count, isArithmetic) : []),
161
165
  ];
162
166
  };
163
167