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

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (586) hide show
  1. package/README.md +2 -1
  2. package/dist/compile.cjs +6 -6
  3. package/dist/compile.js +10 -10
  4. package/dist/deciders.cjs +41 -37
  5. package/dist/deciders.js +57 -53
  6. package/dist/index.cjs +1 -1
  7. package/dist/index.d.cts +37 -0
  8. package/dist/index.d.ts +37 -0
  9. package/dist/index.js +1 -1
  10. package/dist/parallel-worker.cjs +1 -1
  11. package/dist/parallel-worker.js +1 -1
  12. package/dist/prove.cjs +2683 -427
  13. package/dist/prove.js +2681 -425
  14. package/dist/run.cjs +47 -44
  15. package/dist/run.js +47 -44
  16. package/dist/tlapm.cjs +2 -2
  17. package/dist/tlapm.js +2 -2
  18. package/dist/transfer.cjs +44 -41
  19. package/dist/transfer.js +44 -41
  20. package/dist/worker.cjs +7 -7
  21. package/dist/worker.js +7 -7
  22. package/package.json +1 -1
  23. package/src/ast.ts +41 -41
  24. package/src/bags.ts +2 -5
  25. package/src/builtins.ts +5 -21
  26. package/src/check-failure.ts +116 -0
  27. package/src/check-trace.ts +268 -0
  28. package/src/check.ts +474 -718
  29. package/src/cli/options.ts +6 -31
  30. package/src/cli/run.ts +0 -2
  31. package/src/cli/runtime-invariants.ts +8 -7
  32. package/src/cli/shared.ts +1 -5
  33. package/src/cli/tlapm.ts +433 -70
  34. package/src/cli/tlc-arguments.ts +244 -238
  35. package/src/cli/tlc-output.ts +687 -0
  36. package/src/cli/tlc-usage.ts +3 -5
  37. package/src/cli/tlc.ts +49 -702
  38. package/src/cli/xml-exporter.ts +23 -33
  39. package/src/codegen.ts +5 -10
  40. package/src/coverage.ts +3 -10
  41. package/src/dependencies.ts +30 -14
  42. package/src/dfid.ts +16 -16
  43. package/src/environment-config.ts +315 -0
  44. package/src/environment.ts +55 -338
  45. package/src/errors.ts +33 -5
  46. package/src/evaluate.ts +31 -106
  47. package/src/exit-codes.ts +2 -0
  48. package/src/fingerprints.ts +65 -1
  49. package/src/instances.ts +47 -10
  50. package/src/java-hash.ts +7 -0
  51. package/src/java-overrides.ts +4 -9
  52. package/src/json-reader.ts +1 -2
  53. package/src/json.ts +8 -18
  54. package/src/levels.ts +46 -57
  55. package/src/lexer.ts +76 -85
  56. package/src/liveness-checker.ts +616 -306
  57. package/src/liveness.ts +104 -120
  58. package/src/obligations/action.ts +14 -17
  59. package/src/obligations/anonymize.ts +37 -16
  60. package/src/obligations/enabled-axioms.ts +218 -0
  61. package/src/obligations/equality.ts +1 -3
  62. package/src/obligations/expression.ts +36 -8
  63. package/src/obligations/format.ts +0 -2
  64. package/src/obligations/generate.ts +66 -54
  65. package/src/obligations/index.ts +38 -8
  66. package/src/obligations/levels.ts +24 -11
  67. package/src/obligations/module.ts +28 -41
  68. package/src/obligations/normalize.ts +26 -14
  69. package/src/obligations/operators.ts +0 -2
  70. package/src/obligations/pragma.ts +53 -16
  71. package/src/obligations/printer.ts +43 -13
  72. package/src/obligations/proof.ts +3 -2
  73. package/src/obligations/regroup.ts +0 -2
  74. package/src/obligations/simplify.ts +55 -50
  75. package/src/obligations/source.ts +118 -74
  76. package/src/obligations/subexpression.ts +45 -18
  77. package/src/obligations/substitution.ts +1 -3
  78. package/src/obligations/temporal.ts +5 -7
  79. package/src/obligations/tuples.ts +0 -2
  80. package/src/parallel-worker.ts +10 -30
  81. package/src/parallel.ts +50 -80
  82. package/src/parser.ts +722 -385
  83. package/src/pcal/ast.ts +53 -65
  84. package/src/pcal/parse.ts +144 -191
  85. package/src/pcal/tokenize.ts +91 -115
  86. package/src/pcal/translate.ts +83 -98
  87. package/src/pcal/validate.ts +48 -50
  88. package/src/pretty-print.ts +7 -7
  89. package/src/prover/decide-pool.ts +3 -3
  90. package/src/prover/deciders.ts +12 -9
  91. package/src/prover/isabelle/decide.ts +3 -25
  92. package/src/prover/isabelle/encode.ts +72 -42
  93. package/src/prover/isabelle/isar/attrib.ts +250 -0
  94. package/src/prover/isabelle/isar/context.ts +335 -0
  95. package/src/prover/isabelle/isar/induct.ts +382 -0
  96. package/src/prover/isabelle/isar/inner-syntax.ts +158 -7
  97. package/src/prover/isabelle/isar/method.ts +509 -212
  98. package/src/prover/isabelle/isar/proof.ts +570 -14
  99. package/src/prover/isabelle/isar/rule-cases.ts +224 -0
  100. package/src/prover/isabelle/isar/theory.ts +487 -76
  101. package/src/prover/isabelle/isar/toplevel.ts +331 -0
  102. package/src/prover/isabelle/isar/type-check.ts +89 -14
  103. package/src/prover/isabelle/provers/blast/blast.ts +7 -65
  104. package/src/prover/isabelle/provers/blast/branch.ts +0 -2
  105. package/src/prover/isabelle/provers/blast/prove.ts +0 -2
  106. package/src/prover/isabelle/provers/blast/rules.ts +0 -2
  107. package/src/prover/isabelle/provers/blast/state.ts +0 -2
  108. package/src/prover/isabelle/provers/blast/term.ts +0 -2
  109. package/src/prover/isabelle/provers/clasimp.ts +0 -2
  110. package/src/prover/isabelle/provers/classical.ts +45 -20
  111. package/src/prover/isabelle/provers/hypsubst.ts +17 -28
  112. package/src/prover/isabelle/pure/bicompose.ts +9 -27
  113. package/src/prover/isabelle/pure/consts.ts +0 -2
  114. package/src/prover/isabelle/pure/conv.ts +2 -10
  115. package/src/prover/isabelle/pure/drule.ts +72 -6
  116. package/src/prover/isabelle/pure/envir.ts +0 -2
  117. package/src/prover/isabelle/pure/goal.ts +1 -3
  118. package/src/prover/isabelle/pure/logic.ts +1 -3
  119. package/src/prover/isabelle/pure/name.ts +0 -2
  120. package/src/prover/isabelle/pure/net.ts +0 -2
  121. package/src/prover/isabelle/pure/object-logic.ts +13 -7
  122. package/src/prover/isabelle/pure/pattern.ts +0 -2
  123. package/src/prover/isabelle/pure/raw-simplifier.ts +4 -15
  124. package/src/prover/isabelle/pure/rewriter.ts +6 -17
  125. package/src/prover/isabelle/pure/search.ts +0 -2
  126. package/src/prover/isabelle/pure/seq.ts +0 -2
  127. package/src/prover/isabelle/pure/simplifier.ts +26 -7
  128. package/src/prover/isabelle/pure/table.ts +2 -3
  129. package/src/prover/isabelle/pure/tactic.ts +0 -2
  130. package/src/prover/isabelle/pure/tactical.ts +42 -37
  131. package/src/prover/isabelle/pure/term-ord.ts +0 -2
  132. package/src/prover/isabelle/pure/term.ts +0 -2
  133. package/src/prover/isabelle/pure/thm.ts +14 -13
  134. package/src/prover/isabelle/pure/type.ts +0 -2
  135. package/src/prover/isabelle/pure/unify.ts +0 -2
  136. package/src/prover/isabelle/pure/variable.ts +0 -2
  137. package/src/prover/isabelle/tla/classical-setup.ts +18 -16
  138. package/src/prover/isabelle/tla/context.ts +58 -11
  139. package/src/prover/isabelle/tla/logic-data.ts +1 -1
  140. package/src/prover/isabelle/tla/logic.ts +49 -21
  141. package/src/prover/isabelle/tla/simpdata.ts +1 -12
  142. package/src/prover/isabelle/tools/intuitionistic.ts +28 -12
  143. package/src/prover/ocaml.ts +4 -1
  144. package/src/prover/prep/action.ts +30 -31
  145. package/src/prover/prep/enabled-axioms.ts +11 -2
  146. package/src/prover/prep/fingerprint.ts +2 -5
  147. package/src/prover/prep/methods.ts +181 -51
  148. package/src/prover/prep/normalize.ts +38 -9
  149. package/src/prover/prove.ts +395 -94
  150. package/src/prover/ptl/decide.ts +95 -50
  151. package/src/prover/ptl/encode.ts +2 -3
  152. package/src/prover/ptl/tableau.ts +28 -2
  153. package/src/prover/smt/arithmetic.ts +310 -0
  154. package/src/prover/smt/axioms.ts +12 -8
  155. package/src/prover/smt/context.ts +43 -8
  156. package/src/prover/smt/data.ts +498 -379
  157. package/src/prover/smt/encode.ts +148 -57
  158. package/src/prover/smt/extensionality.ts +5 -3
  159. package/src/prover/smt/flatten.ts +4 -6
  160. package/src/prover/smt/format.ts +28 -4
  161. package/src/prover/smt/instances.ts +7 -1
  162. package/src/prover/smt/layout.ts +91 -0
  163. package/src/prover/smt/rewrite.ts +1021 -618
  164. package/src/prover/smt/simplify.ts +441 -0
  165. package/src/prover/smt/solver/ackermannize-bv-tactic.ts +61 -0
  166. package/src/prover/smt/solver/ackr-helper.ts +179 -0
  167. package/src/prover/smt/solver/ackr-model-converter.ts +105 -0
  168. package/src/prover/smt/solver/act-cache.ts +0 -1
  169. package/src/prover/smt/solver/add-bounds-tactic.ts +59 -0
  170. package/src/prover/smt/solver/aig-tactic.ts +52 -0
  171. package/src/prover/smt/solver/aig.ts +889 -0
  172. package/src/prover/smt/solver/arith-rewriter.ts +613 -6
  173. package/src/prover/smt/solver/arith-terms.ts +121 -0
  174. package/src/prover/smt/solver/array-decl-plugin.ts +175 -0
  175. package/src/prover/smt/solver/array-rewriter.ts +309 -0
  176. package/src/prover/smt/solver/asserted-formulas.ts +87 -16
  177. package/src/prover/smt/solver/ast-lt.ts +166 -12
  178. package/src/prover/smt/solver/ast-util.ts +160 -2
  179. package/src/prover/smt/solver/ast.ts +1427 -41
  180. package/src/prover/smt/solver/auf-solver.ts +2 -6
  181. package/src/prover/smt/solver/bit-blast-tactic.ts +582 -0
  182. package/src/prover/smt/solver/bit-blaster.ts +871 -0
  183. package/src/prover/smt/solver/bound-manager.ts +196 -0
  184. package/src/prover/smt/solver/bound-simplifier.ts +600 -0
  185. package/src/prover/smt/solver/bv-bound-chk.ts +492 -0
  186. package/src/prover/smt/solver/bv-decl-plugin.ts +338 -0
  187. package/src/prover/smt/solver/bv-divrem-bounds.ts +95 -0
  188. package/src/prover/smt/solver/bv-rewriter.ts +1901 -0
  189. package/src/prover/smt/solver/bv1-blast.ts +214 -0
  190. package/src/prover/smt/solver/bv2fpa-converter.ts +174 -0
  191. package/src/prover/smt/solver/bv2int-rewriter.ts +544 -0
  192. package/src/prover/smt/solver/bv2real-rewriter.ts +533 -0
  193. package/src/prover/smt/solver/card2bv.ts +110 -0
  194. package/src/prover/smt/solver/case-split-queue.ts +0 -2
  195. package/src/prover/smt/solver/cg-table.ts +39 -25
  196. package/src/prover/smt/solver/check-logic.ts +330 -0
  197. package/src/prover/smt/solver/clause.ts +0 -1
  198. package/src/prover/smt/solver/cofactor-elim-term-ite.ts +278 -0
  199. package/src/prover/smt/solver/conflict-resolution.ts +78 -2
  200. package/src/prover/smt/solver/context.ts +516 -115
  201. package/src/prover/smt/solver/ctx-simplify.ts +20 -10
  202. package/src/prover/smt/solver/ctx-solver-simplify.ts +122 -0
  203. package/src/prover/smt/solver/datatype-decl-plugin.ts +572 -0
  204. package/src/prover/smt/solver/datatype-rewriter.ts +82 -0
  205. package/src/prover/smt/solver/demodulator.ts +786 -0
  206. package/src/prover/smt/solver/dependent-expr-state.ts +81 -0
  207. package/src/prover/smt/solver/der.ts +38 -10
  208. package/src/prover/smt/solver/diff-neq.ts +206 -0
  209. package/src/prover/smt/solver/distribute-forall.ts +57 -0
  210. package/src/prover/smt/solver/dom-simplify.ts +511 -0
  211. package/src/prover/smt/solver/dt2bv-tactic.ts +260 -0
  212. package/src/prover/smt/solver/dyn-ack.ts +0 -1
  213. package/src/prover/smt/solver/e-matching.ts +7 -8
  214. package/src/prover/smt/solver/elim-small-bv-tactic.ts +129 -0
  215. package/src/prover/smt/solver/elim-uncnstr.ts +545 -0
  216. package/src/prover/smt/solver/enode.ts +100 -3
  217. package/src/prover/smt/solver/eq2bv-tactic.ts +218 -0
  218. package/src/prover/smt/solver/euf/arith-axioms.ts +403 -0
  219. package/src/prover/smt/solver/euf/arith-internalize.ts +653 -0
  220. package/src/prover/smt/solver/euf/arith-solver.ts +889 -0
  221. package/src/prover/smt/solver/euf/array-axioms.ts +527 -0
  222. package/src/prover/smt/solver/euf/array-internalize.ts +428 -0
  223. package/src/prover/smt/solver/euf/array-solver.ts +306 -0
  224. package/src/prover/smt/solver/euf/bv-ackerman.ts +162 -0
  225. package/src/prover/smt/solver/euf/bv-internalize.ts +748 -0
  226. package/src/prover/smt/solver/euf/bv-solver.ts +449 -0
  227. package/src/prover/smt/solver/euf/dt-solver.ts +618 -0
  228. package/src/prover/smt/solver/euf/egraph.ts +908 -0
  229. package/src/prover/smt/solver/euf/euf-solver.ts +1205 -0
  230. package/src/prover/smt/solver/euf/fpa-solver.ts +317 -0
  231. package/src/prover/smt/solver/euf/mam.ts +1050 -0
  232. package/src/prover/smt/solver/euf/q-ematch.ts +830 -0
  233. package/src/prover/smt/solver/euf/q-mbi.ts +587 -0
  234. package/src/prover/smt/solver/euf/q-model-fixer.ts +296 -0
  235. package/src/prover/smt/solver/euf/q-solver.ts +361 -0
  236. package/src/prover/smt/solver/euf/th-solver.ts +335 -0
  237. package/src/prover/smt/solver/euf/th-solvers.ts +30 -0
  238. package/src/prover/smt/solver/expr-ref.ts +0 -1
  239. package/src/prover/smt/solver/expr-safe-replace.ts +26 -2
  240. package/src/prover/smt/solver/expr2polynomial.ts +146 -0
  241. package/src/prover/smt/solver/factor.ts +141 -0
  242. package/src/prover/smt/solver/fd-solver.ts +265 -0
  243. package/src/prover/smt/solver/fingerprints.ts +15 -15
  244. package/src/prover/smt/solver/fix-dl-var.ts +148 -0
  245. package/src/prover/smt/solver/flat-literals.ts +0 -1
  246. package/src/prover/smt/solver/fm-tactic.ts +884 -0
  247. package/src/prover/smt/solver/fpa-decl-plugin.ts +618 -0
  248. package/src/prover/smt/solver/fpa-rewriter.ts +640 -0
  249. package/src/prover/smt/solver/fpa2bv-converter.ts +2249 -0
  250. package/src/prover/smt/solver/fpa2bv-rewriter.ts +348 -0
  251. package/src/prover/smt/solver/fpa2bv-tactic.ts +73 -0
  252. package/src/prover/smt/solver/goal.ts +175 -15
  253. package/src/prover/smt/solver/goal2nlsat.ts +189 -0
  254. package/src/prover/smt/solver/guard-set.ts +219 -0
  255. package/src/prover/smt/solver/hash.ts +0 -1
  256. package/src/prover/smt/solver/hashtable.ts +30 -16
  257. package/src/prover/smt/solver/inf-eps.ts +63 -0
  258. package/src/prover/smt/solver/inj-axiom.ts +101 -0
  259. package/src/prover/smt/solver/internalizer.ts +110 -38
  260. package/src/prover/smt/solver/lackr.ts +381 -0
  261. package/src/prover/smt/solver/lbool.ts +0 -1
  262. package/src/prover/smt/solver/lia2card.ts +268 -0
  263. package/src/prover/smt/solver/lia2pb.ts +154 -0
  264. package/src/prover/smt/solver/literal.ts +0 -1
  265. package/src/prover/smt/solver/logic-tactics.ts +345 -0
  266. package/src/prover/smt/solver/lp/bound-propagator.ts +0 -1
  267. package/src/prover/smt/solver/lp/constraints.ts +0 -1
  268. package/src/prover/smt/solver/lp/containers.ts +7 -2
  269. package/src/prover/smt/solver/lp/core-solver.ts +18 -3
  270. package/src/prover/smt/solver/lp/cross-nested.ts +1 -4
  271. package/src/prover/smt/solver/lp/dep-intervals.ts +0 -3
  272. package/src/prover/smt/solver/lp/dependency.ts +0 -2
  273. package/src/prover/smt/solver/lp/dioph-eq.ts +1 -10
  274. package/src/prover/smt/solver/lp/explanation.ts +0 -1
  275. package/src/prover/smt/solver/lp/gomory.ts +0 -1
  276. package/src/prover/smt/solver/lp/hnf-cutter.ts +1 -2
  277. package/src/prover/smt/solver/lp/hnf.ts +0 -3
  278. package/src/prover/smt/solver/lp/int-cube.ts +3 -4
  279. package/src/prover/smt/solver/lp/int-solver.ts +0 -2
  280. package/src/prover/smt/solver/lp/lar-solver.ts +40 -4
  281. package/src/prover/smt/solver/lp/lar-term.ts +0 -1
  282. package/src/prover/smt/solver/lp/lp-settings.ts +0 -1
  283. package/src/prover/smt/solver/lp/maximize-term.ts +59 -10
  284. package/src/prover/smt/solver/lp/nex-creator.ts +3 -3
  285. package/src/prover/smt/solver/lp/nex.ts +2 -2
  286. package/src/prover/smt/solver/lp/nla-backoff.ts +0 -2
  287. package/src/prover/smt/solver/lp/nla-basics.ts +46 -3
  288. package/src/prover/smt/solver/lp/nla-core.ts +67 -16
  289. package/src/prover/smt/solver/lp/nla-divisions.ts +0 -2
  290. package/src/prover/smt/solver/lp/nla-emonics.ts +0 -1
  291. package/src/prover/smt/solver/lp/nla-factorization.ts +0 -1
  292. package/src/prover/smt/solver/lp/nla-grobner.ts +9 -5
  293. package/src/prover/smt/solver/lp/nla-horner.ts +0 -2
  294. package/src/prover/smt/solver/lp/nla-intervals.ts +0 -1
  295. package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +0 -2
  296. package/src/prover/smt/solver/lp/nla-monotone.ts +0 -1
  297. package/src/prover/smt/solver/lp/nla-order.ts +0 -2
  298. package/src/prover/smt/solver/lp/nla-patcher.ts +0 -1
  299. package/src/prover/smt/solver/lp/nla-powers.ts +220 -0
  300. package/src/prover/smt/solver/lp/nla-tangents.ts +0 -2
  301. package/src/prover/smt/solver/lp/nla-throttle.ts +0 -1
  302. package/src/prover/smt/solver/lp/nla-transcendentals.ts +324 -0
  303. package/src/prover/smt/solver/lp/nla-types.ts +0 -2
  304. package/src/prover/smt/solver/lp/nla-var-eqs.ts +0 -1
  305. package/src/prover/smt/solver/lp/nra-solver.ts +122 -64
  306. package/src/prover/smt/solver/lp/numeric-pair.ts +0 -1
  307. package/src/prover/smt/solver/lp/pdd-interval.ts +0 -1
  308. package/src/prover/smt/solver/lp/pdd-simplifier.ts +0 -1
  309. package/src/prover/smt/solver/lp/pdd-solver.ts +0 -2
  310. package/src/prover/smt/solver/lp/pdd.ts +2 -2
  311. package/src/prover/smt/solver/lp/random-updater.ts +0 -2
  312. package/src/prover/smt/solver/lp/static-matrix.ts +0 -1
  313. package/src/prover/smt/solver/lp/union-find.ts +7 -2
  314. package/src/prover/smt/solver/macro-finder.ts +530 -0
  315. package/src/prover/smt/solver/mam-compiler.ts +122 -90
  316. package/src/prover/smt/solver/mam-interpreter.ts +0 -1
  317. package/src/prover/smt/solver/max-bv-sharing-tactic.ts +17 -0
  318. package/src/prover/smt/solver/max-cliques.ts +105 -0
  319. package/src/prover/smt/solver/maxcore.ts +309 -0
  320. package/src/prover/smt/solver/maximize-ac-sharing.ts +8 -6
  321. package/src/prover/smt/solver/maxlex.ts +115 -0
  322. package/src/prover/smt/solver/maxsmt-base.ts +105 -0
  323. package/src/prover/smt/solver/maxsmt.ts +92 -0
  324. package/src/prover/smt/solver/mbp/mbp-arith.ts +467 -0
  325. package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +101 -0
  326. package/src/prover/smt/solver/mbp/mbp-plugin.ts +287 -0
  327. package/src/prover/smt/solver/mbp/mbp-qel.ts +48 -0
  328. package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +271 -0
  329. package/src/prover/smt/solver/mbp/mbp-term-graph.ts +606 -0
  330. package/src/prover/smt/solver/model-based-opt.ts +844 -0
  331. package/src/prover/smt/solver/model-checker.ts +18 -27
  332. package/src/prover/smt/solver/model-evaluator.ts +188 -12
  333. package/src/prover/smt/solver/model-finder.ts +12 -18
  334. package/src/prover/smt/solver/model-generator.ts +56 -29
  335. package/src/prover/smt/solver/model-macro-solver.ts +49 -46
  336. package/src/prover/smt/solver/model-printer.ts +214 -0
  337. package/src/prover/smt/solver/mpf.ts +711 -0
  338. package/src/prover/smt/solver/mus.ts +51 -0
  339. package/src/prover/smt/solver/muz/dl-context.ts +404 -0
  340. package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +97 -0
  341. package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +167 -0
  342. package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +125 -0
  343. package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +299 -0
  344. package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +455 -0
  345. package/src/prover/smt/solver/muz/dl-mk-slice.ts +340 -0
  346. package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +163 -0
  347. package/src/prover/smt/solver/muz/dl-rule-set.ts +273 -0
  348. package/src/prover/smt/solver/muz/dl-rule-transformer.ts +123 -0
  349. package/src/prover/smt/solver/muz/dl-rule.ts +496 -0
  350. package/src/prover/smt/solver/muz/hnf.ts +201 -0
  351. package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +176 -0
  352. package/src/prover/smt/solver/muz/horn-tactic.ts +201 -0
  353. package/src/prover/smt/solver/muz/rule-properties.ts +337 -0
  354. package/src/prover/smt/solver/muz/spacer-context.ts +1406 -0
  355. package/src/prover/smt/solver/muz/spacer-dl-interface.ts +52 -0
  356. package/src/prover/smt/solver/muz/spacer-generalizers.ts +241 -0
  357. package/src/prover/smt/solver/muz/spacer-manager.ts +127 -0
  358. package/src/prover/smt/solver/muz/spacer-pdr.ts +218 -0
  359. package/src/prover/smt/solver/muz/spacer-prop-solver.ts +333 -0
  360. package/src/prover/smt/solver/muz/spacer-util.ts +282 -0
  361. package/src/prover/smt/solver/muz/substitution.ts +203 -0
  362. package/src/prover/smt/solver/nla2bv-tactic.ts +285 -0
  363. package/src/prover/smt/solver/nlqsat.ts +484 -0
  364. package/src/prover/smt/solver/nlsat/algebraic.ts +125 -12
  365. package/src/prover/smt/solver/nlsat/atoms.ts +20 -6
  366. package/src/prover/smt/solver/nlsat/evaluator.ts +0 -1
  367. package/src/prover/smt/solver/nlsat/explain.ts +63 -23
  368. package/src/prover/smt/solver/nlsat/interval-set.ts +1 -2
  369. package/src/prover/smt/solver/nlsat/levelwise.ts +3 -9
  370. package/src/prover/smt/solver/nlsat/mpbq.ts +45 -1
  371. package/src/prover/smt/solver/nlsat/polynomial.ts +13 -6
  372. package/src/prover/smt/solver/nlsat/solver.ts +236 -45
  373. package/src/prover/smt/solver/nlsat/transcendental-eval.ts +310 -0
  374. package/src/prover/smt/solver/nlsat/transcendentals.ts +367 -0
  375. package/src/prover/smt/solver/nlsat/types.ts +0 -2
  376. package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +1 -4
  377. package/src/prover/smt/solver/nlsat/upolynomial.ts +0 -2
  378. package/src/prover/smt/solver/nlsat-tactic.ts +82 -0
  379. package/src/prover/smt/solver/nnf.ts +105 -23
  380. package/src/prover/smt/solver/normalize-bounds.ts +53 -0
  381. package/src/prover/smt/solver/occf.ts +97 -0
  382. package/src/prover/smt/solver/opt-context.ts +787 -0
  383. package/src/prover/smt/solver/opt-nlsat.ts +375 -0
  384. package/src/prover/smt/solver/opt-pareto.ts +282 -0
  385. package/src/prover/smt/solver/opt-preprocess.ts +101 -0
  386. package/src/prover/smt/solver/opt-solver.ts +308 -0
  387. package/src/prover/smt/solver/opt-value.ts +55 -0
  388. package/src/prover/smt/solver/optsmt.ts +692 -0
  389. package/src/prover/smt/solver/parallel-tactic.ts +299 -0
  390. package/src/prover/smt/solver/pattern-inference.ts +19 -11
  391. package/src/prover/smt/solver/pb-rewriter.ts +284 -0
  392. package/src/prover/smt/solver/pb2bv-tactic.ts +540 -0
  393. package/src/prover/smt/solver/poly-rewriter.ts +202 -57
  394. package/src/prover/smt/solver/probes.ts +512 -0
  395. package/src/prover/smt/solver/propagate-values.ts +37 -21
  396. package/src/prover/smt/solver/proto-model.ts +648 -19
  397. package/src/prover/smt/solver/pull-quant.ts +28 -12
  398. package/src/prover/smt/solver/purify-arith.ts +632 -0
  399. package/src/prover/smt/solver/qe-arith-plugin.ts +1098 -0
  400. package/src/prover/smt/solver/qe-lite-der.ts +2 -3
  401. package/src/prover/smt/solver/qe-lite-fm.ts +3 -4
  402. package/src/prover/smt/solver/qe-lite.ts +37 -17
  403. package/src/prover/smt/solver/qe-mbp.ts +270 -0
  404. package/src/prover/smt/solver/qe.ts +1498 -0
  405. package/src/prover/smt/solver/qel.ts +25 -0
  406. package/src/prover/smt/solver/qi-queue.ts +0 -1
  407. package/src/prover/smt/solver/qsat.ts +814 -0
  408. package/src/prover/smt/solver/quant-hoist.ts +196 -0
  409. package/src/prover/smt/solver/quant-tactics.ts +16 -56
  410. package/src/prover/smt/solver/quantifier-analyzer.ts +19 -20
  411. package/src/prover/smt/solver/quantifier-manager.ts +8 -16
  412. package/src/prover/smt/solver/quasi-macros.ts +243 -0
  413. package/src/prover/smt/solver/random-gen.ts +0 -1
  414. package/src/prover/smt/solver/rational.ts +45 -1
  415. package/src/prover/smt/solver/recfun-decl-plugin.ts +261 -0
  416. package/src/prover/smt/solver/recfun-rewriter.ts +107 -0
  417. package/src/prover/smt/solver/reduce-args.ts +225 -0
  418. package/src/prover/smt/solver/reduce-bv-size.ts +119 -0
  419. package/src/prover/smt/solver/ref-vector.ts +0 -1
  420. package/src/prover/smt/solver/relevancy.ts +1 -2
  421. package/src/prover/smt/solver/rewriter-tpl.ts +77 -10
  422. package/src/prover/smt/solver/rewriter.ts +475 -36
  423. package/src/prover/smt/solver/rlimit.ts +38 -2
  424. package/src/prover/smt/solver/sat/asymm-branch.ts +325 -0
  425. package/src/prover/smt/solver/sat/big.ts +177 -0
  426. package/src/prover/smt/solver/sat/clause-use-list.ts +71 -0
  427. package/src/prover/smt/solver/sat/clause.ts +203 -0
  428. package/src/prover/smt/solver/sat/cleaner.ts +94 -0
  429. package/src/prover/smt/solver/sat/config.ts +122 -0
  430. package/src/prover/smt/solver/sat/consequences.ts +203 -0
  431. package/src/prover/smt/solver/sat/elim-eqs.ts +142 -0
  432. package/src/prover/smt/solver/sat/goal2sat.ts +526 -0
  433. package/src/prover/smt/solver/sat/inc-sat-solver.ts +378 -0
  434. package/src/prover/smt/solver/sat/model-converter.ts +136 -0
  435. package/src/prover/smt/solver/sat/pb-constraint.ts +261 -0
  436. package/src/prover/smt/solver/sat/pb-solver.ts +1577 -0
  437. package/src/prover/smt/solver/sat/probing.ts +170 -0
  438. package/src/prover/smt/solver/sat/sat-tactic.ts +43 -0
  439. package/src/prover/smt/solver/sat/sat2goal.ts +165 -0
  440. package/src/prover/smt/solver/sat/scc.ts +142 -0
  441. package/src/prover/smt/solver/sat/simplifier.ts +1618 -0
  442. package/src/prover/smt/solver/sat/solver.ts +2127 -0
  443. package/src/prover/smt/solver/sat/var-queue.ts +117 -0
  444. package/src/prover/smt/solver/sat/watch-list.ts +140 -0
  445. package/src/prover/smt/solver/search-tree.ts +284 -0
  446. package/src/prover/smt/solver/seq-axioms.ts +1010 -0
  447. package/src/prover/smt/solver/seq-decl-plugin.ts +819 -0
  448. package/src/prover/smt/solver/seq-derive.ts +1298 -0
  449. package/src/prover/smt/solver/seq-eq-approx.ts +236 -0
  450. package/src/prover/smt/solver/seq-eq-solver.ts +439 -0
  451. package/src/prover/smt/solver/seq-factory.ts +89 -0
  452. package/src/prover/smt/solver/seq-monadic.ts +728 -0
  453. package/src/prover/smt/solver/seq-range-predicate.ts +235 -0
  454. package/src/prover/smt/solver/seq-re-rewriter.ts +1170 -0
  455. package/src/prover/smt/solver/seq-re-util.ts +758 -0
  456. package/src/prover/smt/solver/seq-regex-bisim.ts +144 -0
  457. package/src/prover/smt/solver/seq-regex-live.ts +200 -0
  458. package/src/prover/smt/solver/seq-rewriter.ts +2402 -0
  459. package/src/prover/smt/solver/seq-skolem.ts +317 -0
  460. package/src/prover/smt/solver/seq-subset.ts +165 -0
  461. package/src/prover/smt/solver/seq-view-witness.ts +353 -0
  462. package/src/prover/smt/solver/smt-consequences.ts +297 -0
  463. package/src/prover/smt/solver/smt-kernel.ts +83 -0
  464. package/src/prover/smt/solver/smt-logics.ts +66 -0
  465. package/src/prover/smt/solver/smt-setup.ts +496 -0
  466. package/src/prover/smt/solver/smt2-printer.ts +765 -0
  467. package/src/prover/smt/solver/smtlib-parser.ts +3126 -316
  468. package/src/prover/smt/solver/smtlib-script.ts +1631 -0
  469. package/src/prover/smt/solver/solve-eqs.ts +929 -0
  470. package/src/prover/smt/solver/solver.ts +113 -22
  471. package/src/prover/smt/solver/static-features.ts +314 -0
  472. package/src/prover/smt/solver/sticky-generations.ts +0 -1
  473. package/src/prover/smt/solver/tactic.ts +1986 -0
  474. package/src/prover/smt/solver/term-enumeration.ts +205 -0
  475. package/src/prover/smt/solver/theory-array.ts +1240 -0
  476. package/src/prover/smt/solver/theory-bv.ts +1200 -0
  477. package/src/prover/smt/solver/theory-char.ts +355 -0
  478. package/src/prover/smt/solver/theory-datatype.ts +598 -0
  479. package/src/prover/smt/solver/theory-finite-set.ts +30 -0
  480. package/src/prover/smt/solver/theory-fpa.ts +389 -0
  481. package/src/prover/smt/solver/theory-lra-axioms.ts +53 -2
  482. package/src/prover/smt/solver/theory-lra-bounds.ts +31 -6
  483. package/src/prover/smt/solver/theory-lra-final-check.ts +56 -70
  484. package/src/prover/smt/solver/theory-lra-internalize.ts +94 -27
  485. package/src/prover/smt/solver/theory-lra-model.ts +20 -35
  486. package/src/prover/smt/solver/theory-lra-propagate.ts +24 -26
  487. package/src/prover/smt/solver/theory-lra-state.ts +6 -22
  488. package/src/prover/smt/solver/theory-lra.ts +188 -1
  489. package/src/prover/smt/solver/theory-pb.ts +934 -0
  490. package/src/prover/smt/solver/theory-polymorphism.ts +58 -0
  491. package/src/prover/smt/solver/theory-recfun.ts +307 -0
  492. package/src/prover/smt/solver/theory-seq-regex.ts +867 -0
  493. package/src/prover/smt/solver/theory-seq-solve.ts +1373 -0
  494. package/src/prover/smt/solver/theory-seq-state.ts +871 -0
  495. package/src/prover/smt/solver/theory-seq.ts +961 -0
  496. package/src/prover/smt/solver/theory.ts +189 -0
  497. package/src/prover/smt/solver/tseitin-cnf.ts +485 -0
  498. package/src/prover/smt/solver/var-subst.ts +36 -14
  499. package/src/prover/smt/table.ts +3 -2
  500. package/src/prover/smt/types.ts +146 -0
  501. package/src/prover/tlapm/cache.ts +50 -19
  502. package/src/prover/tlapm/tlapm.ts +15 -9
  503. package/src/prover/tlapm-library.ts +3208 -0
  504. package/src/prover/verdict.ts +9 -0
  505. package/src/prover/zenon/check/check.ts +1 -2
  506. package/src/prover/zenon/check/records.ts +1 -1
  507. package/src/prover/zenon/check/relations.ts +2 -1
  508. package/src/prover/zenon/check/rewrites.ts +2 -15
  509. package/src/prover/zenon/check/sets.ts +40 -58
  510. package/src/prover/zenon/check/terms.ts +1 -2
  511. package/src/prover/zenon/decide.ts +10 -7
  512. package/src/prover/zenon/encode.ts +0 -2
  513. package/src/prover/zenon/eqrel.ts +2 -2
  514. package/src/prover/zenon/equality-rules.ts +24 -2
  515. package/src/prover/zenon/expr.ts +28 -2
  516. package/src/prover/zenon/index-table.ts +11 -21
  517. package/src/prover/zenon/isar-case.ts +0 -2
  518. package/src/prover/zenon/isar.ts +35 -37
  519. package/src/prover/zenon/llproof.ts +2 -13
  520. package/src/prover/zenon/mltoll.ts +12 -30
  521. package/src/prover/zenon/node.ts +20 -5
  522. package/src/prover/zenon/parse.ts +9 -8
  523. package/src/prover/zenon/phrase.ts +0 -2
  524. package/src/prover/zenon/proof.ts +0 -2
  525. package/src/prover/zenon/propositional-rules.ts +0 -2
  526. package/src/prover/zenon/rules.ts +2 -3
  527. package/src/prover/zenon/search.ts +11 -19
  528. package/src/prover/zenon/tla/functions.ts +2 -4
  529. package/src/prover/zenon/tla/llproof.ts +9 -13
  530. package/src/prover/zenon/tla/records.ts +1 -8
  531. package/src/prover/zenon/tla/rewrites.ts +0 -2
  532. package/src/prover/zenon/tla/sets.ts +22 -22
  533. package/src/prover/zenon/tla/terms.ts +0 -2
  534. package/src/prover/zenon/tla/tla.ts +7 -8
  535. package/src/randomization.ts +1 -4
  536. package/src/resolve.ts +67 -143
  537. package/src/runtime.ts +15 -18
  538. package/src/sany/builtins.ts +1 -3
  539. package/src/sany/generation.ts +394 -0
  540. package/src/sany/generator-def-entries.ts +210 -0
  541. package/src/sany/generator-definitions.ts +686 -0
  542. package/src/sany/generator-expressions.ts +1100 -0
  543. package/src/sany/generator-proofs.ts +662 -0
  544. package/src/sany/generator.ts +160 -2683
  545. package/src/sany/levels.ts +5 -11
  546. package/src/sany/lexer.ts +57 -60
  547. package/src/sany/linter.ts +0 -3
  548. package/src/sany/nodes.ts +6 -13
  549. package/src/sany/report.ts +3 -6
  550. package/src/sany/selectors.ts +35 -38
  551. package/src/sany/xml.ts +23 -55
  552. package/src/search.ts +206 -44
  553. package/src/simulate.ts +202 -184
  554. package/src/spec-description.ts +56 -82
  555. package/src/standard-definitions.ts +4 -3
  556. package/src/standard-modules.ts +17 -44
  557. package/src/state-graph.ts +3 -17
  558. package/src/subexpressions.ts +38 -47
  559. package/src/substitution-levels.ts +5 -4
  560. package/src/successors.ts +20 -43
  561. package/src/symmetry.ts +6 -21
  562. package/src/tableau.ts +2 -2
  563. package/src/tlc/fingerprint.ts +96 -30
  564. package/src/tlc/jar-data.ts +0 -1
  565. package/src/tlc/messages.ts +22 -36
  566. package/src/tlc/order.ts +22 -47
  567. package/src/tlc/random.ts +22 -34
  568. package/src/tlc/replay.ts +21 -48
  569. package/src/tlc/summary.ts +64 -58
  570. package/src/tlc/tlc-operators.ts +6 -17
  571. package/src/tlc/tlcext-operators.ts +54 -26
  572. package/src/tlc/trace-spec.ts +26 -51
  573. package/src/tlc/value-stream.ts +9 -13
  574. package/src/tlc/version.ts +0 -1
  575. package/src/typed-tier.ts +6535 -0
  576. package/src/typescript/actions.ts +2 -4
  577. package/src/typescript/collections.ts +34 -20
  578. package/src/typescript/compile.ts +1 -3
  579. package/src/typescript/formula.ts +5 -3
  580. package/src/typescript/model.ts +4 -5
  581. package/src/typescript/steps.ts +20 -18
  582. package/src/values.ts +136 -338
  583. package/src/prover/isabelle/isar/statement.ts +0 -52
  584. package/src/prover/smt/solver/z3-license.txt +0 -10
  585. package/src/prover/tlaps-module.ts +0 -510
  586. package/src/prover/zenon/LICENSE +0 -32
@@ -0,0 +1,441 @@
1
+ // encode/n_rewrite.ml: elim_notmem, elim_bounds, apply_ext and simplify_sets, the rewrites of sets
2
+ // that tlapm's --debug flags rwsetext, rw and rw+ turn on.
3
+
4
+ import {
5
+ applyBuiltin,
6
+ at,
7
+ mapChildren,
8
+ mapHyp,
9
+ type Bound,
10
+ type BoundDomain,
11
+ type Builtin,
12
+ type Expr,
13
+ type Hyp,
14
+ type Sequent,
15
+ } from "../../obligations/expression";
16
+ import {
17
+ bumpBy,
18
+ consSubstitution,
19
+ shift,
20
+ shiftExpr,
21
+ substituteExpr,
22
+ substituteHyp,
23
+ type Substitution,
24
+ } from "../../obligations/substitution";
25
+ import type { Polarity } from "./extensionality";
26
+
27
+ const getBuiltin = (expression: Expr) =>
28
+ expression.kind === "Apply" && expression.operator.kind === "Internal"
29
+ ? expression.operator.builtin
30
+ : undefined;
31
+
32
+ const builtin = (name: Builtin, args: Expr[]): Expr => applyBuiltin(name, args, {});
33
+
34
+ const variable = (index: number): Expr => ({ kind: "Ix", index });
35
+
36
+ const NO_DOMAIN: BoundDomain = { kind: "NoDomain" };
37
+
38
+ const getUnbounded = (name: string): Bound => ({ name, level: "Constant", domain: NO_DOMAIN });
39
+
40
+ const mapHypExpressions = (hyp: Hyp, map: (expression: Expr) => Expr) => mapHyp(hyp, map, "all");
41
+
42
+ const elimNotmem = (expression: Expr): Expr => {
43
+ const inner = mapChildren(expression, elimNotmem);
44
+ if (inner.kind !== "Apply" || getBuiltin(inner) !== "Notmem") return inner;
45
+ return at(builtin("Neg", [builtin("Mem", inner.args)]), inner);
46
+ };
47
+
48
+ // Each bound's domain becomes a membership after the quantifier, the first bound's the farthest.
49
+ const elimBoundsQuantifier = (expression: Extract<Expr, { kind: "Quant" }>): Expr => {
50
+ const count = expression.bounds.length;
51
+ const domains = expression.bounds.reduce<(Expr | undefined)[]>((found, bound) => {
52
+ if (bound.domain.kind === "Domain")
53
+ return [...found, shiftExpr(count, elimBounds(bound.domain.expression))];
54
+ return [...found, bound.domain.kind === "Ditto" ? found.at(-1) : undefined];
55
+ }, []);
56
+ const memberships = domains.flatMap((domain, index) =>
57
+ domain === undefined ? [] : [builtin("Mem", [variable(count - index), domain])],
58
+ );
59
+ const body = elimBounds(expression.body);
60
+ const bounds = expression.bounds.map((bound) => ({ ...bound, domain: NO_DOMAIN }));
61
+ if (memberships.length === 0) return { ...expression, bounds, body };
62
+ const guarded =
63
+ expression.quantifier === "Exists"
64
+ ? ({ kind: "List", bullet: "And", items: [...memberships, body] } satisfies Expr)
65
+ : builtin("Implies", [
66
+ memberships.length === 1
67
+ ? memberships[0]
68
+ : { kind: "List", bullet: "And", items: memberships },
69
+ body,
70
+ ]);
71
+ return { ...expression, bounds, body: guarded };
72
+ };
73
+
74
+ const elimBoundsSequent = (sequent: Sequent): Sequent => {
75
+ const state = sequent.context.reduce<{ substitution: Substitution; context: Hyp[] }>(
76
+ (current, hyp) => {
77
+ if (hyp.kind !== "Fresh" || hyp.domain === undefined) {
78
+ const mapped = substituteHyp(current.substitution, hyp);
79
+ return {
80
+ substitution: bumpBy(1, current.substitution),
81
+ context: [...current.context, mapHypExpressions(mapped, elimBounds)],
82
+ };
83
+ }
84
+ const domain = elimBounds(substituteExpr(current.substitution, hyp.domain));
85
+ const fact: Hyp = {
86
+ kind: "Fact",
87
+ expression: builtin("Mem", [variable(1), shiftExpr(1, domain)]),
88
+ visibility: hyp.domainVisibility,
89
+ time: "Now",
90
+ };
91
+ return {
92
+ substitution: {
93
+ kind: "Compose",
94
+ outer: shift(1),
95
+ inner: bumpBy(1, current.substitution),
96
+ },
97
+ context: [...current.context, { ...hyp, domain: undefined }, fact],
98
+ };
99
+ },
100
+ { substitution: shift(0), context: [] },
101
+ );
102
+ return {
103
+ context: state.context,
104
+ active: elimBounds(substituteExpr(state.substitution, sequent.active)),
105
+ };
106
+ };
107
+
108
+ const elimBounds = (expression: Expr): Expr => {
109
+ if (expression.kind === "Quant") return elimBoundsQuantifier(expression);
110
+ if (expression.kind === "Sequent")
111
+ return { ...expression, sequent: elimBoundsSequent(expression.sequent) };
112
+ if (expression.kind === "Choose" && expression.domain !== undefined) {
113
+ const membership = builtin("Mem", [variable(1), shiftExpr(1, elimBounds(expression.domain))]);
114
+ return {
115
+ ...expression,
116
+ domain: undefined,
117
+ body: builtin("Conj", [membership, elimBounds(expression.body)]),
118
+ };
119
+ }
120
+ return mapChildren(expression, elimBounds);
121
+ };
122
+
123
+ const isSet = (expression: Expr) => {
124
+ switch (expression.kind) {
125
+ case "SetEnum":
126
+ case "SetSt":
127
+ case "SetOf":
128
+ case "Product":
129
+ case "Arrow":
130
+ case "Rect":
131
+ return true;
132
+ case "Internal":
133
+ return ["STRING", "BOOLEAN", "Nat", "Int"].includes(expression.builtin);
134
+ case "Apply":
135
+ return (
136
+ expression.args.length === 2 &&
137
+ ["Cap", "Cup", "Setminus", "Range"].includes(getBuiltin(expression) ?? "")
138
+ );
139
+ default:
140
+ return false;
141
+ }
142
+ };
143
+
144
+ const invert = (polarity: Polarity): Polarity =>
145
+ polarity === "Positive" ? "Negative" : polarity === "Negative" ? "Positive" : "Neither";
146
+
147
+ // Rewrite.rewrite_by_extensionality: \A x : x \in left <=> x \in right, or => for a subset.
148
+ const getExtensional = (connective: Builtin, left: Expr, right: Expr): Expr => ({
149
+ kind: "Quant",
150
+ quantifier: "Forall",
151
+ bounds: [getUnbounded("x")],
152
+ body: builtin(connective, [
153
+ builtin("Mem", [variable(1), shiftExpr(1, left)]),
154
+ builtin("Mem", [variable(1), shiftExpr(1, right)]),
155
+ ]),
156
+ });
157
+
158
+ type Visit = (polarity: Polarity, expression: Expr) => Expr;
159
+
160
+ // The visits of Expr.Visit.map that apply_ext and simplify_sets share: a sequent's hypotheses take
161
+ // the opposite polarity, and the arguments of an application take neither.
162
+ const visitLogic = (visit: Visit, polarity: Polarity, expression: Expr): Expr => {
163
+ if (expression.kind === "Sequent") {
164
+ const sequent = expression.sequent;
165
+ const context = sequent.context.map((hyp) =>
166
+ mapHypExpressions(hyp, (inner) => visit(invert(polarity), inner)),
167
+ );
168
+ return { ...expression, sequent: { context, active: visit(polarity, sequent.active) } };
169
+ }
170
+ if (expression.kind !== "Apply")
171
+ return mapChildren(expression, (inner) => visit(polarity, inner));
172
+ const args = expression.args;
173
+ switch (getBuiltin(expression)) {
174
+ case "Implies":
175
+ return { ...expression, args: [visit(invert(polarity), args[0]), visit(polarity, args[1])] };
176
+ case "Equiv":
177
+ return at(
178
+ builtin("Conj", [
179
+ builtin("Implies", [visit(invert(polarity), args[0]), visit(polarity, args[1])]),
180
+ builtin("Implies", [visit(invert(polarity), args[1]), visit(polarity, args[0])]),
181
+ ]),
182
+ expression,
183
+ );
184
+ case "Neg":
185
+ return { ...expression, args: [visit(invert(polarity), args[0])] };
186
+ default:
187
+ return { ...expression, args: args.map((arg) => visit("Neither", arg)) };
188
+ }
189
+ };
190
+
191
+ // Rewrite.apply_ext_visitor. Synthesize gives every equality the sort Idv, which apply_ext reads
192
+ // back as its type parameter. It finds none on \subseteq and raises an internal error, so this
193
+ // rewrites \subseteq over Idv.
194
+ const applyExt: Visit = (polarity, expression) => {
195
+ if (expression.kind === "Apply" && expression.args.length === 2) {
196
+ const left = expression.args[0];
197
+ const right = expression.args[1];
198
+ const isSetEquality = isSet(left) || isSet(right);
199
+ const kind = getBuiltin(expression);
200
+ if (kind === "Eq" && polarity === "Positive" && isSetEquality)
201
+ return at(
202
+ getExtensional("Equiv", applyExt(polarity, left), applyExt(polarity, right)),
203
+ expression,
204
+ );
205
+ if (kind === "Neq" && polarity === "Negative" && isSetEquality)
206
+ return at(
207
+ builtin("Neg", [
208
+ getExtensional("Equiv", applyExt(polarity, left), applyExt(polarity, right)),
209
+ ]),
210
+ expression,
211
+ );
212
+ if (kind === "Subseteq" && polarity === "Positive")
213
+ return at(
214
+ getExtensional("Implies", applyExt(polarity, left), applyExt(polarity, right)),
215
+ expression,
216
+ );
217
+ if (kind === "Conj" || kind === "Disj")
218
+ return { ...expression, args: [applyExt(polarity, left), applyExt(polarity, right)] };
219
+ }
220
+ return visitLogic(applyExt, polarity, expression);
221
+ };
222
+
223
+ const SET_LIMIT = 10;
224
+
225
+ const getMembership = (polarity: Polarity, element: Expr, set: Expr): Expr | undefined => {
226
+ const visit = (inner: Expr) => simplifySet(polarity, inner);
227
+ const mem = (left: Expr, right: Expr) => builtin("Mem", [left, right]);
228
+ switch (set.kind) {
229
+ case "SetEnum": {
230
+ if (set.elements.length === 0) return { kind: "Internal", builtin: "FALSE" };
231
+ const left = visit(element);
232
+ const equalities = set.elements.map((inner) => builtin("Eq", [left, visit(inner)]));
233
+ return equalities.length === 1
234
+ ? equalities[0]
235
+ : { kind: "List", bullet: "Or", items: equalities };
236
+ }
237
+ case "SetSt": {
238
+ const left = visit(element);
239
+ const domain = visit(set.domain);
240
+ const body = visit(set.body);
241
+ return builtin("Conj", [
242
+ mem(left, domain),
243
+ substituteExpr(consSubstitution(left, shift(0)), body),
244
+ ]);
245
+ }
246
+ case "SetOf": {
247
+ const left = visit(element);
248
+ const domains = set.bounds
249
+ .map((bound) =>
250
+ bound.domain.kind === "Domain" ? visit(bound.domain.expression) : undefined,
251
+ )
252
+ .reduce<Expr[]>((found, domain) => [...found, domain ?? found[found.length - 1]], []);
253
+ const count = set.bounds.length;
254
+ return {
255
+ kind: "Quant",
256
+ quantifier: "Exists",
257
+ bounds: set.bounds.map((bound) => getUnbounded(bound.name)),
258
+ body: {
259
+ kind: "List",
260
+ bullet: "And",
261
+ items: [
262
+ builtin("Eq", [shiftExpr(count, left), visit(set.element)]),
263
+ // tlapm pairs the first domain with Ix 1, the last bound, so this pairs each with its own.
264
+ ...domains.map((domain, index) =>
265
+ mem(variable(count - index), shiftExpr(count, domain)),
266
+ ),
267
+ ],
268
+ },
269
+ };
270
+ }
271
+ case "Arrow": {
272
+ const left = visit(element);
273
+ const domain = visit(set.domain);
274
+ const range = visit(set.range);
275
+ return {
276
+ kind: "List",
277
+ bullet: "And",
278
+ items: [
279
+ { kind: "Apply", operator: { kind: "Opaque", name: "IsAFcn" }, args: [left] },
280
+ builtin("Eq", [builtin("DOMAIN", [left]), domain]),
281
+ {
282
+ kind: "Quant",
283
+ quantifier: "Forall",
284
+ bounds: [getUnbounded("x")],
285
+ body: builtin("Implies", [
286
+ mem(variable(1), shiftExpr(1, domain)),
287
+ mem(
288
+ { kind: "FcnApp", function: shiftExpr(1, left), args: [variable(1)] },
289
+ shiftExpr(1, range),
290
+ ),
291
+ ]),
292
+ },
293
+ ],
294
+ };
295
+ }
296
+ case "Product": {
297
+ const left = visit(element);
298
+ const factors = set.factors.map(visit);
299
+ const component = (index: number): Expr => ({
300
+ kind: "FcnApp",
301
+ function: left,
302
+ args: [{ kind: "Num", integer: String(index + 1), fraction: "" }],
303
+ });
304
+ return {
305
+ kind: "List",
306
+ bullet: "And",
307
+ items: [
308
+ builtin("Eq", [
309
+ left,
310
+ { kind: "Tuple", elements: factors.map((_, index) => component(index)) },
311
+ ]),
312
+ ...factors.map((factor, index) => mem(component(index), factor)),
313
+ ],
314
+ };
315
+ }
316
+ case "Rect": {
317
+ const left = visit(element);
318
+ const fields = set.fields.map((field) => ({ name: field.name, value: visit(field.value) }));
319
+ const dot = (field: string): Expr => ({ kind: "Dot", expression: left, field });
320
+ return {
321
+ kind: "List",
322
+ bullet: "And",
323
+ items: [
324
+ builtin("Eq", [
325
+ left,
326
+ {
327
+ kind: "Record",
328
+ fields: fields.map((field) => ({ name: field.name, value: dot(field.name) })),
329
+ },
330
+ ]),
331
+ ...fields.map((field) => mem(dot(field.name), field.value)),
332
+ ],
333
+ };
334
+ }
335
+ case "Internal":
336
+ if (set.builtin !== "Nat") return undefined;
337
+ return builtin("Conj", [
338
+ mem(visit(element), { kind: "Internal", builtin: "Int" }),
339
+ builtin("Lteq", [{ kind: "Num", integer: "0", fraction: "" }, visit(element)]),
340
+ ]);
341
+ case "Apply": {
342
+ const args = set.args;
343
+ const kind = getBuiltin(set);
344
+ if (kind === "SUBSET" && args.length === 1)
345
+ return {
346
+ kind: "Quant",
347
+ quantifier: "Forall",
348
+ bounds: [getUnbounded("v")],
349
+ body: builtin("Implies", [
350
+ mem(variable(1), shiftExpr(1, visit(element))),
351
+ mem(variable(1), shiftExpr(1, visit(args[0]))),
352
+ ]),
353
+ };
354
+ if (kind === "UNION" && args.length === 1)
355
+ return {
356
+ kind: "Quant",
357
+ quantifier: "Exists",
358
+ bounds: [getUnbounded("v")],
359
+ body: builtin("Conj", [
360
+ mem(variable(1), shiftExpr(1, visit(args[0]))),
361
+ mem(shiftExpr(1, visit(element)), variable(1)),
362
+ ]),
363
+ };
364
+ if (args.length !== 2) return undefined;
365
+ const left = visit(element);
366
+ if (kind === "Cup")
367
+ return builtin("Disj", [mem(left, visit(args[0])), mem(left, visit(args[1]))]);
368
+ if (kind === "Cap")
369
+ return builtin("Conj", [mem(left, visit(args[0])), mem(left, visit(args[1]))]);
370
+ if (kind === "Setminus")
371
+ return builtin("Conj", [
372
+ mem(left, visit(args[0])),
373
+ builtin("Neg", [mem(left, visit(args[1]))]),
374
+ ]);
375
+ if (kind === "Range")
376
+ return {
377
+ kind: "List",
378
+ bullet: "And",
379
+ items: [
380
+ mem(left, { kind: "Internal", builtin: "Int" }),
381
+ builtin("Lteq", [visit(args[0]), left]),
382
+ builtin("Lteq", [left, visit(args[1])]),
383
+ ],
384
+ };
385
+ return undefined;
386
+ }
387
+ default:
388
+ return undefined;
389
+ }
390
+ };
391
+
392
+ // Rewrite.simplify_sets_visitor, which rewrites a set equality where it must be proved by both
393
+ // inclusions. tlapm writes only the first one there, so its rewrite proves equalities that are
394
+ // false.
395
+ const simplifySet: Visit = (polarity, expression) => {
396
+ if (expression.kind === "Apply" && expression.args.length === 2) {
397
+ const left = expression.args[0];
398
+ const right = expression.args[1];
399
+ const kind = getBuiltin(expression);
400
+ const membership = kind === "Mem" ? getMembership(polarity, left, right) : undefined;
401
+ if (membership !== undefined) return at(membership, expression);
402
+ const isSetEquality = isSet(left) || isSet(right);
403
+ if (kind === "Eq" && polarity === "Positive" && isSetEquality)
404
+ return at(
405
+ getExtensional("Equiv", simplifySet(polarity, left), simplifySet(polarity, right)),
406
+ expression,
407
+ );
408
+ if (kind === "Neq" && polarity === "Negative" && isSetEquality)
409
+ return at(
410
+ builtin("Neg", [
411
+ getExtensional("Equiv", simplifySet(polarity, left), simplifySet(polarity, right)),
412
+ ]),
413
+ expression,
414
+ );
415
+ if (kind === "Subseteq" && polarity === "Positive")
416
+ return at(
417
+ getExtensional("Implies", simplifySet(polarity, left), simplifySet(polarity, right)),
418
+ expression,
419
+ );
420
+ }
421
+ return visitLogic(simplifySet, polarity, expression);
422
+ };
423
+
424
+ // Smtlib.preprocess runs elim_notmem and elim_bounds always, but they only change the encoding
425
+ // once a rewrite of sets can see the memberships they make.
426
+ export const simplifySets = (sequent: Sequent, rewriteLevel: number): Sequent => {
427
+ if (rewriteLevel === 0) return sequent;
428
+ const bounded = elimBoundsSequent({
429
+ context: sequent.context.map((hyp) => mapHypExpressions(hyp, elimNotmem)),
430
+ active: elimNotmem(sequent.active),
431
+ });
432
+ const root: Expr = { kind: "Sequent", sequent: bounded };
433
+ const simplified =
434
+ rewriteLevel === 1
435
+ ? applyExt("Positive", root)
436
+ : Array.from({ length: SET_LIMIT }).reduce<Expr>(
437
+ (current) => simplifySet("Positive", current),
438
+ root,
439
+ );
440
+ return simplified.kind === "Sequent" ? simplified.sequent : bounded;
441
+ };
@@ -0,0 +1,61 @@
1
+ import { SmtTacticError } from "../../../errors";
2
+ import type { AstManager } from "./ast";
3
+ import { convertAckrModel } from "./ackr-model-converter";
4
+ import type { Goal } from "./goal";
5
+ import { type AckrSolver, Lackr } from "./lackr";
6
+ import { L_FALSE, L_TRUE, L_UNDEF } from "./lbool";
7
+ import type { RewriterOptions } from "./rewriter";
8
+
9
+ const checkGoal = (goal: Goal, name: string) => {
10
+ if (goal.isCoresEnabled)
11
+ throw new SmtTacticError(`${name} does not support unsat core production`);
12
+ if (goal.isProofsEnabled) throw new SmtTacticError(`${name} does not support proof production`);
13
+ };
14
+
15
+ const getEmptyCopy = (goal: Goal) => {
16
+ const copied = goal.copy();
17
+ copied.reset();
18
+ return copied;
19
+ };
20
+
21
+ export const runAckermannizeBv =
22
+ (manager: AstManager, rewriterOptions: RewriterOptions, lemmaLimit: number) => (goal: Goal) => {
23
+ checkGoal(goal, "ackermannize");
24
+ const lackr = new Lackr(manager, [...goal.forms.items], rewriterOptions, true);
25
+ const result = getEmptyCopy(goal);
26
+ if (!lackr.mkAckermann(result, lemmaLimit)) {
27
+ lackr.release(false);
28
+ return [goal];
29
+ }
30
+ const info = lackr.info;
31
+ result.addModelConversion((model) => convertAckrModel(info, undefined, model));
32
+ result.depth++;
33
+ lackr.release(true);
34
+ return [result];
35
+ };
36
+
37
+ export const createQfufbvAckrTactic =
38
+ (
39
+ manager: AstManager,
40
+ rewriterOptions: RewriterOptions,
41
+ isEager: boolean,
42
+ createSolver: () => AckrSolver,
43
+ ) =>
44
+ (goal: Goal) => {
45
+ checkGoal(goal, "qfufbv_ackr");
46
+ const solver = createSolver();
47
+ const lackr = new Lackr(manager, [...goal.forms.items], rewriterOptions, isEager, solver);
48
+ const status = lackr.solve();
49
+ const result = getEmptyCopy(goal);
50
+ if (status === L_FALSE) result.assert(manager.falseExpr);
51
+ if (status === L_UNDEF) goal.depth++;
52
+ const model = lackr.model;
53
+ if (status === L_TRUE && model !== undefined) {
54
+ model.incRef();
55
+ const info = lackr.info;
56
+ result.addModelConversion((converted) => convertAckrModel(info, model, converted));
57
+ }
58
+ lackr.release(status === L_TRUE);
59
+ solver.release();
60
+ return [status === L_UNDEF ? goal : result];
61
+ };
@@ -0,0 +1,179 @@
1
+ import {
2
+ type AstManager,
3
+ FAMILY_USER,
4
+ KIND_APP,
5
+ KIND_QUANTIFIER,
6
+ OP_BSDIV0,
7
+ OP_BSMOD0,
8
+ OP_BSREM0,
9
+ OP_BUDIV0,
10
+ OP_BUREM0,
11
+ OP_DIV0,
12
+ OP_IDIV0,
13
+ OP_MOD0,
14
+ OP_POWER0,
15
+ OP_SELECT,
16
+ OP_SEQ_NTH_U,
17
+ } from "./ast";
18
+ import type { Goal } from "./goal";
19
+ import { ObjHashtable, ObjMap } from "./hashtable";
20
+ import { RewriterTpl } from "./rewriter-tpl";
21
+
22
+ export interface AppOcc {
23
+ constArgs: ObjHashtable;
24
+ varArgs: ObjHashtable;
25
+ }
26
+
27
+ const CONSIDERED_UNINTERPRETED_OPS = new Set([
28
+ OP_DIV0,
29
+ OP_IDIV0,
30
+ OP_MOD0,
31
+ OP_POWER0,
32
+ OP_BSDIV0,
33
+ OP_BUDIV0,
34
+ OP_BSREM0,
35
+ OP_BUREM0,
36
+ OP_BSMOD0,
37
+ OP_SEQ_NTH_U,
38
+ ]);
39
+
40
+ export const isUninterpFn = (manager: AstManager, app: number) =>
41
+ manager.getFamily(app) === FAMILY_USER || CONSIDERED_UNINTERPRETED_OPS.has(manager.getOp(app));
42
+
43
+ export const isAckrSelect = (manager: AstManager, app: number) =>
44
+ manager.getOp(app) === OP_SELECT && manager.isUninterpretedConst(manager.getArg(app, 0));
45
+
46
+ export const createFun2Terms = (manager: AstManager) =>
47
+ new ObjMap<AppOcc>((decl) => manager.getDeclHash(decl));
48
+
49
+ export const createSel2Terms = (manager: AstManager) =>
50
+ new ObjMap<AppOcc>((expr) => manager.hashes[expr]);
51
+
52
+ export const markNonSelect = (manager: AstManager, app: number, nonSelect: Set<number>) => {
53
+ if (manager.getOp(app) !== OP_SELECT) {
54
+ for (const arg of manager.getArgs(app)) nonSelect.add(arg);
55
+ return;
56
+ }
57
+ const visited = new Set<number>();
58
+ const todo = manager.getArgs(app).slice(1);
59
+ for (let expr = todo.pop(); expr !== undefined; expr = todo.pop()) {
60
+ if (visited.has(expr)) continue;
61
+ visited.add(expr);
62
+ nonSelect.add(expr);
63
+ if (manager.kinds[expr] === KIND_APP) manager.pushArgs(expr, todo);
64
+ }
65
+ };
66
+
67
+ export const pruneNonMarked = (occs: ObjMap<AppOcc>, marked: Set<number>) => {
68
+ const pruned = [...occs.keys()].filter((key) => marked.has(key));
69
+ for (const key of pruned) occs.delete(key);
70
+ };
71
+
72
+ // Z3 tests only bit 16 of the count, so a larger count without that bit overflows there.
73
+ const getPairBound = (count: number) => (count >= 1 << 16 ? Infinity : (count * (count - 1)) / 2);
74
+
75
+ export const calculateLemmaBound = (fun2terms: ObjMap<AppOcc>, sel2terms: ObjMap<AppOcc>) => {
76
+ let total = 0;
77
+ for (const occs of [fun2terms, sel2terms])
78
+ for (const entry of occs) {
79
+ total += getPairBound(entry[1].varArgs.size);
80
+ total += entry[1].constArgs.size * entry[1].varArgs.size;
81
+ }
82
+ return total;
83
+ };
84
+
85
+ export const insertTerm = (
86
+ manager: AstManager,
87
+ fun2terms: ObjMap<AppOcc>,
88
+ sel2terms: ObjMap<AppOcc>,
89
+ app: number,
90
+ ) => {
91
+ const numArgs = manager.getNumArgs(app);
92
+ if (numArgs === 0) return;
93
+ const isSelect = isAckrSelect(manager, app);
94
+ if (!isSelect && !isUninterpFn(manager, app)) return;
95
+ const occs = isSelect ? sel2terms : fun2terms;
96
+ const key = isSelect ? manager.getArg(app, 0) : manager.decls[app];
97
+ const existing = occs.get(key);
98
+ const occ = existing ?? {
99
+ constArgs: new ObjHashtable((expr) => manager.hashes[expr]),
100
+ varArgs: new ObjHashtable((expr) => manager.hashes[expr]),
101
+ };
102
+ if (existing === undefined) occs.set(key, occ);
103
+ let isConstArgs = isSelect || manager.isUniqueValue(manager.getArg(app, 0));
104
+ for (let index = 1; isConstArgs && index < numArgs; index++)
105
+ isConstArgs = manager.isUniqueValue(manager.getArg(app, index));
106
+ (isConstArgs ? occ.constArgs : occ.varArgs).add(app);
107
+ };
108
+
109
+ export const getAckrBound = (goal: Goal) => {
110
+ const manager = goal.manager;
111
+ const fun2terms = createFun2Terms(manager);
112
+ const sel2terms = createSel2Terms(manager);
113
+ const nonSelect = new Set<number>();
114
+ const visited = new Set<number>();
115
+ const todo = [...goal.forms.items];
116
+ for (let expr = todo.pop(); expr !== undefined; expr = todo.pop()) {
117
+ if (visited.has(expr)) continue;
118
+ visited.add(expr);
119
+ if (manager.kinds[expr] === KIND_QUANTIFIER) todo.push(manager.getQuantifier(expr).body);
120
+ if (manager.kinds[expr] !== KIND_APP) continue;
121
+ markNonSelect(manager, expr, nonSelect);
122
+ insertTerm(manager, fun2terms, sel2terms, expr);
123
+ manager.pushArgs(expr, todo);
124
+ }
125
+ pruneNonMarked(sel2terms, nonSelect);
126
+ return calculateLemmaBound(fun2terms, sel2terms);
127
+ };
128
+
129
+ class AbstractionReplacer extends RewriterTpl {
130
+ constructor(
131
+ manager: AstManager,
132
+ private termToConst: ObjMap<number>,
133
+ ) {
134
+ super(manager);
135
+ }
136
+
137
+ getSubst(expr: number) {
138
+ return this.termToConst.get(expr);
139
+ }
140
+ }
141
+
142
+ export class AckrInfo {
143
+ private termToConst: ObjMap<number>;
144
+ private constToTerm = new Map<number, number>();
145
+ private replacer: AbstractionReplacer;
146
+
147
+ constructor(private manager: AstManager) {
148
+ this.termToConst = new ObjMap((expr) => manager.hashes[expr]);
149
+ this.replacer = new AbstractionReplacer(manager, this.termToConst);
150
+ }
151
+
152
+ setAbstr(term: number, constant: number) {
153
+ this.termToConst.set(term, constant);
154
+ this.constToTerm.set(this.manager.decls[constant], term);
155
+ this.manager.incRef(term);
156
+ this.manager.incRef(constant);
157
+ }
158
+
159
+ // The result comes with a reference.
160
+ abstract(expr: number) {
161
+ return this.replacer.rewrite(expr);
162
+ }
163
+
164
+ findTerm(decl: number) {
165
+ return this.constToTerm.get(decl);
166
+ }
167
+
168
+ getAbstr(term: number) {
169
+ return this.termToConst.get(term) as number;
170
+ }
171
+
172
+ release() {
173
+ for (const entry of this.termToConst) {
174
+ this.manager.decRef(entry[0]);
175
+ this.manager.decRef(entry[1]);
176
+ }
177
+ this.replacer.release();
178
+ }
179
+ }