@stevenvo780/st-lang 4.7.0 → 4.9.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 (285) hide show
  1. package/dist/logic/profiles/quantum/index.d.ts +153 -0
  2. package/dist/logic/profiles/quantum/index.d.ts.map +1 -0
  3. package/dist/logic/profiles/quantum/index.js +788 -0
  4. package/dist/logic/profiles/quantum/index.js.map +1 -0
  5. package/dist/namespaces/reasoning.d.ts +3 -1
  6. package/dist/namespaces/reasoning.d.ts.map +1 -1
  7. package/dist/namespaces/reasoning.js +5 -1
  8. package/dist/namespaces/reasoning.js.map +1 -1
  9. package/dist/proof-systems/certificate/canonical.d.ts +18 -0
  10. package/dist/proof-systems/certificate/canonical.d.ts.map +1 -0
  11. package/dist/proof-systems/certificate/canonical.js +79 -0
  12. package/dist/proof-systems/certificate/canonical.js.map +1 -0
  13. package/dist/proof-systems/certificate/generate.d.ts +39 -0
  14. package/dist/proof-systems/certificate/generate.d.ts.map +1 -0
  15. package/dist/proof-systems/certificate/generate.js +259 -0
  16. package/dist/proof-systems/certificate/generate.js.map +1 -0
  17. package/dist/proof-systems/certificate/index.d.ts +7 -0
  18. package/dist/proof-systems/certificate/index.d.ts.map +1 -0
  19. package/dist/proof-systems/certificate/index.js +23 -0
  20. package/dist/proof-systems/certificate/index.js.map +1 -0
  21. package/dist/proof-systems/certificate/lfsc.d.ts +15 -0
  22. package/dist/proof-systems/certificate/lfsc.d.ts.map +1 -0
  23. package/dist/proof-systems/certificate/lfsc.js +395 -0
  24. package/dist/proof-systems/certificate/lfsc.js.map +1 -0
  25. package/dist/proof-systems/certificate/rules.d.ts +8 -0
  26. package/dist/proof-systems/certificate/rules.d.ts.map +1 -0
  27. package/dist/proof-systems/certificate/rules.js +369 -0
  28. package/dist/proof-systems/certificate/rules.js.map +1 -0
  29. package/dist/proof-systems/certificate/types.d.ts +114 -0
  30. package/dist/proof-systems/certificate/types.d.ts.map +1 -0
  31. package/dist/proof-systems/certificate/types.js +18 -0
  32. package/dist/proof-systems/certificate/types.js.map +1 -0
  33. package/dist/proof-systems/certificate/verify.d.ts +20 -0
  34. package/dist/proof-systems/certificate/verify.d.ts.map +1 -0
  35. package/dist/proof-systems/certificate/verify.js +171 -0
  36. package/dist/proof-systems/certificate/verify.js.map +1 -0
  37. package/dist/reasoning/ban-logic/analyze.d.ts +31 -0
  38. package/dist/reasoning/ban-logic/analyze.d.ts.map +1 -0
  39. package/dist/reasoning/ban-logic/analyze.js +113 -0
  40. package/dist/reasoning/ban-logic/analyze.js.map +1 -0
  41. package/dist/reasoning/ban-logic/index.d.ts +7 -0
  42. package/dist/reasoning/ban-logic/index.d.ts.map +1 -0
  43. package/dist/reasoning/ban-logic/index.js +66 -0
  44. package/dist/reasoning/ban-logic/index.js.map +1 -0
  45. package/dist/reasoning/ban-logic/protocols.d.ts +54 -0
  46. package/dist/reasoning/ban-logic/protocols.d.ts.map +1 -0
  47. package/dist/reasoning/ban-logic/protocols.js +219 -0
  48. package/dist/reasoning/ban-logic/protocols.js.map +1 -0
  49. package/dist/reasoning/ban-logic/rules.d.ts +83 -0
  50. package/dist/reasoning/ban-logic/rules.d.ts.map +1 -0
  51. package/dist/reasoning/ban-logic/rules.js +409 -0
  52. package/dist/reasoning/ban-logic/rules.js.map +1 -0
  53. package/dist/reasoning/ban-logic/terms.d.ts +26 -0
  54. package/dist/reasoning/ban-logic/terms.d.ts.map +1 -0
  55. package/dist/reasoning/ban-logic/terms.js +262 -0
  56. package/dist/reasoning/ban-logic/terms.js.map +1 -0
  57. package/dist/reasoning/ban-logic/types.d.ts +107 -0
  58. package/dist/reasoning/ban-logic/types.d.ts.map +1 -0
  59. package/dist/reasoning/ban-logic/types.js +27 -0
  60. package/dist/reasoning/ban-logic/types.js.map +1 -0
  61. package/dist/reasoning/combinatorial-games/index.d.ts +105 -0
  62. package/dist/reasoning/combinatorial-games/index.d.ts.map +1 -0
  63. package/dist/reasoning/combinatorial-games/index.js +377 -0
  64. package/dist/reasoning/combinatorial-games/index.js.map +1 -0
  65. package/dist/reasoning/differential-privacy/index.d.ts +121 -0
  66. package/dist/reasoning/differential-privacy/index.d.ts.map +1 -0
  67. package/dist/reasoning/differential-privacy/index.js +417 -0
  68. package/dist/reasoning/differential-privacy/index.js.map +1 -0
  69. package/dist/reasoning/mechanism-design/auctions.d.ts +49 -0
  70. package/dist/reasoning/mechanism-design/auctions.d.ts.map +1 -0
  71. package/dist/reasoning/mechanism-design/auctions.js +179 -0
  72. package/dist/reasoning/mechanism-design/auctions.js.map +1 -0
  73. package/dist/reasoning/mechanism-design/index.d.ts +5 -0
  74. package/dist/reasoning/mechanism-design/index.d.ts.map +1 -0
  75. package/dist/reasoning/mechanism-design/index.js +39 -0
  76. package/dist/reasoning/mechanism-design/index.js.map +1 -0
  77. package/dist/reasoning/mechanism-design/myerson.d.ts +64 -0
  78. package/dist/reasoning/mechanism-design/myerson.d.ts.map +1 -0
  79. package/dist/reasoning/mechanism-design/myerson.js +253 -0
  80. package/dist/reasoning/mechanism-design/myerson.js.map +1 -0
  81. package/dist/reasoning/mechanism-design/types.d.ts +44 -0
  82. package/dist/reasoning/mechanism-design/types.d.ts.map +1 -0
  83. package/dist/reasoning/mechanism-design/types.js +22 -0
  84. package/dist/reasoning/mechanism-design/types.js.map +1 -0
  85. package/dist/reasoning/mechanism-design/vcg.d.ts +29 -0
  86. package/dist/reasoning/mechanism-design/vcg.d.ts.map +1 -0
  87. package/dist/reasoning/mechanism-design/vcg.js +305 -0
  88. package/dist/reasoning/mechanism-design/vcg.js.map +1 -0
  89. package/dist/reasoning/probabilistic/distributions.d.ts +44 -0
  90. package/dist/reasoning/probabilistic/distributions.d.ts.map +1 -0
  91. package/dist/reasoning/probabilistic/distributions.js +207 -0
  92. package/dist/reasoning/probabilistic/distributions.js.map +1 -0
  93. package/dist/reasoning/probabilistic/examples.d.ts +31 -0
  94. package/dist/reasoning/probabilistic/examples.d.ts.map +1 -0
  95. package/dist/reasoning/probabilistic/examples.js +85 -0
  96. package/dist/reasoning/probabilistic/examples.js.map +1 -0
  97. package/dist/reasoning/probabilistic/index.d.ts +6 -0
  98. package/dist/reasoning/probabilistic/index.d.ts.map +1 -0
  99. package/dist/reasoning/probabilistic/index.js +42 -0
  100. package/dist/reasoning/probabilistic/index.js.map +1 -0
  101. package/dist/reasoning/probabilistic/inference.d.ts +45 -0
  102. package/dist/reasoning/probabilistic/inference.d.ts.map +1 -0
  103. package/dist/reasoning/probabilistic/inference.js +579 -0
  104. package/dist/reasoning/probabilistic/inference.js.map +1 -0
  105. package/dist/reasoning/probabilistic/types.d.ts +153 -0
  106. package/dist/reasoning/probabilistic/types.d.ts.map +1 -0
  107. package/dist/reasoning/probabilistic/types.js +37 -0
  108. package/dist/reasoning/probabilistic/types.js.map +1 -0
  109. package/dist/solver/smt-z3/index.d.ts +3 -0
  110. package/dist/solver/smt-z3/index.d.ts.map +1 -0
  111. package/dist/solver/smt-z3/index.js +11 -0
  112. package/dist/solver/smt-z3/index.js.map +1 -0
  113. package/dist/solver/smt-z3/types.d.ts +52 -0
  114. package/dist/solver/smt-z3/types.d.ts.map +1 -0
  115. package/dist/solver/smt-z3/types.js +6 -0
  116. package/dist/solver/smt-z3/types.js.map +1 -0
  117. package/dist/solver/smt-z3/z3-wasm-backend.d.ts +88 -0
  118. package/dist/solver/smt-z3/z3-wasm-backend.d.ts.map +1 -0
  119. package/dist/solver/smt-z3/z3-wasm-backend.js +437 -0
  120. package/dist/solver/smt-z3/z3-wasm-backend.js.map +1 -0
  121. package/dist/tests/logic/profiles/quantum/quantum.test.d.ts +2 -0
  122. package/dist/tests/logic/profiles/quantum/quantum.test.d.ts.map +1 -0
  123. package/dist/tests/logic/profiles/quantum/quantum.test.js +209 -0
  124. package/dist/tests/logic/profiles/quantum/quantum.test.js.map +1 -0
  125. package/dist/tests/proof-systems/certificate/certificate.test.d.ts +2 -0
  126. package/dist/tests/proof-systems/certificate/certificate.test.d.ts.map +1 -0
  127. package/dist/tests/proof-systems/certificate/certificate.test.js +449 -0
  128. package/dist/tests/proof-systems/certificate/certificate.test.js.map +1 -0
  129. package/dist/tests/reasoning/ban-logic/ban-logic.test.d.ts +2 -0
  130. package/dist/tests/reasoning/ban-logic/ban-logic.test.d.ts.map +1 -0
  131. package/dist/tests/reasoning/ban-logic/ban-logic.test.js +270 -0
  132. package/dist/tests/reasoning/ban-logic/ban-logic.test.js.map +1 -0
  133. package/dist/tests/reasoning/combinatorial-games/combinatorial-games.test.d.ts +2 -0
  134. package/dist/tests/reasoning/combinatorial-games/combinatorial-games.test.d.ts.map +1 -0
  135. package/dist/tests/reasoning/combinatorial-games/combinatorial-games.test.js +203 -0
  136. package/dist/tests/reasoning/combinatorial-games/combinatorial-games.test.js.map +1 -0
  137. package/dist/tests/reasoning/differential-privacy/differential-privacy.test.d.ts +2 -0
  138. package/dist/tests/reasoning/differential-privacy/differential-privacy.test.d.ts.map +1 -0
  139. package/dist/tests/reasoning/differential-privacy/differential-privacy.test.js +388 -0
  140. package/dist/tests/reasoning/differential-privacy/differential-privacy.test.js.map +1 -0
  141. package/dist/tests/reasoning/mechanism-design/mechanism-design.test.d.ts +2 -0
  142. package/dist/tests/reasoning/mechanism-design/mechanism-design.test.d.ts.map +1 -0
  143. package/dist/tests/reasoning/mechanism-design/mechanism-design.test.js +290 -0
  144. package/dist/tests/reasoning/mechanism-design/mechanism-design.test.js.map +1 -0
  145. package/dist/tests/reasoning/probabilistic/probabilistic.test.d.ts +2 -0
  146. package/dist/tests/reasoning/probabilistic/probabilistic.test.d.ts.map +1 -0
  147. package/dist/tests/reasoning/probabilistic/probabilistic.test.js +370 -0
  148. package/dist/tests/reasoning/probabilistic/probabilistic.test.js.map +1 -0
  149. package/dist/tests/solver/smt-z3/z3-wasm-backend.test.d.ts +2 -0
  150. package/dist/tests/solver/smt-z3/z3-wasm-backend.test.d.ts.map +1 -0
  151. package/dist/tests/solver/smt-z3/z3-wasm-backend.test.js +394 -0
  152. package/dist/tests/solver/smt-z3/z3-wasm-backend.test.js.map +1 -0
  153. package/dist/tests/tooling/mathlib/mathlib.test.d.ts +2 -0
  154. package/dist/tests/tooling/mathlib/mathlib.test.d.ts.map +1 -0
  155. package/dist/tests/tooling/mathlib/mathlib.test.js +214 -0
  156. package/dist/tests/tooling/mathlib/mathlib.test.js.map +1 -0
  157. package/dist/tests/tooling/proof-guidance/features.test.d.ts +2 -0
  158. package/dist/tests/tooling/proof-guidance/features.test.d.ts.map +1 -0
  159. package/dist/tests/tooling/proof-guidance/features.test.js +72 -0
  160. package/dist/tests/tooling/proof-guidance/features.test.js.map +1 -0
  161. package/dist/tests/tooling/proof-guidance/model.test.d.ts +2 -0
  162. package/dist/tests/tooling/proof-guidance/model.test.d.ts.map +1 -0
  163. package/dist/tests/tooling/proof-guidance/model.test.js +165 -0
  164. package/dist/tests/tooling/proof-guidance/model.test.js.map +1 -0
  165. package/dist/tests/tooling/proof-guidance/search.test.d.ts +2 -0
  166. package/dist/tests/tooling/proof-guidance/search.test.d.ts.map +1 -0
  167. package/dist/tests/tooling/proof-guidance/search.test.js +238 -0
  168. package/dist/tests/tooling/proof-guidance/search.test.js.map +1 -0
  169. package/dist/tests/type-theory/cubical/cubical.test.d.ts +2 -0
  170. package/dist/tests/type-theory/cubical/cubical.test.d.ts.map +1 -0
  171. package/dist/tests/type-theory/cubical/cubical.test.js +207 -0
  172. package/dist/tests/type-theory/cubical/cubical.test.js.map +1 -0
  173. package/dist/tests/type-theory/effects/effects.test.d.ts +2 -0
  174. package/dist/tests/type-theory/effects/effects.test.d.ts.map +1 -0
  175. package/dist/tests/type-theory/effects/effects.test.js +242 -0
  176. package/dist/tests/type-theory/effects/effects.test.js.map +1 -0
  177. package/dist/tooling/mathlib/group.d.ts +27 -0
  178. package/dist/tooling/mathlib/group.d.ts.map +1 -0
  179. package/dist/tooling/mathlib/group.js +89 -0
  180. package/dist/tooling/mathlib/group.js.map +1 -0
  181. package/dist/tooling/mathlib/index.d.ts +8 -0
  182. package/dist/tooling/mathlib/index.d.ts.map +1 -0
  183. package/dist/tooling/mathlib/index.js +40 -0
  184. package/dist/tooling/mathlib/index.js.map +1 -0
  185. package/dist/tooling/mathlib/instances.d.ts +29 -0
  186. package/dist/tooling/mathlib/instances.d.ts.map +1 -0
  187. package/dist/tooling/mathlib/instances.js +139 -0
  188. package/dist/tooling/mathlib/instances.js.map +1 -0
  189. package/dist/tooling/mathlib/lemmas.d.ts +3 -0
  190. package/dist/tooling/mathlib/lemmas.d.ts.map +1 -0
  191. package/dist/tooling/mathlib/lemmas.js +72 -0
  192. package/dist/tooling/mathlib/lemmas.js.map +1 -0
  193. package/dist/tooling/mathlib/order.d.ts +29 -0
  194. package/dist/tooling/mathlib/order.d.ts.map +1 -0
  195. package/dist/tooling/mathlib/order.js +91 -0
  196. package/dist/tooling/mathlib/order.js.map +1 -0
  197. package/dist/tooling/mathlib/ring.d.ts +15 -0
  198. package/dist/tooling/mathlib/ring.d.ts.map +1 -0
  199. package/dist/tooling/mathlib/ring.js +91 -0
  200. package/dist/tooling/mathlib/ring.js.map +1 -0
  201. package/dist/tooling/mathlib/types.d.ts +62 -0
  202. package/dist/tooling/mathlib/types.d.ts.map +1 -0
  203. package/dist/tooling/mathlib/types.js +7 -0
  204. package/dist/tooling/mathlib/types.js.map +1 -0
  205. package/dist/tooling/proof-guidance/features.d.ts +10 -0
  206. package/dist/tooling/proof-guidance/features.d.ts.map +1 -0
  207. package/dist/tooling/proof-guidance/features.js +97 -0
  208. package/dist/tooling/proof-guidance/features.js.map +1 -0
  209. package/dist/tooling/proof-guidance/index.d.ts +5 -0
  210. package/dist/tooling/proof-guidance/index.d.ts.map +1 -0
  211. package/dist/tooling/proof-guidance/index.js +25 -0
  212. package/dist/tooling/proof-guidance/index.js.map +1 -0
  213. package/dist/tooling/proof-guidance/model.d.ts +42 -0
  214. package/dist/tooling/proof-guidance/model.d.ts.map +1 -0
  215. package/dist/tooling/proof-guidance/model.js +149 -0
  216. package/dist/tooling/proof-guidance/model.js.map +1 -0
  217. package/dist/tooling/proof-guidance/search.d.ts +7 -0
  218. package/dist/tooling/proof-guidance/search.d.ts.map +1 -0
  219. package/dist/tooling/proof-guidance/search.js +102 -0
  220. package/dist/tooling/proof-guidance/search.js.map +1 -0
  221. package/dist/tooling/proof-guidance/types.d.ts +77 -0
  222. package/dist/tooling/proof-guidance/types.d.ts.map +1 -0
  223. package/dist/tooling/proof-guidance/types.js +8 -0
  224. package/dist/tooling/proof-guidance/types.js.map +1 -0
  225. package/dist/type-theory/cubical/equality.d.ts +4 -0
  226. package/dist/type-theory/cubical/equality.d.ts.map +1 -0
  227. package/dist/type-theory/cubical/equality.js +78 -0
  228. package/dist/type-theory/cubical/equality.js.map +1 -0
  229. package/dist/type-theory/cubical/index.d.ts +14 -0
  230. package/dist/type-theory/cubical/index.d.ts.map +1 -0
  231. package/dist/type-theory/cubical/index.js +71 -0
  232. package/dist/type-theory/cubical/index.js.map +1 -0
  233. package/dist/type-theory/cubical/infer.d.ts +18 -0
  234. package/dist/type-theory/cubical/infer.d.ts.map +1 -0
  235. package/dist/type-theory/cubical/infer.js +241 -0
  236. package/dist/type-theory/cubical/infer.js.map +1 -0
  237. package/dist/type-theory/cubical/interval.d.ts +12 -0
  238. package/dist/type-theory/cubical/interval.d.ts.map +1 -0
  239. package/dist/type-theory/cubical/interval.js +118 -0
  240. package/dist/type-theory/cubical/interval.js.map +1 -0
  241. package/dist/type-theory/cubical/normalize.d.ts +5 -0
  242. package/dist/type-theory/cubical/normalize.d.ts.map +1 -0
  243. package/dist/type-theory/cubical/normalize.js +191 -0
  244. package/dist/type-theory/cubical/normalize.js.map +1 -0
  245. package/dist/type-theory/cubical/path-algebra.d.ts +12 -0
  246. package/dist/type-theory/cubical/path-algebra.d.ts.map +1 -0
  247. package/dist/type-theory/cubical/path-algebra.js +109 -0
  248. package/dist/type-theory/cubical/path-algebra.js.map +1 -0
  249. package/dist/type-theory/cubical/substitute.d.ts +3 -0
  250. package/dist/type-theory/cubical/substitute.d.ts.map +1 -0
  251. package/dist/type-theory/cubical/substitute.js +109 -0
  252. package/dist/type-theory/cubical/substitute.js.map +1 -0
  253. package/dist/type-theory/cubical/types.d.ts +77 -0
  254. package/dist/type-theory/cubical/types.d.ts.map +1 -0
  255. package/dist/type-theory/cubical/types.js +258 -0
  256. package/dist/type-theory/cubical/types.js.map +1 -0
  257. package/dist/type-theory/effects/core.d.ts +27 -0
  258. package/dist/type-theory/effects/core.d.ts.map +1 -0
  259. package/dist/type-theory/effects/core.js +79 -0
  260. package/dist/type-theory/effects/core.js.map +1 -0
  261. package/dist/type-theory/effects/exception.d.ts +18 -0
  262. package/dist/type-theory/effects/exception.d.ts.map +1 -0
  263. package/dist/type-theory/effects/exception.js +59 -0
  264. package/dist/type-theory/effects/exception.js.map +1 -0
  265. package/dist/type-theory/effects/index.d.ts +11 -0
  266. package/dist/type-theory/effects/index.d.ts.map +1 -0
  267. package/dist/type-theory/effects/index.js +50 -0
  268. package/dist/type-theory/effects/index.js.map +1 -0
  269. package/dist/type-theory/effects/reader.d.ts +20 -0
  270. package/dist/type-theory/effects/reader.d.ts.map +1 -0
  271. package/dist/type-theory/effects/reader.js +62 -0
  272. package/dist/type-theory/effects/reader.js.map +1 -0
  273. package/dist/type-theory/effects/state.d.ts +31 -0
  274. package/dist/type-theory/effects/state.d.ts.map +1 -0
  275. package/dist/type-theory/effects/state.js +91 -0
  276. package/dist/type-theory/effects/state.js.map +1 -0
  277. package/dist/type-theory/effects/types.d.ts +45 -0
  278. package/dist/type-theory/effects/types.d.ts.map +1 -0
  279. package/dist/type-theory/effects/types.js +21 -0
  280. package/dist/type-theory/effects/types.js.map +1 -0
  281. package/dist/type-theory/effects/writer.d.ts +30 -0
  282. package/dist/type-theory/effects/writer.d.ts.map +1 -0
  283. package/dist/type-theory/effects/writer.js +79 -0
  284. package/dist/type-theory/effects/writer.js.map +1 -0
  285. package/package.json +1 -1
@@ -0,0 +1,394 @@
1
+ "use strict";
2
+ // ============================================================
3
+ // ST SMT-Z3 Tests — Z3WasmBackend (in-process WASM)
4
+ // ============================================================
5
+ Object.defineProperty(exports, "__esModule", { value: true });
6
+ const vitest_1 = require("vitest");
7
+ const smt_z3_1 = require("../../../solver/smt-z3");
8
+ // Detección sincronizada: `describe.skipIf(!flag)` necesita boolean inmediato.
9
+ // Evitamos top-level await (incompatible con CommonJS) usando `require.resolve`
10
+ // para verificar que la dependencia está instalada. El boot WASM real ocurre
11
+ // dentro de los tests (en `beforeAll` o `Z3WasmBackend.create()`); si la dep
12
+ // está instalada y carga ahí falla, vitest reporta el fallo limpiamente.
13
+ function z3PackageInstalled() {
14
+ try {
15
+ require.resolve('z3-solver');
16
+ return true;
17
+ }
18
+ catch {
19
+ return false;
20
+ }
21
+ }
22
+ const z3Available = z3PackageInstalled();
23
+ (0, vitest_1.describe)('isZ3Available / detectAvailableSMT', () => {
24
+ (0, vitest_1.it)('isZ3Available devuelve boolean sin throw', async () => {
25
+ const v = await (0, smt_z3_1.isZ3Available)();
26
+ (0, vitest_1.expect)(typeof v).toBe('boolean');
27
+ });
28
+ (0, vitest_1.it)('detectAvailableSMT devuelve un runtime conocido', async () => {
29
+ const runtime = await (0, smt_z3_1.detectAvailableSMT)();
30
+ (0, vitest_1.expect)(['z3-wasm', 'z3-subprocess', 'cvc5-subprocess', 'none']).toContain(runtime);
31
+ });
32
+ (0, vitest_1.it)('cuando z3-wasm carga, detectAvailableSMT prefiere z3-wasm', async () => {
33
+ if (!z3Available) {
34
+ // Si WASM no cargó, el detector puede caer a subprocess o none —
35
+ // ambos casos son válidos.
36
+ return;
37
+ }
38
+ const runtime = await (0, smt_z3_1.detectAvailableSMT)();
39
+ (0, vitest_1.expect)(runtime).toBe('z3-wasm');
40
+ });
41
+ });
42
+ vitest_1.describe.skipIf(!z3Available)('Z3WasmBackend — sat/unsat básicos', () => {
43
+ let backend;
44
+ (0, vitest_1.beforeAll)(async () => {
45
+ backend = await smt_z3_1.Z3WasmBackend.create();
46
+ });
47
+ (0, vitest_1.afterAll)(() => {
48
+ backend.close();
49
+ });
50
+ (0, vitest_1.it)('LIA: x > 5 → sat con model', async () => {
51
+ backend.reset();
52
+ backend.declareConst('x', 'Int');
53
+ backend.assertFormula('(> x 5)');
54
+ const result = await backend.checkSat();
55
+ (0, vitest_1.expect)(result).toBe('sat');
56
+ const model = backend.getModel();
57
+ (0, vitest_1.expect)(model).toBeDefined();
58
+ if (model) {
59
+ (0, vitest_1.expect)(typeof model.x).toBe('number');
60
+ (0, vitest_1.expect)(Number(model.x)).toBeGreaterThan(5);
61
+ }
62
+ });
63
+ (0, vitest_1.it)('LIA: x = 5 ∧ x = 6 → unsat', async () => {
64
+ backend.reset();
65
+ backend.declareConst('x', 'Int');
66
+ backend.assertFormula('(= x 5)');
67
+ backend.assertFormula('(= x 6)');
68
+ const result = await backend.checkSat();
69
+ (0, vitest_1.expect)(result).toBe('unsat');
70
+ (0, vitest_1.expect)(backend.getModel()).toBeUndefined();
71
+ });
72
+ (0, vitest_1.it)('LRA: x > 5 ∧ x < 3 → unsat', async () => {
73
+ backend.reset();
74
+ backend.declareConst('x', 'Real');
75
+ backend.assertFormula('(> x 5.0)');
76
+ backend.assertFormula('(< x 3.0)');
77
+ const result = await backend.checkSat();
78
+ (0, vitest_1.expect)(result).toBe('unsat');
79
+ });
80
+ (0, vitest_1.it)('LRA: x > 0 ∧ x < 1 → sat con racional fraccionario', async () => {
81
+ backend.reset();
82
+ backend.declareConst('x', 'Real');
83
+ backend.assertFormula('(> x 0.0)');
84
+ backend.assertFormula('(< x 1.0)');
85
+ const result = await backend.checkSat();
86
+ (0, vitest_1.expect)(result).toBe('sat');
87
+ const model = backend.getModel();
88
+ (0, vitest_1.expect)(model).toBeDefined();
89
+ if (model && typeof model.x === 'number') {
90
+ (0, vitest_1.expect)(model.x).toBeGreaterThan(0);
91
+ (0, vitest_1.expect)(model.x).toBeLessThan(1);
92
+ }
93
+ });
94
+ (0, vitest_1.it)('Bool: P ∧ ¬P → unsat', async () => {
95
+ backend.reset();
96
+ backend.declareConst('P', 'Bool');
97
+ backend.assertFormula('(and P (not P))');
98
+ const result = await backend.checkSat();
99
+ (0, vitest_1.expect)(result).toBe('unsat');
100
+ });
101
+ (0, vitest_1.it)('Bool: P ∨ ¬P → sat', async () => {
102
+ backend.reset();
103
+ backend.declareConst('P', 'Bool');
104
+ backend.assertFormula('(or P (not P))');
105
+ (0, vitest_1.expect)(await backend.checkSat()).toBe('sat');
106
+ });
107
+ });
108
+ vitest_1.describe.skipIf(!z3Available)('Z3WasmBackend — BitVec', () => {
109
+ (0, vitest_1.it)('BV8: x = #x05 → sat con model x=5', async () => {
110
+ const backend = await smt_z3_1.Z3WasmBackend.create();
111
+ try {
112
+ backend.declareConst('x', 'BitVec', 8);
113
+ backend.assertFormula('(= x #x05)');
114
+ const result = await backend.checkSat();
115
+ (0, vitest_1.expect)(result).toBe('sat');
116
+ const model = backend.getModel();
117
+ (0, vitest_1.expect)(model).toBeDefined();
118
+ if (model) {
119
+ // El decoder normaliza #x05 → 5.
120
+ (0, vitest_1.expect)(model.x).toBe(5);
121
+ }
122
+ }
123
+ finally {
124
+ backend.close();
125
+ }
126
+ });
127
+ (0, vitest_1.it)('BV8: x = 5 ∧ x = 10 → unsat', async () => {
128
+ const backend = await smt_z3_1.Z3WasmBackend.create();
129
+ try {
130
+ backend.declareConst('x', 'BitVec', 8);
131
+ backend.assertFormula('(= x #x05)');
132
+ backend.assertFormula('(= x #x0a)');
133
+ (0, vitest_1.expect)(await backend.checkSat()).toBe('unsat');
134
+ }
135
+ finally {
136
+ backend.close();
137
+ }
138
+ });
139
+ (0, vitest_1.it)('BV con bvWidth default (32 bits)', async () => {
140
+ const backend = await smt_z3_1.Z3WasmBackend.create();
141
+ try {
142
+ backend.declareConst('x', 'BitVec');
143
+ backend.assertFormula('(bvult x #x00000010)');
144
+ (0, vitest_1.expect)(await backend.checkSat()).toBe('sat');
145
+ }
146
+ finally {
147
+ backend.close();
148
+ }
149
+ });
150
+ });
151
+ vitest_1.describe.skipIf(!z3Available)('Z3WasmBackend — push/pop', () => {
152
+ (0, vitest_1.it)('pop restaura sat tras conflict en scope', async () => {
153
+ const backend = await smt_z3_1.Z3WasmBackend.create();
154
+ try {
155
+ backend.declareConst('x', 'Int');
156
+ backend.assertFormula('(> x 0)');
157
+ (0, vitest_1.expect)(await backend.checkSat()).toBe('sat');
158
+ backend.push();
159
+ backend.assertFormula('(< x 0)');
160
+ (0, vitest_1.expect)(await backend.checkSat()).toBe('unsat');
161
+ backend.pop();
162
+ (0, vitest_1.expect)(await backend.checkSat()).toBe('sat');
163
+ }
164
+ finally {
165
+ backend.close();
166
+ }
167
+ });
168
+ (0, vitest_1.it)('pop con levels=2 baja dos scopes', async () => {
169
+ const backend = await smt_z3_1.Z3WasmBackend.create();
170
+ try {
171
+ backend.declareConst('x', 'Int');
172
+ backend.assertFormula('(>= x 0)');
173
+ backend.push();
174
+ backend.assertFormula('(>= x 5)');
175
+ backend.push();
176
+ backend.assertFormula('(<= x 3)');
177
+ (0, vitest_1.expect)(await backend.checkSat()).toBe('unsat');
178
+ backend.pop(2);
179
+ // Tras pop(2) sólo queda (>= x 0)
180
+ (0, vitest_1.expect)(await backend.checkSat()).toBe('sat');
181
+ }
182
+ finally {
183
+ backend.close();
184
+ }
185
+ });
186
+ (0, vitest_1.it)('pop sin push no rompe el solver', async () => {
187
+ const backend = await smt_z3_1.Z3WasmBackend.create();
188
+ try {
189
+ backend.declareConst('x', 'Int');
190
+ backend.assertFormula('(>= x 0)');
191
+ backend.pop(5); // intento de underflow
192
+ (0, vitest_1.expect)(await backend.checkSat()).toBe('sat');
193
+ }
194
+ finally {
195
+ backend.close();
196
+ }
197
+ });
198
+ });
199
+ vitest_1.describe.skipIf(!z3Available)('Z3WasmBackend — unsat core', () => {
200
+ (0, vitest_1.it)('reporta core de assertions nombradas inconsistentes', async () => {
201
+ const backend = await smt_z3_1.Z3WasmBackend.create();
202
+ try {
203
+ backend.declareConst('x', 'Int');
204
+ backend.assertNamed('c1', '(> x 5)');
205
+ backend.assertNamed('c2', '(< x 3)');
206
+ backend.assertNamed('c3', '(>= x -100)');
207
+ const result = await backend.checkSat();
208
+ (0, vitest_1.expect)(result).toBe('unsat');
209
+ const core = backend.getUnsatCore();
210
+ // El core debe contener al menos c1 y c2 (los que se contradicen).
211
+ (0, vitest_1.expect)(core).toContain('c1');
212
+ (0, vitest_1.expect)(core).toContain('c2');
213
+ // c3 es satisfiable y no debería estar en el core.
214
+ (0, vitest_1.expect)(core).not.toContain('c3');
215
+ }
216
+ finally {
217
+ backend.close();
218
+ }
219
+ });
220
+ (0, vitest_1.it)('core vacío cuando todo es satisfiable', async () => {
221
+ const backend = await smt_z3_1.Z3WasmBackend.create();
222
+ try {
223
+ backend.declareConst('x', 'Int');
224
+ backend.assertNamed('c1', '(>= x 0)');
225
+ backend.assertNamed('c2', '(<= x 100)');
226
+ const result = await backend.checkSat();
227
+ (0, vitest_1.expect)(result).toBe('sat');
228
+ (0, vitest_1.expect)(backend.getUnsatCore()).toEqual([]);
229
+ }
230
+ finally {
231
+ backend.close();
232
+ }
233
+ });
234
+ (0, vitest_1.it)('assertNamed con mismo nombre dos veces tira error', async () => {
235
+ const backend = await smt_z3_1.Z3WasmBackend.create();
236
+ try {
237
+ backend.declareConst('x', 'Int');
238
+ backend.assertNamed('c1', '(> x 0)');
239
+ (0, vitest_1.expect)(() => backend.assertNamed('c1', '(> x 1)')).toThrow(/ya fue usado/i);
240
+ }
241
+ finally {
242
+ backend.close();
243
+ }
244
+ });
245
+ });
246
+ vitest_1.describe.skipIf(!z3Available)('Z3WasmBackend — opciones y stats', () => {
247
+ (0, vitest_1.it)('setOption("timeout", N) no rompe checkSat trivial', async () => {
248
+ const backend = await smt_z3_1.Z3WasmBackend.create();
249
+ try {
250
+ backend.setOption('timeout', 1000);
251
+ backend.declareConst('x', 'Int');
252
+ backend.assertFormula('(> x 0)');
253
+ const result = await backend.checkSat();
254
+ (0, vitest_1.expect)(result).toBe('sat');
255
+ }
256
+ finally {
257
+ backend.close();
258
+ }
259
+ });
260
+ (0, vitest_1.it)('create con timeoutMs en options', async () => {
261
+ const backend = await smt_z3_1.Z3WasmBackend.create({ timeoutMs: 5000 });
262
+ try {
263
+ backend.declareConst('x', 'Int');
264
+ backend.assertFormula('(> x 0)');
265
+ (0, vitest_1.expect)(await backend.checkSat()).toBe('sat');
266
+ }
267
+ finally {
268
+ backend.close();
269
+ }
270
+ });
271
+ (0, vitest_1.it)('getStatistics devuelve un mapa numérico tras checkSat', async () => {
272
+ const backend = await smt_z3_1.Z3WasmBackend.create();
273
+ try {
274
+ backend.declareConst('x', 'Int');
275
+ backend.assertFormula('(> x 0)');
276
+ await backend.checkSat();
277
+ const stats = backend.getStatistics();
278
+ (0, vitest_1.expect)(typeof stats).toBe('object');
279
+ // Z3 reporta al menos algunas métricas tras un check.
280
+ for (const v of Object.values(stats)) {
281
+ (0, vitest_1.expect)(typeof v).toBe('number');
282
+ }
283
+ }
284
+ finally {
285
+ backend.close();
286
+ }
287
+ });
288
+ });
289
+ vitest_1.describe.skipIf(!z3Available)('Z3WasmBackend — varios', () => {
290
+ (0, vitest_1.it)('reset limpia decls y asserts', async () => {
291
+ const backend = await smt_z3_1.Z3WasmBackend.create();
292
+ try {
293
+ backend.declareConst('x', 'Int');
294
+ backend.assertFormula('(= x 5)');
295
+ backend.assertFormula('(= x 6)');
296
+ (0, vitest_1.expect)(await backend.checkSat()).toBe('unsat');
297
+ backend.reset();
298
+ backend.declareConst('y', 'Int');
299
+ backend.assertFormula('(= y 7)');
300
+ const result = await backend.checkSat();
301
+ (0, vitest_1.expect)(result).toBe('sat');
302
+ const model = backend.getModel();
303
+ (0, vitest_1.expect)(model?.y).toBe(7);
304
+ }
305
+ finally {
306
+ backend.close();
307
+ }
308
+ });
309
+ (0, vitest_1.it)('create con SMTLogic (QF_LIA) acepta el preset', async () => {
310
+ const backend = await smt_z3_1.Z3WasmBackend.create('QF_LIA');
311
+ try {
312
+ backend.declareConst('x', 'Int');
313
+ backend.assertFormula('(> x 100)');
314
+ (0, vitest_1.expect)(await backend.checkSat()).toBe('sat');
315
+ }
316
+ finally {
317
+ backend.close();
318
+ }
319
+ });
320
+ (0, vitest_1.it)('combinación LIA con varias variables (x + y = 10, x - y = 2)', async () => {
321
+ const backend = await smt_z3_1.Z3WasmBackend.create();
322
+ try {
323
+ backend.declareConst('x', 'Int');
324
+ backend.declareConst('y', 'Int');
325
+ backend.assertFormula('(= (+ x y) 10)');
326
+ backend.assertFormula('(= (- x y) 2)');
327
+ const result = await backend.checkSat();
328
+ (0, vitest_1.expect)(result).toBe('sat');
329
+ const model = backend.getModel();
330
+ (0, vitest_1.expect)(model).toBeDefined();
331
+ if (model) {
332
+ (0, vitest_1.expect)(model.x).toBe(6);
333
+ (0, vitest_1.expect)(model.y).toBe(4);
334
+ }
335
+ }
336
+ finally {
337
+ backend.close();
338
+ }
339
+ });
340
+ (0, vitest_1.it)('name del backend es "z3-wasm"', async () => {
341
+ const backend = await smt_z3_1.Z3WasmBackend.create();
342
+ try {
343
+ (0, vitest_1.expect)(backend.name).toBe('z3-wasm');
344
+ }
345
+ finally {
346
+ backend.close();
347
+ }
348
+ });
349
+ (0, vitest_1.it)('getModel devuelve copia (mutaciones del caller no afectan estado interno)', async () => {
350
+ const backend = await smt_z3_1.Z3WasmBackend.create();
351
+ try {
352
+ backend.declareConst('x', 'Int');
353
+ backend.assertFormula('(= x 42)');
354
+ await backend.checkSat();
355
+ const m1 = backend.getModel();
356
+ (0, vitest_1.expect)(m1).toBeDefined();
357
+ if (m1) {
358
+ m1.x = 999;
359
+ const m2 = backend.getModel();
360
+ (0, vitest_1.expect)(m2?.x).toBe(42);
361
+ }
362
+ }
363
+ finally {
364
+ backend.close();
365
+ }
366
+ });
367
+ (0, vitest_1.it)('assertFormula vacío es no-op', async () => {
368
+ const backend = await smt_z3_1.Z3WasmBackend.create();
369
+ try {
370
+ backend.declareConst('x', 'Int');
371
+ backend.assertFormula(' '); // whitespace
372
+ backend.assertFormula('(>= x 0)');
373
+ (0, vitest_1.expect)(await backend.checkSat()).toBe('sat');
374
+ }
375
+ finally {
376
+ backend.close();
377
+ }
378
+ });
379
+ (0, vitest_1.it)('checkSat puede ejecutarse múltiples veces sin reset', async () => {
380
+ const backend = await smt_z3_1.Z3WasmBackend.create();
381
+ try {
382
+ backend.declareConst('x', 'Int');
383
+ backend.assertFormula('(>= x 0)');
384
+ const r1 = await backend.checkSat();
385
+ const r2 = await backend.checkSat();
386
+ (0, vitest_1.expect)(r1).toBe('sat');
387
+ (0, vitest_1.expect)(r2).toBe('sat');
388
+ }
389
+ finally {
390
+ backend.close();
391
+ }
392
+ });
393
+ });
394
+ //# sourceMappingURL=z3-wasm-backend.test.js.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"z3-wasm-backend.test.js","sourceRoot":"","sources":["../../../../src/tests/solver/smt-z3/z3-wasm-backend.test.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,oDAAoD;AACpD,+DAA+D;;AAE/D,mCAAmE;AACnE,mDAIgC;AAEhC,+EAA+E;AAC/E,gFAAgF;AAChF,6EAA6E;AAC7E,6EAA6E;AAC7E,yEAAyE;AACzE,SAAS,kBAAkB;IACzB,IAAI,CAAC;QACH,OAAO,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC;QAC7B,OAAO,IAAI,CAAC;IACd,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,KAAK,CAAC;IACf,CAAC;AACH,CAAC;AACD,MAAM,WAAW,GAAG,kBAAkB,EAAE,CAAC;AAEzC,IAAA,iBAAQ,EAAC,oCAAoC,EAAE,GAAG,EAAE;IAClD,IAAA,WAAE,EAAC,0CAA0C,EAAE,KAAK,IAAI,EAAE;QACxD,MAAM,CAAC,GAAG,MAAM,IAAA,sBAAa,GAAE,CAAC;QAChC,IAAA,eAAM,EAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;IACnC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,iDAAiD,EAAE,KAAK,IAAI,EAAE;QAC/D,MAAM,OAAO,GAAG,MAAM,IAAA,2BAAkB,GAAE,CAAC;QAC3C,IAAA,eAAM,EAAC,CAAC,SAAS,EAAE,eAAe,EAAE,iBAAiB,EAAE,MAAM,CAAC,CAAC,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC;IACrF,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,2DAA2D,EAAE,KAAK,IAAI,EAAE;QACzE,IAAI,CAAC,WAAW,EAAE,CAAC;YACjB,iEAAiE;YACjE,2BAA2B;YAC3B,OAAO;QACT,CAAC;QACD,MAAM,OAAO,GAAG,MAAM,IAAA,2BAAkB,GAAE,CAAC;QAC3C,IAAA,eAAM,EAAC,OAAO,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;IAClC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,iBAAQ,CAAC,MAAM,CAAC,CAAC,WAAW,CAAC,CAAC,mCAAmC,EAAE,GAAG,EAAE;IACtE,IAAI,OAAsB,CAAC;IAE3B,IAAA,kBAAS,EAAC,KAAK,IAAI,EAAE;QACnB,OAAO,GAAG,MAAM,sBAAa,CAAC,MAAM,EAAE,CAAC;IACzC,CAAC,CAAC,CAAC;IAEH,IAAA,iBAAQ,EAAC,GAAG,EAAE;QACZ,OAAO,CAAC,KAAK,EAAE,CAAC;IAClB,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,4BAA4B,EAAE,KAAK,IAAI,EAAE;QAC1C,OAAO,CAAC,KAAK,EAAE,CAAC;QAChB,OAAO,CAAC,YAAY,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;QACjC,OAAO,CAAC,aAAa,CAAC,SAAS,CAAC,CAAC;QACjC,MAAM,MAAM,GAAG,MAAM,OAAO,CAAC,QAAQ,EAAE,CAAC;QACxC,IAAA,eAAM,EAAC,MAAM,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC3B,MAAM,KAAK,GAAG,OAAO,CAAC,QAAQ,EAAE,CAAC;QACjC,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,WAAW,EAAE,CAAC;QAC5B,IAAI,KAAK,EAAE,CAAC;YACV,IAAA,eAAM,EAAC,OAAO,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;YACtC,IAAA,eAAM,EAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;QAC7C,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,4BAA4B,EAAE,KAAK,IAAI,EAAE;QAC1C,OAAO,CAAC,KAAK,EAAE,CAAC;QAChB,OAAO,CAAC,YAAY,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;QACjC,OAAO,CAAC,aAAa,CAAC,SAAS,CAAC,CAAC;QACjC,OAAO,CAAC,aAAa,CAAC,SAAS,CAAC,CAAC;QACjC,MAAM,MAAM,GAAG,MAAM,OAAO,CAAC,QAAQ,EAAE,CAAC;QACxC,IAAA,eAAM,EAAC,MAAM,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QAC7B,IAAA,eAAM,EAAC,OAAO,CAAC,QAAQ,EAAE,CAAC,CAAC,aAAa,EAAE,CAAC;IAC7C,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,4BAA4B,EAAE,KAAK,IAAI,EAAE;QAC1C,OAAO,CAAC,KAAK,EAAE,CAAC;QAChB,OAAO,CAAC,YAAY,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC;QAClC,OAAO,CAAC,aAAa,CAAC,WAAW,CAAC,CAAC;QACnC,OAAO,CAAC,aAAa,CAAC,WAAW,CAAC,CAAC;QACnC,MAAM,MAAM,GAAG,MAAM,OAAO,CAAC,QAAQ,EAAE,CAAC;QACxC,IAAA,eAAM,EAAC,MAAM,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IAC/B,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,oDAAoD,EAAE,KAAK,IAAI,EAAE;QAClE,OAAO,CAAC,KAAK,EAAE,CAAC;QAChB,OAAO,CAAC,YAAY,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC;QAClC,OAAO,CAAC,aAAa,CAAC,WAAW,CAAC,CAAC;QACnC,OAAO,CAAC,aAAa,CAAC,WAAW,CAAC,CAAC;QACnC,MAAM,MAAM,GAAG,MAAM,OAAO,CAAC,QAAQ,EAAE,CAAC;QACxC,IAAA,eAAM,EAAC,MAAM,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC3B,MAAM,KAAK,GAAG,OAAO,CAAC,QAAQ,EAAE,CAAC;QACjC,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,WAAW,EAAE,CAAC;QAC5B,IAAI,KAAK,IAAI,OAAO,KAAK,CAAC,CAAC,KAAK,QAAQ,EAAE,CAAC;YACzC,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;YACnC,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QAClC,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,sBAAsB,EAAE,KAAK,IAAI,EAAE;QACpC,OAAO,CAAC,KAAK,EAAE,CAAC;QAChB,OAAO,CAAC,YAAY,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC;QAClC,OAAO,CAAC,aAAa,CAAC,iBAAiB,CAAC,CAAC;QACzC,MAAM,MAAM,GAAG,MAAM,OAAO,CAAC,QAAQ,EAAE,CAAC;QACxC,IAAA,eAAM,EAAC,MAAM,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IAC/B,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,oBAAoB,EAAE,KAAK,IAAI,EAAE;QAClC,OAAO,CAAC,KAAK,EAAE,CAAC;QAChB,OAAO,CAAC,YAAY,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC;QAClC,OAAO,CAAC,aAAa,CAAC,gBAAgB,CAAC,CAAC;QACxC,IAAA,eAAM,EAAC,MAAM,OAAO,CAAC,QAAQ,EAAE,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC/C,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,iBAAQ,CAAC,MAAM,CAAC,CAAC,WAAW,CAAC,CAAC,wBAAwB,EAAE,GAAG,EAAE;IAC3D,IAAA,WAAE,EAAC,mCAAmC,EAAE,KAAK,IAAI,EAAE;QACjD,MAAM,OAAO,GAAG,MAAM,sBAAa,CAAC,MAAM,EAAE,CAAC;QAC7C,IAAI,CAAC;YACH,OAAO,CAAC,YAAY,CAAC,GAAG,EAAE,QAAQ,EAAE,CAAC,CAAC,CAAC;YACvC,OAAO,CAAC,aAAa,CAAC,YAAY,CAAC,CAAC;YACpC,MAAM,MAAM,GAAG,MAAM,OAAO,CAAC,QAAQ,EAAE,CAAC;YACxC,IAAA,eAAM,EAAC,MAAM,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAC3B,MAAM,KAAK,GAAG,OAAO,CAAC,QAAQ,EAAE,CAAC;YACjC,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,WAAW,EAAE,CAAC;YAC5B,IAAI,KAAK,EAAE,CAAC;gBACV,iCAAiC;gBACjC,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAC1B,CAAC;QACH,CAAC;gBAAS,CAAC;YACT,OAAO,CAAC,KAAK,EAAE,CAAC;QAClB,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,6BAA6B,EAAE,KAAK,IAAI,EAAE;QAC3C,MAAM,OAAO,GAAG,MAAM,sBAAa,CAAC,MAAM,EAAE,CAAC;QAC7C,IAAI,CAAC;YACH,OAAO,CAAC,YAAY,CAAC,GAAG,EAAE,QAAQ,EAAE,CAAC,CAAC,CAAC;YACvC,OAAO,CAAC,aAAa,CAAC,YAAY,CAAC,CAAC;YACpC,OAAO,CAAC,aAAa,CAAC,YAAY,CAAC,CAAC;YACpC,IAAA,eAAM,EAAC,MAAM,OAAO,CAAC,QAAQ,EAAE,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QACjD,CAAC;gBAAS,CAAC;YACT,OAAO,CAAC,KAAK,EAAE,CAAC;QAClB,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,kCAAkC,EAAE,KAAK,IAAI,EAAE;QAChD,MAAM,OAAO,GAAG,MAAM,sBAAa,CAAC,MAAM,EAAE,CAAC;QAC7C,IAAI,CAAC;YACH,OAAO,CAAC,YAAY,CAAC,GAAG,EAAE,QAAQ,CAAC,CAAC;YACpC,OAAO,CAAC,aAAa,CAAC,sBAAsB,CAAC,CAAC;YAC9C,IAAA,eAAM,EAAC,MAAM,OAAO,CAAC,QAAQ,EAAE,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC/C,CAAC;gBAAS,CAAC;YACT,OAAO,CAAC,KAAK,EAAE,CAAC;QAClB,CAAC;IACH,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,iBAAQ,CAAC,MAAM,CAAC,CAAC,WAAW,CAAC,CAAC,0BAA0B,EAAE,GAAG,EAAE;IAC7D,IAAA,WAAE,EAAC,yCAAyC,EAAE,KAAK,IAAI,EAAE;QACvD,MAAM,OAAO,GAAG,MAAM,sBAAa,CAAC,MAAM,EAAE,CAAC;QAC7C,IAAI,CAAC;YACH,OAAO,CAAC,YAAY,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;YACjC,OAAO,CAAC,aAAa,CAAC,SAAS,CAAC,CAAC;YACjC,IAAA,eAAM,EAAC,MAAM,OAAO,CAAC,QAAQ,EAAE,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAE7C,OAAO,CAAC,IAAI,EAAE,CAAC;YACf,OAAO,CAAC,aAAa,CAAC,SAAS,CAAC,CAAC;YACjC,IAAA,eAAM,EAAC,MAAM,OAAO,CAAC,QAAQ,EAAE,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YAE/C,OAAO,CAAC,GAAG,EAAE,CAAC;YACd,IAAA,eAAM,EAAC,MAAM,OAAO,CAAC,QAAQ,EAAE,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC/C,CAAC;gBAAS,CAAC;YACT,OAAO,CAAC,KAAK,EAAE,CAAC;QAClB,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,kCAAkC,EAAE,KAAK,IAAI,EAAE;QAChD,MAAM,OAAO,GAAG,MAAM,sBAAa,CAAC,MAAM,EAAE,CAAC;QAC7C,IAAI,CAAC;YACH,OAAO,CAAC,YAAY,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;YACjC,OAAO,CAAC,aAAa,CAAC,UAAU,CAAC,CAAC;YAClC,OAAO,CAAC,IAAI,EAAE,CAAC;YACf,OAAO,CAAC,aAAa,CAAC,UAAU,CAAC,CAAC;YAClC,OAAO,CAAC,IAAI,EAAE,CAAC;YACf,OAAO,CAAC,aAAa,CAAC,UAAU,CAAC,CAAC;YAClC,IAAA,eAAM,EAAC,MAAM,OAAO,CAAC,QAAQ,EAAE,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YAC/C,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YACf,kCAAkC;YAClC,IAAA,eAAM,EAAC,MAAM,OAAO,CAAC,QAAQ,EAAE,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC/C,CAAC;gBAAS,CAAC;YACT,OAAO,CAAC,KAAK,EAAE,CAAC;QAClB,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,iCAAiC,EAAE,KAAK,IAAI,EAAE;QAC/C,MAAM,OAAO,GAAG,MAAM,sBAAa,CAAC,MAAM,EAAE,CAAC;QAC7C,IAAI,CAAC;YACH,OAAO,CAAC,YAAY,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;YACjC,OAAO,CAAC,aAAa,CAAC,UAAU,CAAC,CAAC;YAClC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,uBAAuB;YACvC,IAAA,eAAM,EAAC,MAAM,OAAO,CAAC,QAAQ,EAAE,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC/C,CAAC;gBAAS,CAAC;YACT,OAAO,CAAC,KAAK,EAAE,CAAC;QAClB,CAAC;IACH,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,iBAAQ,CAAC,MAAM,CAAC,CAAC,WAAW,CAAC,CAAC,4BAA4B,EAAE,GAAG,EAAE;IAC/D,IAAA,WAAE,EAAC,qDAAqD,EAAE,KAAK,IAAI,EAAE;QACnE,MAAM,OAAO,GAAG,MAAM,sBAAa,CAAC,MAAM,EAAE,CAAC;QAC7C,IAAI,CAAC;YACH,OAAO,CAAC,YAAY,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;YACjC,OAAO,CAAC,WAAW,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC;YACrC,OAAO,CAAC,WAAW,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC;YACrC,OAAO,CAAC,WAAW,CAAC,IAAI,EAAE,aAAa,CAAC,CAAC;YACzC,MAAM,MAAM,GAAG,MAAM,OAAO,CAAC,QAAQ,EAAE,CAAC;YACxC,IAAA,eAAM,EAAC,MAAM,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YAC7B,MAAM,IAAI,GAAG,OAAO,CAAC,YAAY,EAAE,CAAC;YACpC,mEAAmE;YACnE,IAAA,eAAM,EAAC,IAAI,CAAC,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;YAC7B,IAAA,eAAM,EAAC,IAAI,CAAC,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;YAC7B,mDAAmD;YACnD,IAAA,eAAM,EAAC,IAAI,CAAC,CAAC,GAAG,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;QACnC,CAAC;gBAAS,CAAC;YACT,OAAO,CAAC,KAAK,EAAE,CAAC;QAClB,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,uCAAuC,EAAE,KAAK,IAAI,EAAE;QACrD,MAAM,OAAO,GAAG,MAAM,sBAAa,CAAC,MAAM,EAAE,CAAC;QAC7C,IAAI,CAAC;YACH,OAAO,CAAC,YAAY,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;YACjC,OAAO,CAAC,WAAW,CAAC,IAAI,EAAE,UAAU,CAAC,CAAC;YACtC,OAAO,CAAC,WAAW,CAAC,IAAI,EAAE,YAAY,CAAC,CAAC;YACxC,MAAM,MAAM,GAAG,MAAM,OAAO,CAAC,QAAQ,EAAE,CAAC;YACxC,IAAA,eAAM,EAAC,MAAM,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAC3B,IAAA,eAAM,EAAC,OAAO,CAAC,YAAY,EAAE,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;QAC7C,CAAC;gBAAS,CAAC;YACT,OAAO,CAAC,KAAK,EAAE,CAAC;QAClB,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,mDAAmD,EAAE,KAAK,IAAI,EAAE;QACjE,MAAM,OAAO,GAAG,MAAM,sBAAa,CAAC,MAAM,EAAE,CAAC;QAC7C,IAAI,CAAC;YACH,OAAO,CAAC,YAAY,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;YACjC,OAAO,CAAC,WAAW,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC;YACrC,IAAA,eAAM,EAAC,GAAG,EAAE,CAAC,OAAO,CAAC,WAAW,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC,CAAC,OAAO,CAAC,eAAe,CAAC,CAAC;QAC9E,CAAC;gBAAS,CAAC;YACT,OAAO,CAAC,KAAK,EAAE,CAAC;QAClB,CAAC;IACH,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,iBAAQ,CAAC,MAAM,CAAC,CAAC,WAAW,CAAC,CAAC,kCAAkC,EAAE,GAAG,EAAE;IACrE,IAAA,WAAE,EAAC,mDAAmD,EAAE,KAAK,IAAI,EAAE;QACjE,MAAM,OAAO,GAAG,MAAM,sBAAa,CAAC,MAAM,EAAE,CAAC;QAC7C,IAAI,CAAC;YACH,OAAO,CAAC,SAAS,CAAC,SAAS,EAAE,IAAI,CAAC,CAAC;YACnC,OAAO,CAAC,YAAY,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;YACjC,OAAO,CAAC,aAAa,CAAC,SAAS,CAAC,CAAC;YACjC,MAAM,MAAM,GAAG,MAAM,OAAO,CAAC,QAAQ,EAAE,CAAC;YACxC,IAAA,eAAM,EAAC,MAAM,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC7B,CAAC;gBAAS,CAAC;YACT,OAAO,CAAC,KAAK,EAAE,CAAC;QAClB,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,iCAAiC,EAAE,KAAK,IAAI,EAAE;QAC/C,MAAM,OAAO,GAAG,MAAM,sBAAa,CAAC,MAAM,CAAC,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;QAChE,IAAI,CAAC;YACH,OAAO,CAAC,YAAY,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;YACjC,OAAO,CAAC,aAAa,CAAC,SAAS,CAAC,CAAC;YACjC,IAAA,eAAM,EAAC,MAAM,OAAO,CAAC,QAAQ,EAAE,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC/C,CAAC;gBAAS,CAAC;YACT,OAAO,CAAC,KAAK,EAAE,CAAC;QAClB,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,uDAAuD,EAAE,KAAK,IAAI,EAAE;QACrE,MAAM,OAAO,GAAG,MAAM,sBAAa,CAAC,MAAM,EAAE,CAAC;QAC7C,IAAI,CAAC;YACH,OAAO,CAAC,YAAY,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;YACjC,OAAO,CAAC,aAAa,CAAC,SAAS,CAAC,CAAC;YACjC,MAAM,OAAO,CAAC,QAAQ,EAAE,CAAC;YACzB,MAAM,KAAK,GAAG,OAAO,CAAC,aAAa,EAAE,CAAC;YACtC,IAAA,eAAM,EAAC,OAAO,KAAK,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;YACpC,sDAAsD;YACtD,KAAK,MAAM,CAAC,IAAI,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC;gBACrC,IAAA,eAAM,EAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;YAClC,CAAC;QACH,CAAC;gBAAS,CAAC;YACT,OAAO,CAAC,KAAK,EAAE,CAAC;QAClB,CAAC;IACH,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,iBAAQ,CAAC,MAAM,CAAC,CAAC,WAAW,CAAC,CAAC,wBAAwB,EAAE,GAAG,EAAE;IAC3D,IAAA,WAAE,EAAC,8BAA8B,EAAE,KAAK,IAAI,EAAE;QAC5C,MAAM,OAAO,GAAG,MAAM,sBAAa,CAAC,MAAM,EAAE,CAAC;QAC7C,IAAI,CAAC;YACH,OAAO,CAAC,YAAY,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;YACjC,OAAO,CAAC,aAAa,CAAC,SAAS,CAAC,CAAC;YACjC,OAAO,CAAC,aAAa,CAAC,SAAS,CAAC,CAAC;YACjC,IAAA,eAAM,EAAC,MAAM,OAAO,CAAC,QAAQ,EAAE,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YAE/C,OAAO,CAAC,KAAK,EAAE,CAAC;YAChB,OAAO,CAAC,YAAY,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;YACjC,OAAO,CAAC,aAAa,CAAC,SAAS,CAAC,CAAC;YACjC,MAAM,MAAM,GAAG,MAAM,OAAO,CAAC,QAAQ,EAAE,CAAC;YACxC,IAAA,eAAM,EAAC,MAAM,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAC3B,MAAM,KAAK,GAAG,OAAO,CAAC,QAAQ,EAAE,CAAC;YACjC,IAAA,eAAM,EAAC,KAAK,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC3B,CAAC;gBAAS,CAAC;YACT,OAAO,CAAC,KAAK,EAAE,CAAC;QAClB,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,+CAA+C,EAAE,KAAK,IAAI,EAAE;QAC7D,MAAM,OAAO,GAAG,MAAM,sBAAa,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;QACrD,IAAI,CAAC;YACH,OAAO,CAAC,YAAY,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;YACjC,OAAO,CAAC,aAAa,CAAC,WAAW,CAAC,CAAC;YACnC,IAAA,eAAM,EAAC,MAAM,OAAO,CAAC,QAAQ,EAAE,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC/C,CAAC;gBAAS,CAAC;YACT,OAAO,CAAC,KAAK,EAAE,CAAC;QAClB,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,8DAA8D,EAAE,KAAK,IAAI,EAAE;QAC5E,MAAM,OAAO,GAAG,MAAM,sBAAa,CAAC,MAAM,EAAE,CAAC;QAC7C,IAAI,CAAC;YACH,OAAO,CAAC,YAAY,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;YACjC,OAAO,CAAC,YAAY,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;YACjC,OAAO,CAAC,aAAa,CAAC,gBAAgB,CAAC,CAAC;YACxC,OAAO,CAAC,aAAa,CAAC,eAAe,CAAC,CAAC;YACvC,MAAM,MAAM,GAAG,MAAM,OAAO,CAAC,QAAQ,EAAE,CAAC;YACxC,IAAA,eAAM,EAAC,MAAM,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAC3B,MAAM,KAAK,GAAG,OAAO,CAAC,QAAQ,EAAE,CAAC;YACjC,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,WAAW,EAAE,CAAC;YAC5B,IAAI,KAAK,EAAE,CAAC;gBACV,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;gBACxB,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAC1B,CAAC;QACH,CAAC;gBAAS,CAAC;YACT,OAAO,CAAC,KAAK,EAAE,CAAC;QAClB,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,+BAA+B,EAAE,KAAK,IAAI,EAAE;QAC7C,MAAM,OAAO,GAAG,MAAM,sBAAa,CAAC,MAAM,EAAE,CAAC;QAC7C,IAAI,CAAC;YACH,IAAA,eAAM,EAAC,OAAO,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QACvC,CAAC;gBAAS,CAAC;YACT,OAAO,CAAC,KAAK,EAAE,CAAC;QAClB,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,2EAA2E,EAAE,KAAK,IAAI,EAAE;QACzF,MAAM,OAAO,GAAG,MAAM,sBAAa,CAAC,MAAM,EAAE,CAAC;QAC7C,IAAI,CAAC;YACH,OAAO,CAAC,YAAY,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;YACjC,OAAO,CAAC,aAAa,CAAC,UAAU,CAAC,CAAC;YAClC,MAAM,OAAO,CAAC,QAAQ,EAAE,CAAC;YACzB,MAAM,EAAE,GAAG,OAAO,CAAC,QAAQ,EAAE,CAAC;YAC9B,IAAA,eAAM,EAAC,EAAE,CAAC,CAAC,WAAW,EAAE,CAAC;YACzB,IAAI,EAAE,EAAE,CAAC;gBACP,EAAE,CAAC,CAAC,GAAG,GAAG,CAAC;gBACX,MAAM,EAAE,GAAG,OAAO,CAAC,QAAQ,EAAE,CAAC;gBAC9B,IAAA,eAAM,EAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACzB,CAAC;QACH,CAAC;gBAAS,CAAC;YACT,OAAO,CAAC,KAAK,EAAE,CAAC;QAClB,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,8BAA8B,EAAE,KAAK,IAAI,EAAE;QAC5C,MAAM,OAAO,GAAG,MAAM,sBAAa,CAAC,MAAM,EAAE,CAAC;QAC7C,IAAI,CAAC;YACH,OAAO,CAAC,YAAY,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;YACjC,OAAO,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC,CAAC,aAAa;YAC3C,OAAO,CAAC,aAAa,CAAC,UAAU,CAAC,CAAC;YAClC,IAAA,eAAM,EAAC,MAAM,OAAO,CAAC,QAAQ,EAAE,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC/C,CAAC;gBAAS,CAAC;YACT,OAAO,CAAC,KAAK,EAAE,CAAC;QAClB,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,qDAAqD,EAAE,KAAK,IAAI,EAAE;QACnE,MAAM,OAAO,GAAG,MAAM,sBAAa,CAAC,MAAM,EAAE,CAAC;QAC7C,IAAI,CAAC;YACH,OAAO,CAAC,YAAY,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;YACjC,OAAO,CAAC,aAAa,CAAC,UAAU,CAAC,CAAC;YAClC,MAAM,EAAE,GAAG,MAAM,OAAO,CAAC,QAAQ,EAAE,CAAC;YACpC,MAAM,EAAE,GAAG,MAAM,OAAO,CAAC,QAAQ,EAAE,CAAC;YACpC,IAAA,eAAM,EAAC,EAAE,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACvB,IAAA,eAAM,EAAC,EAAE,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACzB,CAAC;gBAAS,CAAC;YACT,OAAO,CAAC,KAAK,EAAE,CAAC;QAClB,CAAC;IACH,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}
@@ -0,0 +1,2 @@
1
+ export {};
2
+ //# sourceMappingURL=mathlib.test.d.ts.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"mathlib.test.d.ts","sourceRoot":"","sources":["../../../../src/tests/tooling/mathlib/mathlib.test.ts"],"names":[],"mappings":""}
@@ -0,0 +1,214 @@
1
+ "use strict";
2
+ // ============================================================
3
+ // Tests: ST Mathlib — order theory, group theory, ring theory,
4
+ // instancias estándar y lemas.
5
+ // ============================================================
6
+ Object.defineProperty(exports, "__esModule", { value: true });
7
+ const vitest_1 = require("vitest");
8
+ const mathlib_1 = require("../../../tooling/mathlib");
9
+ // ============================================================
10
+ // Order theory
11
+ // ============================================================
12
+ (0, vitest_1.describe)('order theory — divisibility poset on {1,2,3,6}', () => {
13
+ const divides = { leq: (a, b) => b % a === 0 };
14
+ const elements = [1, 2, 3, 6];
15
+ (0, vitest_1.it)('isReflexive: todo n divide a n', () => {
16
+ (0, vitest_1.expect)((0, mathlib_1.isReflexive)(divides, elements)).toBe(true);
17
+ });
18
+ (0, vitest_1.it)('isAntisymmetric: a|b ∧ b|a ⇒ a=b sobre naturales positivos', () => {
19
+ (0, vitest_1.expect)((0, mathlib_1.isAntisymmetric)(divides, elements)).toBe(true);
20
+ });
21
+ (0, vitest_1.it)('isTransitive: a|b ∧ b|c ⇒ a|c', () => {
22
+ (0, vitest_1.expect)((0, mathlib_1.isTransitive)(divides, elements)).toBe(true);
23
+ });
24
+ (0, vitest_1.it)('verifyPartialOrder: divisibilidad es poset válido', () => {
25
+ const result = (0, mathlib_1.verifyPartialOrder)(divides, elements);
26
+ (0, vitest_1.expect)(result.valid).toBe(true);
27
+ (0, vitest_1.expect)(result.failures).toEqual([]);
28
+ });
29
+ (0, vitest_1.it)('isLattice: {1,2,3,6} con divisibilidad es lattice (mcm=6, mcd=1)', () => {
30
+ (0, vitest_1.expect)((0, mathlib_1.isLattice)(divides, elements)).toBe(true);
31
+ });
32
+ (0, vitest_1.it)('isLattice: {2,3} sin 1 ni 6 NO es lattice (no hay join ni meet)', () => {
33
+ (0, vitest_1.expect)((0, mathlib_1.isLattice)(divides, [2, 3])).toBe(false);
34
+ });
35
+ (0, vitest_1.it)('detecta no-transitividad en relación cooked-up', () => {
36
+ // a R b si |a-b| ≤ 1 — no transitiva: 1 R 2, 2 R 3, pero 1 ¬R 3.
37
+ const closeRel = { leq: (a, b) => Math.abs(a - b) <= 1 };
38
+ (0, vitest_1.expect)((0, mathlib_1.isTransitive)(closeRel, [1, 2, 3])).toBe(false);
39
+ });
40
+ });
41
+ // ============================================================
42
+ // Group theory
43
+ // ============================================================
44
+ (0, vitest_1.describe)('group theory — Z aditivo', () => {
45
+ const sample = [-2n, -1n, 0n, 1n, 2n];
46
+ (0, vitest_1.it)('intAdditiveGroup: asociatividad', () => {
47
+ (0, vitest_1.expect)((0, mathlib_1.isAssociative)(mathlib_1.intAdditiveGroup, sample)).toBe(true);
48
+ });
49
+ (0, vitest_1.it)('intAdditiveGroup: conmutatividad', () => {
50
+ (0, vitest_1.expect)((0, mathlib_1.isCommutative)(mathlib_1.intAdditiveGroup, sample)).toBe(true);
51
+ });
52
+ (0, vitest_1.it)('intAdditiveGroup: 0 es identidad aditiva', () => {
53
+ (0, vitest_1.expect)((0, mathlib_1.hasIdentity)(mathlib_1.intAdditiveGroup, sample, mathlib_1.intAdditiveGroup.identity)).toBe(true);
54
+ });
55
+ (0, vitest_1.it)('intAdditiveGroup: cada n tiene inverso -n', () => {
56
+ (0, vitest_1.expect)((0, mathlib_1.hasInverses)(mathlib_1.intAdditiveGroup, sample)).toBe(true);
57
+ });
58
+ (0, vitest_1.it)('verifyGroup(Z, +) pasa todos los axiomas', () => {
59
+ const result = (0, mathlib_1.verifyGroup)(mathlib_1.intAdditiveGroup, sample);
60
+ (0, vitest_1.expect)(result.valid).toBe(true);
61
+ (0, vitest_1.expect)(result.failures).toEqual([]);
62
+ });
63
+ (0, vitest_1.it)('verifyAbelianGroup(Z, +) incluye conmutatividad y pasa', () => {
64
+ const result = (0, mathlib_1.verifyAbelianGroup)(mathlib_1.intAdditiveGroup, sample);
65
+ (0, vitest_1.expect)(result.valid).toBe(true);
66
+ });
67
+ });
68
+ (0, vitest_1.describe)('group theory — S_3 simétrico', () => {
69
+ (0, vitest_1.it)('sym3: es grupo (asociativo + identidad + inversos)', () => {
70
+ const result = (0, mathlib_1.verifyGroup)(mathlib_1.sym3, mathlib_1.sym3Elements, mathlib_1.perm3Eq);
71
+ (0, vitest_1.expect)(result.valid).toBe(true);
72
+ (0, vitest_1.expect)(result.failures).toEqual([]);
73
+ });
74
+ (0, vitest_1.it)('sym3: NO es abeliano — (0 1) ∘ (0 2) ≠ (0 2) ∘ (0 1)', () => {
75
+ (0, vitest_1.expect)((0, mathlib_1.isCommutative)(mathlib_1.sym3, mathlib_1.sym3Elements, mathlib_1.perm3Eq)).toBe(false);
76
+ });
77
+ (0, vitest_1.it)('sym3: verifyAbelianGroup falla en conmutatividad', () => {
78
+ const result = (0, mathlib_1.verifyAbelianGroup)(mathlib_1.sym3, mathlib_1.sym3Elements, mathlib_1.perm3Eq);
79
+ (0, vitest_1.expect)(result.valid).toBe(false);
80
+ (0, vitest_1.expect)(result.failures).toContain('conmutatividad');
81
+ });
82
+ (0, vitest_1.it)('sym3: el inverso de un elemento aplicado dos veces es el original', () => {
83
+ for (const p of mathlib_1.sym3Elements) {
84
+ const inv = mathlib_1.sym3.inverse(p);
85
+ const reconstructed = mathlib_1.sym3.inverse(inv);
86
+ (0, vitest_1.expect)((0, mathlib_1.perm3Eq)(reconstructed, p)).toBe(true);
87
+ }
88
+ });
89
+ });
90
+ // ============================================================
91
+ // Ring theory
92
+ // ============================================================
93
+ (0, vitest_1.describe)('ring theory — Z anillo', () => {
94
+ const sample = [-2n, -1n, 0n, 1n, 2n];
95
+ (0, vitest_1.it)('verifyRing(Z): pasa todos los axiomas', () => {
96
+ const result = (0, mathlib_1.verifyRing)(mathlib_1.intRing, sample);
97
+ (0, vitest_1.expect)(result.valid).toBe(true);
98
+ (0, vitest_1.expect)(result.failures).toEqual([]);
99
+ });
100
+ (0, vitest_1.it)('intRing: zero=0, one=1', () => {
101
+ (0, vitest_1.expect)(mathlib_1.intRing.zero).toBe(0n);
102
+ (0, vitest_1.expect)(mathlib_1.intRing.one).toBe(1n);
103
+ });
104
+ (0, vitest_1.it)('intRing: distributividad explícita 2*(3+4)=2*3+2*4', () => {
105
+ const left = mathlib_1.intRing.mul(2n, mathlib_1.intRing.add(3n, 4n));
106
+ const right = mathlib_1.intRing.add(mathlib_1.intRing.mul(2n, 3n), mathlib_1.intRing.mul(2n, 4n));
107
+ (0, vitest_1.expect)(left).toBe(right);
108
+ });
109
+ (0, vitest_1.it)('intRing NO es campo (2 no tiene inverso multiplicativo en Z)', () => {
110
+ // div definida solo cuando divide exacta — usamos undefined si no divisible.
111
+ const intDiv = (a, b) => b !== 0n && a % b === 0n ? a / b : undefined;
112
+ (0, vitest_1.expect)((0, mathlib_1.isField)(mathlib_1.intRing, sample, intDiv)).toBe(false);
113
+ });
114
+ });
115
+ (0, vitest_1.describe)('ring theory — Z/nZ', () => {
116
+ (0, vitest_1.it)('zModN(5): es anillo válido', () => {
117
+ const r = (0, mathlib_1.zModN)(5n);
118
+ const result = (0, mathlib_1.verifyRing)(r, (0, mathlib_1.zModNElements)(5n));
119
+ (0, vitest_1.expect)(result.valid).toBe(true);
120
+ });
121
+ (0, vitest_1.it)('zModN(5): es campo (5 es primo)', () => {
122
+ const r = (0, mathlib_1.zModN)(5n);
123
+ (0, vitest_1.expect)((0, mathlib_1.isField)(r, (0, mathlib_1.zModNElements)(5n), (0, mathlib_1.zModNDiv)(5n))).toBe(true);
124
+ });
125
+ (0, vitest_1.it)('zModN(7): es campo (7 es primo)', () => {
126
+ const r = (0, mathlib_1.zModN)(7n);
127
+ (0, vitest_1.expect)((0, mathlib_1.isField)(r, (0, mathlib_1.zModNElements)(7n), (0, mathlib_1.zModNDiv)(7n))).toBe(true);
128
+ });
129
+ (0, vitest_1.it)('zModN(4): NO es campo (4 no es primo, 2 no tiene inverso)', () => {
130
+ const r = (0, mathlib_1.zModN)(4n);
131
+ (0, vitest_1.expect)((0, mathlib_1.isField)(r, (0, mathlib_1.zModNElements)(4n), (0, mathlib_1.zModNDiv)(4n))).toBe(false);
132
+ });
133
+ (0, vitest_1.it)('zModN(6): NO es campo', () => {
134
+ const r = (0, mathlib_1.zModN)(6n);
135
+ (0, vitest_1.expect)((0, mathlib_1.isField)(r, (0, mathlib_1.zModNElements)(6n), (0, mathlib_1.zModNDiv)(6n))).toBe(false);
136
+ });
137
+ (0, vitest_1.it)('zModN(5): 3 + 4 = 2 (mod 5)', () => {
138
+ const r = (0, mathlib_1.zModN)(5n);
139
+ (0, vitest_1.expect)(r.add(3n, 4n)).toBe(2n);
140
+ });
141
+ (0, vitest_1.it)('zModN(5): 3 * 4 = 2 (mod 5)', () => {
142
+ const r = (0, mathlib_1.zModN)(5n);
143
+ (0, vitest_1.expect)(r.mul(3n, 4n)).toBe(2n);
144
+ });
145
+ });
146
+ (0, vitest_1.describe)('ring theory — racionales como campo', () => {
147
+ const sample = [
148
+ (0, mathlib_1.rational)(0n, 1n),
149
+ (0, mathlib_1.rational)(1n, 1n),
150
+ (0, mathlib_1.rational)(-1n, 1n),
151
+ (0, mathlib_1.rational)(1n, 2n),
152
+ (0, mathlib_1.rational)(2n, 3n),
153
+ ];
154
+ (0, vitest_1.it)('rationalsField: anillo válido sobre muestreo', () => {
155
+ const result = (0, mathlib_1.verifyRing)(mathlib_1.rationalsField, sample, mathlib_1.rationalEq);
156
+ (0, vitest_1.expect)(result.valid).toBe(true);
157
+ });
158
+ (0, vitest_1.it)('rationalsField: es campo (todo no-cero invertible)', () => {
159
+ (0, vitest_1.expect)((0, mathlib_1.isField)(mathlib_1.rationalsField, sample, mathlib_1.rationalDiv, mathlib_1.rationalEq)).toBe(true);
160
+ });
161
+ (0, vitest_1.it)('rational: 2/4 se reduce a 1/2', () => {
162
+ const r = (0, mathlib_1.rational)(2n, 4n);
163
+ (0, vitest_1.expect)(r.num).toBe(1n);
164
+ (0, vitest_1.expect)(r.den).toBe(2n);
165
+ });
166
+ (0, vitest_1.it)('rationalDiv: división por cero devuelve undefined', () => {
167
+ (0, vitest_1.expect)((0, mathlib_1.rationalDiv)((0, mathlib_1.rational)(1n, 1n), (0, mathlib_1.rational)(0n, 1n))).toBeUndefined();
168
+ });
169
+ (0, vitest_1.it)('rational: normaliza signos (1/-2 → -1/2)', () => {
170
+ const r = (0, mathlib_1.rational)(1n, -2n);
171
+ (0, vitest_1.expect)(r.num).toBe(-1n);
172
+ (0, vitest_1.expect)(r.den).toBe(2n);
173
+ });
174
+ (0, vitest_1.it)('rational: error si denominador es 0', () => {
175
+ (0, vitest_1.expect)(() => (0, mathlib_1.rational)(1n, 0n)).toThrow();
176
+ });
177
+ });
178
+ // ============================================================
179
+ // Lemmas
180
+ // ============================================================
181
+ (0, vitest_1.describe)('standard lemmas', () => {
182
+ (0, vitest_1.it)('STANDARD_LEMMAS contiene al menos 8 lemas', () => {
183
+ (0, vitest_1.expect)(mathlib_1.STANDARD_LEMMAS.length).toBeGreaterThanOrEqual(8);
184
+ });
185
+ (0, vitest_1.it)('cada lemma tiene name y statement no vacíos', () => {
186
+ for (const l of mathlib_1.STANDARD_LEMMAS) {
187
+ (0, vitest_1.expect)(l.name).toBeTruthy();
188
+ (0, vitest_1.expect)(l.statement.length).toBeGreaterThan(0);
189
+ }
190
+ });
191
+ (0, vitest_1.it)('group.inverse_unique es aplicable a estructura con op', () => {
192
+ const lemma = mathlib_1.STANDARD_LEMMAS.find((l) => l.name === 'group.inverse_unique');
193
+ (0, vitest_1.expect)(lemma).toBeDefined();
194
+ const struct = {
195
+ name: 'test',
196
+ elements: [],
197
+ operations: new Map([['op', (a, b) => [a, b]]]),
198
+ axioms: [],
199
+ };
200
+ (0, vitest_1.expect)(lemma.applicableTo(struct)).toBe(true);
201
+ });
202
+ (0, vitest_1.it)('ring.zero_times_anything requiere ops add y mul', () => {
203
+ const lemma = mathlib_1.STANDARD_LEMMAS.find((l) => l.name === 'ring.zero_times_anything');
204
+ (0, vitest_1.expect)(lemma).toBeDefined();
205
+ const onlyAdd = {
206
+ name: 'test',
207
+ elements: [],
208
+ operations: new Map([['add', (a, b) => [a, b]]]),
209
+ axioms: [],
210
+ };
211
+ (0, vitest_1.expect)(lemma.applicableTo(onlyAdd)).toBe(false);
212
+ });
213
+ });
214
+ //# sourceMappingURL=mathlib.test.js.map