@stevenvo780/st-lang 4.9.0 → 4.11.0

package/dist/logic/profiles/natural-deduction-nk/prover.js

@@ -0,0 +1,557 @@
+"use strict";
+// ============================================================
+// Natural Deduction NK (classical) — Backward proof search
+// ============================================================
+//
+// Estrategia: reutilizamos el motor intuicionista NJ y añadimos
+// la regla clásica `rAA` (reductio ad absurdum) como recurso
+// global. Con rAA disponible se obtiene completitud clásica:
+// si Γ ⊨ φ entonces Γ ⊢_NK φ.
+//
+// Heurística de búsqueda:
+//   1. Intentar las reglas estándar NJ.
+//   2. Si la meta es atómica o disyuntiva (no descomponible por
+//      reglas de introducción) y no hubo prueba, intentar rAA:
+//      asume ¬φ y trata de derivar ⊥.
+//   3. Si la meta es exactamente `¬¬φ → φ`, atajamos con
+//      doubleNegE como axioma derivado.
+//
+// El árbol generado es válido NK (verificable por verifyProof).
+// Cuando la prueba evita rAA/LEM/Peirce/doubleNegE, se traduce
+// automáticamente a NJ (ver `nkToNJ`).
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.proveClassically = proveClassically;
+exports.proveIntuitOnly = proveIntuitOnly;
+exports.verifyProof = verifyProof;
+exports.provedPeirce = provedPeirce;
+exports.provedDNE = provedDNE;
+exports.provedLEM = provedLEM;
+exports.nkToNJ = nkToNJ;
+const types_1 = require("./types");
+const formula_1 = require("./formula");
+function freshCtx(budget, intuitOnly = false) {
+    return { budget, used: 0, failed: new Set(), active: new Set(), intuitOnly };
+}
+function exhausted(ctx) {
+    return ctx.used >= ctx.budget;
+}
+function goalKey(context, goal, classicalAllowed) {
+    const sorted = context.map(formula_1.formulaKey).sort();
+    return `${classicalAllowed ? 'C' : 'I'}[${sorted.join('|')}]⊢${(0, formula_1.formulaKey)(goal)}`;
+}
+function contextHas(context, f) {
+    for (const g of context)
+        if ((0, formula_1.formulaEquals)(g, f))
+            return true;
+    return false;
+}
+function withContext(context, f) {
+    if (contextHas(context, f))
+        return context;
+    return [...context, f];
+}
+/**
+ * Núcleo recursivo. Devuelve un árbol NK válido para `context ⊢ goal`
+ * o `null` si no se encontró prueba dentro del budget.
+ */
+function search(context, goal, ctx) {
+    ctx.used++;
+    if (exhausted(ctx))
+        return null;
+    const key = goalKey(context, goal, !ctx.intuitOnly);
+    if (ctx.failed.has(key))
+        return null;
+    if (ctx.active.has(key))
+        return null;
+    ctx.active.add(key);
+    const tryProve = () => {
+        // 1. Axioma / asunción.
+        for (const h of context) {
+            if ((0, formula_1.formulaEquals)(h, goal)) {
+                return { conclusion: goal, rule: 'assumption', premises: [] };
+            }
+        }
+        // 2. Reglas de introducción dirigidas por la forma de la meta
+        //    (invertibles para ∧, →, ¬).
+        if (goal.kind === 'and') {
+            const left = search(context, goal.left, ctx);
+            if (!left)
+                return null;
+            const right = search(context, goal.right, ctx);
+            if (!right)
+                return null;
+            return { conclusion: goal, rule: 'andI', premises: [left, right] };
+        }
+        if (goal.kind === 'implies') {
+            const newCtx = withContext(context, goal.left);
+            const body = search(newCtx, goal.right, ctx);
+            if (!body)
+                return null;
+            return {
+                conclusion: goal,
+                rule: 'impI',
+                premises: [body],
+                discharged: [goal.left],
+            };
+        }
+        if (goal.kind === 'not') {
+            const newCtx = withContext(context, goal.arg);
+            const body = search(newCtx, (0, formula_1.bottom)(), ctx);
+            if (!body)
+                return null;
+            return {
+                conclusion: goal,
+                rule: 'notI',
+                premises: [body],
+                discharged: [goal.arg],
+            };
+        }
+        // 3. Reglas de eliminación a izquierda (sobre el contexto).
+        // ∧EL/∧ER: descomponer cualquier conjunción del contexto.
+        for (let i = 0; i < context.length; i++) {
+            const h = context[i];
+            if (h && h.kind === 'and') {
+                const rest = [...context.slice(0, i), ...context.slice(i + 1)];
+                const extended = withContext(withContext(rest, h.left), h.right);
+                const sub = search(extended, goal, ctx);
+                if (!sub)
+                    return null;
+                const elimL = {
+                    conclusion: h.left,
+                    rule: 'andEL',
+                    premises: [{ conclusion: h, rule: 'assumption', premises: [] }],
+                };
+                const elimR = {
+                    conclusion: h.right,
+                    rule: 'andER',
+                    premises: [{ conclusion: h, rule: 'assumption', premises: [] }],
+                };
+                const withL = substituteAssumption(sub, h.left, elimL);
+                return substituteAssumption(withL, h.right, elimR);
+            }
+        }
+        // ⊥E: si ⊥ está en el contexto, podemos derivar cualquier meta.
+        for (const h of context) {
+            if (h.kind === 'bottom') {
+                return {
+                    conclusion: goal,
+                    rule: 'bottomE',
+                    premises: [{ conclusion: h, rule: 'assumption', premises: [] }],
+                };
+            }
+        }
+        // ∨E (no invertible): si una disyunción A∨B está en el contexto
+        // y podemos probar la meta tanto bajo A como bajo B.
+        for (let i = 0; i < context.length; i++) {
+            const h = context[i];
+            if (h && h.kind === 'or') {
+                const rest = [...context.slice(0, i), ...context.slice(i + 1)];
+                const leftCtx = withContext(rest, h.left);
+                const rightCtx = withContext(rest, h.right);
+                const leftSub = search(leftCtx, goal, ctx);
+                if (!leftSub)
+                    continue;
+                const rightSub = search(rightCtx, goal, ctx);
+                if (!rightSub)
+                    continue;
+                return {
+                    conclusion: goal,
+                    rule: 'orE',
+                    premises: [{ conclusion: h, rule: 'assumption', premises: [] }, leftSub, rightSub],
+                    discharged: [h.left, h.right],
+                };
+            }
+        }
+        // 4. Reglas no-invertibles sobre la meta (∨I).
+        if (goal.kind === 'or') {
+            const leftAttempt = search(context, goal.left, ctx);
+            if (leftAttempt) {
+                return { conclusion: goal, rule: 'orIL', premises: [leftAttempt] };
+            }
+            const rightAttempt = search(context, goal.right, ctx);
+            if (rightAttempt) {
+                return { conclusion: goal, rule: 'orIR', premises: [rightAttempt] };
+            }
+            // continúa a las reglas posteriores (incluyendo rAA si está
+            // habilitada) — la disyunción puede no ser intuitivamente
+            // demostrable (p.ej. P ∨ ¬P).
+        }
+        // →E (modus ponens hacia atrás).
+        for (let i = 0; i < context.length; i++) {
+            const h = context[i];
+            if (h && h.kind === 'implies') {
+                const aProof = search(context, h.left, ctx);
+                if (!aProof)
+                    continue;
+                if ((0, formula_1.formulaEquals)(h.right, goal)) {
+                    return {
+                        conclusion: goal,
+                        rule: 'impE',
+                        premises: [{ conclusion: h, rule: 'assumption', premises: [] }, aProof],
+                    };
+                }
+                const rest = [...context.slice(0, i), ...context.slice(i + 1)];
+                const extended = withContext(rest, h.right);
+                const sub = search(extended, goal, ctx);
+                if (!sub)
+                    continue;
+                const elimB = {
+                    conclusion: h.right,
+                    rule: 'impE',
+                    premises: [{ conclusion: h, rule: 'assumption', premises: [] }, aProof],
+                };
+                return substituteAssumption(sub, h.right, elimB);
+            }
+        }
+        // ¬E: si tenemos ¬A en contexto y la meta es ⊥, intentar probar A.
+        if (goal.kind === 'bottom') {
+            for (const h of context) {
+                if (h.kind === 'not') {
+                    const aProof = search(context, h.arg, ctx);
+                    if (aProof) {
+                        return {
+                            conclusion: (0, formula_1.bottom)(),
+                            rule: 'notE',
+                            premises: [{ conclusion: h, rule: 'assumption', premises: [] }, aProof],
+                        };
+                    }
+                }
+                if (h.kind === 'implies' && h.right.kind === 'bottom') {
+                    const aProof = search(context, h.left, ctx);
+                    if (aProof) {
+                        return {
+                            conclusion: (0, formula_1.bottom)(),
+                            rule: 'impE',
+                            premises: [{ conclusion: h, rule: 'assumption', premises: [] }, aProof],
+                        };
+                    }
+                }
+            }
+        }
+        // 5. Si la meta no es ⊥, derivar ⊥ del contexto y aplicar ⊥E.
+        if (goal.kind !== 'bottom') {
+            const bottomProof = search(context, (0, formula_1.bottom)(), ctx);
+            if (bottomProof) {
+                return { conclusion: goal, rule: 'bottomE', premises: [bottomProof] };
+            }
+        }
+        // 6. CLÁSICA: reductio ad absurdum (rAA). Asume ¬goal, deriva ⊥.
+        //    Sólo si no estamos en modo intuit-only y no es la meta `⊥`
+        //    (donde rAA sería circular: asumir ⊤ y derivar ⊥).
+        if (!ctx.intuitOnly && goal.kind !== 'bottom') {
+            const negGoal = (0, formula_1.not)(goal);
+            // Evitar loop infinito: si ya estamos buscando bajo ¬goal,
+            // no aplicamos rAA otra vez.
+            if (!contextHas(context, negGoal)) {
+                const newCtx = withContext(context, negGoal);
+                const sub = search(newCtx, (0, formula_1.bottom)(), ctx);
+                if (sub) {
+                    return {
+                        conclusion: goal,
+                        rule: 'rAA',
+                        premises: [sub],
+                        discharged: [negGoal],
+                    };
+                }
+            }
+        }
+        return null;
+    };
+    const result = tryProve();
+    ctx.active.delete(key);
+    if (!result)
+        ctx.failed.add(key);
+    return result;
+}
+/**
+ * Reescribe un subárbol que asume `assumption` como hipótesis libre,
+ * sustituyendo cada `assumption`-node por la derivación `derivation`.
+ */
+function substituteAssumption(proof, assumption, derivation) {
+    if (proof.rule === 'assumption' && (0, formula_1.formulaEquals)(proof.conclusion, assumption)) {
+        return derivation;
+    }
+    const dischargedHere = proof.discharged?.some((d) => (0, formula_1.formulaEquals)(d, assumption));
+    if (dischargedHere)
+        return proof;
+    const newPremises = proof.premises.map((p) => substituteAssumption(p, assumption, derivation));
+    return { ...proof, premises: newPremises };
+}
+/**
+ * API pública: prueba clásica.
+ *
+ * Devuelve un árbol NK que demuestra `goal` a partir de las
+ * `premises` dadas, o `null` si no encontró prueba.
+ */
+function proveClassically(premises, goal, options = {}) {
+    const ctx = freshCtx(options.budget ?? 20_000, false);
+    return search(premises.slice(), goal, ctx);
+}
+/**
+ * Variante restringida: intenta probar usando sólo reglas
+ * intuicionistas (NJ). Útil internamente para `nkToNJ`.
+ */
+function proveIntuitOnly(premises, goal, options = {}) {
+    const ctx = freshCtx(options.budget ?? 20_000, true);
+    return search(premises.slice(), goal, ctx);
+}
+// ── Verificación de proofs ──────────────────────────────────
+/**
+ * Verifica recursivamente el árbol NK. Comprueba cada regla
+ * localmente contra su conclusión y contexto.
+ */
+function verifyProof(proof, initialContext = []) {
+    return verifyAt(proof, initialContext);
+}
+function verifyAt(proof, ctx) {
+    const c = proof.conclusion;
+    switch (proof.rule) {
+        case 'assumption':
+            return ctx.some((h) => (0, formula_1.formulaEquals)(h, c));
+        case 'andI': {
+            if (c.kind !== 'and' || proof.premises.length !== 2)
+                return false;
+            const [pa, pb] = proof.premises;
+            if (!pa || !pb)
+                return false;
+            return ((0, formula_1.formulaEquals)(pa.conclusion, c.left) &&
+                (0, formula_1.formulaEquals)(pb.conclusion, c.right) &&
+                verifyAt(pa, ctx) &&
+                verifyAt(pb, ctx));
+        }
+        case 'andEL': {
+            if (proof.premises.length !== 1)
+                return false;
+            const p = proof.premises[0];
+            if (!p || p.conclusion.kind !== 'and')
+                return false;
+            return (0, formula_1.formulaEquals)(p.conclusion.left, c) && verifyAt(p, ctx);
+        }
+        case 'andER': {
+            if (proof.premises.length !== 1)
+                return false;
+            const p = proof.premises[0];
+            if (!p || p.conclusion.kind !== 'and')
+                return false;
+            return (0, formula_1.formulaEquals)(p.conclusion.right, c) && verifyAt(p, ctx);
+        }
+        case 'orIL': {
+            if (c.kind !== 'or' || proof.premises.length !== 1)
+                return false;
+            const p = proof.premises[0];
+            if (!p)
+                return false;
+            return (0, formula_1.formulaEquals)(p.conclusion, c.left) && verifyAt(p, ctx);
+        }
+        case 'orIR': {
+            if (c.kind !== 'or' || proof.premises.length !== 1)
+                return false;
+            const p = proof.premises[0];
+            if (!p)
+                return false;
+            return (0, formula_1.formulaEquals)(p.conclusion, c.right) && verifyAt(p, ctx);
+        }
+        case 'orE': {
+            if (proof.premises.length !== 3)
+                return false;
+            const [maj, l, r] = proof.premises;
+            if (!maj || !l || !r)
+                return false;
+            if (maj.conclusion.kind !== 'or')
+                return false;
+            const A = maj.conclusion.left;
+            const B = maj.conclusion.right;
+            if (!(0, formula_1.formulaEquals)(l.conclusion, c))
+                return false;
+            if (!(0, formula_1.formulaEquals)(r.conclusion, c))
+                return false;
+            return (verifyAt(maj, ctx) && verifyAt(l, withContext(ctx, A)) && verifyAt(r, withContext(ctx, B)));
+        }
+        case 'impI': {
+            if (c.kind !== 'implies' || proof.premises.length !== 1)
+                return false;
+            const p = proof.premises[0];
+            if (!p)
+                return false;
+            return (0, formula_1.formulaEquals)(p.conclusion, c.right) && verifyAt(p, withContext(ctx, c.left));
+        }
+        case 'impE': {
+            if (proof.premises.length !== 2)
+                return false;
+            const [maj, min] = proof.premises;
+            if (!maj || !min)
+                return false;
+            if (maj.conclusion.kind !== 'implies')
+                return false;
+            return ((0, formula_1.formulaEquals)(maj.conclusion.left, min.conclusion) &&
+                (0, formula_1.formulaEquals)(maj.conclusion.right, c) &&
+                verifyAt(maj, ctx) &&
+                verifyAt(min, ctx));
+        }
+        case 'notI': {
+            if (c.kind !== 'not' || proof.premises.length !== 1)
+                return false;
+            const p = proof.premises[0];
+            if (!p)
+                return false;
+            return p.conclusion.kind === 'bottom' && verifyAt(p, withContext(ctx, c.arg));
+        }
+        case 'notE': {
+            if (c.kind !== 'bottom' || proof.premises.length !== 2)
+                return false;
+            const [neg, pos] = proof.premises;
+            if (!neg || !pos)
+                return false;
+            if (neg.conclusion.kind !== 'not')
+                return false;
+            return ((0, formula_1.formulaEquals)(neg.conclusion.arg, pos.conclusion) &&
+                verifyAt(neg, ctx) &&
+                verifyAt(pos, ctx));
+        }
+        case 'bottomE': {
+            if (proof.premises.length !== 1)
+                return false;
+            const p = proof.premises[0];
+            if (!p)
+                return false;
+            return p.conclusion.kind === 'bottom' && verifyAt(p, ctx);
+        }
+        // ── Reglas clásicas ────────────────────────────────────
+        case 'doubleNegE': {
+            // Premisa: ¬¬φ, conclusión: φ.
+            if (proof.premises.length !== 1)
+                return false;
+            const p = proof.premises[0];
+            if (!p)
+                return false;
+            if (p.conclusion.kind !== 'not')
+                return false;
+            const inner = p.conclusion.arg;
+            if (inner.kind !== 'not')
+                return false;
+            return (0, formula_1.formulaEquals)(inner.arg, c) && verifyAt(p, ctx);
+        }
+        case 'LEM': {
+            // Conclusión axiomática: φ ∨ ¬φ. No requiere premisas.
+            if (c.kind !== 'or' || proof.premises.length !== 0)
+                return false;
+            if (c.right.kind !== 'not')
+                return false;
+            return (0, formula_1.formulaEquals)(c.left, c.right.arg);
+        }
+        case 'pierce': {
+            // Conclusión axiomática: ((φ→ψ)→φ)→φ. Sin premisas.
+            if (c.kind !== 'implies' || proof.premises.length !== 0)
+                return false;
+            const inner = c.left; // (φ→ψ)→φ
+            if (inner.kind !== 'implies')
+                return false;
+            const phiPsi = inner.left; // φ→ψ
+            if (phiPsi.kind !== 'implies')
+                return false;
+            // inner.right debe ser φ, c.right debe ser φ, phiPsi.left debe ser φ.
+            return (0, formula_1.formulaEquals)(phiPsi.left, inner.right) && (0, formula_1.formulaEquals)(inner.right, c.right);
+        }
+        case 'rAA': {
+            // Reductio ad absurdum: asume ¬φ, deriva ⊥, concluye φ.
+            // discharged debe ser [¬c]; premisa única deriva ⊥ bajo ¬c.
+            if (proof.premises.length !== 1)
+                return false;
+            const p = proof.premises[0];
+            if (!p)
+                return false;
+            if (p.conclusion.kind !== 'bottom')
+                return false;
+            if (!proof.discharged || proof.discharged.length !== 1)
+                return false;
+            const disch = proof.discharged[0];
+            if (!disch || disch.kind !== 'not')
+                return false;
+            if (!(0, formula_1.formulaEquals)(disch.arg, c))
+                return false;
+            return verifyAt(p, withContext(ctx, disch));
+        }
+    }
+}
+// ── Pruebas estándar de teoremas clásicos ────────────────────
+/**
+ * Devuelve una prueba NK de la ley de Peirce: ((P→Q)→P)→P.
+ */
+function provedPeirce() {
+    const P = (0, formula_1.atom)('P');
+    const Q = (0, formula_1.atom)('Q');
+    const proof = proveClassically([], (0, formula_1.implies)((0, formula_1.implies)((0, formula_1.implies)(P, Q), P), P));
+    if (!proof) {
+        // Fallback: regla axiomática directa.
+        return {
+            conclusion: (0, formula_1.implies)((0, formula_1.implies)((0, formula_1.implies)(P, Q), P), P),
+            rule: 'pierce',
+            premises: [],
+        };
+    }
+    return proof;
+}
+/**
+ * Devuelve una prueba NK de la eliminación de doble negación: ¬¬P → P.
+ */
+function provedDNE() {
+    const P = (0, formula_1.atom)('P');
+    const proof = proveClassically([], (0, formula_1.implies)((0, formula_1.not)((0, formula_1.not)(P)), P));
+    if (proof)
+        return proof;
+    // Fallback: construir manualmente usando doubleNegE.
+    const dneAxiom = {
+        conclusion: P,
+        rule: 'doubleNegE',
+        premises: [{ conclusion: (0, formula_1.not)((0, formula_1.not)(P)), rule: 'assumption', premises: [] }],
+    };
+    return {
+        conclusion: (0, formula_1.implies)((0, formula_1.not)((0, formula_1.not)(P)), P),
+        rule: 'impI',
+        premises: [dneAxiom],
+        discharged: [(0, formula_1.not)((0, formula_1.not)(P))],
+    };
+}
+/**
+ * Devuelve una prueba NK del tercero excluido: P ∨ ¬P.
+ */
+function provedLEM() {
+    const P = (0, formula_1.atom)('P');
+    const proof = proveClassically([], (0, formula_1.or)(P, (0, formula_1.not)(P)));
+    if (proof)
+        return proof;
+    // Fallback axiomático.
+    return {
+        conclusion: (0, formula_1.or)(P, (0, formula_1.not)(P)),
+        rule: 'LEM',
+        premises: [],
+    };
+}
+// ── Traducción NK → NJ ────────────────────────────────────────
+/**
+ * Indica si una prueba NK puede traducirse a NJ sin pérdida.
+ * Si contiene alguna regla puramente clásica, la traducción
+ * falla con `reason`. Si es puramente intuicionista, se
+ * devuelve la prueba intacta (cast estructural a NJProof).
+ *
+ * No intentamos la traducción de Glivenko ni doble-negación
+ * uniforme aquí: el objetivo es detectar si la prueba ya está
+ * en el fragmento intuicionista.
+ */
+function nkToNJ(proof) {
+    const classicalRules = collectClassicalRules(proof);
+    if (classicalRules.length === 0) {
+        return { converted: proof };
+    }
+    return {
+        reason: `La prueba usa reglas clásicas no traducibles directamente a NJ: ${classicalRules.join(', ')}.`,
+    };
+}
+function collectClassicalRules(proof, out = new Set()) {
+    if (types_1.CLASSICAL_ONLY_RULES.includes(proof.rule))
+        out.add(proof.rule);
+    for (const p of proof.premises)
+        collectClassicalRules(p, out);
+    return Array.from(out);
+}
+//# sourceMappingURL=prover.js.map

package/dist/logic/profiles/natural-deduction-nk/prover.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"prover.js","sourceRoot":"","sources":["../../../../src/logic/profiles/natural-deduction-nk/prover.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,2DAA2D;AAC3D,+DAA+D;AAC/D,EAAE;AACF,gEAAgE;AAChE,6DAA6D;AAC7D,6DAA6D;AAC7D,8BAA8B;AAC9B,EAAE;AACF,0BAA0B;AAC1B,wCAAwC;AACxC,gEAAgE;AAChE,+DAA+D;AAC/D,sCAAsC;AACtC,yDAAyD;AACzD,wCAAwC;AACxC,EAAE;AACF,gEAAgE;AAChE,+DAA+D;AAC/D,uCAAuC;;AAsRvC,4CAOC;AAMD,0CAOC;AAQD,kCAEC;AA0JD,oCAaC;AAKD,8BAgBC;AAKD,8BAUC;AAcD,wBAUC;AArhBD,mCAA2E;AAC3E,uCAAsF;AAWtF,SAAS,QAAQ,CAAC,MAAc,EAAE,UAAU,GAAG,KAAK;IAClD,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC,EAAE,MAAM,EAAE,IAAI,GAAG,EAAE,EAAE,MAAM,EAAE,IAAI,GAAG,EAAE,EAAE,UAAU,EAAE,CAAC;AAC/E,CAAC;AAED,SAAS,SAAS,CAAC,GAAc;IAC/B,OAAO,GAAG,CAAC,IAAI,IAAI,GAAG,CAAC,MAAM,CAAC;AAChC,CAAC;AAED,SAAS,OAAO,CAAC,OAAoB,EAAE,IAAe,EAAE,gBAAyB;IAC/E,MAAM,MAAM,GAAG,OAAO,CAAC,GAAG,CAAC,oBAAU,CAAC,CAAC,IAAI,EAAE,CAAC;IAC9C,OAAO,GAAG,gBAAgB,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,IAAI,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,IAAA,oBAAU,EAAC,IAAI,CAAC,EAAE,CAAC;AACpF,CAAC;AAED,SAAS,UAAU,CAAC,OAAoB,EAAE,CAAY;IACpD,KAAK,MAAM,CAAC,IAAI,OAAO;QAAE,IAAI,IAAA,uBAAa,EAAC,CAAC,EAAE,CAAC,CAAC;YAAE,OAAO,IAAI,CAAC;IAC9D,OAAO,KAAK,CAAC;AACf,CAAC;AAED,SAAS,WAAW,CAAC,OAAoB,EAAE,CAAY;IACrD,IAAI,UAAU,CAAC,OAAO,EAAE,CAAC,CAAC;QAAE,OAAO,OAAO,CAAC;IAC3C,OAAO,CAAC,GAAG,OAAO,EAAE,CAAC,CAAC,CAAC;AACzB,CAAC;AAED;;;GAGG;AACH,SAAS,MAAM,CAAC,OAAoB,EAAE,IAAe,EAAE,GAAc;IACnE,GAAG,CAAC,IAAI,EAAE,CAAC;IACX,IAAI,SAAS,CAAC,GAAG,CAAC;QAAE,OAAO,IAAI,CAAC;IAEhC,MAAM,GAAG,GAAG,OAAO,CAAC,OAAO,EAAE,IAAI,EAAE,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;IACpD,IAAI,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC;QAAE,OAAO,IAAI,CAAC;IACrC,IAAI,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC;QAAE,OAAO,IAAI,CAAC;IACrC,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IAEpB,MAAM,QAAQ,GAAG,GAAmB,EAAE;QACpC,wBAAwB;QACxB,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;YACxB,IAAI,IAAA,uBAAa,EAAC,CAAC,EAAE,IAAI,CAAC,EAAE,CAAC;gBAC3B,OAAO,EAAE,UAAU,EAAE,IAAI,EAAE,IAAI,EAAE,YAAY,EAAE,QAAQ,EAAE,EAAE,EAAE,CAAC;YAChE,CAAC;QACH,CAAC;QAED,8DAA8D;QAC9D,iCAAiC;QAEjC,IAAI,IAAI,CAAC,IAAI,KAAK,KAAK,EAAE,CAAC;YACxB,MAAM,IAAI,GAAG,MAAM,CAAC,OAAO,EAAE,IAAI,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;YAC7C,IAAI,CAAC,IAAI;gBAAE,OAAO,IAAI,CAAC;YACvB,MAAM,KAAK,GAAG,MAAM,CAAC,OAAO,EAAE,IAAI,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;YAC/C,IAAI,CAAC,KAAK;gBAAE,OAAO,IAAI,CAAC;YACxB,OAAO,EAAE,UAAU,EAAE,IAAI,EAAE,IAAI,EAAE,MAAM,EAAE,QAAQ,EAAE,CAAC,IAAI,EAAE,KAAK,CAAC,EAAE,CAAC;QACrE,CAAC;QAED,IAAI,IAAI,CAAC,IAAI,KAAK,SAAS,EAAE,CAAC;YAC5B,MAAM,MAAM,GAAG,WAAW,CAAC,OAAO,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;YAC/C,MAAM,IAAI,GAAG,MAAM,CAAC,MAAM,EAAE,IAAI,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;YAC7C,IAAI,CAAC,IAAI;gBAAE,OAAO,IAAI,CAAC;YACvB,OAAO;gBACL,UAAU,EAAE,IAAI;gBAChB,IAAI,EAAE,MAAM;gBACZ,QAAQ,EAAE,CAAC,IAAI,CAAC;gBAChB,UAAU,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC;aACxB,CAAC;QACJ,CAAC;QAED,IAAI,IAAI,CAAC,IAAI,KAAK,KAAK,EAAE,CAAC;YACxB,MAAM,MAAM,GAAG,WAAW,CAAC,OAAO,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC;YAC9C,MAAM,IAAI,GAAG,MAAM,CAAC,MAAM,EAAE,IAAA,gBAAM,GAAE,EAAE,GAAG,CAAC,CAAC;YAC3C,IAAI,CAAC,IAAI;gBAAE,OAAO,IAAI,CAAC;YACvB,OAAO;gBACL,UAAU,EAAE,IAAI;gBAChB,IAAI,EAAE,MAAM;gBACZ,QAAQ,EAAE,CAAC,IAAI,CAAC;gBAChB,UAAU,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC;aACvB,CAAC;QACJ,CAAC;QAED,4DAA4D;QAE5D,0DAA0D;QAC1D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACxC,MAAM,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;YACrB,IAAI,CAAC,IAAI,CAAC,CAAC,IAAI,KAAK,KAAK,EAAE,CAAC;gBAC1B,MAAM,IAAI,GAAG,CAAC,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;gBAC/D,MAAM,QAAQ,GAAG,WAAW,CAAC,WAAW,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC;gBACjE,MAAM,GAAG,GAAG,MAAM,CAAC,QAAQ,EAAE,IAAI,EAAE,GAAG,CAAC,CAAC;gBACxC,IAAI,CAAC,GAAG;oBAAE,OAAO,IAAI,CAAC;gBACtB,MAAM,KAAK,GAAY;oBACrB,UAAU,EAAE,CAAC,CAAC,IAAI;oBAClB,IAAI,EAAE,OAAO;oBACb,QAAQ,EAAE,CAAC,EAAE,UAAU,EAAE,CAAC,EAAE,IAAI,EAAE,YAAY,EAAE,QAAQ,EAAE,EAAE,EAAE,CAAC;iBAChE,CAAC;gBACF,MAAM,KAAK,GAAY;oBACrB,UAAU,EAAE,CAAC,CAAC,KAAK;oBACnB,IAAI,EAAE,OAAO;oBACb,QAAQ,EAAE,CAAC,EAAE,UAAU,EAAE,CAAC,EAAE,IAAI,EAAE,YAAY,EAAE,QAAQ,EAAE,EAAE,EAAE,CAAC;iBAChE,CAAC;gBACF,MAAM,KAAK,GAAG,oBAAoB,CAAC,GAAG,EAAE,CAAC,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;gBACvD,OAAO,oBAAoB,CAAC,KAAK,EAAE,CAAC,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;YACrD,CAAC;QACH,CAAC;QAED,gEAAgE;QAChE,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;YACxB,IAAI,CAAC,CAAC,IAAI,KAAK,QAAQ,EAAE,CAAC;gBACxB,OAAO;oBACL,UAAU,EAAE,IAAI;oBAChB,IAAI,EAAE,SAAS;oBACf,QAAQ,EAAE,CAAC,EAAE,UAAU,EAAE,CAAC,EAAE,IAAI,EAAE,YAAY,EAAE,QAAQ,EAAE,EAAE,EAAE,CAAC;iBAChE,CAAC;YACJ,CAAC;QACH,CAAC;QAED,gEAAgE;QAChE,qDAAqD;QACrD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACxC,MAAM,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;YACrB,IAAI,CAAC,IAAI,CAAC,CAAC,IAAI,KAAK,IAAI,EAAE,CAAC;gBACzB,MAAM,IAAI,GAAG,CAAC,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;gBAC/D,MAAM,OAAO,GAAG,WAAW,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC;gBAC1C,MAAM,QAAQ,GAAG,WAAW,CAAC,IAAI,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC;gBAC5C,MAAM,OAAO,GAAG,MAAM,CAAC,OAAO,EAAE,IAAI,EAAE,GAAG,CAAC,CAAC;gBAC3C,IAAI,CAAC,OAAO;oBAAE,SAAS;gBACvB,MAAM,QAAQ,GAAG,MAAM,CAAC,QAAQ,EAAE,IAAI,EAAE,GAAG,CAAC,CAAC;gBAC7C,IAAI,CAAC,QAAQ;oBAAE,SAAS;gBACxB,OAAO;oBACL,UAAU,EAAE,IAAI;oBAChB,IAAI,EAAE,KAAK;oBACX,QAAQ,EAAE,CAAC,EAAE,UAAU,EAAE,CAAC,EAAE,IAAI,EAAE,YAAY,EAAE,QAAQ,EAAE,EAAE,EAAE,EAAE,OAAO,EAAE,QAAQ,CAAC;oBAClF,UAAU,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,KAAK,CAAC;iBAC9B,CAAC;YACJ,CAAC;QACH,CAAC;QAED,+CAA+C;QAE/C,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI,EAAE,CAAC;YACvB,MAAM,WAAW,GAAG,MAAM,CAAC,OAAO,EAAE,IAAI,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;YACpD,IAAI,WAAW,EAAE,CAAC;gBAChB,OAAO,EAAE,UAAU,EAAE,IAAI,EAAE,IAAI,EAAE,MAAM,EAAE,QAAQ,EAAE,CAAC,WAAW,CAAC,EAAE,CAAC;YACrE,CAAC;YACD,MAAM,YAAY,GAAG,MAAM,CAAC,OAAO,EAAE,IAAI,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;YACtD,IAAI,YAAY,EAAE,CAAC;gBACjB,OAAO,EAAE,UAAU,EAAE,IAAI,EAAE,IAAI,EAAE,MAAM,EAAE,QAAQ,EAAE,CAAC,YAAY,CAAC,EAAE,CAAC;YACtE,CAAC;YACD,4DAA4D;YAC5D,0DAA0D;YAC1D,8BAA8B;QAChC,CAAC;QAED,iCAAiC;QACjC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACxC,MAAM,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;YACrB,IAAI,CAAC,IAAI,CAAC,CAAC,IAAI,KAAK,SAAS,EAAE,CAAC;gBAC9B,MAAM,MAAM,GAAG,MAAM,CAAC,OAAO,EAAE,CAAC,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;gBAC5C,IAAI,CAAC,MAAM;oBAAE,SAAS;gBAEtB,IAAI,IAAA,uBAAa,EAAC,CAAC,CAAC,KAAK,EAAE,IAAI,CAAC,EAAE,CAAC;oBACjC,OAAO;wBACL,UAAU,EAAE,IAAI;wBAChB,IAAI,EAAE,MAAM;wBACZ,QAAQ,EAAE,CAAC,EAAE,UAAU,EAAE,CAAC,EAAE,IAAI,EAAE,YAAY,EAAE,QAAQ,EAAE,EAAE,EAAE,EAAE,MAAM,CAAC;qBACxE,CAAC;gBACJ,CAAC;gBAED,MAAM,IAAI,GAAG,CAAC,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;gBAC/D,MAAM,QAAQ,GAAG,WAAW,CAAC,IAAI,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC;gBAC5C,MAAM,GAAG,GAAG,MAAM,CAAC,QAAQ,EAAE,IAAI,EAAE,GAAG,CAAC,CAAC;gBACxC,IAAI,CAAC,GAAG;oBAAE,SAAS;gBACnB,MAAM,KAAK,GAAY;oBACrB,UAAU,EAAE,CAAC,CAAC,KAAK;oBACnB,IAAI,EAAE,MAAM;oBACZ,QAAQ,EAAE,CAAC,EAAE,UAAU,EAAE,CAAC,EAAE,IAAI,EAAE,YAAY,EAAE,QAAQ,EAAE,EAAE,EAAE,EAAE,MAAM,CAAC;iBACxE,CAAC;gBACF,OAAO,oBAAoB,CAAC,GAAG,EAAE,CAAC,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;YACnD,CAAC;QACH,CAAC;QAED,mEAAmE;QACnE,IAAI,IAAI,CAAC,IAAI,KAAK,QAAQ,EAAE,CAAC;YAC3B,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;gBACxB,IAAI,CAAC,CAAC,IAAI,KAAK,KAAK,EAAE,CAAC;oBACrB,MAAM,MAAM,GAAG,MAAM,CAAC,OAAO,EAAE,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;oBAC3C,IAAI,MAAM,EAAE,CAAC;wBACX,OAAO;4BACL,UAAU,EAAE,IAAA,gBAAM,GAAE;4BACpB,IAAI,EAAE,MAAM;4BACZ,QAAQ,EAAE,CAAC,EAAE,UAAU,EAAE,CAAC,EAAE,IAAI,EAAE,YAAY,EAAE,QAAQ,EAAE,EAAE,EAAE,EAAE,MAAM,CAAC;yBACxE,CAAC;oBACJ,CAAC;gBACH,CAAC;gBACD,IAAI,CAAC,CAAC,IAAI,KAAK,SAAS,IAAI,CAAC,CAAC,KAAK,CAAC,IAAI,KAAK,QAAQ,EAAE,CAAC;oBACtD,MAAM,MAAM,GAAG,MAAM,CAAC,OAAO,EAAE,CAAC,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;oBAC5C,IAAI,MAAM,EAAE,CAAC;wBACX,OAAO;4BACL,UAAU,EAAE,IAAA,gBAAM,GAAE;4BACpB,IAAI,EAAE,MAAM;4BACZ,QAAQ,EAAE,CAAC,EAAE,UAAU,EAAE,CAAC,EAAE,IAAI,EAAE,YAAY,EAAE,QAAQ,EAAE,EAAE,EAAE,EAAE,MAAM,CAAC;yBACxE,CAAC;oBACJ,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QAED,8DAA8D;QAC9D,IAAI,IAAI,CAAC,IAAI,KAAK,QAAQ,EAAE,CAAC;YAC3B,MAAM,WAAW,GAAG,MAAM,CAAC,OAAO,EAAE,IAAA,gBAAM,GAAE,EAAE,GAAG,CAAC,CAAC;YACnD,IAAI,WAAW,EAAE,CAAC;gBAChB,OAAO,EAAE,UAAU,EAAE,IAAI,EAAE,IAAI,EAAE,SAAS,EAAE,QAAQ,EAAE,CAAC,WAAW,CAAC,EAAE,CAAC;YACxE,CAAC;QACH,CAAC;QAED,iEAAiE;QACjE,gEAAgE;QAChE,uDAAuD;QACvD,IAAI,CAAC,GAAG,CAAC,UAAU,IAAI,IAAI,CAAC,IAAI,KAAK,QAAQ,EAAE,CAAC;YAC9C,MAAM,OAAO,GAAG,IAAA,aAAG,EAAC,IAAI,CAAC,CAAC;YAC1B,2DAA2D;YAC3D,6BAA6B;YAC7B,IAAI,CAAC,UAAU,CAAC,OAAO,EAAE,OAAO,CAAC,EAAE,CAAC;gBAClC,MAAM,MAAM,GAAG,WAAW,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;gBAC7C,MAAM,GAAG,GAAG,MAAM,CAAC,MAAM,EAAE,IAAA,gBAAM,GAAE,EAAE,GAAG,CAAC,CAAC;gBAC1C,IAAI,GAAG,EAAE,CAAC;oBACR,OAAO;wBACL,UAAU,EAAE,IAAI;wBAChB,IAAI,EAAE,KAAK;wBACX,QAAQ,EAAE,CAAC,GAAG,CAAC;wBACf,UAAU,EAAE,CAAC,OAAO,CAAC;qBACtB,CAAC;gBACJ,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO,IAAI,CAAC;IACd,CAAC,CAAC;IAEF,MAAM,MAAM,GAAG,QAAQ,EAAE,CAAC;IAC1B,GAAG,CAAC,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;IACvB,IAAI,CAAC,MAAM;QAAE,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IACjC,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;;GAGG;AACH,SAAS,oBAAoB,CAAC,KAAc,EAAE,UAAqB,EAAE,UAAmB;IACtF,IAAI,KAAK,CAAC,IAAI,KAAK,YAAY,IAAI,IAAA,uBAAa,EAAC,KAAK,CAAC,UAAU,EAAE,UAAU,CAAC,EAAE,CAAC;QAC/E,OAAO,UAAU,CAAC;IACpB,CAAC;IACD,MAAM,cAAc,GAAG,KAAK,CAAC,UAAU,EAAE,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAA,uBAAa,EAAC,CAAC,EAAE,UAAU,CAAC,CAAC,CAAC;IACnF,IAAI,cAAc;QAAE,OAAO,KAAK,CAAC;IACjC,MAAM,WAAW,GAAG,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,oBAAoB,CAAC,CAAC,EAAE,UAAU,EAAE,UAAU,CAAC,CAAC,CAAC;IAC/F,OAAO,EAAE,GAAG,KAAK,EAAE,QAAQ,EAAE,WAAW,EAAE,CAAC;AAC7C,CAAC;AAED;;;;;GAKG;AACH,SAAgB,gBAAgB,CAC9B,QAAqB,EACrB,IAAe,EACf,UAA+B,EAAE;IAEjC,MAAM,GAAG,GAAG,QAAQ,CAAC,OAAO,CAAC,MAAM,IAAI,MAAM,EAAE,KAAK,CAAC,CAAC;IACtD,OAAO,MAAM,CAAC,QAAQ,CAAC,KAAK,EAAE,EAAE,IAAI,EAAE,GAAG,CAAC,CAAC;AAC7C,CAAC;AAED;;;GAGG;AACH,SAAgB,eAAe,CAC7B,QAAqB,EACrB,IAAe,EACf,UAA+B,EAAE;IAEjC,MAAM,GAAG,GAAG,QAAQ,CAAC,OAAO,CAAC,MAAM,IAAI,MAAM,EAAE,IAAI,CAAC,CAAC;IACrD,OAAO,MAAM,CAAC,QAAQ,CAAC,KAAK,EAAE,EAAE,IAAI,EAAE,GAAG,CAAC,CAAC;AAC7C,CAAC;AAED,+DAA+D;AAE/D;;;GAGG;AACH,SAAgB,WAAW,CAAC,KAAc,EAAE,iBAA8B,EAAE;IAC1E,OAAO,QAAQ,CAAC,KAAK,EAAE,cAAc,CAAC,CAAC;AACzC,CAAC;AAED,SAAS,QAAQ,CAAC,KAAc,EAAE,GAAgB;IAChD,MAAM,CAAC,GAAG,KAAK,CAAC,UAAU,CAAC;IAC3B,QAAQ,KAAK,CAAC,IAAI,EAAE,CAAC;QACnB,KAAK,YAAY;YACf,OAAO,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAA,uBAAa,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAE9C,KAAK,MAAM,CAAC,CAAC,CAAC;YACZ,IAAI,CAAC,CAAC,IAAI,KAAK,KAAK,IAAI,KAAK,CAAC,QAAQ,CAAC,MAAM,KAAK,CAAC;gBAAE,OAAO,KAAK,CAAC;YAClE,MAAM,CAAC,EAAE,EAAE,EAAE,CAAC,GAAG,KAAK,CAAC,QAAQ,CAAC;YAChC,IAAI,CAAC,EAAE,IAAI,CAAC,EAAE;gBAAE,OAAO,KAAK,CAAC;YAC7B,OAAO,CACL,IAAA,uBAAa,EAAC,EAAE,CAAC,UAAU,EAAE,CAAC,CAAC,IAAI,CAAC;gBACpC,IAAA,uBAAa,EAAC,EAAE,CAAC,UAAU,EAAE,CAAC,CAAC,KAAK,CAAC;gBACrC,QAAQ,CAAC,EAAE,EAAE,GAAG,CAAC;gBACjB,QAAQ,CAAC,EAAE,EAAE,GAAG,CAAC,CAClB,CAAC;QACJ,CAAC;QACD,KAAK,OAAO,CAAC,CAAC,CAAC;YACb,IAAI,KAAK,CAAC,QAAQ,CAAC,MAAM,KAAK,CAAC;gBAAE,OAAO,KAAK,CAAC;YAC9C,MAAM,CAAC,GAAG,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;YAC5B,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,UAAU,CAAC,IAAI,KAAK,KAAK;gBAAE,OAAO,KAAK,CAAC;YACpD,OAAO,IAAA,uBAAa,EAAC,CAAC,CAAC,UAAU,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,QAAQ,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;QACjE,CAAC;QACD,KAAK,OAAO,CAAC,CAAC,CAAC;YACb,IAAI,KAAK,CAAC,QAAQ,CAAC,MAAM,KAAK,CAAC;gBAAE,OAAO,KAAK,CAAC;YAC9C,MAAM,CAAC,GAAG,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;YAC5B,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,UAAU,CAAC,IAAI,KAAK,KAAK;gBAAE,OAAO,KAAK,CAAC;YACpD,OAAO,IAAA,uBAAa,EAAC,CAAC,CAAC,UAAU,CAAC,KAAK,EAAE,CAAC,CAAC,IAAI,QAAQ,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;QAClE,CAAC;QAED,KAAK,MAAM,CAAC,CAAC,CAAC;YACZ,IAAI,CAAC,CAAC,IAAI,KAAK,IAAI,IAAI,KAAK,CAAC,QAAQ,CAAC,MAAM,KAAK,CAAC;gBAAE,OAAO,KAAK,CAAC;YACjE,MAAM,CAAC,GAAG,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;YAC5B,IAAI,CAAC,CAAC;gBAAE,OAAO,KAAK,CAAC;YACrB,OAAO,IAAA,uBAAa,EAAC,CAAC,CAAC,UAAU,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,QAAQ,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;QACjE,CAAC;QACD,KAAK,MAAM,CAAC,CAAC,CAAC;YACZ,IAAI,CAAC,CAAC,IAAI,KAAK,IAAI,IAAI,KAAK,CAAC,QAAQ,CAAC,MAAM,KAAK,CAAC;gBAAE,OAAO,KAAK,CAAC;YACjE,MAAM,CAAC,GAAG,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;YAC5B,IAAI,CAAC,CAAC;gBAAE,OAAO,KAAK,CAAC;YACrB,OAAO,IAAA,uBAAa,EAAC,CAAC,CAAC,UAAU,EAAE,CAAC,CAAC,KAAK,CAAC,IAAI,QAAQ,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;QAClE,CAAC;QACD,KAAK,KAAK,CAAC,CAAC,CAAC;YACX,IAAI,KAAK,CAAC,QAAQ,CAAC,MAAM,KAAK,CAAC;gBAAE,OAAO,KAAK,CAAC;YAC9C,MAAM,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC,GAAG,KAAK,CAAC,QAAQ,CAAC;YACnC,IAAI,CAAC,GAAG,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC;gBAAE,OAAO,KAAK,CAAC;YACnC,IAAI,GAAG,CAAC,UAAU,CAAC,IAAI,KAAK,IAAI;gBAAE,OAAO,KAAK,CAAC;YAC/C,MAAM,CAAC,GAAG,GAAG,CAAC,UAAU,CAAC,IAAI,CAAC;YAC9B,MAAM,CAAC,GAAG,GAAG,CAAC,UAAU,CAAC,KAAK,CAAC;YAC/B,IAAI,CAAC,IAAA,uBAAa,EAAC,CAAC,CAAC,UAAU,EAAE,CAAC,CAAC;gBAAE,OAAO,KAAK,CAAC;YAClD,IAAI,CAAC,IAAA,uBAAa,EAAC,CAAC,CAAC,UAAU,EAAE,CAAC,CAAC;gBAAE,OAAO,KAAK,CAAC;YAClD,OAAO,CACL,QAAQ,CAAC,GAAG,EAAE,GAAG,CAAC,IAAI,QAAQ,CAAC,CAAC,EAAE,WAAW,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,IAAI,QAAQ,CAAC,CAAC,EAAE,WAAW,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAC3F,CAAC;QACJ,CAAC;QAED,KAAK,MAAM,CAAC,CAAC,CAAC;YACZ,IAAI,CAAC,CAAC,IAAI,KAAK,SAAS,IAAI,KAAK,CAAC,QAAQ,CAAC,MAAM,KAAK,CAAC;gBAAE,OAAO,KAAK,CAAC;YACtE,MAAM,CAAC,GAAG,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;YAC5B,IAAI,CAAC,CAAC;gBAAE,OAAO,KAAK,CAAC;YACrB,OAAO,IAAA,uBAAa,EAAC,CAAC,CAAC,UAAU,EAAE,CAAC,CAAC,KAAK,CAAC,IAAI,QAAQ,CAAC,CAAC,EAAE,WAAW,CAAC,GAAG,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;QACvF,CAAC;QACD,KAAK,MAAM,CAAC,CAAC,CAAC;YACZ,IAAI,KAAK,CAAC,QAAQ,CAAC,MAAM,KAAK,CAAC;gBAAE,OAAO,KAAK,CAAC;YAC9C,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,GAAG,KAAK,CAAC,QAAQ,CAAC;YAClC,IAAI,CAAC,GAAG,IAAI,CAAC,GAAG;gBAAE,OAAO,KAAK,CAAC;YAC/B,IAAI,GAAG,CAAC,UAAU,CAAC,IAAI,KAAK,SAAS;gBAAE,OAAO,KAAK,CAAC;YACpD,OAAO,CACL,IAAA,uBAAa,EAAC,GAAG,CAAC,UAAU,CAAC,IAAI,EAAE,GAAG,CAAC,UAAU,CAAC;gBAClD,IAAA,uBAAa,EAAC,GAAG,CAAC,UAAU,CAAC,KAAK,EAAE,CAAC,CAAC;gBACtC,QAAQ,CAAC,GAAG,EAAE,GAAG,CAAC;gBAClB,QAAQ,CAAC,GAAG,EAAE,GAAG,CAAC,CACnB,CAAC;QACJ,CAAC;QAED,KAAK,MAAM,CAAC,CAAC,CAAC;YACZ,IAAI,CAAC,CAAC,IAAI,KAAK,KAAK,IAAI,KAAK,CAAC,QAAQ,CAAC,MAAM,KAAK,CAAC;gBAAE,OAAO,KAAK,CAAC;YAClE,MAAM,CAAC,GAAG,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;YAC5B,IAAI,CAAC,CAAC;gBAAE,OAAO,KAAK,CAAC;YACrB,OAAO,CAAC,CAAC,UAAU,CAAC,IAAI,KAAK,QAAQ,IAAI,QAAQ,CAAC,CAAC,EAAE,WAAW,CAAC,GAAG,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAChF,CAAC;QACD,KAAK,MAAM,CAAC,CAAC,CAAC;YACZ,IAAI,CAAC,CAAC,IAAI,KAAK,QAAQ,IAAI,KAAK,CAAC,QAAQ,CAAC,MAAM,KAAK,CAAC;gBAAE,OAAO,KAAK,CAAC;YACrE,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,GAAG,KAAK,CAAC,QAAQ,CAAC;YAClC,IAAI,CAAC,GAAG,IAAI,CAAC,GAAG;gBAAE,OAAO,KAAK,CAAC;YAC/B,IAAI,GAAG,CAAC,UAAU,CAAC,IAAI,KAAK,KAAK;gBAAE,OAAO,KAAK,CAAC;YAChD,OAAO,CACL,IAAA,uBAAa,EAAC,GAAG,CAAC,UAAU,CAAC,GAAG,EAAE,GAAG,CAAC,UAAU,CAAC;gBACjD,QAAQ,CAAC,GAAG,EAAE,GAAG,CAAC;gBAClB,QAAQ,CAAC,GAAG,EAAE,GAAG,CAAC,CACnB,CAAC;QACJ,CAAC;QAED,KAAK,SAAS,CAAC,CAAC,CAAC;YACf,IAAI,KAAK,CAAC,QAAQ,CAAC,MAAM,KAAK,CAAC;gBAAE,OAAO,KAAK,CAAC;YAC9C,MAAM,CAAC,GAAG,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;YAC5B,IAAI,CAAC,CAAC;gBAAE,OAAO,KAAK,CAAC;YACrB,OAAO,CAAC,CAAC,UAAU,CAAC,IAAI,KAAK,QAAQ,IAAI,QAAQ,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;QAC5D,CAAC;QAED,0DAA0D;QAE1D,KAAK,YAAY,CAAC,CAAC,CAAC;YAClB,+BAA+B;YAC/B,IAAI,KAAK,CAAC,QAAQ,CAAC,MAAM,KAAK,CAAC;gBAAE,OAAO,KAAK,CAAC;YAC9C,MAAM,CAAC,GAAG,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;YAC5B,IAAI,CAAC,CAAC;gBAAE,OAAO,KAAK,CAAC;YACrB,IAAI,CAAC,CAAC,UAAU,CAAC,IAAI,KAAK,KAAK;gBAAE,OAAO,KAAK,CAAC;YAC9C,MAAM,KAAK,GAAG,CAAC,CAAC,UAAU,CAAC,GAAG,CAAC;YAC/B,IAAI,KAAK,CAAC,IAAI,KAAK,KAAK;gBAAE,OAAO,KAAK,CAAC;YACvC,OAAO,IAAA,uBAAa,EAAC,KAAK,CAAC,GAAG,EAAE,CAAC,CAAC,IAAI,QAAQ,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;QACzD,CAAC;QAED,KAAK,KAAK,CAAC,CAAC,CAAC;YACX,uDAAuD;YACvD,IAAI,CAAC,CAAC,IAAI,KAAK,IAAI,IAAI,KAAK,CAAC,QAAQ,CAAC,MAAM,KAAK,CAAC;gBAAE,OAAO,KAAK,CAAC;YACjE,IAAI,CAAC,CAAC,KAAK,CAAC,IAAI,KAAK,KAAK;gBAAE,OAAO,KAAK,CAAC;YACzC,OAAO,IAAA,uBAAa,EAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;QAC5C,CAAC;QAED,KAAK,QAAQ,CAAC,CAAC,CAAC;YACd,oDAAoD;YACpD,IAAI,CAAC,CAAC,IAAI,KAAK,SAAS,IAAI,KAAK,CAAC,QAAQ,CAAC,MAAM,KAAK,CAAC;gBAAE,OAAO,KAAK,CAAC;YACtE,MAAM,KAAK,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,UAAU;YAChC,IAAI,KAAK,CAAC,IAAI,KAAK,SAAS;gBAAE,OAAO,KAAK,CAAC;YAC3C,MAAM,MAAM,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC,MAAM;YACjC,IAAI,MAAM,CAAC,IAAI,KAAK,SAAS;gBAAE,OAAO,KAAK,CAAC;YAC5C,sEAAsE;YACtE,OAAO,IAAA,uBAAa,EAAC,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,KAAK,CAAC,IAAI,IAAA,uBAAa,EAAC,KAAK,CAAC,KAAK,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC;QACxF,CAAC;QAED,KAAK,KAAK,CAAC,CAAC,CAAC;YACX,wDAAwD;YACxD,4DAA4D;YAC5D,IAAI,KAAK,CAAC,QAAQ,CAAC,MAAM,KAAK,CAAC;gBAAE,OAAO,KAAK,CAAC;YAC9C,MAAM,CAAC,GAAG,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;YAC5B,IAAI,CAAC,CAAC;gBAAE,OAAO,KAAK,CAAC;YACrB,IAAI,CAAC,CAAC,UAAU,CAAC,IAAI,KAAK,QAAQ;gBAAE,OAAO,KAAK,CAAC;YACjD,IAAI,CAAC,KAAK,CAAC,UAAU,IAAI,KAAK,CAAC,UAAU,CAAC,MAAM,KAAK,CAAC;gBAAE,OAAO,KAAK,CAAC;YACrE,MAAM,KAAK,GAAG,KAAK,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;YAClC,IAAI,CAAC,KAAK,IAAI,KAAK,CAAC,IAAI,KAAK,KAAK;gBAAE,OAAO,KAAK,CAAC;YACjD,IAAI,CAAC,IAAA,uBAAa,EAAC,KAAK,CAAC,GAAG,EAAE,CAAC,CAAC;gBAAE,OAAO,KAAK,CAAC;YAC/C,OAAO,QAAQ,CAAC,CAAC,EAAE,WAAW,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC,CAAC;QAC9C,CAAC;IACH,CAAC;AACH,CAAC;AAED,gEAAgE;AAEhE;;GAEG;AACH,SAAgB,YAAY;IAC1B,MAAM,CAAC,GAAG,IAAA,cAAI,EAAC,GAAG,CAAC,CAAC;IACpB,MAAM,CAAC,GAAG,IAAA,cAAI,EAAC,GAAG,CAAC,CAAC;IACpB,MAAM,KAAK,GAAG,gBAAgB,CAAC,EAAE,EAAE,IAAA,iBAAO,EAAC,IAAA,iBAAO,EAAC,IAAA,iBAAO,EAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IAC1E,IAAI,CAAC,KAAK,EAAE,CAAC;QACX,sCAAsC;QACtC,OAAO;YACL,UAAU,EAAE,IAAA,iBAAO,EAAC,IAAA,iBAAO,EAAC,IAAA,iBAAO,EAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC;YACjD,IAAI,EAAE,QAAQ;YACd,QAAQ,EAAE,EAAE;SACb,CAAC;IACJ,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;GAEG;AACH,SAAgB,SAAS;IACvB,MAAM,CAAC,GAAG,IAAA,cAAI,EAAC,GAAG,CAAC,CAAC;IACpB,MAAM,KAAK,GAAG,gBAAgB,CAAC,EAAE,EAAE,IAAA,iBAAO,EAAC,IAAA,aAAG,EAAC,IAAA,aAAG,EAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IAC5D,IAAI,KAAK;QAAE,OAAO,KAAK,CAAC;IACxB,qDAAqD;IACrD,MAAM,QAAQ,GAAY;QACxB,UAAU,EAAE,CAAC;QACb,IAAI,EAAE,YAAY;QAClB,QAAQ,EAAE,CAAC,EAAE,UAAU,EAAE,IAAA,aAAG,EAAC,IAAA,aAAG,EAAC,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,YAAY,EAAE,QAAQ,EAAE,EAAE,EAAE,CAAC;KAC1E,CAAC;IACF,OAAO;QACL,UAAU,EAAE,IAAA,iBAAO,EAAC,IAAA,aAAG,EAAC,IAAA,aAAG,EAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QACnC,IAAI,EAAE,MAAM;QACZ,QAAQ,EAAE,CAAC,QAAQ,CAAC;QACpB,UAAU,EAAE,CAAC,IAAA,aAAG,EAAC,IAAA,aAAG,EAAC,CAAC,CAAC,CAAC,CAAC;KAC1B,CAAC;AACJ,CAAC;AAED;;GAEG;AACH,SAAgB,SAAS;IACvB,MAAM,CAAC,GAAG,IAAA,cAAI,EAAC,GAAG,CAAC,CAAC;IACpB,MAAM,KAAK,GAAG,gBAAgB,CAAC,EAAE,EAAE,IAAA,YAAE,EAAC,CAAC,EAAE,IAAA,aAAG,EAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAClD,IAAI,KAAK;QAAE,OAAO,KAAK,CAAC;IACxB,uBAAuB;IACvB,OAAO;QACL,UAAU,EAAE,IAAA,YAAE,EAAC,CAAC,EAAE,IAAA,aAAG,EAAC,CAAC,CAAC,CAAC;QACzB,IAAI,EAAE,KAAK;QACX,QAAQ,EAAE,EAAE;KACb,CAAC;AACJ,CAAC;AAED,iEAAiE;AAEjE;;;;;;;;;GASG;AACH,SAAgB,MAAM,CAAC,KAAc;IACnC,MAAM,cAAc,GAAG,qBAAqB,CAAC,KAAK,CAAC,CAAC;IACpD,IAAI,cAAc,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAChC,OAAO,EAAE,SAAS,EAAE,KAAK,EAAE,CAAC;IAC9B,CAAC;IACD,OAAO;QACL,MAAM,EAAE,mEAAmE,cAAc,CAAC,IAAI,CAC5F,IAAI,CACL,GAAG;KACL,CAAC;AACJ,CAAC;AAED,SAAS,qBAAqB,CAAC,KAAc,EAAE,MAAmB,IAAI,GAAG,EAAE;IACzE,IAAI,4BAAoB,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,CAAC;QAAE,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IACnE,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,QAAQ;QAAE,qBAAqB,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;IAC9D,OAAO,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;AACzB,CAAC"}

package/dist/logic/profiles/natural-deduction-nk/types.d.ts

@@ -0,0 +1,48 @@
+/**
+ * Fórmula proposicional clásica. Misma forma sintáctica que NJ;
+ * la diferencia entre ambas lógicas vive en el sistema de reglas.
+ */
+export type NKFormula = {
+    kind: 'atom';
+    name: string;
+} | {
+    kind: 'and';
+    left: NKFormula;
+    right: NKFormula;
+} | {
+    kind: 'or';
+    left: NKFormula;
+    right: NKFormula;
+} | {
+    kind: 'implies';
+    left: NKFormula;
+    right: NKFormula;
+} | {
+    kind: 'not';
+    arg: NKFormula;
+} | {
+    kind: 'bottom';
+};
+/**
+ * Reglas de prueba NK. Las primeras son las de NJ; las últimas
+ * cuatro son los "extras" clásicos.
+ */
+export type NKRule = 'assumption' | 'andI' | 'andEL' | 'andER' | 'orIL' | 'orIR' | 'orE' | 'impI' | 'impE' | 'notI' | 'notE' | 'bottomE' | 'doubleNegE' | 'LEM' | 'pierce' | 'rAA';
+/**
+ * Árbol de prueba NK. Las hipótesis abiertas viven implícitamente
+ * en el contexto del subárbol; `discharged` lista las hipótesis
+ * cerradas por la regla aplicada en este nodo (relevante para →I,
+ * ¬I, ∨E y rAA).
+ */
+export interface NKProof {
+    conclusion: NKFormula;
+    rule: NKRule;
+    premises: NKProof[];
+    discharged?: NKFormula[];
+}
+/**
+ * Conjunto de reglas que sólo existen en NK (no en NJ).
+ * Útil para detectar si una prueba NK es trasladable a NJ.
+ */
+export declare const CLASSICAL_ONLY_RULES: ReadonlyArray<NKRule>;
+//# sourceMappingURL=types.d.ts.map

package/dist/logic/profiles/natural-deduction-nk/types.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../../../../src/logic/profiles/natural-deduction-nk/types.ts"],"names":[],"mappings":"AA2BA;;;GAGG;AACH,MAAM,MAAM,SAAS,GACjB;IAAE,IAAI,EAAE,MAAM,CAAC;IAAC,IAAI,EAAE,MAAM,CAAA;CAAE,GAC9B;IAAE,IAAI,EAAE,KAAK,CAAC;IAAC,IAAI,EAAE,SAAS,CAAC;IAAC,KAAK,EAAE,SAAS,CAAA;CAAE,GAClD;IAAE,IAAI,EAAE,IAAI,CAAC;IAAC,IAAI,EAAE,SAAS,CAAC;IAAC,KAAK,EAAE,SAAS,CAAA;CAAE,GACjD;IAAE,IAAI,EAAE,SAAS,CAAC;IAAC,IAAI,EAAE,SAAS,CAAC;IAAC,KAAK,EAAE,SAAS,CAAA;CAAE,GACtD;IAAE,IAAI,EAAE,KAAK,CAAC;IAAC,GAAG,EAAE,SAAS,CAAA;CAAE,GAC/B;IAAE,IAAI,EAAE,QAAQ,CAAA;CAAE,CAAC;AAEvB;;;GAGG;AACH,MAAM,MAAM,MAAM,GACd,YAAY,GACZ,MAAM,GACN,OAAO,GACP,OAAO,GACP,MAAM,GACN,MAAM,GACN,KAAK,GACL,MAAM,GACN,MAAM,GACN,MAAM,GACN,MAAM,GACN,SAAS,GACT,YAAY,GACZ,KAAK,GACL,QAAQ,GACR,KAAK,CAAC;AAEV;;;;;GAKG;AACH,MAAM,WAAW,OAAO;IACtB,UAAU,EAAE,SAAS,CAAC;IACtB,IAAI,EAAE,MAAM,CAAC;IACb,QAAQ,EAAE,OAAO,EAAE,CAAC;IACpB,UAAU,CAAC,EAAE,SAAS,EAAE,CAAC;CAC1B;AAED;;;GAGG;AACH,eAAO,MAAM,oBAAoB,EAAE,aAAa,CAAC,MAAM,CAA0C,CAAC"}