@stevenvo780/st-lang 4.14.1 → 4.15.0

package/dist/reasoning/dl-hybrid/index.js

@@ -0,0 +1,16 @@
+"use strict";
+// ============================================================
+// ST dL-Hybrid — Reasoning helpers
+// ============================================================
+// API pública para análisis de invariantes diferenciales (regla de
+// Platzer 2010). Estos helpers viven fuera del core del perfil para
+// no inflar el bundle del runtime; quien sólo necesite parse + check
+// puede ignorarlos.
+// ============================================================
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.describeVerdict = exports.suggestInvariants = exports.checkDifferentialInvariant = void 0;
+var invariant_search_1 = require("./invariant-search");
+Object.defineProperty(exports, "checkDifferentialInvariant", { enumerable: true, get: function () { return invariant_search_1.checkDifferentialInvariant; } });
+Object.defineProperty(exports, "suggestInvariants", { enumerable: true, get: function () { return invariant_search_1.suggestInvariants; } });
+Object.defineProperty(exports, "describeVerdict", { enumerable: true, get: function () { return invariant_search_1.describeVerdict; } });
+//# sourceMappingURL=index.js.map

package/dist/reasoning/dl-hybrid/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/reasoning/dl-hybrid/index.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,mCAAmC;AACnC,+DAA+D;AAC/D,mEAAmE;AACnE,oEAAoE;AACpE,qEAAqE;AACrE,oBAAoB;AACpB,+DAA+D;;;AAG/D,uDAI4B;AAH1B,8HAAA,0BAA0B,OAAA;AAC1B,qHAAA,iBAAiB,OAAA;AACjB,mHAAA,eAAe,OAAA"}

package/dist/reasoning/dl-hybrid/invariant-search.d.ts

@@ -0,0 +1,39 @@
+import type { DLTerm, OdeSystem, State } from '../../logic/profiles/dl-hybrid';
+/** Veredicto sobre un candidato de invariante diferencial. */
+export type InvariantVerdict = {
+    kind: 'invariant';
+    reason: 'exact' | 'lie-nonnegative';
+    samples: number;
+} | {
+    kind: 'not-invariant';
+    counterexample: State;
+    lieValue: number;
+} | {
+    kind: 'unknown';
+    reason: string;
+};
+export interface InvariantOptions {
+    /** Conjunto de estados a verificar la condición L_f(p) ≥ 0. */
+    samples?: State[];
+    /** Malla por defecto si `samples` no se pasa. */
+    meshValues?: number[];
+}
+/**
+ * Verifica si `p ≥ 0` es invariante diferencial del sistema bajo el
+ * dominio implícito (sin restringir). Chequea L_f(p) ≥ 0 en una malla.
+ */
+export declare function checkDifferentialInvariant(p: DLTerm, system: OdeSystem, opts?: InvariantOptions): InvariantVerdict;
+/**
+ * Sugiere candidatos típicos de invariante diferencial para un sistema
+ * ODE y devuelve los que satisfacen la condición suficiente. Si no
+ * encuentra nada, devuelve lista vacía.
+ */
+export interface CandidateResult {
+    candidate: DLTerm;
+    description: string;
+    verdict: InvariantVerdict;
+}
+export declare function suggestInvariants(system: OdeSystem, opts?: InvariantOptions): CandidateResult[];
+/** Formatea un veredicto para inspección humana. */
+export declare function describeVerdict(c: CandidateResult): string;
+//# sourceMappingURL=invariant-search.d.ts.map

package/dist/reasoning/dl-hybrid/invariant-search.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"invariant-search.d.ts","sourceRoot":"","sources":["../../../src/reasoning/dl-hybrid/invariant-search.ts"],"names":[],"mappings":"AAqBA,OAAO,KAAK,EAAE,MAAM,EAAE,SAAS,EAAE,KAAK,EAAE,MAAM,gCAAgC,CAAC;AAY/E,8DAA8D;AAC9D,MAAM,MAAM,gBAAgB,GACxB;IAAE,IAAI,EAAE,WAAW,CAAC;IAAC,MAAM,EAAE,OAAO,GAAG,iBAAiB,CAAC;IAAC,OAAO,EAAE,MAAM,CAAA;CAAE,GAC3E;IAAE,IAAI,EAAE,eAAe,CAAC;IAAC,cAAc,EAAE,KAAK,CAAC;IAAC,QAAQ,EAAE,MAAM,CAAA;CAAE,GAClE;IAAE,IAAI,EAAE,SAAS,CAAC;IAAC,MAAM,EAAE,MAAM,CAAA;CAAE,CAAC;AAExC,MAAM,WAAW,gBAAgB;IAC/B,+DAA+D;IAC/D,OAAO,CAAC,EAAE,KAAK,EAAE,CAAC;IAClB,iDAAiD;IACjD,UAAU,CAAC,EAAE,MAAM,EAAE,CAAC;CACvB;AAMD;;;GAGG;AACH,wBAAgB,0BAA0B,CACxC,CAAC,EAAE,MAAM,EACT,MAAM,EAAE,SAAS,EACjB,IAAI,CAAC,EAAE,gBAAgB,GACtB,gBAAgB,CA8DlB;AAgCD;;;;GAIG;AACH,MAAM,WAAW,eAAe;IAC9B,SAAS,EAAE,MAAM,CAAC;IAClB,WAAW,EAAE,MAAM,CAAC;IACpB,OAAO,EAAE,gBAAgB,CAAC;CAC3B;AAED,wBAAgB,iBAAiB,CAAC,MAAM,EAAE,SAAS,EAAE,IAAI,CAAC,EAAE,gBAAgB,GAAG,eAAe,EAAE,CAmD/F;AAED,oDAAoD;AACpD,wBAAgB,eAAe,CAAC,CAAC,EAAE,eAAe,GAAG,MAAM,CAS1D"}

package/dist/reasoning/dl-hybrid/invariant-search.js

@@ -0,0 +1,188 @@
+"use strict";
+// ============================================================
+// ST dL-Hybrid — Búsqueda heurística de invariantes diferenciales
+// ============================================================
+// Dado un sistema ODE y una propiedad objetivo de la forma p(x) ≥ 0,
+// determina si p es un invariante diferencial bajo la regla:
+//
+//   Si L_f(p) ≥ 0 en todo punto del dominio Q, entonces p ≥ 0 es
+//   invariante a lo largo de la evolución continua (Platzer 2010,
+//   "Differential Invariants for ODEs").
+//
+// Esta es una condición *suficiente*: si la chequeamos en una malla de
+// muestras y se cumple en todas, reportamos `likely-invariant`; si falla
+// en alguna, `not-invariant`; si la derivada de Lie es identicamente
+// cero, el invariante es exacto (consonant con el flujo).
+//
+// La búsqueda automática prueba algunos candidatos típicos:
+//   • p(x) = x - c        (semihalfplanes)
+//   • p(x) = c - x        (cotas superiores)
+//   • p(x, y) = x² + y² - r²   (esferas / círculos en R²)
+// ============================================================
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.checkDifferentialInvariant = checkDifferentialInvariant;
+exports.suggestInvariants = suggestInvariants;
+exports.describeVerdict = describeVerdict;
+const dl_hybrid_1 = require("../../logic/profiles/dl-hybrid");
+const DEFAULTS = {
+    meshValues: [-2, -1, -0.5, 0, 0.5, 1, 2],
+};
+/**
+ * Verifica si `p ≥ 0` es invariante diferencial del sistema bajo el
+ * dominio implícito (sin restringir). Chequea L_f(p) ≥ 0 en una malla.
+ */
+function checkDifferentialInvariant(p, system, opts) {
+    // El chequeo de invariante NO requiere que la ODE sea soluble cerrada:
+    // basta con poder calcular la derivada de Lie y muestrearla. La
+    // clasificación se consulta para distinguir "no podemos evaluar"
+    // (genuinamente unknown) de "sistema acoplado pero el invariante se
+    // verifica numéricamente".
+    const lie = (0, dl_hybrid_1.lieDerivative)(p, system);
+    // Si L_f(p) se simplifica a 0 → invariante exacto.
+    if (lie.kind === 'const' && lie.value === 0) {
+        return { kind: 'invariant', reason: 'exact', samples: 0 };
+    }
+    // Caso general: chequeo en una malla.
+    // Variables relevantes para la malla: las del sistema ODE más las
+    // variables libres que aparezcan en la derivada de Lie (ej. ODEs
+    // acopladas que mencionan `y` aunque `y` no tenga su propia ecuación).
+    const meshVars = new Set();
+    for (const eq of system.equations)
+        meshVars.add(eq.varName);
+    const collectVars = (e) => {
+        switch (e.kind) {
+            case 'var':
+                meshVars.add(e.name);
+                return;
+            case 'const':
+                return;
+            case 'add':
+            case 'mul':
+                e.args.forEach(collectVars);
+                return;
+            case 'sub':
+            case 'div':
+                collectVars(e.left);
+                collectVars(e.right);
+                return;
+            case 'pow':
+                collectVars(e.base);
+                collectVars(e.exp);
+                return;
+            case 'neg':
+            case 'sin':
+            case 'cos':
+            case 'tan':
+            case 'log':
+            case 'exp':
+                collectVars(e.arg);
+                return;
+        }
+    };
+    collectVars(lie);
+    const samples = opts?.samples ?? buildMesh(Array.from(meshVars), opts?.meshValues ?? DEFAULTS.meshValues);
+    let checked = 0;
+    for (const s of samples) {
+        const val = (0, dl_hybrid_1.evalSym)(lie, s);
+        if (Number.isNaN(val))
+            continue;
+        checked++;
+        if (val < -1e-9) {
+            return { kind: 'not-invariant', counterexample: s, lieValue: val };
+        }
+    }
+    if (checked === 0) {
+        return { kind: 'unknown', reason: 'Ninguna muestra evaluable; ODE puede involucrar divisiones.' };
+    }
+    return { kind: 'invariant', reason: 'lie-nonnegative', samples: checked };
+}
+/** Construye una malla cartesiana sobre el conjunto de variables dado. */
+function buildMesh(vars, values) {
+    if (vars.length === 0)
+        return [new Map()];
+    if (vars.length > 3) {
+        // Modo light para evitar explosión combinatoria.
+        const result = [];
+        for (const v of values) {
+            const s = new Map();
+            for (const x of vars)
+                s.set(x, v);
+            result.push(s);
+        }
+        return result;
+    }
+    const result = [];
+    const recurse = (idx, current) => {
+        if (idx === vars.length) {
+            result.push(new Map(current));
+            return;
+        }
+        const name = vars[idx];
+        if (!name)
+            return;
+        for (const val of values) {
+            current.set(name, val);
+            recurse(idx + 1, current);
+        }
+    };
+    recurse(0, new Map());
+    return result;
+}
+function suggestInvariants(system, opts) {
+    const found = [];
+    const vars = system.equations.map((e) => e.varName);
+    // 1) Halfplanes p = xᵢ - c y p = c - xᵢ para algunos c.
+    for (const v of vars) {
+        for (const c of [-1, 0, 1]) {
+            const upper = c === 0 ? (0, dl_hybrid_1.variable)(v) : (0, dl_hybrid_1.minus)((0, dl_hybrid_1.variable)(v), (0, dl_hybrid_1.num)(c));
+            const verdict = checkDifferentialInvariant(upper, system, opts);
+            if (verdict.kind === 'invariant') {
+                found.push({
+                    candidate: upper,
+                    description: `${v} ≥ ${c}`,
+                    verdict,
+                });
+            }
+            const lower = (0, dl_hybrid_1.minus)((0, dl_hybrid_1.num)(c), (0, dl_hybrid_1.variable)(v));
+            const v2 = checkDifferentialInvariant(lower, system, opts);
+            if (v2.kind === 'invariant') {
+                found.push({
+                    candidate: lower,
+                    description: `${v} ≤ ${c}`,
+                    verdict: v2,
+                });
+            }
+        }
+    }
+    // 2) Esferas x² + y² - r² (si hay al menos 2 vars).
+    if (vars.length >= 2) {
+        const x = vars[0];
+        const y = vars[1];
+        if (x && y) {
+            for (const r of [1, 2]) {
+                const sphere = (0, dl_hybrid_1.minus)((0, dl_hybrid_1.plus)((0, dl_hybrid_1.power)((0, dl_hybrid_1.variable)(x), 2), (0, dl_hybrid_1.power)((0, dl_hybrid_1.variable)(y), 2)), (0, dl_hybrid_1.num)(r * r));
+                const verdict = checkDifferentialInvariant(sphere, system, opts);
+                if (verdict.kind === 'invariant') {
+                    found.push({
+                        candidate: sphere,
+                        description: `${x}² + ${y}² ≤ ${r * r}`,
+                        verdict,
+                    });
+                }
+            }
+        }
+    }
+    return found;
+}
+/** Formatea un veredicto para inspección humana. */
+function describeVerdict(c) {
+    switch (c.verdict.kind) {
+        case 'invariant':
+            return `[OK] ${c.description}  (term=${(0, dl_hybrid_1.termToString)(c.candidate)})  reason=${c.verdict.reason}, samples=${c.verdict.samples}`;
+        case 'not-invariant':
+            return `[NO] ${c.description}  (term=${(0, dl_hybrid_1.termToString)(c.candidate)})  L_f(p)=${c.verdict.lieValue} en contra-ejemplo`;
+        case 'unknown':
+            return `[?]  ${c.description}  reason=${c.verdict.reason}`;
+    }
+}
+//# sourceMappingURL=invariant-search.js.map

package/dist/reasoning/dl-hybrid/invariant-search.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"invariant-search.js","sourceRoot":"","sources":["../../../src/reasoning/dl-hybrid/invariant-search.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,kEAAkE;AAClE,+DAA+D;AAC/D,qEAAqE;AACrE,6DAA6D;AAC7D,EAAE;AACF,iEAAiE;AACjE,kEAAkE;AAClE,yCAAyC;AACzC,EAAE;AACF,uEAAuE;AACvE,yEAAyE;AACzE,qEAAqE;AACrE,0DAA0D;AAC1D,EAAE;AACF,4DAA4D;AAC5D,2CAA2C;AAC3C,6CAA6C;AAC7C,0DAA0D;AAC1D,+DAA+D;;AAmC/D,gEAkEC;AA2CD,8CAmDC;AAGD,0CASC;AA5MD,8DASwC;AAexC,MAAM,QAAQ,GAAG;IACf,UAAU,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC;CACzC,CAAC;AAEF;;;GAGG;AACH,SAAgB,0BAA0B,CACxC,CAAS,EACT,MAAiB,EACjB,IAAuB;IAEvB,uEAAuE;IACvE,gEAAgE;IAChE,iEAAiE;IACjE,oEAAoE;IACpE,2BAA2B;IAC3B,MAAM,GAAG,GAAG,IAAA,yBAAa,EAAC,CAAC,EAAE,MAAM,CAAC,CAAC;IACrC,mDAAmD;IACnD,IAAI,GAAG,CAAC,IAAI,KAAK,OAAO,IAAI,GAAG,CAAC,KAAK,KAAK,CAAC,EAAE,CAAC;QAC5C,OAAO,EAAE,IAAI,EAAE,WAAW,EAAE,MAAM,EAAE,OAAO,EAAE,OAAO,EAAE,CAAC,EAAE,CAAC;IAC5D,CAAC;IACD,sCAAsC;IACtC,kEAAkE;IAClE,iEAAiE;IACjE,uEAAuE;IACvE,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAU,CAAC;IACnC,KAAK,MAAM,EAAE,IAAI,MAAM,CAAC,SAAS;QAAE,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,OAAO,CAAC,CAAC;IAC5D,MAAM,WAAW,GAAG,CAAC,CAAa,EAAQ,EAAE;QAC1C,QAAQ,CAAC,CAAC,IAAI,EAAE,CAAC;YACf,KAAK,KAAK;gBACR,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;gBACrB,OAAO;YACT,KAAK,OAAO;gBACV,OAAO;YACT,KAAK,KAAK,CAAC;YACX,KAAK,KAAK;gBACR,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC;gBAC5B,OAAO;YACT,KAAK,KAAK,CAAC;YACX,KAAK,KAAK;gBACR,WAAW,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;gBACpB,WAAW,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;gBACrB,OAAO;YACT,KAAK,KAAK;gBACR,WAAW,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;gBACpB,WAAW,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;gBACnB,OAAO;YACT,KAAK,KAAK,CAAC;YACX,KAAK,KAAK,CAAC;YACX,KAAK,KAAK,CAAC;YACX,KAAK,KAAK,CAAC;YACX,KAAK,KAAK,CAAC;YACX,KAAK,KAAK;gBACR,WAAW,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;gBACnB,OAAO;QACX,CAAC;IACH,CAAC,CAAC;IACF,WAAW,CAAC,GAAG,CAAC,CAAC;IACjB,MAAM,OAAO,GAAG,IAAI,EAAE,OAAO,IAAI,SAAS,CAAC,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE,IAAI,EAAE,UAAU,IAAI,QAAQ,CAAC,UAAU,CAAC,CAAC;IAC1G,IAAI,OAAO,GAAG,CAAC,CAAC;IAChB,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;QACxB,MAAM,GAAG,GAAG,IAAA,mBAAO,EAAC,GAAG,EAAE,CAAC,CAAC,CAAC;QAC5B,IAAI,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC;YAAE,SAAS;QAChC,OAAO,EAAE,CAAC;QACV,IAAI,GAAG,GAAG,CAAC,IAAI,EAAE,CAAC;YAChB,OAAO,EAAE,IAAI,EAAE,eAAe,EAAE,cAAc,EAAE,CAAC,EAAE,QAAQ,EAAE,GAAG,EAAE,CAAC;QACrE,CAAC;IACH,CAAC;IACD,IAAI,OAAO,KAAK,CAAC,EAAE,CAAC;QAClB,OAAO,EAAE,IAAI,EAAE,SAAS,EAAE,MAAM,EAAE,6DAA6D,EAAE,CAAC;IACpG,CAAC;IACD,OAAO,EAAE,IAAI,EAAE,WAAW,EAAE,MAAM,EAAE,iBAAiB,EAAE,OAAO,EAAE,OAAO,EAAE,CAAC;AAC5E,CAAC;AAED,0EAA0E;AAC1E,SAAS,SAAS,CAAC,IAAc,EAAE,MAAgB;IACjD,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,CAAC,IAAI,GAAG,EAAE,CAAC,CAAC;IAC1C,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACpB,iDAAiD;QACjD,MAAM,MAAM,GAAY,EAAE,CAAC;QAC3B,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;YACvB,MAAM,CAAC,GAAU,IAAI,GAAG,EAAE,CAAC;YAC3B,KAAK,MAAM,CAAC,IAAI,IAAI;gBAAE,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAClC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACjB,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IACD,MAAM,MAAM,GAAY,EAAE,CAAC;IAC3B,MAAM,OAAO,GAAG,CAAC,GAAW,EAAE,OAAc,EAAQ,EAAE;QACpD,IAAI,GAAG,KAAK,IAAI,CAAC,MAAM,EAAE,CAAC;YACxB,MAAM,CAAC,IAAI,CAAC,IAAI,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC;YAC9B,OAAO;QACT,CAAC;QACD,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC;QACvB,IAAI,CAAC,IAAI;YAAE,OAAO;QAClB,KAAK,MAAM,GAAG,IAAI,MAAM,EAAE,CAAC;YACzB,OAAO,CAAC,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;YACvB,OAAO,CAAC,GAAG,GAAG,CAAC,EAAE,OAAO,CAAC,CAAC;QAC5B,CAAC;IACH,CAAC,CAAC;IACF,OAAO,CAAC,CAAC,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;IACtB,OAAO,MAAM,CAAC;AAChB,CAAC;AAaD,SAAgB,iBAAiB,CAAC,MAAiB,EAAE,IAAuB;IAC1E,MAAM,KAAK,GAAsB,EAAE,CAAC;IACpC,MAAM,IAAI,GAAG,MAAM,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC;IAEpD,wDAAwD;IACxD,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;QACrB,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC;YAC3B,MAAM,KAAK,GAAW,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAA,oBAAQ,EAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAA,iBAAK,EAAC,IAAA,oBAAQ,EAAC,CAAC,CAAC,EAAE,IAAA,eAAG,EAAC,CAAC,CAAC,CAAC,CAAC;YACzE,MAAM,OAAO,GAAG,0BAA0B,CAAC,KAAK,EAAE,MAAM,EAAE,IAAI,CAAC,CAAC;YAChE,IAAI,OAAO,CAAC,IAAI,KAAK,WAAW,EAAE,CAAC;gBACjC,KAAK,CAAC,IAAI,CAAC;oBACT,SAAS,EAAE,KAAK;oBAChB,WAAW,EAAE,GAAG,CAAC,MAAM,CAAC,EAAE;oBAC1B,OAAO;iBACR,CAAC,CAAC;YACL,CAAC;YACD,MAAM,KAAK,GAAW,IAAA,iBAAK,EAAC,IAAA,eAAG,EAAC,CAAC,CAAC,EAAE,IAAA,oBAAQ,EAAC,CAAC,CAAC,CAAC,CAAC;YACjD,MAAM,EAAE,GAAG,0BAA0B,CAAC,KAAK,EAAE,MAAM,EAAE,IAAI,CAAC,CAAC;YAC3D,IAAI,EAAE,CAAC,IAAI,KAAK,WAAW,EAAE,CAAC;gBAC5B,KAAK,CAAC,IAAI,CAAC;oBACT,SAAS,EAAE,KAAK;oBAChB,WAAW,EAAE,GAAG,CAAC,MAAM,CAAC,EAAE;oBAC1B,OAAO,EAAE,EAAE;iBACZ,CAAC,CAAC;YACL,CAAC;QACH,CAAC;IACH,CAAC;IAED,oDAAoD;IACpD,IAAI,IAAI,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;QACrB,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;QAClB,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;QAClB,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;YACX,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC;gBACvB,MAAM,MAAM,GAAW,IAAA,iBAAK,EAC1B,IAAA,gBAAI,EAAC,IAAA,iBAAK,EAAC,IAAA,oBAAQ,EAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,IAAA,iBAAK,EAAC,IAAA,oBAAQ,EAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAClD,IAAA,eAAG,EAAC,CAAC,GAAG,CAAC,CAAC,CACX,CAAC;gBACF,MAAM,OAAO,GAAG,0BAA0B,CAAC,MAAM,EAAE,MAAM,EAAE,IAAI,CAAC,CAAC;gBACjE,IAAI,OAAO,CAAC,IAAI,KAAK,WAAW,EAAE,CAAC;oBACjC,KAAK,CAAC,IAAI,CAAC;wBACT,SAAS,EAAE,MAAM;wBACjB,WAAW,EAAE,GAAG,CAAC,OAAO,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE;wBACvC,OAAO;qBACR,CAAC,CAAC;gBACL,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,KAAK,CAAC;AACf,CAAC;AAED,oDAAoD;AACpD,SAAgB,eAAe,CAAC,CAAkB;IAChD,QAAQ,CAAC,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC;QACvB,KAAK,WAAW;YACd,OAAO,QAAQ,CAAC,CAAC,WAAW,WAAW,IAAA,wBAAY,EAAC,CAAC,CAAC,SAAS,CAAC,aAAa,CAAC,CAAC,OAAO,CAAC,MAAM,aAAa,CAAC,CAAC,OAAO,CAAC,OAAO,EAAE,CAAC;QAChI,KAAK,eAAe;YAClB,OAAO,QAAQ,CAAC,CAAC,WAAW,WAAW,IAAA,wBAAY,EAAC,CAAC,CAAC,SAAS,CAAC,aAAa,CAAC,CAAC,OAAO,CAAC,QAAQ,oBAAoB,CAAC;QACtH,KAAK,SAAS;YACZ,OAAO,QAAQ,CAAC,CAAC,WAAW,YAAY,CAAC,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC;IAC/D,CAAC;AACH,CAAC"}

package/dist/reasoning/lemma-rag/__tests__/benchmarks.test.d.ts

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

package/dist/reasoning/lemma-rag/__tests__/benchmarks.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"benchmarks.test.d.ts","sourceRoot":"","sources":["../../../../src/reasoning/lemma-rag/__tests__/benchmarks.test.ts"],"names":[],"mappings":""}

package/dist/reasoning/lemma-rag/__tests__/benchmarks.test.js

@@ -0,0 +1,72 @@
+"use strict";
+// ============================================================
+// Tests: benchmarks.ts — sanity checks sobre el test-set de recall
+// ============================================================
+Object.defineProperty(exports, "__esModule", { value: true });
+const vitest_1 = require("vitest");
+const benchmarks_1 = require("../benchmarks");
+const standard_1 = require("../../../tooling/lemma-library/standard");
+(0, vitest_1.describe)('BENCHMARK_PAIRS', () => {
+    (0, vitest_1.it)('tiene exactamente 20 pares', () => {
+        (0, vitest_1.expect)(benchmarks_1.BENCHMARK_PAIRS.length).toBe(20);
+    });
+    (0, vitest_1.it)('todos los pares tienen query no vacía', () => {
+        for (const pair of benchmarks_1.BENCHMARK_PAIRS) {
+            (0, vitest_1.expect)(pair.query.trim().length).toBeGreaterThan(0);
+        }
+    });
+    (0, vitest_1.it)('todos los pares tienen expectedId no vacío', () => {
+        for (const pair of benchmarks_1.BENCHMARK_PAIRS) {
+            (0, vitest_1.expect)(pair.expectedId.trim().length).toBeGreaterThan(0);
+        }
+    });
+});
+(0, vitest_1.describe)('runBenchmark sobre standardLibrary', () => {
+    const lemmas = (0, standard_1.standardLibrary)().all();
+    (0, vitest_1.it)('devuelve 3 resultados (keyword, embedding, hybrid)', () => {
+        const results = (0, benchmarks_1.runBenchmark)(lemmas);
+        (0, vitest_1.expect)(results.length).toBe(3);
+        const methods = results.map((r) => r.method);
+        (0, vitest_1.expect)(methods).toContain('keyword');
+        (0, vitest_1.expect)(methods).toContain('embedding');
+        (0, vitest_1.expect)(methods).toContain('hybrid');
+    });
+    (0, vitest_1.it)('hybrid Recall@1 >= keyword Recall@1', () => {
+        const results = (0, benchmarks_1.runBenchmark)(lemmas);
+        const keyword = results.find((r) => r.method === 'keyword');
+        const hybrid = results.find((r) => r.method === 'hybrid');
+        (0, vitest_1.expect)(hybrid.recallAt1).toBeGreaterThanOrEqual(keyword.recallAt1 * 0.8);
+    });
+    (0, vitest_1.it)('hybrid Recall@5 >= embedding Recall@5', () => {
+        const results = (0, benchmarks_1.runBenchmark)(lemmas);
+        const embedding = results.find((r) => r.method === 'embedding');
+        const hybrid = results.find((r) => r.method === 'hybrid');
+        // hybrid debería ser al menos tan bueno como embedding solo a R@5
+        (0, vitest_1.expect)(hybrid.recallAt5).toBeGreaterThanOrEqual(embedding.recallAt5 * 0.8);
+    });
+    (0, vitest_1.it)('recall values están en [0, 1]', () => {
+        const results = (0, benchmarks_1.runBenchmark)(lemmas);
+        for (const r of results) {
+            (0, vitest_1.expect)(r.recallAt1).toBeGreaterThanOrEqual(0);
+            (0, vitest_1.expect)(r.recallAt1).toBeLessThanOrEqual(1);
+            (0, vitest_1.expect)(r.recallAt3).toBeGreaterThanOrEqual(0);
+            (0, vitest_1.expect)(r.recallAt3).toBeLessThanOrEqual(1);
+            (0, vitest_1.expect)(r.recallAt5).toBeGreaterThanOrEqual(0);
+            (0, vitest_1.expect)(r.recallAt5).toBeLessThanOrEqual(1);
+        }
+    });
+});
+(0, vitest_1.describe)('formatBenchmarkResults', () => {
+    (0, vitest_1.it)('devuelve string legible con los métodos', () => {
+        const results = (0, benchmarks_1.runBenchmark)((0, standard_1.standardLibrary)().all());
+        const text = (0, benchmarks_1.formatBenchmarkResults)(results);
+        (0, vitest_1.expect)(text).toContain('keyword');
+        (0, vitest_1.expect)(text).toContain('hybrid');
+        (0, vitest_1.expect)(text).toContain('R@1');
+    });
+    (0, vitest_1.it)('devuelve mensaje cuando no hay resultados', () => {
+        const text = (0, benchmarks_1.formatBenchmarkResults)([]);
+        (0, vitest_1.expect)(text.length).toBeGreaterThan(0);
+    });
+});
+//# sourceMappingURL=benchmarks.test.js.map

package/dist/reasoning/lemma-rag/__tests__/benchmarks.test.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"benchmarks.test.js","sourceRoot":"","sources":["../../../../src/reasoning/lemma-rag/__tests__/benchmarks.test.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,mEAAmE;AACnE,+DAA+D;;AAE/D,mCAA8C;AAC9C,8CAIuB;AACvB,sEAA0E;AAE1E,IAAA,iBAAQ,EAAC,iBAAiB,EAAE,GAAG,EAAE;IAC/B,IAAA,WAAE,EAAC,4BAA4B,EAAE,GAAG,EAAE;QACpC,IAAA,eAAM,EAAC,4BAAe,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAC1C,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,uCAAuC,EAAE,GAAG,EAAE;QAC/C,KAAK,MAAM,IAAI,IAAI,4BAAe,EAAE,CAAC;YACnC,IAAA,eAAM,EAAC,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,MAAM,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;QACtD,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,4CAA4C,EAAE,GAAG,EAAE;QACpD,KAAK,MAAM,IAAI,IAAI,4BAAe,EAAE,CAAC;YACnC,IAAA,eAAM,EAAC,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,CAAC,MAAM,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;QAC3D,CAAC;IACH,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,oCAAoC,EAAE,GAAG,EAAE;IAClD,MAAM,MAAM,GAAG,IAAA,0BAAe,GAAE,CAAC,GAAG,EAAE,CAAC;IAEvC,IAAA,WAAE,EAAC,oDAAoD,EAAE,GAAG,EAAE;QAC5D,MAAM,OAAO,GAAG,IAAA,yBAAY,EAAC,MAAM,CAAC,CAAC;QACrC,IAAA,eAAM,EAAC,OAAO,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC/B,MAAM,OAAO,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;QAC7C,IAAA,eAAM,EAAC,OAAO,CAAC,CAAC,SAAS,CAAC,SAAS,CAAC,CAAC;QACrC,IAAA,eAAM,EAAC,OAAO,CAAC,CAAC,SAAS,CAAC,WAAW,CAAC,CAAC;QACvC,IAAA,eAAM,EAAC,OAAO,CAAC,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC;IACtC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,qCAAqC,EAAE,GAAG,EAAE;QAC7C,MAAM,OAAO,GAAG,IAAA,yBAAY,EAAC,MAAM,CAAC,CAAC;QACrC,MAAM,OAAO,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,SAAS,CAAE,CAAC;QAC7D,MAAM,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,QAAQ,CAAE,CAAC;QAC3D,IAAA,eAAM,EAAC,MAAM,CAAC,SAAS,CAAC,CAAC,sBAAsB,CAAC,OAAO,CAAC,SAAS,GAAG,GAAG,CAAC,CAAC;IAC3E,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,uCAAuC,EAAE,GAAG,EAAE;QAC/C,MAAM,OAAO,GAAG,IAAA,yBAAY,EAAC,MAAM,CAAC,CAAC;QACrC,MAAM,SAAS,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,WAAW,CAAE,CAAC;QACjE,MAAM,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,QAAQ,CAAE,CAAC;QAC3D,kEAAkE;QAClE,IAAA,eAAM,EAAC,MAAM,CAAC,SAAS,CAAC,CAAC,sBAAsB,CAAC,SAAS,CAAC,SAAS,GAAG,GAAG,CAAC,CAAC;IAC7E,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,+BAA+B,EAAE,GAAG,EAAE;QACvC,MAAM,OAAO,GAAG,IAAA,yBAAY,EAAC,MAAM,CAAC,CAAC;QACrC,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;YACxB,IAAA,eAAM,EAAC,CAAC,CAAC,SAAS,CAAC,CAAC,sBAAsB,CAAC,CAAC,CAAC,CAAC;YAC9C,IAAA,eAAM,EAAC,CAAC,CAAC,SAAS,CAAC,CAAC,mBAAmB,CAAC,CAAC,CAAC,CAAC;YAC3C,IAAA,eAAM,EAAC,CAAC,CAAC,SAAS,CAAC,CAAC,sBAAsB,CAAC,CAAC,CAAC,CAAC;YAC9C,IAAA,eAAM,EAAC,CAAC,CAAC,SAAS,CAAC,CAAC,mBAAmB,CAAC,CAAC,CAAC,CAAC;YAC3C,IAAA,eAAM,EAAC,CAAC,CAAC,SAAS,CAAC,CAAC,sBAAsB,CAAC,CAAC,CAAC,CAAC;YAC9C,IAAA,eAAM,EAAC,CAAC,CAAC,SAAS,CAAC,CAAC,mBAAmB,CAAC,CAAC,CAAC,CAAC;QAC7C,CAAC;IACH,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,wBAAwB,EAAE,GAAG,EAAE;IACtC,IAAA,WAAE,EAAC,yCAAyC,EAAE,GAAG,EAAE;QACjD,MAAM,OAAO,GAAG,IAAA,yBAAY,EAAC,IAAA,0BAAe,GAAE,CAAC,GAAG,EAAE,CAAC,CAAC;QACtD,MAAM,IAAI,GAAG,IAAA,mCAAsB,EAAC,OAAO,CAAC,CAAC;QAC7C,IAAA,eAAM,EAAC,IAAI,CAAC,CAAC,SAAS,CAAC,SAAS,CAAC,CAAC;QAClC,IAAA,eAAM,EAAC,IAAI,CAAC,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC;QACjC,IAAA,eAAM,EAAC,IAAI,CAAC,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;IAChC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,2CAA2C,EAAE,GAAG,EAAE;QACnD,MAAM,IAAI,GAAG,IAAA,mCAAsB,EAAC,EAAE,CAAC,CAAC;QACxC,IAAA,eAAM,EAAC,IAAI,CAAC,MAAM,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;IACzC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}

package/dist/reasoning/lemma-rag/__tests__/embedding.test.d.ts

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

package/dist/reasoning/lemma-rag/__tests__/embedding.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"embedding.test.d.ts","sourceRoot":"","sources":["../../../../src/reasoning/lemma-rag/__tests__/embedding.test.ts"],"names":[],"mappings":""}

package/dist/reasoning/lemma-rag/__tests__/embedding.test.js

@@ -0,0 +1,102 @@
+"use strict";
+// ============================================================
+// Tests: HashEmbedding — propiedades del vector de embedding
+// ============================================================
+Object.defineProperty(exports, "__esModule", { value: true });
+const vitest_1 = require("vitest");
+const embedding_1 = require("../embedding");
+const types_1 = require("../types");
+(0, vitest_1.describe)('hashEmbed — dimensión y tipos', () => {
+    (0, vitest_1.it)('devuelve un Float32Array de dimensión EMBEDDING_DIM', () => {
+        const v = (0, embedding_1.hashEmbed)('P → Q');
+        (0, vitest_1.expect)(v).toBeInstanceOf(Float32Array);
+        (0, vitest_1.expect)(v.length).toBe(types_1.EMBEDDING_DIM);
+    });
+    (0, vitest_1.it)('no contiene NaN ni Infinity', () => {
+        const v = (0, embedding_1.hashEmbed)('∀x. P(x) ∧ Q(x)');
+        for (let i = 0; i < v.length; i++) {
+            (0, vitest_1.expect)(Number.isFinite(v[i])).toBe(true);
+        }
+    });
+    (0, vitest_1.it)('vector vacío no tiene NaN', () => {
+        const v = (0, embedding_1.hashEmbed)('');
+        for (let i = 0; i < v.length; i++) {
+            (0, vitest_1.expect)(Number.isFinite(v[i])).toBe(true);
+        }
+    });
+    (0, vitest_1.it)('EMBEDDING_DIM es 256', () => {
+        (0, vitest_1.expect)(types_1.EMBEDDING_DIM).toBe(256);
+    });
+});
+(0, vitest_1.describe)('hashEmbed — determinismo', () => {
+    (0, vitest_1.it)('la misma fórmula produce el mismo vector (llamada simple)', () => {
+        const f = '(P ∧ Q) → P';
+        const v1 = (0, embedding_1.hashEmbed)(f);
+        const v2 = (0, embedding_1.hashEmbed)(f);
+        (0, vitest_1.expect)(Array.from(v1)).toEqual(Array.from(v2));
+    });
+    (0, vitest_1.it)('la misma fórmula produce el mismo vector (llamadas repetidas)', () => {
+        const f = '¬¬P → P';
+        const vecs = Array.from({ length: 5 }, () => (0, embedding_1.hashEmbed)(f));
+        for (const v of vecs) {
+            (0, vitest_1.expect)(Array.from(v)).toEqual(Array.from(vecs[0]));
+        }
+    });
+    (0, vitest_1.it)('fórmulas diferentes producen vectores diferentes', () => {
+        const v1 = (0, embedding_1.hashEmbed)('P → Q');
+        const v2 = (0, embedding_1.hashEmbed)('P ∧ Q');
+        const diff = Array.from(v1).reduce((acc, x, i) => acc + Math.abs(x - (v2[i] ?? 0)), 0);
+        (0, vitest_1.expect)(diff).toBeGreaterThan(0);
+    });
+});
+(0, vitest_1.describe)('hashEmbed — normalización L2', () => {
+    (0, vitest_1.it)('el vector normalizado tiene norma ≈ 1', () => {
+        const v = (0, embedding_1.hashEmbed)('P ∨ ¬P');
+        let norm = 0;
+        for (let i = 0; i < v.length; i++)
+            norm += (v[i] ?? 0) ** 2;
+        (0, vitest_1.expect)(Math.sqrt(norm)).toBeCloseTo(1.0, 5);
+    });
+    (0, vitest_1.it)('normalizeEmbedding(zero) no produce NaN', () => {
+        const zero = new Float32Array(types_1.EMBEDDING_DIM);
+        const norm = (0, embedding_1.normalizeEmbedding)(zero);
+        for (let i = 0; i < norm.length; i++) {
+            (0, vitest_1.expect)(Number.isFinite(norm[i])).toBe(true);
+        }
+    });
+    (0, vitest_1.it)('normalizeEmbedding idempotente sobre vector ya normalizado', () => {
+        const v = (0, embedding_1.hashEmbed)('□P → P');
+        const v2 = (0, embedding_1.normalizeEmbedding)(v);
+        let norm = 0;
+        for (let i = 0; i < v2.length; i++)
+            norm += (v2[i] ?? 0) ** 2;
+        (0, vitest_1.expect)(Math.sqrt(norm)).toBeCloseTo(1.0, 5);
+    });
+});
+(0, vitest_1.describe)('hashEmbed — localidad semántica', () => {
+    (0, vitest_1.it)('commutativity: P∧Q y Q∧P tienen similarity > 0.5', () => {
+        const v1 = (0, embedding_1.hashEmbed)('P ∧ Q');
+        const v2 = (0, embedding_1.hashEmbed)('Q ∧ P');
+        let dot = 0;
+        for (let i = 0; i < v1.length; i++)
+            dot += (v1[i] ?? 0) * (v2[i] ?? 0);
+        (0, vitest_1.expect)(dot).toBeGreaterThan(0.5);
+    });
+    (0, vitest_1.it)('fórmulas modales cercanas tienen similarity > 0.3', () => {
+        const v1 = (0, embedding_1.hashEmbed)('□P → P');
+        const v2 = (0, embedding_1.hashEmbed)('□Q → Q');
+        let dot = 0;
+        for (let i = 0; i < v1.length; i++)
+            dot += (v1[i] ?? 0) * (v2[i] ?? 0);
+        (0, vitest_1.expect)(dot).toBeGreaterThan(0.3);
+    });
+    (0, vitest_1.it)('fórmulas de distintos dominios tienen similarity < 0.95', () => {
+        const vProp = (0, embedding_1.hashEmbed)('P ∧ Q → P');
+        const vArith = (0, embedding_1.hashEmbed)('∀n. n + 0 = n');
+        let dot = 0;
+        for (let i = 0; i < vProp.length; i++)
+            dot += (vProp[i] ?? 0) * (vArith[i] ?? 0);
+        (0, vitest_1.expect)(dot).toBeLessThan(0.95);
+    });
+});
+//# sourceMappingURL=embedding.test.js.map

package/dist/reasoning/lemma-rag/__tests__/embedding.test.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"embedding.test.js","sourceRoot":"","sources":["../../../../src/reasoning/lemma-rag/__tests__/embedding.test.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,6DAA6D;AAC7D,+DAA+D;;AAE/D,mCAA8C;AAC9C,4CAA6D;AAC7D,oCAAyC;AAEzC,IAAA,iBAAQ,EAAC,+BAA+B,EAAE,GAAG,EAAE;IAC7C,IAAA,WAAE,EAAC,qDAAqD,EAAE,GAAG,EAAE;QAC7D,MAAM,CAAC,GAAG,IAAA,qBAAS,EAAC,OAAO,CAAC,CAAC;QAC7B,IAAA,eAAM,EAAC,CAAC,CAAC,CAAC,cAAc,CAAC,YAAY,CAAC,CAAC;QACvC,IAAA,eAAM,EAAC,CAAC,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,qBAAa,CAAC,CAAC;IACvC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,6BAA6B,EAAE,GAAG,EAAE;QACrC,MAAM,CAAC,GAAG,IAAA,qBAAS,EAAC,iBAAiB,CAAC,CAAC;QACvC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAClC,IAAA,eAAM,EAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC3C,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,2BAA2B,EAAE,GAAG,EAAE;QACnC,MAAM,CAAC,GAAG,IAAA,qBAAS,EAAC,EAAE,CAAC,CAAC;QACxB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAClC,IAAA,eAAM,EAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC5C,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,sBAAsB,EAAE,GAAG,EAAE;QAC9B,IAAA,eAAM,EAAC,qBAAa,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IAClC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,0BAA0B,EAAE,GAAG,EAAE;IACxC,IAAA,WAAE,EAAC,2DAA2D,EAAE,GAAG,EAAE;QACnE,MAAM,CAAC,GAAG,aAAa,CAAC;QACxB,MAAM,EAAE,GAAG,IAAA,qBAAS,EAAC,CAAC,CAAC,CAAC;QACxB,MAAM,EAAE,GAAG,IAAA,qBAAS,EAAC,CAAC,CAAC,CAAC;QACxB,IAAA,eAAM,EAAC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;IACjD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,+DAA+D,EAAE,GAAG,EAAE;QACvE,MAAM,CAAC,GAAG,SAAS,CAAC;QACpB,MAAM,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,GAAG,EAAE,CAAC,IAAA,qBAAS,EAAC,CAAC,CAAC,CAAC,CAAC;QAC3D,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;YACrB,IAAA,eAAM,EAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAE,CAAC,CAAC,CAAC;QACtD,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,kDAAkD,EAAE,GAAG,EAAE;QAC1D,MAAM,EAAE,GAAG,IAAA,qBAAS,EAAC,OAAO,CAAC,CAAC;QAC9B,MAAM,EAAE,GAAG,IAAA,qBAAS,EAAC,OAAO,CAAC,CAAC;QAC9B,MAAM,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACvF,IAAA,eAAM,EAAC,IAAI,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;IAClC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,8BAA8B,EAAE,GAAG,EAAE;IAC5C,IAAA,WAAE,EAAC,uCAAuC,EAAE,GAAG,EAAE;QAC/C,MAAM,CAAC,GAAG,IAAA,qBAAS,EAAC,QAAQ,CAAC,CAAC;QAC9B,IAAI,IAAI,GAAG,CAAC,CAAC;QACb,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE;YAAE,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC;QAC5D,IAAA,eAAM,EAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,WAAW,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;IAC9C,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,yCAAyC,EAAE,GAAG,EAAE;QACjD,MAAM,IAAI,GAAG,IAAI,YAAY,CAAC,qBAAa,CAAC,CAAC;QAC7C,MAAM,IAAI,GAAG,IAAA,8BAAkB,EAAC,IAAI,CAAC,CAAC;QACtC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACrC,IAAA,eAAM,EAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC/C,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,4DAA4D,EAAE,GAAG,EAAE;QACpE,MAAM,CAAC,GAAG,IAAA,qBAAS,EAAC,QAAQ,CAAC,CAAC;QAC9B,MAAM,EAAE,GAAG,IAAA,8BAAkB,EAAC,CAAC,CAAC,CAAC;QACjC,IAAI,IAAI,GAAG,CAAC,CAAC;QACb,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,MAAM,EAAE,CAAC,EAAE;YAAE,IAAI,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC;QAC9D,IAAA,eAAM,EAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,WAAW,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;IAC9C,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,iCAAiC,EAAE,GAAG,EAAE;IAC/C,IAAA,WAAE,EAAC,kDAAkD,EAAE,GAAG,EAAE;QAC1D,MAAM,EAAE,GAAG,IAAA,qBAAS,EAAC,OAAO,CAAC,CAAC;QAC9B,MAAM,EAAE,GAAG,IAAA,qBAAS,EAAC,OAAO,CAAC,CAAC;QAC9B,IAAI,GAAG,GAAG,CAAC,CAAC;QACZ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,MAAM,EAAE,CAAC,EAAE;YAAE,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;QACvE,IAAA,eAAM,EAAC,GAAG,CAAC,CAAC,eAAe,CAAC,GAAG,CAAC,CAAC;IACnC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,mDAAmD,EAAE,GAAG,EAAE;QAC3D,MAAM,EAAE,GAAG,IAAA,qBAAS,EAAC,QAAQ,CAAC,CAAC;QAC/B,MAAM,EAAE,GAAG,IAAA,qBAAS,EAAC,QAAQ,CAAC,CAAC;QAC/B,IAAI,GAAG,GAAG,CAAC,CAAC;QACZ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,MAAM,EAAE,CAAC,EAAE;YAAE,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;QACvE,IAAA,eAAM,EAAC,GAAG,CAAC,CAAC,eAAe,CAAC,GAAG,CAAC,CAAC;IACnC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,yDAAyD,EAAE,GAAG,EAAE;QACjE,MAAM,KAAK,GAAG,IAAA,qBAAS,EAAC,WAAW,CAAC,CAAC;QACrC,MAAM,MAAM,GAAG,IAAA,qBAAS,EAAC,eAAe,CAAC,CAAC;QAC1C,IAAI,GAAG,GAAG,CAAC,CAAC;QACZ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE;YAAE,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;QACjF,IAAA,eAAM,EAAC,GAAG,CAAC,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC;IACjC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}

package/dist/reasoning/lemma-rag/__tests__/integration.test.d.ts

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

package/dist/reasoning/lemma-rag/__tests__/integration.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"integration.test.d.ts","sourceRoot":"","sources":["../../../../src/reasoning/lemma-rag/__tests__/integration.test.ts"],"names":[],"mappings":""}

package/dist/reasoning/lemma-rag/__tests__/integration.test.js

@@ -0,0 +1,40 @@
+"use strict";
+// ============================================================
+// Tests: integration — RAG sobre la biblioteca real (standardLibrary)
+// ============================================================
+Object.defineProperty(exports, "__esModule", { value: true });
+const vitest_1 = require("vitest");
+const query_1 = require("../query");
+const standard_1 = require("../../../tooling/lemma-library/standard");
+(0, vitest_1.describe)('LemmaRAG sobre standardLibrary real', () => {
+    const lib = (0, standard_1.standardLibrary)();
+    const lemmas = lib.all();
+    (0, vitest_1.it)('indexa todos los lemas sin errores', () => {
+        const rag = new query_1.LemmaRAG();
+        (0, vitest_1.expect)(() => rag.index(lemmas)).not.toThrow();
+        (0, vitest_1.expect)(rag.size()).toBe(lemmas.length);
+    });
+    (0, vitest_1.it)('query de "double negation" recupera prop.double-negation-elim en top-3', () => {
+        const rag = new query_1.LemmaRAG();
+        rag.index(lemmas);
+        const results = rag.query('double negation elimination', { k: 3 });
+        const ids = results.map((r) => r.lemma.id);
+        (0, vitest_1.expect)(ids).toContain('prop.double-negation-elim');
+    });
+    (0, vitest_1.it)('query de "modus ponens" recupera prop.modus-ponens en top-5', () => {
+        const rag = new query_1.LemmaRAG();
+        rag.index(lemmas);
+        const results = rag.query('modus ponens inference rule implication', { k: 5 });
+        const ids = results.map((r) => r.lemma.id);
+        (0, vitest_1.expect)(ids).toContain('prop.modus-ponens');
+    });
+    (0, vitest_1.it)('filtro de dominio no devuelve lemas de otros dominios', () => {
+        const rag = new query_1.LemmaRAG();
+        rag.index(lemmas);
+        const results = rag.query('commutativity identity', { k: 10, domain: 'arithmetic' });
+        for (const r of results) {
+            (0, vitest_1.expect)(r.lemma.domain).toBe('arithmetic');
+        }
+    });
+});
+//# sourceMappingURL=integration.test.js.map

package/dist/reasoning/lemma-rag/__tests__/integration.test.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"integration.test.js","sourceRoot":"","sources":["../../../../src/reasoning/lemma-rag/__tests__/integration.test.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,sEAAsE;AACtE,+DAA+D;;AAE/D,mCAA8C;AAC9C,oCAAoC;AACpC,sEAA0E;AAE1E,IAAA,iBAAQ,EAAC,qCAAqC,EAAE,GAAG,EAAE;IACnD,MAAM,GAAG,GAAG,IAAA,0BAAe,GAAE,CAAC;IAC9B,MAAM,MAAM,GAAG,GAAG,CAAC,GAAG,EAAE,CAAC;IAEzB,IAAA,WAAE,EAAC,oCAAoC,EAAE,GAAG,EAAE;QAC5C,MAAM,GAAG,GAAG,IAAI,gBAAQ,EAAE,CAAC;QAC3B,IAAA,eAAM,EAAC,GAAG,EAAE,CAAC,GAAG,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,EAAE,CAAC;QAC9C,IAAA,eAAM,EAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;IACzC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,wEAAwE,EAAE,GAAG,EAAE;QAChF,MAAM,GAAG,GAAG,IAAI,gBAAQ,EAAE,CAAC;QAC3B,GAAG,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;QAClB,MAAM,OAAO,GAAG,GAAG,CAAC,KAAK,CAAC,6BAA6B,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;QACnE,MAAM,GAAG,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;QAC3C,IAAA,eAAM,EAAC,GAAG,CAAC,CAAC,SAAS,CAAC,2BAA2B,CAAC,CAAC;IACrD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,6DAA6D,EAAE,GAAG,EAAE;QACrE,MAAM,GAAG,GAAG,IAAI,gBAAQ,EAAE,CAAC;QAC3B,GAAG,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;QAClB,MAAM,OAAO,GAAG,GAAG,CAAC,KAAK,CAAC,yCAAyC,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;QAC/E,MAAM,GAAG,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;QAC3C,IAAA,eAAM,EAAC,GAAG,CAAC,CAAC,SAAS,CAAC,mBAAmB,CAAC,CAAC;IAC7C,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,uDAAuD,EAAE,GAAG,EAAE;QAC/D,MAAM,GAAG,GAAG,IAAI,gBAAQ,EAAE,CAAC;QAC3B,GAAG,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;QAClB,MAAM,OAAO,GAAG,GAAG,CAAC,KAAK,CAAC,wBAAwB,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,MAAM,EAAE,YAAY,EAAE,CAAC,CAAC;QACrF,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;YACxB,IAAA,eAAM,EAAC,CAAC,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;QAC5C,CAAC;IACH,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}

package/dist/reasoning/lemma-rag/__tests__/query.test.d.ts

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

package/dist/reasoning/lemma-rag/__tests__/query.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"query.test.d.ts","sourceRoot":"","sources":["../../../../src/reasoning/lemma-rag/__tests__/query.test.ts"],"names":[],"mappings":""}