@stevenvo780/st-lang 4.2.0 → 4.3.0

package/dist/profiles/intuitionistic-nj/prover.d.ts

@@ -0,0 +1,13 @@
+import { IntuitFormula, NJProof } from './types';
+/**
+ * API pública.
+ *
+ * Devuelve un árbol NJ que demuestra `goal` a partir de las
+ * `premises` dadas, o `null` si no encontró prueba dentro del
+ * budget configurado.
+ */
+export declare function proveIntuitionistically(premises: IntuitFormula[], goal: IntuitFormula, options?: {
+    budget?: number;
+}): NJProof | null;
+export declare function verifyProof(proof: NJProof, initialContext?: IntuitFormula[]): boolean;
+//# sourceMappingURL=prover.d.ts.map

package/dist/profiles/intuitionistic-nj/prover.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"prover.d.ts","sourceRoot":"","sources":["../../../src/profiles/intuitionistic-nj/prover.ts"],"names":[],"mappings":"AAuBA,OAAO,EAAE,aAAa,EAAE,OAAO,EAAE,MAAM,SAAS,CAAC;AAyRjD;;;;;;GAMG;AACH,wBAAgB,uBAAuB,CACrC,QAAQ,EAAE,aAAa,EAAE,EACzB,IAAI,EAAE,aAAa,EACnB,OAAO,GAAE;IAAE,MAAM,CAAC,EAAE,MAAM,CAAA;CAAO,GAChC,OAAO,GAAG,IAAI,CAGhB;AAQD,wBAAgB,WAAW,CAAC,KAAK,EAAE,OAAO,EAAE,cAAc,GAAE,aAAa,EAAO,GAAG,OAAO,CAEzF"}

package/dist/profiles/intuitionistic-nj/prover.js

@@ -0,0 +1,418 @@
+"use strict";
+// ============================================================
+// Intuitionistic Natural Deduction — Backward proof search
+// ============================================================
+//
+// Estrategia: búsqueda hacia atrás en un cálculo de secuentes
+// intuicionista (G3i-style, single-succedent) que se traduce a
+// NJ "on the fly". El árbol NJ producido se valida luego con
+// `verifyProof` (ver al final).
+//
+// Notas:
+//   - Sólo hay UN consecuente (eso es lo que vuelve NJ
+//     intuicionista; la lógica clásica usa multi-succedent).
+//   - La regla `impL` (modus ponens hacia atrás) y `orL`
+//     (eliminación de disyunción) no son invertibles, lo que
+//     obliga a buscar con memoización para evitar bucles.
+//   - Para `notI` aplicamos el patrón: si la meta es `¬φ`,
+//     entonces es lo mismo que probar `φ ⊢ ⊥`.
+//
+// Completitud: G3i es completo para IPC (Dyckhoff, "Contraction-
+// free sequent calculi for intuitionistic logic", 1992). Esta
+// implementación es una variante pragmática con loop-checking;
+// es completa para el fragmento proposicional dentro del budget.
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.proveIntuitionistically = proveIntuitionistically;
+exports.verifyProof = verifyProof;
+const formula_1 = require("./formula");
+function freshCtx(budget) {
+    return { budget, used: 0, failed: new Set(), active: new Set() };
+}
+function exhausted(ctx) {
+    return ctx.used >= ctx.budget;
+}
+/**
+ * Clave de un sub-problema (contexto + meta), normalizada y
+ * ordenada para que `{A, B} ⊢ C` y `{B, A} ⊢ C` coincidan.
+ */
+function goalKey(context, goal) {
+    const sorted = context.map(formula_1.formulaKey).sort();
+    return `[${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 de la búsqueda. Devuelve un árbol NJ 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);
+    if (ctx.failed.has(key))
+        return null;
+    if (ctx.active.has(key))
+        return null; // ciclo: no hay progreso por este camino
+    ctx.active.add(key);
+    const tryProve = () => {
+        // 1. Axioma / asunción: la meta está en el contexto.
+        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 → se aplican sin retroceder).
+        // ∧I
+        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] };
+        }
+        // →I (descarga el antecedente)
+        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],
+            };
+        }
+        // ¬I (descarga la fórmula, deriva ⊥)
+        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):
+        //    son invertibles para ∧, no para ∨/→.
+        //    Aplicamos primero las invertibles para reducir 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;
+                // El subárbol asumió h.left y h.right como hipótesis libres.
+                // Las "convertimos" en derivaciones explícitas desde h vía
+                // ∧EL/∧ER usando substituteAssumption.
+                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);
+                const withBoth = substituteAssumption(withL, h.right, elimR);
+                return withBoth;
+            }
+        }
+        // ⊥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 pero útil): si una disyunción A∨B está
+        // en el contexto y podemos probar la meta tanto bajo A como
+        // bajo B, aplicamos ∨E descargándolas en cada rama.
+        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) y sobre el
+        //    contexto (→E).
+        // ∨IL / ∨IR: si la meta es disyunción, intentar cada disyunto.
+        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] };
+            }
+            // No volvemos: si ninguna funcionó, ∨I no es la respuesta.
+        }
+        // →E (modus ponens hacia atrás): para cada implicación A→B
+        // en el contexto, intenta probar A; si lo logra, B queda como
+        // nueva hipótesis y reintentamos la meta.
+        for (let i = 0; i < context.length; i++) {
+            const h = context[i];
+            if (h && h.kind === 'implies') {
+                // Caso especial: A→B donde B = goal — entonces sólo hace
+                // falta probar A.
+                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],
+                    };
+                }
+                // Caso general: B se añade al contexto y la meta sigue siendo `goal`.
+                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 (modus ponens negativa): si tenemos ¬A en contexto y la
+        // meta es ⊥, intentar probar A; el resultado deriva ⊥.
+        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],
+                        };
+                    }
+                }
+                // Implicación a ⊥: igual que ¬ pero como φ → ⊥.
+                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. Último recurso: si la meta NO es ⊥, intentar probar
+        //    ⊥ desde el contexto (vía ¬E o impE-to-⊥) y aplicar
+        //    ⊥E para concluir cualquier cosa.
+        if (goal.kind !== 'bottom') {
+            const bottomProof = search(context, (0, formula_1.bottom)(), ctx);
+            if (bottomProof) {
+                return { conclusion: goal, rule: 'bottomE', premises: [bottomProof] };
+            }
+        }
+        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`.
+ * Esto permite que una eliminación de regla en el contexto (∧EL,
+ * impE, etc.) "rellene" lo que el subgoal trató como hipótesis.
+ */
+function substituteAssumption(proof, assumption, derivation) {
+    if (proof.rule === 'assumption' && (0, formula_1.formulaEquals)(proof.conclusion, assumption)) {
+        return derivation;
+    }
+    // Si la regla aplicada descargó la asunción en cuestión, no la
+    // sustituimos dentro de las premisas (alcance local).
+    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.
+ *
+ * Devuelve un árbol NJ que demuestra `goal` a partir de las
+ * `premises` dadas, o `null` si no encontró prueba dentro del
+ * budget configurado.
+ */
+function proveIntuitionistically(premises, goal, options = {}) {
+    const ctx = freshCtx(options.budget ?? 10_000);
+    return search(premises.slice(), goal, ctx);
+}
+// ── Verificación de proofs ──────────────────────────────────
+//
+// `verifyProof` recorre el árbol y comprueba localmente cada
+// regla. Útil para tests y para garantizar que el prover no
+// produce derivaciones inconsistentes.
+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);
+        }
+    }
+}
+//# sourceMappingURL=prover.js.map

package/dist/profiles/intuitionistic-nj/prover.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"prover.js","sourceRoot":"","sources":["../../../src/profiles/intuitionistic-nj/prover.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,2DAA2D;AAC3D,+DAA+D;AAC/D,EAAE;AACF,8DAA8D;AAC9D,+DAA+D;AAC/D,6DAA6D;AAC7D,gCAAgC;AAChC,EAAE;AACF,SAAS;AACT,uDAAuD;AACvD,6DAA6D;AAC7D,yDAAyD;AACzD,6DAA6D;AAC7D,0DAA0D;AAC1D,2DAA2D;AAC3D,+CAA+C;AAC/C,EAAE;AACF,iEAAiE;AACjE,8DAA8D;AAC9D,+DAA+D;AAC/D,iEAAiE;;AAkSjE,0DAOC;AAQD,kCAEC;AAhTD,uCAA8D;AAW9D,SAAS,QAAQ,CAAC,MAAc;IAC9B,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC,EAAE,MAAM,EAAE,IAAI,GAAG,EAAE,EAAE,MAAM,EAAE,IAAI,GAAG,EAAE,EAAE,CAAC;AACnE,CAAC;AAED,SAAS,SAAS,CAAC,GAAc;IAC/B,OAAO,GAAG,CAAC,IAAI,IAAI,GAAG,CAAC,MAAM,CAAC;AAChC,CAAC;AAED;;;GAGG;AACH,SAAS,OAAO,CAAC,OAAwB,EAAE,IAAmB;IAC5D,MAAM,MAAM,GAAG,OAAO,CAAC,GAAG,CAAC,oBAAU,CAAC,CAAC,IAAI,EAAE,CAAC;IAC9C,OAAO,IAAI,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,IAAA,oBAAU,EAAC,IAAI,CAAC,EAAE,CAAC;AACrD,CAAC;AAED,SAAS,UAAU,CAAC,OAAwB,EAAE,CAAgB;IAC5D,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,OAAwB,EAAE,CAAgB;IAC7D,IAAI,UAAU,CAAC,OAAO,EAAE,CAAC,CAAC;QAAE,OAAO,OAAO,CAAC;IAC3C,OAAO,CAAC,GAAG,OAAO,EAAE,CAAC,CAAC,CAAC;AACzB,CAAC;AAED;;;;GAIG;AACH,SAAS,MAAM,CAAC,OAAwB,EAAE,IAAmB,EAAE,GAAc;IAC3E,GAAG,CAAC,IAAI,EAAE,CAAC;IACX,IAAI,SAAS,CAAC,GAAG,CAAC;QAAE,OAAO,IAAI,CAAC;IAEhC,MAAM,GAAG,GAAG,OAAO,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC;IACnC,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,CAAC,yCAAyC;IAC/E,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IAEpB,MAAM,QAAQ,GAAG,GAAmB,EAAE;QACpC,qDAAqD;QACrD,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,gDAAgD;QAEhD,KAAK;QACL,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,+BAA+B;QAC/B,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,qCAAqC;QACrC,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;QAC5D,0CAA0C;QAC1C,iEAAiE;QAEjE,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,6DAA6D;gBAC7D,2DAA2D;gBAC3D,uCAAuC;gBACvC,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,MAAM,QAAQ,GAAG,oBAAoB,CAAC,KAAK,EAAE,CAAC,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;gBAC7D,OAAO,QAAQ,CAAC;YAClB,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,2DAA2D;QAC3D,4DAA4D;QAC5D,oDAAoD;QACpD,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,yDAAyD;QACzD,oBAAoB;QAEpB,+DAA+D;QAC/D,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,2DAA2D;QAC7D,CAAC;QAED,2DAA2D;QAC3D,8DAA8D;QAC9D,0CAA0C;QAC1C,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,yDAAyD;gBACzD,kBAAkB;gBAClB,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,sEAAsE;gBACtE,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,6DAA6D;QAC7D,uDAAuD;QACvD,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,gDAAgD;gBAChD,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,yDAAyD;QACzD,wDAAwD;QACxD,sCAAsC;QACtC,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,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;;;;;GAKG;AACH,SAAS,oBAAoB,CAC3B,KAAc,EACd,UAAyB,EACzB,UAAmB;IAEnB,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,+DAA+D;IAC/D,sDAAsD;IACtD,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;;;;;;GAMG;AACH,SAAgB,uBAAuB,CACrC,QAAyB,EACzB,IAAmB,EACnB,UAA+B,EAAE;IAEjC,MAAM,GAAG,GAAG,QAAQ,CAAC,OAAO,CAAC,MAAM,IAAI,MAAM,CAAC,CAAC;IAC/C,OAAO,MAAM,CAAC,QAAQ,CAAC,KAAK,EAAE,EAAE,IAAI,EAAE,GAAG,CAAC,CAAC;AAC7C,CAAC;AAED,+DAA+D;AAC/D,EAAE;AACF,6DAA6D;AAC7D,4DAA4D;AAC5D,uCAAuC;AAEvC,SAAgB,WAAW,CAAC,KAAc,EAAE,iBAAkC,EAAE;IAC9E,OAAO,QAAQ,CAAC,KAAK,EAAE,cAAc,CAAC,CAAC;AACzC,CAAC;AAED,SAAS,QAAQ,CAAC,KAAc,EAAE,GAAoB;IACpD,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;IACH,CAAC;AACH,CAAC"}

package/dist/profiles/intuitionistic-nj/types.d.ts

@@ -0,0 +1,55 @@
+/**
+ * Fórmula proposicional intuicionista. No incluye `true` explícito
+ * (irrelevante; usar `bottom → bottom` si hace falta).
+ */
+export type IntuitFormula = {
+    kind: 'atom';
+    name: string;
+} | {
+    kind: 'and';
+    left: IntuitFormula;
+    right: IntuitFormula;
+} | {
+    kind: 'or';
+    left: IntuitFormula;
+    right: IntuitFormula;
+} | {
+    kind: 'implies';
+    left: IntuitFormula;
+    right: IntuitFormula;
+} | {
+    kind: 'not';
+    arg: IntuitFormula;
+} | {
+    kind: 'bottom';
+};
+/**
+ * Reglas de prueba NJ. Cada nodo del árbol marca la regla aplicada
+ * para llegar a su `conclusion` desde sus `premises`.
+ */
+export type ProofRule = 'assumption' | 'andI' | 'andEL' | 'andER' | 'orIL' | 'orIR' | 'orE' | 'impI' | 'impE' | 'notI' | 'notE' | 'bottomE';
+/**
+ * Árbol de prueba NJ. 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 y ∨E).
+ */
+export interface NJProof {
+    conclusion: IntuitFormula;
+    rule: ProofRule;
+    premises: NJProof[];
+    discharged?: IntuitFormula[];
+}
+/**
+ * Modelo de Kripke para IPC: preorden de mundos con valuación
+ * persistente. La accesibilidad debe ser reflexiva y transitiva;
+ * `forcing` es monótona (si w ⊩ p y w ≤ v entonces v ⊩ p).
+ */
+export interface KripkeIntuitModel {
+    worlds: string[];
+    /** Aristas explícitas de la accesibilidad (clausura reflexiva-transitiva implícita). */
+    accessibility: Array<[string, string]>;
+    /** Por mundo, los átomos forzados. */
+    forcing: Map<string, Set<string>>;
+}
+//# sourceMappingURL=types.d.ts.map

package/dist/profiles/intuitionistic-nj/types.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../../../src/profiles/intuitionistic-nj/types.ts"],"names":[],"mappings":"AAmBA;;;GAGG;AACH,MAAM,MAAM,aAAa,GACrB;IAAE,IAAI,EAAE,MAAM,CAAC;IAAC,IAAI,EAAE,MAAM,CAAA;CAAE,GAC9B;IAAE,IAAI,EAAE,KAAK,CAAC;IAAC,IAAI,EAAE,aAAa,CAAC;IAAC,KAAK,EAAE,aAAa,CAAA;CAAE,GAC1D;IAAE,IAAI,EAAE,IAAI,CAAC;IAAC,IAAI,EAAE,aAAa,CAAC;IAAC,KAAK,EAAE,aAAa,CAAA;CAAE,GACzD;IAAE,IAAI,EAAE,SAAS,CAAC;IAAC,IAAI,EAAE,aAAa,CAAC;IAAC,KAAK,EAAE,aAAa,CAAA;CAAE,GAC9D;IAAE,IAAI,EAAE,KAAK,CAAC;IAAC,GAAG,EAAE,aAAa,CAAA;CAAE,GACnC;IAAE,IAAI,EAAE,QAAQ,CAAA;CAAE,CAAC;AAEvB;;;GAGG;AACH,MAAM,MAAM,SAAS,GACjB,YAAY,GACZ,MAAM,GACN,OAAO,GACP,OAAO,GACP,MAAM,GACN,MAAM,GACN,KAAK,GACL,MAAM,GACN,MAAM,GACN,MAAM,GACN,MAAM,GACN,SAAS,CAAC;AAEd;;;;;GAKG;AACH,MAAM,WAAW,OAAO;IACtB,UAAU,EAAE,aAAa,CAAC;IAC1B,IAAI,EAAE,SAAS,CAAC;IAChB,QAAQ,EAAE,OAAO,EAAE,CAAC;IACpB,UAAU,CAAC,EAAE,aAAa,EAAE,CAAC;CAC9B;AAED;;;;GAIG;AACH,MAAM,WAAW,iBAAiB;IAChC,MAAM,EAAE,MAAM,EAAE,CAAC;IACjB,wFAAwF;IACxF,aAAa,EAAE,KAAK,CAAC,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC;IACvC,sCAAsC;IACtC,OAAO,EAAE,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC;CACnC"}

package/dist/profiles/intuitionistic-nj/types.js

@@ -0,0 +1,21 @@
+"use strict";
+// ============================================================
+// Intuitionistic Natural Deduction (NJ) — Tipos
+// ============================================================
+//
+// Sistema NJ de Gentzen para lógica intuicionista proposicional.
+// Sin tercero excluido, sin doble negación clásica.
+//
+// Reglas implementadas:
+//   - Conjunción:   ∧I, ∧EL, ∧ER
+//   - Disyunción:   ∨IL, ∨IR, ∨E (con descarga)
+//   - Implicación:  →I (descarga), →E (modus ponens)
+//   - Negación:     ¬I (descarga, deriva ⊥), ¬E (deriva ⊥)
+//   - Falsedad:     ⊥E (ex falso quodlibet)
+//   - Asunción:     hipótesis del contexto
+//
+// Convención: `¬φ` se entiende como `φ → ⊥`. La regla `notI` es
+// `→I` cuando el consecuente es `⊥`; `notE` es `→E` produciendo
+// `⊥` desde `φ` y `¬φ`.
+Object.defineProperty(exports, "__esModule", { value: true });
+//# sourceMappingURL=types.js.map

package/dist/profiles/intuitionistic-nj/types.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.js","sourceRoot":"","sources":["../../../src/profiles/intuitionistic-nj/types.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,gDAAgD;AAChD,+DAA+D;AAC/D,EAAE;AACF,iEAAiE;AACjE,oDAAoD;AACpD,EAAE;AACF,wBAAwB;AACxB,iCAAiC;AACjC,gDAAgD;AAChD,qDAAqD;AACrD,2DAA2D;AAC3D,4CAA4C;AAC5C,2CAA2C;AAC3C,EAAE;AACF,gEAAgE;AAChE,gEAAgE;AAChE,wBAAwB"}

package/dist/profiles/many-valued/index.d.ts

@@ -0,0 +1,39 @@
+export type FuzzyOperator = 'lukasiewicz' | 'godel' | 'product';
+export interface FuzzyFormula {
+    kind: 'atom' | 'not' | 'and' | 'or' | 'implies';
+    name?: string;
+    arg?: FuzzyFormula;
+    left?: FuzzyFormula;
+    right?: FuzzyFormula;
+}
+export declare function atom(name: string): FuzzyFormula;
+export declare function not(arg: FuzzyFormula): FuzzyFormula;
+export declare function and(left: FuzzyFormula, right: FuzzyFormula): FuzzyFormula;
+export declare function or(left: FuzzyFormula, right: FuzzyFormula): FuzzyFormula;
+export declare function implies(left: FuzzyFormula, right: FuzzyFormula): FuzzyFormula;
+export declare function collectFuzzyAtoms(formula: FuzzyFormula): string[];
+/**
+ * Evalúa una fórmula borrosa bajo un environment que asigna
+ * un valor en [0,1] a cada átomo (átomos sin asignar valen 0).
+ */
+export declare function evaluate(formula: FuzzyFormula, env: Record<string, number>, system: FuzzyOperator): number;
+/**
+ * Devuelve true si la fórmula evalúa a 1 (módulo EPSILON) en
+ * todos los puntos de la rejilla [0,1]^n con `resolution` puntos
+ * por átomo. Default: 11 puntos (0, 0.1, ..., 1).
+ *
+ * Aviso: es una aproximación por sampling. Algunas tautologías
+ * "casi" (verdaderas excepto en un conjunto de medida cero)
+ * pueden seguir clasificándose correctamente, pero contraejemplos
+ * sutiles requieren resolución mayor.
+ */
+export declare function isTautology(formula: FuzzyFormula, system: FuzzyOperator, resolution?: number): boolean;
+/** Verdadera si la fórmula evalúa a 0 en toda la rejilla. */
+export declare function isContradiction(formula: FuzzyFormula, system: FuzzyOperator, resolution?: number): boolean;
+/**
+ * Busca una valuación (en la rejilla con `resolution` puntos por
+ * átomo) tal que `|evaluate(formula) - target| <= tolerance`.
+ * Devuelve null si no encuentra ninguna.
+ */
+export declare function findValuation(formula: FuzzyFormula, system: FuzzyOperator, target: number, tolerance?: number, resolution?: number): Record<string, number> | null;
+//# sourceMappingURL=index.d.ts.map

package/dist/profiles/many-valued/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/profiles/many-valued/index.ts"],"names":[],"mappings":"AAsBA,MAAM,MAAM,aAAa,GAAG,aAAa,GAAG,OAAO,GAAG,SAAS,CAAC;AAEhE,MAAM,WAAW,YAAY;IAC3B,IAAI,EAAE,MAAM,GAAG,KAAK,GAAG,KAAK,GAAG,IAAI,GAAG,SAAS,CAAC;IAChD,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,GAAG,CAAC,EAAE,YAAY,CAAC;IACnB,IAAI,CAAC,EAAE,YAAY,CAAC;IACpB,KAAK,CAAC,EAAE,YAAY,CAAC;CACtB;AA6DD,wBAAgB,IAAI,CAAC,IAAI,EAAE,MAAM,GAAG,YAAY,CAE/C;AAED,wBAAgB,GAAG,CAAC,GAAG,EAAE,YAAY,GAAG,YAAY,CAEnD;AAED,wBAAgB,GAAG,CAAC,IAAI,EAAE,YAAY,EAAE,KAAK,EAAE,YAAY,GAAG,YAAY,CAEzE;AAED,wBAAgB,EAAE,CAAC,IAAI,EAAE,YAAY,EAAE,KAAK,EAAE,YAAY,GAAG,YAAY,CAExE;AAED,wBAAgB,OAAO,CACrB,IAAI,EAAE,YAAY,EAClB,KAAK,EAAE,YAAY,GAClB,YAAY,CAEd;AAID,wBAAgB,iBAAiB,CAAC,OAAO,EAAE,YAAY,GAAG,MAAM,EAAE,CAoBjE;AAID;;;GAGG;AACH,wBAAgB,QAAQ,CACtB,OAAO,EAAE,YAAY,EACrB,GAAG,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,EAC3B,MAAM,EAAE,aAAa,GACpB,MAAM,CA2BR;AA4DD;;;;;;;;;GASG;AACH,wBAAgB,WAAW,CACzB,OAAO,EAAE,YAAY,EACrB,MAAM,EAAE,aAAa,EACrB,UAAU,GAAE,MAAW,GACtB,OAAO,CAUT;AAED,6DAA6D;AAC7D,wBAAgB,eAAe,CAC7B,OAAO,EAAE,YAAY,EACrB,MAAM,EAAE,aAAa,EACrB,UAAU,GAAE,MAAW,GACtB,OAAO,CAUT;AAED;;;;GAIG;AACH,wBAAgB,aAAa,CAC3B,OAAO,EAAE,YAAY,EACrB,MAAM,EAAE,aAAa,EACrB,MAAM,EAAE,MAAM,EACd,SAAS,GAAE,MAAa,EACxB,UAAU,GAAE,MAAW,GACtB,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,GAAG,IAAI,CAU/B"}