@stevenvo780/st-lang 4.9.0 → 4.11.0

package/dist/tooling/lemma-library/apply.js

@@ -0,0 +1,94 @@
+"use strict";
+// ============================================================
+// tryApplyLemma — pattern matching simple goal ↔ lema
+//
+// Heurística: tokeniza el goal y cada lema, busca aquellos cuyo
+// "esqueleto" estructural (símbolos lógicos) sea subsequence del
+// goal, y propone sustituciones de las metavariables (P, Q, R, …,
+// φ, ψ, x, y, z, a, b, c, n, m) al primer no-variable encontrado
+// en posición correspondiente.
+// ============================================================
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.tryApplyLemma = tryApplyLemma;
+const tokenize_1 = require("./tokenize");
+const METAVAR_PATTERN = /^[a-zA-Zφψχ]$/;
+function isMetavar(tok) {
+    return METAVAR_PATTERN.test(tok);
+}
+function structuralSkeleton(tokens) {
+    return tokens.filter((t) => !isMetavar(t));
+}
+function isSubsequence(needle, haystack) {
+    let i = 0;
+    for (const h of haystack) {
+        if (i < needle.length && h === needle[i])
+            i++;
+    }
+    return i === needle.length;
+}
+function tryUnify(pattern, goal) {
+    const subs = new Map();
+    let gi = 0;
+    for (let pi = 0; pi < pattern.length; pi++) {
+        const ptok = pattern[pi];
+        if (ptok === undefined)
+            return undefined;
+        if (isMetavar(ptok)) {
+            // captura el siguiente token del goal o un grupo balanceado mínimo
+            if (gi >= goal.length)
+                return undefined;
+            const captured = goal[gi];
+            if (captured === undefined)
+                return undefined;
+            const existing = subs.get(ptok);
+            if (existing !== undefined && existing !== captured)
+                return undefined;
+            subs.set(ptok, captured);
+            gi++;
+        }
+        else {
+            // avanza hasta el primer match exacto del símbolo
+            while (gi < goal.length && goal[gi] !== ptok)
+                gi++;
+            if (gi >= goal.length)
+                return undefined;
+            gi++;
+        }
+    }
+    return subs;
+}
+/**
+ * Devuelve los lemas de `library` cuyo esqueleto estructural es
+ * subsequence del goal. Si se encuentra el más específico (mayor
+ * cantidad de tokens estructurales), añade las sustituciones.
+ */
+function tryApplyLemma(goal, library) {
+    const goalTokens = (0, tokenize_1.tokenize)(goal);
+    const goalSkeleton = structuralSkeleton(goalTokens);
+    if (goalSkeleton.length === 0)
+        return { applicable: [] };
+    const applicable = [];
+    for (const lemma of library.all()) {
+        const lemmaTokens = (0, tokenize_1.tokenize)(lemma.statement);
+        const lemmaSkeleton = structuralSkeleton(lemmaTokens);
+        if (lemmaSkeleton.length === 0)
+            continue;
+        if (isSubsequence(lemmaSkeleton, goalSkeleton)) {
+            applicable.push({ lemma, skeleton: lemmaSkeleton });
+        }
+    }
+    applicable.sort((a, b) => b.skeleton.length - a.skeleton.length);
+    let substitutions;
+    if (applicable.length > 0) {
+        const top = applicable[0];
+        if (top !== undefined) {
+            const lemmaTokens = (0, tokenize_1.tokenize)(top.lemma.statement);
+            substitutions = tryUnify(lemmaTokens, goalTokens);
+        }
+    }
+    return {
+        applicable: applicable.map((a) => a.lemma),
+        substitutions,
+    };
+}
+//# sourceMappingURL=apply.js.map

package/dist/tooling/lemma-library/apply.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"apply.js","sourceRoot":"","sources":["../../../src/tooling/lemma-library/apply.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,sDAAsD;AACtD,EAAE;AACF,gEAAgE;AAChE,iEAAiE;AACjE,kEAAkE;AAClE,iEAAiE;AACjE,+BAA+B;AAC/B,+DAA+D;;AAsD/D,sCA8BC;AAhFD,yCAAsC;AAEtC,MAAM,eAAe,GAAG,eAAe,CAAC;AAExC,SAAS,SAAS,CAAC,GAAW;IAC5B,OAAO,eAAe,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;AACnC,CAAC;AAED,SAAS,kBAAkB,CAAC,MAAgB;IAC1C,OAAO,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;AAC7C,CAAC;AAED,SAAS,aAAa,CAAC,MAAgB,EAAE,QAAkB;IACzD,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,KAAK,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;QACzB,IAAI,CAAC,GAAG,MAAM,CAAC,MAAM,IAAI,CAAC,KAAK,MAAM,CAAC,CAAC,CAAC;YAAE,CAAC,EAAE,CAAC;IAChD,CAAC;IACD,OAAO,CAAC,KAAK,MAAM,CAAC,MAAM,CAAC;AAC7B,CAAC;AAED,SAAS,QAAQ,CAAC,OAAiB,EAAE,IAAc;IACjD,MAAM,IAAI,GAAG,IAAI,GAAG,EAAkB,CAAC;IACvC,IAAI,EAAE,GAAG,CAAC,CAAC;IACX,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,OAAO,CAAC,MAAM,EAAE,EAAE,EAAE,EAAE,CAAC;QAC3C,MAAM,IAAI,GAAG,OAAO,CAAC,EAAE,CAAC,CAAC;QACzB,IAAI,IAAI,KAAK,SAAS;YAAE,OAAO,SAAS,CAAC;QACzC,IAAI,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC;YACpB,mEAAmE;YACnE,IAAI,EAAE,IAAI,IAAI,CAAC,MAAM;gBAAE,OAAO,SAAS,CAAC;YACxC,MAAM,QAAQ,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC;YAC1B,IAAI,QAAQ,KAAK,SAAS;gBAAE,OAAO,SAAS,CAAC;YAC7C,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YAChC,IAAI,QAAQ,KAAK,SAAS,IAAI,QAAQ,KAAK,QAAQ;gBAAE,OAAO,SAAS,CAAC;YACtE,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;YACzB,EAAE,EAAE,CAAC;QACP,CAAC;aAAM,CAAC;YACN,kDAAkD;YAClD,OAAO,EAAE,GAAG,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC,EAAE,CAAC,KAAK,IAAI;gBAAE,EAAE,EAAE,CAAC;YACnD,IAAI,EAAE,IAAI,IAAI,CAAC,MAAM;gBAAE,OAAO,SAAS,CAAC;YACxC,EAAE,EAAE,CAAC;QACP,CAAC;IACH,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;;GAIG;AACH,SAAgB,aAAa,CAAC,IAAY,EAAE,OAAqB;IAC/D,MAAM,UAAU,GAAG,IAAA,mBAAQ,EAAC,IAAI,CAAC,CAAC;IAClC,MAAM,YAAY,GAAG,kBAAkB,CAAC,UAAU,CAAC,CAAC;IACpD,IAAI,YAAY,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,UAAU,EAAE,EAAE,EAAE,CAAC;IAEzD,MAAM,UAAU,GAAuD,EAAE,CAAC;IAC1E,KAAK,MAAM,KAAK,IAAI,OAAO,CAAC,GAAG,EAAE,EAAE,CAAC;QAClC,MAAM,WAAW,GAAG,IAAA,mBAAQ,EAAC,KAAK,CAAC,SAAS,CAAC,CAAC;QAC9C,MAAM,aAAa,GAAG,kBAAkB,CAAC,WAAW,CAAC,CAAC;QACtD,IAAI,aAAa,CAAC,MAAM,KAAK,CAAC;YAAE,SAAS;QACzC,IAAI,aAAa,CAAC,aAAa,EAAE,YAAY,CAAC,EAAE,CAAC;YAC/C,UAAU,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,QAAQ,EAAE,aAAa,EAAE,CAAC,CAAC;QACtD,CAAC;IACH,CAAC;IAED,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;IAEjE,IAAI,aAA8C,CAAC;IACnD,IAAI,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC1B,MAAM,GAAG,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;QAC1B,IAAI,GAAG,KAAK,SAAS,EAAE,CAAC;YACtB,MAAM,WAAW,GAAG,IAAA,mBAAQ,EAAC,GAAG,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC;YAClD,aAAa,GAAG,QAAQ,CAAC,WAAW,EAAE,UAAU,CAAC,CAAC;QACpD,CAAC;IACH,CAAC;IAED,OAAO;QACL,UAAU,EAAE,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC;QAC1C,aAAa;KACd,CAAC;AACJ,CAAC"}

package/dist/tooling/lemma-library/arithmetic.d.ts

@@ -0,0 +1,3 @@
+import type { CuratedLemma } from './types';
+export declare const ARITHMETIC_LEMMAS: CuratedLemma[];
+//# sourceMappingURL=arithmetic.d.ts.map

package/dist/tooling/lemma-library/arithmetic.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"arithmetic.d.ts","sourceRoot":"","sources":["../../../src/tooling/lemma-library/arithmetic.ts"],"names":[],"mappings":"AAKA,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,SAAS,CAAC;AAE5C,eAAO,MAAM,iBAAiB,EAAE,YAAY,EAuK3C,CAAC"}

package/dist/tooling/lemma-library/arithmetic.js

@@ -0,0 +1,176 @@
+"use strict";
+// ============================================================
+// Lemas curados — Aritmética de Peano (~20)
+// Conmutatividad, asociatividad, distributividad, inducción.
+// ============================================================
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.ARITHMETIC_LEMMAS = void 0;
+exports.ARITHMETIC_LEMMAS = [
+    {
+        id: 'arith.add-zero-right',
+        name: 'Right additive identity',
+        statement: '∀n. n + 0 = n',
+        domain: 'arithmetic',
+        tags: ['peano', 'identity', 'addition', 'naturals'],
+        difficulty: 'trivial',
+        isAxiom: true,
+    },
+    {
+        id: 'arith.add-zero-left',
+        name: 'Left additive identity',
+        statement: '∀n. 0 + n = n',
+        domain: 'arithmetic',
+        tags: ['peano', 'identity', 'addition', 'naturals', 'induction'],
+        difficulty: 'easy',
+    },
+    {
+        id: 'arith.add-succ-right',
+        name: 'Successor on the right of +',
+        statement: '∀m n. m + S(n) = S(m + n)',
+        domain: 'arithmetic',
+        tags: ['peano', 'successor', 'addition', 'naturals'],
+        difficulty: 'trivial',
+        isAxiom: true,
+    },
+    {
+        id: 'arith.add-succ-left',
+        name: 'Successor on the left of +',
+        statement: '∀m n. S(m) + n = S(m + n)',
+        domain: 'arithmetic',
+        tags: ['peano', 'successor', 'addition', 'naturals', 'induction'],
+        difficulty: 'easy',
+    },
+    {
+        id: 'arith.add-commutative',
+        name: 'Commutativity of addition',
+        statement: '∀m n. m + n = n + m',
+        domain: 'arithmetic',
+        tags: ['peano', 'commutativity', 'addition', 'naturals', 'induction'],
+        difficulty: 'medium',
+    },
+    {
+        id: 'arith.add-associative',
+        name: 'Associativity of addition',
+        statement: '∀a b c. (a + b) + c = a + (b + c)',
+        domain: 'arithmetic',
+        tags: ['peano', 'associativity', 'addition', 'naturals', 'induction'],
+        difficulty: 'medium',
+    },
+    {
+        id: 'arith.mul-zero-right',
+        name: 'Right multiplicative annihilator',
+        statement: '∀n. n · 0 = 0',
+        domain: 'arithmetic',
+        tags: ['peano', 'zero', 'multiplication', 'naturals'],
+        difficulty: 'trivial',
+        isAxiom: true,
+    },
+    {
+        id: 'arith.mul-zero-left',
+        name: 'Left multiplicative annihilator',
+        statement: '∀n. 0 · n = 0',
+        domain: 'arithmetic',
+        tags: ['peano', 'zero', 'multiplication', 'naturals', 'induction'],
+        difficulty: 'easy',
+    },
+    {
+        id: 'arith.mul-one-right',
+        name: 'Right multiplicative identity',
+        statement: '∀n. n · 1 = n',
+        domain: 'arithmetic',
+        tags: ['peano', 'identity', 'multiplication', 'naturals'],
+        difficulty: 'easy',
+    },
+    {
+        id: 'arith.mul-one-left',
+        name: 'Left multiplicative identity',
+        statement: '∀n. 1 · n = n',
+        domain: 'arithmetic',
+        tags: ['peano', 'identity', 'multiplication', 'naturals', 'induction'],
+        difficulty: 'easy',
+    },
+    {
+        id: 'arith.mul-commutative',
+        name: 'Commutativity of multiplication',
+        statement: '∀m n. m · n = n · m',
+        domain: 'arithmetic',
+        tags: ['peano', 'commutativity', 'multiplication', 'naturals', 'induction'],
+        difficulty: 'medium',
+    },
+    {
+        id: 'arith.mul-associative',
+        name: 'Associativity of multiplication',
+        statement: '∀a b c. (a · b) · c = a · (b · c)',
+        domain: 'arithmetic',
+        tags: ['peano', 'associativity', 'multiplication', 'naturals', 'induction'],
+        difficulty: 'medium',
+    },
+    {
+        id: 'arith.mul-distributes-add',
+        name: 'Distributivity of · over +',
+        statement: '∀a b c. a · (b + c) = a · b + a · c',
+        domain: 'arithmetic',
+        tags: ['peano', 'distributivity', 'multiplication', 'addition', 'naturals', 'induction'],
+        difficulty: 'medium',
+    },
+    {
+        id: 'arith.add-cancel-left',
+        name: 'Left cancellation of addition',
+        statement: '∀a b c. a + b = a + c → b = c',
+        domain: 'arithmetic',
+        tags: ['peano', 'cancellation', 'addition', 'naturals', 'induction'],
+        difficulty: 'medium',
+    },
+    {
+        id: 'arith.succ-injective',
+        name: 'Successor is injective',
+        statement: '∀m n. S(m) = S(n) → m = n',
+        domain: 'arithmetic',
+        tags: ['peano', 'successor', 'injective', 'naturals'],
+        difficulty: 'trivial',
+        isAxiom: true,
+    },
+    {
+        id: 'arith.succ-not-zero',
+        name: 'Successor never equals zero',
+        statement: '∀n. ¬(S(n) = 0)',
+        domain: 'arithmetic',
+        tags: ['peano', 'successor', 'zero', 'naturals'],
+        difficulty: 'trivial',
+        isAxiom: true,
+    },
+    {
+        id: 'arith.induction',
+        name: 'Mathematical induction',
+        statement: '(φ(0) ∧ ∀n. (φ(n) → φ(S(n)))) → ∀n. φ(n)',
+        domain: 'arithmetic',
+        tags: ['peano', 'induction', 'naturals', 'schema'],
+        difficulty: 'hard',
+        isAxiom: true,
+    },
+    {
+        id: 'arith.le-reflexive',
+        name: 'Reflexivity of ≤',
+        statement: '∀n. n ≤ n',
+        domain: 'arithmetic',
+        tags: ['peano', 'order', 'reflexivity', 'naturals'],
+        difficulty: 'trivial',
+    },
+    {
+        id: 'arith.le-transitive',
+        name: 'Transitivity of ≤',
+        statement: '∀a b c. a ≤ b ∧ b ≤ c → a ≤ c',
+        domain: 'arithmetic',
+        tags: ['peano', 'order', 'transitivity', 'naturals'],
+        difficulty: 'easy',
+    },
+    {
+        id: 'arith.le-antisymmetric',
+        name: 'Antisymmetry of ≤',
+        statement: '∀a b. a ≤ b ∧ b ≤ a → a = b',
+        domain: 'arithmetic',
+        tags: ['peano', 'order', 'antisymmetry', 'naturals'],
+        difficulty: 'easy',
+    },
+];
+//# sourceMappingURL=arithmetic.js.map

package/dist/tooling/lemma-library/arithmetic.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"arithmetic.js","sourceRoot":"","sources":["../../../src/tooling/lemma-library/arithmetic.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,4CAA4C;AAC5C,6DAA6D;AAC7D,+DAA+D;;;AAIlD,QAAA,iBAAiB,GAAmB;IAC/C;QACE,EAAE,EAAE,sBAAsB;QAC1B,IAAI,EAAE,yBAAyB;QAC/B,SAAS,EAAE,eAAe;QAC1B,MAAM,EAAE,YAAY;QACpB,IAAI,EAAE,CAAC,OAAO,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,CAAC;QACnD,UAAU,EAAE,SAAS;QACrB,OAAO,EAAE,IAAI;KACd;IACD;QACE,EAAE,EAAE,qBAAqB;QACzB,IAAI,EAAE,wBAAwB;QAC9B,SAAS,EAAE,eAAe;QAC1B,MAAM,EAAE,YAAY;QACpB,IAAI,EAAE,CAAC,OAAO,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,WAAW,CAAC;QAChE,UAAU,EAAE,MAAM;KACnB;IACD;QACE,EAAE,EAAE,sBAAsB;QAC1B,IAAI,EAAE,6BAA6B;QACnC,SAAS,EAAE,2BAA2B;QACtC,MAAM,EAAE,YAAY;QACpB,IAAI,EAAE,CAAC,OAAO,EAAE,WAAW,EAAE,UAAU,EAAE,UAAU,CAAC;QACpD,UAAU,EAAE,SAAS;QACrB,OAAO,EAAE,IAAI;KACd;IACD;QACE,EAAE,EAAE,qBAAqB;QACzB,IAAI,EAAE,4BAA4B;QAClC,SAAS,EAAE,2BAA2B;QACtC,MAAM,EAAE,YAAY;QACpB,IAAI,EAAE,CAAC,OAAO,EAAE,WAAW,EAAE,UAAU,EAAE,UAAU,EAAE,WAAW,CAAC;QACjE,UAAU,EAAE,MAAM;KACnB;IACD;QACE,EAAE,EAAE,uBAAuB;QAC3B,IAAI,EAAE,2BAA2B;QACjC,SAAS,EAAE,qBAAqB;QAChC,MAAM,EAAE,YAAY;QACpB,IAAI,EAAE,CAAC,OAAO,EAAE,eAAe,EAAE,UAAU,EAAE,UAAU,EAAE,WAAW,CAAC;QACrE,UAAU,EAAE,QAAQ;KACrB;IACD;QACE,EAAE,EAAE,uBAAuB;QAC3B,IAAI,EAAE,2BAA2B;QACjC,SAAS,EAAE,mCAAmC;QAC9C,MAAM,EAAE,YAAY;QACpB,IAAI,EAAE,CAAC,OAAO,EAAE,eAAe,EAAE,UAAU,EAAE,UAAU,EAAE,WAAW,CAAC;QACrE,UAAU,EAAE,QAAQ;KACrB;IACD;QACE,EAAE,EAAE,sBAAsB;QAC1B,IAAI,EAAE,kCAAkC;QACxC,SAAS,EAAE,eAAe;QAC1B,MAAM,EAAE,YAAY;QACpB,IAAI,EAAE,CAAC,OAAO,EAAE,MAAM,EAAE,gBAAgB,EAAE,UAAU,CAAC;QACrD,UAAU,EAAE,SAAS;QACrB,OAAO,EAAE,IAAI;KACd;IACD;QACE,EAAE,EAAE,qBAAqB;QACzB,IAAI,EAAE,iCAAiC;QACvC,SAAS,EAAE,eAAe;QAC1B,MAAM,EAAE,YAAY;QACpB,IAAI,EAAE,CAAC,OAAO,EAAE,MAAM,EAAE,gBAAgB,EAAE,UAAU,EAAE,WAAW,CAAC;QAClE,UAAU,EAAE,MAAM;KACnB;IACD;QACE,EAAE,EAAE,qBAAqB;QACzB,IAAI,EAAE,+BAA+B;QACrC,SAAS,EAAE,eAAe;QAC1B,MAAM,EAAE,YAAY;QACpB,IAAI,EAAE,CAAC,OAAO,EAAE,UAAU,EAAE,gBAAgB,EAAE,UAAU,CAAC;QACzD,UAAU,EAAE,MAAM;KACnB;IACD;QACE,EAAE,EAAE,oBAAoB;QACxB,IAAI,EAAE,8BAA8B;QACpC,SAAS,EAAE,eAAe;QAC1B,MAAM,EAAE,YAAY;QACpB,IAAI,EAAE,CAAC,OAAO,EAAE,UAAU,EAAE,gBAAgB,EAAE,UAAU,EAAE,WAAW,CAAC;QACtE,UAAU,EAAE,MAAM;KACnB;IACD;QACE,EAAE,EAAE,uBAAuB;QAC3B,IAAI,EAAE,iCAAiC;QACvC,SAAS,EAAE,qBAAqB;QAChC,MAAM,EAAE,YAAY;QACpB,IAAI,EAAE,CAAC,OAAO,EAAE,eAAe,EAAE,gBAAgB,EAAE,UAAU,EAAE,WAAW,CAAC;QAC3E,UAAU,EAAE,QAAQ;KACrB;IACD;QACE,EAAE,EAAE,uBAAuB;QAC3B,IAAI,EAAE,iCAAiC;QACvC,SAAS,EAAE,mCAAmC;QAC9C,MAAM,EAAE,YAAY;QACpB,IAAI,EAAE,CAAC,OAAO,EAAE,eAAe,EAAE,gBAAgB,EAAE,UAAU,EAAE,WAAW,CAAC;QAC3E,UAAU,EAAE,QAAQ;KACrB;IACD;QACE,EAAE,EAAE,2BAA2B;QAC/B,IAAI,EAAE,4BAA4B;QAClC,SAAS,EAAE,qCAAqC;QAChD,MAAM,EAAE,YAAY;QACpB,IAAI,EAAE,CAAC,OAAO,EAAE,gBAAgB,EAAE,gBAAgB,EAAE,UAAU,EAAE,UAAU,EAAE,WAAW,CAAC;QACxF,UAAU,EAAE,QAAQ;KACrB;IACD;QACE,EAAE,EAAE,uBAAuB;QAC3B,IAAI,EAAE,+BAA+B;QACrC,SAAS,EAAE,+BAA+B;QAC1C,MAAM,EAAE,YAAY;QACpB,IAAI,EAAE,CAAC,OAAO,EAAE,cAAc,EAAE,UAAU,EAAE,UAAU,EAAE,WAAW,CAAC;QACpE,UAAU,EAAE,QAAQ;KACrB;IACD;QACE,EAAE,EAAE,sBAAsB;QAC1B,IAAI,EAAE,wBAAwB;QAC9B,SAAS,EAAE,2BAA2B;QACtC,MAAM,EAAE,YAAY;QACpB,IAAI,EAAE,CAAC,OAAO,EAAE,WAAW,EAAE,WAAW,EAAE,UAAU,CAAC;QACrD,UAAU,EAAE,SAAS;QACrB,OAAO,EAAE,IAAI;KACd;IACD;QACE,EAAE,EAAE,qBAAqB;QACzB,IAAI,EAAE,6BAA6B;QACnC,SAAS,EAAE,iBAAiB;QAC5B,MAAM,EAAE,YAAY;QACpB,IAAI,EAAE,CAAC,OAAO,EAAE,WAAW,EAAE,MAAM,EAAE,UAAU,CAAC;QAChD,UAAU,EAAE,SAAS;QACrB,OAAO,EAAE,IAAI;KACd;IACD;QACE,EAAE,EAAE,iBAAiB;QACrB,IAAI,EAAE,wBAAwB;QAC9B,SAAS,EAAE,0CAA0C;QACrD,MAAM,EAAE,YAAY;QACpB,IAAI,EAAE,CAAC,OAAO,EAAE,WAAW,EAAE,UAAU,EAAE,QAAQ,CAAC;QAClD,UAAU,EAAE,MAAM;QAClB,OAAO,EAAE,IAAI;KACd;IACD;QACE,EAAE,EAAE,oBAAoB;QACxB,IAAI,EAAE,kBAAkB;QACxB,SAAS,EAAE,WAAW;QACtB,MAAM,EAAE,YAAY;QACpB,IAAI,EAAE,CAAC,OAAO,EAAE,OAAO,EAAE,aAAa,EAAE,UAAU,CAAC;QACnD,UAAU,EAAE,SAAS;KACtB;IACD;QACE,EAAE,EAAE,qBAAqB;QACzB,IAAI,EAAE,mBAAmB;QACzB,SAAS,EAAE,+BAA+B;QAC1C,MAAM,EAAE,YAAY;QACpB,IAAI,EAAE,CAAC,OAAO,EAAE,OAAO,EAAE,cAAc,EAAE,UAAU,CAAC;QACpD,UAAU,EAAE,MAAM;KACnB;IACD;QACE,EAAE,EAAE,wBAAwB;QAC5B,IAAI,EAAE,mBAAmB;QACzB,SAAS,EAAE,6BAA6B;QACxC,MAAM,EAAE,YAAY;QACpB,IAAI,EAAE,CAAC,OAAO,EAAE,OAAO,EAAE,cAAc,EAAE,UAAU,CAAC;QACpD,UAAU,EAAE,MAAM;KACnB;CACF,CAAC"}

package/dist/tooling/lemma-library/firstorder.d.ts

@@ -0,0 +1,3 @@
+import type { CuratedLemma } from './types';
+export declare const FIRSTORDER_LEMMAS: CuratedLemma[];
+//# sourceMappingURL=firstorder.d.ts.map

package/dist/tooling/lemma-library/firstorder.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"firstorder.d.ts","sourceRoot":"","sources":["../../../src/tooling/lemma-library/firstorder.ts"],"names":[],"mappings":"AAKA,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,SAAS,CAAC;AAE5C,eAAO,MAAM,iBAAiB,EAAE,YAAY,EA+H3C,CAAC"}

package/dist/tooling/lemma-library/firstorder.js

@@ -0,0 +1,136 @@
+"use strict";
+// ============================================================
+// Lemas curados — Lógica de primer orden (~15)
+// Cuantificadores: introducción, eliminación, dualidades.
+// ============================================================
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.FIRSTORDER_LEMMAS = void 0;
+exports.FIRSTORDER_LEMMAS = [
+    {
+        id: 'fol.universal-instantiation',
+        name: 'Universal instantiation',
+        statement: '∀x. φ(x) → φ(t)',
+        domain: 'firstorder',
+        tags: ['universal', 'instantiation', 'elimination', 'classical', 'intuitionistic'],
+        difficulty: 'easy',
+        isAxiom: true,
+    },
+    {
+        id: 'fol.existential-introduction',
+        name: 'Existential introduction',
+        statement: 'φ(t) → ∃x. φ(x)',
+        domain: 'firstorder',
+        tags: ['existential', 'introduction', 'classical', 'intuitionistic'],
+        difficulty: 'easy',
+        isAxiom: true,
+    },
+    {
+        id: 'fol.generalization',
+        name: 'Universal generalization',
+        statement: '⊢ φ(x) ⇒ ⊢ ∀x. φ(x)',
+        domain: 'firstorder',
+        tags: ['universal', 'generalization', 'introduction', 'rule'],
+        difficulty: 'easy',
+        isAxiom: true,
+    },
+    {
+        id: 'fol.forall-and',
+        name: 'Universal distributes over conjunction',
+        statement: '∀x. (φ(x) ∧ ψ(x)) ↔ (∀x. φ(x)) ∧ (∀x. ψ(x))',
+        domain: 'firstorder',
+        tags: ['universal', 'conjunction', 'distribution'],
+        difficulty: 'medium',
+    },
+    {
+        id: 'fol.exists-or',
+        name: 'Existential distributes over disjunction',
+        statement: '∃x. (φ(x) ∨ ψ(x)) ↔ (∃x. φ(x)) ∨ (∃x. ψ(x))',
+        domain: 'firstorder',
+        tags: ['existential', 'disjunction', 'distribution'],
+        difficulty: 'medium',
+    },
+    {
+        id: 'fol.duality-forall',
+        name: 'Quantifier duality (∀)',
+        statement: '∀x. φ(x) ↔ ¬∃x. ¬φ(x)',
+        domain: 'firstorder',
+        tags: ['duality', 'universal', 'existential', 'negation', 'classical'],
+        difficulty: 'medium',
+    },
+    {
+        id: 'fol.duality-exists',
+        name: 'Quantifier duality (∃)',
+        statement: '∃x. φ(x) ↔ ¬∀x. ¬φ(x)',
+        domain: 'firstorder',
+        tags: ['duality', 'universal', 'existential', 'negation', 'classical'],
+        difficulty: 'medium',
+    },
+    {
+        id: 'fol.not-forall',
+        name: 'Negation of universal',
+        statement: '¬∀x. φ(x) ↔ ∃x. ¬φ(x)',
+        domain: 'firstorder',
+        tags: ['negation', 'universal', 'existential', 'classical'],
+        difficulty: 'medium',
+    },
+    {
+        id: 'fol.not-exists',
+        name: 'Negation of existential',
+        statement: '¬∃x. φ(x) ↔ ∀x. ¬φ(x)',
+        domain: 'firstorder',
+        tags: ['negation', 'universal', 'existential', 'classical', 'intuitionistic'],
+        difficulty: 'medium',
+    },
+    {
+        id: 'fol.swap-forall',
+        name: 'Universal commutes with itself',
+        statement: '∀x ∀y. φ(x,y) ↔ ∀y ∀x. φ(x,y)',
+        domain: 'firstorder',
+        tags: ['commutativity', 'universal'],
+        difficulty: 'easy',
+    },
+    {
+        id: 'fol.swap-exists',
+        name: 'Existential commutes with itself',
+        statement: '∃x ∃y. φ(x,y) ↔ ∃y ∃x. φ(x,y)',
+        domain: 'firstorder',
+        tags: ['commutativity', 'existential'],
+        difficulty: 'easy',
+    },
+    {
+        id: 'fol.exists-forall-implies-forall-exists',
+        name: '∃∀ → ∀∃',
+        statement: '(∃y ∀x. φ(x,y)) → (∀x ∃y. φ(x,y))',
+        domain: 'firstorder',
+        tags: ['quantifier-order', 'universal', 'existential'],
+        difficulty: 'medium',
+    },
+    {
+        id: 'fol.equality-reflexive',
+        name: 'Reflexivity of equality',
+        statement: '∀x. x = x',
+        domain: 'firstorder',
+        tags: ['equality', 'reflexivity'],
+        difficulty: 'trivial',
+        isAxiom: true,
+    },
+    {
+        id: 'fol.equality-substitution',
+        name: 'Substitution of equals',
+        statement: '∀x y. x = y → (φ(x) ↔ φ(y))',
+        domain: 'firstorder',
+        tags: ['equality', 'substitution', 'leibniz'],
+        difficulty: 'easy',
+        isAxiom: true,
+        references: ['Leibniz, indiscernibility'],
+    },
+    {
+        id: 'fol.equality-symmetric',
+        name: 'Symmetry of equality',
+        statement: '∀x y. x = y → y = x',
+        domain: 'firstorder',
+        tags: ['equality', 'symmetry'],
+        difficulty: 'trivial',
+    },
+];
+//# sourceMappingURL=firstorder.js.map

package/dist/tooling/lemma-library/firstorder.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"firstorder.js","sourceRoot":"","sources":["../../../src/tooling/lemma-library/firstorder.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,+CAA+C;AAC/C,0DAA0D;AAC1D,+DAA+D;;;AAIlD,QAAA,iBAAiB,GAAmB;IAC/C;QACE,EAAE,EAAE,6BAA6B;QACjC,IAAI,EAAE,yBAAyB;QAC/B,SAAS,EAAE,iBAAiB;QAC5B,MAAM,EAAE,YAAY;QACpB,IAAI,EAAE,CAAC,WAAW,EAAE,eAAe,EAAE,aAAa,EAAE,WAAW,EAAE,gBAAgB,CAAC;QAClF,UAAU,EAAE,MAAM;QAClB,OAAO,EAAE,IAAI;KACd;IACD;QACE,EAAE,EAAE,8BAA8B;QAClC,IAAI,EAAE,0BAA0B;QAChC,SAAS,EAAE,iBAAiB;QAC5B,MAAM,EAAE,YAAY;QACpB,IAAI,EAAE,CAAC,aAAa,EAAE,cAAc,EAAE,WAAW,EAAE,gBAAgB,CAAC;QACpE,UAAU,EAAE,MAAM;QAClB,OAAO,EAAE,IAAI;KACd;IACD;QACE,EAAE,EAAE,oBAAoB;QACxB,IAAI,EAAE,0BAA0B;QAChC,SAAS,EAAE,qBAAqB;QAChC,MAAM,EAAE,YAAY;QACpB,IAAI,EAAE,CAAC,WAAW,EAAE,gBAAgB,EAAE,cAAc,EAAE,MAAM,CAAC;QAC7D,UAAU,EAAE,MAAM;QAClB,OAAO,EAAE,IAAI;KACd;IACD;QACE,EAAE,EAAE,gBAAgB;QACpB,IAAI,EAAE,wCAAwC;QAC9C,SAAS,EAAE,6CAA6C;QACxD,MAAM,EAAE,YAAY;QACpB,IAAI,EAAE,CAAC,WAAW,EAAE,aAAa,EAAE,cAAc,CAAC;QAClD,UAAU,EAAE,QAAQ;KACrB;IACD;QACE,EAAE,EAAE,eAAe;QACnB,IAAI,EAAE,0CAA0C;QAChD,SAAS,EAAE,6CAA6C;QACxD,MAAM,EAAE,YAAY;QACpB,IAAI,EAAE,CAAC,aAAa,EAAE,aAAa,EAAE,cAAc,CAAC;QACpD,UAAU,EAAE,QAAQ;KACrB;IACD;QACE,EAAE,EAAE,oBAAoB;QACxB,IAAI,EAAE,wBAAwB;QAC9B,SAAS,EAAE,uBAAuB;QAClC,MAAM,EAAE,YAAY;QACpB,IAAI,EAAE,CAAC,SAAS,EAAE,WAAW,EAAE,aAAa,EAAE,UAAU,EAAE,WAAW,CAAC;QACtE,UAAU,EAAE,QAAQ;KACrB;IACD;QACE,EAAE,EAAE,oBAAoB;QACxB,IAAI,EAAE,wBAAwB;QAC9B,SAAS,EAAE,uBAAuB;QAClC,MAAM,EAAE,YAAY;QACpB,IAAI,EAAE,CAAC,SAAS,EAAE,WAAW,EAAE,aAAa,EAAE,UAAU,EAAE,WAAW,CAAC;QACtE,UAAU,EAAE,QAAQ;KACrB;IACD;QACE,EAAE,EAAE,gBAAgB;QACpB,IAAI,EAAE,uBAAuB;QAC7B,SAAS,EAAE,uBAAuB;QAClC,MAAM,EAAE,YAAY;QACpB,IAAI,EAAE,CAAC,UAAU,EAAE,WAAW,EAAE,aAAa,EAAE,WAAW,CAAC;QAC3D,UAAU,EAAE,QAAQ;KACrB;IACD;QACE,EAAE,EAAE,gBAAgB;QACpB,IAAI,EAAE,yBAAyB;QAC/B,SAAS,EAAE,uBAAuB;QAClC,MAAM,EAAE,YAAY;QACpB,IAAI,EAAE,CAAC,UAAU,EAAE,WAAW,EAAE,aAAa,EAAE,WAAW,EAAE,gBAAgB,CAAC;QAC7E,UAAU,EAAE,QAAQ;KACrB;IACD;QACE,EAAE,EAAE,iBAAiB;QACrB,IAAI,EAAE,gCAAgC;QACtC,SAAS,EAAE,+BAA+B;QAC1C,MAAM,EAAE,YAAY;QACpB,IAAI,EAAE,CAAC,eAAe,EAAE,WAAW,CAAC;QACpC,UAAU,EAAE,MAAM;KACnB;IACD;QACE,EAAE,EAAE,iBAAiB;QACrB,IAAI,EAAE,kCAAkC;QACxC,SAAS,EAAE,+BAA+B;QAC1C,MAAM,EAAE,YAAY;QACpB,IAAI,EAAE,CAAC,eAAe,EAAE,aAAa,CAAC;QACtC,UAAU,EAAE,MAAM;KACnB;IACD;QACE,EAAE,EAAE,yCAAyC;QAC7C,IAAI,EAAE,SAAS;QACf,SAAS,EAAE,mCAAmC;QAC9C,MAAM,EAAE,YAAY;QACpB,IAAI,EAAE,CAAC,kBAAkB,EAAE,WAAW,EAAE,aAAa,CAAC;QACtD,UAAU,EAAE,QAAQ;KACrB;IACD;QACE,EAAE,EAAE,wBAAwB;QAC5B,IAAI,EAAE,yBAAyB;QAC/B,SAAS,EAAE,WAAW;QACtB,MAAM,EAAE,YAAY;QACpB,IAAI,EAAE,CAAC,UAAU,EAAE,aAAa,CAAC;QACjC,UAAU,EAAE,SAAS;QACrB,OAAO,EAAE,IAAI;KACd;IACD;QACE,EAAE,EAAE,2BAA2B;QAC/B,IAAI,EAAE,wBAAwB;QAC9B,SAAS,EAAE,6BAA6B;QACxC,MAAM,EAAE,YAAY;QACpB,IAAI,EAAE,CAAC,UAAU,EAAE,cAAc,EAAE,SAAS,CAAC;QAC7C,UAAU,EAAE,MAAM;QAClB,OAAO,EAAE,IAAI;QACb,UAAU,EAAE,CAAC,2BAA2B,CAAC;KAC1C;IACD;QACE,EAAE,EAAE,wBAAwB;QAC5B,IAAI,EAAE,sBAAsB;QAC5B,SAAS,EAAE,qBAAqB;QAChC,MAAM,EAAE,YAAY;QACpB,IAAI,EAAE,CAAC,UAAU,EAAE,UAAU,CAAC;QAC9B,UAAU,EAAE,SAAS;KACtB;CACF,CAAC"}

package/dist/tooling/lemma-library/index.d.ts

@@ -0,0 +1,13 @@
+export type { CuratedLemma, LemmaDomain, LemmaDifficulty, LemmaApplicationResult, SemanticSearchHit, TfIdfDocument, TfIdfIndex, } from './types';
+export { LemmaLibrary } from './library';
+export type { SearchOptions } from './library';
+export { buildIndex, semanticSearch } from './tfidf';
+export { tryApplyLemma } from './apply';
+export { tokenize } from './tokenize';
+export { PROPOSITIONAL_LEMMAS } from './propositional';
+export { ARITHMETIC_LEMMAS } from './arithmetic';
+export { SET_THEORY_LEMMAS } from './set-theory';
+export { MODAL_LEMMAS } from './modal';
+export { FIRSTORDER_LEMMAS } from './firstorder';
+export { standardLibrary } from './standard';
+//# sourceMappingURL=index.d.ts.map

package/dist/tooling/lemma-library/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/tooling/lemma-library/index.ts"],"names":[],"mappings":"AAQA,YAAY,EACV,YAAY,EACZ,WAAW,EACX,eAAe,EACf,sBAAsB,EACtB,iBAAiB,EACjB,aAAa,EACb,UAAU,GACX,MAAM,SAAS,CAAC;AAEjB,OAAO,EAAE,YAAY,EAAE,MAAM,WAAW,CAAC;AACzC,YAAY,EAAE,aAAa,EAAE,MAAM,WAAW,CAAC;AAE/C,OAAO,EAAE,UAAU,EAAE,cAAc,EAAE,MAAM,SAAS,CAAC;AACrD,OAAO,EAAE,aAAa,EAAE,MAAM,SAAS,CAAC;AACxC,OAAO,EAAE,QAAQ,EAAE,MAAM,YAAY,CAAC;AAEtC,OAAO,EAAE,oBAAoB,EAAE,MAAM,iBAAiB,CAAC;AACvD,OAAO,EAAE,iBAAiB,EAAE,MAAM,cAAc,CAAC;AACjD,OAAO,EAAE,iBAAiB,EAAE,MAAM,cAAc,CAAC;AACjD,OAAO,EAAE,YAAY,EAAE,MAAM,SAAS,CAAC;AACvC,OAAO,EAAE,iBAAiB,EAAE,MAAM,cAAc,CAAC;AAEjD,OAAO,EAAE,eAAe,EAAE,MAAM,YAAY,CAAC"}

package/dist/tooling/lemma-library/index.js

@@ -0,0 +1,32 @@
+"use strict";
+// ============================================================
+// ST Lemma Library — entrypoint público.
+//
+// Biblioteca curada de lemas pre-probados (proposicional, primer
+// orden, modal, aritmética, conjuntos) + búsqueda TF-IDF + intento
+// de aplicación automática contra un goal.
+// ============================================================
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.standardLibrary = exports.FIRSTORDER_LEMMAS = exports.MODAL_LEMMAS = exports.SET_THEORY_LEMMAS = exports.ARITHMETIC_LEMMAS = exports.PROPOSITIONAL_LEMMAS = exports.tokenize = exports.tryApplyLemma = exports.semanticSearch = exports.buildIndex = exports.LemmaLibrary = void 0;
+var library_1 = require("./library");
+Object.defineProperty(exports, "LemmaLibrary", { enumerable: true, get: function () { return library_1.LemmaLibrary; } });
+var tfidf_1 = require("./tfidf");
+Object.defineProperty(exports, "buildIndex", { enumerable: true, get: function () { return tfidf_1.buildIndex; } });
+Object.defineProperty(exports, "semanticSearch", { enumerable: true, get: function () { return tfidf_1.semanticSearch; } });
+var apply_1 = require("./apply");
+Object.defineProperty(exports, "tryApplyLemma", { enumerable: true, get: function () { return apply_1.tryApplyLemma; } });
+var tokenize_1 = require("./tokenize");
+Object.defineProperty(exports, "tokenize", { enumerable: true, get: function () { return tokenize_1.tokenize; } });
+var propositional_1 = require("./propositional");
+Object.defineProperty(exports, "PROPOSITIONAL_LEMMAS", { enumerable: true, get: function () { return propositional_1.PROPOSITIONAL_LEMMAS; } });
+var arithmetic_1 = require("./arithmetic");
+Object.defineProperty(exports, "ARITHMETIC_LEMMAS", { enumerable: true, get: function () { return arithmetic_1.ARITHMETIC_LEMMAS; } });
+var set_theory_1 = require("./set-theory");
+Object.defineProperty(exports, "SET_THEORY_LEMMAS", { enumerable: true, get: function () { return set_theory_1.SET_THEORY_LEMMAS; } });
+var modal_1 = require("./modal");
+Object.defineProperty(exports, "MODAL_LEMMAS", { enumerable: true, get: function () { return modal_1.MODAL_LEMMAS; } });
+var firstorder_1 = require("./firstorder");
+Object.defineProperty(exports, "FIRSTORDER_LEMMAS", { enumerable: true, get: function () { return firstorder_1.FIRSTORDER_LEMMAS; } });
+var standard_1 = require("./standard");
+Object.defineProperty(exports, "standardLibrary", { enumerable: true, get: function () { return standard_1.standardLibrary; } });
+//# sourceMappingURL=index.js.map

package/dist/tooling/lemma-library/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/tooling/lemma-library/index.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,yCAAyC;AACzC,EAAE;AACF,iEAAiE;AACjE,mEAAmE;AACnE,2CAA2C;AAC3C,+DAA+D;;;AAY/D,qCAAyC;AAAhC,uGAAA,YAAY,OAAA;AAGrB,iCAAqD;AAA5C,mGAAA,UAAU,OAAA;AAAE,uGAAA,cAAc,OAAA;AACnC,iCAAwC;AAA/B,sGAAA,aAAa,OAAA;AACtB,uCAAsC;AAA7B,oGAAA,QAAQ,OAAA;AAEjB,iDAAuD;AAA9C,qHAAA,oBAAoB,OAAA;AAC7B,2CAAiD;AAAxC,+GAAA,iBAAiB,OAAA;AAC1B,2CAAiD;AAAxC,+GAAA,iBAAiB,OAAA;AAC1B,iCAAuC;AAA9B,qGAAA,YAAY,OAAA;AACrB,2CAAiD;AAAxC,+GAAA,iBAAiB,OAAA;AAE1B,uCAA6C;AAApC,2GAAA,eAAe,OAAA"}

package/dist/tooling/lemma-library/library.d.ts

@@ -0,0 +1,34 @@
+import type { CuratedLemma, LemmaDifficulty } from './types';
+export interface SearchOptions {
+    domain?: string;
+    limit?: number;
+}
+export declare class LemmaLibrary {
+    private byId;
+    private byDomainIndex;
+    private byTagIndex;
+    private byDifficultyIndex;
+    add(lemma: CuratedLemma): void;
+    get(id: string): CuratedLemma | undefined;
+    byDomain(domain: string): CuratedLemma[];
+    byTag(tag: string): CuratedLemma[];
+    byDifficulty(d: LemmaDifficulty): CuratedLemma[];
+    all(): CuratedLemma[];
+    size(): number;
+    /**
+     * Búsqueda por palabra clave: tokeniza la query, asigna score a
+     * cada lema según matches en name (peso 3), tags (peso 2) y
+     * statement (peso 1). Si `opts.domain` está, filtra antes.
+     * Devuelve los top `opts.limit` (default 20).
+     */
+    search(query: string, opts?: SearchOptions): CuratedLemma[];
+    /**
+     * Recupera lemas similares al dado, ranqueados por overlap de
+     * tokens en statement (peso 2) + tags (peso 1). Excluye al propio
+     * lema. Default k = 5.
+     */
+    similar(lemma: CuratedLemma, k?: number): CuratedLemma[];
+    private indexSet;
+    private resolve;
+}
+//# sourceMappingURL=library.d.ts.map

package/dist/tooling/lemma-library/library.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"library.d.ts","sourceRoot":"","sources":["../../../src/tooling/lemma-library/library.ts"],"names":[],"mappings":"AAMA,OAAO,KAAK,EAAE,YAAY,EAAE,eAAe,EAAE,MAAM,SAAS,CAAC;AAG7D,MAAM,WAAW,aAAa;IAC5B,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB,KAAK,CAAC,EAAE,MAAM,CAAC;CAChB;AAED,qBAAa,YAAY;IACvB,OAAO,CAAC,IAAI,CAAwC;IACpD,OAAO,CAAC,aAAa,CAAuC;IAC5D,OAAO,CAAC,UAAU,CAAuC;IACzD,OAAO,CAAC,iBAAiB,CAAgD;IAEzE,GAAG,CAAC,KAAK,EAAE,YAAY,GAAG,IAAI;IAY9B,GAAG,CAAC,EAAE,EAAE,MAAM,GAAG,YAAY,GAAG,SAAS;IAIzC,QAAQ,CAAC,MAAM,EAAE,MAAM,GAAG,YAAY,EAAE;IAIxC,KAAK,CAAC,GAAG,EAAE,MAAM,GAAG,YAAY,EAAE;IAIlC,YAAY,CAAC,CAAC,EAAE,eAAe,GAAG,YAAY,EAAE;IAIhD,GAAG,IAAI,YAAY,EAAE;IAIrB,IAAI,IAAI,MAAM;IAId;;;;;OAKG;IACH,MAAM,CAAC,KAAK,EAAE,MAAM,EAAE,IAAI,GAAE,aAAkB,GAAG,YAAY,EAAE;IAsB/D;;;;OAIG;IACH,OAAO,CAAC,KAAK,EAAE,YAAY,EAAE,CAAC,SAAI,GAAG,YAAY,EAAE;IAoBnD,OAAO,CAAC,QAAQ;IAShB,OAAO,CAAC,OAAO;CAShB"}