@stevenvo780/st-lang 4.14.1 → 4.15.1

package/dist/reasoning/proof-mining/__tests__/generalizer.test.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"generalizer.test.js","sourceRoot":"","sources":["../../../../src/reasoning/proof-mining/__tests__/generalizer.test.ts"],"names":[],"mappings":";;AAAA,mCAA8C;AAC9C,gDAIwB;AAGxB,IAAA,iBAAQ,EAAC,oBAAoB,EAAE,GAAG,EAAE;IAClC,IAAA,WAAE,EAAC,yCAAyC,EAAE,GAAG,EAAE;QACjD,IAAA,eAAM,EAAC,IAAA,gCAAkB,EAAC,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC;YACrC,SAAS,EAAE,EAAE;YACb,gBAAgB,EAAE,CAAC;YACnB,UAAU,EAAE,KAAK;SAClB,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,uDAAuD,EAAE,GAAG,EAAE;QAC/D,MAAM,CAAC,GAAG,IAAA,gCAAkB,EAAC,CAAC,QAAQ,CAAC,CAAC,CAAC;QACzC,IAAA,eAAM,EAAC,CAAC,CAAC,SAAS,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QACnC,IAAA,eAAM,EAAC,CAAC,CAAC,gBAAgB,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACnC,IAAA,eAAM,EAAC,CAAC,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACnC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,+BAA+B,EAAE,GAAG,EAAE;QACvC,MAAM,CAAC,GAAG,IAAA,gCAAkB,EAAC,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC,CAAC;QACnD,IAAA,eAAM,EAAC,CAAC,CAAC,gBAAgB,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACnC,IAAA,eAAM,EAAC,CAAC,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAChC,IAAA,eAAM,EAAC,CAAC,CAAC,SAAS,CAAC,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;QACpC,kEAAkE;QAClE,MAAM,OAAO,GAAG,CAAC,CAAC,SAAS,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;QAC1C,IAAA,eAAM,EAAC,OAAO,EAAE,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAClC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,+BAA+B,EAAE,GAAG,EAAE;QACvC,MAAM,CAAC,GAAG,IAAA,gCAAkB,EAAC,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC,CAAC;QACnD,IAAA,eAAM,EAAC,CAAC,CAAC,gBAAgB,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACnC,IAAA,eAAM,EAAC,CAAC,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAChC,IAAA,eAAM,EAAC,CAAC,CAAC,SAAS,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;QACnC,IAAA,eAAM,EAAC,CAAC,CAAC,SAAS,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;IACrC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,gDAAgD,EAAE,GAAG,EAAE;QACxD,MAAM,CAAC,GAAG,IAAA,gCAAkB,EAAC,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC,CAAC;QACnD,IAAA,eAAM,EAAC,CAAC,CAAC,gBAAgB,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACnC,IAAA,eAAM,EAAC,CAAC,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACnC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,uEAAuE,EAAE,GAAG,EAAE;QAC/E,MAAM,CAAC,GAAG,IAAA,gCAAkB,EAAC,CAAC,SAAS,EAAE,QAAQ,CAAC,CAAC,CAAC;QACpD,IAAA,eAAM,EAAC,CAAC,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACjC,IAAA,eAAM,EAAC,CAAC,CAAC,SAAS,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;IACtC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,8DAA8D,EAAE,GAAG,EAAE;QACtE,MAAM,CAAC,GAAG,IAAA,gCAAkB,EAAC,CAAC,GAAG,EAAE,QAAQ,CAAC,CAAC,CAAC;QAC9C,IAAA,eAAM,EAAC,CAAC,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACjC,IAAA,eAAM,EAAC,CAAC,CAAC,SAAS,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IAChC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,wDAAwD,EAAE,GAAG,EAAE;QAChE,MAAM,CAAC,GAAG,IAAA,gCAAkB,EAAC,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC,CAAC;QACnD,IAAA,eAAM,EAAC,CAAC,CAAC,SAAS,CAAC,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;IACtC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,iBAAiB,EAAE,GAAG,EAAE;IAC/B,IAAA,WAAE,EAAC,6BAA6B,EAAE,GAAG,EAAE;QACrC,MAAM,CAAC,GAAG,IAAA,6BAAe,EAAC,CAAC,YAAY,EAAE,YAAY,CAAC,EAAE,EAAE,mBAAmB,EAAE,CAAC,EAAE,CAAC,CAAC;QACpF,2DAA2D;QAC3D,IAAA,eAAM,EAAC,CAAC,CAAC,gBAAgB,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACnC,IAAA,eAAM,EAAC,CAAC,CAAC,SAAS,CAAC,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;IACzC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,6DAA6D,EAAE,GAAG,EAAE;QACrE,MAAM,CAAC,GAAG,IAAA,6BAAe,EAAC,CAAC,QAAQ,EAAE,QAAQ,CAAC,EAAE;YAC9C,gBAAgB,EAAE,IAAI;YACtB,mBAAmB,EAAE,CAAC;SACvB,CAAC,CAAC;QACH,IAAA,eAAM,EAAC,CAAC,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAClC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,4DAA4D,EAAE,GAAG,EAAE;QACpE,MAAM,CAAC,GAAG,IAAA,6BAAe,EAAC,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC,CAAC;QAChD,IAAA,eAAM,EAAC,CAAC,CAAC,gBAAgB,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;IAChD,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,iBAAiB,EAAE,GAAG,EAAE;IAC/B,IAAA,WAAE,EAAC,6BAA6B,EAAE,GAAG,EAAE;QACrC,IAAA,eAAM,EAAC,IAAA,6BAAe,EAAC,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC;YAClC,SAAS,EAAE,EAAE;YACb,gBAAgB,EAAE,CAAC;YACnB,UAAU,EAAE,KAAK;SAClB,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,kDAAkD,EAAE,GAAG,EAAE;QAC1D,MAAM,CAAC,GAAS,EAAE,IAAI,EAAE,OAAO,EAAE,IAAI,EAAE,GAAG,EAAE,CAAC;QAC7C,MAAM,CAAC,GAAG,IAAA,6BAAe,EAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC/B,IAAA,eAAM,EAAC,CAAC,CAAC,SAAS,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAC9B,IAAA,eAAM,EAAC,CAAC,CAAC,gBAAgB,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACrC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,8CAA8C,EAAE,GAAG,EAAE;QACtD,MAAM,EAAE,GAAS,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,IAAI,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC;QACnF,MAAM,EAAE,GAAS,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,IAAI,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC;QACnF,MAAM,CAAC,GAAG,IAAA,6BAAe,EAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;QACpC,IAAA,eAAM,EAAC,CAAC,CAAC,gBAAgB,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACnC,IAAA,eAAM,EAAC,CAAC,CAAC,SAAS,CAAC,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;IACtC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,oDAAoD,EAAE,GAAG,EAAE;QAC5D,MAAM,EAAE,GAAS,EAAE,IAAI,EAAE,OAAO,EAAE,IAAI,EAAE,GAAG,EAAE,CAAC;QAC9C,MAAM,EAAE,GAAS,EAAE,IAAI,EAAE,OAAO,EAAE,IAAI,EAAE,GAAG,EAAE,CAAC;QAC9C,MAAM,CAAC,GAAG,IAAA,6BAAe,EAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;QACpC,IAAA,eAAM,EAAC,CAAC,CAAC,gBAAgB,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACrC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,iDAAiD,EAAE,GAAG,EAAE;QACzD,MAAM,EAAE,GAAS;YACf,IAAI,EAAE,MAAM;YACZ,IAAI,EAAE,GAAG;YACT,IAAI,EAAE;gBACJ,EAAE,IAAI,EAAE,OAAO,EAAE,IAAI,EAAE,GAAG,EAAE;gBAC5B,EAAE,IAAI,EAAE,OAAO,EAAE,IAAI,EAAE,GAAG,EAAE;aAC7B;SACF,CAAC;QACF,MAAM,EAAE,GAAS;YACf,IAAI,EAAE,MAAM;YACZ,IAAI,EAAE,GAAG;YACT,IAAI,EAAE;gBACJ,EAAE,IAAI,EAAE,OAAO,EAAE,IAAI,EAAE,GAAG,EAAE;gBAC5B,EAAE,IAAI,EAAE,OAAO,EAAE,IAAI,EAAE,GAAG,EAAE;aAC7B;SACF,CAAC;QACF,MAAM,CAAC,GAAG,IAAA,6BAAe,EAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;QACpC,gEAAgE;QAChE,IAAA,eAAM,EAAC,CAAC,CAAC,gBAAgB,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACrC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}

package/dist/reasoning/proof-mining/__tests__/integration.test.d.ts

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

package/dist/reasoning/proof-mining/__tests__/integration.test.d.ts.map

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

package/dist/reasoning/proof-mining/__tests__/integration.test.js

@@ -0,0 +1,128 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+const vitest_1 = require("vitest");
+const theorem_cache_1 = require("../../../runtime/theorem-cache");
+const index_1 = require("../index");
+function reflexivityProof(id, atom) {
+    return {
+        id,
+        conclusion: `${atom} -> ${atom}`,
+        premises: [],
+        profile: 'classical',
+        cost: 12,
+        steps: [
+            // sub-tree raíz: implIntro con un assume.
+            { rule: 'implIntro', inputs: [atom], output: `${atom} -> ${atom}`, depth: 0 },
+            { rule: 'assume', inputs: [], output: atom, depth: 1 },
+        ],
+    };
+}
+function conjunctionProof(id, l, r) {
+    return {
+        id,
+        conclusion: `${l} and ${r}`,
+        premises: [l, r],
+        profile: 'classical',
+        cost: 20,
+        steps: [
+            { rule: 'andI', inputs: [l, r], output: `${l} and ${r}`, depth: 0 },
+            { rule: 'assume', inputs: [], output: l, depth: 1 },
+            { rule: 'assume', inputs: [], output: r, depth: 1 },
+        ],
+    };
+}
+(0, vitest_1.describe)('mineLemmas — pipeline end-to-end', () => {
+    (0, vitest_1.it)('extrae el lemma de reflexividad cuando aparece en múltiples proofs', () => {
+        const corpus = [
+            reflexivityProof('p1', 'P'),
+            reflexivityProof('p2', 'Q'),
+            reflexivityProof('p3', 'R'),
+        ];
+        const { lemmas, stats } = (0, index_1.mineLemmas)(corpus);
+        (0, vitest_1.expect)(lemmas.length).toBeGreaterThan(0);
+        (0, vitest_1.expect)(stats.proofsAnalyzed).toBe(3);
+        (0, vitest_1.expect)(stats.lemmasExtracted).toBeGreaterThan(0);
+        // Al menos un lemma debería tener usageCount = 3.
+        const trio = lemmas.find((l) => l.usageCount === 3);
+        (0, vitest_1.expect)(trio).toBeDefined();
+    });
+    (0, vitest_1.it)('rankea por savings: el lemma más reusado va primero', () => {
+        const corpus = [
+            reflexivityProof('p1', 'P'),
+            reflexivityProof('p2', 'Q'),
+            reflexivityProof('p3', 'R'),
+            conjunctionProof('p4', 'A', 'B'),
+            conjunctionProof('p5', 'C', 'D'),
+        ];
+        const { lemmas } = (0, index_1.mineLemmas)(corpus);
+        (0, vitest_1.expect)(lemmas.length).toBeGreaterThan(0);
+        // El primero debería tener usageCount alto.
+        (0, vitest_1.expect)(lemmas[0]?.usageCount).toBeGreaterThanOrEqual(2);
+    });
+    (0, vitest_1.it)('persiste lemmas en el cache cuando se pasa la opción', () => {
+        const cache = new theorem_cache_1.TheoremCache();
+        const corpus = [
+            reflexivityProof('p1', 'P'),
+            reflexivityProof('p2', 'Q'),
+        ];
+        const { lemmas } = (0, index_1.mineLemmas)(corpus, { cache });
+        (0, vitest_1.expect)(lemmas.length).toBeGreaterThan(0);
+        (0, vitest_1.expect)(cache.stats().entries).toBeGreaterThan(0);
+    });
+    (0, vitest_1.it)('savings = cost_subproof × (usageCount - 1)', () => {
+        const corpus = [
+            reflexivityProof('p1', 'P'),
+            reflexivityProof('p2', 'Q'),
+        ];
+        const { lemmas } = (0, index_1.mineLemmas)(corpus);
+        const trio = lemmas.find((l) => l.usageCount === 2);
+        (0, vitest_1.expect)(trio).toBeDefined();
+        // El sub-tree raíz tiene 2 pasos del proof de cost 12: cost prorrateado
+        // = 12 × (2/2) = 12. usageCount=2 ⇒ savings = 12 × 1 = 12.
+        (0, vitest_1.expect)(trio?.savings).toBeGreaterThan(0);
+    });
+});
+(0, vitest_1.describe)('ProofMiner — fachada stateful', () => {
+    let miner;
+    (0, vitest_1.beforeEach)(() => {
+        miner = new index_1.ProofMiner();
+    });
+    (0, vitest_1.it)('acumula lemmas entre batches', () => {
+        miner.mine([reflexivityProof('p1', 'P'), reflexivityProof('p2', 'Q')]);
+        const after1 = miner.all().length;
+        miner.mine([reflexivityProof('p3', 'R'), reflexivityProof('p4', 'S')]);
+        const after2 = miner.all().length;
+        (0, vitest_1.expect)(after2).toBeGreaterThanOrEqual(after1);
+    });
+    (0, vitest_1.it)('mergea usageCount cuando el mismo lemma aparece en batches distintos', () => {
+        miner.mine([reflexivityProof('p1', 'P'), reflexivityProof('p2', 'Q')]);
+        miner.mine([reflexivityProof('p3', 'R'), reflexivityProof('p4', 'S')]);
+        // Algún lemma debería tener usageCount >= 4 (suma de batches).
+        const allUsages = miner.all().map((l) => l.usageCount);
+        (0, vitest_1.expect)(Math.max(...allUsages)).toBeGreaterThanOrEqual(4);
+    });
+    (0, vitest_1.it)('clear() resetea el estado', () => {
+        miner.mine([reflexivityProof('p1', 'P'), reflexivityProof('p2', 'Q')]);
+        miner.clear();
+        (0, vitest_1.expect)(miner.all()).toHaveLength(0);
+        (0, vitest_1.expect)(miner.stats().proofsAnalyzed).toBe(0);
+    });
+    (0, vitest_1.it)('top(k) devuelve los k mejores', () => {
+        miner.mine([
+            reflexivityProof('p1', 'P'),
+            reflexivityProof('p2', 'Q'),
+            conjunctionProof('p3', 'A', 'B'),
+            conjunctionProof('p4', 'C', 'D'),
+        ]);
+        const top1 = miner.top(1);
+        (0, vitest_1.expect)(top1.length).toBeLessThanOrEqual(1);
+    });
+    (0, vitest_1.it)('cache compartido: getCache devuelve la instancia interna', () => {
+        const cache = new theorem_cache_1.TheoremCache();
+        const m = new index_1.ProofMiner({ cache });
+        m.mine([reflexivityProof('p1', 'P'), reflexivityProof('p2', 'Q')]);
+        (0, vitest_1.expect)(m.getCache()).toBe(cache);
+        (0, vitest_1.expect)(cache.stats().entries).toBeGreaterThan(0);
+    });
+});
+//# sourceMappingURL=integration.test.js.map

package/dist/reasoning/proof-mining/__tests__/integration.test.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"integration.test.js","sourceRoot":"","sources":["../../../../src/reasoning/proof-mining/__tests__/integration.test.ts"],"names":[],"mappings":";;AAAA,mCAA0D;AAC1D,kEAA8D;AAC9D,oCAAkD;AAGlD,SAAS,gBAAgB,CAAC,EAAU,EAAE,IAAY;IAChD,OAAO;QACL,EAAE;QACF,UAAU,EAAE,GAAG,IAAI,OAAO,IAAI,EAAE;QAChC,QAAQ,EAAE,EAAE;QACZ,OAAO,EAAE,WAAW;QACpB,IAAI,EAAE,EAAE;QACR,KAAK,EAAE;YACL,0CAA0C;YAC1C,EAAE,IAAI,EAAE,WAAW,EAAE,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,GAAG,IAAI,OAAO,IAAI,EAAE,EAAE,KAAK,EAAE,CAAC,EAAE;YAC7E,EAAE,IAAI,EAAE,QAAQ,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC,EAAE;SACvD;KACF,CAAC;AACJ,CAAC;AAED,SAAS,gBAAgB,CAAC,EAAU,EAAE,CAAS,EAAE,CAAS;IACxD,OAAO;QACL,EAAE;QACF,UAAU,EAAE,GAAG,CAAC,QAAQ,CAAC,EAAE;QAC3B,QAAQ,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC;QAChB,OAAO,EAAE,WAAW;QACpB,IAAI,EAAE,EAAE;QACR,KAAK,EAAE;YACL,EAAE,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,MAAM,EAAE,GAAG,CAAC,QAAQ,CAAC,EAAE,EAAE,KAAK,EAAE,CAAC,EAAE;YACnE,EAAE,IAAI,EAAE,QAAQ,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE;YACnD,EAAE,IAAI,EAAE,QAAQ,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE;SACpD;KACF,CAAC;AACJ,CAAC;AAED,IAAA,iBAAQ,EAAC,kCAAkC,EAAE,GAAG,EAAE;IAChD,IAAA,WAAE,EAAC,oEAAoE,EAAE,GAAG,EAAE;QAC5E,MAAM,MAAM,GAAG;YACb,gBAAgB,CAAC,IAAI,EAAE,GAAG,CAAC;YAC3B,gBAAgB,CAAC,IAAI,EAAE,GAAG,CAAC;YAC3B,gBAAgB,CAAC,IAAI,EAAE,GAAG,CAAC;SAC5B,CAAC;QACF,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,GAAG,IAAA,kBAAU,EAAC,MAAM,CAAC,CAAC;QAC7C,IAAA,eAAM,EAAC,MAAM,CAAC,MAAM,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;QACzC,IAAA,eAAM,EAAC,KAAK,CAAC,cAAc,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACrC,IAAA,eAAM,EAAC,KAAK,CAAC,eAAe,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;QACjD,kDAAkD;QAClD,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,KAAK,CAAC,CAAC,CAAC;QACpD,IAAA,eAAM,EAAC,IAAI,CAAC,CAAC,WAAW,EAAE,CAAC;IAC7B,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,qDAAqD,EAAE,GAAG,EAAE;QAC7D,MAAM,MAAM,GAAG;YACb,gBAAgB,CAAC,IAAI,EAAE,GAAG,CAAC;YAC3B,gBAAgB,CAAC,IAAI,EAAE,GAAG,CAAC;YAC3B,gBAAgB,CAAC,IAAI,EAAE,GAAG,CAAC;YAC3B,gBAAgB,CAAC,IAAI,EAAE,GAAG,EAAE,GAAG,CAAC;YAChC,gBAAgB,CAAC,IAAI,EAAE,GAAG,EAAE,GAAG,CAAC;SACjC,CAAC;QACF,MAAM,EAAE,MAAM,EAAE,GAAG,IAAA,kBAAU,EAAC,MAAM,CAAC,CAAC;QACtC,IAAA,eAAM,EAAC,MAAM,CAAC,MAAM,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;QACzC,4CAA4C;QAC5C,IAAA,eAAM,EAAC,MAAM,CAAC,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC,sBAAsB,CAAC,CAAC,CAAC,CAAC;IAC1D,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,sDAAsD,EAAE,GAAG,EAAE;QAC9D,MAAM,KAAK,GAAG,IAAI,4BAAY,EAAE,CAAC;QACjC,MAAM,MAAM,GAAG;YACb,gBAAgB,CAAC,IAAI,EAAE,GAAG,CAAC;YAC3B,gBAAgB,CAAC,IAAI,EAAE,GAAG,CAAC;SAC5B,CAAC;QACF,MAAM,EAAE,MAAM,EAAE,GAAG,IAAA,kBAAU,EAAC,MAAM,EAAE,EAAE,KAAK,EAAE,CAAC,CAAC;QACjD,IAAA,eAAM,EAAC,MAAM,CAAC,MAAM,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;QACzC,IAAA,eAAM,EAAC,KAAK,CAAC,KAAK,EAAE,CAAC,OAAO,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;IACnD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,4CAA4C,EAAE,GAAG,EAAE;QACpD,MAAM,MAAM,GAAG;YACb,gBAAgB,CAAC,IAAI,EAAE,GAAG,CAAC;YAC3B,gBAAgB,CAAC,IAAI,EAAE,GAAG,CAAC;SAC5B,CAAC;QACF,MAAM,EAAE,MAAM,EAAE,GAAG,IAAA,kBAAU,EAAC,MAAM,CAAC,CAAC;QACtC,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,KAAK,CAAC,CAAC,CAAC;QACpD,IAAA,eAAM,EAAC,IAAI,CAAC,CAAC,WAAW,EAAE,CAAC;QAC3B,wEAAwE;QACxE,2DAA2D;QAC3D,IAAA,eAAM,EAAC,IAAI,EAAE,OAAO,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;IAC3C,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,+BAA+B,EAAE,GAAG,EAAE;IAC7C,IAAI,KAAiB,CAAC;IAEtB,IAAA,mBAAU,EAAC,GAAG,EAAE;QACd,KAAK,GAAG,IAAI,kBAAU,EAAE,CAAC;IAC3B,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,8BAA8B,EAAE,GAAG,EAAE;QACtC,KAAK,CAAC,IAAI,CAAC,CAAC,gBAAgB,CAAC,IAAI,EAAE,GAAG,CAAC,EAAE,gBAAgB,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;QACvE,MAAM,MAAM,GAAG,KAAK,CAAC,GAAG,EAAE,CAAC,MAAM,CAAC;QAClC,KAAK,CAAC,IAAI,CAAC,CAAC,gBAAgB,CAAC,IAAI,EAAE,GAAG,CAAC,EAAE,gBAAgB,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;QACvE,MAAM,MAAM,GAAG,KAAK,CAAC,GAAG,EAAE,CAAC,MAAM,CAAC;QAClC,IAAA,eAAM,EAAC,MAAM,CAAC,CAAC,sBAAsB,CAAC,MAAM,CAAC,CAAC;IAChD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,sEAAsE,EAAE,GAAG,EAAE;QAC9E,KAAK,CAAC,IAAI,CAAC,CAAC,gBAAgB,CAAC,IAAI,EAAE,GAAG,CAAC,EAAE,gBAAgB,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;QACvE,KAAK,CAAC,IAAI,CAAC,CAAC,gBAAgB,CAAC,IAAI,EAAE,GAAG,CAAC,EAAE,gBAAgB,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;QACvE,+DAA+D;QAC/D,MAAM,SAAS,GAAG,KAAK,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC;QACvD,IAAA,eAAM,EAAC,IAAI,CAAC,GAAG,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,sBAAsB,CAAC,CAAC,CAAC,CAAC;IAC3D,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,2BAA2B,EAAE,GAAG,EAAE;QACnC,KAAK,CAAC,IAAI,CAAC,CAAC,gBAAgB,CAAC,IAAI,EAAE,GAAG,CAAC,EAAE,gBAAgB,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;QACvE,KAAK,CAAC,KAAK,EAAE,CAAC;QACd,IAAA,eAAM,EAAC,KAAK,CAAC,GAAG,EAAE,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QACpC,IAAA,eAAM,EAAC,KAAK,CAAC,KAAK,EAAE,CAAC,cAAc,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC/C,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,+BAA+B,EAAE,GAAG,EAAE;QACvC,KAAK,CAAC,IAAI,CAAC;YACT,gBAAgB,CAAC,IAAI,EAAE,GAAG,CAAC;YAC3B,gBAAgB,CAAC,IAAI,EAAE,GAAG,CAAC;YAC3B,gBAAgB,CAAC,IAAI,EAAE,GAAG,EAAE,GAAG,CAAC;YAChC,gBAAgB,CAAC,IAAI,EAAE,GAAG,EAAE,GAAG,CAAC;SACjC,CAAC,CAAC;QACH,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAC1B,IAAA,eAAM,EAAC,IAAI,CAAC,MAAM,CAAC,CAAC,mBAAmB,CAAC,CAAC,CAAC,CAAC;IAC7C,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,0DAA0D,EAAE,GAAG,EAAE;QAClE,MAAM,KAAK,GAAG,IAAI,4BAAY,EAAE,CAAC;QACjC,MAAM,CAAC,GAAG,IAAI,kBAAU,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC;QACpC,CAAC,CAAC,IAAI,CAAC,CAAC,gBAAgB,CAAC,IAAI,EAAE,GAAG,CAAC,EAAE,gBAAgB,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;QACnE,IAAA,eAAM,EAAC,CAAC,CAAC,QAAQ,EAAE,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACjC,IAAA,eAAM,EAAC,KAAK,CAAC,KAAK,EAAE,CAAC,OAAO,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;IACnD,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}

package/dist/reasoning/proof-mining/__tests__/persistence.test.d.ts

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

package/dist/reasoning/proof-mining/__tests__/persistence.test.d.ts.map

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

package/dist/reasoning/proof-mining/__tests__/persistence.test.js

@@ -0,0 +1,119 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+const vitest_1 = require("vitest");
+const theorem_cache_1 = require("../../../runtime/theorem-cache");
+const persistence_1 = require("../persistence");
+function mkProof(profile = 'classical', cost = 10) {
+    return {
+        conclusion: 'P -> P',
+        premises: ['P'],
+        profile,
+        cost,
+        steps: [
+            { rule: 'MP', inputs: ['P->P', 'P'], output: 'P', depth: 0 },
+            { rule: 'axiom', inputs: [], output: 'P->P', depth: 1 },
+            { rule: 'axiom', inputs: [], output: 'P', depth: 1 },
+        ],
+    };
+}
+function mkLemma(id, statement, profile = 'classical') {
+    return {
+        id,
+        statement,
+        proof: mkProof(profile),
+        abstractionLevel: 1,
+        usageCount: 3,
+        savings: 27,
+        sourceProofs: ['proof-0', 'proof-1', 'proof-2'],
+    };
+}
+(0, vitest_1.describe)('persistLemmas', () => {
+    let cache;
+    (0, vitest_1.beforeEach)(() => {
+        cache = new theorem_cache_1.TheoremCache();
+    });
+    (0, vitest_1.it)('guarda un lemma y retorna su id', () => {
+        const lemma = mkLemma('l1', '?0 -> ?0');
+        const ids = (0, persistence_1.persistLemmas)([lemma], cache, () => 1717171717171);
+        (0, vitest_1.expect)(ids).toHaveLength(1);
+        (0, vitest_1.expect)(typeof ids[0]).toBe('string');
+    });
+    (0, vitest_1.it)('marca el lemma con provedBy = proof-mining', () => {
+        const lemma = mkLemma('l1', '?0 -> ?0');
+        (0, persistence_1.persistLemmas)([lemma], cache);
+        const th = cache.retrieve('?0 -> ?0', 'classical');
+        (0, vitest_1.expect)(th?.metadata.provedBy).toBe(persistence_1.MINED_LEMMA_PROVER);
+    });
+    (0, vitest_1.it)('guarda múltiples lemmas en batch', () => {
+        const lemmas = [
+            mkLemma('a', '?0 -> ?0'),
+            mkLemma('b', '?0 and ?1'),
+            mkLemma('c', '?0 or ?1'),
+        ];
+        const ids = (0, persistence_1.persistLemmas)(lemmas, cache);
+        (0, vitest_1.expect)(ids).toHaveLength(3);
+        (0, vitest_1.expect)(cache.stats().entries).toBe(3);
+    });
+});
+(0, vitest_1.describe)('recoverLemmaFromCache', () => {
+    (0, vitest_1.it)('devuelve undefined si la entry no es un mined lemma', () => {
+        const cache = new theorem_cache_1.TheoremCache();
+        const id = cache.store({
+            formula: 'P -> P',
+            normalizedFormula: '?0 -> ?0',
+            profile: 'classical',
+            proof: 'axiom',
+            metadata: {
+                provedAt: new Date().toISOString(),
+                ms: 5,
+                provedBy: 'other-prover',
+            },
+        });
+        const th = cache.retrieve('P -> P', 'classical');
+        (0, vitest_1.expect)(th).toBeDefined();
+        (0, vitest_1.expect)((0, persistence_1.recoverLemmaFromCache)(th)).toBeUndefined();
+        (0, vitest_1.expect)(id).toBeDefined();
+    });
+    (0, vitest_1.it)('reconstruye un MinedLemma desde el cache', () => {
+        const cache = new theorem_cache_1.TheoremCache();
+        const lemma = mkLemma('l1', '?0 -> ?0');
+        (0, persistence_1.persistLemmas)([lemma], cache);
+        const th = cache.retrieve('?0 -> ?0', 'classical');
+        (0, vitest_1.expect)(th).toBeDefined();
+        const recovered = (0, persistence_1.recoverLemmaFromCache)(th);
+        (0, vitest_1.expect)(recovered).toBeDefined();
+        (0, vitest_1.expect)(recovered?.statement).toBe('?0 -> ?0');
+        (0, vitest_1.expect)(recovered?.usageCount).toBe(3);
+        (0, vitest_1.expect)(recovered?.savings).toBe(27);
+        (0, vitest_1.expect)(recovered?.abstractionLevel).toBe(1);
+    });
+});
+(0, vitest_1.describe)('recoverLemmas', () => {
+    (0, vitest_1.it)('recupera múltiples lemmas dada la lista de statements esperados', () => {
+        const cache = new theorem_cache_1.TheoremCache();
+        const lemmas = [
+            mkLemma('a', '?0 -> ?0'),
+            mkLemma('b', '?0 and ?1'),
+        ];
+        (0, persistence_1.persistLemmas)(lemmas, cache);
+        const recovered = (0, persistence_1.recoverLemmas)(cache, [
+            { statement: '?0 -> ?0', profile: 'classical' },
+            { statement: '?0 and ?1', profile: 'classical' },
+            { statement: 'inexistente', profile: 'classical' },
+        ]);
+        (0, vitest_1.expect)(recovered).toHaveLength(2);
+    });
+    (0, vitest_1.it)('round-trip: persist + recover preserva datos clave', () => {
+        const cache = new theorem_cache_1.TheoremCache();
+        const original = mkLemma('a', '?0 -> ?0');
+        (0, persistence_1.persistLemmas)([original], cache);
+        const [recovered] = (0, persistence_1.recoverLemmas)(cache, [
+            { statement: '?0 -> ?0', profile: 'classical' },
+        ]);
+        (0, vitest_1.expect)(recovered).toBeDefined();
+        (0, vitest_1.expect)(recovered?.usageCount).toBe(original.usageCount);
+        (0, vitest_1.expect)(recovered?.savings).toBe(original.savings);
+        (0, vitest_1.expect)(recovered?.sourceProofs).toEqual(original.sourceProofs);
+    });
+});
+//# sourceMappingURL=persistence.test.js.map

package/dist/reasoning/proof-mining/__tests__/persistence.test.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"persistence.test.js","sourceRoot":"","sources":["../../../../src/reasoning/proof-mining/__tests__/persistence.test.ts"],"names":[],"mappings":";;AAAA,mCAA0D;AAC1D,kEAA8D;AAC9D,gDAKwB;AAGxB,SAAS,OAAO,CAAC,OAAO,GAAG,WAAW,EAAE,IAAI,GAAG,EAAE;IAC/C,OAAO;QACL,UAAU,EAAE,QAAQ;QACpB,QAAQ,EAAE,CAAC,GAAG,CAAC;QACf,OAAO;QACP,IAAI;QACJ,KAAK,EAAE;YACL,EAAE,IAAI,EAAE,IAAI,EAAE,MAAM,EAAE,CAAC,MAAM,EAAE,GAAG,CAAC,EAAE,MAAM,EAAE,GAAG,EAAE,KAAK,EAAE,CAAC,EAAE;YAC5D,EAAE,IAAI,EAAE,OAAO,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,EAAE;YACvD,EAAE,IAAI,EAAE,OAAO,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,GAAG,EAAE,KAAK,EAAE,CAAC,EAAE;SACrD;KACF,CAAC;AACJ,CAAC;AAED,SAAS,OAAO,CAAC,EAAU,EAAE,SAAiB,EAAE,OAAO,GAAG,WAAW;IACnE,OAAO;QACL,EAAE;QACF,SAAS;QACT,KAAK,EAAE,OAAO,CAAC,OAAO,CAAC;QACvB,gBAAgB,EAAE,CAAC;QACnB,UAAU,EAAE,CAAC;QACb,OAAO,EAAE,EAAE;QACX,YAAY,EAAE,CAAC,SAAS,EAAE,SAAS,EAAE,SAAS,CAAC;KAChD,CAAC;AACJ,CAAC;AAED,IAAA,iBAAQ,EAAC,eAAe,EAAE,GAAG,EAAE;IAC7B,IAAI,KAAmB,CAAC;IAExB,IAAA,mBAAU,EAAC,GAAG,EAAE;QACd,KAAK,GAAG,IAAI,4BAAY,EAAE,CAAC;IAC7B,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,iCAAiC,EAAE,GAAG,EAAE;QACzC,MAAM,KAAK,GAAG,OAAO,CAAC,IAAI,EAAE,UAAU,CAAC,CAAC;QACxC,MAAM,GAAG,GAAG,IAAA,2BAAa,EAAC,CAAC,KAAK,CAAC,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC,aAAa,CAAC,CAAC;QAC/D,IAAA,eAAM,EAAC,GAAG,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QAC5B,IAAA,eAAM,EAAC,OAAO,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;IACvC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,4CAA4C,EAAE,GAAG,EAAE;QACpD,MAAM,KAAK,GAAG,OAAO,CAAC,IAAI,EAAE,UAAU,CAAC,CAAC;QACxC,IAAA,2BAAa,EAAC,CAAC,KAAK,CAAC,EAAE,KAAK,CAAC,CAAC;QAC9B,MAAM,EAAE,GAAG,KAAK,CAAC,QAAQ,CAAC,UAAU,EAAE,WAAW,CAAC,CAAC;QACnD,IAAA,eAAM,EAAC,EAAE,EAAE,QAAQ,CAAC,QAAQ,CAAC,CAAC,IAAI,CAAC,gCAAkB,CAAC,CAAC;IACzD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,kCAAkC,EAAE,GAAG,EAAE;QAC1C,MAAM,MAAM,GAAG;YACb,OAAO,CAAC,GAAG,EAAE,UAAU,CAAC;YACxB,OAAO,CAAC,GAAG,EAAE,WAAW,CAAC;YACzB,OAAO,CAAC,GAAG,EAAE,UAAU,CAAC;SACzB,CAAC;QACF,MAAM,GAAG,GAAG,IAAA,2BAAa,EAAC,MAAM,EAAE,KAAK,CAAC,CAAC;QACzC,IAAA,eAAM,EAAC,GAAG,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QAC5B,IAAA,eAAM,EAAC,KAAK,CAAC,KAAK,EAAE,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACxC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,uBAAuB,EAAE,GAAG,EAAE;IACrC,IAAA,WAAE,EAAC,qDAAqD,EAAE,GAAG,EAAE;QAC7D,MAAM,KAAK,GAAG,IAAI,4BAAY,EAAE,CAAC;QACjC,MAAM,EAAE,GAAG,KAAK,CAAC,KAAK,CAAC;YACrB,OAAO,EAAE,QAAQ;YACjB,iBAAiB,EAAE,UAAU;YAC7B,OAAO,EAAE,WAAW;YACpB,KAAK,EAAE,OAAO;YACd,QAAQ,EAAE;gBACR,QAAQ,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;gBAClC,EAAE,EAAE,CAAC;gBACL,QAAQ,EAAE,cAAc;aACzB;SACF,CAAC,CAAC;QACH,MAAM,EAAE,GAAG,KAAK,CAAC,QAAQ,CAAC,QAAQ,EAAE,WAAW,CAAC,CAAC;QACjD,IAAA,eAAM,EAAC,EAAE,CAAC,CAAC,WAAW,EAAE,CAAC;QACzB,IAAA,eAAM,EAAC,IAAA,mCAAqB,EAAC,EAAG,CAAC,CAAC,CAAC,aAAa,EAAE,CAAC;QACnD,IAAA,eAAM,EAAC,EAAE,CAAC,CAAC,WAAW,EAAE,CAAC;IAC3B,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,0CAA0C,EAAE,GAAG,EAAE;QAClD,MAAM,KAAK,GAAG,IAAI,4BAAY,EAAE,CAAC;QACjC,MAAM,KAAK,GAAG,OAAO,CAAC,IAAI,EAAE,UAAU,CAAC,CAAC;QACxC,IAAA,2BAAa,EAAC,CAAC,KAAK,CAAC,EAAE,KAAK,CAAC,CAAC;QAC9B,MAAM,EAAE,GAAG,KAAK,CAAC,QAAQ,CAAC,UAAU,EAAE,WAAW,CAAC,CAAC;QACnD,IAAA,eAAM,EAAC,EAAE,CAAC,CAAC,WAAW,EAAE,CAAC;QACzB,MAAM,SAAS,GAAG,IAAA,mCAAqB,EAAC,EAAG,CAAC,CAAC;QAC7C,IAAA,eAAM,EAAC,SAAS,CAAC,CAAC,WAAW,EAAE,CAAC;QAChC,IAAA,eAAM,EAAC,SAAS,EAAE,SAAS,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QAC9C,IAAA,eAAM,EAAC,SAAS,EAAE,UAAU,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACtC,IAAA,eAAM,EAAC,SAAS,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACpC,IAAA,eAAM,EAAC,SAAS,EAAE,gBAAgB,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC9C,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,eAAe,EAAE,GAAG,EAAE;IAC7B,IAAA,WAAE,EAAC,iEAAiE,EAAE,GAAG,EAAE;QACzE,MAAM,KAAK,GAAG,IAAI,4BAAY,EAAE,CAAC;QACjC,MAAM,MAAM,GAAG;YACb,OAAO,CAAC,GAAG,EAAE,UAAU,CAAC;YACxB,OAAO,CAAC,GAAG,EAAE,WAAW,CAAC;SAC1B,CAAC;QACF,IAAA,2BAAa,EAAC,MAAM,EAAE,KAAK,CAAC,CAAC;QAC7B,MAAM,SAAS,GAAG,IAAA,2BAAa,EAAC,KAAK,EAAE;YACrC,EAAE,SAAS,EAAE,UAAU,EAAE,OAAO,EAAE,WAAW,EAAE;YAC/C,EAAE,SAAS,EAAE,WAAW,EAAE,OAAO,EAAE,WAAW,EAAE;YAChD,EAAE,SAAS,EAAE,aAAa,EAAE,OAAO,EAAE,WAAW,EAAE;SACnD,CAAC,CAAC;QACH,IAAA,eAAM,EAAC,SAAS,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;IACpC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,oDAAoD,EAAE,GAAG,EAAE;QAC5D,MAAM,KAAK,GAAG,IAAI,4BAAY,EAAE,CAAC;QACjC,MAAM,QAAQ,GAAG,OAAO,CAAC,GAAG,EAAE,UAAU,CAAC,CAAC;QAC1C,IAAA,2BAAa,EAAC,CAAC,QAAQ,CAAC,EAAE,KAAK,CAAC,CAAC;QACjC,MAAM,CAAC,SAAS,CAAC,GAAG,IAAA,2BAAa,EAAC,KAAK,EAAE;YACvC,EAAE,SAAS,EAAE,UAAU,EAAE,OAAO,EAAE,WAAW,EAAE;SAChD,CAAC,CAAC;QACH,IAAA,eAAM,EAAC,SAAS,CAAC,CAAC,WAAW,EAAE,CAAC;QAChC,IAAA,eAAM,EAAC,SAAS,EAAE,UAAU,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC;QACxD,IAAA,eAAM,EAAC,SAAS,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC;QAClD,IAAA,eAAM,EAAC,SAAS,EAAE,YAAY,CAAC,CAAC,OAAO,CAAC,QAAQ,CAAC,YAAY,CAAC,CAAC;IACjE,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}

package/dist/reasoning/proof-mining/__tests__/ranker.test.d.ts

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

package/dist/reasoning/proof-mining/__tests__/ranker.test.d.ts.map

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

package/dist/reasoning/proof-mining/__tests__/ranker.test.js

@@ -0,0 +1,93 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+const vitest_1 = require("vitest");
+const ranker_1 = require("../ranker");
+function mkProof(profile = 'classical') {
+    return {
+        conclusion: 'X',
+        premises: [],
+        profile,
+        cost: 10,
+        steps: [{ rule: 'r', inputs: [], output: 'X', depth: 0 }],
+    };
+}
+function mkLemma(id, opts) {
+    return {
+        id,
+        statement: `lemma-${id}`,
+        proof: mkProof(),
+        abstractionLevel: opts.abstraction,
+        usageCount: opts.usage,
+        savings: opts.savings,
+        sourceProofs: [],
+    };
+}
+(0, vitest_1.describe)('scoreLemma', () => {
+    (0, vitest_1.it)('score aumenta con savings', () => {
+        const a = mkLemma('a', { usage: 1, savings: 0, abstraction: 0 });
+        const b = mkLemma('b', { usage: 1, savings: 100, abstraction: 0 });
+        (0, vitest_1.expect)((0, ranker_1.scoreLemma)(b)).toBeGreaterThan((0, ranker_1.scoreLemma)(a));
+    });
+    (0, vitest_1.it)('score aumenta con usageCount', () => {
+        const a = mkLemma('a', { usage: 2, savings: 10, abstraction: 0 });
+        const b = mkLemma('b', { usage: 20, savings: 10, abstraction: 0 });
+        (0, vitest_1.expect)((0, ranker_1.scoreLemma)(b)).toBeGreaterThan((0, ranker_1.scoreLemma)(a));
+    });
+    (0, vitest_1.it)('score aumenta con abstractionLevel', () => {
+        const a = mkLemma('a', { usage: 2, savings: 10, abstraction: 0 });
+        const b = mkLemma('b', { usage: 2, savings: 10, abstraction: 3 });
+        (0, vitest_1.expect)((0, ranker_1.scoreLemma)(b)).toBeGreaterThan((0, ranker_1.scoreLemma)(a));
+    });
+    (0, vitest_1.it)('weights override default', () => {
+        const lemma = mkLemma('a', { usage: 1, savings: 0, abstraction: 10 });
+        const baseScore = (0, ranker_1.scoreLemma)(lemma);
+        const boosted = (0, ranker_1.scoreLemma)(lemma, { generality: 1 });
+        (0, vitest_1.expect)(boosted).toBeGreaterThan(baseScore);
+    });
+});
+(0, vitest_1.describe)('rankLemmas', () => {
+    (0, vitest_1.it)('ordena descendente por score', () => {
+        const a = mkLemma('a', { usage: 1, savings: 0, abstraction: 0 });
+        const b = mkLemma('b', { usage: 10, savings: 100, abstraction: 2 });
+        const c = mkLemma('c', { usage: 5, savings: 50, abstraction: 1 });
+        const ranked = (0, ranker_1.rankLemmas)([a, b, c]);
+        (0, vitest_1.expect)(ranked[0]?.id).toBe('b');
+        (0, vitest_1.expect)(ranked[2]?.id).toBe('a');
+    });
+    (0, vitest_1.it)('en empate de score, mayor usageCount gana', () => {
+        const x = mkLemma('x', { usage: 5, savings: 10, abstraction: 1 });
+        const y = mkLemma('y', { usage: 5, savings: 10, abstraction: 1 });
+        const ranked = (0, ranker_1.rankLemmas)([x, y]);
+        // Misma score → orden por id asc (determinismo)
+        (0, vitest_1.expect)(ranked[0]?.id).toBe('x');
+    });
+    (0, vitest_1.it)('no muta el array original', () => {
+        const a = mkLemma('a', { usage: 1, savings: 0, abstraction: 0 });
+        const b = mkLemma('b', { usage: 10, savings: 100, abstraction: 2 });
+        const input = [a, b];
+        (0, ranker_1.rankLemmas)(input);
+        (0, vitest_1.expect)(input[0]?.id).toBe('a');
+        (0, vitest_1.expect)(input[1]?.id).toBe('b');
+    });
+});
+(0, vitest_1.describe)('topK', () => {
+    (0, vitest_1.it)('devuelve los primeros K', () => {
+        const lemmas = Array.from({ length: 10 }, (_, i) => mkLemma(`l${i}`, { usage: i, savings: i * 10, abstraction: 0 }));
+        const top3 = (0, ranker_1.topK)(lemmas, 3);
+        (0, vitest_1.expect)(top3).toHaveLength(3);
+        // El de mayor usage/savings (l9) debe estar primero.
+        (0, vitest_1.expect)(top3[0]?.id).toBe('l9');
+    });
+    (0, vitest_1.it)('K = 0 devuelve array vacío', () => {
+        const lemmas = [mkLemma('a', { usage: 1, savings: 0, abstraction: 0 })];
+        (0, vitest_1.expect)((0, ranker_1.topK)(lemmas, 0)).toHaveLength(0);
+    });
+    (0, vitest_1.it)('K mayor que la lista devuelve toda la lista', () => {
+        const lemmas = [
+            mkLemma('a', { usage: 1, savings: 0, abstraction: 0 }),
+            mkLemma('b', { usage: 2, savings: 0, abstraction: 0 }),
+        ];
+        (0, vitest_1.expect)((0, ranker_1.topK)(lemmas, 100)).toHaveLength(2);
+    });
+});
+//# sourceMappingURL=ranker.test.js.map

package/dist/reasoning/proof-mining/__tests__/ranker.test.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"ranker.test.js","sourceRoot":"","sources":["../../../../src/reasoning/proof-mining/__tests__/ranker.test.ts"],"names":[],"mappings":";;AAAA,mCAA8C;AAC9C,sCAAyD;AAGzD,SAAS,OAAO,CAAC,OAAO,GAAG,WAAW;IACpC,OAAO;QACL,UAAU,EAAE,GAAG;QACf,QAAQ,EAAE,EAAE;QACZ,OAAO;QACP,IAAI,EAAE,EAAE;QACR,KAAK,EAAE,CAAC,EAAE,IAAI,EAAE,GAAG,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,GAAG,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC;KAC1D,CAAC;AACJ,CAAC;AAED,SAAS,OAAO,CACd,EAAU,EACV,IAA6D;IAE7D,OAAO;QACL,EAAE;QACF,SAAS,EAAE,SAAS,EAAE,EAAE;QACxB,KAAK,EAAE,OAAO,EAAE;QAChB,gBAAgB,EAAE,IAAI,CAAC,WAAW;QAClC,UAAU,EAAE,IAAI,CAAC,KAAK;QACtB,OAAO,EAAE,IAAI,CAAC,OAAO;QACrB,YAAY,EAAE,EAAE;KACjB,CAAC;AACJ,CAAC;AAED,IAAA,iBAAQ,EAAC,YAAY,EAAE,GAAG,EAAE;IAC1B,IAAA,WAAE,EAAC,2BAA2B,EAAE,GAAG,EAAE;QACnC,MAAM,CAAC,GAAG,OAAO,CAAC,GAAG,EAAE,EAAE,KAAK,EAAE,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,WAAW,EAAE,CAAC,EAAE,CAAC,CAAC;QACjE,MAAM,CAAC,GAAG,OAAO,CAAC,GAAG,EAAE,EAAE,KAAK,EAAE,CAAC,EAAE,OAAO,EAAE,GAAG,EAAE,WAAW,EAAE,CAAC,EAAE,CAAC,CAAC;QACnE,IAAA,eAAM,EAAC,IAAA,mBAAU,EAAC,CAAC,CAAC,CAAC,CAAC,eAAe,CAAC,IAAA,mBAAU,EAAC,CAAC,CAAC,CAAC,CAAC;IACvD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,8BAA8B,EAAE,GAAG,EAAE;QACtC,MAAM,CAAC,GAAG,OAAO,CAAC,GAAG,EAAE,EAAE,KAAK,EAAE,CAAC,EAAE,OAAO,EAAE,EAAE,EAAE,WAAW,EAAE,CAAC,EAAE,CAAC,CAAC;QAClE,MAAM,CAAC,GAAG,OAAO,CAAC,GAAG,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,OAAO,EAAE,EAAE,EAAE,WAAW,EAAE,CAAC,EAAE,CAAC,CAAC;QACnE,IAAA,eAAM,EAAC,IAAA,mBAAU,EAAC,CAAC,CAAC,CAAC,CAAC,eAAe,CAAC,IAAA,mBAAU,EAAC,CAAC,CAAC,CAAC,CAAC;IACvD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,oCAAoC,EAAE,GAAG,EAAE;QAC5C,MAAM,CAAC,GAAG,OAAO,CAAC,GAAG,EAAE,EAAE,KAAK,EAAE,CAAC,EAAE,OAAO,EAAE,EAAE,EAAE,WAAW,EAAE,CAAC,EAAE,CAAC,CAAC;QAClE,MAAM,CAAC,GAAG,OAAO,CAAC,GAAG,EAAE,EAAE,KAAK,EAAE,CAAC,EAAE,OAAO,EAAE,EAAE,EAAE,WAAW,EAAE,CAAC,EAAE,CAAC,CAAC;QAClE,IAAA,eAAM,EAAC,IAAA,mBAAU,EAAC,CAAC,CAAC,CAAC,CAAC,eAAe,CAAC,IAAA,mBAAU,EAAC,CAAC,CAAC,CAAC,CAAC;IACvD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,0BAA0B,EAAE,GAAG,EAAE;QAClC,MAAM,KAAK,GAAG,OAAO,CAAC,GAAG,EAAE,EAAE,KAAK,EAAE,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,WAAW,EAAE,EAAE,EAAE,CAAC,CAAC;QACtE,MAAM,SAAS,GAAG,IAAA,mBAAU,EAAC,KAAK,CAAC,CAAC;QACpC,MAAM,OAAO,GAAG,IAAA,mBAAU,EAAC,KAAK,EAAE,EAAE,UAAU,EAAE,CAAC,EAAE,CAAC,CAAC;QACrD,IAAA,eAAM,EAAC,OAAO,CAAC,CAAC,eAAe,CAAC,SAAS,CAAC,CAAC;IAC7C,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,YAAY,EAAE,GAAG,EAAE;IAC1B,IAAA,WAAE,EAAC,8BAA8B,EAAE,GAAG,EAAE;QACtC,MAAM,CAAC,GAAG,OAAO,CAAC,GAAG,EAAE,EAAE,KAAK,EAAE,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,WAAW,EAAE,CAAC,EAAE,CAAC,CAAC;QACjE,MAAM,CAAC,GAAG,OAAO,CAAC,GAAG,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,OAAO,EAAE,GAAG,EAAE,WAAW,EAAE,CAAC,EAAE,CAAC,CAAC;QACpE,MAAM,CAAC,GAAG,OAAO,CAAC,GAAG,EAAE,EAAE,KAAK,EAAE,CAAC,EAAE,OAAO,EAAE,EAAE,EAAE,WAAW,EAAE,CAAC,EAAE,CAAC,CAAC;QAClE,MAAM,MAAM,GAAG,IAAA,mBAAU,EAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QACrC,IAAA,eAAM,EAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAChC,IAAA,eAAM,EAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IAClC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,2CAA2C,EAAE,GAAG,EAAE;QACnD,MAAM,CAAC,GAAG,OAAO,CAAC,GAAG,EAAE,EAAE,KAAK,EAAE,CAAC,EAAE,OAAO,EAAE,EAAE,EAAE,WAAW,EAAE,CAAC,EAAE,CAAC,CAAC;QAClE,MAAM,CAAC,GAAG,OAAO,CAAC,GAAG,EAAE,EAAE,KAAK,EAAE,CAAC,EAAE,OAAO,EAAE,EAAE,EAAE,WAAW,EAAE,CAAC,EAAE,CAAC,CAAC;QAClE,MAAM,MAAM,GAAG,IAAA,mBAAU,EAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAClC,gDAAgD;QAChD,IAAA,eAAM,EAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IAClC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,2BAA2B,EAAE,GAAG,EAAE;QACnC,MAAM,CAAC,GAAG,OAAO,CAAC,GAAG,EAAE,EAAE,KAAK,EAAE,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,WAAW,EAAE,CAAC,EAAE,CAAC,CAAC;QACjE,MAAM,CAAC,GAAG,OAAO,CAAC,GAAG,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,OAAO,EAAE,GAAG,EAAE,WAAW,EAAE,CAAC,EAAE,CAAC,CAAC;QACpE,MAAM,KAAK,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACrB,IAAA,mBAAU,EAAC,KAAK,CAAC,CAAC;QAClB,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAC/B,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IACjC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,MAAM,EAAE,GAAG,EAAE;IACpB,IAAA,WAAE,EAAC,yBAAyB,EAAE,GAAG,EAAE;QACjC,MAAM,MAAM,GAAG,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CACjD,OAAO,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,KAAK,EAAE,CAAC,EAAE,OAAO,EAAE,CAAC,GAAG,EAAE,EAAE,WAAW,EAAE,CAAC,EAAE,CAAC,CAChE,CAAC;QACF,MAAM,IAAI,GAAG,IAAA,aAAI,EAAC,MAAM,EAAE,CAAC,CAAC,CAAC;QAC7B,IAAA,eAAM,EAAC,IAAI,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QAC7B,qDAAqD;QACrD,IAAA,eAAM,EAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACjC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,4BAA4B,EAAE,GAAG,EAAE;QACpC,MAAM,MAAM,GAAG,CAAC,OAAO,CAAC,GAAG,EAAE,EAAE,KAAK,EAAE,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,WAAW,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QACxE,IAAA,eAAM,EAAC,IAAA,aAAI,EAAC,MAAM,EAAE,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;IAC1C,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,6CAA6C,EAAE,GAAG,EAAE;QACrD,MAAM,MAAM,GAAG;YACb,OAAO,CAAC,GAAG,EAAE,EAAE,KAAK,EAAE,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,WAAW,EAAE,CAAC,EAAE,CAAC;YACtD,OAAO,CAAC,GAAG,EAAE,EAAE,KAAK,EAAE,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,WAAW,EAAE,CAAC,EAAE,CAAC;SACvD,CAAC;QACF,IAAA,eAAM,EAAC,IAAA,aAAI,EAAC,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;IAC5C,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}

package/dist/reasoning/proof-mining/extractor.d.ts

@@ -0,0 +1,73 @@
+import type { ProofStep, ProofTrace } from './types';
+/**
+ * Un sub-tree candidato extraído de un proof, antes de pasar a
+ * generalización/ranking.
+ */
+export interface SubtreeCandidate {
+    /** ID del proof origen. */
+    proofId: string;
+    /** Posición del paso raíz en `steps`. */
+    rootIndex: number;
+    /** Pasos que componen el sub-tree (en orden top-down). */
+    steps: ProofStep[];
+    /** Conclusión del sub-tree (= output del paso raíz). */
+    conclusion: string;
+    /** Profile del proof origen. */
+    profile: string;
+    /** Cost asignado (igual al cost del proof original prorrateado). */
+    cost: number;
+}
+/**
+ * Agrupación de sub-trees estructuralmente equivalentes.
+ */
+export interface SubtreeGroup {
+    /** Hash α-canónico común. */
+    key: string;
+    /** Conclusión canónica representativa. */
+    canonicalConclusion: string;
+    /** Sub-trees miembros del grupo. */
+    members: SubtreeCandidate[];
+}
+/**
+ * Descompone un proof en sub-trees a partir de cada paso. El
+ * sub-tree con raíz en `i` incluye `steps[i]` y todos los
+ * descendientes consecutivos (depth > steps[i].depth) hasta que
+ * vuelve a aparecer un paso de depth ≤ steps[i].depth.
+ *
+ * Para steps[i] con depth d_i, el sub-tree es:
+ *   steps[i], steps[i+1], …, steps[j-1]
+ * donde j es el menor índice > i con steps[j].depth ≤ d_i (o
+ * length si no existe).
+ */
+export declare function extractSubtrees(proof: ProofTrace, proofId: string): SubtreeCandidate[];
+/**
+ * Clave estructural canónica de un sub-tree.
+ *
+ * Combina: secuencia de reglas (por orden top-down) + diferencias
+ * relativas de depth (para reconstruir forma del árbol) + outputs
+ * normalizados α-canónicamente.
+ *
+ * El canónico depende del orden de aparición de los identificadores
+ * de cada output, lo que da un hash estable módulo renombrado de
+ * variables.
+ */
+export declare function subtreeKey(sub: SubtreeCandidate): string;
+/**
+ * Agrupa sub-trees por clave estructural canónica.
+ */
+export declare function groupSubtrees(candidates: SubtreeCandidate[]): SubtreeGroup[];
+/**
+ * Identifica sub-pruebas auxiliares en el corpus. Recibe un array
+ * de proofs, devuelve los grupos de sub-trees estructuralmente
+ * equivalentes que pasan los filtros (minReuseThreshold y
+ * minSubtreeSize).
+ *
+ * Esta función NO genera lemmas todavía — solo identifica los
+ * candidatos. `mineLemmas` los procesa, genera el statement y los
+ * persiste.
+ */
+export declare function extractAuxiliaryLemmas(corpus: ProofTrace[], options?: {
+    minReuseThreshold?: number;
+    minSubtreeSize?: number;
+}): SubtreeGroup[];
+//# sourceMappingURL=extractor.d.ts.map

package/dist/reasoning/proof-mining/extractor.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"extractor.d.ts","sourceRoot":"","sources":["../../../src/reasoning/proof-mining/extractor.ts"],"names":[],"mappings":"AAyBA,OAAO,KAAK,EAAE,SAAS,EAAE,UAAU,EAAE,MAAM,SAAS,CAAC;AAErD;;;GAGG;AACH,MAAM,WAAW,gBAAgB;IAC/B,2BAA2B;IAC3B,OAAO,EAAE,MAAM,CAAC;IAChB,yCAAyC;IACzC,SAAS,EAAE,MAAM,CAAC;IAClB,0DAA0D;IAC1D,KAAK,EAAE,SAAS,EAAE,CAAC;IACnB,wDAAwD;IACxD,UAAU,EAAE,MAAM,CAAC;IACnB,gCAAgC;IAChC,OAAO,EAAE,MAAM,CAAC;IAChB,oEAAoE;IACpE,IAAI,EAAE,MAAM,CAAC;CACd;AAED;;GAEG;AACH,MAAM,WAAW,YAAY;IAC3B,6BAA6B;IAC7B,GAAG,EAAE,MAAM,CAAC;IACZ,0CAA0C;IAC1C,mBAAmB,EAAE,MAAM,CAAC;IAC5B,oCAAoC;IACpC,OAAO,EAAE,gBAAgB,EAAE,CAAC;CAC7B;AAMD;;;;;;;;;;GAUG;AACH,wBAAgB,eAAe,CAAC,KAAK,EAAE,UAAU,EAAE,OAAO,EAAE,MAAM,GAAG,gBAAgB,EAAE,CA8BtF;AAED;;;;;;;;;;GAUG;AACH,wBAAgB,UAAU,CAAC,GAAG,EAAE,gBAAgB,GAAG,MAAM,CAoBxD;AAED;;GAEG;AACH,wBAAgB,aAAa,CAAC,UAAU,EAAE,gBAAgB,EAAE,GAAG,YAAY,EAAE,CAgB5E;AAED;;;;;;;;;GASG;AACH,wBAAgB,sBAAsB,CACpC,MAAM,EAAE,UAAU,EAAE,EACpB,OAAO,CAAC,EAAE;IAAE,iBAAiB,CAAC,EAAE,MAAM,CAAC;IAAC,cAAc,CAAC,EAAE,MAAM,CAAA;CAAE,GAChE,YAAY,EAAE,CA2BhB"}