tla-ts 0.0.4-dev.e9adbb1 → 0.0.4-dev.ee344a5

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 (303) hide show
  1. package/README.md +45 -1
  2. package/dist/deciders.cjs +366 -0
  3. package/dist/deciders.js +366 -0
  4. package/dist/index.cjs +1 -1
  5. package/dist/index.d.cts +35 -1
  6. package/dist/index.d.ts +35 -1
  7. package/dist/index.js +1 -1
  8. package/dist/parallel-worker.cjs +1 -4
  9. package/dist/parallel-worker.js +1 -4
  10. package/dist/prove-worker.cjs +9 -0
  11. package/dist/prove-worker.d.cts +9 -0
  12. package/dist/prove-worker.d.ts +9 -0
  13. package/dist/prove-worker.js +9 -0
  14. package/dist/prove.cjs +515 -0
  15. package/dist/prove.js +515 -0
  16. package/dist/run-cli.cjs +30 -47
  17. package/dist/run-cli.js +30 -47
  18. package/dist/tlapm.cjs +10 -0
  19. package/dist/tlapm.js +10 -0
  20. package/dist/transfer.cjs +38 -44
  21. package/dist/transfer.js +38 -44
  22. package/dist/worker.cjs +21 -0
  23. package/dist/worker.js +21 -0
  24. package/package.json +21 -12
  25. package/src/errors.ts +86 -0
  26. package/src/index.ts +10 -0
  27. package/src/{obligation-action.ts → obligations/action.ts} +258 -37
  28. package/src/{obligation-anon.ts → obligations/anon.ts} +13 -7
  29. package/src/obligations/ctx.ts +64 -0
  30. package/src/{obligation-deref.ts → obligations/deref.ts} +2 -2
  31. package/src/{obligation-expression.ts → obligations/expression.ts} +54 -8
  32. package/src/{obligation-generate.ts → obligations/generate.ts} +134 -61
  33. package/src/{obligations.ts → obligations/index.ts} +26 -12
  34. package/src/{obligation-levels.ts → obligations/levels.ts} +12 -2
  35. package/src/{obligation-module.ts → obligations/module.ts} +46 -20
  36. package/src/obligations/pickle.ts +100 -0
  37. package/src/obligations/pragma.ts +189 -0
  38. package/src/{obligation-printer.ts → obligations/printer.ts} +5 -59
  39. package/src/{obligation-proof.ts → obligations/proof.ts} +7 -1
  40. package/src/{obligation-source.ts → obligations/source.ts} +91 -35
  41. package/src/obligations/temporal.ts +319 -0
  42. package/src/{obligation-tuples.ts → obligations/tuples.ts} +1 -1
  43. package/src/parallel-worker.ts +2 -18
  44. package/src/parallel.ts +10 -43
  45. package/src/prove/decide-pool.ts +100 -0
  46. package/src/prove/deciders.ts +27 -0
  47. package/src/prove/isabelle/LICENSE +36 -0
  48. package/src/prove/isabelle/LICENSE-tlapm +26 -0
  49. package/src/prove/isabelle/decide.ts +47 -0
  50. package/src/prove/isabelle/encode.ts +477 -0
  51. package/src/prove/isabelle/isar/inner-syntax.ts +579 -0
  52. package/src/prove/isabelle/isar/method.ts +367 -0
  53. package/src/prove/isabelle/isar/proof.ts +28 -0
  54. package/src/prove/isabelle/isar/statement.ts +57 -0
  55. package/src/prove/isabelle/isar/theory.ts +192 -0
  56. package/src/prove/isabelle/isar/type-check.ts +278 -0
  57. package/src/prove/isabelle/provers/blast/blast.ts +258 -0
  58. package/src/prove/isabelle/provers/blast/branch.ts +322 -0
  59. package/src/prove/isabelle/provers/blast/prove.ts +347 -0
  60. package/src/prove/isabelle/provers/blast/rules.ts +330 -0
  61. package/src/prove/isabelle/provers/blast/state.ts +180 -0
  62. package/src/prove/isabelle/provers/blast/term.ts +547 -0
  63. package/src/prove/isabelle/provers/clasimp.ts +150 -0
  64. package/src/prove/isabelle/provers/classical.ts +389 -0
  65. package/src/prove/isabelle/provers/hypsubst.ts +441 -0
  66. package/src/prove/isabelle/pure/bicompose.ts +174 -0
  67. package/src/prove/isabelle/pure/consts.ts +32 -0
  68. package/src/prove/isabelle/pure/conv.ts +79 -0
  69. package/src/prove/isabelle/pure/drule.ts +264 -0
  70. package/src/prove/isabelle/pure/envir.ts +363 -0
  71. package/src/prove/isabelle/pure/goal.ts +53 -0
  72. package/src/prove/isabelle/pure/interrupt.ts +16 -0
  73. package/src/prove/isabelle/pure/list.ts +12 -0
  74. package/src/prove/isabelle/pure/logic.ts +402 -0
  75. package/src/prove/isabelle/pure/name.ts +110 -0
  76. package/src/prove/isabelle/pure/net.ts +262 -0
  77. package/src/prove/isabelle/pure/object-logic.ts +41 -0
  78. package/src/prove/isabelle/pure/pattern.ts +650 -0
  79. package/src/prove/isabelle/pure/raw-simplifier.ts +353 -0
  80. package/src/prove/isabelle/pure/rewriter.ts +602 -0
  81. package/src/prove/isabelle/pure/search.ts +68 -0
  82. package/src/prove/isabelle/pure/seq.ts +156 -0
  83. package/src/prove/isabelle/pure/simplifier.ts +112 -0
  84. package/src/prove/isabelle/pure/table.ts +208 -0
  85. package/src/prove/isabelle/pure/tactic.ts +276 -0
  86. package/src/prove/isabelle/pure/tactical.ts +347 -0
  87. package/src/prove/isabelle/pure/term-ord.ts +159 -0
  88. package/src/prove/isabelle/pure/term.ts +808 -0
  89. package/src/prove/isabelle/pure/thm.ts +806 -0
  90. package/src/prove/isabelle/pure/type.ts +133 -0
  91. package/src/prove/isabelle/pure/unify.ts +753 -0
  92. package/src/prove/isabelle/pure/variable.ts +25 -0
  93. package/src/prove/isabelle/tla/classical-setup.ts +101 -0
  94. package/src/prove/isabelle/tla/context.ts +74 -0
  95. package/src/prove/isabelle/tla/logic-data.ts +5 -0
  96. package/src/prove/isabelle/tla/logic.ts +215 -0
  97. package/src/prove/isabelle/tla/simpdata.ts +241 -0
  98. package/src/prove/isabelle/tools/intuitionistic.ts +132 -0
  99. package/src/prove/ocaml.ts +22 -0
  100. package/src/prove/prep/action.ts +520 -0
  101. package/src/prove/prep/defs.ts +27 -0
  102. package/src/prove/prep/elab.ts +156 -0
  103. package/src/prove/prep/enabled-axioms.ts +189 -0
  104. package/src/prove/prep/enabled.ts +43 -0
  105. package/src/prove/prep/fingerprint.ts +388 -0
  106. package/src/prove/prep/flatten.ts +70 -0
  107. package/src/prove/prep/level-comparison.ts +552 -0
  108. package/src/prove/prep/md5.ts +67 -0
  109. package/src/prove/prep/pragma.ts +221 -0
  110. package/src/prove/prep/trivial.ts +22 -0
  111. package/src/prove/prove-worker.ts +29 -0
  112. package/src/prove/prove.ts +417 -0
  113. package/src/prove/ptl/decide.ts +68 -0
  114. package/src/prove/ptl/encode.ts +256 -0
  115. package/src/prove/ptl/sat.ts +151 -0
  116. package/src/prove/ptl/tableau.ts +276 -0
  117. package/src/prove/smt/axiomatize.ts +69 -0
  118. package/src/prove/smt/axioms.ts +210 -0
  119. package/src/prove/smt/context.ts +108 -0
  120. package/src/prove/smt/data.ts +665 -0
  121. package/src/prove/smt/encode.ts +169 -0
  122. package/src/prove/smt/extensionality.ts +63 -0
  123. package/src/prove/smt/flatten.ts +127 -0
  124. package/src/prove/smt/format.ts +143 -0
  125. package/src/prove/smt/instances.ts +182 -0
  126. package/src/prove/smt/rewrite.ts +784 -0
  127. package/src/prove/smt/simplify.ts +57 -0
  128. package/src/prove/smt/solver/act-cache.ts +265 -0
  129. package/src/prove/smt/solver/arith-rewriter.ts +962 -0
  130. package/src/prove/smt/solver/array.ts +22 -0
  131. package/src/prove/smt/solver/asserted-formulas.ts +469 -0
  132. package/src/prove/smt/solver/ast-lt.ts +157 -0
  133. package/src/prove/smt/solver/ast-util.ts +147 -0
  134. package/src/prove/smt/solver/ast.ts +1315 -0
  135. package/src/prove/smt/solver/auf-solver.ts +572 -0
  136. package/src/prove/smt/solver/case-split-queue.ts +178 -0
  137. package/src/prove/smt/solver/cg-table.ts +175 -0
  138. package/src/prove/smt/solver/clause.ts +276 -0
  139. package/src/prove/smt/solver/conflict-resolution.ts +343 -0
  140. package/src/prove/smt/solver/context.ts +1292 -0
  141. package/src/prove/smt/solver/ctx-simplify.ts +334 -0
  142. package/src/prove/smt/solver/der.ts +224 -0
  143. package/src/prove/smt/solver/dyn-ack.ts +141 -0
  144. package/src/prove/smt/solver/e-matching.ts +659 -0
  145. package/src/prove/smt/solver/enode.ts +259 -0
  146. package/src/prove/smt/solver/expr-ref.ts +21 -0
  147. package/src/prove/smt/solver/expr-safe-replace.ts +172 -0
  148. package/src/prove/smt/solver/fingerprints.ts +92 -0
  149. package/src/prove/smt/solver/flat-literals.ts +51 -0
  150. package/src/prove/smt/solver/goal.ts +138 -0
  151. package/src/prove/smt/solver/hash.ts +173 -0
  152. package/src/prove/smt/solver/hashtable.ts +166 -0
  153. package/src/prove/smt/solver/internalizer.ts +1381 -0
  154. package/src/prove/smt/solver/lbool.ts +5 -0
  155. package/src/prove/smt/solver/literal.ts +24 -0
  156. package/src/prove/smt/solver/lp/bound-propagator.ts +391 -0
  157. package/src/prove/smt/solver/lp/constraints.ts +78 -0
  158. package/src/prove/smt/solver/lp/containers.ts +296 -0
  159. package/src/prove/smt/solver/lp/core-solver.ts +504 -0
  160. package/src/prove/smt/solver/lp/cross-nested.ts +224 -0
  161. package/src/prove/smt/solver/lp/dep-intervals.ts +656 -0
  162. package/src/prove/smt/solver/lp/dependency.ts +51 -0
  163. package/src/prove/smt/solver/lp/dioph-eq.ts +1181 -0
  164. package/src/prove/smt/solver/lp/explanation.ts +46 -0
  165. package/src/prove/smt/solver/lp/gomory.ts +255 -0
  166. package/src/prove/smt/solver/lp/hnf-cutter.ts +125 -0
  167. package/src/prove/smt/solver/lp/hnf.ts +281 -0
  168. package/src/prove/smt/solver/lp/int-cube.ts +295 -0
  169. package/src/prove/smt/solver/lp/int-solver.ts +514 -0
  170. package/src/prove/smt/solver/lp/lar-solver.ts +816 -0
  171. package/src/prove/smt/solver/lp/lar-term.ts +62 -0
  172. package/src/prove/smt/solver/lp/lp-settings.ts +91 -0
  173. package/src/prove/smt/solver/lp/maximize-term.ts +347 -0
  174. package/src/prove/smt/solver/lp/nex-creator.ts +381 -0
  175. package/src/prove/smt/solver/lp/nex.ts +120 -0
  176. package/src/prove/smt/solver/lp/nla-backoff.ts +43 -0
  177. package/src/prove/smt/solver/lp/nla-basics.ts +398 -0
  178. package/src/prove/smt/solver/lp/nla-core.ts +968 -0
  179. package/src/prove/smt/solver/lp/nla-divisions.ts +332 -0
  180. package/src/prove/smt/solver/lp/nla-emonics.ts +373 -0
  181. package/src/prove/smt/solver/lp/nla-factorization.ts +30 -0
  182. package/src/prove/smt/solver/lp/nla-grobner.ts +904 -0
  183. package/src/prove/smt/solver/lp/nla-horner.ts +126 -0
  184. package/src/prove/smt/solver/lp/nla-intervals.ts +265 -0
  185. package/src/prove/smt/solver/lp/nla-monomial-bounds.ts +715 -0
  186. package/src/prove/smt/solver/lp/nla-monotone.ts +59 -0
  187. package/src/prove/smt/solver/lp/nla-order.ts +307 -0
  188. package/src/prove/smt/solver/lp/nla-patcher.ts +112 -0
  189. package/src/prove/smt/solver/lp/nla-tangents.ts +251 -0
  190. package/src/prove/smt/solver/lp/nla-throttle.ts +85 -0
  191. package/src/prove/smt/solver/lp/nla-types.ts +124 -0
  192. package/src/prove/smt/solver/lp/nla-var-eqs.ts +141 -0
  193. package/src/prove/smt/solver/lp/nra-solver.ts +440 -0
  194. package/src/prove/smt/solver/lp/numeric-pair.ts +65 -0
  195. package/src/prove/smt/solver/lp/pdd-interval.ts +31 -0
  196. package/src/prove/smt/solver/lp/pdd-simplifier.ts +184 -0
  197. package/src/prove/smt/solver/lp/pdd-solver.ts +408 -0
  198. package/src/prove/smt/solver/lp/pdd.ts +971 -0
  199. package/src/prove/smt/solver/lp/random-updater.ts +138 -0
  200. package/src/prove/smt/solver/lp/static-matrix.ts +246 -0
  201. package/src/prove/smt/solver/lp/union-find.ts +96 -0
  202. package/src/prove/smt/solver/mam-compiler.ts +847 -0
  203. package/src/prove/smt/solver/mam-interpreter.ts +400 -0
  204. package/src/prove/smt/solver/maximize-ac-sharing.ts +118 -0
  205. package/src/prove/smt/solver/model-checker.ts +347 -0
  206. package/src/prove/smt/solver/model-evaluator.ts +262 -0
  207. package/src/prove/smt/solver/model-finder.ts +155 -0
  208. package/src/prove/smt/solver/model-generator.ts +97 -0
  209. package/src/prove/smt/solver/model-macro-solver.ts +728 -0
  210. package/src/prove/smt/solver/nlsat/algebraic.ts +1161 -0
  211. package/src/prove/smt/solver/nlsat/atoms.ts +238 -0
  212. package/src/prove/smt/solver/nlsat/evaluator.ts +303 -0
  213. package/src/prove/smt/solver/nlsat/explain.ts +607 -0
  214. package/src/prove/smt/solver/nlsat/interval-set.ts +351 -0
  215. package/src/prove/smt/solver/nlsat/levelwise.ts +740 -0
  216. package/src/prove/smt/solver/nlsat/mpbq.ts +161 -0
  217. package/src/prove/smt/solver/nlsat/polynomial.ts +1722 -0
  218. package/src/prove/smt/solver/nlsat/solver.ts +911 -0
  219. package/src/prove/smt/solver/nlsat/types.ts +43 -0
  220. package/src/prove/smt/solver/nlsat/upolynomial-factorization.ts +648 -0
  221. package/src/prove/smt/solver/nlsat/upolynomial.ts +996 -0
  222. package/src/prove/smt/solver/nnf.ts +469 -0
  223. package/src/prove/smt/solver/pattern-inference.ts +351 -0
  224. package/src/prove/smt/solver/poly-rewriter.ts +477 -0
  225. package/src/prove/smt/solver/propagate-values.ts +83 -0
  226. package/src/prove/smt/solver/proto-model.ts +551 -0
  227. package/src/prove/smt/solver/pull-quant.ts +139 -0
  228. package/src/prove/smt/solver/qe-lite-der.ts +526 -0
  229. package/src/prove/smt/solver/qe-lite-fm.ts +576 -0
  230. package/src/prove/smt/solver/qe-lite.ts +381 -0
  231. package/src/prove/smt/solver/qi-queue.ts +362 -0
  232. package/src/prove/smt/solver/quant-tactics.ts +117 -0
  233. package/src/prove/smt/solver/quantifier-analyzer.ts +562 -0
  234. package/src/prove/smt/solver/quantifier-manager.ts +186 -0
  235. package/src/prove/smt/solver/random-gen.ts +10 -0
  236. package/src/prove/smt/solver/rational.ts +165 -0
  237. package/src/prove/smt/solver/ref-vector.ts +62 -0
  238. package/src/prove/smt/solver/relevancy.ts +247 -0
  239. package/src/prove/smt/solver/rewriter-tpl.ts +1159 -0
  240. package/src/prove/smt/solver/rewriter.ts +843 -0
  241. package/src/prove/smt/solver/rlimit.ts +79 -0
  242. package/src/prove/smt/solver/smtlib-parser.ts +526 -0
  243. package/src/prove/smt/solver/solver.ts +71 -0
  244. package/src/prove/smt/solver/sort.ts +35 -0
  245. package/src/prove/smt/solver/sticky-generations.ts +69 -0
  246. package/src/prove/smt/solver/theory-lra-axioms.ts +340 -0
  247. package/src/prove/smt/solver/theory-lra-bounds.ts +226 -0
  248. package/src/prove/smt/solver/theory-lra-final-check.ts +252 -0
  249. package/src/prove/smt/solver/theory-lra-internalize.ts +476 -0
  250. package/src/prove/smt/solver/theory-lra-model.ts +243 -0
  251. package/src/prove/smt/solver/theory-lra-propagate.ts +405 -0
  252. package/src/prove/smt/solver/theory-lra-state.ts +43 -0
  253. package/src/prove/smt/solver/theory-lra.ts +56 -0
  254. package/src/prove/smt/solver/var-subst.ts +258 -0
  255. package/src/prove/smt/solver/z3-license.txt +10 -0
  256. package/src/prove/smt/table.ts +170 -0
  257. package/src/prove/tlapm/tlapm.ts +96 -0
  258. package/src/prove/tlaps-module.ts +510 -0
  259. package/src/prove/verdict.ts +13 -0
  260. package/src/prove/zenon/LICENSE +32 -0
  261. package/src/prove/zenon/check/check.ts +105 -0
  262. package/src/prove/zenon/check/definitions.ts +144 -0
  263. package/src/prove/zenon/check/equality.ts +182 -0
  264. package/src/prove/zenon/check/functions.ts +62 -0
  265. package/src/prove/zenon/check/keys.ts +125 -0
  266. package/src/prove/zenon/check/propositional.ts +104 -0
  267. package/src/prove/zenon/check/records.ts +188 -0
  268. package/src/prove/zenon/check/relations.ts +121 -0
  269. package/src/prove/zenon/check/rewrites.ts +224 -0
  270. package/src/prove/zenon/check/sets.ts +302 -0
  271. package/src/prove/zenon/check/terms.ts +127 -0
  272. package/src/prove/zenon/check/tla.ts +126 -0
  273. package/src/prove/zenon/decide.ts +113 -0
  274. package/src/prove/zenon/encode.ts +444 -0
  275. package/src/prove/zenon/eqrel.ts +300 -0
  276. package/src/prove/zenon/equality-rules.ts +435 -0
  277. package/src/prove/zenon/expr.ts +551 -0
  278. package/src/prove/zenon/index-table.ts +350 -0
  279. package/src/prove/zenon/isar-case.ts +513 -0
  280. package/src/prove/zenon/isar.ts +1249 -0
  281. package/src/prove/zenon/limits.ts +15 -0
  282. package/src/prove/zenon/llproof.ts +173 -0
  283. package/src/prove/zenon/mltoll.ts +1566 -0
  284. package/src/prove/zenon/node.ts +297 -0
  285. package/src/prove/zenon/ocaml.ts +169 -0
  286. package/src/prove/zenon/parse.ts +247 -0
  287. package/src/prove/zenon/phrase.ts +191 -0
  288. package/src/prove/zenon/proof.ts +198 -0
  289. package/src/prove/zenon/propositional-rules.ts +387 -0
  290. package/src/prove/zenon/rules.ts +94 -0
  291. package/src/prove/zenon/search.ts +288 -0
  292. package/src/prove/zenon/tla/functions.ts +151 -0
  293. package/src/prove/zenon/tla/llproof.ts +480 -0
  294. package/src/prove/zenon/tla/records.ts +225 -0
  295. package/src/prove/zenon/tla/rewrites.ts +447 -0
  296. package/src/prove/zenon/tla/sets.ts +304 -0
  297. package/src/prove/zenon/tla/terms.ts +181 -0
  298. package/src/prove/zenon/tla/tla.ts +506 -0
  299. package/src/run-cli.ts +63 -10
  300. package/src/worker.ts +65 -0
  301. package/dist/parallel.cjs +0 -12
  302. package/dist/parallel.js +0 -12
  303. /package/src/{obligation-format.ts → obligations/format.ts} +0 -0
@@ -0,0 +1,469 @@
1
+ // Ported from Z3 (src/ast/normal_forms/nnf.cpp, name_exprs.cpp, defined_names.cpp), MIT license, see
2
+ // z3-license.txt. Negation normal form in Z3's default NNF_SKOLEM mode: only subformulas that
3
+ // contain quantifiers are normalized, and existential quantifiers in positive positions become
4
+ // Skolem functions of the enclosing universal variables. A quantifier inside an atom gets a name, a
5
+ // fresh predicate over its free variables, with a definition that is normalized too. Like Z3, the
6
+ // frames, the result stack and the caches hold their expressions, so that expressions are created
7
+ // and deleted in Z3's order.
8
+ import { ActCache } from "./act-cache";
9
+ import {
10
+ AstManager,
11
+ KIND_APP,
12
+ KIND_QUANTIFIER,
13
+ KIND_VAR,
14
+ OP_AND,
15
+ OP_EQ,
16
+ OP_IMPLIES,
17
+ OP_ITE,
18
+ OP_NOT,
19
+ OP_OR,
20
+ OP_XOR,
21
+ SORT_BOOL,
22
+ } from "./ast";
23
+ import { mkNot } from "./ast-util";
24
+ import { RefVector } from "./ref-vector";
25
+ import { RewriterTpl } from "./rewriter-tpl";
26
+ import { elimUnusedVars, getFreeVarSorts, VarSubst } from "./var-subst";
27
+
28
+ // defined_names: the name of each named expression. It holds the expressions and their names.
29
+ export class DefinedNames {
30
+ private names = new Map<number, number>();
31
+ private exprs: RefVector;
32
+ private nameRefs: RefVector;
33
+ private lims: number[] = [];
34
+
35
+ constructor(private manager: AstManager) {
36
+ this.exprs = new RefVector(manager);
37
+ this.nameRefs = new RefVector(manager);
38
+ }
39
+
40
+ push() {
41
+ this.lims.push(this.exprs.size);
42
+ }
43
+
44
+ // pop_scope: forgets the names since the matching push, the last first.
45
+ pop() {
46
+ const size = this.lims[this.lims.length - 1];
47
+ this.lims.pop();
48
+ while (this.exprs.size > size) {
49
+ this.names.delete(this.exprs.items[this.exprs.size - 1]);
50
+ this.exprs.shrink(this.exprs.size - 1);
51
+ this.nameRefs.shrink(this.nameRefs.size - 1);
52
+ }
53
+ }
54
+
55
+ // mk_name: (n x1 ... xk) for the free variables x1 ... xk of the quantifier, with n => q and q => n
56
+ // as the definition, under a universal quantifier whose pattern is the name. The definition comes
57
+ // with a reference, and is -1 when the quantifier already has a name.
58
+ mkName(quantifier: number) {
59
+ const manager = this.manager;
60
+ const existing = this.names.get(quantifier);
61
+ if (existing !== undefined) return { name: existing, definition: -1 };
62
+ // gen_name: a variable that does not occur still takes a position, filled with true.
63
+ const freeVarSorts = getFreeVarSorts(manager, quantifier, manager.freeVarBounds[quantifier]);
64
+ const varSorts = freeVarSorts.map((sort) => sort ?? SORT_BOOL);
65
+ const name = manager.mkApp(
66
+ manager.mkFreshFuncDecl("z3name", varSorts, SORT_BOOL),
67
+ freeVarSorts.map((sort, index) =>
68
+ sort === undefined ? manager.trueExpr : manager.mkVar(index, sort),
69
+ ),
70
+ SORT_BOOL,
71
+ );
72
+ this.names.set(quantifier, name);
73
+ this.exprs.push(quantifier);
74
+ this.nameRefs.push(name);
75
+ // bound_vars: the variables are in reverse order in the quantifier.
76
+ const definition = manager.withTemporaries(() => {
77
+ const boundVars = (conjunct: number) =>
78
+ varSorts.length === 0
79
+ ? conjunct
80
+ : elimUnusedVars(
81
+ manager,
82
+ manager.mkQuantifier({
83
+ isForall: true,
84
+ sorts: varSorts.toReversed(),
85
+ names: varSorts.map((_sort, index) => varSorts.length - 1 - index),
86
+ body: conjunct,
87
+ patterns: [manager.mkPattern([name])],
88
+ weight: 1,
89
+ qid: "",
90
+ }),
91
+ );
92
+ const first = boundVars(manager.mkOr([manager.mkNot(name), quantifier]));
93
+ const second = boundVars(manager.mkOr([name, manager.mkNot(quantifier)]));
94
+ return manager.mkAnd([first, second]);
95
+ });
96
+ return { name, definition };
97
+ }
98
+ }
99
+
100
+ // name_quantifier_labels: a rewriter that replaces each quantifier by its name, and collects the
101
+ // definitions of the new names.
102
+ class QuantifierNamer extends RewriterTpl {
103
+ private definitions: RefVector | null = null;
104
+
105
+ constructor(
106
+ manager: AstManager,
107
+ private names: DefinedNames,
108
+ ) {
109
+ super(manager);
110
+ }
111
+
112
+ getSubst(expr: number) {
113
+ if (this.manager.kinds[expr] !== KIND_QUANTIFIER) return undefined;
114
+ const named = this.names.mkName(expr);
115
+ if (named.definition !== -1) {
116
+ this.definitions?.push(named.definition);
117
+ this.manager.decRef(named.definition);
118
+ }
119
+ return named.name;
120
+ }
121
+
122
+ // The result comes with a reference, which the caller releases.
123
+ name(expr: number, definitions: RefVector) {
124
+ this.definitions = definitions;
125
+ return this.rewrite(expr);
126
+ }
127
+ }
128
+
129
+ // skolemizer: the Skolem functions take the free variables of the quantifier. The function of the
130
+ // last variable comes first, and takes the variable's name.
131
+ class Skolemizer {
132
+ private cache: ActCache;
133
+ private subst: VarSubst;
134
+
135
+ constructor(private manager: AstManager) {
136
+ this.cache = new ActCache(manager, manager.getNumAsts());
137
+ this.subst = new VarSubst(manager, true);
138
+ }
139
+
140
+ // The result comes with a reference, which the caller releases.
141
+ skolemize(quantifier: number) {
142
+ const manager = this.manager;
143
+ const cached = this.cache.find(quantifier, 0);
144
+ if (cached !== undefined) {
145
+ manager.incRef(cached);
146
+ return cached;
147
+ }
148
+ const data = manager.getQuantifier(quantifier);
149
+ const count = data.sorts.length;
150
+ const freeVarSorts = getFreeVarSorts(
151
+ manager,
152
+ data.body,
153
+ manager.freeVarBounds[data.body],
154
+ ).slice(count);
155
+ const args = new RefVector(manager);
156
+ const argSorts: number[] = [];
157
+ freeVarSorts.forEach((sort, index) => {
158
+ if (sort === undefined) return;
159
+ args.push(manager.mkVar(index, sort));
160
+ argSorts.push(sort);
161
+ });
162
+ const substitution = new RefVector(manager);
163
+ for (let index = count - 1; index >= 0; index--) {
164
+ const sort = data.sorts[index];
165
+ substitution.push(
166
+ manager.mkApp(manager.mkFreshFuncDecl(data.names[index], argSorts, sort), args.items, sort),
167
+ );
168
+ }
169
+ freeVarSorts.forEach((sort, index) =>
170
+ substitution.push(sort === undefined ? -1 : manager.mkVar(index, sort)),
171
+ );
172
+ substitution.items.reverse();
173
+ const result = this.subst.apply(data.body, substitution.items);
174
+ substitution.reset();
175
+ args.reset();
176
+ this.cache.insert(quantifier, 0, result);
177
+ return result;
178
+ }
179
+
180
+ // ~skolemizer: the cache goes first, then the substitution.
181
+ release() {
182
+ this.cache.reset();
183
+ this.subst.release();
184
+ }
185
+ }
186
+
187
+ // A normalization still to finish: its expression, the next child, its polarity, whether it is
188
+ // nested in a quantifier, whether to cache its result, and where its children's results start.
189
+ interface Frame {
190
+ curr: number;
191
+ index: number;
192
+ isPositive: boolean;
193
+ isInQuantifier: boolean;
194
+ isCaching: boolean;
195
+ spos: number;
196
+ }
197
+
198
+ // nnf: one object normalizes the formulas of a reduction, and keeps its caches until it is
199
+ // released.
200
+ export class Nnf {
201
+ private frames: Frame[] = [];
202
+ private results: RefVector;
203
+ // One cache per polarity and nesting in a quantifier, in Z3's order of get_cache_idx.
204
+ private caches: ActCache[];
205
+ private todoDefs: RefVector;
206
+ private skolemizer: Skolemizer;
207
+ private namer: QuantifierNamer;
208
+
209
+ constructor(
210
+ private manager: AstManager,
211
+ names: DefinedNames,
212
+ ) {
213
+ this.results = new RefVector(manager);
214
+ this.caches = Array.from({ length: 4 }, () => new ActCache(manager, manager.getNumAsts()));
215
+ this.todoDefs = new RefVector(manager);
216
+ this.skolemizer = new Skolemizer(manager);
217
+ this.namer = new QuantifierNamer(manager, names);
218
+ }
219
+
220
+ // operator(): pushes the normal forms of the definitions of the names it introduced, the last
221
+ // first, then returns the normal form of expr with a reference, which the caller releases.
222
+ apply(expr: number, definitions: RefVector) {
223
+ return this.manager.withoutTemporaries(() => {
224
+ this.reset();
225
+ const result = this.process(expr);
226
+ const start = definitions.size;
227
+ for (let index = 0; index < this.todoDefs.size; index++) {
228
+ const definition = this.process(this.todoDefs.items[index]);
229
+ definitions.pushOwned(definition);
230
+ }
231
+ const added = definitions.items.splice(start).reverse();
232
+ definitions.items.push(...added);
233
+ return result;
234
+ });
235
+ }
236
+
237
+ // ~nnf: the namer, then the skolemizer, the definitions and the caches, the last first.
238
+ release() {
239
+ this.manager.withoutTemporaries(() => {
240
+ this.namer.release();
241
+ this.skolemizer.release();
242
+ this.todoDefs.reset();
243
+ for (let index = this.caches.length - 1; index >= 0; index--) this.caches[index].reset();
244
+ this.results.reset();
245
+ this.popFrames(0);
246
+ });
247
+ }
248
+
249
+ private reset() {
250
+ this.popFrames(0);
251
+ this.results.reset();
252
+ this.todoDefs.reset();
253
+ }
254
+
255
+ private popFrames(size: number) {
256
+ for (const frame of this.frames.splice(size)) this.manager.decRef(frame.curr);
257
+ }
258
+
259
+ private getCache(isPositive: boolean, isInQuantifier: boolean) {
260
+ return this.caches[(isInQuantifier ? 2 : 0) + (isPositive ? 1 : 0)];
261
+ }
262
+
263
+ private pushFrame(
264
+ expr: number,
265
+ isPositive: boolean,
266
+ isInQuantifier: boolean,
267
+ isCaching: boolean,
268
+ ) {
269
+ this.manager.incRef(expr);
270
+ this.frames.push({
271
+ curr: expr,
272
+ index: 0,
273
+ isPositive,
274
+ isInQuantifier,
275
+ isCaching,
276
+ spos: this.results.size,
277
+ });
278
+ }
279
+
280
+ private skip(expr: number, isPositive: boolean) {
281
+ this.results.push(isPositive ? expr : mkNot(this.manager, expr));
282
+ }
283
+
284
+ // visit: whether the result of expr is on the result stack. Otherwise it pushes a frame for expr.
285
+ private visit(expr: number, isPositive: boolean, isInQuantifier: boolean) {
286
+ const manager = this.manager;
287
+ if (!manager.hasQuantifierFlags[expr]) {
288
+ this.skip(expr, isPositive);
289
+ return true;
290
+ }
291
+ const isCaching = manager.getRefCount(expr) > 1;
292
+ if (isCaching) {
293
+ const cached = this.getCache(isPositive, isInQuantifier).find(expr, 0);
294
+ if (cached !== undefined) {
295
+ this.results.push(cached);
296
+ return true;
297
+ }
298
+ }
299
+ const kind = manager.kinds[expr];
300
+ if (kind === KIND_VAR || (kind === KIND_APP && manager.getNumArgs(expr) === 0)) {
301
+ this.skip(expr, isPositive);
302
+ return true;
303
+ }
304
+ this.pushFrame(expr, isPositive, isInQuantifier, isCaching);
305
+ return false;
306
+ }
307
+
308
+ // process: the normal form of expr, with a reference.
309
+ private process(expr: number) {
310
+ const manager = this.manager;
311
+ if (!this.visit(expr, true, false))
312
+ while (this.frames.length > 0) {
313
+ manager.limit.checkpoint();
314
+ const frame = this.frames[this.frames.length - 1];
315
+ const curr = frame.curr;
316
+ if (frame.index === 0 && manager.getRefCount(curr) > 1) {
317
+ const cached = this.getCache(frame.isPositive, frame.isInQuantifier).find(curr, 0);
318
+ if (cached !== undefined) {
319
+ this.results.push(cached);
320
+ this.popFrames(this.frames.length - 1);
321
+ continue;
322
+ }
323
+ }
324
+ const isDone =
325
+ manager.kinds[curr] === KIND_QUANTIFIER
326
+ ? this.processQuantifier(curr, frame)
327
+ : this.processApp(curr, frame);
328
+ if (!isDone) continue;
329
+ if (frame.isCaching)
330
+ this.getCache(frame.isPositive, frame.isInQuantifier).insert(
331
+ curr,
332
+ 0,
333
+ this.results.items[this.results.size - 1],
334
+ );
335
+ this.popFrames(this.frames.length - 1);
336
+ }
337
+ const result = this.results.items[this.results.size - 1];
338
+ this.results.items.pop();
339
+ return result;
340
+ }
341
+
342
+ // Visits the children from frame.index on, each with its polarity, and whether all are done.
343
+ private visitChildren(frame: Frame, children: [number, boolean][]) {
344
+ while (frame.index < children.length) {
345
+ const child = children[frame.index++];
346
+ if (!this.visit(child[0], child[1], frame.isInQuantifier)) return false;
347
+ }
348
+ return true;
349
+ }
350
+
351
+ // Replaces the results from spos on with result.
352
+ private setResult(spos: number, result: number) {
353
+ this.manager.incRef(result);
354
+ this.results.shrink(spos);
355
+ this.results.pushOwned(result);
356
+ }
357
+
358
+ private processApp(expr: number, frame: Frame) {
359
+ const manager = this.manager;
360
+ const isPositive = frame.isPositive;
361
+ const op = manager.getOp(expr);
362
+ switch (op === OP_EQ && !manager.isBool(manager.getArg(expr, 0)) ? -1 : op) {
363
+ case OP_AND:
364
+ case OP_OR: {
365
+ if (
366
+ !this.visitChildren(
367
+ frame,
368
+ manager.mapArgs(expr, (arg) => [arg, isPositive]),
369
+ )
370
+ )
371
+ return false;
372
+ const results = this.results.items.slice(frame.spos);
373
+ this.setResult(
374
+ frame.spos,
375
+ manager.mkApp((op === OP_AND) === isPositive ? OP_AND : OP_OR, results, SORT_BOOL),
376
+ );
377
+ return true;
378
+ }
379
+ case OP_NOT:
380
+ return this.visitChildren(frame, [[manager.getArg(expr, 0), !isPositive]]);
381
+ case OP_IMPLIES: {
382
+ if (
383
+ !this.visitChildren(frame, [
384
+ [manager.getArg(expr, 0), !isPositive],
385
+ [manager.getArg(expr, 1), isPositive],
386
+ ])
387
+ )
388
+ return false;
389
+ const results = this.results.items.slice(frame.spos);
390
+ this.setResult(frame.spos, manager.mkApp(isPositive ? OP_OR : OP_AND, results, SORT_BOOL));
391
+ return true;
392
+ }
393
+ case OP_ITE: {
394
+ if (
395
+ !this.visitChildren(frame, [
396
+ [manager.getArg(expr, 0), true],
397
+ [manager.getArg(expr, 0), false],
398
+ [manager.getArg(expr, 1), isPositive],
399
+ [manager.getArg(expr, 2), isPositive],
400
+ ])
401
+ )
402
+ return false;
403
+ const results = this.results.items.slice(frame.spos);
404
+ const first = manager.mkApp(OP_OR, [results[1], results[2]], SORT_BOOL);
405
+ const second = manager.mkApp(OP_OR, [results[0], results[3]], SORT_BOOL);
406
+ this.setResult(frame.spos, manager.mkApp(OP_AND, [first, second], SORT_BOOL));
407
+ return true;
408
+ }
409
+ case OP_EQ:
410
+ case OP_XOR: {
411
+ if (
412
+ !this.visitChildren(frame, [
413
+ [manager.getArg(expr, 0), true],
414
+ [manager.getArg(expr, 0), false],
415
+ [manager.getArg(expr, 1), true],
416
+ [manager.getArg(expr, 1), false],
417
+ ])
418
+ )
419
+ return false;
420
+ const results = this.results.items.slice(frame.spos);
421
+ const isEquivalence = (op === OP_EQ) === isPositive;
422
+ const first = manager.mkApp(
423
+ OP_OR,
424
+ isEquivalence ? [results[1], results[2]] : [results[0], results[2]],
425
+ SORT_BOOL,
426
+ );
427
+ const second = manager.mkApp(
428
+ OP_OR,
429
+ isEquivalence ? [results[0], results[3]] : [results[1], results[3]],
430
+ SORT_BOOL,
431
+ );
432
+ this.setResult(frame.spos, manager.mkApp(OP_AND, [first, second], SORT_BOOL));
433
+ return true;
434
+ }
435
+ default: {
436
+ // process_default: the quantifiers of an atom get names.
437
+ const named = this.namer.name(expr, this.todoDefs);
438
+ if (isPositive) this.results.pushOwned(named);
439
+ else {
440
+ this.results.push(mkNot(manager, named));
441
+ manager.decRef(named);
442
+ }
443
+ return true;
444
+ }
445
+ }
446
+ }
447
+
448
+ private processQuantifier(quantifier: number, frame: Frame) {
449
+ const manager = this.manager;
450
+ const data = manager.getQuantifier(quantifier);
451
+ const isUniversal = data.isForall === frame.isPositive;
452
+ if (frame.index === 0) {
453
+ frame.index = 1;
454
+ if (isUniversal) {
455
+ if (!this.visit(data.body, frame.isPositive, true)) return false;
456
+ } else {
457
+ const skolemized = this.skolemizer.skolemize(quantifier);
458
+ const isDone = this.visit(skolemized, !data.isForall, frame.isInQuantifier);
459
+ manager.decRef(skolemized);
460
+ if (!isDone) return false;
461
+ }
462
+ }
463
+ // A skolemized quantifier's result is already on the stack.
464
+ if (!isUniversal) return true;
465
+ const body = this.results.items[this.results.size - 1];
466
+ this.setResult(this.results.size - 1, manager.mkQuantifier({ ...data, isForall: true, body }));
467
+ return true;
468
+ }
469
+ }