tla-ts 0.0.4-dev.702eb98 → 0.0.4-dev.7714e32

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 (382) hide show
  1. package/README.md +32 -6
  2. package/dist/cli.cjs +1 -1
  3. package/dist/cli.js +1 -1
  4. package/dist/deciders.cjs +27 -27
  5. package/dist/deciders.js +34 -34
  6. package/dist/index.cjs +1 -1
  7. package/dist/index.d.cts +12 -14
  8. package/dist/index.d.ts +12 -14
  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 +516 -25
  15. package/dist/prove.js +518 -27
  16. package/dist/run.cjs +45 -0
  17. package/dist/run.js +45 -0
  18. package/dist/tlapm.cjs +2 -2
  19. package/dist/tlapm.js +2 -2
  20. package/dist/transfer.cjs +76 -86
  21. package/dist/transfer.js +73 -83
  22. package/dist/worker.cjs +6 -6
  23. package/dist/worker.js +6 -6
  24. package/package.json +1 -1
  25. package/src/ast.ts +2 -2
  26. package/src/bags.ts +22 -23
  27. package/src/builtins.ts +16 -8
  28. package/src/check.ts +131 -1154
  29. package/src/{cli-options.ts → cli/options.ts} +54 -9
  30. package/src/cli/run.ts +63 -0
  31. package/src/cli/shared.ts +106 -0
  32. package/src/cli/tlapm.ts +374 -0
  33. package/src/{run-cli.ts → cli/tlc.ts} +112 -761
  34. package/src/cli/xml-exporter.ts +221 -0
  35. package/src/cli.ts +1 -1
  36. package/src/codegen.ts +17 -15
  37. package/src/config.ts +5 -5
  38. package/src/dependencies.ts +4 -6
  39. package/src/environment.ts +55 -60
  40. package/src/errors.ts +12 -36
  41. package/src/evaluate.ts +81 -101
  42. package/src/exit-codes.ts +1 -1
  43. package/src/fingerprints.ts +3 -3
  44. package/src/index.ts +2 -2
  45. package/src/instances.ts +56 -46
  46. package/src/java-overrides.ts +79 -41
  47. package/src/json.ts +31 -36
  48. package/src/levels.ts +10 -13
  49. package/src/{live-check.ts → liveness-checker.ts} +169 -142
  50. package/src/liveness.ts +38 -34
  51. package/src/obligations/action.ts +58 -105
  52. package/src/obligations/{anon.ts → anonymize.ts} +44 -52
  53. package/src/obligations/equality.ts +260 -0
  54. package/src/obligations/expression.ts +42 -530
  55. package/src/obligations/format.ts +7 -8
  56. package/src/obligations/generate.ts +93 -783
  57. package/src/obligations/index.ts +23 -23
  58. package/src/obligations/levels.ts +38 -44
  59. package/src/obligations/module.ts +106 -729
  60. package/src/obligations/normalize.ts +554 -0
  61. package/src/obligations/operators.ts +176 -0
  62. package/src/obligations/pragma.ts +35 -29
  63. package/src/obligations/printer.ts +98 -209
  64. package/src/obligations/proof.ts +0 -1
  65. package/src/obligations/regroup.ts +100 -0
  66. package/src/obligations/simplify.ts +668 -0
  67. package/src/obligations/source.ts +92 -192
  68. package/src/obligations/{deref.ts → subexpression.ts} +82 -113
  69. package/src/obligations/substitution.ts +261 -0
  70. package/src/obligations/temporal.ts +32 -30
  71. package/src/obligations/tuples.ts +37 -53
  72. package/src/parallel-worker.ts +37 -33
  73. package/src/parallel.ts +30 -24
  74. package/src/parser.ts +67 -74
  75. package/src/{pcal-ast.ts → pcal/ast.ts} +2 -17
  76. package/src/{pcal-parse.ts → pcal/parse.ts} +28 -64
  77. package/src/{pcal-tokenize.ts → pcal/tokenize.ts} +10 -39
  78. package/src/{pcal-translate.ts → pcal/translate.ts} +30 -109
  79. package/src/{pcal-validate.ts → pcal/validate.ts} +10 -20
  80. package/src/{prove → prover}/decide-pool.ts +14 -19
  81. package/src/{prove → prover}/deciders.ts +7 -1
  82. package/src/{obligations/pickle.ts → prover/first-order.ts} +79 -4
  83. package/src/{prove → prover}/isabelle/decide.ts +3 -6
  84. package/src/{prove → prover}/isabelle/encode.ts +106 -138
  85. package/src/{prove → prover}/isabelle/isar/inner-syntax.ts +1 -1
  86. package/src/{prove → prover}/isabelle/isar/method.ts +3 -3
  87. package/src/{prove → prover}/isabelle/isar/type-check.ts +1 -1
  88. package/src/{prove → prover}/isabelle/provers/blast/blast.ts +1 -1
  89. package/src/{prove → prover}/isabelle/provers/blast/branch.ts +1 -1
  90. package/src/{prove → prover}/isabelle/provers/blast/term.ts +3 -4
  91. package/src/{prove → prover}/isabelle/provers/clasimp.ts +1 -1
  92. package/src/{prove → prover}/isabelle/provers/classical.ts +3 -3
  93. package/src/{prove → prover}/isabelle/provers/hypsubst.ts +1 -9
  94. package/src/{prove → prover}/isabelle/pure/conv.ts +1 -1
  95. package/src/{prove → prover}/isabelle/pure/drule.ts +2 -2
  96. package/src/{prove → prover}/isabelle/pure/envir.ts +3 -35
  97. package/src/{prove → prover}/isabelle/pure/logic.ts +4 -76
  98. package/src/{prove → prover}/isabelle/pure/name.ts +1 -13
  99. package/src/{prove → prover}/isabelle/pure/net.ts +2 -49
  100. package/src/{prove → prover}/isabelle/pure/pattern.ts +3 -22
  101. package/src/{prove → prover}/isabelle/pure/raw-simplifier.ts +3 -18
  102. package/src/{prove → prover}/isabelle/pure/seq.ts +0 -23
  103. package/src/{prove → prover}/isabelle/pure/simplifier.ts +2 -8
  104. package/src/{prove → prover}/isabelle/pure/table.ts +1 -8
  105. package/src/{prove → prover}/isabelle/pure/tactic.ts +5 -113
  106. package/src/{prove → prover}/isabelle/pure/tactical.ts +1 -84
  107. package/src/{prove → prover}/isabelle/pure/term-ord.ts +1 -55
  108. package/src/{prove → prover}/isabelle/pure/term.ts +8 -128
  109. package/src/{prove → prover}/isabelle/pure/thm.ts +4 -27
  110. package/src/{prove → prover}/isabelle/pure/type.ts +0 -12
  111. package/src/{prove → prover}/isabelle/pure/unify.ts +1 -1
  112. package/src/{prove → prover}/isabelle/tla/classical-setup.ts +1 -1
  113. package/src/{prove → prover}/ocaml.ts +1 -1
  114. package/src/{prove → prover}/prep/action.ts +54 -66
  115. package/src/{prove → prover}/prep/enabled-axioms.ts +2 -2
  116. package/src/{prove → prover}/prep/fingerprint.ts +3 -3
  117. package/src/{prove → prover}/prep/level-comparison.ts +15 -38
  118. package/src/{prove → prover}/prep/md5.ts +2 -9
  119. package/src/{prove/prep/pragma.ts → prover/prep/methods.ts} +4 -4
  120. package/src/prover/prep/normalize.ts +309 -0
  121. package/src/{prove → prover}/prove-worker.ts +4 -11
  122. package/src/prover/prove.ts +492 -0
  123. package/src/{prove → prover}/ptl/encode.ts +19 -31
  124. package/src/{prove → prover}/smt/axioms.ts +78 -79
  125. package/src/{prove → prover}/smt/data.ts +16 -45
  126. package/src/{prove → prover}/smt/encode.ts +134 -28
  127. package/src/{prove → prover}/smt/extensionality.ts +14 -12
  128. package/src/{prove → prover}/smt/flatten.ts +3 -18
  129. package/src/{prove → prover}/smt/format.ts +14 -3
  130. package/src/{prove → prover}/smt/instances.ts +4 -5
  131. package/src/{prove → prover}/smt/rewrite.ts +41 -59
  132. package/src/{prove → prover}/smt/solver/ast-util.ts +0 -56
  133. package/src/{prove → prover}/smt/solver/case-split-queue.ts +1 -1
  134. package/src/{prove → prover}/smt/solver/enode.ts +1 -1
  135. package/src/{prove → prover}/smt/solver/lp/dep-intervals.ts +0 -14
  136. package/src/{prove → prover}/smt/solver/model-macro-solver.ts +1 -1
  137. package/src/{prove → prover}/smt/solver/nlsat/algebraic.ts +3 -3
  138. package/src/{prove → prover}/smt/solver/nlsat/atoms.ts +1 -1
  139. package/src/{prove → prover}/smt/solver/nlsat/explain.ts +1 -1
  140. package/src/{prove → prover}/smt/solver/nlsat/interval-set.ts +1 -1
  141. package/src/{prove → prover}/smt/solver/nlsat/levelwise.ts +4 -7
  142. package/src/{prove → prover}/smt/solver/nlsat/polynomial.ts +4 -4
  143. package/src/{prove → prover}/smt/solver/nlsat/upolynomial.ts +2 -2
  144. package/src/{prove → prover}/smt/solver/pattern-inference.ts +1 -1
  145. package/src/{prove → prover}/smt/solver/relevancy.ts +2 -2
  146. package/src/{prove → prover}/smt/solver/rewriter.ts +1 -1
  147. package/src/{prove → prover}/smt/solver/solver.ts +2 -2
  148. package/src/prover/tlapm/cache.ts +236 -0
  149. package/src/prover/tlapm/ocaml-marshal.ts +166 -0
  150. package/src/{prove → prover}/tlapm/tlapm.ts +1 -2
  151. package/src/prover/verdict.ts +13 -0
  152. package/src/{prove → prover}/zenon/decide.ts +5 -11
  153. package/src/{prove → prover}/zenon/encode.ts +40 -106
  154. package/src/{prove → prover}/zenon/eqrel.ts +1 -1
  155. package/src/{prove → prover}/zenon/equality-rules.ts +1 -1
  156. package/src/{prove → prover}/zenon/expr.ts +2 -2
  157. package/src/{prove → prover}/zenon/index-table.ts +1 -1
  158. package/src/{prove → prover}/zenon/isar.ts +1 -1
  159. package/src/{prove → prover}/zenon/llproof.ts +1 -1
  160. package/src/{prove → prover}/zenon/mltoll.ts +1 -1
  161. package/src/{prove → prover}/zenon/node.ts +1 -1
  162. package/src/{prove → prover}/zenon/search.ts +1 -1
  163. package/src/{prove → prover}/zenon/tla/terms.ts +1 -20
  164. package/src/{prove → prover}/zenon/tla/tla.ts +1 -1
  165. package/src/randomization.ts +19 -24
  166. package/src/resolve.ts +15 -22
  167. package/src/runtime.ts +8 -8
  168. package/src/{sany-builtins.ts → sany/builtins.ts} +1 -1
  169. package/src/{sany-generator.ts → sany/generator.ts} +38 -55
  170. package/src/{sany-levels.ts → sany/levels.ts} +45 -48
  171. package/src/{sany-lexer.ts → sany/lexer.ts} +2 -3
  172. package/src/{sany-linter.ts → sany/linter.ts} +1 -1
  173. package/src/{sany-modules.ts → sany/modules.ts} +2 -2
  174. package/src/{sany-nodes.ts → sany/nodes.ts} +2 -2
  175. package/src/{sany-parse-error.ts → sany/parse-error.ts} +2 -2
  176. package/src/{sany-report.ts → sany/report.ts} +16 -17
  177. package/src/{sany-selectors.ts → sany/selectors.ts} +3 -5
  178. package/src/{sany-source.ts → sany/source.ts} +6 -7
  179. package/src/{sany-xml.ts → sany/xml.ts} +5 -6
  180. package/src/search.ts +969 -0
  181. package/src/spec-description.ts +26 -20
  182. package/src/{standard-levels.ts → standard-definitions.ts} +118 -2
  183. package/src/standard-modules.ts +16 -20
  184. package/src/state-graph.ts +9 -8
  185. package/src/substitution-levels.ts +2 -2
  186. package/src/successors.ts +16 -19
  187. package/src/symmetry.ts +1 -1
  188. package/src/tableau.ts +6 -7
  189. package/src/tlc/fingerprint.ts +214 -0
  190. package/src/{tlc-messages.ts → tlc/messages.ts} +119 -7
  191. package/src/{tlc-order.ts → tlc/order.ts} +7 -7
  192. package/src/{tlc-random.ts → tlc/random.ts} +3 -213
  193. package/src/{tlc-replay.ts → tlc/replay.ts} +40 -36
  194. package/src/{tlc-module.ts → tlc/tlc-operators.ts} +9 -9
  195. package/src/{tlc-ext.ts → tlc/tlcext-operators.ts} +30 -25
  196. package/src/transfer.ts +32 -32
  197. package/src/values.ts +72 -67
  198. package/src/worker.ts +1 -4
  199. package/dist/run-cli.cjs +0 -38
  200. package/dist/run-cli.js +0 -38
  201. package/src/canonical.ts +0 -40
  202. package/src/obligations/ctx.ts +0 -64
  203. package/src/prove/prep/defs.ts +0 -27
  204. package/src/prove/prep/elab.ts +0 -156
  205. package/src/prove/prep/enabled.ts +0 -43
  206. package/src/prove/prep/flatten.ts +0 -70
  207. package/src/prove/prep/trivial.ts +0 -22
  208. package/src/prove/prove.ts +0 -417
  209. package/src/prove/smt/axiomatize.ts +0 -69
  210. package/src/prove/smt/simplify.ts +0 -57
  211. package/src/prove/verdict.ts +0 -13
  212. package/src/standard-ranges.ts +0 -116
  213. package/src/value-sources.ts +0 -29
  214. /package/src/{prove → prover}/isabelle/LICENSE +0 -0
  215. /package/src/{prove → prover}/isabelle/LICENSE-tlapm +0 -0
  216. /package/src/{prove → prover}/isabelle/isar/proof.ts +0 -0
  217. /package/src/{prove → prover}/isabelle/isar/statement.ts +0 -0
  218. /package/src/{prove → prover}/isabelle/isar/theory.ts +0 -0
  219. /package/src/{prove → prover}/isabelle/provers/blast/prove.ts +0 -0
  220. /package/src/{prove → prover}/isabelle/provers/blast/rules.ts +0 -0
  221. /package/src/{prove → prover}/isabelle/provers/blast/state.ts +0 -0
  222. /package/src/{prove → prover}/isabelle/pure/bicompose.ts +0 -0
  223. /package/src/{prove → prover}/isabelle/pure/consts.ts +0 -0
  224. /package/src/{prove → prover}/isabelle/pure/goal.ts +0 -0
  225. /package/src/{prove → prover}/isabelle/pure/interrupt.ts +0 -0
  226. /package/src/{prove → prover}/isabelle/pure/list.ts +0 -0
  227. /package/src/{prove → prover}/isabelle/pure/object-logic.ts +0 -0
  228. /package/src/{prove → prover}/isabelle/pure/rewriter.ts +0 -0
  229. /package/src/{prove → prover}/isabelle/pure/search.ts +0 -0
  230. /package/src/{prove → prover}/isabelle/pure/variable.ts +0 -0
  231. /package/src/{prove → prover}/isabelle/tla/context.ts +0 -0
  232. /package/src/{prove → prover}/isabelle/tla/logic-data.ts +0 -0
  233. /package/src/{prove → prover}/isabelle/tla/logic.ts +0 -0
  234. /package/src/{prove → prover}/isabelle/tla/simpdata.ts +0 -0
  235. /package/src/{prove → prover}/isabelle/tools/intuitionistic.ts +0 -0
  236. /package/src/{prove → prover}/ptl/decide.ts +0 -0
  237. /package/src/{prove → prover}/ptl/sat.ts +0 -0
  238. /package/src/{prove → prover}/ptl/tableau.ts +0 -0
  239. /package/src/{prove → prover}/smt/context.ts +0 -0
  240. /package/src/{prove → prover}/smt/solver/act-cache.ts +0 -0
  241. /package/src/{prove → prover}/smt/solver/arith-rewriter.ts +0 -0
  242. /package/src/{prove → prover}/smt/solver/array.ts +0 -0
  243. /package/src/{prove → prover}/smt/solver/asserted-formulas.ts +0 -0
  244. /package/src/{prove → prover}/smt/solver/ast-lt.ts +0 -0
  245. /package/src/{prove → prover}/smt/solver/ast.ts +0 -0
  246. /package/src/{prove → prover}/smt/solver/auf-solver.ts +0 -0
  247. /package/src/{prove → prover}/smt/solver/cg-table.ts +0 -0
  248. /package/src/{prove → prover}/smt/solver/clause.ts +0 -0
  249. /package/src/{prove → prover}/smt/solver/conflict-resolution.ts +0 -0
  250. /package/src/{prove → prover}/smt/solver/context.ts +0 -0
  251. /package/src/{prove → prover}/smt/solver/ctx-simplify.ts +0 -0
  252. /package/src/{prove → prover}/smt/solver/der.ts +0 -0
  253. /package/src/{prove → prover}/smt/solver/dyn-ack.ts +0 -0
  254. /package/src/{prove → prover}/smt/solver/e-matching.ts +0 -0
  255. /package/src/{prove → prover}/smt/solver/expr-ref.ts +0 -0
  256. /package/src/{prove → prover}/smt/solver/expr-safe-replace.ts +0 -0
  257. /package/src/{prove → prover}/smt/solver/fingerprints.ts +0 -0
  258. /package/src/{prove → prover}/smt/solver/flat-literals.ts +0 -0
  259. /package/src/{prove → prover}/smt/solver/goal.ts +0 -0
  260. /package/src/{prove → prover}/smt/solver/hash.ts +0 -0
  261. /package/src/{prove → prover}/smt/solver/hashtable.ts +0 -0
  262. /package/src/{prove → prover}/smt/solver/internalizer.ts +0 -0
  263. /package/src/{prove → prover}/smt/solver/lbool.ts +0 -0
  264. /package/src/{prove → prover}/smt/solver/literal.ts +0 -0
  265. /package/src/{prove → prover}/smt/solver/lp/bound-propagator.ts +0 -0
  266. /package/src/{prove → prover}/smt/solver/lp/constraints.ts +0 -0
  267. /package/src/{prove → prover}/smt/solver/lp/containers.ts +0 -0
  268. /package/src/{prove → prover}/smt/solver/lp/core-solver.ts +0 -0
  269. /package/src/{prove → prover}/smt/solver/lp/cross-nested.ts +0 -0
  270. /package/src/{prove → prover}/smt/solver/lp/dependency.ts +0 -0
  271. /package/src/{prove → prover}/smt/solver/lp/dioph-eq.ts +0 -0
  272. /package/src/{prove → prover}/smt/solver/lp/explanation.ts +0 -0
  273. /package/src/{prove → prover}/smt/solver/lp/gomory.ts +0 -0
  274. /package/src/{prove → prover}/smt/solver/lp/hnf-cutter.ts +0 -0
  275. /package/src/{prove → prover}/smt/solver/lp/hnf.ts +0 -0
  276. /package/src/{prove → prover}/smt/solver/lp/int-cube.ts +0 -0
  277. /package/src/{prove → prover}/smt/solver/lp/int-solver.ts +0 -0
  278. /package/src/{prove → prover}/smt/solver/lp/lar-solver.ts +0 -0
  279. /package/src/{prove → prover}/smt/solver/lp/lar-term.ts +0 -0
  280. /package/src/{prove → prover}/smt/solver/lp/lp-settings.ts +0 -0
  281. /package/src/{prove → prover}/smt/solver/lp/maximize-term.ts +0 -0
  282. /package/src/{prove → prover}/smt/solver/lp/nex-creator.ts +0 -0
  283. /package/src/{prove → prover}/smt/solver/lp/nex.ts +0 -0
  284. /package/src/{prove → prover}/smt/solver/lp/nla-backoff.ts +0 -0
  285. /package/src/{prove → prover}/smt/solver/lp/nla-basics.ts +0 -0
  286. /package/src/{prove → prover}/smt/solver/lp/nla-core.ts +0 -0
  287. /package/src/{prove → prover}/smt/solver/lp/nla-divisions.ts +0 -0
  288. /package/src/{prove → prover}/smt/solver/lp/nla-emonics.ts +0 -0
  289. /package/src/{prove → prover}/smt/solver/lp/nla-factorization.ts +0 -0
  290. /package/src/{prove → prover}/smt/solver/lp/nla-grobner.ts +0 -0
  291. /package/src/{prove → prover}/smt/solver/lp/nla-horner.ts +0 -0
  292. /package/src/{prove → prover}/smt/solver/lp/nla-intervals.ts +0 -0
  293. /package/src/{prove → prover}/smt/solver/lp/nla-monomial-bounds.ts +0 -0
  294. /package/src/{prove → prover}/smt/solver/lp/nla-monotone.ts +0 -0
  295. /package/src/{prove → prover}/smt/solver/lp/nla-order.ts +0 -0
  296. /package/src/{prove → prover}/smt/solver/lp/nla-patcher.ts +0 -0
  297. /package/src/{prove → prover}/smt/solver/lp/nla-tangents.ts +0 -0
  298. /package/src/{prove → prover}/smt/solver/lp/nla-throttle.ts +0 -0
  299. /package/src/{prove → prover}/smt/solver/lp/nla-types.ts +0 -0
  300. /package/src/{prove → prover}/smt/solver/lp/nla-var-eqs.ts +0 -0
  301. /package/src/{prove → prover}/smt/solver/lp/nra-solver.ts +0 -0
  302. /package/src/{prove → prover}/smt/solver/lp/numeric-pair.ts +0 -0
  303. /package/src/{prove → prover}/smt/solver/lp/pdd-interval.ts +0 -0
  304. /package/src/{prove → prover}/smt/solver/lp/pdd-simplifier.ts +0 -0
  305. /package/src/{prove → prover}/smt/solver/lp/pdd-solver.ts +0 -0
  306. /package/src/{prove → prover}/smt/solver/lp/pdd.ts +0 -0
  307. /package/src/{prove → prover}/smt/solver/lp/random-updater.ts +0 -0
  308. /package/src/{prove → prover}/smt/solver/lp/static-matrix.ts +0 -0
  309. /package/src/{prove → prover}/smt/solver/lp/union-find.ts +0 -0
  310. /package/src/{prove → prover}/smt/solver/mam-compiler.ts +0 -0
  311. /package/src/{prove → prover}/smt/solver/mam-interpreter.ts +0 -0
  312. /package/src/{prove → prover}/smt/solver/maximize-ac-sharing.ts +0 -0
  313. /package/src/{prove → prover}/smt/solver/model-checker.ts +0 -0
  314. /package/src/{prove → prover}/smt/solver/model-evaluator.ts +0 -0
  315. /package/src/{prove → prover}/smt/solver/model-finder.ts +0 -0
  316. /package/src/{prove → prover}/smt/solver/model-generator.ts +0 -0
  317. /package/src/{prove → prover}/smt/solver/nlsat/evaluator.ts +0 -0
  318. /package/src/{prove → prover}/smt/solver/nlsat/mpbq.ts +0 -0
  319. /package/src/{prove → prover}/smt/solver/nlsat/solver.ts +0 -0
  320. /package/src/{prove → prover}/smt/solver/nlsat/types.ts +0 -0
  321. /package/src/{prove → prover}/smt/solver/nlsat/upolynomial-factorization.ts +0 -0
  322. /package/src/{prove → prover}/smt/solver/nnf.ts +0 -0
  323. /package/src/{prove → prover}/smt/solver/poly-rewriter.ts +0 -0
  324. /package/src/{prove → prover}/smt/solver/propagate-values.ts +0 -0
  325. /package/src/{prove → prover}/smt/solver/proto-model.ts +0 -0
  326. /package/src/{prove → prover}/smt/solver/pull-quant.ts +0 -0
  327. /package/src/{prove → prover}/smt/solver/qe-lite-der.ts +0 -0
  328. /package/src/{prove → prover}/smt/solver/qe-lite-fm.ts +0 -0
  329. /package/src/{prove → prover}/smt/solver/qe-lite.ts +0 -0
  330. /package/src/{prove → prover}/smt/solver/qi-queue.ts +0 -0
  331. /package/src/{prove → prover}/smt/solver/quant-tactics.ts +0 -0
  332. /package/src/{prove → prover}/smt/solver/quantifier-analyzer.ts +0 -0
  333. /package/src/{prove → prover}/smt/solver/quantifier-manager.ts +0 -0
  334. /package/src/{prove → prover}/smt/solver/random-gen.ts +0 -0
  335. /package/src/{prove → prover}/smt/solver/rational.ts +0 -0
  336. /package/src/{prove → prover}/smt/solver/ref-vector.ts +0 -0
  337. /package/src/{prove → prover}/smt/solver/rewriter-tpl.ts +0 -0
  338. /package/src/{prove → prover}/smt/solver/rlimit.ts +0 -0
  339. /package/src/{prove → prover}/smt/solver/smtlib-parser.ts +0 -0
  340. /package/src/{prove → prover}/smt/solver/sort.ts +0 -0
  341. /package/src/{prove → prover}/smt/solver/sticky-generations.ts +0 -0
  342. /package/src/{prove → prover}/smt/solver/theory-lra-axioms.ts +0 -0
  343. /package/src/{prove → prover}/smt/solver/theory-lra-bounds.ts +0 -0
  344. /package/src/{prove → prover}/smt/solver/theory-lra-final-check.ts +0 -0
  345. /package/src/{prove → prover}/smt/solver/theory-lra-internalize.ts +0 -0
  346. /package/src/{prove → prover}/smt/solver/theory-lra-model.ts +0 -0
  347. /package/src/{prove → prover}/smt/solver/theory-lra-propagate.ts +0 -0
  348. /package/src/{prove → prover}/smt/solver/theory-lra-state.ts +0 -0
  349. /package/src/{prove → prover}/smt/solver/theory-lra.ts +0 -0
  350. /package/src/{prove → prover}/smt/solver/var-subst.ts +0 -0
  351. /package/src/{prove → prover}/smt/solver/z3-license.txt +0 -0
  352. /package/src/{prove → prover}/smt/table.ts +0 -0
  353. /package/src/{prove → prover}/tlaps-module.ts +0 -0
  354. /package/src/{prove → prover}/zenon/LICENSE +0 -0
  355. /package/src/{prove → prover}/zenon/check/check.ts +0 -0
  356. /package/src/{prove → prover}/zenon/check/definitions.ts +0 -0
  357. /package/src/{prove → prover}/zenon/check/equality.ts +0 -0
  358. /package/src/{prove → prover}/zenon/check/functions.ts +0 -0
  359. /package/src/{prove → prover}/zenon/check/keys.ts +0 -0
  360. /package/src/{prove → prover}/zenon/check/propositional.ts +0 -0
  361. /package/src/{prove → prover}/zenon/check/records.ts +0 -0
  362. /package/src/{prove → prover}/zenon/check/relations.ts +0 -0
  363. /package/src/{prove → prover}/zenon/check/rewrites.ts +0 -0
  364. /package/src/{prove → prover}/zenon/check/sets.ts +0 -0
  365. /package/src/{prove → prover}/zenon/check/terms.ts +0 -0
  366. /package/src/{prove → prover}/zenon/check/tla.ts +0 -0
  367. /package/src/{prove → prover}/zenon/isar-case.ts +0 -0
  368. /package/src/{prove → prover}/zenon/limits.ts +0 -0
  369. /package/src/{prove → prover}/zenon/ocaml.ts +0 -0
  370. /package/src/{prove → prover}/zenon/parse.ts +0 -0
  371. /package/src/{prove → prover}/zenon/phrase.ts +0 -0
  372. /package/src/{prove → prover}/zenon/proof.ts +0 -0
  373. /package/src/{prove → prover}/zenon/propositional-rules.ts +0 -0
  374. /package/src/{prove → prover}/zenon/rules.ts +0 -0
  375. /package/src/{prove → prover}/zenon/tla/functions.ts +0 -0
  376. /package/src/{prove → prover}/zenon/tla/llproof.ts +0 -0
  377. /package/src/{prove → prover}/zenon/tla/records.ts +0 -0
  378. /package/src/{prove → prover}/zenon/tla/rewrites.ts +0 -0
  379. /package/src/{prove → prover}/zenon/tla/sets.ts +0 -0
  380. /package/src/{tlc-modules.ts → tlc/jar-data.ts} +0 -0
  381. /package/src/{tlc-summary.ts → tlc/summary.ts} +0 -0
  382. /package/src/{tlc-version.ts → tlc/version.ts} +0 -0
@@ -11,6 +11,7 @@ import {
11
11
  FUN_DOM,
12
12
  FUN_ISAFCN,
13
13
  FUN_SET,
14
+ getBinders,
14
15
  getNames,
15
16
  IS_SET_OF,
16
17
  LEN,
@@ -50,9 +51,9 @@ export const getSetOfAxioms = (name: string, free: string[], element: string, bo
50
51
  );
51
52
  const set = call(name, [...sets, ...free]);
52
53
  const guards = variables.map((variable, index) => `(${MEM} ${variable} ${sets[index]})`);
53
- const binders = variables.map((variable) => `(${variable} Idv)`).join(" ");
54
54
  // N_axioms.assert_issetof names its one set a.
55
55
  const single = count === 1 ? ["a"] : sets;
56
+ const asserted = call(name, [...single, ...free]);
56
57
  return [
57
58
  axiom(
58
59
  "SetOfIntro",
@@ -67,16 +68,14 @@ export const getSetOfAxioms = (name: string, free: string[], element: string, bo
67
68
  [count],
68
69
  forall(
69
70
  [...free, ...sets, "x"],
70
- `(=> (${MEM} x ${set}) (exists (${binders}) ${conjoin([...guards, `(= x ${value})`])}))`,
71
+ `(=> (${MEM} x ${set}) (exists (${getBinders(variables)}) ${conjoin([...guards, `(= x ${value})`])}))`,
71
72
  [[`(${MEM} x ${set})`]],
72
73
  ),
73
74
  ),
74
75
  axiom(
75
76
  "AssertIsSetOf",
76
77
  [count],
77
- forall([...free, ...single], `(${IS_SET_OF} ${call(name, [...single, ...free])})`, [
78
- [call(name, [...single, ...free])],
79
- ]),
78
+ forall([...free, ...single], `(${IS_SET_OF} ${asserted})`, [[asserted]]),
80
79
  ),
81
80
  ];
82
81
  };
@@ -3,14 +3,8 @@
3
3
  // flattened symbol brings are in instances.ts.
4
4
 
5
5
  import { TlaUnsupportedError } from "../../errors";
6
- import {
7
- normalizeApply,
8
- shiftExpr,
9
- type Bound,
10
- type Builtin,
11
- type Expr,
12
- type Sequent,
13
- } from "../../obligations/expression";
6
+ import { normalizeApply, shiftExpr } from "../../obligations/substitution";
7
+ import { type Bound, type Builtin, type Expr, type Sequent } from "../../obligations/expression";
14
8
  import { createContext, type Identifier } from "./context";
15
9
  import {
16
10
  createFlattener,
@@ -31,6 +25,7 @@ import {
31
25
  FUN_APP,
32
26
  FUN_EXCEPT,
33
27
  FUN_SET,
28
+ getBinders,
34
29
  INT_LTEQ,
35
30
  INT_SET,
36
31
  MEM,
@@ -50,7 +45,7 @@ import {
50
45
  getSetStAxioms,
51
46
  } from "./instances";
52
47
 
53
- export interface Term {
48
+ interface Term {
54
49
  isBool: boolean;
55
50
  text: string;
56
51
  // Type.Synthesize: the Int-sorted form of a term that is an integer before it's cast to Idv.
@@ -64,7 +59,7 @@ export interface EncodingSession {
64
59
 
65
60
  export interface Mode {
66
61
  // Whether the text encodes a fact that tlapm leaves out, which may declare operators.
67
- isOmitted?: boolean;
62
+ isOmitted: boolean;
68
63
  polarity: Polarity;
69
64
  at: string | undefined;
70
65
  depth: number;
@@ -82,6 +77,14 @@ export interface Env {
82
77
  rest: Env | undefined;
83
78
  }
84
79
 
80
+ // A nested ASSUME's declarations and facts so far: each wraps the goal in a quantifier or an
81
+ // implication.
82
+ interface NestedContext {
83
+ env: Env | undefined;
84
+ mode: Mode;
85
+ wrappers: ((body: string) => string)[];
86
+ }
87
+
85
88
  export const createEncoder = (session: EncodingSession) => {
86
89
  const flattener = createFlattener();
87
90
  const flatten = flattener.flatten;
@@ -174,9 +177,6 @@ export const createEncoder = (session: EncodingSession) => {
174
177
  return { variables, env: inner, mode: { ...mode, depth: mode.depth + names.length } };
175
178
  };
176
179
 
177
- const binders = (variables: string[]) =>
178
- variables.map((variable) => `(${variable} Idv)`).join(" ");
179
-
180
180
  const encodeQuantifier = (
181
181
  expression: Extract<Expr, { kind: "Quant" }>,
182
182
  env: Env | undefined,
@@ -193,8 +193,8 @@ export const createEncoder = (session: EncodingSession) => {
193
193
  domains[index] === undefined ? [] : [`(${MEM} ${variable} ${domains[index]})`],
194
194
  );
195
195
  return expression.quantifier === "Forall"
196
- ? `(forall (${binders(bound.variables)}) ${guards.length === 0 ? body : `(=> ${conjoin(guards)} ${body})`})`
197
- : `(exists (${binders(bound.variables)}) ${conjoin([...guards, body])})`;
196
+ ? `(forall (${getBinders(bound.variables)}) ${guards.length === 0 ? body : `(=> ${conjoin(guards)} ${body})`})`
197
+ : `(exists (${getBinders(bound.variables)}) ${conjoin([...guards, body])})`;
198
198
  };
199
199
 
200
200
  const encodeSetSt = (
@@ -297,21 +297,15 @@ export const createEncoder = (session: EncodingSession) => {
297
297
  return idv(call(symbol, free));
298
298
  };
299
299
 
300
- // Standardize.set_extensionality_visitor: an equality of sets where it may need proving
301
- // triggers the extensionality axiom.
302
- const encodeEquality = (
303
- left: Expr,
304
- right: Expr,
305
- env: Env | undefined,
306
- mode: Mode,
307
- isNegated: boolean,
308
- ) => {
309
- // Type.Synthesize compares values of the same sort only above type level 1, so two formulas
310
- // are compared as values.
311
- const leftText = encodeIdv(left, env, mode);
312
- const rightText = encodeIdv(right, env, mode);
313
- return getEquality(leftText, rightText, mode.polarity, isNegated);
314
- };
300
+ // Type.Synthesize compares values of the same sort only above type level 1, so two formulas are
301
+ // compared as values.
302
+ const encodeEquality = (args: Expr[], env: Env | undefined, mode: Mode, isNegated: boolean) =>
303
+ getEquality(
304
+ encodeIdv(args[0], env, mode),
305
+ encodeIdv(args[1], env, mode),
306
+ mode.polarity,
307
+ isNegated,
308
+ );
315
309
 
316
310
  // Type.Synthesize: SelectSeq's test becomes the predicate LAMBDA x1 : Test(x1), its body the
317
311
  // text Flatten compares.
@@ -351,9 +345,9 @@ export const createEncoder = (session: EncodingSession) => {
351
345
  case "Neg":
352
346
  return bool(`(not ${encodeBool(args[0], env, invert(mode))})`);
353
347
  case "Eq":
354
- return bool(encodeEquality(args[0], args[1], env, mode, false));
348
+ return bool(encodeEquality(args, env, mode, false));
355
349
  case "Neq":
356
- return bool(encodeEquality(args[0], args[1], env, mode, true));
350
+ return bool(encodeEquality(args, env, mode, true));
357
351
  case "Mem":
358
352
  return bool(call(MEM, idvs()));
359
353
  // Rewrite.elim_notmem: a \notin S is ~(a \in S).
@@ -405,12 +399,10 @@ export const createEncoder = (session: EncodingSession) => {
405
399
  ): Term => {
406
400
  switch (binding.kind) {
407
401
  case "constant":
408
- if (args.length > 0) throw new TlaUnsupportedError("an applied constant");
409
- return idv(binding.symbol);
410
402
  case "variable":
411
- if (args.length > 0) throw new TlaUnsupportedError("an applied variable");
403
+ if (args.length > 0) throw new TlaUnsupportedError(`an applied ${binding.kind}`);
412
404
  return idv(binding.symbol);
413
- case "operator": {
405
+ case "operator":
414
406
  if (args.length !== binding.arity)
415
407
  throw new TlaUnsupportedError("an operator applied to the wrong number of arguments");
416
408
  return idv(
@@ -419,7 +411,6 @@ export const createEncoder = (session: EncodingSession) => {
419
411
  args.map((arg) => encodeIdv(arg, env, mode)),
420
412
  ),
421
413
  );
422
- }
423
414
  // Flatten: an application of a second-order operator, which has no axioms, is a fresh
424
415
  // operator of its first-order arguments and the bound variables its others use.
425
416
  case "secondOrder": {
@@ -559,11 +550,7 @@ export const createEncoder = (session: EncodingSession) => {
559
550
  };
560
551
 
561
552
  const encodeSequent = (sequent: Sequent, env: Env | undefined, mode: Mode): string => {
562
- const steps = sequent.context.reduce<{
563
- env: Env | undefined;
564
- mode: Mode;
565
- wrappers: ((body: string) => string)[];
566
- }>(
553
+ const steps = sequent.context.reduce<NestedContext>(
567
554
  (state, hyp) => {
568
555
  switch (hyp.kind) {
569
556
  case "Fresh": {
@@ -573,10 +560,7 @@ export const createEncoder = (session: EncodingSession) => {
573
560
  return {
574
561
  env: push(state.env, { kind: "operator", symbol: variable, arity: hyp.shape }),
575
562
  mode: { ...state.mode, depth: state.mode.depth + 1 },
576
- wrappers: [
577
- ...state.wrappers,
578
- (body: string) => `(forall ((${variable} Idv)) ${body})`,
579
- ],
563
+ wrappers: [...state.wrappers, (body) => `(forall ((${variable} Idv)) ${body})`],
580
564
  };
581
565
  }
582
566
  if (hyp.level !== "Constant")
@@ -590,8 +574,7 @@ export const createEncoder = (session: EncodingSession) => {
590
574
  mode: bound.mode,
591
575
  wrappers: [
592
576
  ...state.wrappers,
593
- (body: string) =>
594
- `(forall ((${variable} Idv)) ${guard ? `(=> ${guard} ${body})` : body})`,
577
+ (body) => `(forall ((${variable} Idv)) ${guard ? `(=> ${guard} ${body})` : body})`,
595
578
  ],
596
579
  };
597
580
  }
@@ -604,7 +587,7 @@ export const createEncoder = (session: EncodingSession) => {
604
587
  env: push(state.env, { kind: "unsupported", reason: "a reference to a fact" }),
605
588
  mode: state.mode,
606
589
  wrappers: fact
607
- ? [...state.wrappers, (body: string) => `(=> ${fact} ${body})`]
590
+ ? [...state.wrappers, (body) => `(=> ${fact} ${body})`]
608
591
  : state.wrappers,
609
592
  };
610
593
  }
@@ -650,7 +633,7 @@ export const createEncoder = (session: EncodingSession) => {
650
633
  if (operator.kind === "Opaque")
651
634
  return encodeOpaque(operator.name, expression.args, env, mode);
652
635
  if (operator.kind === "Lambda")
653
- return encode({ ...normalizeApply(operator, expression.args) }, env, mode);
636
+ return encode(normalizeApply(operator, expression.args), env, mode);
654
637
  throw new TlaUnsupportedError(`an application of ${operator.kind}`);
655
638
  }
656
639
  case "Sequent":
@@ -709,10 +692,10 @@ export const createEncoder = (session: EncodingSession) => {
709
692
  return encodeFunction(expression, env, mode);
710
693
  // Rewrite.elim_multiarg: f[a, b] applies f to the tuple <<a, b>>.
711
694
  case "FcnApp": {
712
- const fn = encodeIdv(expression.function, env, mode);
695
+ const encodedFunction = encodeIdv(expression.function, env, mode);
713
696
  const args = expression.args.map((arg) => encodeIdv(arg, env, mode));
714
697
  const argument = args.length === 1 ? args[0] : call(tla(`Tuple_${args.length}`), args);
715
- return idv(`(${FUN_APP} ${fn} ${argument})`);
698
+ return idv(`(${FUN_APP} ${encodedFunction} ${argument})`);
716
699
  }
717
700
  case "Arrow":
718
701
  return idv(
@@ -723,15 +706,14 @@ export const createEncoder = (session: EncodingSession) => {
723
706
  );
724
707
  case "Record":
725
708
  case "Rect": {
726
- const fields = expression.fields;
727
- const names = fields.map((field) => field.name);
728
- recordFields.set(`Record_${names.join("_")}`, names);
729
- recordFields.set(`RecordSet_${names.join("_")}`, names);
730
- const name = `${expression.kind === "Record" ? "Record" : "RecordSet"}_${names.join("_")}`;
709
+ const names = expression.fields.map((field) => field.name);
710
+ const suffix = names.join("_");
711
+ recordFields.set(`Record_${suffix}`, names);
712
+ recordFields.set(`RecordSet_${suffix}`, names);
731
713
  return idv(
732
714
  call(
733
- tla(name),
734
- fields.map((field) => encodeIdv(field.value, env, mode)),
715
+ tla(`${expression.kind === "Record" ? "Record" : "RecordSet"}_${suffix}`),
716
+ expression.fields.map((field) => encodeIdv(field.value, env, mode)),
735
717
  ),
736
718
  );
737
719
  }
@@ -13,62 +13,6 @@ export const mkNot = (manager: AstManager, expr: number) =>
13
13
  ? manager.trueExpr
14
14
  : manager.mkNot(expr);
15
15
 
16
- // push_not: moves the negation through conjunctions and disjunctions.
17
- export const pushNot = (manager: AstManager, expr: number): number => {
18
- const op = manager.getOp(expr);
19
- if (op === OP_AND) return manager.mkOr(manager.mapArgs(expr, (arg) => pushNot(manager, arg)));
20
- if (op === OP_OR) return manager.mkAnd(manager.mapArgs(expr, (arg) => pushNot(manager, arg)));
21
- return mkNot(manager, expr);
22
- };
23
-
24
- // flatten_and and flatten_or: a flattened list replaces an element by the last one, so the order
25
- // follows Z3's.
26
- const flatten = (manager: AstManager, input: number[], isAnd: boolean) => {
27
- const result = [...input];
28
- const seen = new Set<number>();
29
- const junction = isAnd ? OP_AND : OP_OR;
30
- const dual = isAnd ? OP_OR : OP_AND;
31
- const unit = isAnd ? manager.trueExpr : manager.falseExpr;
32
- const zero = isAnd ? manager.falseExpr : manager.trueExpr;
33
- const replaceByLast = (index: number) => {
34
- result[index] = result[result.length - 1];
35
- result.pop();
36
- };
37
- for (let index = 0; index < result.length; index++) {
38
- const expr = result[index];
39
- if (seen.has(expr)) {
40
- replaceByLast(index--);
41
- continue;
42
- }
43
- seen.add(expr);
44
- const inner = manager.isNot(expr) ? manager.getArg(expr, 0) : -1;
45
- const innerOp = inner === -1 ? -1 : manager.getOp(inner);
46
- if (manager.getOp(expr) === junction) {
47
- manager.pushArgs(expr, result);
48
- replaceByLast(index--);
49
- } else if (innerOp === OP_NOT) result[index--] = manager.getArg(inner, 0);
50
- else if (innerOp === dual) {
51
- for (let argIndex = 0; argIndex < manager.getNumArgs(inner); argIndex++) {
52
- const arg = manager.getArg(inner, argIndex);
53
- result.push(mkNot(manager, arg));
54
- }
55
- replaceByLast(index--);
56
- } else if (isAnd && innerOp === OP_IMPLIES) {
57
- result.push(manager.getArg(inner, 0));
58
- result[index--] = mkNot(manager, manager.getArg(inner, 1));
59
- } else if (!isAnd && manager.getOp(expr) === OP_IMPLIES) {
60
- result.push(manager.getArg(expr, 1));
61
- result[index--] = mkNot(manager, manager.getArg(expr, 0));
62
- } else if (expr === unit || inner === zero) replaceByLast(index--);
63
- else if (expr === zero || inner === unit) return [zero];
64
- }
65
- return result;
66
- };
67
-
68
- export const flattenAnd = (manager: AstManager, input: number[]) => flatten(manager, input, true);
69
-
70
- export const flattenOr = (manager: AstManager, input: number[]) => flatten(manager, input, false);
71
-
72
16
  // flatten_and and flatten_or on an expr_ref_vector, with Z3's references: the vector holds its
73
17
  // expressions, and pin holds each visited one until the end.
74
18
  const flattenVector = (manager: AstManager, result: RefVector, isAnd: boolean) => {
@@ -115,7 +115,7 @@ class ActivityHeap {
115
115
  }
116
116
  }
117
117
 
118
- export interface CaseSplitContext {
118
+ interface CaseSplitContext {
119
119
  activity: number[];
120
120
  getIsSearching(): boolean;
121
121
  getRandomValue(): number;
@@ -2,7 +2,7 @@
2
2
  // MIT license, see z3-license.txt. E-graph nodes and the justifications for their equalities.
3
3
  import type { Literal } from "./literal";
4
4
 
5
- export interface Antecedents {
5
+ interface Antecedents {
6
6
  markLiteral(literal: Literal): void;
7
7
  markEq(first: Enode, second: Enode): void;
8
8
  markJustification(justification: Justification): void;
@@ -587,25 +587,11 @@ export const intersect = (
587
587
  export const setValue = (interval: DepInterval, value: Rational) =>
588
588
  setBounds(interval, mkNumeral(value), false, mkNumeral(value), false);
589
589
 
590
- // reset: both bounds infinite, keeping the values, openness, and dependencies.
591
- export const reset = (interval: DepInterval) => {
592
- interval.isLowerInf = true;
593
- interval.isUpperInf = true;
594
- };
595
-
596
590
  export const setZeroIntervalDepsForMult = (interval: DepInterval) => {
597
591
  interval.lowerDep = mkJoin(interval.lowerDep, interval.upperDep);
598
592
  interval.upperDep = interval.lowerDep;
599
593
  };
600
594
 
601
- export const isZero = (interval: DepInterval) =>
602
- !interval.isLowerInf &&
603
- !interval.isUpperInf &&
604
- !interval.isLowerOpen &&
605
- !interval.isUpperOpen &&
606
- interval.lower.isZero() &&
607
- interval.upper.isZero();
608
-
609
595
  export const isEmpty = (interval: DepInterval) => {
610
596
  if (interval.isLowerInf || interval.isUpperInf) return false;
611
597
  const comparison = interval.lower.compare(interval.upper);
@@ -35,7 +35,7 @@ export interface CondMacro {
35
35
  weight: number;
36
36
  }
37
37
 
38
- export interface QuantifierMacroInfo {
38
+ interface QuantifierMacroInfo {
39
39
  readonly condMacros: CondMacro[];
40
40
  readonly ngDecls: Set<number>;
41
41
  readonly isAuf: boolean;
@@ -20,7 +20,7 @@ const SIGN_PRECISION = 2;
20
20
  const X = 0;
21
21
  const Y = 1;
22
22
 
23
- export class AlgebraicCell {
23
+ class AlgebraicCell {
24
24
  constructor(
25
25
  public p: Upolynomial,
26
26
  public lower: Mpbq,
@@ -81,12 +81,12 @@ interface IsolatingFactor {
81
81
  lowerVariations: number;
82
82
  }
83
83
 
84
- export interface ClosestAnums {
84
+ interface ClosestAnums {
85
85
  roots: Anum[];
86
86
  indices: number[];
87
87
  }
88
88
 
89
- export interface SignedRoots {
89
+ interface SignedRoots {
90
90
  roots: Anum[];
91
91
  signs: number[];
92
92
  }
@@ -19,7 +19,7 @@ const FLIPPED_KIND: Record<IneqKind, IneqKind> = { EQ: "EQ", LT: "GT", GT: "LT"
19
19
  export const flipKind = (kind: IneqKind) => FLIPPED_KIND[kind];
20
20
 
21
21
  // What the solver keeps per Boolean variable, reset when a variable is made or deleted.
22
- export interface BoolVarHooks {
22
+ interface BoolVarHooks {
23
23
  onMk: (boolVar: number) => void;
24
24
  onDelete: (boolVar: number) => void;
25
25
  }
@@ -24,7 +24,7 @@ import {
24
24
  import { type IneqAtom, type IneqKind, type RootKind, isIneqAtom } from "./types";
25
25
 
26
26
  // The solver state an explanation reads.
27
- export interface ExplainContext {
27
+ interface ExplainContext {
28
28
  atoms: AtomTable;
29
29
  // sample(): the solver's assignment, refined in place.
30
30
  sample: (Anum | undefined)[];
@@ -35,7 +35,7 @@ export interface IntervalSet {
35
35
  isFull: boolean;
36
36
  }
37
37
 
38
- export interface ComplementMax {
38
+ interface ComplementMax {
39
39
  sup: Anum;
40
40
  isAttained: boolean;
41
41
  }
@@ -20,7 +20,7 @@ import {
20
20
 
21
21
  // A section is the index-th root of lower. A sector lies between the lowerIndex-th root of lower
22
22
  // and the upperIndex-th root of upper, and a null bound is infinite.
23
- export interface CellInterval {
23
+ interface CellInterval {
24
24
  isSection: boolean;
25
25
  lower: Polynomial | null;
26
26
  lowerIndex: number;
@@ -29,13 +29,13 @@ export interface CellInterval {
29
29
  }
30
30
 
31
31
  // lws_spt_threshold, lws_witness_subs_lc and lws_witness_subs_disc.
32
- export interface LevelwiseParams {
32
+ interface LevelwiseParams {
33
33
  spanningTreeThreshold: number;
34
34
  isWitnessSubsLc: boolean;
35
35
  isWitnessSubsDisc: boolean;
36
36
  }
37
37
 
38
- export const DEFAULT_LEVELWISE_PARAMS: LevelwiseParams = {
38
+ const DEFAULT_LEVELWISE_PARAMS: LevelwiseParams = {
39
39
  spanningTreeThreshold: 4,
40
40
  isWitnessSubsLc: true,
41
41
  isWitnessSubsDisc: true,
@@ -56,10 +56,7 @@ const BOTH_SIDES = 3;
56
56
 
57
57
  // stable_index_merge_sort: bottom-up, so each pair is compared once even though comparing refines
58
58
  // the numbers.
59
- export const sortIndicesStably = (
60
- count: number,
61
- isLess: (first: number, second: number) => boolean,
62
- ) => {
59
+ const sortIndicesStably = (count: number, isLess: (first: number, second: number) => boolean) => {
63
60
  let source = Array.from({ length: count }, (_, index) => index);
64
61
  for (let width = 1; width < count; width *= 2) {
65
62
  const target: number[] = [];
@@ -62,7 +62,7 @@ const RATIONAL_OPS: ValueOps<Rational> = {
62
62
  const getMonomialKey = (vars: readonly number[], degrees: readonly number[]) =>
63
63
  vars.map((variable, index) => `${variable}^${degrees[index]}`).join(",");
64
64
 
65
- export class Monomial {
65
+ class Monomial {
66
66
  readonly totalDegree: number;
67
67
 
68
68
  // vars and degrees change only when the manager renames the variables.
@@ -102,7 +102,7 @@ export class Monomial {
102
102
  }
103
103
 
104
104
  // lex_compare: the biggest variable dominates, then its degree.
105
- export const lexCompare = (first: Monomial, second: Monomial) => {
105
+ const lexCompare = (first: Monomial, second: Monomial) => {
106
106
  if (first === second) return 0;
107
107
  let firstIndex = first.size - 1;
108
108
  let secondIndex = second.size - 1;
@@ -124,7 +124,7 @@ export const lexCompare = (first: Monomial, second: Monomial) => {
124
124
  return firstIndex < 0 ? -1 : 1;
125
125
  };
126
126
 
127
- export const gradedLexCompare = (first: Monomial, second: Monomial) =>
127
+ const gradedLexCompare = (first: Monomial, second: Monomial) =>
128
128
  first.totalDegree === second.totalDegree
129
129
  ? lexCompare(first, second)
130
130
  : first.totalDegree < second.totalDegree
@@ -335,7 +335,7 @@ class CheapSomBuffer {
335
335
  }
336
336
  }
337
337
 
338
- export interface Factors {
338
+ interface Factors {
339
339
  constant: bigint;
340
340
  factors: Polynomial[];
341
341
  degrees: number[];
@@ -59,14 +59,14 @@ const trim = (coeffs: bigint[]) => {
59
59
  return coeffs;
60
60
  };
61
61
 
62
- export interface IsolatedRoots {
62
+ interface IsolatedRoots {
63
63
  roots: Mpbq[];
64
64
  lowers: Mpbq[];
65
65
  uppers: Mpbq[];
66
66
  }
67
67
 
68
68
  // An interval (a, b) refined around the root of a square-free polynomial, or the root itself.
69
- export interface Refinement {
69
+ interface Refinement {
70
70
  isInterval: boolean;
71
71
  lower: Mpbq;
72
72
  upper: Mpbq;
@@ -345,7 +345,7 @@ export class PatternInference {
345
345
  }
346
346
  }
347
347
 
348
- export interface InferredPatterns {
348
+ interface InferredPatterns {
349
349
  patterns: number[];
350
350
  weight: number;
351
351
  }
@@ -5,9 +5,9 @@ import { AstManager, KIND_APP, OP_AND, OP_IMPLIES, OP_ITE, OP_OR } from "./ast";
5
5
  import type { Enode } from "./enode";
6
6
  import { shrink } from "./array";
7
7
 
8
- export type RelevancyHandler = () => void;
8
+ type RelevancyHandler = () => void;
9
9
 
10
- export interface RelevancyContext {
10
+ interface RelevancyContext {
11
11
  manager: AstManager;
12
12
  // lbool as 1, -1 or 0.
13
13
  findAssignment(expr: number): number;
@@ -42,7 +42,7 @@ import { getRewriteDepth, type Rewrite, RewriterTpl } from "./rewriter-tpl";
42
42
  import { sortByKey } from "./sort";
43
43
  import { UnusedVarsEliminator } from "./var-subst";
44
44
 
45
- export interface RewriterOptions {
45
+ interface RewriterOptions {
46
46
  // Replaces (and a b) with (not (or (not a) (not b))), as Z3's asserted_formulas does after NNF.
47
47
  readonly isEliminatingAnd: boolean;
48
48
  readonly arith: ArithRewriterOptions;
@@ -1,8 +1,8 @@
1
1
  // Ported from Z3 (src/smt/smt_solver.cpp, src/smt/smt_kernel.cpp, src/smt/smt_setup.cpp), MIT
2
2
  // license, see z3-license.txt. Decides an SMT-LIB problem the way `z3 -smt2 AUTO_CONFIG=false
3
3
  // smt.MBQI=true` does for tlapm's UFNIA obligations.
4
- import { SmtCanceledError, SmtUnsupportedError } from "../../../errors";
5
- import { isStackOverflow, type DecideOptions, type Verdict } from "../../verdict";
4
+ import { isStackOverflow, SmtCanceledError, SmtUnsupportedError } from "../../../errors";
5
+ import type { DecideOptions, Verdict } from "../../verdict";
6
6
  import { AssertedFormulas } from "./asserted-formulas";
7
7
  import { AstManager } from "./ast";
8
8
  import { Context } from "./context";