@stevenvo780/st-lang 4.4.0 → 4.5.0

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

@@ -0,0 +1,263 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+const vitest_1 = require("vitest");
+const proof_nets_1 = require("../../proof-nets");
+(0, vitest_1.describe)('Proof Nets / fórmulas y dualidad', () => {
+    (0, vitest_1.it)('dualidad es involutiva sobre átomos', () => {
+        const A = (0, proof_nets_1.atomPos)('A');
+        (0, vitest_1.expect)((0, proof_nets_1.formulaEquals)((0, proof_nets_1.dual)((0, proof_nets_1.dual)(A)), A)).toBe(true);
+    });
+    (0, vitest_1.it)('De Morgan: (A ⊗ B)⊥ = A⊥ ⅋ B⊥', () => {
+        const A = (0, proof_nets_1.atomPos)('A');
+        const B = (0, proof_nets_1.atomPos)('B');
+        const lhs = (0, proof_nets_1.dual)((0, proof_nets_1.tensor)(A, B));
+        const rhs = (0, proof_nets_1.par)((0, proof_nets_1.dual)(A), (0, proof_nets_1.dual)(B));
+        (0, vitest_1.expect)((0, proof_nets_1.formulaEquals)(lhs, rhs)).toBe(true);
+    });
+    (0, vitest_1.it)('formulaToString muestra ⊥ en átomos negativos', () => {
+        (0, vitest_1.expect)((0, proof_nets_1.formulaToString)((0, proof_nets_1.atomNeg)('A'))).toBe('A⊥');
+        (0, vitest_1.expect)((0, proof_nets_1.formulaToString)((0, proof_nets_1.tensor)((0, proof_nets_1.atomPos)('A'), (0, proof_nets_1.atomNeg)('B')))).toBe('(A ⊗ B⊥)');
+        (0, vitest_1.expect)((0, proof_nets_1.formulaToString)((0, proof_nets_1.par)((0, proof_nets_1.atomPos)('A'), (0, proof_nets_1.atomNeg)('B')))).toBe('(A ⅋ B⊥)');
+    });
+});
+(0, vitest_1.describe)('Proof Nets / construcción y corrección Danos-Regnier', () => {
+    (0, vitest_1.it)('axiom link A, A⊥ es correcto', () => {
+        const net = (0, proof_nets_1.constructFromSequent)([(0, proof_nets_1.atomPos)('A'), (0, proof_nets_1.atomNeg)('A')]);
+        (0, vitest_1.expect)(net.nodes).toHaveLength(2);
+        (0, vitest_1.expect)(net.links).toHaveLength(1);
+        (0, vitest_1.expect)(net.links[0].kind).toBe('axiom');
+        (0, vitest_1.expect)((0, proof_nets_1.isCorrect)(net)).toBe(true);
+    });
+    (0, vitest_1.it)('secuente ⊢ A⊥, A (orden invertido) sigue siendo correcto', () => {
+        const net = (0, proof_nets_1.constructFromSequent)([(0, proof_nets_1.atomNeg)('A'), (0, proof_nets_1.atomPos)('A')]);
+        (0, vitest_1.expect)((0, proof_nets_1.isCorrect)(net)).toBe(true);
+    });
+    (0, vitest_1.it)('⊢ A⊥, B⊥, A ⊗ B es correcto (intro de tensor)', () => {
+        const net = (0, proof_nets_1.constructFromSequent)([
+            (0, proof_nets_1.atomNeg)('A'),
+            (0, proof_nets_1.atomNeg)('B'),
+            (0, proof_nets_1.tensor)((0, proof_nets_1.atomPos)('A'), (0, proof_nets_1.atomPos)('B')),
+        ]);
+        (0, vitest_1.expect)(net.links.some((l) => l.kind === 'tensor')).toBe(true);
+        (0, vitest_1.expect)(net.links.filter((l) => l.kind === 'axiom')).toHaveLength(2);
+        (0, vitest_1.expect)((0, proof_nets_1.isCorrect)(net)).toBe(true);
+    });
+    (0, vitest_1.it)('⊢ A⊥ ⅋ B⊥, A ⊗ B es correcto (forma normal)', () => {
+        const net = (0, proof_nets_1.constructFromSequent)([
+            (0, proof_nets_1.par)((0, proof_nets_1.atomNeg)('A'), (0, proof_nets_1.atomNeg)('B')),
+            (0, proof_nets_1.tensor)((0, proof_nets_1.atomPos)('A'), (0, proof_nets_1.atomPos)('B')),
+        ]);
+        (0, vitest_1.expect)(net.links.some((l) => l.kind === 'tensor')).toBe(true);
+        (0, vitest_1.expect)(net.links.some((l) => l.kind === 'par')).toBe(true);
+        (0, vitest_1.expect)((0, proof_nets_1.isCorrect)(net)).toBe(true);
+    });
+    (0, vitest_1.it)('⊢ A, A⊥ ⅋ B, B⊥ NO es correcto: ⊢ A, A⊥, B, B⊥ no es probable en MLL puro (sin mix)', () => {
+        // Aunque ingenuamente uno emparejaría (A,A⊥) y (B,B⊥), bajo el
+        // switching del ⅋ que descarta la premisa "interna" B, el átomo
+        // se queda sin conexión con el resto del net. Esto refleja que
+        // MLL sin "mix" no prueba este secuente: las dos cadenas
+        // axioma-axioma viven en componentes desconexas.
+        const net = (0, proof_nets_1.constructFromSequent)([(0, proof_nets_1.atomPos)('A'), (0, proof_nets_1.par)((0, proof_nets_1.atomNeg)('A'), (0, proof_nets_1.atomPos)('B')), (0, proof_nets_1.atomNeg)('B')]);
+        (0, vitest_1.expect)((0, proof_nets_1.isCorrect)(net)).toBe(false);
+    });
+    (0, vitest_1.it)('⊢ (A ⊗ B), (A⊥ ⅋ B⊥) sí es correcto (De Morgan)', () => {
+        const net = (0, proof_nets_1.constructFromSequent)([
+            (0, proof_nets_1.tensor)((0, proof_nets_1.atomPos)('A'), (0, proof_nets_1.atomPos)('B')),
+            (0, proof_nets_1.par)((0, proof_nets_1.atomNeg)('A'), (0, proof_nets_1.atomNeg)('B')),
+        ]);
+        (0, vitest_1.expect)((0, proof_nets_1.isCorrect)(net)).toBe(true);
+    });
+    (0, vitest_1.it)('secuente vacío produce net trivialmente correcto', () => {
+        const net = (0, proof_nets_1.constructFromSequent)([]);
+        (0, vitest_1.expect)(net.nodes).toHaveLength(0);
+        (0, vitest_1.expect)(net.links).toHaveLength(0);
+        (0, vitest_1.expect)((0, proof_nets_1.isCorrect)(net)).toBe(true);
+    });
+    (0, vitest_1.it)('⊢ A solo (sin dual) NO es correcto: hay nodo aislado', () => {
+        const net = (0, proof_nets_1.constructFromSequent)([(0, proof_nets_1.atomPos)('A')]);
+        // No hay con quién emparejar => sin axiom link, componente
+        // desconexa de tamaño 1 sin aristas.
+        (0, vitest_1.expect)((0, proof_nets_1.isCorrect)(net)).toBe(false);
+    });
+    (0, vitest_1.it)('⊢ A ⊗ A⊥ NO es correcto: tensor con cut interno crearía ciclo', () => {
+        // Esta es la trampa clásica: con un solo átomo en cada lado del
+        // tensor no se puede cerrar el net respetando la conexidad bajo
+        // todos los switchings.
+        const net = (0, proof_nets_1.constructFromSequent)([(0, proof_nets_1.tensor)((0, proof_nets_1.atomPos)('A'), (0, proof_nets_1.atomNeg)('A'))]);
+        // Construye: dos hojas A, A⊥, un tensor link, y un axiom link
+        // entre A y A⊥. Bajo el único switching (no hay par) el grafo
+        // tiene un ciclo a—tensor—a⊥—axiom—a, así que es incorrecto.
+        (0, vitest_1.expect)((0, proof_nets_1.isCorrect)(net)).toBe(false);
+    });
+    (0, vitest_1.it)('⊢ A ⅋ A⊥ SÍ es correcto: par "abre" el ciclo bajo switching', () => {
+        const net = (0, proof_nets_1.constructFromSequent)([(0, proof_nets_1.par)((0, proof_nets_1.atomPos)('A'), (0, proof_nets_1.atomNeg)('A'))]);
+        (0, vitest_1.expect)((0, proof_nets_1.isCorrect)(net)).toBe(true);
+    });
+    (0, vitest_1.it)('net manualmente desconexo es rechazado', () => {
+        // Dos axiom links independientes y nada que los conecte.
+        const net = {
+            nodes: [
+                { id: 0, formula: (0, proof_nets_1.atomPos)('A') },
+                { id: 1, formula: (0, proof_nets_1.atomNeg)('A') },
+                { id: 2, formula: (0, proof_nets_1.atomPos)('B') },
+                { id: 3, formula: (0, proof_nets_1.atomNeg)('B') },
+            ],
+            links: [
+                { kind: 'axiom', ports: [0, 1] },
+                { kind: 'axiom', ports: [2, 3] },
+            ],
+            conclusions: [0, 1, 2, 3],
+        };
+        (0, vitest_1.expect)((0, proof_nets_1.isCorrect)(net)).toBe(false);
+    });
+    (0, vitest_1.it)('net con port inexistente es rechazado', () => {
+        const net = {
+            nodes: [{ id: 0, formula: (0, proof_nets_1.atomPos)('A') }],
+            links: [{ kind: 'axiom', ports: [0, 99] }],
+            conclusions: [0],
+        };
+        (0, vitest_1.expect)((0, proof_nets_1.isCorrect)(net)).toBe(false);
+    });
+    (0, vitest_1.it)('axiom entre fórmulas NO duales es rechazado', () => {
+        const net = {
+            nodes: [
+                { id: 0, formula: (0, proof_nets_1.atomPos)('A') },
+                { id: 1, formula: (0, proof_nets_1.atomPos)('B') },
+            ],
+            links: [{ kind: 'axiom', ports: [0, 1] }],
+            conclusions: [0, 1],
+        };
+        (0, vitest_1.expect)((0, proof_nets_1.isCorrect)(net)).toBe(false);
+    });
+});
+(0, vitest_1.describe)('Proof Nets / eliminación de cortes', () => {
+    (0, vitest_1.it)('axiom-cut: reduceCutStep simplifica un paso', () => {
+        // Net: axiom(0:A, 1:A⊥), cut(1:A⊥, 2:A), conclusion 2.
+        // El cut está entre `1` (premisa axiom) y `2` (átomo libre).
+        // Tras reducir esperamos un axiom(0, 2) y desaparición de `1`.
+        const net = {
+            nodes: [
+                { id: 0, formula: (0, proof_nets_1.atomPos)('A') },
+                { id: 1, formula: (0, proof_nets_1.atomNeg)('A') },
+                { id: 2, formula: (0, proof_nets_1.atomPos)('A') },
+            ],
+            links: [
+                { kind: 'axiom', ports: [0, 1] },
+                { kind: 'cut', ports: [1, 2] },
+            ],
+            conclusions: [0, 2],
+        };
+        (0, vitest_1.expect)((0, proof_nets_1.isCutFree)(net)).toBe(false);
+        const step = (0, proof_nets_1.reduceCutStep)(net);
+        (0, vitest_1.expect)(step.reduced).toBe(true);
+        (0, vitest_1.expect)((0, proof_nets_1.isCutFree)(step.net)).toBe(true);
+        (0, vitest_1.expect)(step.net.links).toHaveLength(1);
+        (0, vitest_1.expect)(step.net.links[0].kind).toBe('axiom');
+        (0, vitest_1.expect)(new Set(step.net.links[0].ports)).toEqual(new Set([0, 2]));
+        (0, vitest_1.expect)(step.net.nodes.find((n) => n.id === 1)).toBeUndefined();
+    });
+    (0, vitest_1.it)('mult-cut: tensor vs par reduce a dos cortes más pequeños', () => {
+        // Construimos manualmente:
+        //   nodos: a:A, b:B, a':A⊥, b':B⊥, t:A⊗B, p:A⊥⅋B⊥
+        //   links: tensor(a,b,t), par(a',b',p), cut(t,p)
+        const A = (0, proof_nets_1.atomPos)('A');
+        const Anot = (0, proof_nets_1.atomNeg)('A');
+        const B = (0, proof_nets_1.atomPos)('B');
+        const Bnot = (0, proof_nets_1.atomNeg)('B');
+        const net = {
+            nodes: [
+                { id: 0, formula: A },
+                { id: 1, formula: B },
+                { id: 2, formula: Anot },
+                { id: 3, formula: Bnot },
+                { id: 4, formula: (0, proof_nets_1.tensor)(A, B) },
+                { id: 5, formula: (0, proof_nets_1.par)(Anot, Bnot) },
+            ],
+            links: [
+                { kind: 'tensor', ports: [0, 1, 4] },
+                { kind: 'par', ports: [2, 3, 5] },
+                { kind: 'cut', ports: [4, 5] },
+            ],
+            conclusions: [],
+        };
+        const step = (0, proof_nets_1.reduceCutStep)(net);
+        (0, vitest_1.expect)(step.reduced).toBe(true);
+        const cuts = step.net.links.filter((l) => l.kind === 'cut');
+        (0, vitest_1.expect)(cuts).toHaveLength(2);
+        // Los dos cortes deben conectar átomos duales.
+        const cutPortSets = cuts.map((c) => new Set(c.ports));
+        (0, vitest_1.expect)(cutPortSets).toContainEqual(new Set([0, 2]));
+        (0, vitest_1.expect)(cutPortSets).toContainEqual(new Set([1, 3]));
+        // Tensor y par originales deben haber desaparecido.
+        (0, vitest_1.expect)(step.net.links.some((l) => l.kind === 'tensor')).toBe(false);
+        (0, vitest_1.expect)(step.net.links.some((l) => l.kind === 'par')).toBe(false);
+    });
+    (0, vitest_1.it)('normalizeCuts converge a un net cut-free', () => {
+        // Cadena: axiom(0,1) + axiom(2,3) + cut(1,2) reduce a axiom(0,3).
+        const net = {
+            nodes: [
+                { id: 0, formula: (0, proof_nets_1.atomPos)('A') },
+                { id: 1, formula: (0, proof_nets_1.atomNeg)('A') },
+                { id: 2, formula: (0, proof_nets_1.atomPos)('A') },
+                { id: 3, formula: (0, proof_nets_1.atomNeg)('A') },
+            ],
+            links: [
+                { kind: 'axiom', ports: [0, 1] },
+                { kind: 'axiom', ports: [2, 3] },
+                { kind: 'cut', ports: [1, 2] },
+            ],
+            conclusions: [0, 3],
+        };
+        const norm = (0, proof_nets_1.normalizeCuts)(net);
+        (0, vitest_1.expect)((0, proof_nets_1.isCutFree)(norm)).toBe(true);
+        // Algún axiom debería terminar conectando 0 con 3 (mod nodos
+        // intermedios reabsorbidos en una segunda pasada de axiom-cut).
+        (0, vitest_1.expect)(norm.links.length).toBeGreaterThanOrEqual(1);
+    });
+    (0, vitest_1.it)('reduceCut sobre net sin cortes es idempotente', () => {
+        const net = (0, proof_nets_1.constructFromSequent)([(0, proof_nets_1.atomPos)('A'), (0, proof_nets_1.atomNeg)('A')]);
+        (0, vitest_1.expect)((0, proof_nets_1.isCutFree)(net)).toBe(true);
+        const step = (0, proof_nets_1.reduceCutStep)(net);
+        (0, vitest_1.expect)(step.reduced).toBe(false);
+        (0, vitest_1.expect)(step.net).toBe(net);
+        (0, vitest_1.expect)((0, proof_nets_1.reduceCut)(net)).toBe(net);
+    });
+    (0, vitest_1.it)('mult-cut compuesto: (A⊗B) vs (A⊥⅋B⊥) cierra a axioms tras normalize', () => {
+        const A = (0, proof_nets_1.atomPos)('A');
+        const Anot = (0, proof_nets_1.atomNeg)('A');
+        const B = (0, proof_nets_1.atomPos)('B');
+        const Bnot = (0, proof_nets_1.atomNeg)('B');
+        const net = {
+            nodes: [
+                { id: 0, formula: A },
+                { id: 1, formula: Anot }, // será emparejado luego
+                { id: 2, formula: B },
+                { id: 3, formula: Bnot }, // será emparejado luego
+                { id: 4, formula: Anot }, // hoja del par
+                { id: 5, formula: Bnot }, // hoja del par
+                { id: 6, formula: A }, // hoja externa
+                { id: 7, formula: B }, // hoja externa
+                { id: 8, formula: (0, proof_nets_1.tensor)(A, B) },
+                { id: 9, formula: (0, proof_nets_1.par)(Anot, Bnot) },
+            ],
+            links: [
+                // axioms: vinculamos los átomos externos con los del par/tensor
+                { kind: 'axiom', ports: [6, 4] },
+                { kind: 'axiom', ports: [7, 5] },
+                { kind: 'axiom', ports: [0, 1] },
+                { kind: 'axiom', ports: [2, 3] },
+                { kind: 'tensor', ports: [0, 2, 8] }, // construye A⊗B desde 0 y 2
+                { kind: 'par', ports: [4, 5, 9] }, // construye A⊥⅋B⊥
+                { kind: 'cut', ports: [8, 9] },
+            ],
+            conclusions: [6, 7, 1, 3],
+        };
+        const norm = (0, proof_nets_1.normalizeCuts)(net);
+        (0, vitest_1.expect)((0, proof_nets_1.isCutFree)(norm)).toBe(true);
+        // Tras toda la cascada deben quedar solo axiom links.
+        for (const l of norm.links) {
+            (0, vitest_1.expect)(l.kind).toBe('axiom');
+        }
+    });
+});
+//# sourceMappingURL=proof-nets.test.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"proof-nets.test.js","sourceRoot":"","sources":["../../../src/tests/proof-nets/proof-nets.test.ts"],"names":[],"mappings":";;AAAA,mCAA8C;AAC9C,iDAe0B;AAE1B,IAAA,iBAAQ,EAAC,kCAAkC,EAAE,GAAG,EAAE;IAChD,IAAA,WAAE,EAAC,qCAAqC,EAAE,GAAG,EAAE;QAC7C,MAAM,CAAC,GAAG,IAAA,oBAAO,EAAC,GAAG,CAAC,CAAC;QACvB,IAAA,eAAM,EAAC,IAAA,0BAAa,EAAC,IAAA,iBAAI,EAAC,IAAA,iBAAI,EAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACrD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,+BAA+B,EAAE,GAAG,EAAE;QACvC,MAAM,CAAC,GAAG,IAAA,oBAAO,EAAC,GAAG,CAAC,CAAC;QACvB,MAAM,CAAC,GAAG,IAAA,oBAAO,EAAC,GAAG,CAAC,CAAC;QACvB,MAAM,GAAG,GAAG,IAAA,iBAAI,EAAC,IAAA,mBAAM,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAC/B,MAAM,GAAG,GAAG,IAAA,gBAAG,EAAC,IAAA,iBAAI,EAAC,CAAC,CAAC,EAAE,IAAA,iBAAI,EAAC,CAAC,CAAC,CAAC,CAAC;QAClC,IAAA,eAAM,EAAC,IAAA,0BAAa,EAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC7C,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,+CAA+C,EAAE,GAAG,EAAE;QACvD,IAAA,eAAM,EAAC,IAAA,4BAAe,EAAC,IAAA,oBAAO,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACjD,IAAA,eAAM,EAAC,IAAA,4BAAe,EAAC,IAAA,mBAAM,EAAC,IAAA,oBAAO,EAAC,GAAG,CAAC,EAAE,IAAA,oBAAO,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QAC7E,IAAA,eAAM,EAAC,IAAA,4BAAe,EAAC,IAAA,gBAAG,EAAC,IAAA,oBAAO,EAAC,GAAG,CAAC,EAAE,IAAA,oBAAO,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;IAC5E,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,sDAAsD,EAAE,GAAG,EAAE;IACpE,IAAA,WAAE,EAAC,8BAA8B,EAAE,GAAG,EAAE;QACtC,MAAM,GAAG,GAAG,IAAA,iCAAoB,EAAC,CAAC,IAAA,oBAAO,EAAC,GAAG,CAAC,EAAE,IAAA,oBAAO,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAC/D,IAAA,eAAM,EAAC,GAAG,CAAC,KAAK,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QAClC,IAAA,eAAM,EAAC,GAAG,CAAC,KAAK,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QAClC,IAAA,eAAM,EAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QACxC,IAAA,eAAM,EAAC,IAAA,sBAAS,EAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACpC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,0DAA0D,EAAE,GAAG,EAAE;QAClE,MAAM,GAAG,GAAG,IAAA,iCAAoB,EAAC,CAAC,IAAA,oBAAO,EAAC,GAAG,CAAC,EAAE,IAAA,oBAAO,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAC/D,IAAA,eAAM,EAAC,IAAA,sBAAS,EAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACpC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,+CAA+C,EAAE,GAAG,EAAE;QACvD,MAAM,GAAG,GAAG,IAAA,iCAAoB,EAAC;YAC/B,IAAA,oBAAO,EAAC,GAAG,CAAC;YACZ,IAAA,oBAAO,EAAC,GAAG,CAAC;YACZ,IAAA,mBAAM,EAAC,IAAA,oBAAO,EAAC,GAAG,CAAC,EAAE,IAAA,oBAAO,EAAC,GAAG,CAAC,CAAC;SACnC,CAAC,CAAC;QACH,IAAA,eAAM,EAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC9D,IAAA,eAAM,EAAC,GAAG,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,OAAO,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QACpE,IAAA,eAAM,EAAC,IAAA,sBAAS,EAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACpC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,6CAA6C,EAAE,GAAG,EAAE;QACrD,MAAM,GAAG,GAAG,IAAA,iCAAoB,EAAC;YAC/B,IAAA,gBAAG,EAAC,IAAA,oBAAO,EAAC,GAAG,CAAC,EAAE,IAAA,oBAAO,EAAC,GAAG,CAAC,CAAC;YAC/B,IAAA,mBAAM,EAAC,IAAA,oBAAO,EAAC,GAAG,CAAC,EAAE,IAAA,oBAAO,EAAC,GAAG,CAAC,CAAC;SACnC,CAAC,CAAC;QACH,IAAA,eAAM,EAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC9D,IAAA,eAAM,EAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC3D,IAAA,eAAM,EAAC,IAAA,sBAAS,EAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACpC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,qFAAqF,EAAE,GAAG,EAAE;QAC7F,+DAA+D;QAC/D,gEAAgE;QAChE,+DAA+D;QAC/D,yDAAyD;QACzD,iDAAiD;QACjD,MAAM,GAAG,GAAG,IAAA,iCAAoB,EAAC,CAAC,IAAA,oBAAO,EAAC,GAAG,CAAC,EAAE,IAAA,gBAAG,EAAC,IAAA,oBAAO,EAAC,GAAG,CAAC,EAAE,IAAA,oBAAO,EAAC,GAAG,CAAC,CAAC,EAAE,IAAA,oBAAO,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAChG,IAAA,eAAM,EAAC,IAAA,sBAAS,EAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACrC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,iDAAiD,EAAE,GAAG,EAAE;QACzD,MAAM,GAAG,GAAG,IAAA,iCAAoB,EAAC;YAC/B,IAAA,mBAAM,EAAC,IAAA,oBAAO,EAAC,GAAG,CAAC,EAAE,IAAA,oBAAO,EAAC,GAAG,CAAC,CAAC;YAClC,IAAA,gBAAG,EAAC,IAAA,oBAAO,EAAC,GAAG,CAAC,EAAE,IAAA,oBAAO,EAAC,GAAG,CAAC,CAAC;SAChC,CAAC,CAAC;QACH,IAAA,eAAM,EAAC,IAAA,sBAAS,EAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACpC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,kDAAkD,EAAE,GAAG,EAAE;QAC1D,MAAM,GAAG,GAAG,IAAA,iCAAoB,EAAC,EAAE,CAAC,CAAC;QACrC,IAAA,eAAM,EAAC,GAAG,CAAC,KAAK,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QAClC,IAAA,eAAM,EAAC,GAAG,CAAC,KAAK,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QAClC,IAAA,eAAM,EAAC,IAAA,sBAAS,EAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACpC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,sDAAsD,EAAE,GAAG,EAAE;QAC9D,MAAM,GAAG,GAAG,IAAA,iCAAoB,EAAC,CAAC,IAAA,oBAAO,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACjD,2DAA2D;QAC3D,qCAAqC;QACrC,IAAA,eAAM,EAAC,IAAA,sBAAS,EAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACrC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,+DAA+D,EAAE,GAAG,EAAE;QACvE,gEAAgE;QAChE,gEAAgE;QAChE,wBAAwB;QACxB,MAAM,GAAG,GAAG,IAAA,iCAAoB,EAAC,CAAC,IAAA,mBAAM,EAAC,IAAA,oBAAO,EAAC,GAAG,CAAC,EAAE,IAAA,oBAAO,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACvE,8DAA8D;QAC9D,8DAA8D;QAC9D,6DAA6D;QAC7D,IAAA,eAAM,EAAC,IAAA,sBAAS,EAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACrC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,6DAA6D,EAAE,GAAG,EAAE;QACrE,MAAM,GAAG,GAAG,IAAA,iCAAoB,EAAC,CAAC,IAAA,gBAAG,EAAC,IAAA,oBAAO,EAAC,GAAG,CAAC,EAAE,IAAA,oBAAO,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACpE,IAAA,eAAM,EAAC,IAAA,sBAAS,EAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACpC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,wCAAwC,EAAE,GAAG,EAAE;QAChD,yDAAyD;QACzD,MAAM,GAAG,GAAa;YACpB,KAAK,EAAE;gBACL,EAAE,EAAE,EAAE,CAAC,EAAE,OAAO,EAAE,IAAA,oBAAO,EAAC,GAAG,CAAC,EAAE;gBAChC,EAAE,EAAE,EAAE,CAAC,EAAE,OAAO,EAAE,IAAA,oBAAO,EAAC,GAAG,CAAC,EAAE;gBAChC,EAAE,EAAE,EAAE,CAAC,EAAE,OAAO,EAAE,IAAA,oBAAO,EAAC,GAAG,CAAC,EAAE;gBAChC,EAAE,EAAE,EAAE,CAAC,EAAE,OAAO,EAAE,IAAA,oBAAO,EAAC,GAAG,CAAC,EAAE;aACjC;YACD,KAAK,EAAE;gBACL,EAAE,IAAI,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE;gBAChC,EAAE,IAAI,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE;aACjC;YACD,WAAW,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;SAC1B,CAAC;QACF,IAAA,eAAM,EAAC,IAAA,sBAAS,EAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACrC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,uCAAuC,EAAE,GAAG,EAAE;QAC/C,MAAM,GAAG,GAAa;YACpB,KAAK,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,OAAO,EAAE,IAAA,oBAAO,EAAC,GAAG,CAAC,EAAE,CAAC;YACzC,KAAK,EAAE,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC;YAC1C,WAAW,EAAE,CAAC,CAAC,CAAC;SACjB,CAAC;QACF,IAAA,eAAM,EAAC,IAAA,sBAAS,EAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACrC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,6CAA6C,EAAE,GAAG,EAAE;QACrD,MAAM,GAAG,GAAa;YACpB,KAAK,EAAE;gBACL,EAAE,EAAE,EAAE,CAAC,EAAE,OAAO,EAAE,IAAA,oBAAO,EAAC,GAAG,CAAC,EAAE;gBAChC,EAAE,EAAE,EAAE,CAAC,EAAE,OAAO,EAAE,IAAA,oBAAO,EAAC,GAAG,CAAC,EAAE;aACjC;YACD,KAAK,EAAE,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC;YACzC,WAAW,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC;SACpB,CAAC;QACF,IAAA,eAAM,EAAC,IAAA,sBAAS,EAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACrC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,oCAAoC,EAAE,GAAG,EAAE;IAClD,IAAA,WAAE,EAAC,6CAA6C,EAAE,GAAG,EAAE;QACrD,uDAAuD;QACvD,6DAA6D;QAC7D,+DAA+D;QAC/D,MAAM,GAAG,GAAa;YACpB,KAAK,EAAE;gBACL,EAAE,EAAE,EAAE,CAAC,EAAE,OAAO,EAAE,IAAA,oBAAO,EAAC,GAAG,CAAC,EAAE;gBAChC,EAAE,EAAE,EAAE,CAAC,EAAE,OAAO,EAAE,IAAA,oBAAO,EAAC,GAAG,CAAC,EAAE;gBAChC,EAAE,EAAE,EAAE,CAAC,EAAE,OAAO,EAAE,IAAA,oBAAO,EAAC,GAAG,CAAC,EAAE;aACjC;YACD,KAAK,EAAE;gBACL,EAAE,IAAI,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE;gBAChC,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE;aAC/B;YACD,WAAW,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC;SACpB,CAAC;QACF,IAAA,eAAM,EAAC,IAAA,sBAAS,EAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACnC,MAAM,IAAI,GAAG,IAAA,0BAAa,EAAC,GAAG,CAAC,CAAC;QAChC,IAAA,eAAM,EAAC,IAAI,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAChC,IAAA,eAAM,EAAC,IAAA,sBAAS,EAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACvC,IAAA,eAAM,EAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QACvC,IAAA,eAAM,EAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QAC7C,IAAA,eAAM,EAAC,IAAI,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,OAAO,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QAClE,IAAA,eAAM,EAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,aAAa,EAAE,CAAC;IACjE,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,0DAA0D,EAAE,GAAG,EAAE;QAClE,2BAA2B;QAC3B,kDAAkD;QAClD,iDAAiD;QACjD,MAAM,CAAC,GAAG,IAAA,oBAAO,EAAC,GAAG,CAAC,CAAC;QACvB,MAAM,IAAI,GAAG,IAAA,oBAAO,EAAC,GAAG,CAAC,CAAC;QAC1B,MAAM,CAAC,GAAG,IAAA,oBAAO,EAAC,GAAG,CAAC,CAAC;QACvB,MAAM,IAAI,GAAG,IAAA,oBAAO,EAAC,GAAG,CAAC,CAAC;QAC1B,MAAM,GAAG,GAAa;YACpB,KAAK,EAAE;gBACL,EAAE,EAAE,EAAE,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE;gBACrB,EAAE,EAAE,EAAE,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE;gBACrB,EAAE,EAAE,EAAE,CAAC,EAAE,OAAO,EAAE,IAAI,EAAE;gBACxB,EAAE,EAAE,EAAE,CAAC,EAAE,OAAO,EAAE,IAAI,EAAE;gBACxB,EAAE,EAAE,EAAE,CAAC,EAAE,OAAO,EAAE,IAAA,mBAAM,EAAC,CAAC,EAAE,CAAC,CAAC,EAAE;gBAChC,EAAE,EAAE,EAAE,CAAC,EAAE,OAAO,EAAE,IAAA,gBAAG,EAAC,IAAI,EAAE,IAAI,CAAC,EAAE;aACpC;YACD,KAAK,EAAE;gBACL,EAAE,IAAI,EAAE,QAAQ,EAAE,KAAK,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE;gBACpC,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE;gBACjC,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE;aAC/B;YACD,WAAW,EAAE,EAAE;SAChB,CAAC;QACF,MAAM,IAAI,GAAG,IAAA,0BAAa,EAAC,GAAG,CAAC,CAAC;QAChC,IAAA,eAAM,EAAC,IAAI,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAChC,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,KAAK,CAAC,CAAC;QAC5D,IAAA,eAAM,EAAC,IAAI,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QAC7B,+CAA+C;QAC/C,MAAM,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;QACtD,IAAA,eAAM,EAAC,WAAW,CAAC,CAAC,cAAc,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QACpD,IAAA,eAAM,EAAC,WAAW,CAAC,CAAC,cAAc,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QACpD,oDAAoD;QACpD,IAAA,eAAM,EAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACpE,IAAA,eAAM,EAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACnE,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,0CAA0C,EAAE,GAAG,EAAE;QAClD,kEAAkE;QAClE,MAAM,GAAG,GAAa;YACpB,KAAK,EAAE;gBACL,EAAE,EAAE,EAAE,CAAC,EAAE,OAAO,EAAE,IAAA,oBAAO,EAAC,GAAG,CAAC,EAAE;gBAChC,EAAE,EAAE,EAAE,CAAC,EAAE,OAAO,EAAE,IAAA,oBAAO,EAAC,GAAG,CAAC,EAAE;gBAChC,EAAE,EAAE,EAAE,CAAC,EAAE,OAAO,EAAE,IAAA,oBAAO,EAAC,GAAG,CAAC,EAAE;gBAChC,EAAE,EAAE,EAAE,CAAC,EAAE,OAAO,EAAE,IAAA,oBAAO,EAAC,GAAG,CAAC,EAAE;aACjC;YACD,KAAK,EAAE;gBACL,EAAE,IAAI,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE;gBAChC,EAAE,IAAI,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE;gBAChC,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE;aAC/B;YACD,WAAW,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC;SACpB,CAAC;QACF,MAAM,IAAI,GAAG,IAAA,0BAAa,EAAC,GAAG,CAAC,CAAC;QAChC,IAAA,eAAM,EAAC,IAAA,sBAAS,EAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACnC,6DAA6D;QAC7D,gEAAgE;QAChE,IAAA,eAAM,EAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,sBAAsB,CAAC,CAAC,CAAC,CAAC;IACtD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,+CAA+C,EAAE,GAAG,EAAE;QACvD,MAAM,GAAG,GAAG,IAAA,iCAAoB,EAAC,CAAC,IAAA,oBAAO,EAAC,GAAG,CAAC,EAAE,IAAA,oBAAO,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAC/D,IAAA,eAAM,EAAC,IAAA,sBAAS,EAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAClC,MAAM,IAAI,GAAG,IAAA,0BAAa,EAAC,GAAG,CAAC,CAAC;QAChC,IAAA,eAAM,EAAC,IAAI,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACjC,IAAA,eAAM,EAAC,IAAI,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAC3B,IAAA,eAAM,EAAC,IAAA,sBAAS,EAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IACnC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,qEAAqE,EAAE,GAAG,EAAE;QAC7E,MAAM,CAAC,GAAG,IAAA,oBAAO,EAAC,GAAG,CAAC,CAAC;QACvB,MAAM,IAAI,GAAG,IAAA,oBAAO,EAAC,GAAG,CAAC,CAAC;QAC1B,MAAM,CAAC,GAAG,IAAA,oBAAO,EAAC,GAAG,CAAC,CAAC;QACvB,MAAM,IAAI,GAAG,IAAA,oBAAO,EAAC,GAAG,CAAC,CAAC;QAC1B,MAAM,GAAG,GAAa;YACpB,KAAK,EAAE;gBACL,EAAE,EAAE,EAAE,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE;gBACrB,EAAE,EAAE,EAAE,CAAC,EAAE,OAAO,EAAE,IAAI,EAAE,EAAE,wBAAwB;gBAClD,EAAE,EAAE,EAAE,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE;gBACrB,EAAE,EAAE,EAAE,CAAC,EAAE,OAAO,EAAE,IAAI,EAAE,EAAE,wBAAwB;gBAClD,EAAE,EAAE,EAAE,CAAC,EAAE,OAAO,EAAE,IAAI,EAAE,EAAE,eAAe;gBACzC,EAAE,EAAE,EAAE,CAAC,EAAE,OAAO,EAAE,IAAI,EAAE,EAAE,eAAe;gBACzC,EAAE,EAAE,EAAE,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,EAAE,eAAe;gBACtC,EAAE,EAAE,EAAE,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,EAAE,eAAe;gBACtC,EAAE,EAAE,EAAE,CAAC,EAAE,OAAO,EAAE,IAAA,mBAAM,EAAC,CAAC,EAAE,CAAC,CAAC,EAAE;gBAChC,EAAE,EAAE,EAAE,CAAC,EAAE,OAAO,EAAE,IAAA,gBAAG,EAAC,IAAI,EAAE,IAAI,CAAC,EAAE;aACpC;YACD,KAAK,EAAE;gBACL,gEAAgE;gBAChE,EAAE,IAAI,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE;gBAChC,EAAE,IAAI,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE;gBAChC,EAAE,IAAI,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE;gBAChC,EAAE,IAAI,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE;gBAChC,EAAE,IAAI,EAAE,QAAQ,EAAE,KAAK,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,4BAA4B;gBAClE,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,kBAAkB;gBACrD,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE;aAC/B;YACD,WAAW,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;SAC1B,CAAC;QACF,MAAM,IAAI,GAAG,IAAA,0BAAa,EAAC,GAAG,CAAC,CAAC;QAChC,IAAA,eAAM,EAAC,IAAA,sBAAS,EAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACnC,sDAAsD;QACtD,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YAC3B,IAAA,eAAM,EAAC,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QAC/B,CAAC;IACH,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}

package/dist/tests/tableau-framework/tableau.test.d.ts

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

package/dist/tests/tableau-framework/tableau.test.d.ts.map

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

package/dist/tests/tableau-framework/tableau.test.js

@@ -0,0 +1,196 @@
+"use strict";
+// ============================================================
+// Tests — Tableau extensible framework
+// ============================================================
+Object.defineProperty(exports, "__esModule", { value: true });
+const vitest_1 = require("vitest");
+const tableau_framework_1 = require("../../tableau-framework");
+// ── Formula helpers ───────────────────────────────────────────
+function atom(name) {
+    return { kind: 'atom', name };
+}
+function not(f) {
+    return { kind: 'not', args: [f] };
+}
+function and(a, b) {
+    return { kind: 'and', args: [a, b] };
+}
+function or(a, b) {
+    return { kind: 'or', args: [a, b] };
+}
+function implies(a, b) {
+    return { kind: 'implies', args: [a, b] };
+}
+function T(f) {
+    return { formula: f, signed: 'T' };
+}
+function F(f) {
+    return { formula: f, signed: 'F' };
+}
+function branch(...nodes) {
+    return { nodes, closed: false };
+}
+// ── Tests ─────────────────────────────────────────────────────
+(0, vitest_1.describe)('Tableau framework — closure A, ¬A', () => {
+    (0, vitest_1.it)('cierra cuando T A y F A están en la misma rama', () => {
+        const prover = (0, tableau_framework_1.createPropositionalProver)();
+        const p = atom('P');
+        const result = prover.prove(branch(T(p), F(p)));
+        (0, vitest_1.expect)(result.closed).toBe(true);
+        (0, vitest_1.expect)(result.open).toHaveLength(0);
+    });
+    (0, vitest_1.it)('no cierra cuando solo está T A sin F A', () => {
+        const prover = (0, tableau_framework_1.createPropositionalProver)();
+        const result = prover.prove(branch(T(atom('P'))));
+        (0, vitest_1.expect)(result.closed).toBe(false);
+        (0, vitest_1.expect)(result.open.length).toBeGreaterThan(0);
+    });
+});
+(0, vitest_1.describe)('Tableau framework — doble negación ¬¬', () => {
+    (0, vitest_1.it)('T ¬¬A se reduce a T A (α-rule aplicada dos veces)', () => {
+        const prover = (0, tableau_framework_1.createPropositionalProver)();
+        const p = atom('P');
+        // Para falsificar T¬¬P debería quedar abierto (P es satisfacible)
+        const result = prover.prove(branch(T(not(not(p))), F(p)));
+        // Después de expandir ¬¬ obtenemos T P y F P → cierre
+        (0, vitest_1.expect)(result.closed).toBe(true);
+    });
+    (0, vitest_1.it)('F ¬¬A se reduce a F A', () => {
+        const prover = (0, tableau_framework_1.createPropositionalProver)();
+        const p = atom('P');
+        // F ¬¬P → T ¬P → F P; luego T P y F P → cierre
+        const result = prover.prove(branch(T(p), F(not(not(p)))));
+        (0, vitest_1.expect)(result.closed).toBe(true);
+    });
+});
+(0, vitest_1.describe)('Tableau framework — conjunción (∧)', () => {
+    (0, vitest_1.it)('T(A∧B) agrega T A y T B (α-rule)', () => {
+        const prover = (0, tableau_framework_1.createPropositionalProver)();
+        const [p, q] = [atom('P'), atom('Q')];
+        // Intentar refutar P∧Q dando F(P∧Q): se bifurca en F P | F Q
+        // Con T P y T Q en la misma rama, el árbol cierra ambas ramas.
+        const result = prover.prove(branch(T(p), T(q), F(and(p, q))));
+        (0, vitest_1.expect)(result.closed).toBe(true);
+    });
+    (0, vitest_1.it)('F(A∧B) bifurca (β-rule) y puede dejar ramas abiertas', () => {
+        const prover = (0, tableau_framework_1.createPropositionalProver)();
+        const [p, q] = [atom('P'), atom('Q')];
+        // F(P∧Q) sin T P ni T Q → ambas ramas abiertas
+        const result = prover.prove(branch(F(and(p, q))));
+        (0, vitest_1.expect)(result.closed).toBe(false);
+    });
+});
+(0, vitest_1.describe)('Tableau framework — disyunción (∨)', () => {
+    (0, vitest_1.it)('T(A∨B) bifurca (β-rule)', () => {
+        const prover = (0, tableau_framework_1.createPropositionalProver)();
+        const [p, q] = [atom('P'), atom('Q')];
+        // T(P∨Q) con F P y F Q → ambas ramas cierran
+        const result = prover.prove(branch(T(or(p, q)), F(p), F(q)));
+        (0, vitest_1.expect)(result.closed).toBe(true);
+    });
+    (0, vitest_1.it)('F(A∨B) agrega F A y F B (α-rule)', () => {
+        const prover = (0, tableau_framework_1.createPropositionalProver)();
+        const [p, q] = [atom('P'), atom('Q')];
+        // F(P∨Q) con T P → T P y F P → cierra
+        const result = prover.prove(branch(T(p), F(or(p, q))));
+        (0, vitest_1.expect)(result.closed).toBe(true);
+    });
+});
+(0, vitest_1.describe)('Tableau framework — implicación (→)', () => {
+    (0, vitest_1.it)('T(A→B) bifurca en F A | T B (β-rule)', () => {
+        const prover = (0, tableau_framework_1.createPropositionalProver)();
+        const [p, q] = [atom('P'), atom('Q')];
+        // T(P→Q) con T P y F Q → solo la rama F P cierra; T Q cierra con F Q
+        const result = prover.prove(branch(T(implies(p, q)), T(p), F(q)));
+        (0, vitest_1.expect)(result.closed).toBe(true);
+    });
+    (0, vitest_1.it)('F(A→B) agrega T A y F B (α-rule)', () => {
+        const prover = (0, tableau_framework_1.createPropositionalProver)();
+        const [p, q] = [atom('P'), atom('Q')];
+        // F(P→Q) con F P → T P y F P → cierra
+        const result = prover.prove(branch(F(p), F(implies(p, q))));
+        (0, vitest_1.expect)(result.closed).toBe(true);
+    });
+});
+(0, vitest_1.describe)('Tableau framework — tautologías clásicas', () => {
+    (0, vitest_1.it)('A∨¬A es tautología (refutación cierra)', () => {
+        const prover = (0, tableau_framework_1.createPropositionalProver)();
+        const p = atom('P');
+        // Para probar tautología: asumir F(A∨¬A)
+        const result = prover.prove(branch(F(or(p, not(p)))));
+        (0, vitest_1.expect)(result.closed).toBe(true);
+    });
+    (0, vitest_1.it)('(A→B)→(¬B→¬A) es tautología (modus tollens)', () => {
+        const prover = (0, tableau_framework_1.createPropositionalProver)();
+        const [a, b] = [atom('A'), atom('B')];
+        const formula = implies(implies(a, b), implies(not(b), not(a)));
+        const result = prover.prove(branch(F(formula)));
+        (0, vitest_1.expect)(result.closed).toBe(true);
+    });
+});
+(0, vitest_1.describe)('Tableau framework — closure condition personalizada', () => {
+    (0, vitest_1.it)('permite registrar una condición de cierre custom', () => {
+        const prover = new tableau_framework_1.TableauProver();
+        // Condición: cierra si la rama contiene el átomo especial "BOTTOM"
+        prover.registerClosureCondition(b => {
+            const hasBottom = b.nodes.some(n => n.formula.kind === 'atom' && n.formula['name'] === 'BOTTOM');
+            return hasBottom ? 'explicit bottom atom' : null;
+        });
+        const result = prover.prove(branch({ formula: { kind: 'atom', name: 'BOTTOM' } }));
+        (0, vitest_1.expect)(result.closed).toBe(true);
+        (0, vitest_1.expect)(result.branches[0]?.reason).toContain('bottom');
+    });
+    (0, vitest_1.it)('closure custom no interfiere con ramas sin el átomo', () => {
+        const prover = new tableau_framework_1.TableauProver();
+        prover.registerClosureCondition(b => {
+            const has = b.nodes.some(n => n.formula['name'] === 'BOTTOM');
+            return has ? 'bottom' : null;
+        });
+        const result = prover.prove(branch({ formula: atom('P') }));
+        (0, vitest_1.expect)(result.closed).toBe(false);
+    });
+});
+(0, vitest_1.describe)('Tableau framework — composición de provers', () => {
+    (0, vitest_1.it)('un prover puede copiar reglas de otro (compose manual)', () => {
+        const base = (0, tableau_framework_1.createPropositionalProver)();
+        const extended = (0, tableau_framework_1.createPropositionalProver)();
+        // Regla extra: cierra en cualquier átomo llamado "ABSURD"
+        const absurdRule = {
+            name: 'Absurd-Atom',
+            match: n => n.formula.kind === 'atom' && n.formula['name'] === 'ABSURD',
+            apply: () => [],
+        };
+        extended.registerRule(absurdRule);
+        extended.registerClosureCondition(b => {
+            const has = b.nodes.some(n => n.formula['name'] === 'ABSURD');
+            return has ? 'absurd atom present' : null;
+        });
+        const p = atom('P');
+        // Base prover no cierra esto (no hay contradicción)
+        const r1 = base.prove(branch(T(p)));
+        (0, vitest_1.expect)(r1.closed).toBe(false);
+        // Extended prover cierra porque la closure extra detecta ABSURD
+        const r2 = extended.prove(branch({ formula: { kind: 'atom', name: 'ABSURD' }, signed: 'T' }));
+        (0, vitest_1.expect)(r2.closed).toBe(true);
+    });
+});
+(0, vitest_1.describe)('Tableau framework — maxDepth guard', () => {
+    (0, vitest_1.it)('respeta maxDepth y no entra en bucle infinito', () => {
+        const prover = new tableau_framework_1.TableauProver();
+        // Regla que siempre genera más trabajo (sin convergencia)
+        const infiniteRule = {
+            name: 'Infinite',
+            match: n => n.formula.kind === 'loop',
+            apply: (n) => [[n]],
+        };
+        prover.registerRule(infiniteRule);
+        const start = Date.now();
+        const result = prover.prove(branch({ formula: { kind: 'loop' } }), 5);
+        const elapsed = Date.now() - start;
+        // Debe terminar rápido (no loop infinito)
+        (0, vitest_1.expect)(elapsed).toBeLessThan(2000);
+        // No cerró (no hay closure condition)
+        (0, vitest_1.expect)(result.closed).toBe(false);
+    });
+});
+//# sourceMappingURL=tableau.test.js.map

package/dist/tests/tableau-framework/tableau.test.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"tableau.test.js","sourceRoot":"","sources":["../../../src/tests/tableau-framework/tableau.test.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,uCAAuC;AACvC,+DAA+D;;AAE/D,mCAA8C;AAC9C,+DAGiC;AAQjC,iEAAiE;AAEjE,SAAS,IAAI,CAAC,IAAY;IACxB,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC;AAChC,CAAC;AACD,SAAS,GAAG,CAAC,CAAc;IACzB,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;AACpC,CAAC;AACD,SAAS,GAAG,CAAC,CAAc,EAAE,CAAc;IACzC,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC;AACvC,CAAC;AACD,SAAS,EAAE,CAAC,CAAc,EAAE,CAAc;IACxC,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC;AACtC,CAAC;AACD,SAAS,OAAO,CAAC,CAAc,EAAE,CAAc;IAC7C,OAAO,EAAE,IAAI,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC;AAC3C,CAAC;AAED,SAAS,CAAC,CAAC,CAAc;IACvB,OAAO,EAAE,OAAO,EAAE,CAAC,EAAE,MAAM,EAAE,GAAG,EAAE,CAAC;AACrC,CAAC;AACD,SAAS,CAAC,CAAC,CAAc;IACvB,OAAO,EAAE,OAAO,EAAE,CAAC,EAAE,MAAM,EAAE,GAAG,EAAE,CAAC;AACrC,CAAC;AAED,SAAS,MAAM,CAAC,GAAG,KAAiC;IAClD,OAAO,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC;AAClC,CAAC;AAED,iEAAiE;AAEjE,IAAA,iBAAQ,EAAC,mCAAmC,EAAE,GAAG,EAAE;IACjD,IAAA,WAAE,EAAC,gDAAgD,EAAE,GAAG,EAAE;QACxD,MAAM,MAAM,GAAG,IAAA,6CAAyB,GAAE,CAAC;QAC3C,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC;QACpB,MAAM,MAAM,GAAG,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAChD,IAAA,eAAM,EAAC,MAAM,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACjC,IAAA,eAAM,EAAC,MAAM,CAAC,IAAI,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;IACtC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,wCAAwC,EAAE,GAAG,EAAE;QAChD,MAAM,MAAM,GAAG,IAAA,6CAAyB,GAAE,CAAC;QAC3C,MAAM,MAAM,GAAG,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QAClD,IAAA,eAAM,EAAC,MAAM,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAClC,IAAA,eAAM,EAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;IAChD,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,uCAAuC,EAAE,GAAG,EAAE;IACrD,IAAA,WAAE,EAAC,mDAAmD,EAAE,GAAG,EAAE;QAC3D,MAAM,MAAM,GAAG,IAAA,6CAAyB,GAAE,CAAC;QAC3C,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC;QACpB,kEAAkE;QAClE,MAAM,MAAM,GAAG,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC1D,sDAAsD;QACtD,IAAA,eAAM,EAAC,MAAM,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACnC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,uBAAuB,EAAE,GAAG,EAAE;QAC/B,MAAM,MAAM,GAAG,IAAA,6CAAyB,GAAE,CAAC;QAC3C,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC;QACpB,+CAA+C;QAC/C,MAAM,MAAM,GAAG,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC1D,IAAA,eAAM,EAAC,MAAM,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACnC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,oCAAoC,EAAE,GAAG,EAAE;IAClD,IAAA,WAAE,EAAC,kCAAkC,EAAE,GAAG,EAAE;QAC1C,MAAM,MAAM,GAAG,IAAA,6CAAyB,GAAE,CAAC;QAC3C,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;QACtC,6DAA6D;QAC7D,+DAA+D;QAC/D,MAAM,MAAM,GAAG,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC9D,IAAA,eAAM,EAAC,MAAM,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACnC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,sDAAsD,EAAE,GAAG,EAAE;QAC9D,MAAM,MAAM,GAAG,IAAA,6CAAyB,GAAE,CAAC;QAC3C,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;QACtC,+CAA+C;QAC/C,MAAM,MAAM,GAAG,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAClD,IAAA,eAAM,EAAC,MAAM,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACpC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,oCAAoC,EAAE,GAAG,EAAE;IAClD,IAAA,WAAE,EAAC,yBAAyB,EAAE,GAAG,EAAE;QACjC,MAAM,MAAM,GAAG,IAAA,6CAAyB,GAAE,CAAC;QAC3C,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;QACtC,6CAA6C;QAC7C,MAAM,MAAM,GAAG,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC7D,IAAA,eAAM,EAAC,MAAM,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACnC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,kCAAkC,EAAE,GAAG,EAAE;QAC1C,MAAM,MAAM,GAAG,IAAA,6CAAyB,GAAE,CAAC;QAC3C,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;QACtC,sCAAsC;QACtC,MAAM,MAAM,GAAG,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACvD,IAAA,eAAM,EAAC,MAAM,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACnC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,qCAAqC,EAAE,GAAG,EAAE;IACnD,IAAA,WAAE,EAAC,sCAAsC,EAAE,GAAG,EAAE;QAC9C,MAAM,MAAM,GAAG,IAAA,6CAAyB,GAAE,CAAC;QAC3C,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;QACtC,qEAAqE;QACrE,MAAM,MAAM,GAAG,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAClE,IAAA,eAAM,EAAC,MAAM,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACnC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,kCAAkC,EAAE,GAAG,EAAE;QAC1C,MAAM,MAAM,GAAG,IAAA,6CAAyB,GAAE,CAAC;QAC3C,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;QACtC,sCAAsC;QACtC,MAAM,MAAM,GAAG,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC5D,IAAA,eAAM,EAAC,MAAM,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACnC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,0CAA0C,EAAE,GAAG,EAAE;IACxD,IAAA,WAAE,EAAC,wCAAwC,EAAE,GAAG,EAAE;QAChD,MAAM,MAAM,GAAG,IAAA,6CAAyB,GAAE,CAAC;QAC3C,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC;QACpB,yCAAyC;QACzC,MAAM,MAAM,GAAG,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACtD,IAAA,eAAM,EAAC,MAAM,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACnC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,6CAA6C,EAAE,GAAG,EAAE;QACrD,MAAM,MAAM,GAAG,IAAA,6CAAyB,GAAE,CAAC;QAC3C,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;QACtC,MAAM,OAAO,GAAG,OAAO,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAChE,MAAM,MAAM,GAAG,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;QAChD,IAAA,eAAM,EAAC,MAAM,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACnC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,qDAAqD,EAAE,GAAG,EAAE;IACnE,IAAA,WAAE,EAAC,kDAAkD,EAAE,GAAG,EAAE;QAC1D,MAAM,MAAM,GAAG,IAAI,iCAAa,EAAe,CAAC;QAEhD,mEAAmE;QACnE,MAAM,CAAC,wBAAwB,CAAC,CAAC,CAAC,EAAE;YAClC,MAAM,SAAS,GAAG,CAAC,CAAC,KAAK,CAAC,IAAI,CAC5B,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,IAAI,KAAK,MAAM,IAAI,CAAC,CAAC,OAAO,CAAC,MAAM,CAAC,KAAK,QAAQ,CACjE,CAAC;YACF,OAAO,SAAS,CAAC,CAAC,CAAC,sBAAsB,CAAC,CAAC,CAAC,IAAI,CAAC;QACnD,CAAC,CAAC,CAAC;QAEH,MAAM,MAAM,GAAG,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,EAAE,OAAO,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,QAAQ,EAAE,EAAE,CAAC,CAAC,CAAC;QACnF,IAAA,eAAM,EAAC,MAAM,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACjC,IAAA,eAAM,EAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC;IACzD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,qDAAqD,EAAE,GAAG,EAAE;QAC7D,MAAM,MAAM,GAAG,IAAI,iCAAa,EAAe,CAAC;QAChD,MAAM,CAAC,wBAAwB,CAAC,CAAC,CAAC,EAAE;YAClC,MAAM,GAAG,GAAG,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,MAAM,CAAC,KAAK,QAAQ,CAAC,CAAC;YAC9D,OAAO,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC;QAC/B,CAAC,CAAC,CAAC;QAEH,MAAM,MAAM,GAAG,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,EAAE,OAAO,EAAE,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;QAC5D,IAAA,eAAM,EAAC,MAAM,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACpC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,4CAA4C,EAAE,GAAG,EAAE;IAC1D,IAAA,WAAE,EAAC,wDAAwD,EAAE,GAAG,EAAE;QAChE,MAAM,IAAI,GAAG,IAAA,6CAAyB,GAAE,CAAC;QACzC,MAAM,QAAQ,GAAG,IAAA,6CAAyB,GAAE,CAAC;QAE7C,0DAA0D;QAC1D,MAAM,UAAU,GAAsB;YACpC,IAAI,EAAE,aAAa;YACnB,KAAK,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,IAAI,KAAK,MAAM,IAAI,CAAC,CAAC,OAAO,CAAC,MAAM,CAAC,KAAK,QAAQ;YACvE,KAAK,EAAE,GAAG,EAAE,CAAC,EAAE;SAChB,CAAC;QACF,QAAQ,CAAC,YAAY,CAAC,UAAU,CAAC,CAAC;QAClC,QAAQ,CAAC,wBAAwB,CAAC,CAAC,CAAC,EAAE;YACpC,MAAM,GAAG,GAAG,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,MAAM,CAAC,KAAK,QAAQ,CAAC,CAAC;YAC9D,OAAO,GAAG,CAAC,CAAC,CAAC,qBAAqB,CAAC,CAAC,CAAC,IAAI,CAAC;QAC5C,CAAC,CAAC,CAAC;QAEH,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC;QACpB,oDAAoD;QACpD,MAAM,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACpC,IAAA,eAAM,EAAC,EAAE,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAE9B,gEAAgE;QAChE,MAAM,EAAE,GAAG,QAAQ,CAAC,KAAK,CAAC,MAAM,CAAC,EAAE,OAAO,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,QAAQ,EAAE,EAAE,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC;QAC9F,IAAA,eAAM,EAAC,EAAE,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC/B,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,oCAAoC,EAAE,GAAG,EAAE;IAClD,IAAA,WAAE,EAAC,+CAA+C,EAAE,GAAG,EAAE;QACvD,MAAM,MAAM,GAAG,IAAI,iCAAa,EAAe,CAAC;QAEhD,0DAA0D;QAC1D,MAAM,YAAY,GAAsB;YACtC,IAAI,EAAE,UAAU;YAChB,KAAK,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,IAAI,KAAK,MAAM;YACrC,KAAK,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;SACpB,CAAC;QACF,MAAM,CAAC,YAAY,CAAC,YAAY,CAAC,CAAC;QAElC,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QACzB,MAAM,MAAM,GAAG,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,EAAE,OAAO,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QACtE,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,KAAK,CAAC;QAEnC,0CAA0C;QAC1C,IAAA,eAAM,EAAC,OAAO,CAAC,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC;QACnC,sCAAsC;QACtC,IAAA,eAAM,EAAC,MAAM,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACpC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@stevenvo780/st-lang",
-  "version": "4.4.0",
+  "version": "4.5.0",
   "description": "ST — Lenguaje ejecutable con nucleo logico y capa textual. Motor multi-perfil (11 lógicas), derivaciones, tablas de verdad, contramodelos, aliases modales, Belnap 4-valores y capa textual para formalización de documentos.",
   "main": "dist/index.js",
   "types": "dist/index.d.ts",