@stevenvo780/st-lang 4.11.0 → 4.12.0

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 (209) hide show
  1. package/dist/proof-systems/fol-prover-advanced/index.d.ts +7 -0
  2. package/dist/proof-systems/fol-prover-advanced/index.d.ts.map +1 -0
  3. package/dist/proof-systems/fol-prover-advanced/index.js +34 -0
  4. package/dist/proof-systems/fol-prover-advanced/index.js.map +1 -0
  5. package/dist/proof-systems/fol-prover-advanced/ordering.d.ts +34 -0
  6. package/dist/proof-systems/fol-prover-advanced/ordering.d.ts.map +1 -0
  7. package/dist/proof-systems/fol-prover-advanced/ordering.js +197 -0
  8. package/dist/proof-systems/fol-prover-advanced/ordering.js.map +1 -0
  9. package/dist/proof-systems/fol-prover-advanced/prover.d.ts +22 -0
  10. package/dist/proof-systems/fol-prover-advanced/prover.d.ts.map +1 -0
  11. package/dist/proof-systems/fol-prover-advanced/prover.js +219 -0
  12. package/dist/proof-systems/fol-prover-advanced/prover.js.map +1 -0
  13. package/dist/proof-systems/fol-prover-advanced/resolve.d.ts +43 -0
  14. package/dist/proof-systems/fol-prover-advanced/resolve.d.ts.map +1 -0
  15. package/dist/proof-systems/fol-prover-advanced/resolve.js +297 -0
  16. package/dist/proof-systems/fol-prover-advanced/resolve.js.map +1 -0
  17. package/dist/proof-systems/fol-prover-advanced/subsumption.d.ts +28 -0
  18. package/dist/proof-systems/fol-prover-advanced/subsumption.d.ts.map +1 -0
  19. package/dist/proof-systems/fol-prover-advanced/subsumption.js +172 -0
  20. package/dist/proof-systems/fol-prover-advanced/subsumption.js.map +1 -0
  21. package/dist/proof-systems/fol-prover-advanced/types.d.ts +68 -0
  22. package/dist/proof-systems/fol-prover-advanced/types.d.ts.map +1 -0
  23. package/dist/proof-systems/fol-prover-advanced/types.js +12 -0
  24. package/dist/proof-systems/fol-prover-advanced/types.js.map +1 -0
  25. package/dist/proof-systems/fol-prover-advanced/unify.d.ts +15 -0
  26. package/dist/proof-systems/fol-prover-advanced/unify.d.ts.map +1 -0
  27. package/dist/proof-systems/fol-prover-advanced/unify.js +144 -0
  28. package/dist/proof-systems/fol-prover-advanced/unify.js.map +1 -0
  29. package/dist/reasoning/combinatorics/basic-counts.d.ts +6 -0
  30. package/dist/reasoning/combinatorics/basic-counts.d.ts.map +1 -0
  31. package/dist/reasoning/combinatorics/basic-counts.js +82 -0
  32. package/dist/reasoning/combinatorics/basic-counts.js.map +1 -0
  33. package/dist/reasoning/combinatorics/bigint-helpers.d.ts +5 -0
  34. package/dist/reasoning/combinatorics/bigint-helpers.d.ts.map +1 -0
  35. package/dist/reasoning/combinatorics/bigint-helpers.js +8 -0
  36. package/dist/reasoning/combinatorics/bigint-helpers.js.map +1 -0
  37. package/dist/reasoning/combinatorics/burnside.d.ts +15 -0
  38. package/dist/reasoning/combinatorics/burnside.d.ts.map +1 -0
  39. package/dist/reasoning/combinatorics/burnside.js +91 -0
  40. package/dist/reasoning/combinatorics/burnside.js.map +1 -0
  41. package/dist/reasoning/combinatorics/generating-functions.d.ts +12 -0
  42. package/dist/reasoning/combinatorics/generating-functions.d.ts.map +1 -0
  43. package/dist/reasoning/combinatorics/generating-functions.js +67 -0
  44. package/dist/reasoning/combinatorics/generating-functions.js.map +1 -0
  45. package/dist/reasoning/combinatorics/generators.d.ts +5 -0
  46. package/dist/reasoning/combinatorics/generators.d.ts.map +1 -0
  47. package/dist/reasoning/combinatorics/generators.js +111 -0
  48. package/dist/reasoning/combinatorics/generators.js.map +1 -0
  49. package/dist/reasoning/combinatorics/inclusion-exclusion.d.ts +8 -0
  50. package/dist/reasoning/combinatorics/inclusion-exclusion.d.ts.map +1 -0
  51. package/dist/reasoning/combinatorics/inclusion-exclusion.js +45 -0
  52. package/dist/reasoning/combinatorics/inclusion-exclusion.js.map +1 -0
  53. package/dist/reasoning/combinatorics/index.d.ts +10 -0
  54. package/dist/reasoning/combinatorics/index.d.ts.map +1 -0
  55. package/dist/reasoning/combinatorics/index.js +44 -0
  56. package/dist/reasoning/combinatorics/index.js.map +1 -0
  57. package/dist/reasoning/combinatorics/partitions.d.ts +4 -0
  58. package/dist/reasoning/combinatorics/partitions.d.ts.map +1 -0
  59. package/dist/reasoning/combinatorics/partitions.js +90 -0
  60. package/dist/reasoning/combinatorics/partitions.js.map +1 -0
  61. package/dist/reasoning/combinatorics/permutations.d.ts +6 -0
  62. package/dist/reasoning/combinatorics/permutations.d.ts.map +1 -0
  63. package/dist/reasoning/combinatorics/permutations.js +124 -0
  64. package/dist/reasoning/combinatorics/permutations.js.map +1 -0
  65. package/dist/reasoning/combinatorics/set-partitions.d.ts +3 -0
  66. package/dist/reasoning/combinatorics/set-partitions.d.ts.map +1 -0
  67. package/dist/reasoning/combinatorics/set-partitions.js +46 -0
  68. package/dist/reasoning/combinatorics/set-partitions.js.map +1 -0
  69. package/dist/reasoning/combinatorics/special-numbers.d.ts +7 -0
  70. package/dist/reasoning/combinatorics/special-numbers.d.ts.map +1 -0
  71. package/dist/reasoning/combinatorics/special-numbers.js +128 -0
  72. package/dist/reasoning/combinatorics/special-numbers.js.map +1 -0
  73. package/dist/reasoning/constructive-analysis/cauchy.d.ts +51 -0
  74. package/dist/reasoning/constructive-analysis/cauchy.d.ts.map +1 -0
  75. package/dist/reasoning/constructive-analysis/cauchy.js +77 -0
  76. package/dist/reasoning/constructive-analysis/cauchy.js.map +1 -0
  77. package/dist/reasoning/constructive-analysis/compact.d.ts +35 -0
  78. package/dist/reasoning/constructive-analysis/compact.d.ts.map +1 -0
  79. package/dist/reasoning/constructive-analysis/compact.js +61 -0
  80. package/dist/reasoning/constructive-analysis/compact.js.map +1 -0
  81. package/dist/reasoning/constructive-analysis/continuity.d.ts +62 -0
  82. package/dist/reasoning/constructive-analysis/continuity.d.ts.map +1 -0
  83. package/dist/reasoning/constructive-analysis/continuity.js +112 -0
  84. package/dist/reasoning/constructive-analysis/continuity.js.map +1 -0
  85. package/dist/reasoning/constructive-analysis/index.d.ts +24 -0
  86. package/dist/reasoning/constructive-analysis/index.d.ts.map +1 -0
  87. package/dist/reasoning/constructive-analysis/index.js +36 -0
  88. package/dist/reasoning/constructive-analysis/index.js.map +1 -0
  89. package/dist/reasoning/constructive-analysis/integral.d.ts +31 -0
  90. package/dist/reasoning/constructive-analysis/integral.d.ts.map +1 -0
  91. package/dist/reasoning/constructive-analysis/integral.js +59 -0
  92. package/dist/reasoning/constructive-analysis/integral.js.map +1 -0
  93. package/dist/reasoning/constructive-analysis/ivt.d.ts +41 -0
  94. package/dist/reasoning/constructive-analysis/ivt.d.ts.map +1 -0
  95. package/dist/reasoning/constructive-analysis/ivt.js +115 -0
  96. package/dist/reasoning/constructive-analysis/ivt.js.map +1 -0
  97. package/dist/reasoning/constructive-reals/index.d.ts +23 -0
  98. package/dist/reasoning/constructive-reals/index.d.ts.map +1 -1
  99. package/dist/reasoning/constructive-reals/index.js +52 -1
  100. package/dist/reasoning/constructive-reals/index.js.map +1 -1
  101. package/dist/reasoning/linear-algebra/index.d.ts +69 -0
  102. package/dist/reasoning/linear-algebra/index.d.ts.map +1 -0
  103. package/dist/reasoning/linear-algebra/index.js +859 -0
  104. package/dist/reasoning/linear-algebra/index.js.map +1 -0
  105. package/dist/reasoning/set-theory/hf-functions.d.ts +35 -0
  106. package/dist/reasoning/set-theory/hf-functions.d.ts.map +1 -0
  107. package/dist/reasoning/set-theory/hf-functions.js +147 -0
  108. package/dist/reasoning/set-theory/hf-functions.js.map +1 -0
  109. package/dist/reasoning/set-theory/hf-sets.d.ts +79 -0
  110. package/dist/reasoning/set-theory/hf-sets.d.ts.map +1 -0
  111. package/dist/reasoning/set-theory/hf-sets.js +338 -0
  112. package/dist/reasoning/set-theory/hf-sets.js.map +1 -0
  113. package/dist/reasoning/set-theory/index.d.ts +7 -0
  114. package/dist/reasoning/set-theory/index.d.ts.map +1 -0
  115. package/dist/reasoning/set-theory/index.js +44 -0
  116. package/dist/reasoning/set-theory/index.js.map +1 -0
  117. package/dist/reasoning/set-theory/zfc-axioms.d.ts +59 -0
  118. package/dist/reasoning/set-theory/zfc-axioms.d.ts.map +1 -0
  119. package/dist/reasoning/set-theory/zfc-axioms.js +245 -0
  120. package/dist/reasoning/set-theory/zfc-axioms.js.map +1 -0
  121. package/dist/tests/proof-systems/fol-prover-advanced/prover.test.d.ts +2 -0
  122. package/dist/tests/proof-systems/fol-prover-advanced/prover.test.d.ts.map +1 -0
  123. package/dist/tests/proof-systems/fol-prover-advanced/prover.test.js +253 -0
  124. package/dist/tests/proof-systems/fol-prover-advanced/prover.test.js.map +1 -0
  125. package/dist/tests/reasoning/combinatorics/combinatorics.test.d.ts +2 -0
  126. package/dist/tests/reasoning/combinatorics/combinatorics.test.d.ts.map +1 -0
  127. package/dist/tests/reasoning/combinatorics/combinatorics.test.js +256 -0
  128. package/dist/tests/reasoning/combinatorics/combinatorics.test.js.map +1 -0
  129. package/dist/tests/reasoning/constructive-analysis/constructive-analysis.test.d.ts +2 -0
  130. package/dist/tests/reasoning/constructive-analysis/constructive-analysis.test.d.ts.map +1 -0
  131. package/dist/tests/reasoning/constructive-analysis/constructive-analysis.test.js +174 -0
  132. package/dist/tests/reasoning/constructive-analysis/constructive-analysis.test.js.map +1 -0
  133. package/dist/tests/reasoning/linear-algebra/linear-algebra.test.d.ts +2 -0
  134. package/dist/tests/reasoning/linear-algebra/linear-algebra.test.d.ts.map +1 -0
  135. package/dist/tests/reasoning/linear-algebra/linear-algebra.test.js +369 -0
  136. package/dist/tests/reasoning/linear-algebra/linear-algebra.test.js.map +1 -0
  137. package/dist/tests/reasoning/set-theory/hf-functions.test.d.ts +2 -0
  138. package/dist/tests/reasoning/set-theory/hf-functions.test.d.ts.map +1 -0
  139. package/dist/tests/reasoning/set-theory/hf-functions.test.js +122 -0
  140. package/dist/tests/reasoning/set-theory/hf-functions.test.js.map +1 -0
  141. package/dist/tests/reasoning/set-theory/hf-sets.test.d.ts +2 -0
  142. package/dist/tests/reasoning/set-theory/hf-sets.test.d.ts.map +1 -0
  143. package/dist/tests/reasoning/set-theory/hf-sets.test.js +177 -0
  144. package/dist/tests/reasoning/set-theory/hf-sets.test.js.map +1 -0
  145. package/dist/tests/reasoning/set-theory/zfc-axioms.test.d.ts +2 -0
  146. package/dist/tests/reasoning/set-theory/zfc-axioms.test.d.ts.map +1 -0
  147. package/dist/tests/reasoning/set-theory/zfc-axioms.test.js +56 -0
  148. package/dist/tests/reasoning/set-theory/zfc-axioms.test.js.map +1 -0
  149. package/dist/tests/tooling/doc-gen/doc-gen.test.d.ts +2 -0
  150. package/dist/tests/tooling/doc-gen/doc-gen.test.d.ts.map +1 -0
  151. package/dist/tests/tooling/doc-gen/doc-gen.test.js +350 -0
  152. package/dist/tests/tooling/doc-gen/doc-gen.test.js.map +1 -0
  153. package/dist/tests/tooling/test-harness/test-harness.test.d.ts +2 -0
  154. package/dist/tests/tooling/test-harness/test-harness.test.d.ts.map +1 -0
  155. package/dist/tests/tooling/test-harness/test-harness.test.js +208 -0
  156. package/dist/tests/tooling/test-harness/test-harness.test.js.map +1 -0
  157. package/dist/tooling/doc-gen/extract.d.ts +13 -0
  158. package/dist/tooling/doc-gen/extract.d.ts.map +1 -0
  159. package/dist/tooling/doc-gen/extract.js +379 -0
  160. package/dist/tooling/doc-gen/extract.js.map +1 -0
  161. package/dist/tooling/doc-gen/generate.d.ts +9 -0
  162. package/dist/tooling/doc-gen/generate.d.ts.map +1 -0
  163. package/dist/tooling/doc-gen/generate.js +116 -0
  164. package/dist/tooling/doc-gen/generate.js.map +1 -0
  165. package/dist/tooling/doc-gen/index.d.ts +7 -0
  166. package/dist/tooling/doc-gen/index.d.ts.map +1 -0
  167. package/dist/tooling/doc-gen/index.js +39 -0
  168. package/dist/tooling/doc-gen/index.js.map +1 -0
  169. package/dist/tooling/doc-gen/jsdoc.d.ts +31 -0
  170. package/dist/tooling/doc-gen/jsdoc.d.ts.map +1 -0
  171. package/dist/tooling/doc-gen/jsdoc.js +140 -0
  172. package/dist/tooling/doc-gen/jsdoc.js.map +1 -0
  173. package/dist/tooling/doc-gen/render.d.ts +29 -0
  174. package/dist/tooling/doc-gen/render.d.ts.map +1 -0
  175. package/dist/tooling/doc-gen/render.js +206 -0
  176. package/dist/tooling/doc-gen/render.js.map +1 -0
  177. package/dist/tooling/doc-gen/types.d.ts +51 -0
  178. package/dist/tooling/doc-gen/types.d.ts.map +1 -0
  179. package/dist/tooling/doc-gen/types.js +10 -0
  180. package/dist/tooling/doc-gen/types.js.map +1 -0
  181. package/dist/tooling/test-harness/combinators.d.ts +14 -0
  182. package/dist/tooling/test-harness/combinators.d.ts.map +1 -0
  183. package/dist/tooling/test-harness/combinators.js +122 -0
  184. package/dist/tooling/test-harness/combinators.js.map +1 -0
  185. package/dist/tooling/test-harness/coverage.d.ts +3 -0
  186. package/dist/tooling/test-harness/coverage.d.ts.map +1 -0
  187. package/dist/tooling/test-harness/coverage.js +32 -0
  188. package/dist/tooling/test-harness/coverage.js.map +1 -0
  189. package/dist/tooling/test-harness/generators.d.ts +6 -0
  190. package/dist/tooling/test-harness/generators.d.ts.map +1 -0
  191. package/dist/tooling/test-harness/generators.js +66 -0
  192. package/dist/tooling/test-harness/generators.js.map +1 -0
  193. package/dist/tooling/test-harness/index.d.ts +7 -0
  194. package/dist/tooling/test-harness/index.d.ts.map +1 -0
  195. package/dist/tooling/test-harness/index.js +27 -0
  196. package/dist/tooling/test-harness/index.js.map +1 -0
  197. package/dist/tooling/test-harness/mutation.d.ts +4 -0
  198. package/dist/tooling/test-harness/mutation.d.ts.map +1 -0
  199. package/dist/tooling/test-harness/mutation.js +28 -0
  200. package/dist/tooling/test-harness/mutation.js.map +1 -0
  201. package/dist/tooling/test-harness/snapshot.d.ts +5 -0
  202. package/dist/tooling/test-harness/snapshot.d.ts.map +1 -0
  203. package/dist/tooling/test-harness/snapshot.js +86 -0
  204. package/dist/tooling/test-harness/snapshot.js.map +1 -0
  205. package/dist/tooling/test-harness/types.d.ts +32 -0
  206. package/dist/tooling/test-harness/types.d.ts.map +1 -0
  207. package/dist/tooling/test-harness/types.js +3 -0
  208. package/dist/tooling/test-harness/types.js.map +1 -0
  209. package/package.json +1 -1
@@ -0,0 +1,245 @@
1
+ "use strict";
2
+ /**
3
+ * Sanity checks of selected ZFC axioms restricted to the Vω fragment.
4
+ *
5
+ * Most axioms hold on Vω: extensionality, pairing, union, power set,
6
+ * foundation, separation, replacement. Infinity FAILS on Vω because Vω
7
+ * is exactly the universe of hereditarily finite sets — there is no
8
+ * infinite set inside it.
9
+ *
10
+ * The "check" functions verify on a sample of HF sets. They return
11
+ * `holds = false` plus a counterexample when violated.
12
+ */
13
+ Object.defineProperty(exports, "__esModule", { value: true });
14
+ exports.checkExtensionality = checkExtensionality;
15
+ exports.checkPairing = checkPairing;
16
+ exports.checkUnion = checkUnion;
17
+ exports.checkPowerSet = checkPowerSet;
18
+ exports.checkInfinity = checkInfinity;
19
+ exports.checkFoundation = checkFoundation;
20
+ exports.checkAllAxioms = checkAllAxioms;
21
+ const hf_sets_1 = require("./hf-sets");
22
+ /**
23
+ * Sample universe of small HF sets used by the probabilistic checks.
24
+ * Includes ∅, the first few naturals, singletons, pairs and a small
25
+ * power-set tower. Bounded to keep the checks fast.
26
+ */
27
+ function sampleUniverse() {
28
+ const universe = [hf_sets_1.EMPTY];
29
+ const seen = new Set([(0, hf_sets_1.canonicalize)(hf_sets_1.EMPTY)]);
30
+ const push = (s) => {
31
+ const k = (0, hf_sets_1.canonicalize)(s);
32
+ if (!seen.has(k)) {
33
+ seen.add(k);
34
+ universe.push(s);
35
+ }
36
+ };
37
+ for (let i = 1; i <= 4; i++) {
38
+ push((0, hf_sets_1.nat)(i));
39
+ }
40
+ // Snapshot the length to avoid feeding new singletons back into the
41
+ // iteration (would diverge: each singleton is distinct from prior).
42
+ const snapshotLen = universe.length;
43
+ for (let i = 0; i < snapshotLen; i++) {
44
+ const base = universe[i];
45
+ if (base !== undefined) {
46
+ push((0, hf_sets_1.singleton)(base));
47
+ }
48
+ }
49
+ push((0, hf_sets_1.pair)(hf_sets_1.EMPTY, (0, hf_sets_1.singleton)(hf_sets_1.EMPTY)));
50
+ push((0, hf_sets_1.powerSet)((0, hf_sets_1.nat)(2)));
51
+ return universe;
52
+ }
53
+ /**
54
+ * Axiom of Extensionality: ∀A ∀B (A = B ↔ ∀x (x ∈ A ↔ x ∈ B)).
55
+ * Our canonicalization implements extensionality directly, so we verify
56
+ * agreement on a sample plus the contrapositive on intentionally distinct
57
+ * sets.
58
+ */
59
+ function checkExtensionality() {
60
+ const universe = sampleUniverse();
61
+ for (const a of universe) {
62
+ for (const b of universe) {
63
+ const sameElements = a.elements.length === 0 && b.elements.length === 0
64
+ ? true
65
+ : (0, hf_sets_1.isSubset)(a, b) && (0, hf_sets_1.isSubset)(b, a);
66
+ const eq = (0, hf_sets_1.setEquals)(a, b);
67
+ if (eq !== sameElements) {
68
+ return {
69
+ name: 'Extensionality',
70
+ holds: false,
71
+ counterexample: [a, b]
72
+ };
73
+ }
74
+ }
75
+ }
76
+ // Order/duplication invariance.
77
+ const a1 = (0, hf_sets_1.pair)(hf_sets_1.EMPTY, (0, hf_sets_1.singleton)(hf_sets_1.EMPTY));
78
+ const a2 = (0, hf_sets_1.pair)((0, hf_sets_1.singleton)(hf_sets_1.EMPTY), hf_sets_1.EMPTY);
79
+ if (!(0, hf_sets_1.setEquals)(a1, a2)) {
80
+ return { name: 'Extensionality', holds: false, counterexample: [a1, a2] };
81
+ }
82
+ return { name: 'Extensionality', holds: true };
83
+ }
84
+ /**
85
+ * Axiom of Pairing: ∀a ∀b ∃P (a ∈ P ∧ b ∈ P ∧ ∀x (x ∈ P → x = a ∨ x = b)).
86
+ */
87
+ function checkPairing(_samples = 0) {
88
+ const universe = sampleUniverse();
89
+ for (const a of universe) {
90
+ for (const b of universe) {
91
+ const p = (0, hf_sets_1.pair)(a, b);
92
+ if (!(0, hf_sets_1.isElement)(a, p) || !(0, hf_sets_1.isElement)(b, p)) {
93
+ return { name: 'Pairing', holds: false, counterexample: [a, b, p] };
94
+ }
95
+ const expectedCard = (0, hf_sets_1.setEquals)(a, b) ? 1 : 2;
96
+ if ((0, hf_sets_1.cardinality)(p) !== expectedCard) {
97
+ return { name: 'Pairing', holds: false, counterexample: [a, b, p] };
98
+ }
99
+ }
100
+ }
101
+ return { name: 'Pairing', holds: true };
102
+ }
103
+ /**
104
+ * Axiom of Union: for any family F there exists ⋃F such that x ∈ ⋃F iff
105
+ * x ∈ A for some A ∈ F.
106
+ */
107
+ function checkUnion(_samples = 0) {
108
+ const universe = sampleUniverse();
109
+ for (const a of universe) {
110
+ for (const b of universe) {
111
+ const u = (0, hf_sets_1.union)(a, b);
112
+ for (const x of a.elements) {
113
+ if (!(0, hf_sets_1.isElement)(x, u)) {
114
+ return { name: 'Union', holds: false, counterexample: [a, b, x] };
115
+ }
116
+ }
117
+ for (const x of b.elements) {
118
+ if (!(0, hf_sets_1.isElement)(x, u)) {
119
+ return { name: 'Union', holds: false, counterexample: [a, b, x] };
120
+ }
121
+ }
122
+ for (const x of u.elements) {
123
+ if (!(0, hf_sets_1.isElement)(x, a) && !(0, hf_sets_1.isElement)(x, b)) {
124
+ return { name: 'Union', holds: false, counterexample: [a, b, x] };
125
+ }
126
+ }
127
+ }
128
+ }
129
+ // Generalized union over a small family.
130
+ const family = [(0, hf_sets_1.nat)(2), (0, hf_sets_1.singleton)((0, hf_sets_1.nat)(3)), (0, hf_sets_1.pair)(hf_sets_1.EMPTY, (0, hf_sets_1.nat)(1))];
131
+ const big = (0, hf_sets_1.unionFamily)(family);
132
+ for (const member of family) {
133
+ for (const x of member.elements) {
134
+ if (!(0, hf_sets_1.isElement)(x, big)) {
135
+ return { name: 'Union', holds: false, counterexample: [member, x] };
136
+ }
137
+ }
138
+ }
139
+ return { name: 'Union', holds: true };
140
+ }
141
+ /**
142
+ * Axiom of Power Set: ∀A ∃P (∀x (x ∈ P ↔ x ⊆ A)). Sample over small sets
143
+ * to keep |P(A)| = 2^|A| manageable.
144
+ */
145
+ function checkPowerSet(_samples = 0) {
146
+ const universe = sampleUniverse().filter((s) => (0, hf_sets_1.cardinality)(s) <= 3);
147
+ for (const a of universe) {
148
+ const p = (0, hf_sets_1.powerSet)(a);
149
+ const expected = 1 << (0, hf_sets_1.cardinality)(a);
150
+ if ((0, hf_sets_1.cardinality)(p) !== expected) {
151
+ return { name: 'Power Set', holds: false, counterexample: [a, p] };
152
+ }
153
+ for (const s of p.elements) {
154
+ if (!(0, hf_sets_1.isSubset)(s, a)) {
155
+ return { name: 'Power Set', holds: false, counterexample: [a, s] };
156
+ }
157
+ }
158
+ // ∅ and A itself are always in P(A).
159
+ if (!(0, hf_sets_1.isElement)(hf_sets_1.EMPTY, p)) {
160
+ return { name: 'Power Set', holds: false, counterexample: [a, p] };
161
+ }
162
+ if (!(0, hf_sets_1.isElement)(a, p)) {
163
+ return { name: 'Power Set', holds: false, counterexample: [a, p] };
164
+ }
165
+ }
166
+ return { name: 'Power Set', holds: true };
167
+ }
168
+ /**
169
+ * Axiom of Infinity: ∃I (∅ ∈ I ∧ ∀x (x ∈ I → succ(x) ∈ I)). This is
170
+ * exactly what fails on Vω: there is no HF set closed under successor,
171
+ * because successor strictly increases rank and HF sets have finite rank.
172
+ *
173
+ * We "witness" the failure by attempting a closure construction: start
174
+ * with ∅, repeatedly add successors, and observe that the inductive set
175
+ * cannot terminate inside Vω. Programmatically we cap the search depth
176
+ * and report holds=false with the partial witness.
177
+ */
178
+ function checkInfinity() {
179
+ const seen = new Set([(0, hf_sets_1.canonicalize)(hf_sets_1.EMPTY)]);
180
+ let current = hf_sets_1.EMPTY;
181
+ const witnesses = [current];
182
+ const CAP = 32;
183
+ for (let i = 0; i < CAP; i++) {
184
+ const next = (0, hf_sets_1.succ)(current);
185
+ const key = (0, hf_sets_1.canonicalize)(next);
186
+ if (seen.has(key)) {
187
+ // Would mean closure — should never happen in Vω.
188
+ return {
189
+ name: 'Infinity',
190
+ holds: true,
191
+ note: 'closure detected (unexpected for Vω)',
192
+ counterexample: witnesses
193
+ };
194
+ }
195
+ seen.add(key);
196
+ witnesses.push(next);
197
+ current = next;
198
+ }
199
+ return {
200
+ name: 'Infinity',
201
+ holds: false,
202
+ note: 'Vω no contiene un conjunto inductivo: successor strictamente aumenta el rango',
203
+ counterexample: witnesses
204
+ };
205
+ }
206
+ /**
207
+ * Axiom of Foundation (Regularity): every nonempty set A has an element
208
+ * disjoint from A. On HF sets this holds automatically because the
209
+ * membership relation is well-founded by construction (no cycles, no
210
+ * infinite descending chains).
211
+ */
212
+ function checkFoundation(_samples = 0) {
213
+ const universe = sampleUniverse().filter((s) => s.elements.length > 0);
214
+ for (const a of universe) {
215
+ let foundDisjoint = false;
216
+ for (const e of a.elements) {
217
+ let disjoint = true;
218
+ for (const inner of e.elements) {
219
+ if ((0, hf_sets_1.isElement)(inner, a)) {
220
+ disjoint = false;
221
+ break;
222
+ }
223
+ }
224
+ if (disjoint) {
225
+ foundDisjoint = true;
226
+ break;
227
+ }
228
+ }
229
+ if (!foundDisjoint) {
230
+ return { name: 'Foundation', holds: false, counterexample: [a] };
231
+ }
232
+ }
233
+ return { name: 'Foundation', holds: true };
234
+ }
235
+ function checkAllAxioms() {
236
+ return [
237
+ checkExtensionality(),
238
+ checkPairing(),
239
+ checkUnion(),
240
+ checkPowerSet(),
241
+ checkInfinity(),
242
+ checkFoundation()
243
+ ];
244
+ }
245
+ //# sourceMappingURL=zfc-axioms.js.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"zfc-axioms.js","sourceRoot":"","sources":["../../../src/reasoning/set-theory/zfc-axioms.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;GAUG;;AAgEH,kDAyBC;AAKD,oCAeC;AAMD,gCAiCC;AAMD,sCAsBC;AAYD,sCA2BC;AAQD,0CAsBC;AAED,wCASC;AA9PD,uCAemB;AASnB;;;;GAIG;AACH,SAAS,cAAc;IACrB,MAAM,QAAQ,GAAY,CAAC,eAAK,CAAC,CAAC;IAClC,MAAM,IAAI,GAAG,IAAI,GAAG,CAAS,CAAC,IAAA,sBAAY,EAAC,eAAK,CAAC,CAAC,CAAC,CAAC;IACpD,MAAM,IAAI,GAAG,CAAC,CAAQ,EAAQ,EAAE;QAC9B,MAAM,CAAC,GAAG,IAAA,sBAAY,EAAC,CAAC,CAAC,CAAC;QAC1B,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;YACjB,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YACZ,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACnB,CAAC;IACH,CAAC,CAAC;IACF,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC5B,IAAI,CAAC,IAAA,aAAG,EAAC,CAAC,CAAC,CAAC,CAAC;IACf,CAAC;IACD,oEAAoE;IACpE,oEAAoE;IACpE,MAAM,WAAW,GAAG,QAAQ,CAAC,MAAM,CAAC;IACpC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,WAAW,EAAE,CAAC,EAAE,EAAE,CAAC;QACrC,MAAM,IAAI,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;QACzB,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;YACvB,IAAI,CAAC,IAAA,mBAAS,EAAC,IAAI,CAAC,CAAC,CAAC;QACxB,CAAC;IACH,CAAC;IACD,IAAI,CAAC,IAAA,cAAI,EAAC,eAAK,EAAE,IAAA,mBAAS,EAAC,eAAK,CAAC,CAAC,CAAC,CAAC;IACpC,IAAI,CAAC,IAAA,kBAAQ,EAAC,IAAA,aAAG,EAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACvB,OAAO,QAAQ,CAAC;AAClB,CAAC;AAED;;;;;GAKG;AACH,SAAgB,mBAAmB;IACjC,MAAM,QAAQ,GAAG,cAAc,EAAE,CAAC;IAClC,KAAK,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;QACzB,KAAK,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;YACzB,MAAM,YAAY,GAChB,CAAC,CAAC,QAAQ,CAAC,MAAM,KAAK,CAAC,IAAI,CAAC,CAAC,QAAQ,CAAC,MAAM,KAAK,CAAC;gBAChD,CAAC,CAAC,IAAI;gBACN,CAAC,CAAC,IAAA,kBAAQ,EAAC,CAAC,EAAE,CAAC,CAAC,IAAI,IAAA,kBAAQ,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YACvC,MAAM,EAAE,GAAG,IAAA,mBAAS,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAC3B,IAAI,EAAE,KAAK,YAAY,EAAE,CAAC;gBACxB,OAAO;oBACL,IAAI,EAAE,gBAAgB;oBACtB,KAAK,EAAE,KAAK;oBACZ,cAAc,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC;iBACvB,CAAC;YACJ,CAAC;QACH,CAAC;IACH,CAAC;IACD,gCAAgC;IAChC,MAAM,EAAE,GAAG,IAAA,cAAI,EAAC,eAAK,EAAE,IAAA,mBAAS,EAAC,eAAK,CAAC,CAAC,CAAC;IACzC,MAAM,EAAE,GAAG,IAAA,cAAI,EAAC,IAAA,mBAAS,EAAC,eAAK,CAAC,EAAE,eAAK,CAAC,CAAC;IACzC,IAAI,CAAC,IAAA,mBAAS,EAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC;QACvB,OAAO,EAAE,IAAI,EAAE,gBAAgB,EAAE,KAAK,EAAE,KAAK,EAAE,cAAc,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC;IAC5E,CAAC;IACD,OAAO,EAAE,IAAI,EAAE,gBAAgB,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC;AACjD,CAAC;AAED;;GAEG;AACH,SAAgB,YAAY,CAAC,QAAQ,GAAG,CAAC;IACvC,MAAM,QAAQ,GAAG,cAAc,EAAE,CAAC;IAClC,KAAK,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;QACzB,KAAK,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;YACzB,MAAM,CAAC,GAAG,IAAA,cAAI,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YACrB,IAAI,CAAC,IAAA,mBAAS,EAAC,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,IAAA,mBAAS,EAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC;gBACzC,OAAO,EAAE,IAAI,EAAE,SAAS,EAAE,KAAK,EAAE,KAAK,EAAE,cAAc,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC;YACtE,CAAC;YACD,MAAM,YAAY,GAAG,IAAA,mBAAS,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAC7C,IAAI,IAAA,qBAAW,EAAC,CAAC,CAAC,KAAK,YAAY,EAAE,CAAC;gBACpC,OAAO,EAAE,IAAI,EAAE,SAAS,EAAE,KAAK,EAAE,KAAK,EAAE,cAAc,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC;YACtE,CAAC;QACH,CAAC;IACH,CAAC;IACD,OAAO,EAAE,IAAI,EAAE,SAAS,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC;AAC1C,CAAC;AAED;;;GAGG;AACH,SAAgB,UAAU,CAAC,QAAQ,GAAG,CAAC;IACrC,MAAM,QAAQ,GAAG,cAAc,EAAE,CAAC;IAClC,KAAK,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;QACzB,KAAK,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;YACzB,MAAM,CAAC,GAAG,IAAA,eAAK,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YACtB,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,QAAQ,EAAE,CAAC;gBAC3B,IAAI,CAAC,IAAA,mBAAS,EAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC;oBACrB,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,cAAc,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC;gBACpE,CAAC;YACH,CAAC;YACD,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,QAAQ,EAAE,CAAC;gBAC3B,IAAI,CAAC,IAAA,mBAAS,EAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC;oBACrB,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,cAAc,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC;gBACpE,CAAC;YACH,CAAC;YACD,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,QAAQ,EAAE,CAAC;gBAC3B,IAAI,CAAC,IAAA,mBAAS,EAAC,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,IAAA,mBAAS,EAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC;oBACzC,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,cAAc,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC;gBACpE,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IACD,yCAAyC;IACzC,MAAM,MAAM,GAAG,CAAC,IAAA,aAAG,EAAC,CAAC,CAAC,EAAE,IAAA,mBAAS,EAAC,IAAA,aAAG,EAAC,CAAC,CAAC,CAAC,EAAE,IAAA,cAAI,EAAC,eAAK,EAAE,IAAA,aAAG,EAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAChE,MAAM,GAAG,GAAG,IAAA,qBAAW,EAAC,MAAM,CAAC,CAAC;IAChC,KAAK,MAAM,MAAM,IAAI,MAAM,EAAE,CAAC;QAC5B,KAAK,MAAM,CAAC,IAAI,MAAM,CAAC,QAAQ,EAAE,CAAC;YAChC,IAAI,CAAC,IAAA,mBAAS,EAAC,CAAC,EAAE,GAAG,CAAC,EAAE,CAAC;gBACvB,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,cAAc,EAAE,CAAC,MAAM,EAAE,CAAC,CAAC,EAAE,CAAC;YACtE,CAAC;QACH,CAAC;IACH,CAAC;IACD,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC;AACxC,CAAC;AAED;;;GAGG;AACH,SAAgB,aAAa,CAAC,QAAQ,GAAG,CAAC;IACxC,MAAM,QAAQ,GAAG,cAAc,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAA,qBAAW,EAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;IACrE,KAAK,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;QACzB,MAAM,CAAC,GAAG,IAAA,kBAAQ,EAAC,CAAC,CAAC,CAAC;QACtB,MAAM,QAAQ,GAAG,CAAC,IAAI,IAAA,qBAAW,EAAC,CAAC,CAAC,CAAC;QACrC,IAAI,IAAA,qBAAW,EAAC,CAAC,CAAC,KAAK,QAAQ,EAAE,CAAC;YAChC,OAAO,EAAE,IAAI,EAAE,WAAW,EAAE,KAAK,EAAE,KAAK,EAAE,cAAc,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC;QACrE,CAAC;QACD,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,QAAQ,EAAE,CAAC;YAC3B,IAAI,CAAC,IAAA,kBAAQ,EAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC;gBACpB,OAAO,EAAE,IAAI,EAAE,WAAW,EAAE,KAAK,EAAE,KAAK,EAAE,cAAc,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC;YACrE,CAAC;QACH,CAAC;QACD,qCAAqC;QACrC,IAAI,CAAC,IAAA,mBAAS,EAAC,eAAK,EAAE,CAAC,CAAC,EAAE,CAAC;YACzB,OAAO,EAAE,IAAI,EAAE,WAAW,EAAE,KAAK,EAAE,KAAK,EAAE,cAAc,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC;QACrE,CAAC;QACD,IAAI,CAAC,IAAA,mBAAS,EAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC;YACrB,OAAO,EAAE,IAAI,EAAE,WAAW,EAAE,KAAK,EAAE,KAAK,EAAE,cAAc,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC;QACrE,CAAC;IACH,CAAC;IACD,OAAO,EAAE,IAAI,EAAE,WAAW,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC;AAC5C,CAAC;AAED;;;;;;;;;GASG;AACH,SAAgB,aAAa;IAC3B,MAAM,IAAI,GAAG,IAAI,GAAG,CAAS,CAAC,IAAA,sBAAY,EAAC,eAAK,CAAC,CAAC,CAAC,CAAC;IACpD,IAAI,OAAO,GAAU,eAAK,CAAC;IAC3B,MAAM,SAAS,GAAY,CAAC,OAAO,CAAC,CAAC;IACrC,MAAM,GAAG,GAAG,EAAE,CAAC;IACf,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;QAC7B,MAAM,IAAI,GAAG,IAAA,cAAI,EAAC,OAAO,CAAC,CAAC;QAC3B,MAAM,GAAG,GAAG,IAAA,sBAAY,EAAC,IAAI,CAAC,CAAC;QAC/B,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;YAClB,kDAAkD;YAClD,OAAO;gBACL,IAAI,EAAE,UAAU;gBAChB,KAAK,EAAE,IAAI;gBACX,IAAI,EAAE,sCAAsC;gBAC5C,cAAc,EAAE,SAAS;aAC1B,CAAC;QACJ,CAAC;QACD,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACd,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACrB,OAAO,GAAG,IAAI,CAAC;IACjB,CAAC;IACD,OAAO;QACL,IAAI,EAAE,UAAU;QAChB,KAAK,EAAE,KAAK;QACZ,IAAI,EAAE,+EAA+E;QACrF,cAAc,EAAE,SAAS;KAC1B,CAAC;AACJ,CAAC;AAED;;;;;GAKG;AACH,SAAgB,eAAe,CAAC,QAAQ,GAAG,CAAC;IAC1C,MAAM,QAAQ,GAAG,cAAc,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IACvE,KAAK,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;QACzB,IAAI,aAAa,GAAG,KAAK,CAAC;QAC1B,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,QAAQ,EAAE,CAAC;YAC3B,IAAI,QAAQ,GAAG,IAAI,CAAC;YACpB,KAAK,MAAM,KAAK,IAAI,CAAC,CAAC,QAAQ,EAAE,CAAC;gBAC/B,IAAI,IAAA,mBAAS,EAAC,KAAK,EAAE,CAAC,CAAC,EAAE,CAAC;oBACxB,QAAQ,GAAG,KAAK,CAAC;oBACjB,MAAM;gBACR,CAAC;YACH,CAAC;YACD,IAAI,QAAQ,EAAE,CAAC;gBACb,aAAa,GAAG,IAAI,CAAC;gBACrB,MAAM;YACR,CAAC;QACH,CAAC;QACD,IAAI,CAAC,aAAa,EAAE,CAAC;YACnB,OAAO,EAAE,IAAI,EAAE,YAAY,EAAE,KAAK,EAAE,KAAK,EAAE,cAAc,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QACnE,CAAC;IACH,CAAC;IACD,OAAO,EAAE,IAAI,EAAE,YAAY,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC;AAC7C,CAAC;AAED,SAAgB,cAAc;IAC5B,OAAO;QACL,mBAAmB,EAAE;QACrB,YAAY,EAAE;QACd,UAAU,EAAE;QACZ,aAAa,EAAE;QACf,aAAa,EAAE;QACf,eAAe,EAAE;KAClB,CAAC;AACJ,CAAC"}
@@ -0,0 +1,2 @@
1
+ export {};
2
+ //# sourceMappingURL=prover.test.d.ts.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"prover.test.d.ts","sourceRoot":"","sources":["../../../../src/tests/proof-systems/fol-prover-advanced/prover.test.ts"],"names":[],"mappings":""}
@@ -0,0 +1,253 @@
1
+ "use strict";
2
+ Object.defineProperty(exports, "__esModule", { value: true });
3
+ const vitest_1 = require("vitest");
4
+ const fol_prover_advanced_1 = require("../../../proof-systems/fol-prover-advanced");
5
+ // Helpers (terse) para no inflar los tests
6
+ const v = (name) => ({ kind: 'variable', name });
7
+ const c = (name) => ({ kind: 'function', name, args: [] });
8
+ const f = (name, ...args) => ({ kind: 'function', name, args });
9
+ const lit = (predicate, args, negated = false) => ({ predicate, args, negated });
10
+ const clause = (literals, fromGoal = false) => ({ literals, fromGoal });
11
+ (0, vitest_1.describe)('fol-prover-advanced', () => {
12
+ (0, vitest_1.describe)('unification', () => {
13
+ (0, vitest_1.it)('unifica f(x) con f(a) → {x ↦ a}', () => {
14
+ const sub = (0, fol_prover_advanced_1.unify)(f('f', v('x')), f('f', c('a')));
15
+ (0, vitest_1.expect)(sub).not.toBeNull();
16
+ (0, vitest_1.expect)(sub?.get('x')).toEqual(c('a'));
17
+ });
18
+ (0, vitest_1.it)('rechaza unificar f(x) con g(x)', () => {
19
+ (0, vitest_1.expect)((0, fol_prover_advanced_1.unify)(f('f', v('x')), f('g', v('x')))).toBeNull();
20
+ });
21
+ (0, vitest_1.it)('occurs-check: x con f(x) → null', () => {
22
+ (0, vitest_1.expect)((0, fol_prover_advanced_1.unify)(v('x'), f('f', v('x')))).toBeNull();
23
+ });
24
+ });
25
+ (0, vitest_1.describe)('KBO ordering', () => {
26
+ (0, vitest_1.it)('f(a,b) > a por mayor peso', () => {
27
+ const weights = new Map([['f', 1], ['a', 1], ['b', 1]]);
28
+ (0, vitest_1.expect)((0, fol_prover_advanced_1.kboGreater)(f('f', c('a'), c('b')), c('a'), weights)).toBe(true);
29
+ (0, vitest_1.expect)((0, fol_prover_advanced_1.kboGreater)(c('a'), f('f', c('a'), c('b')), weights)).toBe(false);
30
+ });
31
+ (0, vitest_1.it)('rechaza cuando variable de t2 no aparece en t1', () => {
32
+ const weights = new Map([['f', 1], ['a', 1]]);
33
+ // f(a) vs x: x aparece 1 vez en t2 y 0 en t1 → no >_KBO.
34
+ (0, vitest_1.expect)((0, fol_prover_advanced_1.kboGreater)(f('f', c('a')), v('x'), weights)).toBe(false);
35
+ });
36
+ });
37
+ (0, vitest_1.describe)('LPO ordering', () => {
38
+ (0, vitest_1.it)('h(x) > x cuando x ocurre en h(x)', () => {
39
+ const prec = new Map([['h', 2]]);
40
+ (0, vitest_1.expect)((0, fol_prover_advanced_1.lpoGreater)(f('h', v('x')), v('x'), prec)).toBe(true);
41
+ });
42
+ (0, vitest_1.it)('f(a) > g(a) si precedence(f) > precedence(g)', () => {
43
+ const prec = new Map([['f', 5], ['g', 1], ['a', 0]]);
44
+ (0, vitest_1.expect)((0, fol_prover_advanced_1.lpoGreater)(f('f', c('a')), f('g', c('a')), prec)).toBe(true);
45
+ (0, vitest_1.expect)((0, fol_prover_advanced_1.lpoGreater)(f('g', c('a')), f('f', c('a')), prec)).toBe(false);
46
+ });
47
+ });
48
+ (0, vitest_1.describe)('subsumption', () => {
49
+ (0, vitest_1.it)('P(x) subsume P(a)', () => {
50
+ const c1 = clause([lit('P', [v('x')])]);
51
+ const c2 = clause([lit('P', [c('a')])]);
52
+ (0, vitest_1.expect)((0, fol_prover_advanced_1.subsumes)(c1, c2)).toBe(true);
53
+ (0, vitest_1.expect)((0, fol_prover_advanced_1.subsumes)(c2, c1)).toBe(false);
54
+ });
55
+ (0, vitest_1.it)('removeSubsumed elimina la más específica', () => {
56
+ const general = clause([lit('Q', [v('x')])]);
57
+ const specific = clause([lit('Q', [c('b')])]);
58
+ const filtered = (0, fol_prover_advanced_1.removeSubsumed)([specific, general]);
59
+ // El general subsume al específico → sólo el general sobrevive.
60
+ (0, vitest_1.expect)(filtered.length).toBe(1);
61
+ (0, vitest_1.expect)((0, fol_prover_advanced_1.clausesAlphaEqual)(filtered[0], general)).toBe(true);
62
+ });
63
+ });
64
+ (0, vitest_1.describe)('binary resolution', () => {
65
+ (0, vitest_1.it)('P(x) y ¬P(a) → ⊥ con sustitución {x↦a}', () => {
66
+ const c1 = clause([lit('P', [v('x')])]);
67
+ const c2 = clause([lit('P', [c('a')], true)]);
68
+ const res = (0, fol_prover_advanced_1.binaryResolve)(c1, c2);
69
+ (0, vitest_1.expect)(res.length).toBeGreaterThan(0);
70
+ (0, vitest_1.expect)(res[0].clause.literals.length).toBe(0);
71
+ });
72
+ });
73
+ (0, vitest_1.describe)('hyperresolution', () => {
74
+ (0, vitest_1.it)('3 unit positivas + núcleo con 3 negativas → 1 paso a cláusula vacía', () => {
75
+ // Premisas: A, B, C (unitarias positivas)
76
+ // Núcleo: ¬A ∨ ¬B ∨ ¬C
77
+ const A = clause([lit('A', [])]);
78
+ const B = clause([lit('B', [])]);
79
+ const C = clause([lit('C', [])]);
80
+ const nucleus = clause([lit('A', [], true), lit('B', [], true), lit('C', [], true)]);
81
+ const results = (0, fol_prover_advanced_1.hyperresolveMany)([A, B, C], nucleus);
82
+ const hasEmpty = results.some((r) => r.clause.literals.length === 0);
83
+ (0, vitest_1.expect)(hasEmpty).toBe(true);
84
+ });
85
+ (0, vitest_1.it)('hyperresolve API simple con un solo electron unitario', () => {
86
+ const electron = clause([lit('P', [c('a')])]);
87
+ const nucleus = clause([lit('P', [v('x')], true), lit('Q', [v('x')])]);
88
+ const res = (0, fol_prover_advanced_1.hyperresolve)(electron, nucleus);
89
+ (0, vitest_1.expect)(res.length).toBeGreaterThan(0);
90
+ // Quedó Q(a) en el residual
91
+ const survivor = res[0];
92
+ (0, vitest_1.expect)(survivor.literals.length).toBe(1);
93
+ (0, vitest_1.expect)(survivor.literals[0].predicate).toBe('Q');
94
+ (0, vitest_1.expect)(survivor.literals[0].args[0]).toEqual(c('a'));
95
+ });
96
+ });
97
+ (0, vitest_1.describe)('proveAdvanced — modus ponens encadenado', () => {
98
+ (0, vitest_1.it)('binary: A, A→B, B→C, C→D ⊢ D', () => {
99
+ const A = clause([lit('A', [])]);
100
+ const AB = clause([lit('A', [], true), lit('B', [])]);
101
+ const BC = clause([lit('B', [], true), lit('C', [])]);
102
+ const CD = clause([lit('C', [], true), lit('D', [])]);
103
+ const goal = clause([lit('D', [])]);
104
+ const result = (0, fol_prover_advanced_1.proveAdvanced)([A, AB, BC, CD], goal, { strategy: 'binary' });
105
+ (0, vitest_1.expect)(result.proven).toBe(true);
106
+ });
107
+ (0, vitest_1.it)('hyperresolution: 3 MP en un paso con núcleo único', () => {
108
+ // Premisas positivas: A, B, C
109
+ // Núcleo combinado: ¬A ∨ ¬B ∨ ¬C ∨ D
110
+ // Goal: D
111
+ const A = clause([lit('A', [])]);
112
+ const B = clause([lit('B', [])]);
113
+ const C = clause([lit('C', [])]);
114
+ const nucleus = clause([
115
+ lit('A', [], true),
116
+ lit('B', [], true),
117
+ lit('C', [], true),
118
+ lit('D', [])
119
+ ]);
120
+ const goal = clause([lit('D', [])]);
121
+ const result = (0, fol_prover_advanced_1.proveAdvanced)([A, B, C, nucleus], goal, { strategy: 'hyperresolution' });
122
+ (0, vitest_1.expect)(result.proven).toBe(true);
123
+ // Debe haber al menos 1 paso de hyperresolución registrada
124
+ (0, vitest_1.expect)(result.stats.hyperresolutions).toBeGreaterThan(0);
125
+ });
126
+ (0, vitest_1.it)('cadena de 5 implicaciones: P1, P1→P2, …, P5→P6 ⊢ P6', () => {
127
+ const facts = [
128
+ clause([lit('P1', [])]),
129
+ clause([lit('P1', [], true), lit('P2', [])]),
130
+ clause([lit('P2', [], true), lit('P3', [])]),
131
+ clause([lit('P3', [], true), lit('P4', [])]),
132
+ clause([lit('P4', [], true), lit('P5', [])]),
133
+ clause([lit('P5', [], true), lit('P6', [])])
134
+ ];
135
+ const goal = clause([lit('P6', [])]);
136
+ const result = (0, fol_prover_advanced_1.proveAdvanced)(facts, goal, { strategy: 'unit-preference' });
137
+ (0, vitest_1.expect)(result.proven).toBe(true);
138
+ });
139
+ });
140
+ (0, vitest_1.describe)('set-of-support strategy', () => {
141
+ (0, vitest_1.it)('sólo deriva del SoS — no resuelve premisas entre sí', () => {
142
+ // P(a). ∀x. P(x) → Q(x). ¬Q(a).
143
+ // SoS arranca con la negación del goal (default).
144
+ const fact = clause([lit('P', [c('a')])]);
145
+ const rule = clause([lit('P', [v('x')], true), lit('Q', [v('x')])]);
146
+ const goal = clause([lit('Q', [c('a')])]);
147
+ const result = (0, fol_prover_advanced_1.proveAdvanced)([fact, rule], goal, {
148
+ strategy: 'set-of-support'
149
+ });
150
+ (0, vitest_1.expect)(result.proven).toBe(true);
151
+ // El primer paso del SoS debe involucrar la cláusula del goal
152
+ // (índice ≥ premises.length → fromGoal=true en el seed).
153
+ (0, vitest_1.expect)(result.steps.length).toBeGreaterThan(0);
154
+ });
155
+ (0, vitest_1.it)('SoS rechaza pruebas que requieren saturar todo (sin set inicial)', () => {
156
+ // Si forzamos un SoS vacío con un goal trivialmente probable, el motor
157
+ // sólo deriva con cláusulas que entren al SoS por descendencia.
158
+ const A = clause([lit('A', [])]);
159
+ const goal = clause([lit('A', [])]);
160
+ const result = (0, fol_prover_advanced_1.proveAdvanced)([A], goal, { strategy: 'set-of-support' });
161
+ // Goal negado entra al SoS por default y resuelve con A.
162
+ (0, vitest_1.expect)(result.proven).toBe(true);
163
+ });
164
+ });
165
+ (0, vitest_1.describe)('ordered resolution', () => {
166
+ (0, vitest_1.it)('KBO ordering reduce o mantiene resolventes vs binary', () => {
167
+ // Test ligero: con KBO + pesos, la prueba sigue cerrando.
168
+ const A = clause([lit('A', [c('a')])]);
169
+ const rule = clause([lit('A', [v('x')], true), lit('B', [v('x')])]);
170
+ const goal = clause([lit('B', [c('a')])]);
171
+ const weights = new Map([['A', 2], ['B', 1], ['a', 1]]);
172
+ const result = (0, fol_prover_advanced_1.proveAdvanced)([A, rule], goal, {
173
+ strategy: 'ordered',
174
+ ordering: 'KBO',
175
+ kboWeights: weights
176
+ });
177
+ (0, vitest_1.expect)(result.proven).toBe(true);
178
+ });
179
+ (0, vitest_1.it)('LPO ordering también cierra modus ponens simple', () => {
180
+ const A = clause([lit('P', [c('a')])]);
181
+ const rule = clause([lit('P', [v('x')], true), lit('Q', [v('x')])]);
182
+ const goal = clause([lit('Q', [c('a')])]);
183
+ const precedence = new Map([['P', 5], ['Q', 1], ['a', 0]]);
184
+ const result = (0, fol_prover_advanced_1.proveAdvanced)([A, rule], goal, {
185
+ strategy: 'ordered',
186
+ ordering: 'LPO',
187
+ precedence
188
+ });
189
+ (0, vitest_1.expect)(result.proven).toBe(true);
190
+ });
191
+ });
192
+ (0, vitest_1.describe)('unit preference', () => {
193
+ (0, vitest_1.it)('ordena unit clauses al frente', () => {
194
+ const long = clause([lit('A', []), lit('B', []), lit('C', [])]);
195
+ const unit = clause([lit('A', [])]);
196
+ const sorted = (0, fol_prover_advanced_1.unitPreference)([long, unit]);
197
+ (0, vitest_1.expect)(sorted[0].literals.length).toBe(1);
198
+ (0, vitest_1.expect)(sorted[1].literals.length).toBe(3);
199
+ });
200
+ (0, vitest_1.it)('unit-preference resuelve cadena MP más rápido que binary saturado', () => {
201
+ const facts = [
202
+ clause([lit('P1', [])]),
203
+ clause([lit('P1', [], true), lit('P2', [])]),
204
+ clause([lit('P2', [], true), lit('P3', [])])
205
+ ];
206
+ const goal = clause([lit('P3', [])]);
207
+ const withUnit = (0, fol_prover_advanced_1.proveAdvanced)(facts, goal, { strategy: 'unit-preference' });
208
+ const binary = (0, fol_prover_advanced_1.proveAdvanced)(facts, goal, { strategy: 'binary' });
209
+ (0, vitest_1.expect)(withUnit.proven).toBe(true);
210
+ (0, vitest_1.expect)(binary.proven).toBe(true);
211
+ // unit-preference no debería empeorar el conteo de resoluciones.
212
+ (0, vitest_1.expect)(withUnit.stats.resolutions).toBeLessThanOrEqual(binary.stats.resolutions + 5);
213
+ });
214
+ });
215
+ (0, vitest_1.describe)('timeout y termination', () => {
216
+ (0, vitest_1.it)('respeta maxSteps=0 → termina sin probar', () => {
217
+ const A = clause([lit('A', [])]);
218
+ const B = clause([lit('A', [], true), lit('B', [])]);
219
+ const goal = clause([lit('B', [])]);
220
+ const result = (0, fol_prover_advanced_1.proveAdvanced)([A, B], goal, { strategy: 'binary', maxSteps: 0 });
221
+ (0, vitest_1.expect)(result.proven).toBe(false);
222
+ (0, vitest_1.expect)(result.termination).toBe('max-steps');
223
+ });
224
+ (0, vitest_1.it)('respeta timeoutMs corto en problema imposible', () => {
225
+ // Goal no es derivable de premisas no relacionadas; el motor satura o
226
+ // se queda sin nuevas cláusulas. Forzamos saturación con timeout=1.
227
+ const A = clause([lit('X', [c('a')])]);
228
+ const goal = clause([lit('Y', [c('b')])]); // no derivable
229
+ const result = (0, fol_prover_advanced_1.proveAdvanced)([A], goal, { strategy: 'binary', timeoutMs: 1, maxSteps: 100000 });
230
+ (0, vitest_1.expect)(result.proven).toBe(false);
231
+ (0, vitest_1.expect)(['timeout', 'saturated']).toContain(result.termination);
232
+ });
233
+ });
234
+ (0, vitest_1.describe)('subsumption avanzada y deduplicación', () => {
235
+ (0, vitest_1.it)('no genera cláusula vacía cuando goal es no derivable (saturated)', () => {
236
+ const A = clause([lit('A', [])]);
237
+ const goal = clause([lit('Z', [])]);
238
+ const result = (0, fol_prover_advanced_1.proveAdvanced)([A], goal, { strategy: 'binary' });
239
+ (0, vitest_1.expect)(result.proven).toBe(false);
240
+ (0, vitest_1.expect)(result.termination).toBe('saturated');
241
+ });
242
+ (0, vitest_1.it)('estadísticas reportan resolutions > 0 en prueba exitosa', () => {
243
+ const A = clause([lit('P', [])]);
244
+ const rule = clause([lit('P', [], true), lit('Q', [])]);
245
+ const goal = clause([lit('Q', [])]);
246
+ const result = (0, fol_prover_advanced_1.proveAdvanced)([A, rule], goal, { strategy: 'binary' });
247
+ (0, vitest_1.expect)(result.proven).toBe(true);
248
+ (0, vitest_1.expect)(result.stats.resolutions).toBeGreaterThan(0);
249
+ (0, vitest_1.expect)(result.stats.steps).toBeGreaterThan(0);
250
+ });
251
+ });
252
+ });
253
+ //# sourceMappingURL=prover.test.js.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"prover.test.js","sourceRoot":"","sources":["../../../../src/tests/proof-systems/fol-prover-advanced/prover.test.ts"],"names":[],"mappings":";;AAAA,mCAA8C;AAC9C,oFAeoD;AAEpD,2CAA2C;AAC3C,MAAM,CAAC,GAAG,CAAC,IAAY,EAAW,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,UAAU,EAAE,IAAI,EAAE,CAAC,CAAC;AAClE,MAAM,CAAC,GAAG,CAAC,IAAY,EAAW,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,UAAU,EAAE,IAAI,EAAE,IAAI,EAAE,EAAE,EAAE,CAAC,CAAC;AAC5E,MAAM,CAAC,GAAG,CAAC,IAAY,EAAE,GAAG,IAAe,EAAW,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,UAAU,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC;AAC5F,MAAM,GAAG,GAAG,CAAC,SAAiB,EAAE,IAAe,EAAE,OAAO,GAAG,KAAK,EAAc,EAAE,CAAC,CAAC,EAAE,SAAS,EAAE,IAAI,EAAE,OAAO,EAAE,CAAC,CAAC;AAChH,MAAM,MAAM,GAAG,CAAC,QAAsB,EAAE,QAAQ,GAAG,KAAK,EAAa,EAAE,CAAC,CAAC,EAAE,QAAQ,EAAE,QAAQ,EAAE,CAAC,CAAC;AAEjG,IAAA,iBAAQ,EAAC,qBAAqB,EAAE,GAAG,EAAE;IACnC,IAAA,iBAAQ,EAAC,aAAa,EAAE,GAAG,EAAE;QAC3B,IAAA,WAAE,EAAC,iCAAiC,EAAE,GAAG,EAAE;YACzC,MAAM,GAAG,GAAG,IAAA,2BAAK,EAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YAClD,IAAA,eAAM,EAAC,GAAG,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;YAC3B,IAAA,eAAM,EAAC,GAAG,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACxC,CAAC,CAAC,CAAC;QAEH,IAAA,WAAE,EAAC,gCAAgC,EAAE,GAAG,EAAE;YACxC,IAAA,eAAM,EAAC,IAAA,2BAAK,EAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC;QAC3D,CAAC,CAAC,CAAC;QAEH,IAAA,WAAE,EAAC,iCAAiC,EAAE,GAAG,EAAE;YACzC,IAAA,eAAM,EAAC,IAAA,2BAAK,EAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC;QACnD,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,IAAA,iBAAQ,EAAC,cAAc,EAAE,GAAG,EAAE;QAC5B,IAAA,WAAE,EAAC,2BAA2B,EAAE,GAAG,EAAE;YACnC,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;YACxD,IAAA,eAAM,EAAC,IAAA,gCAAU,EAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACvE,IAAA,eAAM,EAAC,IAAA,gCAAU,EAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC1E,CAAC,CAAC,CAAC;QAEH,IAAA,WAAE,EAAC,gDAAgD,EAAE,GAAG,EAAE;YACxD,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;YAC9C,yDAAyD;YACzD,IAAA,eAAM,EAAC,IAAA,gCAAU,EAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAClE,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,IAAA,iBAAQ,EAAC,cAAc,EAAE,GAAG,EAAE;QAC5B,IAAA,WAAE,EAAC,kCAAkC,EAAE,GAAG,EAAE;YAC1C,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;YACjC,IAAA,eAAM,EAAC,IAAA,gCAAU,EAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC9D,CAAC,CAAC,CAAC;QAEH,IAAA,WAAE,EAAC,8CAA8C,EAAE,GAAG,EAAE;YACtD,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;YACrD,IAAA,eAAM,EAAC,IAAA,gCAAU,EAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACpE,IAAA,eAAM,EAAC,IAAA,gCAAU,EAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACvE,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,IAAA,iBAAQ,EAAC,aAAa,EAAE,GAAG,EAAE;QAC3B,IAAA,WAAE,EAAC,mBAAmB,EAAE,GAAG,EAAE;YAC3B,MAAM,EAAE,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YACxC,MAAM,EAAE,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YACxC,IAAA,eAAM,EAAC,IAAA,8BAAQ,EAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACpC,IAAA,eAAM,EAAC,IAAA,8BAAQ,EAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACvC,CAAC,CAAC,CAAC;QAEH,IAAA,WAAE,EAAC,0CAA0C,EAAE,GAAG,EAAE;YAClD,MAAM,OAAO,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAC7C,MAAM,QAAQ,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAC9C,MAAM,QAAQ,GAAG,IAAA,oCAAc,EAAC,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC,CAAC;YACrD,gEAAgE;YAChE,IAAA,eAAM,EAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAChC,IAAA,eAAM,EAAC,IAAA,uCAAiB,EAAC,QAAQ,CAAC,CAAC,CAAE,EAAE,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC9D,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,IAAA,iBAAQ,EAAC,mBAAmB,EAAE,GAAG,EAAE;QACjC,IAAA,WAAE,EAAC,wCAAwC,EAAE,GAAG,EAAE;YAChD,MAAM,EAAE,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YACxC,MAAM,EAAE,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;YAC9C,MAAM,GAAG,GAAG,IAAA,mCAAa,EAAC,EAAE,EAAE,EAAE,CAAC,CAAC;YAClC,IAAA,eAAM,EAAC,GAAG,CAAC,MAAM,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;YACtC,IAAA,eAAM,EAAC,GAAG,CAAC,CAAC,CAAE,CAAC,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACjD,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,IAAA,iBAAQ,EAAC,iBAAiB,EAAE,GAAG,EAAE;QAC/B,IAAA,WAAE,EAAC,qEAAqE,EAAE,GAAG,EAAE;YAC7E,2CAA2C;YAC3C,uBAAuB;YACvB,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;YACjC,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;YACjC,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;YACjC,MAAM,OAAO,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,GAAG,EAAE,EAAE,EAAE,IAAI,CAAC,EAAE,GAAG,CAAC,GAAG,EAAE,EAAE,EAAE,IAAI,CAAC,EAAE,GAAG,CAAC,GAAG,EAAE,EAAE,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;YACrF,MAAM,OAAO,GAAG,IAAA,sCAAgB,EAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC;YACrD,MAAM,QAAQ,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC;YACrE,IAAA,eAAM,EAAC,QAAQ,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC9B,CAAC,CAAC,CAAC;QAEH,IAAA,WAAE,EAAC,uDAAuD,EAAE,GAAG,EAAE;YAC/D,MAAM,QAAQ,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAC9C,MAAM,OAAO,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,EAAE,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YACvE,MAAM,GAAG,GAAG,IAAA,kCAAY,EAAC,QAAQ,EAAE,OAAO,CAAC,CAAC;YAC5C,IAAA,eAAM,EAAC,GAAG,CAAC,MAAM,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;YACtC,4BAA4B;YAC5B,MAAM,QAAQ,GAAG,GAAG,CAAC,CAAC,CAAE,CAAC;YACzB,IAAA,eAAM,EAAC,QAAQ,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACzC,IAAA,eAAM,EAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC,CAAE,CAAC,SAAS,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YAClD,IAAA,eAAM,EAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC,CAAE,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACxD,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,IAAA,iBAAQ,EAAC,yCAAyC,EAAE,GAAG,EAAE;QACvD,IAAA,WAAE,EAAC,8BAA8B,EAAE,GAAG,EAAE;YACtC,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;YACjC,MAAM,EAAE,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,GAAG,EAAE,EAAE,EAAE,IAAI,CAAC,EAAE,GAAG,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;YACtD,MAAM,EAAE,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,GAAG,EAAE,EAAE,EAAE,IAAI,CAAC,EAAE,GAAG,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;YACtD,MAAM,EAAE,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,GAAG,EAAE,EAAE,EAAE,IAAI,CAAC,EAAE,GAAG,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;YACtD,MAAM,IAAI,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;YACpC,MAAM,MAAM,GAAG,IAAA,mCAAa,EAAC,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,IAAI,EAAE,EAAE,QAAQ,EAAE,QAAQ,EAAE,CAAC,CAAC;YAC5E,IAAA,eAAM,EAAC,MAAM,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACnC,CAAC,CAAC,CAAC;QAEH,IAAA,WAAE,EAAC,mDAAmD,EAAE,GAAG,EAAE;YAC3D,8BAA8B;YAC9B,qCAAqC;YACrC,UAAU;YACV,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;YACjC,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;YACjC,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;YACjC,MAAM,OAAO,GAAG,MAAM,CAAC;gBACrB,GAAG,CAAC,GAAG,EAAE,EAAE,EAAE,IAAI,CAAC;gBAClB,GAAG,CAAC,GAAG,EAAE,EAAE,EAAE,IAAI,CAAC;gBAClB,GAAG,CAAC,GAAG,EAAE,EAAE,EAAE,IAAI,CAAC;gBAClB,GAAG,CAAC,GAAG,EAAE,EAAE,CAAC;aACb,CAAC,CAAC;YACH,MAAM,IAAI,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;YACpC,MAAM,MAAM,GAAG,IAAA,mCAAa,EAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,OAAO,CAAC,EAAE,IAAI,EAAE,EAAE,QAAQ,EAAE,iBAAiB,EAAE,CAAC,CAAC;YACxF,IAAA,eAAM,EAAC,MAAM,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACjC,2DAA2D;YAC3D,IAAA,eAAM,EAAC,MAAM,CAAC,KAAK,CAAC,gBAAgB,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;QAC3D,CAAC,CAAC,CAAC;QAEH,IAAA,WAAE,EAAC,qDAAqD,EAAE,GAAG,EAAE;YAC7D,MAAM,KAAK,GAAgB;gBACzB,MAAM,CAAC,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,CAAC;gBACvB,MAAM,CAAC,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,EAAE,IAAI,CAAC,EAAE,GAAG,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,CAAC;gBAC5C,MAAM,CAAC,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,EAAE,IAAI,CAAC,EAAE,GAAG,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,CAAC;gBAC5C,MAAM,CAAC,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,EAAE,IAAI,CAAC,EAAE,GAAG,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,CAAC;gBAC5C,MAAM,CAAC,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,EAAE,IAAI,CAAC,EAAE,GAAG,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,CAAC;gBAC5C,MAAM,CAAC,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,EAAE,IAAI,CAAC,EAAE,GAAG,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,CAAC;aAC7C,CAAC;YACF,MAAM,IAAI,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;YACrC,MAAM,MAAM,GAAG,IAAA,mCAAa,EAAC,KAAK,EAAE,IAAI,EAAE,EAAE,QAAQ,EAAE,iBAAiB,EAAE,CAAC,CAAC;YAC3E,IAAA,eAAM,EAAC,MAAM,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACnC,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,IAAA,iBAAQ,EAAC,yBAAyB,EAAE,GAAG,EAAE;QACvC,IAAA,WAAE,EAAC,qDAAqD,EAAE,GAAG,EAAE;YAC7D,gCAAgC;YAChC,kDAAkD;YAClD,MAAM,IAAI,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAC1C,MAAM,IAAI,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,EAAE,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YACpE,MAAM,IAAI,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAC1C,MAAM,MAAM,GAAG,IAAA,mCAAa,EAAC,CAAC,IAAI,EAAE,IAAI,CAAC,EAAE,IAAI,EAAE;gBAC/C,QAAQ,EAAE,gBAAgB;aAC3B,CAAC,CAAC;YACH,IAAA,eAAM,EAAC,MAAM,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACjC,8DAA8D;YAC9D,yDAAyD;YACzD,IAAA,eAAM,EAAC,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;QACjD,CAAC,CAAC,CAAC;QAEH,IAAA,WAAE,EAAC,kEAAkE,EAAE,GAAG,EAAE;YAC1E,uEAAuE;YACvE,gEAAgE;YAChE,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;YACjC,MAAM,IAAI,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;YACpC,MAAM,MAAM,GAAG,IAAA,mCAAa,EAAC,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,EAAE,QAAQ,EAAE,gBAAgB,EAAE,CAAC,CAAC;YACxE,yDAAyD;YACzD,IAAA,eAAM,EAAC,MAAM,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACnC,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,IAAA,iBAAQ,EAAC,oBAAoB,EAAE,GAAG,EAAE;QAClC,IAAA,WAAE,EAAC,sDAAsD,EAAE,GAAG,EAAE;YAC9D,0DAA0D;YAC1D,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YACvC,MAAM,IAAI,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,EAAE,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YACpE,MAAM,IAAI,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAC1C,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;YACxD,MAAM,MAAM,GAAG,IAAA,mCAAa,EAAC,CAAC,CAAC,EAAE,IAAI,CAAC,EAAE,IAAI,EAAE;gBAC5C,QAAQ,EAAE,SAAS;gBACnB,QAAQ,EAAE,KAAK;gBACf,UAAU,EAAE,OAAO;aACpB,CAAC,CAAC;YACH,IAAA,eAAM,EAAC,MAAM,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACnC,CAAC,CAAC,CAAC;QAEH,IAAA,WAAE,EAAC,iDAAiD,EAAE,GAAG,EAAE;YACzD,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YACvC,MAAM,IAAI,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,EAAE,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YACpE,MAAM,IAAI,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAC1C,MAAM,UAAU,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;YAC3D,MAAM,MAAM,GAAG,IAAA,mCAAa,EAAC,CAAC,CAAC,EAAE,IAAI,CAAC,EAAE,IAAI,EAAE;gBAC5C,QAAQ,EAAE,SAAS;gBACnB,QAAQ,EAAE,KAAK;gBACf,UAAU;aACX,CAAC,CAAC;YACH,IAAA,eAAM,EAAC,MAAM,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACnC,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,IAAA,iBAAQ,EAAC,iBAAiB,EAAE,GAAG,EAAE;QAC/B,IAAA,WAAE,EAAC,+BAA+B,EAAE,GAAG,EAAE;YACvC,MAAM,IAAI,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,GAAG,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,GAAG,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;YAChE,MAAM,IAAI,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;YACpC,MAAM,MAAM,GAAG,IAAA,oCAAc,EAAC,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC;YAC5C,IAAA,eAAM,EAAC,MAAM,CAAC,CAAC,CAAE,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAC3C,IAAA,eAAM,EAAC,MAAM,CAAC,CAAC,CAAE,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC7C,CAAC,CAAC,CAAC;QAEH,IAAA,WAAE,EAAC,mEAAmE,EAAE,GAAG,EAAE;YAC3E,MAAM,KAAK,GAAgB;gBACzB,MAAM,CAAC,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,CAAC;gBACvB,MAAM,CAAC,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,EAAE,IAAI,CAAC,EAAE,GAAG,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,CAAC;gBAC5C,MAAM,CAAC,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,EAAE,IAAI,CAAC,EAAE,GAAG,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,CAAC;aAC7C,CAAC;YACF,MAAM,IAAI,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;YACrC,MAAM,QAAQ,GAAG,IAAA,mCAAa,EAAC,KAAK,EAAE,IAAI,EAAE,EAAE,QAAQ,EAAE,iBAAiB,EAAE,CAAC,CAAC;YAC7E,MAAM,MAAM,GAAG,IAAA,mCAAa,EAAC,KAAK,EAAE,IAAI,EAAE,EAAE,QAAQ,EAAE,QAAQ,EAAE,CAAC,CAAC;YAClE,IAAA,eAAM,EAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACnC,IAAA,eAAM,EAAC,MAAM,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACjC,iEAAiE;YACjE,IAAA,eAAM,EAAC,QAAQ,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC,mBAAmB,CAAC,MAAM,CAAC,KAAK,CAAC,WAAW,GAAG,CAAC,CAAC,CAAC;QACvF,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,IAAA,iBAAQ,EAAC,uBAAuB,EAAE,GAAG,EAAE;QACrC,IAAA,WAAE,EAAC,yCAAyC,EAAE,GAAG,EAAE;YACjD,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;YACjC,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,GAAG,EAAE,EAAE,EAAE,IAAI,CAAC,EAAE,GAAG,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;YACrD,MAAM,IAAI,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;YACpC,MAAM,MAAM,GAAG,IAAA,mCAAa,EAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,EAAE,QAAQ,EAAE,QAAQ,EAAE,QAAQ,EAAE,CAAC,EAAE,CAAC,CAAC;YAChF,IAAA,eAAM,EAAC,MAAM,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAClC,IAAA,eAAM,EAAC,MAAM,CAAC,WAAW,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;QAC/C,CAAC,CAAC,CAAC;QAEH,IAAA,WAAE,EAAC,+CAA+C,EAAE,GAAG,EAAE;YACvD,sEAAsE;YACtE,oEAAoE;YACpE,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YACvC,MAAM,IAAI,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,eAAe;YAC1D,MAAM,MAAM,GAAG,IAAA,mCAAa,EAAC,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,EAAE,QAAQ,EAAE,QAAQ,EAAE,SAAS,EAAE,CAAC,EAAE,QAAQ,EAAE,MAAM,EAAE,CAAC,CAAC;YAChG,IAAA,eAAM,EAAC,MAAM,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAClC,IAAA,eAAM,EAAC,CAAC,SAAS,EAAE,WAAW,CAAC,CAAC,CAAC,SAAS,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC;QACjE,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,IAAA,iBAAQ,EAAC,sCAAsC,EAAE,GAAG,EAAE;QACpD,IAAA,WAAE,EAAC,kEAAkE,EAAE,GAAG,EAAE;YAC1E,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;YACjC,MAAM,IAAI,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;YACpC,MAAM,MAAM,GAAG,IAAA,mCAAa,EAAC,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,EAAE,QAAQ,EAAE,QAAQ,EAAE,CAAC,CAAC;YAChE,IAAA,eAAM,EAAC,MAAM,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAClC,IAAA,eAAM,EAAC,MAAM,CAAC,WAAW,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;QAC/C,CAAC,CAAC,CAAC;QAEH,IAAA,WAAE,EAAC,yDAAyD,EAAE,GAAG,EAAE;YACjE,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;YACjC,MAAM,IAAI,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,GAAG,EAAE,EAAE,EAAE,IAAI,CAAC,EAAE,GAAG,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;YACxD,MAAM,IAAI,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;YACpC,MAAM,MAAM,GAAG,IAAA,mCAAa,EAAC,CAAC,CAAC,EAAE,IAAI,CAAC,EAAE,IAAI,EAAE,EAAE,QAAQ,EAAE,QAAQ,EAAE,CAAC,CAAC;YACtE,IAAA,eAAM,EAAC,MAAM,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACjC,IAAA,eAAM,EAAC,MAAM,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;YACpD,IAAA,eAAM,EAAC,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;QAChD,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}
@@ -0,0 +1,2 @@
1
+ export {};
2
+ //# sourceMappingURL=combinatorics.test.d.ts.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"combinatorics.test.d.ts","sourceRoot":"","sources":["../../../../src/tests/reasoning/combinatorics/combinatorics.test.ts"],"names":[],"mappings":""}