@stevenvo780/st-lang 4.14.0 → 4.15.0

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

@@ -0,0 +1,263 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+const vitest_1 = require("vitest");
+const extractor_1 = require("../extractor");
+function trace(conclusion, steps, cost = 10, profile = 'classical', premises = []) {
+    return {
+        conclusion,
+        premises,
+        profile,
+        cost,
+        steps: steps.map(([rule, inputs, output, depth]) => ({
+            rule,
+            inputs,
+            output,
+            depth,
+        })),
+    };
+}
+(0, vitest_1.describe)('extractSubtrees', () => {
+    (0, vitest_1.it)('devuelve array vacío si el proof no tiene pasos', () => {
+        const p = trace('X', []);
+        (0, vitest_1.expect)((0, extractor_1.extractSubtrees)(p, 'p1')).toEqual([]);
+    });
+    (0, vitest_1.it)('genera un sub-tree por paso del proof', () => {
+        const p = trace('X', [
+            ['MP', ['A->B', 'A'], 'B', 0],
+            ['axiom', [], 'A->B', 1],
+            ['axiom', [], 'A', 1],
+        ]);
+        const subs = (0, extractor_1.extractSubtrees)(p, 'p1');
+        (0, vitest_1.expect)(subs).toHaveLength(3);
+    });
+    (0, vitest_1.it)('el sub-tree raíz cubre todos los pasos', () => {
+        const p = trace('X', [
+            ['MP', ['A->B', 'A'], 'B', 0],
+            ['axiom', [], 'A->B', 1],
+            ['axiom', [], 'A', 1],
+        ]);
+        const root = (0, extractor_1.extractSubtrees)(p, 'p1')[0];
+        (0, vitest_1.expect)(root).toBeDefined();
+        (0, vitest_1.expect)(root?.steps).toHaveLength(3);
+    });
+    (0, vitest_1.it)('un sub-tree de hoja solo contiene un paso', () => {
+        const p = trace('X', [
+            ['MP', ['A->B', 'A'], 'B', 0],
+            ['axiom', [], 'A->B', 1],
+            ['axiom', [], 'A', 1],
+        ]);
+        const subs = (0, extractor_1.extractSubtrees)(p, 'p1');
+        const leaf = subs[2];
+        (0, vitest_1.expect)(leaf?.steps).toHaveLength(1);
+        (0, vitest_1.expect)(leaf?.steps[0]?.rule).toBe('axiom');
+    });
+    (0, vitest_1.it)('respeta el corte por depth cuando hay hermanos', () => {
+        // Árbol: A tiene hijos B y C; B tiene hijo D
+        //   A(0)
+        //   ├ B(1)
+        //   │  └ D(2)
+        //   └ C(1)
+        const p = trace('A', [
+            ['rA', ['B', 'C'], 'A', 0],
+            ['rB', ['D'], 'B', 1],
+            ['rD', [], 'D', 2],
+            ['rC', [], 'C', 1],
+        ]);
+        const subs = (0, extractor_1.extractSubtrees)(p, 'p1');
+        // sub raíz en B: incluye B y D, no C
+        const subB = subs[1];
+        (0, vitest_1.expect)(subB?.steps.map((s) => s.output)).toEqual(['B', 'D']);
+        // sub raíz en C: solo C
+        const subC = subs[3];
+        (0, vitest_1.expect)(subC?.steps).toHaveLength(1);
+        (0, vitest_1.expect)(subC?.steps[0]?.output).toBe('C');
+    });
+});
+(0, vitest_1.describe)('subtreeKey', () => {
+    (0, vitest_1.it)('asigna la misma clave a sub-trees estructuralmente idénticos', () => {
+        const p1 = trace('X', [
+            ['MP', ['P->P', 'P'], 'P', 0],
+            ['axiom', [], 'P->P', 1],
+            ['axiom', [], 'P', 1],
+        ]);
+        const p2 = trace('X', [
+            ['MP', ['Q->Q', 'Q'], 'Q', 0],
+            ['axiom', [], 'Q->Q', 1],
+            ['axiom', [], 'Q', 1],
+        ]);
+        const sub1 = (0, extractor_1.extractSubtrees)(p1, 'p1')[0];
+        const sub2 = (0, extractor_1.extractSubtrees)(p2, 'p2')[0];
+        (0, vitest_1.expect)(sub1).toBeDefined();
+        (0, vitest_1.expect)(sub2).toBeDefined();
+        (0, vitest_1.expect)((0, extractor_1.subtreeKey)(sub1)).toBe((0, extractor_1.subtreeKey)(sub2));
+    });
+    (0, vitest_1.it)('asigna distinta clave a sub-trees con distinta regla', () => {
+        const p1 = trace('X', [
+            ['MP', ['A->B', 'A'], 'B', 0],
+            ['axiom', [], 'A->B', 1],
+            ['axiom', [], 'A', 1],
+        ]);
+        const p2 = trace('X', [
+            ['andI', ['A', 'B'], 'A and B', 0],
+            ['axiom', [], 'A', 1],
+            ['axiom', [], 'B', 1],
+        ]);
+        (0, vitest_1.expect)((0, extractor_1.subtreeKey)((0, extractor_1.extractSubtrees)(p1, 'p1')[0])).not.toBe((0, extractor_1.subtreeKey)((0, extractor_1.extractSubtrees)(p2, 'p2')[0]));
+    });
+});
+(0, vitest_1.describe)('groupSubtrees', () => {
+    (0, vitest_1.it)('agrupa por clave canónica', () => {
+        const p1 = trace('X', [
+            ['MP', ['P->P', 'P'], 'P', 0],
+            ['axiom', [], 'P->P', 1],
+            ['axiom', [], 'P', 1],
+        ]);
+        const p2 = trace('X', [
+            ['MP', ['R->R', 'R'], 'R', 0],
+            ['axiom', [], 'R->R', 1],
+            ['axiom', [], 'R', 1],
+        ]);
+        const sub1 = (0, extractor_1.extractSubtrees)(p1, 'p1');
+        const sub2 = (0, extractor_1.extractSubtrees)(p2, 'p2');
+        const groups = (0, extractor_1.groupSubtrees)([...sub1, ...sub2]);
+        // los 3 sub-trees de p1 deberían tener al menos 1 par equivalente en p2
+        const sized3 = groups.filter((g) => g.members.length >= 2);
+        (0, vitest_1.expect)(sized3.length).toBeGreaterThan(0);
+    });
+});
+(0, vitest_1.describe)('extractAuxiliaryLemmas', () => {
+    (0, vitest_1.it)('encuentra lemmas comunes a 2 proofs con misma estructura', () => {
+        const p1 = trace('X', [
+            ['MP', ['P->P', 'P'], 'P', 0],
+            ['axiom', [], 'P->P', 1],
+            ['axiom', [], 'P', 1],
+        ]);
+        const p2 = trace('Y', [
+            ['MP', ['Q->Q', 'Q'], 'Q', 0],
+            ['axiom', [], 'Q->Q', 1],
+            ['axiom', [], 'Q', 1],
+        ]);
+        const groups = (0, extractor_1.extractAuxiliaryLemmas)([p1, p2]);
+        (0, vitest_1.expect)(groups.length).toBeGreaterThan(0);
+        const root = groups.find((g) => g.members.some((m) => m.steps.length === 3));
+        (0, vitest_1.expect)(root).toBeDefined();
+        (0, vitest_1.expect)(root?.members.length).toBe(2);
+    });
+    (0, vitest_1.it)('respeta minReuseThreshold = 3 (no extrae si solo aparece 2 veces)', () => {
+        const p1 = trace('X', [
+            ['MP', ['P->P', 'P'], 'P', 0],
+            ['axiom', [], 'P->P', 1],
+            ['axiom', [], 'P', 1],
+        ]);
+        const p2 = trace('Y', [
+            ['MP', ['Q->Q', 'Q'], 'Q', 0],
+            ['axiom', [], 'Q->Q', 1],
+            ['axiom', [], 'Q', 1],
+        ]);
+        const groups = (0, extractor_1.extractAuxiliaryLemmas)([p1, p2], { minReuseThreshold: 3 });
+        (0, vitest_1.expect)(groups).toHaveLength(0);
+    });
+    (0, vitest_1.it)('respeta minSubtreeSize = 3 (filtra sub-trees pequeños)', () => {
+        const p1 = trace('X', [
+            ['MP', ['A->B', 'A'], 'B', 0],
+            ['axiom', [], 'A->B', 1],
+        ]);
+        const p2 = trace('Y', [
+            ['MP', ['C->D', 'C'], 'D', 0],
+            ['axiom', [], 'C->D', 1],
+        ]);
+        // Ningún sub-tree tiene >= 3 pasos.
+        const groups = (0, extractor_1.extractAuxiliaryLemmas)([p1, p2], { minSubtreeSize: 3 });
+        (0, vitest_1.expect)(groups).toHaveLength(0);
+    });
+    (0, vitest_1.it)('cuenta proofs distintos, no ocurrencias múltiples dentro del mismo proof', () => {
+        // Dos sub-trees idénticos dentro del MISMO proof no califican.
+        const p1 = trace('X', [
+            ['andI', ['A=A', 'A=A'], '(A=A) and (A=A)', 0],
+            ['refl', [], 'A=A', 1],
+            ['refl', [], 'A=A', 1],
+        ]);
+        const groups = (0, extractor_1.extractAuxiliaryLemmas)([p1], { minReuseThreshold: 2 });
+        (0, vitest_1.expect)(groups).toHaveLength(0);
+    });
+    (0, vitest_1.it)('extrae con 1 proof si minReuseThreshold = 1', () => {
+        const p1 = trace('X', [
+            ['MP', ['A->B', 'A'], 'B', 0],
+            ['axiom', [], 'A->B', 1],
+            ['axiom', [], 'A', 1],
+        ]);
+        const groups = (0, extractor_1.extractAuxiliaryLemmas)([p1], {
+            minReuseThreshold: 1,
+            minSubtreeSize: 2,
+        });
+        (0, vitest_1.expect)(groups.length).toBeGreaterThanOrEqual(1);
+    });
+    (0, vitest_1.it)('agrupa correctamente cuando 3 proofs comparten un sub-tree', () => {
+        const makeP = (label) => trace(label, [
+            ['MP', [`${label}->${label}`, label], label, 0],
+            ['axiom', [], `${label}->${label}`, 1],
+            ['axiom', [], label, 1],
+        ]);
+        const groups = (0, extractor_1.extractAuxiliaryLemmas)([makeP('P'), makeP('Q'), makeP('R')]);
+        // El sub-tree raíz debería tener 3 miembros (uno por proof).
+        const root = groups.find((g) => g.members.some((m) => m.steps.length === 3));
+        (0, vitest_1.expect)(root?.members.length).toBe(3);
+    });
+    (0, vitest_1.it)('proofs sin solapamiento estructural no producen lemmas', () => {
+        const p1 = trace('X', [
+            ['MP', ['A->B', 'A'], 'B', 0],
+            ['axiom', [], 'A->B', 1],
+            ['axiom', [], 'A', 1],
+        ]);
+        const p2 = trace('Y', [
+            ['andE', ['A and B'], 'A', 0],
+            ['axiom', [], 'A and B', 1],
+        ]);
+        (0, vitest_1.expect)((0, extractor_1.extractAuxiliaryLemmas)([p1, p2])).toHaveLength(0);
+    });
+    (0, vitest_1.it)('asigna proofId automáticamente cuando el trace no trae id', () => {
+        const p1 = trace('X', [
+            ['MP', ['P->P', 'P'], 'P', 0],
+            ['axiom', [], 'P->P', 1],
+            ['axiom', [], 'P', 1],
+        ]);
+        const p2 = trace('Y', [
+            ['MP', ['Q->Q', 'Q'], 'Q', 0],
+            ['axiom', [], 'Q->Q', 1],
+            ['axiom', [], 'Q', 1],
+        ]);
+        const groups = (0, extractor_1.extractAuxiliaryLemmas)([p1, p2]);
+        const allIds = new Set();
+        for (const g of groups)
+            for (const m of g.members)
+                allIds.add(m.proofId);
+        (0, vitest_1.expect)(allIds.has('proof-0')).toBe(true);
+        (0, vitest_1.expect)(allIds.has('proof-1')).toBe(true);
+    });
+    (0, vitest_1.it)('respeta proofId explícito cuando se provee', () => {
+        const p1 = {
+            id: 'my-proof-A',
+            ...trace('X', [
+                ['MP', ['P->P', 'P'], 'P', 0],
+                ['axiom', [], 'P->P', 1],
+                ['axiom', [], 'P', 1],
+            ]),
+        };
+        const p2 = {
+            id: 'my-proof-B',
+            ...trace('Y', [
+                ['MP', ['Q->Q', 'Q'], 'Q', 0],
+                ['axiom', [], 'Q->Q', 1],
+                ['axiom', [], 'Q', 1],
+            ]),
+        };
+        const groups = (0, extractor_1.extractAuxiliaryLemmas)([p1, p2]);
+        const allIds = new Set();
+        for (const g of groups)
+            for (const m of g.members)
+                allIds.add(m.proofId);
+        (0, vitest_1.expect)(allIds.has('my-proof-A')).toBe(true);
+        (0, vitest_1.expect)(allIds.has('my-proof-B')).toBe(true);
+    });
+});
+//# sourceMappingURL=extractor.test.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"extractor.test.js","sourceRoot":"","sources":["../../../../src/reasoning/proof-mining/__tests__/extractor.test.ts"],"names":[],"mappings":";;AAAA,mCAA8C;AAC9C,4CAKsB;AAGtB,SAAS,KAAK,CACZ,UAAkB,EAClB,KAAgD,EAChD,IAAI,GAAG,EAAE,EACT,OAAO,GAAG,WAAW,EACrB,WAAqB,EAAE;IAEvB,OAAO;QACL,UAAU;QACV,QAAQ;QACR,OAAO;QACP,IAAI;QACJ,KAAK,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,KAAK,CAAC,EAAE,EAAE,CAAC,CAAC;YACnD,IAAI;YACJ,MAAM;YACN,MAAM;YACN,KAAK;SACN,CAAC,CAAC;KACJ,CAAC;AACJ,CAAC;AAED,IAAA,iBAAQ,EAAC,iBAAiB,EAAE,GAAG,EAAE;IAC/B,IAAA,WAAE,EAAC,iDAAiD,EAAE,GAAG,EAAE;QACzD,MAAM,CAAC,GAAG,KAAK,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC;QACzB,IAAA,eAAM,EAAC,IAAA,2BAAe,EAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;IAC/C,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,uCAAuC,EAAE,GAAG,EAAE;QAC/C,MAAM,CAAC,GAAG,KAAK,CAAC,GAAG,EAAE;YACnB,CAAC,IAAI,EAAE,CAAC,MAAM,EAAE,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC;YAC7B,CAAC,OAAO,EAAE,EAAE,EAAE,MAAM,EAAE,CAAC,CAAC;YACxB,CAAC,OAAO,EAAE,EAAE,EAAE,GAAG,EAAE,CAAC,CAAC;SACtB,CAAC,CAAC;QACH,MAAM,IAAI,GAAG,IAAA,2BAAe,EAAC,CAAC,EAAE,IAAI,CAAC,CAAC;QACtC,IAAA,eAAM,EAAC,IAAI,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;IAC/B,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,wCAAwC,EAAE,GAAG,EAAE;QAChD,MAAM,CAAC,GAAG,KAAK,CAAC,GAAG,EAAE;YACnB,CAAC,IAAI,EAAE,CAAC,MAAM,EAAE,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC;YAC7B,CAAC,OAAO,EAAE,EAAE,EAAE,MAAM,EAAE,CAAC,CAAC;YACxB,CAAC,OAAO,EAAE,EAAE,EAAE,GAAG,EAAE,CAAC,CAAC;SACtB,CAAC,CAAC;QACH,MAAM,IAAI,GAAG,IAAA,2BAAe,EAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;QACzC,IAAA,eAAM,EAAC,IAAI,CAAC,CAAC,WAAW,EAAE,CAAC;QAC3B,IAAA,eAAM,EAAC,IAAI,EAAE,KAAK,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;IACtC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,2CAA2C,EAAE,GAAG,EAAE;QACnD,MAAM,CAAC,GAAG,KAAK,CAAC,GAAG,EAAE;YACnB,CAAC,IAAI,EAAE,CAAC,MAAM,EAAE,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC;YAC7B,CAAC,OAAO,EAAE,EAAE,EAAE,MAAM,EAAE,CAAC,CAAC;YACxB,CAAC,OAAO,EAAE,EAAE,EAAE,GAAG,EAAE,CAAC,CAAC;SACtB,CAAC,CAAC;QACH,MAAM,IAAI,GAAG,IAAA,2BAAe,EAAC,CAAC,EAAE,IAAI,CAAC,CAAC;QACtC,MAAM,IAAI,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;QACrB,IAAA,eAAM,EAAC,IAAI,EAAE,KAAK,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QACpC,IAAA,eAAM,EAAC,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IAC7C,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,gDAAgD,EAAE,GAAG,EAAE;QACxD,6CAA6C;QAC7C,SAAS;QACT,WAAW;QACX,cAAc;QACd,WAAW;QACX,MAAM,CAAC,GAAG,KAAK,CAAC,GAAG,EAAE;YACnB,CAAC,IAAI,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC;YAC1B,CAAC,IAAI,EAAE,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC;YACrB,CAAC,IAAI,EAAE,EAAE,EAAE,GAAG,EAAE,CAAC,CAAC;YAClB,CAAC,IAAI,EAAE,EAAE,EAAE,GAAG,EAAE,CAAC,CAAC;SACnB,CAAC,CAAC;QACH,MAAM,IAAI,GAAG,IAAA,2BAAe,EAAC,CAAC,EAAE,IAAI,CAAC,CAAC;QACtC,qCAAqC;QACrC,MAAM,IAAI,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;QACrB,IAAA,eAAM,EAAC,IAAI,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;QAC7D,wBAAwB;QACxB,MAAM,IAAI,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;QACrB,IAAA,eAAM,EAAC,IAAI,EAAE,KAAK,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QACpC,IAAA,eAAM,EAAC,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IAC3C,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,YAAY,EAAE,GAAG,EAAE;IAC1B,IAAA,WAAE,EAAC,8DAA8D,EAAE,GAAG,EAAE;QACtE,MAAM,EAAE,GAAG,KAAK,CAAC,GAAG,EAAE;YACpB,CAAC,IAAI,EAAE,CAAC,MAAM,EAAE,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC;YAC7B,CAAC,OAAO,EAAE,EAAE,EAAE,MAAM,EAAE,CAAC,CAAC;YACxB,CAAC,OAAO,EAAE,EAAE,EAAE,GAAG,EAAE,CAAC,CAAC;SACtB,CAAC,CAAC;QACH,MAAM,EAAE,GAAG,KAAK,CAAC,GAAG,EAAE;YACpB,CAAC,IAAI,EAAE,CAAC,MAAM,EAAE,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC;YAC7B,CAAC,OAAO,EAAE,EAAE,EAAE,MAAM,EAAE,CAAC,CAAC;YACxB,CAAC,OAAO,EAAE,EAAE,EAAE,GAAG,EAAE,CAAC,CAAC;SACtB,CAAC,CAAC;QACH,MAAM,IAAI,GAAG,IAAA,2BAAe,EAAC,EAAE,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;QAC1C,MAAM,IAAI,GAAG,IAAA,2BAAe,EAAC,EAAE,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;QAC1C,IAAA,eAAM,EAAC,IAAI,CAAC,CAAC,WAAW,EAAE,CAAC;QAC3B,IAAA,eAAM,EAAC,IAAI,CAAC,CAAC,WAAW,EAAE,CAAC;QAC3B,IAAA,eAAM,EAAC,IAAA,sBAAU,EAAC,IAAK,CAAC,CAAC,CAAC,IAAI,CAAC,IAAA,sBAAU,EAAC,IAAK,CAAC,CAAC,CAAC;IACpD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,sDAAsD,EAAE,GAAG,EAAE;QAC9D,MAAM,EAAE,GAAG,KAAK,CAAC,GAAG,EAAE;YACpB,CAAC,IAAI,EAAE,CAAC,MAAM,EAAE,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC;YAC7B,CAAC,OAAO,EAAE,EAAE,EAAE,MAAM,EAAE,CAAC,CAAC;YACxB,CAAC,OAAO,EAAE,EAAE,EAAE,GAAG,EAAE,CAAC,CAAC;SACtB,CAAC,CAAC;QACH,MAAM,EAAE,GAAG,KAAK,CAAC,GAAG,EAAE;YACpB,CAAC,MAAM,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,SAAS,EAAE,CAAC,CAAC;YAClC,CAAC,OAAO,EAAE,EAAE,EAAE,GAAG,EAAE,CAAC,CAAC;YACrB,CAAC,OAAO,EAAE,EAAE,EAAE,GAAG,EAAE,CAAC,CAAC;SACtB,CAAC,CAAC;QACH,IAAA,eAAM,EAAC,IAAA,sBAAU,EAAC,IAAA,2BAAe,EAAC,EAAE,EAAE,IAAI,CAAC,CAAC,CAAC,CAAE,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CACxD,IAAA,sBAAU,EAAC,IAAA,2BAAe,EAAC,EAAE,EAAE,IAAI,CAAC,CAAC,CAAC,CAAE,CAAC,CAC1C,CAAC;IACJ,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,eAAe,EAAE,GAAG,EAAE;IAC7B,IAAA,WAAE,EAAC,2BAA2B,EAAE,GAAG,EAAE;QACnC,MAAM,EAAE,GAAG,KAAK,CAAC,GAAG,EAAE;YACpB,CAAC,IAAI,EAAE,CAAC,MAAM,EAAE,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC;YAC7B,CAAC,OAAO,EAAE,EAAE,EAAE,MAAM,EAAE,CAAC,CAAC;YACxB,CAAC,OAAO,EAAE,EAAE,EAAE,GAAG,EAAE,CAAC,CAAC;SACtB,CAAC,CAAC;QACH,MAAM,EAAE,GAAG,KAAK,CAAC,GAAG,EAAE;YACpB,CAAC,IAAI,EAAE,CAAC,MAAM,EAAE,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC;YAC7B,CAAC,OAAO,EAAE,EAAE,EAAE,MAAM,EAAE,CAAC,CAAC;YACxB,CAAC,OAAO,EAAE,EAAE,EAAE,GAAG,EAAE,CAAC,CAAC;SACtB,CAAC,CAAC;QACH,MAAM,IAAI,GAAG,IAAA,2BAAe,EAAC,EAAE,EAAE,IAAI,CAAC,CAAC;QACvC,MAAM,IAAI,GAAG,IAAA,2BAAe,EAAC,EAAE,EAAE,IAAI,CAAC,CAAC;QACvC,MAAM,MAAM,GAAG,IAAA,yBAAa,EAAC,CAAC,GAAG,IAAI,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC;QACjD,wEAAwE;QACxE,MAAM,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,MAAM,IAAI,CAAC,CAAC,CAAC;QAC3D,IAAA,eAAM,EAAC,MAAM,CAAC,MAAM,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;IAC3C,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,wBAAwB,EAAE,GAAG,EAAE;IACtC,IAAA,WAAE,EAAC,0DAA0D,EAAE,GAAG,EAAE;QAClE,MAAM,EAAE,GAAG,KAAK,CAAC,GAAG,EAAE;YACpB,CAAC,IAAI,EAAE,CAAC,MAAM,EAAE,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC;YAC7B,CAAC,OAAO,EAAE,EAAE,EAAE,MAAM,EAAE,CAAC,CAAC;YACxB,CAAC,OAAO,EAAE,EAAE,EAAE,GAAG,EAAE,CAAC,CAAC;SACtB,CAAC,CAAC;QACH,MAAM,EAAE,GAAG,KAAK,CAAC,GAAG,EAAE;YACpB,CAAC,IAAI,EAAE,CAAC,MAAM,EAAE,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC;YAC7B,CAAC,OAAO,EAAE,EAAE,EAAE,MAAM,EAAE,CAAC,CAAC;YACxB,CAAC,OAAO,EAAE,EAAE,EAAE,GAAG,EAAE,CAAC,CAAC;SACtB,CAAC,CAAC;QACH,MAAM,MAAM,GAAG,IAAA,kCAAsB,EAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;QAChD,IAAA,eAAM,EAAC,MAAM,CAAC,MAAM,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;QACzC,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC;QAC7E,IAAA,eAAM,EAAC,IAAI,CAAC,CAAC,WAAW,EAAE,CAAC;QAC3B,IAAA,eAAM,EAAC,IAAI,EAAE,OAAO,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACvC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,mEAAmE,EAAE,GAAG,EAAE;QAC3E,MAAM,EAAE,GAAG,KAAK,CAAC,GAAG,EAAE;YACpB,CAAC,IAAI,EAAE,CAAC,MAAM,EAAE,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC;YAC7B,CAAC,OAAO,EAAE,EAAE,EAAE,MAAM,EAAE,CAAC,CAAC;YACxB,CAAC,OAAO,EAAE,EAAE,EAAE,GAAG,EAAE,CAAC,CAAC;SACtB,CAAC,CAAC;QACH,MAAM,EAAE,GAAG,KAAK,CAAC,GAAG,EAAE;YACpB,CAAC,IAAI,EAAE,CAAC,MAAM,EAAE,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC;YAC7B,CAAC,OAAO,EAAE,EAAE,EAAE,MAAM,EAAE,CAAC,CAAC;YACxB,CAAC,OAAO,EAAE,EAAE,EAAE,GAAG,EAAE,CAAC,CAAC;SACtB,CAAC,CAAC;QACH,MAAM,MAAM,GAAG,IAAA,kCAAsB,EAAC,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,iBAAiB,EAAE,CAAC,EAAE,CAAC,CAAC;QAC1E,IAAA,eAAM,EAAC,MAAM,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;IACjC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,wDAAwD,EAAE,GAAG,EAAE;QAChE,MAAM,EAAE,GAAG,KAAK,CAAC,GAAG,EAAE;YACpB,CAAC,IAAI,EAAE,CAAC,MAAM,EAAE,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC;YAC7B,CAAC,OAAO,EAAE,EAAE,EAAE,MAAM,EAAE,CAAC,CAAC;SACzB,CAAC,CAAC;QACH,MAAM,EAAE,GAAG,KAAK,CAAC,GAAG,EAAE;YACpB,CAAC,IAAI,EAAE,CAAC,MAAM,EAAE,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC;YAC7B,CAAC,OAAO,EAAE,EAAE,EAAE,MAAM,EAAE,CAAC,CAAC;SACzB,CAAC,CAAC;QACH,oCAAoC;QACpC,MAAM,MAAM,GAAG,IAAA,kCAAsB,EAAC,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,cAAc,EAAE,CAAC,EAAE,CAAC,CAAC;QACvE,IAAA,eAAM,EAAC,MAAM,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;IACjC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,0EAA0E,EAAE,GAAG,EAAE;QAClF,+DAA+D;QAC/D,MAAM,EAAE,GAAG,KAAK,CAAC,GAAG,EAAE;YACpB,CAAC,MAAM,EAAE,CAAC,KAAK,EAAE,KAAK,CAAC,EAAE,iBAAiB,EAAE,CAAC,CAAC;YAC9C,CAAC,MAAM,EAAE,EAAE,EAAE,KAAK,EAAE,CAAC,CAAC;YACtB,CAAC,MAAM,EAAE,EAAE,EAAE,KAAK,EAAE,CAAC,CAAC;SACvB,CAAC,CAAC;QACH,MAAM,MAAM,GAAG,IAAA,kCAAsB,EAAC,CAAC,EAAE,CAAC,EAAE,EAAE,iBAAiB,EAAE,CAAC,EAAE,CAAC,CAAC;QACtE,IAAA,eAAM,EAAC,MAAM,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;IACjC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,6CAA6C,EAAE,GAAG,EAAE;QACrD,MAAM,EAAE,GAAG,KAAK,CAAC,GAAG,EAAE;YACpB,CAAC,IAAI,EAAE,CAAC,MAAM,EAAE,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC;YAC7B,CAAC,OAAO,EAAE,EAAE,EAAE,MAAM,EAAE,CAAC,CAAC;YACxB,CAAC,OAAO,EAAE,EAAE,EAAE,GAAG,EAAE,CAAC,CAAC;SACtB,CAAC,CAAC;QACH,MAAM,MAAM,GAAG,IAAA,kCAAsB,EAAC,CAAC,EAAE,CAAC,EAAE;YAC1C,iBAAiB,EAAE,CAAC;YACpB,cAAc,EAAE,CAAC;SAClB,CAAC,CAAC;QACH,IAAA,eAAM,EAAC,MAAM,CAAC,MAAM,CAAC,CAAC,sBAAsB,CAAC,CAAC,CAAC,CAAC;IAClD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,4DAA4D,EAAE,GAAG,EAAE;QACpE,MAAM,KAAK,GAAG,CAAC,KAAa,EAAc,EAAE,CAC1C,KAAK,CAAC,KAAK,EAAE;YACX,CAAC,IAAI,EAAE,CAAC,GAAG,KAAK,KAAK,KAAK,EAAE,EAAE,KAAK,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC;YAC/C,CAAC,OAAO,EAAE,EAAE,EAAE,GAAG,KAAK,KAAK,KAAK,EAAE,EAAE,CAAC,CAAC;YACtC,CAAC,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,CAAC,CAAC;SACxB,CAAC,CAAC;QACL,MAAM,MAAM,GAAG,IAAA,kCAAsB,EAAC,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,KAAK,CAAC,GAAG,CAAC,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAC5E,6DAA6D;QAC7D,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC;QAC7E,IAAA,eAAM,EAAC,IAAI,EAAE,OAAO,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACvC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,wDAAwD,EAAE,GAAG,EAAE;QAChE,MAAM,EAAE,GAAG,KAAK,CAAC,GAAG,EAAE;YACpB,CAAC,IAAI,EAAE,CAAC,MAAM,EAAE,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC;YAC7B,CAAC,OAAO,EAAE,EAAE,EAAE,MAAM,EAAE,CAAC,CAAC;YACxB,CAAC,OAAO,EAAE,EAAE,EAAE,GAAG,EAAE,CAAC,CAAC;SACtB,CAAC,CAAC;QACH,MAAM,EAAE,GAAG,KAAK,CAAC,GAAG,EAAE;YACpB,CAAC,MAAM,EAAE,CAAC,SAAS,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC;YAC7B,CAAC,OAAO,EAAE,EAAE,EAAE,SAAS,EAAE,CAAC,CAAC;SAC5B,CAAC,CAAC;QACH,IAAA,eAAM,EAAC,IAAA,kCAAsB,EAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;IAC3D,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,2DAA2D,EAAE,GAAG,EAAE;QACnE,MAAM,EAAE,GAAG,KAAK,CAAC,GAAG,EAAE;YACpB,CAAC,IAAI,EAAE,CAAC,MAAM,EAAE,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC;YAC7B,CAAC,OAAO,EAAE,EAAE,EAAE,MAAM,EAAE,CAAC,CAAC;YACxB,CAAC,OAAO,EAAE,EAAE,EAAE,GAAG,EAAE,CAAC,CAAC;SACtB,CAAC,CAAC;QACH,MAAM,EAAE,GAAG,KAAK,CAAC,GAAG,EAAE;YACpB,CAAC,IAAI,EAAE,CAAC,MAAM,EAAE,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC;YAC7B,CAAC,OAAO,EAAE,EAAE,EAAE,MAAM,EAAE,CAAC,CAAC;YACxB,CAAC,OAAO,EAAE,EAAE,EAAE,GAAG,EAAE,CAAC,CAAC;SACtB,CAAC,CAAC;QACH,MAAM,MAAM,GAAG,IAAA,kCAAsB,EAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;QAChD,MAAM,MAAM,GAAG,IAAI,GAAG,EAAU,CAAC;QACjC,KAAK,MAAM,CAAC,IAAI,MAAM;YAAE,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,OAAO;gBAAE,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC;QACzE,IAAA,eAAM,EAAC,MAAM,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACzC,IAAA,eAAM,EAAC,MAAM,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC3C,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,4CAA4C,EAAE,GAAG,EAAE;QACpD,MAAM,EAAE,GAAe;YACrB,EAAE,EAAE,YAAY;YAChB,GAAG,KAAK,CAAC,GAAG,EAAE;gBACZ,CAAC,IAAI,EAAE,CAAC,MAAM,EAAE,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC;gBAC7B,CAAC,OAAO,EAAE,EAAE,EAAE,MAAM,EAAE,CAAC,CAAC;gBACxB,CAAC,OAAO,EAAE,EAAE,EAAE,GAAG,EAAE,CAAC,CAAC;aACtB,CAAC;SACH,CAAC;QACF,MAAM,EAAE,GAAe;YACrB,EAAE,EAAE,YAAY;YAChB,GAAG,KAAK,CAAC,GAAG,EAAE;gBACZ,CAAC,IAAI,EAAE,CAAC,MAAM,EAAE,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC;gBAC7B,CAAC,OAAO,EAAE,EAAE,EAAE,MAAM,EAAE,CAAC,CAAC;gBACxB,CAAC,OAAO,EAAE,EAAE,EAAE,GAAG,EAAE,CAAC,CAAC;aACtB,CAAC;SACH,CAAC;QACF,MAAM,MAAM,GAAG,IAAA,kCAAsB,EAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;QAChD,MAAM,MAAM,GAAG,IAAI,GAAG,EAAU,CAAC;QACjC,KAAK,MAAM,CAAC,IAAI,MAAM;YAAE,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,OAAO;gBAAE,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC;QACzE,IAAA,eAAM,EAAC,MAAM,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC5C,IAAA,eAAM,EAAC,MAAM,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC9C,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}

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

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

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

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

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

@@ -0,0 +1,123 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+const vitest_1 = require("vitest");
+const generalizer_1 = require("../generalizer");
+(0, vitest_1.describe)('generalizeFormulas', () => {
+    (0, vitest_1.it)('para 0 instancias devuelve string vacío', () => {
+        (0, vitest_1.expect)((0, generalizer_1.generalizeFormulas)([])).toEqual({
+            statement: '',
+            abstractionLevel: 0,
+            nonTrivial: false,
+        });
+    });
+    (0, vitest_1.it)('para 1 instancia devuelve el original sin abstracción', () => {
+        const r = (0, generalizer_1.generalizeFormulas)(['P -> P']);
+        (0, vitest_1.expect)(r.statement).toBe('P -> P');
+        (0, vitest_1.expect)(r.abstractionLevel).toBe(0);
+        (0, vitest_1.expect)(r.nonTrivial).toBe(false);
+    });
+    (0, vitest_1.it)('P->P y Q->Q producen ?0 -> ?0', () => {
+        const r = (0, generalizer_1.generalizeFormulas)(['P -> P', 'Q -> Q']);
+        (0, vitest_1.expect)(r.abstractionLevel).toBe(1);
+        (0, vitest_1.expect)(r.nonTrivial).toBe(true);
+        (0, vitest_1.expect)(r.statement).toContain('->');
+        // Debería contener el mismo placeholder dos veces (reflexividad).
+        const matches = r.statement.match(/\?0/g);
+        (0, vitest_1.expect)(matches?.length).toBe(2);
+    });
+    (0, vitest_1.it)('P->Q y R->S producen ?0 -> ?1', () => {
+        const r = (0, generalizer_1.generalizeFormulas)(['P -> Q', 'R -> S']);
+        (0, vitest_1.expect)(r.abstractionLevel).toBe(2);
+        (0, vitest_1.expect)(r.nonTrivial).toBe(true);
+        (0, vitest_1.expect)(r.statement).toMatch(/\?0/);
+        (0, vitest_1.expect)(r.statement).toMatch(/\?1/);
+    });
+    (0, vitest_1.it)('instancias idénticas no introducen abstracción', () => {
+        const r = (0, generalizer_1.generalizeFormulas)(['P -> P', 'P -> P']);
+        (0, vitest_1.expect)(r.abstractionLevel).toBe(0);
+        (0, vitest_1.expect)(r.nonTrivial).toBe(false);
+    });
+    (0, vitest_1.it)('desacuerdos en operadores no son generalizables (fallback al literal)', () => {
+        const r = (0, generalizer_1.generalizeFormulas)(['P and Q', 'P or Q']);
+        (0, vitest_1.expect)(r.nonTrivial).toBe(false);
+        (0, vitest_1.expect)(r.statement).toBe('P and Q');
+    });
+    (0, vitest_1.it)('arrays de tokens de distinta longitud caen al primer literal', () => {
+        const r = (0, generalizer_1.generalizeFormulas)(['P', 'P -> P']);
+        (0, vitest_1.expect)(r.nonTrivial).toBe(false);
+        (0, vitest_1.expect)(r.statement).toBe('P');
+    });
+    (0, vitest_1.it)('mantiene operadores como tokens literales en el patrón', () => {
+        const r = (0, generalizer_1.generalizeFormulas)(['P -> Q', 'A -> B']);
+        (0, vitest_1.expect)(r.statement).toContain('->');
+    });
+});
+(0, vitest_1.describe)('generalizeLemma', () => {
+    (0, vitest_1.it)('respeta maxAbstractionLevel', () => {
+        const r = (0, generalizer_1.generalizeLemma)(['f(a, b, c)', 'f(x, y, z)'], { maxAbstractionLevel: 2 });
+        // Necesitaríamos 3 fresh vars; con cap = 2 cae al literal.
+        (0, vitest_1.expect)(r.abstractionLevel).toBe(0);
+        (0, vitest_1.expect)(r.statement).toBe('f(a, b, c)');
+    });
+    (0, vitest_1.it)('preserveSemantic = true no rechaza generalizaciones válidas', () => {
+        const r = (0, generalizer_1.generalizeLemma)(['P -> P', 'Q -> Q'], {
+            preserveSemantic: true,
+            maxAbstractionLevel: 5,
+        });
+        (0, vitest_1.expect)(r.nonTrivial).toBe(true);
+    });
+    (0, vitest_1.it)('opciones por defecto producen abstracción si es no-trivial', () => {
+        const r = (0, generalizer_1.generalizeLemma)(['P -> P', 'Q -> Q']);
+        (0, vitest_1.expect)(r.abstractionLevel).toBeGreaterThan(0);
+    });
+});
+(0, vitest_1.describe)('generalizeTerms', () => {
+    (0, vitest_1.it)('para 0 terms devuelve vacío', () => {
+        (0, vitest_1.expect)((0, generalizer_1.generalizeTerms)([])).toEqual({
+            statement: '',
+            abstractionLevel: 0,
+            nonTrivial: false,
+        });
+    });
+    (0, vitest_1.it)('para 1 term devuelve el original sin abstracción', () => {
+        const t = { kind: 'const', name: 'a' };
+        const r = (0, generalizer_1.generalizeTerms)([t]);
+        (0, vitest_1.expect)(r.statement).toBe('a');
+        (0, vitest_1.expect)(r.abstractionLevel).toBe(0);
+    });
+    (0, vitest_1.it)('lgg de p(a) y p(b) introduce variable fresca', () => {
+        const t1 = { kind: 'func', name: 'p', args: [{ kind: 'const', name: 'a' }] };
+        const t2 = { kind: 'func', name: 'p', args: [{ kind: 'const', name: 'b' }] };
+        const r = (0, generalizer_1.generalizeTerms)([t1, t2]);
+        (0, vitest_1.expect)(r.abstractionLevel).toBe(1);
+        (0, vitest_1.expect)(r.statement).toMatch(/^p\(/);
+    });
+    (0, vitest_1.it)('lgg de términos idénticos no introduce abstracción', () => {
+        const t1 = { kind: 'const', name: 'a' };
+        const t2 = { kind: 'const', name: 'a' };
+        const r = (0, generalizer_1.generalizeTerms)([t1, t2]);
+        (0, vitest_1.expect)(r.abstractionLevel).toBe(0);
+    });
+    (0, vitest_1.it)('lgg de p(a,a) y p(b,b) reusa la misma fresh var', () => {
+        const t1 = {
+            kind: 'func',
+            name: 'p',
+            args: [
+                { kind: 'const', name: 'a' },
+                { kind: 'const', name: 'a' },
+            ],
+        };
+        const t2 = {
+            kind: 'func',
+            name: 'p',
+            args: [
+                { kind: 'const', name: 'b' },
+                { kind: 'const', name: 'b' },
+            ],
+        };
+        const r = (0, generalizer_1.generalizeTerms)([t1, t2]);
+        // Idealmente abstractionLevel = 1 (una sola fresh var reusada).
+        (0, vitest_1.expect)(r.abstractionLevel).toBe(1);
+    });
+});
+//# sourceMappingURL=generalizer.test.js.map

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":""}