@stevenvo780/st-lang 4.1.0 → 4.3.0

package/dist/tests/proof-minify/minify.test.js

@@ -0,0 +1,281 @@
+"use strict";
+// ============================================================
+// ST Proof Minification — Tests
+// ============================================================
+Object.defineProperty(exports, "__esModule", { value: true });
+const vitest_1 = require("vitest");
+const proof_minify_1 = require("../../runtime/proof-minify");
+// ── Helpers de construcción ──────────────────────────────────
+function ax(conclusion) {
+    return { conclusion, rule: 'axiom', premises: [] };
+}
+function hyp(conclusion) {
+    return { conclusion, rule: 'hypothesis', premises: [] };
+}
+function mp(conclusion, ant, impl) {
+    return { conclusion, rule: 'MP', premises: [ant, impl] };
+}
+function andI(left, right) {
+    return {
+        conclusion: `${left.conclusion} ∧ ${right.conclusion}`,
+        rule: '∧I',
+        premises: [left, right],
+    };
+}
+function andE1(conjunct, conj) {
+    return { conclusion: conjunct, rule: '∧E1', premises: [conj] };
+}
+function cut(conclusion, left, right) {
+    return { conclusion, rule: 'cut', premises: [left, right] };
+}
+function weaken(conclusion, ...premises) {
+    return { conclusion, rule: 'weakening', premises };
+}
+// ── Tests ────────────────────────────────────────────────────
+(0, vitest_1.describe)('proof-minify: counts y depth', () => {
+    (0, vitest_1.it)('countNodes/depth funcionan correctamente sobre un árbol simple', () => {
+        const proof = mp('B', ax('A'), ax('A → B'));
+        const result = (0, proof_minify_1.minifyProof)(proof, { rules: [] }); // no aplicar reglas
+        (0, vitest_1.expect)(result.original.nodes).toBe(3);
+        (0, vitest_1.expect)(result.original.depth).toBe(1);
+    });
+});
+(0, vitest_1.describe)('proof-minify: detrivialize ∧I/∧E', () => {
+    (0, vitest_1.it)('colapsa ∧E1 ∘ ∧I al sub-árbol correspondiente', () => {
+        // (A ∧ B) introducido y luego eliminado a A.
+        const intro = andI(ax('A'), ax('B'));
+        const elim = andE1('A', intro);
+        const result = (0, proof_minify_1.minifyProof)(elim);
+        (0, vitest_1.expect)(result.minified.conclusion).toBe('A');
+        (0, vitest_1.expect)(result.minified.rule).toBe('axiom');
+        (0, vitest_1.expect)(result.minified.premises).toHaveLength(0);
+        (0, vitest_1.expect)(result.reduction.nodesRemoved).toBeGreaterThanOrEqual(2);
+    });
+    (0, vitest_1.it)('detrivializa anidados: ∧E1 ∘ ∧I ∘ ∧E1 ∘ ∧I', () => {
+        // Construimos: (((A ∧ B) ∧ C) , extracción de A vía dos eliminaciones)
+        const innerIntro = andI(ax('A'), ax('B'));
+        const elim1 = andE1('A', innerIntro);
+        const outerIntro = andI(elim1, ax('C'));
+        const elim2 = andE1('A', outerIntro);
+        const result = (0, proof_minify_1.minifyProof)(elim2);
+        (0, vitest_1.expect)(result.minified.rule).toBe('axiom');
+        (0, vitest_1.expect)(result.minified.conclusion).toBe('A');
+    });
+});
+(0, vitest_1.describe)('proof-minify: compact MP chains', () => {
+    (0, vitest_1.it)('compacta una cadena de 5 MPs en un único MP*', () => {
+        // A, A→B, B→C, C→D, D→E, E→F ⊢ F
+        const step1 = mp('B', ax('A'), ax('A → B'));
+        const step2 = mp('C', step1, ax('B → C'));
+        const step3 = mp('D', step2, ax('C → D'));
+        const step4 = mp('E', step3, ax('D → E'));
+        const step5 = mp('F', step4, ax('E → F'));
+        const result = (0, proof_minify_1.minifyProof)(step5, { rules: ['compact-mp'] });
+        (0, vitest_1.expect)(result.minified.rule).toBe('MP*');
+        (0, vitest_1.expect)(result.minified.conclusion).toBe('F');
+        (0, vitest_1.expect)(result.minified.metadata?.chain).toBeDefined();
+        (0, vitest_1.expect)(result.minified.metadata.chain.length).toBeGreaterThanOrEqual(5);
+        // Profundidad debe haberse reducido drásticamente.
+        (0, vitest_1.expect)(result.reduction.depthDelta).toBeGreaterThan(0);
+    });
+    (0, vitest_1.it)('no compacta cadenas ambiguas (sin → en las premisas)', () => {
+        const fake1 = mp('X', ax('Y'), ax('Z'));
+        const fake2 = mp('A', fake1, ax('W'));
+        const result = (0, proof_minify_1.compactModusPonensChain)(fake2);
+        // Como no detecta antecedente vs implicación, no compacta.
+        (0, vitest_1.expect)(result.rule).toBe('MP');
+    });
+    (0, vitest_1.it)('cadenas de exactamente 1 MP no se compactan', () => {
+        const proof = mp('B', ax('A'), ax('A → B'));
+        const result = (0, proof_minify_1.compactModusPonensChain)(proof);
+        (0, vitest_1.expect)(result.rule).toBe('MP');
+    });
+});
+(0, vitest_1.describe)('proof-minify: local cut elimination', () => {
+    (0, vitest_1.it)('elimina cut cuando una rama es hoja-identidad', () => {
+        // cut sobre conclusión A: una rama es la hipótesis A, la otra deriva A.
+        const derivacionA = andE1('A', andI(ax('A'), ax('B')));
+        const proofWithCut = cut('A', hyp('A'), derivacionA);
+        const result = (0, proof_minify_1.minifyProof)(proofWithCut, { rules: ['cut-elimination-local'] });
+        // El cut se reemplaza por la derivación que realmente concluyó A.
+        (0, vitest_1.expect)(result.minified.rule).not.toBe('cut');
+    });
+    (0, vitest_1.it)('mantiene cut cuando ninguna rama es hoja-identidad', () => {
+        const left = mp('A', ax('X'), ax('X → A'));
+        const right = mp('B', ax('A'), ax('A → B'));
+        const proof = cut('B', left, right);
+        const result = (0, proof_minify_1.minifyProof)(proof, { rules: ['cut-elimination-local'] });
+        (0, vitest_1.expect)(result.minified.rule).toBe('cut');
+    });
+});
+(0, vitest_1.describe)('proof-minify: remove unused subproofs', () => {
+    (0, vitest_1.it)('recorta premisas irrelevantes en weakening', () => {
+        // Weakening: la conclusion es A. Sólo una premisa contiene A.
+        const irrelevante1 = ax('Z');
+        const irrelevante2 = ax('W');
+        const relevante = ax('A');
+        const proof = weaken('A', irrelevante1, irrelevante2, relevante);
+        const result = (0, proof_minify_1.removeUnusedSubproofs)(proof);
+        (0, vitest_1.expect)(result.premises.length).toBeLessThan(3);
+        // La premisa que sobrevive debe contener A.
+        (0, vitest_1.expect)(result.premises.some((p) => p.conclusion === 'A')).toBe(true);
+    });
+    (0, vitest_1.it)('no toca nodos con sólo 1 premisa', () => {
+        const proof = {
+            conclusion: 'A',
+            rule: '∧E1',
+            premises: [andI(ax('A'), ax('B'))],
+        };
+        const result = (0, proof_minify_1.removeUnusedSubproofs)(proof);
+        (0, vitest_1.expect)(result.premises).toHaveLength(1);
+    });
+});
+(0, vitest_1.describe)('proof-minify: estadística general', () => {
+    (0, vitest_1.it)('reduce un árbol con 10 nodos y 2 redundantes a ≤ 8 nodos', () => {
+        // Construimos un árbol con 2 ∧I/∧E1 redundantes.
+        // Layout:
+        //  A_intro = (A ∧ B), elim1 = A
+        //  B_intro = (B ∧ C), elim2 = B
+        //  raíz = (elim1 ∧ elim2)
+        const aIntro = andI(ax('A'), ax('B')); // 3 nodos
+        const aElim = andE1('A', aIntro); // +1 = 4
+        const bIntro = andI(ax('B'), ax('C')); // +3 = 7
+        const bElim = andE1('B', bIntro); // +1 = 8
+        const root = andI(aElim, bElim); // +1 = 9
+        // Añadimos un dead-weight: el árbol original.
+        const proof = {
+            conclusion: root.conclusion,
+            rule: root.rule,
+            premises: [...root.premises, ax('Q')], // +1 hojas dead = 10
+        };
+        const result = (0, proof_minify_1.minifyProof)(proof);
+        (0, vitest_1.expect)(result.original.nodes).toBe(10);
+        // Tras detrivialize, aElim → ax('A'), bElim → ax('B'). Nodos: 10-4 = 6.
+        (0, vitest_1.expect)(result.minified.conclusion).toBe(proof.conclusion);
+        (0, vitest_1.expect)(result.reduction.nodesRemoved).toBeGreaterThanOrEqual(2);
+        (0, vitest_1.expect)(result.minified.premises.length).toBeLessThanOrEqual(2);
+    });
+});
+(0, vitest_1.describe)('proof-minify: preservación de la raíz', () => {
+    (0, vitest_1.it)('la conclusion de la raíz nunca cambia', () => {
+        const proof = mp('Q', ax('P'), ax('P → Q'));
+        const result = (0, proof_minify_1.minifyProof)(proof);
+        (0, vitest_1.expect)(result.minified.conclusion).toBe('Q');
+    });
+    (0, vitest_1.it)('una hoja se devuelve sin cambios', () => {
+        const leaf = ax('Hello');
+        const result = (0, proof_minify_1.minifyProof)(leaf);
+        (0, vitest_1.expect)(result.minified).toEqual(leaf);
+        (0, vitest_1.expect)(result.reduction.nodesRemoved).toBe(0);
+        (0, vitest_1.expect)(result.reduction.percentage).toBe(0);
+    });
+});
+(0, vitest_1.describe)('proof-minify: idempotencia', () => {
+    (0, vitest_1.it)('minify(minify(p)) tiene la misma estructura que minify(p)', () => {
+        const aIntro = andI(ax('A'), ax('B'));
+        const aElim = andE1('A', aIntro);
+        const proof = andI(aElim, ax('C'));
+        const once = (0, proof_minify_1.minifyProof)(proof);
+        const twice = (0, proof_minify_1.minifyProof)(once.minified);
+        // Las claves canónicas deben coincidir.
+        const keyOnce = JSON.stringify(once.minified);
+        const keyTwice = JSON.stringify(twice.minified);
+        (0, vitest_1.expect)(keyOnce).toBe(keyTwice);
+        (0, vitest_1.expect)(twice.reduction.nodesRemoved).toBe(0);
+    });
+    (0, vitest_1.it)('idempotencia en cadena MP compactada', () => {
+        const s1 = mp('B', ax('A'), ax('A → B'));
+        const s2 = mp('C', s1, ax('B → C'));
+        const s3 = mp('D', s2, ax('C → D'));
+        const once = (0, proof_minify_1.minifyProof)(s3);
+        const twice = (0, proof_minify_1.minifyProof)(once.minified);
+        (0, vitest_1.expect)(JSON.stringify(once.minified)).toBe(JSON.stringify(twice.minified));
+    });
+    (0, vitest_1.it)('idempotencia sobre prueba ya minimal', () => {
+        const leaf = ax('A');
+        const r1 = (0, proof_minify_1.minifyProof)(leaf);
+        const r2 = (0, proof_minify_1.minifyProof)(r1.minified);
+        (0, vitest_1.expect)(r2.iterations).toBeLessThanOrEqual(2);
+        (0, vitest_1.expect)(r2.reduction.nodesRemoved).toBe(0);
+    });
+});
+(0, vitest_1.describe)('proof-minify: opciones', () => {
+    (0, vitest_1.it)('rules=[] no aplica ninguna reducción', () => {
+        const aElim = andE1('A', andI(ax('A'), ax('B')));
+        const result = (0, proof_minify_1.minifyProof)(aElim, { rules: [] });
+        (0, vitest_1.expect)(result.reduction.nodesRemoved).toBe(0);
+        (0, vitest_1.expect)(result.minified.rule).toBe('∧E1');
+    });
+    (0, vitest_1.it)('maxIterations=1 limita las pasadas globales', () => {
+        const aElim = andE1('A', andI(ax('A'), ax('B')));
+        const result = (0, proof_minify_1.minifyProof)(aElim, { maxIterations: 1 });
+        (0, vitest_1.expect)(result.iterations).toBe(1);
+    });
+    (0, vitest_1.it)('rules selectivo: sólo compact-mp no afecta árboles sin MP', () => {
+        const proof = andI(ax('A'), ax('B'));
+        const result = (0, proof_minify_1.minifyProof)(proof, { rules: ['compact-mp'] });
+        (0, vitest_1.expect)(result.reduction.nodesRemoved).toBe(0);
+    });
+    (0, vitest_1.it)('rules selectivo: sólo detrivialize en árbol con ∧I/∧E', () => {
+        const proof = andE1('A', andI(ax('A'), ax('B')));
+        const result = (0, proof_minify_1.minifyProof)(proof, { rules: ['detrivialize'] });
+        (0, vitest_1.expect)(result.minified.rule).toBe('axiom');
+    });
+});
+(0, vitest_1.describe)('proof-minify: dedup de premisas', () => {
+    (0, vitest_1.it)('elimina premisas duplicadas estructurales', () => {
+        // ∧I con dos premisas idénticas (caso degenerado pero válido).
+        const dup = {
+            conclusion: 'A ∧ A',
+            rule: '∧I',
+            premises: [ax('A'), ax('A')],
+        };
+        const result = (0, proof_minify_1.minifyProof)(dup, { rules: ['detrivialize'] });
+        (0, vitest_1.expect)(result.minified.premises).toHaveLength(1);
+    });
+});
+(0, vitest_1.describe)('proof-minify: input no se muta', () => {
+    (0, vitest_1.it)('el árbol original queda intacto', () => {
+        const original = andE1('A', andI(ax('A'), ax('B')));
+        const snapshot = JSON.stringify(original);
+        (0, proof_minify_1.minifyProof)(original);
+        (0, vitest_1.expect)(JSON.stringify(original)).toBe(snapshot);
+    });
+});
+(0, vitest_1.describe)('proof-minify: integración multi-regla', () => {
+    (0, vitest_1.it)('combina detrivialize + compact-mp + remove-unused', () => {
+        // Construye: weaken con premisas extras, cadena MP dentro, ∧E∘∧I.
+        const aElim = andE1('A', andI(ax('A'), ax('B')));
+        const s1 = mp('B', aElim, ax('A → B'));
+        const s2 = mp('C', s1, ax('B → C'));
+        const root = weaken('C', s2, ax('IRRELEVANTE_Z'));
+        const result = (0, proof_minify_1.minifyProof)(root);
+        (0, vitest_1.expect)(result.minified.conclusion).toBe('C');
+        // La premisa irrelevante debe haberse podado.
+        (0, vitest_1.expect)(result.reduction.nodesRemoved).toBeGreaterThan(0);
+    });
+    (0, vitest_1.it)('punto fijo alcanzado antes de maxIterations', () => {
+        const proof = mp('B', ax('A'), ax('A → B'));
+        const result = (0, proof_minify_1.minifyProof)(proof, { maxIterations: 100 });
+        (0, vitest_1.expect)(result.iterations).toBeLessThanOrEqual(2);
+    });
+});
+(0, vitest_1.describe)('proof-minify: métricas', () => {
+    (0, vitest_1.it)('percentage es 0 para una hoja', () => {
+        const result = (0, proof_minify_1.minifyProof)(ax('X'));
+        (0, vitest_1.expect)(result.reduction.percentage).toBe(0);
+    });
+    (0, vitest_1.it)('percentage > 0 cuando hay reducción', () => {
+        const aElim = andE1('A', andI(ax('A'), ax('B')));
+        const result = (0, proof_minify_1.minifyProof)(aElim);
+        (0, vitest_1.expect)(result.reduction.percentage).toBeGreaterThan(0);
+    });
+    (0, vitest_1.it)('depthDelta > 0 al compactar cadena MP', () => {
+        const s1 = mp('B', ax('A'), ax('A → B'));
+        const s2 = mp('C', s1, ax('B → C'));
+        const s3 = mp('D', s2, ax('C → D'));
+        const result = (0, proof_minify_1.minifyProof)(s3);
+        (0, vitest_1.expect)(result.reduction.depthDelta).toBeGreaterThan(0);
+    });
+});
+//# sourceMappingURL=minify.test.js.map

package/dist/tests/proof-minify/minify.test.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"minify.test.js","sourceRoot":"","sources":["../../../src/tests/proof-minify/minify.test.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,gCAAgC;AAChC,+DAA+D;;AAE/D,mCAA8C;AAC9C,6DAKoC;AAEpC,gEAAgE;AAEhE,SAAS,EAAE,CAAC,UAAkB;IAC5B,OAAO,EAAE,UAAU,EAAE,IAAI,EAAE,OAAO,EAAE,QAAQ,EAAE,EAAE,EAAE,CAAC;AACrD,CAAC;AACD,SAAS,GAAG,CAAC,UAAkB;IAC7B,OAAO,EAAE,UAAU,EAAE,IAAI,EAAE,YAAY,EAAE,QAAQ,EAAE,EAAE,EAAE,CAAC;AAC1D,CAAC;AACD,SAAS,EAAE,CAAC,UAAkB,EAAE,GAAqB,EAAE,IAAsB;IAC3E,OAAO,EAAE,UAAU,EAAE,IAAI,EAAE,IAAI,EAAE,QAAQ,EAAE,CAAC,GAAG,EAAE,IAAI,CAAC,EAAE,CAAC;AAC3D,CAAC;AACD,SAAS,IAAI,CAAC,IAAsB,EAAE,KAAuB;IAC3D,OAAO;QACL,UAAU,EAAE,GAAG,IAAI,CAAC,UAAU,MAAM,KAAK,CAAC,UAAU,EAAE;QACtD,IAAI,EAAE,IAAI;QACV,QAAQ,EAAE,CAAC,IAAI,EAAE,KAAK,CAAC;KACxB,CAAC;AACJ,CAAC;AACD,SAAS,KAAK,CAAC,QAAgB,EAAE,IAAsB;IACrD,OAAO,EAAE,UAAU,EAAE,QAAQ,EAAE,IAAI,EAAE,KAAK,EAAE,QAAQ,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;AACjE,CAAC;AACD,SAAS,GAAG,CACV,UAAkB,EAClB,IAAsB,EACtB,KAAuB;IAEvB,OAAO,EAAE,UAAU,EAAE,IAAI,EAAE,KAAK,EAAE,QAAQ,EAAE,CAAC,IAAI,EAAE,KAAK,CAAC,EAAE,CAAC;AAC9D,CAAC;AACD,SAAS,MAAM,CAAC,UAAkB,EAAE,GAAG,QAA4B;IACjE,OAAO,EAAE,UAAU,EAAE,IAAI,EAAE,WAAW,EAAE,QAAQ,EAAE,CAAC;AACrD,CAAC;AAED,gEAAgE;AAEhE,IAAA,iBAAQ,EAAC,8BAA8B,EAAE,GAAG,EAAE;IAC5C,IAAA,WAAE,EAAC,gEAAgE,EAAE,GAAG,EAAE;QACxE,MAAM,KAAK,GAAG,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC;QAC5C,MAAM,MAAM,GAAG,IAAA,0BAAW,EAAC,KAAK,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,oBAAoB;QACtE,IAAA,eAAM,EAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACtC,IAAA,eAAM,EAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACxC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,kCAAkC,EAAE,GAAG,EAAE;IAChD,IAAA,WAAE,EAAC,+CAA+C,EAAE,GAAG,EAAE;QACvD,6CAA6C;QAC7C,MAAM,KAAK,GAAG,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;QACrC,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;QAC/B,MAAM,MAAM,GAAG,IAAA,0BAAW,EAAC,IAAI,CAAC,CAAC;QACjC,IAAA,eAAM,EAAC,MAAM,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAC7C,IAAA,eAAM,EAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QAC3C,IAAA,eAAM,EAAC,MAAM,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QACjD,IAAA,eAAM,EAAC,MAAM,CAAC,SAAS,CAAC,YAAY,CAAC,CAAC,sBAAsB,CAAC,CAAC,CAAC,CAAC;IAClE,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,4CAA4C,EAAE,GAAG,EAAE;QACpD,uEAAuE;QACvE,MAAM,UAAU,GAAG,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;QAC1C,MAAM,KAAK,GAAG,KAAK,CAAC,GAAG,EAAE,UAAU,CAAC,CAAC;QACrC,MAAM,UAAU,GAAG,IAAI,CAAC,KAAK,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;QACxC,MAAM,KAAK,GAAG,KAAK,CAAC,GAAG,EAAE,UAAU,CAAC,CAAC;QACrC,MAAM,MAAM,GAAG,IAAA,0BAAW,EAAC,KAAK,CAAC,CAAC;QAClC,IAAA,eAAM,EAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QAC3C,IAAA,eAAM,EAAC,MAAM,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IAC/C,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,iCAAiC,EAAE,GAAG,EAAE;IAC/C,IAAA,WAAE,EAAC,8CAA8C,EAAE,GAAG,EAAE;QACtD,iCAAiC;QACjC,MAAM,KAAK,GAAG,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC;QAC5C,MAAM,KAAK,GAAG,EAAE,CAAC,GAAG,EAAE,KAAK,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC;QAC1C,MAAM,KAAK,GAAG,EAAE,CAAC,GAAG,EAAE,KAAK,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC;QAC1C,MAAM,KAAK,GAAG,EAAE,CAAC,GAAG,EAAE,KAAK,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC;QAC1C,MAAM,KAAK,GAAG,EAAE,CAAC,GAAG,EAAE,KAAK,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC;QAE1C,MAAM,MAAM,GAAG,IAAA,0BAAW,EAAC,KAAK,EAAE,EAAE,KAAK,EAAE,CAAC,YAAY,CAAC,EAAE,CAAC,CAAC;QAC7D,IAAA,eAAM,EAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACzC,IAAA,eAAM,EAAC,MAAM,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAC7C,IAAA,eAAM,EAAC,MAAM,CAAC,QAAQ,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC,WAAW,EAAE,CAAC;QACtD,IAAA,eAAM,EAAE,MAAM,CAAC,QAAQ,CAAC,QAAS,CAAC,KAAkB,CAAC,MAAM,CAAC,CAAC,sBAAsB,CAAC,CAAC,CAAC,CAAC;QACvF,mDAAmD;QACnD,IAAA,eAAM,EAAC,MAAM,CAAC,SAAS,CAAC,UAAU,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;IACzD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,sDAAsD,EAAE,GAAG,EAAE;QAC9D,MAAM,KAAK,GAAG,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;QACxC,MAAM,KAAK,GAAG,EAAE,CAAC,GAAG,EAAE,KAAK,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;QACtC,MAAM,MAAM,GAAG,IAAA,sCAAuB,EAAC,KAAK,CAAC,CAAC;QAC9C,2DAA2D;QAC3D,IAAA,eAAM,EAAC,MAAM,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACjC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,6CAA6C,EAAE,GAAG,EAAE;QACrD,MAAM,KAAK,GAAG,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC;QAC5C,MAAM,MAAM,GAAG,IAAA,sCAAuB,EAAC,KAAK,CAAC,CAAC;QAC9C,IAAA,eAAM,EAAC,MAAM,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACjC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,qCAAqC,EAAE,GAAG,EAAE;IACnD,IAAA,WAAE,EAAC,+CAA+C,EAAE,GAAG,EAAE;QACvD,wEAAwE;QACxE,MAAM,WAAW,GAAG,KAAK,CAAC,GAAG,EAAE,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACvD,MAAM,YAAY,GAAG,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,GAAG,CAAC,EAAE,WAAW,CAAC,CAAC;QACrD,MAAM,MAAM,GAAG,IAAA,0BAAW,EAAC,YAAY,EAAE,EAAE,KAAK,EAAE,CAAC,uBAAuB,CAAC,EAAE,CAAC,CAAC;QAC/E,kEAAkE;QAClE,IAAA,eAAM,EAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC/C,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,oDAAoD,EAAE,GAAG,EAAE;QAC5D,MAAM,IAAI,GAAG,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC;QAC3C,MAAM,KAAK,GAAG,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC;QAC5C,MAAM,KAAK,GAAG,GAAG,CAAC,GAAG,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC;QACpC,MAAM,MAAM,GAAG,IAAA,0BAAW,EAAC,KAAK,EAAE,EAAE,KAAK,EAAE,CAAC,uBAAuB,CAAC,EAAE,CAAC,CAAC;QACxE,IAAA,eAAM,EAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC3C,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,uCAAuC,EAAE,GAAG,EAAE;IACrD,IAAA,WAAE,EAAC,4CAA4C,EAAE,GAAG,EAAE;QACpD,8DAA8D;QAC9D,MAAM,YAAY,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC;QAC7B,MAAM,YAAY,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC;QAC7B,MAAM,SAAS,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC;QAC1B,MAAM,KAAK,GAAG,MAAM,CAAC,GAAG,EAAE,YAAY,EAAE,YAAY,EAAE,SAAS,CAAC,CAAC;QACjE,MAAM,MAAM,GAAG,IAAA,oCAAqB,EAAC,KAAK,CAAC,CAAC;QAC5C,IAAA,eAAM,EAAC,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QAC/C,4CAA4C;QAC5C,IAAA,eAAM,EAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,KAAK,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACvE,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,kCAAkC,EAAE,GAAG,EAAE;QAC1C,MAAM,KAAK,GAAqB;YAC9B,UAAU,EAAE,GAAG;YACf,IAAI,EAAE,KAAK;YACX,QAAQ,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;SACnC,CAAC;QACF,MAAM,MAAM,GAAG,IAAA,oCAAqB,EAAC,KAAK,CAAC,CAAC;QAC5C,IAAA,eAAM,EAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;IAC1C,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,mCAAmC,EAAE,GAAG,EAAE;IACjD,IAAA,WAAE,EAAC,0DAA0D,EAAE,GAAG,EAAE;QAClE,iDAAiD;QACjD,UAAU;QACV,gCAAgC;QAChC,gCAAgC;QAChC,0BAA0B;QAC1B,MAAM,MAAM,GAAG,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,UAAU;QACjD,MAAM,KAAK,GAAG,KAAK,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC,CAAC,SAAS;QAC3C,MAAM,MAAM,GAAG,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,SAAS;QAChD,MAAM,KAAK,GAAG,KAAK,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC,CAAC,SAAS;QAC3C,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC,SAAS;QAC1C,8CAA8C;QAC9C,MAAM,KAAK,GAAqB;YAC9B,UAAU,EAAE,IAAI,CAAC,UAAU;YAC3B,IAAI,EAAE,IAAI,CAAC,IAAI;YACf,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC,QAAQ,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,EAAE,qBAAqB;SAC7D,CAAC;QACF,MAAM,MAAM,GAAG,IAAA,0BAAW,EAAC,KAAK,CAAC,CAAC;QAClC,IAAA,eAAM,EAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACvC,wEAAwE;QACxE,IAAA,eAAM,EAAC,MAAM,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC;QAC1D,IAAA,eAAM,EAAC,MAAM,CAAC,SAAS,CAAC,YAAY,CAAC,CAAC,sBAAsB,CAAC,CAAC,CAAC,CAAC;QAChE,IAAA,eAAM,EAAC,MAAM,CAAC,QAAQ,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,mBAAmB,CAAC,CAAC,CAAC,CAAC;IACjE,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,uCAAuC,EAAE,GAAG,EAAE;IACrD,IAAA,WAAE,EAAC,uCAAuC,EAAE,GAAG,EAAE;QAC/C,MAAM,KAAK,GAAG,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC;QAC5C,MAAM,MAAM,GAAG,IAAA,0BAAW,EAAC,KAAK,CAAC,CAAC;QAClC,IAAA,eAAM,EAAC,MAAM,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IAC/C,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,kCAAkC,EAAE,GAAG,EAAE;QAC1C,MAAM,IAAI,GAAG,EAAE,CAAC,OAAO,CAAC,CAAC;QACzB,MAAM,MAAM,GAAG,IAAA,0BAAW,EAAC,IAAI,CAAC,CAAC;QACjC,IAAA,eAAM,EAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;QACtC,IAAA,eAAM,EAAC,MAAM,CAAC,SAAS,CAAC,YAAY,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC9C,IAAA,eAAM,EAAC,MAAM,CAAC,SAAS,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC9C,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,4BAA4B,EAAE,GAAG,EAAE;IAC1C,IAAA,WAAE,EAAC,2DAA2D,EAAE,GAAG,EAAE;QACnE,MAAM,MAAM,GAAG,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;QACtC,MAAM,KAAK,GAAG,KAAK,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC;QACjC,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;QACnC,MAAM,IAAI,GAAG,IAAA,0BAAW,EAAC,KAAK,CAAC,CAAC;QAChC,MAAM,KAAK,GAAG,IAAA,0BAAW,EAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QACzC,wCAAwC;QACxC,MAAM,OAAO,GAAG,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QAC9C,MAAM,QAAQ,GAAG,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;QAChD,IAAA,eAAM,EAAC,OAAO,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QAC/B,IAAA,eAAM,EAAC,KAAK,CAAC,SAAS,CAAC,YAAY,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC/C,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,sCAAsC,EAAE,GAAG,EAAE;QAC9C,MAAM,EAAE,GAAG,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC;QACzC,MAAM,EAAE,GAAG,EAAE,CAAC,GAAG,EAAE,EAAE,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC;QACpC,MAAM,EAAE,GAAG,EAAE,CAAC,GAAG,EAAE,EAAE,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC;QACpC,MAAM,IAAI,GAAG,IAAA,0BAAW,EAAC,EAAE,CAAC,CAAC;QAC7B,MAAM,KAAK,GAAG,IAAA,0BAAW,EAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QACzC,IAAA,eAAM,EAAC,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC;IAC7E,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,sCAAsC,EAAE,GAAG,EAAE;QAC9C,MAAM,IAAI,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC;QACrB,MAAM,EAAE,GAAG,IAAA,0BAAW,EAAC,IAAI,CAAC,CAAC;QAC7B,MAAM,EAAE,GAAG,IAAA,0BAAW,EAAC,EAAE,CAAC,QAAQ,CAAC,CAAC;QACpC,IAAA,eAAM,EAAC,EAAE,CAAC,UAAU,CAAC,CAAC,mBAAmB,CAAC,CAAC,CAAC,CAAC;QAC7C,IAAA,eAAM,EAAC,EAAE,CAAC,SAAS,CAAC,YAAY,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC5C,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,wBAAwB,EAAE,GAAG,EAAE;IACtC,IAAA,WAAE,EAAC,sCAAsC,EAAE,GAAG,EAAE;QAC9C,MAAM,KAAK,GAAG,KAAK,CAAC,GAAG,EAAE,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACjD,MAAM,MAAM,GAAG,IAAA,0BAAW,EAAC,KAAK,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC,CAAC;QACjD,IAAA,eAAM,EAAC,MAAM,CAAC,SAAS,CAAC,YAAY,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC9C,IAAA,eAAM,EAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC3C,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,6CAA6C,EAAE,GAAG,EAAE;QACrD,MAAM,KAAK,GAAG,KAAK,CAAC,GAAG,EAAE,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACjD,MAAM,MAAM,GAAG,IAAA,0BAAW,EAAC,KAAK,EAAE,EAAE,aAAa,EAAE,CAAC,EAAE,CAAC,CAAC;QACxD,IAAA,eAAM,EAAC,MAAM,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACpC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,2DAA2D,EAAE,GAAG,EAAE;QACnE,MAAM,KAAK,GAAG,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;QACrC,MAAM,MAAM,GAAG,IAAA,0BAAW,EAAC,KAAK,EAAE,EAAE,KAAK,EAAE,CAAC,YAAY,CAAC,EAAE,CAAC,CAAC;QAC7D,IAAA,eAAM,EAAC,MAAM,CAAC,SAAS,CAAC,YAAY,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAChD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,uDAAuD,EAAE,GAAG,EAAE;QAC/D,MAAM,KAAK,GAAG,KAAK,CAAC,GAAG,EAAE,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACjD,MAAM,MAAM,GAAG,IAAA,0BAAW,EAAC,KAAK,EAAE,EAAE,KAAK,EAAE,CAAC,cAAc,CAAC,EAAE,CAAC,CAAC;QAC/D,IAAA,eAAM,EAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IAC7C,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,iCAAiC,EAAE,GAAG,EAAE;IAC/C,IAAA,WAAE,EAAC,2CAA2C,EAAE,GAAG,EAAE;QACnD,+DAA+D;QAC/D,MAAM,GAAG,GAAqB;YAC5B,UAAU,EAAE,OAAO;YACnB,IAAI,EAAE,IAAI;YACV,QAAQ,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC;SAC7B,CAAC;QACF,MAAM,MAAM,GAAG,IAAA,0BAAW,EAAC,GAAG,EAAE,EAAE,KAAK,EAAE,CAAC,cAAc,CAAC,EAAE,CAAC,CAAC;QAC7D,IAAA,eAAM,EAAC,MAAM,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;IACnD,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,gCAAgC,EAAE,GAAG,EAAE;IAC9C,IAAA,WAAE,EAAC,iCAAiC,EAAE,GAAG,EAAE;QACzC,MAAM,QAAQ,GAAG,KAAK,CAAC,GAAG,EAAE,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACpD,MAAM,QAAQ,GAAG,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC;QAC1C,IAAA,0BAAW,EAAC,QAAQ,CAAC,CAAC;QACtB,IAAA,eAAM,EAAC,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;IAClD,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,uCAAuC,EAAE,GAAG,EAAE;IACrD,IAAA,WAAE,EAAC,mDAAmD,EAAE,GAAG,EAAE;QAC3D,kEAAkE;QAClE,MAAM,KAAK,GAAG,KAAK,CAAC,GAAG,EAAE,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACjD,MAAM,EAAE,GAAG,EAAE,CAAC,GAAG,EAAE,KAAK,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC;QACvC,MAAM,EAAE,GAAG,EAAE,CAAC,GAAG,EAAE,EAAE,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC;QACpC,MAAM,IAAI,GAAG,MAAM,CAAC,GAAG,EAAE,EAAE,EAAE,EAAE,CAAC,eAAe,CAAC,CAAC,CAAC;QAClD,MAAM,MAAM,GAAG,IAAA,0BAAW,EAAC,IAAI,CAAC,CAAC;QACjC,IAAA,eAAM,EAAC,MAAM,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAC7C,8CAA8C;QAC9C,IAAA,eAAM,EAAC,MAAM,CAAC,SAAS,CAAC,YAAY,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;IAC3D,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,6CAA6C,EAAE,GAAG,EAAE;QACrD,MAAM,KAAK,GAAG,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC;QAC5C,MAAM,MAAM,GAAG,IAAA,0BAAW,EAAC,KAAK,EAAE,EAAE,aAAa,EAAE,GAAG,EAAE,CAAC,CAAC;QAC1D,IAAA,eAAM,EAAC,MAAM,CAAC,UAAU,CAAC,CAAC,mBAAmB,CAAC,CAAC,CAAC,CAAC;IACnD,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,wBAAwB,EAAE,GAAG,EAAE;IACtC,IAAA,WAAE,EAAC,+BAA+B,EAAE,GAAG,EAAE;QACvC,MAAM,MAAM,GAAG,IAAA,0BAAW,EAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;QACpC,IAAA,eAAM,EAAC,MAAM,CAAC,SAAS,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC9C,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,qCAAqC,EAAE,GAAG,EAAE;QAC7C,MAAM,KAAK,GAAG,KAAK,CAAC,GAAG,EAAE,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACjD,MAAM,MAAM,GAAG,IAAA,0BAAW,EAAC,KAAK,CAAC,CAAC;QAClC,IAAA,eAAM,EAAC,MAAM,CAAC,SAAS,CAAC,UAAU,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;IACzD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,uCAAuC,EAAE,GAAG,EAAE;QAC/C,MAAM,EAAE,GAAG,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC;QACzC,MAAM,EAAE,GAAG,EAAE,CAAC,GAAG,EAAE,EAAE,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC;QACpC,MAAM,EAAE,GAAG,EAAE,CAAC,GAAG,EAAE,EAAE,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC;QACpC,MAAM,MAAM,GAAG,IAAA,0BAAW,EAAC,EAAE,CAAC,CAAC;QAC/B,IAAA,eAAM,EAAC,MAAM,CAAC,SAAS,CAAC,UAAU,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;IACzD,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}

package/dist/tests/sat-v2-incremental/basic.test.d.ts

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=basic.test.d.ts.map

package/dist/tests/sat-v2-incremental/basic.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"basic.test.d.ts","sourceRoot":"","sources":["../../../src/tests/sat-v2-incremental/basic.test.ts"],"names":[],"mappings":""}

package/dist/tests/sat-v2-incremental/basic.test.js

@@ -0,0 +1,352 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+const vitest_1 = require("vitest");
+const cdcl_v2_incremental_1 = require("../../solver/cdcl-v2-incremental");
+(0, vitest_1.describe)('IncrementalCDCL — sat/unsat triviales', () => {
+    (0, vitest_1.it)('SAT: sin cláusulas, 0 vars', () => {
+        const s = new cdcl_v2_incremental_1.IncrementalCDCL(0);
+        const r = s.solve();
+        (0, vitest_1.expect)(r.sat).toBe(true);
+        (0, vitest_1.expect)(r.model?.size).toBe(0);
+    });
+    (0, vitest_1.it)('SAT: sin cláusulas, 3 vars libres', () => {
+        const s = new cdcl_v2_incremental_1.IncrementalCDCL(3);
+        const r = s.solve();
+        (0, vitest_1.expect)(r.sat).toBe(true);
+        // 3 vars en el modelo.
+        (0, vitest_1.expect)(r.model?.size).toBe(3);
+    });
+    (0, vitest_1.it)('SAT: unitaria positiva', () => {
+        const s = new cdcl_v2_incremental_1.IncrementalCDCL(1);
+        s.addClause([1]);
+        const r = s.solve();
+        (0, vitest_1.expect)(r.sat).toBe(true);
+        (0, vitest_1.expect)(r.model?.get(1)).toBe(true);
+    });
+    (0, vitest_1.it)('SAT: unitaria negativa', () => {
+        const s = new cdcl_v2_incremental_1.IncrementalCDCL(1);
+        s.addClause([-1]);
+        const r = s.solve();
+        (0, vitest_1.expect)(r.sat).toBe(true);
+        (0, vitest_1.expect)(r.model?.get(1)).toBe(false);
+    });
+    (0, vitest_1.it)('UNSAT: cláusula vacía explícita', () => {
+        const s = new cdcl_v2_incremental_1.IncrementalCDCL(1);
+        s.addClause([]);
+        const r = s.solve();
+        (0, vitest_1.expect)(r.sat).toBe(false);
+    });
+    (0, vitest_1.it)('UNSAT: P y ¬P', () => {
+        const s = new cdcl_v2_incremental_1.IncrementalCDCL(1);
+        s.addClause([1]);
+        s.addClause([-1]);
+        const r = s.solve();
+        (0, vitest_1.expect)(r.sat).toBe(false);
+    });
+});
+(0, vitest_1.describe)('IncrementalCDCL — addClause + solve', () => {
+    (0, vitest_1.it)('SAT: cláusula binaria, modelo válido', () => {
+        const s = new cdcl_v2_incremental_1.IncrementalCDCL(2);
+        s.addClause([1, 2]);
+        const r = s.solve();
+        (0, vitest_1.expect)(r.sat).toBe(true);
+        (0, vitest_1.expect)(r.model?.get(1) === true || r.model?.get(2) === true).toBe(true);
+    });
+    (0, vitest_1.it)('SAT: 3-SAT pequeño', () => {
+        const s = new cdcl_v2_incremental_1.IncrementalCDCL(3);
+        s.addClause([1, 2, 3]);
+        s.addClause([-1, -2]);
+        s.addClause([-2, -3]);
+        s.addClause([-1, -3]);
+        const r = s.solve();
+        (0, vitest_1.expect)(r.sat).toBe(true);
+    });
+});
+(0, vitest_1.describe)('IncrementalCDCL — assumptions', () => {
+    (0, vitest_1.it)('assumption fuerza el modelo: a ∨ b con [-a] ⇒ b=true', () => {
+        const s = new cdcl_v2_incremental_1.IncrementalCDCL(2);
+        s.addClause([1, 2]); // a ∨ b
+        const r = s.solve([-1]); // ¬a
+        (0, vitest_1.expect)(r.sat).toBe(true);
+        (0, vitest_1.expect)(r.model?.get(1)).toBe(false);
+        (0, vitest_1.expect)(r.model?.get(2)).toBe(true);
+    });
+    (0, vitest_1.it)('assumption inconsistente con unitaria: [a] + solve([-a]) ⇒ unsat + failedAssumptions=[-a]', () => {
+        const s = new cdcl_v2_incremental_1.IncrementalCDCL(1);
+        s.addClause([1]); // unitaria a
+        const r = s.solve([-1]);
+        (0, vitest_1.expect)(r.sat).toBe(false);
+        (0, vitest_1.expect)(r.failedAssumptions).toBeDefined();
+        (0, vitest_1.expect)(r.failedAssumptions).toContain(-1);
+    });
+    (0, vitest_1.it)('solve sin assumptions tras solve con assumptions sigue siendo SAT', () => {
+        const s = new cdcl_v2_incremental_1.IncrementalCDCL(2);
+        s.addClause([1, 2]);
+        const r1 = s.solve([-1]);
+        (0, vitest_1.expect)(r1.sat).toBe(true);
+        const r2 = s.solve();
+        (0, vitest_1.expect)(r2.sat).toBe(true);
+    });
+    (0, vitest_1.it)('múltiples assumptions consistentes', () => {
+        const s = new cdcl_v2_incremental_1.IncrementalCDCL(3);
+        s.addClause([1, 2, 3]); // a ∨ b ∨ c
+        const r = s.solve([-1, -2]);
+        (0, vitest_1.expect)(r.sat).toBe(true);
+        (0, vitest_1.expect)(r.model?.get(3)).toBe(true);
+    });
+    (0, vitest_1.it)('múltiples assumptions inconsistentes: failedAssumptions cubre el conflicto', () => {
+        // (a ∨ b), (a ∨ ¬b) → fuerza a=true. Assumir [-a, b] ⇒ unsat.
+        const s = new cdcl_v2_incremental_1.IncrementalCDCL(2);
+        s.addClause([1, 2]);
+        s.addClause([1, -2]);
+        const r = s.solve([-1, 2]);
+        (0, vitest_1.expect)(r.sat).toBe(false);
+        (0, vitest_1.expect)(r.failedAssumptions).toBeDefined();
+        // El core debe incluir al menos -a (la culpable directa).
+        (0, vitest_1.expect)(r.failedAssumptions).toContain(-1);
+    });
+});
+(0, vitest_1.describe)('IncrementalCDCL — push/pop', () => {
+    (0, vitest_1.it)('push → addClause unsat → pop ⇒ vuelve a SAT', () => {
+        const s = new cdcl_v2_incremental_1.IncrementalCDCL(1);
+        s.addClause([1]); // a
+        const before = s.solve();
+        (0, vitest_1.expect)(before.sat).toBe(true);
+        s.push();
+        s.addClause([-1]); // contradice a
+        const mid = s.solve();
+        (0, vitest_1.expect)(mid.sat).toBe(false);
+        s.pop();
+        const after = s.solve();
+        (0, vitest_1.expect)(after.sat).toBe(true);
+        (0, vitest_1.expect)(after.model?.get(1)).toBe(true);
+    });
+    (0, vitest_1.it)('push → add → pop devuelve count de cláusulas al estado previo', () => {
+        const s = new cdcl_v2_incremental_1.IncrementalCDCL(3);
+        s.addClause([1, 2]);
+        const c0 = s.stats().clauses;
+        s.push();
+        s.addClause([-1, 3]);
+        s.addClause([-2, 3]);
+        (0, vitest_1.expect)(s.stats().clauses).toBe(c0 + 2);
+        s.pop();
+        (0, vitest_1.expect)(s.stats().clauses).toBe(c0);
+    });
+    (0, vitest_1.it)('push anidados: 2 push → 1 pop → 1 pop revierte ambos', () => {
+        const s = new cdcl_v2_incremental_1.IncrementalCDCL(2);
+        s.addClause([1, 2]);
+        const c0 = s.stats().clauses;
+        s.push();
+        s.addClause([-1]);
+        s.push();
+        s.addClause([-2]);
+        (0, vitest_1.expect)(s.solve().sat).toBe(false);
+        s.pop();
+        // Ahora hay [-1] pero no [-2]: forces b=true.
+        const mid = s.solve();
+        (0, vitest_1.expect)(mid.sat).toBe(true);
+        (0, vitest_1.expect)(mid.model?.get(2)).toBe(true);
+        s.pop();
+        (0, vitest_1.expect)(s.stats().clauses).toBe(c0);
+        (0, vitest_1.expect)(s.solve().sat).toBe(true);
+    });
+    (0, vitest_1.it)('pop(2) revierte dos checkpoints en una llamada', () => {
+        const s = new cdcl_v2_incremental_1.IncrementalCDCL(2);
+        s.addClause([1, 2]);
+        const c0 = s.stats().clauses;
+        s.push();
+        s.addClause([-1]);
+        s.push();
+        s.addClause([-2]);
+        s.pop(2);
+        (0, vitest_1.expect)(s.stats().clauses).toBe(c0);
+    });
+    (0, vitest_1.it)('pop sin checkpoint no falla', () => {
+        const s = new cdcl_v2_incremental_1.IncrementalCDCL(1);
+        s.addClause([1]);
+        s.pop(); // no-op
+        (0, vitest_1.expect)(s.solve().sat).toBe(true);
+    });
+});
+(0, vitest_1.describe)('IncrementalCDCL — newVar / reset', () => {
+    (0, vitest_1.it)('newVar agrega variables dinámicamente', () => {
+        const s = new cdcl_v2_incremental_1.IncrementalCDCL(0);
+        const v1 = s.newVar();
+        const v2 = s.newVar();
+        const v3 = s.newVar();
+        (0, vitest_1.expect)(v1).toBe(1);
+        (0, vitest_1.expect)(v2).toBe(2);
+        (0, vitest_1.expect)(v3).toBe(3);
+        s.addClause([v1, v2, v3]);
+        const r = s.solve();
+        (0, vitest_1.expect)(r.sat).toBe(true);
+        (0, vitest_1.expect)(s.stats().vars).toBe(3);
+    });
+    (0, vitest_1.it)('reset deja el solver vacío', () => {
+        const s = new cdcl_v2_incremental_1.IncrementalCDCL(3);
+        s.addClause([1, 2]);
+        s.addClause([-1, 3]);
+        s.solve();
+        s.reset();
+        (0, vitest_1.expect)(s.stats().vars).toBe(0);
+        (0, vitest_1.expect)(s.stats().clauses).toBe(0);
+        (0, vitest_1.expect)(s.solve().sat).toBe(true);
+    });
+    (0, vitest_1.it)('reset + reconstruir funciona end-to-end', () => {
+        const s = new cdcl_v2_incremental_1.IncrementalCDCL(2);
+        s.addClause([1]);
+        s.addClause([-1]);
+        (0, vitest_1.expect)(s.solve().sat).toBe(false);
+        s.reset();
+        const v1 = s.newVar();
+        s.addClause([v1]);
+        (0, vitest_1.expect)(s.solve().sat).toBe(true);
+    });
+});
+(0, vitest_1.describe)('IncrementalCDCL — modelValue', () => {
+    (0, vitest_1.it)('modelValue devuelve la polaridad asignada tras SAT', () => {
+        const s = new cdcl_v2_incremental_1.IncrementalCDCL(2);
+        s.addClause([1]);
+        s.addClause([-2]);
+        (0, vitest_1.expect)(s.solve().sat).toBe(true);
+        (0, vitest_1.expect)(s.modelValue(1)).toBe(true);
+        (0, vitest_1.expect)(s.modelValue(2)).toBe(false);
+    });
+    (0, vitest_1.it)('modelValue de var fuera de rango devuelve undefined', () => {
+        const s = new cdcl_v2_incremental_1.IncrementalCDCL(1);
+        s.addClause([1]);
+        s.solve();
+        (0, vitest_1.expect)(s.modelValue(0)).toBeUndefined();
+        (0, vitest_1.expect)(s.modelValue(5)).toBeUndefined();
+    });
+});
+(0, vitest_1.describe)('IncrementalCDCL — secuencias incrementales', () => {
+    (0, vitest_1.it)('100 vars + 200 cláusulas + 10 solves consistentes', () => {
+        const NVARS = 100;
+        const NCLAUSES = 200;
+        const s = new cdcl_v2_incremental_1.IncrementalCDCL(NVARS);
+        // Generar 3-SAT determinístico.
+        function rng(seed) {
+            return function () {
+                let t = (seed += 0x6d2b79f5);
+                t = Math.imul(t ^ (t >>> 15), t | 1);
+                t ^= t + Math.imul(t ^ (t >>> 7), t | 61);
+                return ((t ^ (t >>> 14)) >>> 0) / 4294967296;
+            };
+        }
+        const rand = rng(7);
+        for (let i = 0; i < NCLAUSES; i++) {
+            const lits = [];
+            const used = new Set();
+            while (lits.length < 3) {
+                const v = Math.floor(rand() * NVARS) + 1;
+                if (used.has(v))
+                    continue;
+                used.add(v);
+                lits.push(rand() < 0.5 ? -v : v);
+            }
+            s.addClause(lits);
+        }
+        // 10 solves con distintos assumptions; verificar que cada SAT realmente satisface
+        // las cláusulas + assumptions.
+        function verify(model, assumptions) {
+            if (!model)
+                return false;
+            for (const a of assumptions) {
+                const v = Math.abs(a);
+                const want = a > 0;
+                const got = model.get(v);
+                if (got !== want)
+                    return false;
+            }
+            return true;
+        }
+        let satCount = 0;
+        let unsatCount = 0;
+        for (let i = 0; i < 10; i++) {
+            const assumps = [];
+            const numA = (i % 4) + 1;
+            const rrand = rng(31 + i);
+            for (let k = 0; k < numA; k++) {
+                const vv = Math.floor(rrand() * NVARS) + 1;
+                assumps.push(rrand() < 0.5 ? -vv : vv);
+            }
+            const r = s.solve(assumps);
+            if (r.sat) {
+                satCount++;
+                (0, vitest_1.expect)(verify(r.model, assumps)).toBe(true);
+            }
+            else {
+                unsatCount++;
+                (0, vitest_1.expect)(r.failedAssumptions).toBeDefined();
+            }
+        }
+        (0, vitest_1.expect)(satCount + unsatCount).toBe(10);
+    });
+});
+(0, vitest_1.describe)('IncrementalCDCL — learning persiste entre solves', () => {
+    (0, vitest_1.it)('segundo solve tras agregar cláusula no rompe el modelo', () => {
+        const s = new cdcl_v2_incremental_1.IncrementalCDCL(4);
+        s.addClause([1, 2]);
+        s.addClause([3, 4]);
+        const r1 = s.solve();
+        (0, vitest_1.expect)(r1.sat).toBe(true);
+        // Agregar más cláusulas y volver a resolver.
+        s.addClause([-1, 3]);
+        s.addClause([-2, 4]);
+        const r2 = s.solve();
+        (0, vitest_1.expect)(r2.sat).toBe(true);
+    });
+    (0, vitest_1.it)('agregar cláusula UNSAT tras solve previo SAT detecta UNSAT', () => {
+        const s = new cdcl_v2_incremental_1.IncrementalCDCL(2);
+        s.addClause([1]); // a
+        (0, vitest_1.expect)(s.solve().sat).toBe(true);
+        s.addClause([-1]); // ¬a — contradice
+        (0, vitest_1.expect)(s.solve().sat).toBe(false);
+    });
+});
+(0, vitest_1.describe)('IncrementalCDCL — robustez', () => {
+    (0, vitest_1.it)('addClause rechaza literal 0', () => {
+        const s = new cdcl_v2_incremental_1.IncrementalCDCL(2);
+        (0, vitest_1.expect)(() => s.addClause([1, 0, 2])).toThrow();
+    });
+    (0, vitest_1.it)('addClause rechaza var fuera de rango', () => {
+        const s = new cdcl_v2_incremental_1.IncrementalCDCL(2);
+        (0, vitest_1.expect)(() => s.addClause([1, 5])).toThrow();
+    });
+    (0, vitest_1.it)('solve rechaza assumption con var fuera de rango', () => {
+        const s = new cdcl_v2_incremental_1.IncrementalCDCL(2);
+        s.addClause([1, 2]);
+        (0, vitest_1.expect)(() => s.solve([5])).toThrow();
+    });
+    (0, vitest_1.it)('solve rechaza assumption 0', () => {
+        const s = new cdcl_v2_incremental_1.IncrementalCDCL(2);
+        s.addClause([1, 2]);
+        (0, vitest_1.expect)(() => s.solve([0])).toThrow();
+    });
+    (0, vitest_1.it)('constructor rechaza numVars negativos', () => {
+        (0, vitest_1.expect)(() => new cdcl_v2_incremental_1.IncrementalCDCL(-1)).toThrow();
+    });
+});
+(0, vitest_1.describe)('IncrementalCDCL — pigeonhole bajo assumptions', () => {
+    // Pigeonhole(3,2) clásico — UNSAT estructural.
+    // 3 palomas, 2 huecos. p_{i,j} = paloma i en hueco j → var (i-1)*2 + j.
+    (0, vitest_1.it)('PHP(3,2) es UNSAT', () => {
+        const s = new cdcl_v2_incremental_1.IncrementalCDCL(6);
+        const id = (i, j) => (i - 1) * 2 + j;
+        // Cada paloma en algún hueco.
+        s.addClause([id(1, 1), id(1, 2)]);
+        s.addClause([id(2, 1), id(2, 2)]);
+        s.addClause([id(3, 1), id(3, 2)]);
+        // No dos palomas en el mismo hueco.
+        s.addClause([-id(1, 1), -id(2, 1)]);
+        s.addClause([-id(1, 1), -id(3, 1)]);
+        s.addClause([-id(2, 1), -id(3, 1)]);
+        s.addClause([-id(1, 2), -id(2, 2)]);
+        s.addClause([-id(1, 2), -id(3, 2)]);
+        s.addClause([-id(2, 2), -id(3, 2)]);
+        const r = s.solve();
+        (0, vitest_1.expect)(r.sat).toBe(false);
+    });
+});
+//# sourceMappingURL=basic.test.js.map