@stevenvo780/st-lang 4.13.0 → 4.14.1

package/dist/tests/reasoning/order-theory/order-theory.test.js

@@ -0,0 +1,211 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+const vitest_1 = require("vitest");
+const order_theory_1 = require("../../../reasoning/order-theory");
+// ────────────────────────────────────────────────────────────────────
+// Helpers: canonical posets
+// ────────────────────────────────────────────────────────────────────
+const divides = (a, b) => b % a === 0;
+/** Divisibility poset on {1,2,3,6}. */
+const divPoset = {
+    elements: [1, 2, 3, 6],
+    leq: divides,
+};
+/** Total order on [1..n]. */
+const totalChain = (n) => ({
+    elements: Array.from({ length: n }, (_, i) => i + 1),
+    leq: (a, b) => a <= b,
+});
+/** Pure antichain: n incomparable elements. */
+const antichainPoset = (n) => ({
+    elements: Array.from({ length: n }, (_, i) => i),
+    leq: (a, b) => a === b,
+});
+/** Diamond poset {⊥, a, b, ⊤} with a, b incomparable. */
+const diamondPoset = {
+    elements: ['bot', 'a', 'b', 'top'],
+    leq: (x, y) => {
+        if (x === y)
+            return true;
+        if (x === 'bot')
+            return true;
+        if (y === 'top')
+            return true;
+        return false;
+    },
+};
+// ────────────────────────────────────────────────────────────────────
+// Tests
+// ────────────────────────────────────────────────────────────────────
+(0, vitest_1.describe)('Order theory — relational axioms', () => {
+    (0, vitest_1.it)('divisibility {1,2,3,6} es un poset', () => {
+        (0, vitest_1.expect)((0, order_theory_1.isReflexive)(divPoset)).toBe(true);
+        (0, vitest_1.expect)((0, order_theory_1.isAntisymmetric)(divPoset)).toBe(true);
+        (0, vitest_1.expect)((0, order_theory_1.isTransitive)(divPoset)).toBe(true);
+        (0, vitest_1.expect)((0, order_theory_1.isPoset)(divPoset)).toBe(true);
+    });
+    (0, vitest_1.it)('total order [1..5] es total y por tanto poset', () => {
+        const T = totalChain(5);
+        (0, vitest_1.expect)((0, order_theory_1.isPoset)(T)).toBe(true);
+        (0, vitest_1.expect)((0, order_theory_1.isTotal)(T)).toBe(true);
+    });
+    (0, vitest_1.it)('divisibility {1,2,3,6} NO es total (2 y 3 incomparables)', () => {
+        (0, vitest_1.expect)((0, order_theory_1.isTotal)(divPoset)).toBe(false);
+    });
+    (0, vitest_1.it)('antichain de 3 elementos es poset pero no total', () => {
+        const A = antichainPoset(3);
+        (0, vitest_1.expect)((0, order_theory_1.isPoset)(A)).toBe(true);
+        (0, vitest_1.expect)((0, order_theory_1.isTotal)(A)).toBe(false);
+    });
+    (0, vitest_1.it)('una relación no transitiva no es poset', () => {
+        const bad = {
+            elements: [1, 2, 3],
+            leq: (a, b) => a === b || (a === 1 && b === 2) || (a === 2 && b === 3),
+        };
+        (0, vitest_1.expect)((0, order_theory_1.isTransitive)(bad)).toBe(false);
+        (0, vitest_1.expect)((0, order_theory_1.isPoset)(bad)).toBe(false);
+    });
+});
+(0, vitest_1.describe)('Order theory — chains y antichains', () => {
+    (0, vitest_1.it)('[1,2,6] es cadena en divisibilidad pero [2,3] es anticadena', () => {
+        (0, vitest_1.expect)((0, order_theory_1.isChain)(divPoset, [1, 2, 6])).toBe(true);
+        (0, vitest_1.expect)((0, order_theory_1.isChain)(divPoset, [2, 3])).toBe(false);
+        (0, vitest_1.expect)((0, order_theory_1.isAntichain)(divPoset, [2, 3])).toBe(true);
+        (0, vitest_1.expect)((0, order_theory_1.isAntichain)(divPoset, [1, 2])).toBe(false);
+    });
+    (0, vitest_1.it)('width de una cadena total = 1, height = n', () => {
+        const T = totalChain(5);
+        (0, vitest_1.expect)((0, order_theory_1.width)(T)).toBe(1);
+        (0, vitest_1.expect)((0, order_theory_1.height)(T)).toBe(5);
+    });
+    (0, vitest_1.it)('width de una anticadena pura = n, height = 1', () => {
+        const A = antichainPoset(4);
+        (0, vitest_1.expect)((0, order_theory_1.width)(A)).toBe(4);
+        (0, vitest_1.expect)((0, order_theory_1.height)(A)).toBe(1);
+    });
+    (0, vitest_1.it)('divisibility {1,2,3,6}: width=2 (anticadena {2,3}), height=3', () => {
+        (0, vitest_1.expect)((0, order_theory_1.width)(divPoset)).toBe(2);
+        (0, vitest_1.expect)((0, order_theory_1.height)(divPoset)).toBe(3);
+    });
+    (0, vitest_1.it)('maximalChains de divisibility {1,2,3,6} contiene 1→2→6 y 1→3→6', () => {
+        const chains = (0, order_theory_1.maximalChains)(divPoset);
+        const flat = chains.map((c) => c.join('-'));
+        (0, vitest_1.expect)(flat).toContain('1-2-6');
+        (0, vitest_1.expect)(flat).toContain('1-3-6');
+    });
+    (0, vitest_1.it)('maximalAntichains de divisibility {1,2,3,6} incluye {2,3}', () => {
+        const ants = (0, order_theory_1.maximalAntichains)(divPoset);
+        const has23 = ants.some((a) => a.length === 2 && a.includes(2) && a.includes(3));
+        (0, vitest_1.expect)(has23).toBe(true);
+    });
+});
+(0, vitest_1.describe)('Order theory — Dilworth', () => {
+    (0, vitest_1.it)('partición de Dilworth en divisibilidad {1,2,3,6} usa ≤ width cadenas', () => {
+        const chains = (0, order_theory_1.dilworth)(divPoset);
+        (0, vitest_1.expect)(chains.length).toBeLessThanOrEqual((0, order_theory_1.width)(divPoset));
+        // Cubre todos los elementos.
+        const covered = new Set();
+        for (const c of chains)
+            for (const x of c)
+                covered.add(x);
+        (0, vitest_1.expect)(covered.size).toBe(divPoset.elements.length);
+        // Cada parte es una cadena.
+        for (const c of chains)
+            (0, vitest_1.expect)((0, order_theory_1.isChain)(divPoset, c)).toBe(true);
+    });
+    (0, vitest_1.it)('partición de Dilworth en anticadena pura tiene exactamente n cadenas singleton', () => {
+        const A = antichainPoset(3);
+        const chains = (0, order_theory_1.dilworth)(A);
+        (0, vitest_1.expect)(chains.length).toBe(3);
+        for (const c of chains)
+            (0, vitest_1.expect)(c.length).toBe(1);
+    });
+    (0, vitest_1.it)('partición de Dilworth en cadena total es una sola cadena', () => {
+        const T = totalChain(4);
+        const chains = (0, order_theory_1.dilworth)(T);
+        (0, vitest_1.expect)(chains.length).toBe(1);
+        (0, vitest_1.expect)(chains[0]?.length).toBe(4);
+    });
+});
+(0, vitest_1.describe)('Order theory — extrema y well-ordering', () => {
+    (0, vitest_1.it)('minimalElements/maximalElements en divisibility {1,2,3,6}', () => {
+        (0, vitest_1.expect)((0, order_theory_1.minimalElements)(divPoset)).toEqual([1]);
+        (0, vitest_1.expect)((0, order_theory_1.maximalElements)(divPoset)).toEqual([6]);
+    });
+    (0, vitest_1.it)('least/greatest en subconjunto', () => {
+        (0, vitest_1.expect)((0, order_theory_1.leastElement)(divPoset, [2, 3, 6])).toBeUndefined();
+        (0, vitest_1.expect)((0, order_theory_1.greatestElement)(divPoset, [1, 2, 6])).toBe(6);
+        (0, vitest_1.expect)((0, order_theory_1.leastElement)(totalChain(5), [3, 4, 5])).toBe(3);
+    });
+    (0, vitest_1.it)('isWellOrdered true para [1..N] y false para divisibilidad', () => {
+        (0, vitest_1.expect)((0, order_theory_1.isWellOrdered)(totalChain(7))).toBe(true);
+        (0, vitest_1.expect)((0, order_theory_1.isWellOrdered)(divPoset)).toBe(false);
+    });
+    (0, vitest_1.it)('greatestElement del poset diamante NO existe para {a,b}', () => {
+        (0, vitest_1.expect)((0, order_theory_1.greatestElement)(diamondPoset, ['a', 'b'])).toBeUndefined();
+        (0, vitest_1.expect)((0, order_theory_1.leastElement)(diamondPoset, ['a', 'b'])).toBeUndefined();
+    });
+});
+(0, vitest_1.describe)('Order theory — Hasse', () => {
+    (0, vitest_1.it)('cover relations en divisibility {1,2,3,6}: 1<2, 1<3, 2<6, 3<6', () => {
+        const covers = (0, order_theory_1.coverRelations)(divPoset).map(([a, b]) => `${a}<${b}`);
+        (0, vitest_1.expect)(covers).toContain('1<2');
+        (0, vitest_1.expect)(covers).toContain('1<3');
+        (0, vitest_1.expect)(covers).toContain('2<6');
+        (0, vitest_1.expect)(covers).toContain('3<6');
+        (0, vitest_1.expect)(covers).not.toContain('1<6'); // no es cover (pasa por 2 o 3)
+    });
+    (0, vitest_1.it)('hasseDot produce código DOT válido con los nodos', () => {
+        const dot = (0, order_theory_1.hasseDot)(divPoset);
+        (0, vitest_1.expect)(dot).toMatch(/^digraph Hasse/);
+        (0, vitest_1.expect)(dot).toContain('"1"');
+        (0, vitest_1.expect)(dot).toContain('"6"');
+        (0, vitest_1.expect)(dot).toContain('"1" -> "2"');
+    });
+});
+(0, vitest_1.describe)('Order theory — infimum/supremum', () => {
+    (0, vitest_1.it)('en divisibility {1,2,3,6}: sup{2,3}=6, inf{2,3}=1', () => {
+        (0, vitest_1.expect)((0, order_theory_1.supremum)(divPoset, [2, 3])).toBe(6);
+        (0, vitest_1.expect)((0, order_theory_1.infimum)(divPoset, [2, 3])).toBe(1);
+    });
+    (0, vitest_1.it)('sup/inf en cadena total coincide con max/min del subconjunto', () => {
+        const T = totalChain(6);
+        (0, vitest_1.expect)((0, order_theory_1.supremum)(T, [2, 4, 5])).toBe(5);
+        (0, vitest_1.expect)((0, order_theory_1.infimum)(T, [2, 4, 5])).toBe(2);
+    });
+});
+(0, vitest_1.describe)('Order theory — Zorn finito', () => {
+    (0, vitest_1.it)('Zorn devuelve un maximal en cadena finita', () => {
+        const T = totalChain(4);
+        const w = (0, order_theory_1.zornsLemmaWitness)(T);
+        (0, vitest_1.expect)(w).toBe(4);
+    });
+    (0, vitest_1.it)('Zorn en divisibility {1,2,3,6} devuelve 6', () => {
+        (0, vitest_1.expect)((0, order_theory_1.zornsLemmaWitness)(divPoset)).toBe(6);
+    });
+    (0, vitest_1.it)('Zorn en poset diamante devuelve "top"', () => {
+        (0, vitest_1.expect)((0, order_theory_1.zornsLemmaWitness)(diamondPoset)).toBe('top');
+    });
+    (0, vitest_1.it)('Zorn falla con carrier vacío', () => {
+        const empty = { elements: [], leq: (a, b) => a <= b };
+        const r = (0, order_theory_1.zornsLemmaWitness)(empty);
+        (0, vitest_1.expect)(r).toHaveProperty('error');
+    });
+});
+(0, vitest_1.describe)('Order theory — well-founded induction', () => {
+    (0, vitest_1.it)('predicado siempre-true pasa la inducción', () => {
+        (0, vitest_1.expect)((0, order_theory_1.wellFoundedInduction)(divPoset, () => true)).toBe(true);
+    });
+    (0, vitest_1.it)('predicado que falla en un minimal rompe la inducción', () => {
+        // En la divisibilidad {1,2,3,6}, 1 es minimal: sus predecesores
+        // estrictos son ∅, así que la premisa "∀y<x, P(y)" es vacuamente
+        // verdadera. Si P(1) = false, la implicación falla en x=1.
+        (0, vitest_1.expect)((0, order_theory_1.wellFoundedInduction)(divPoset, (n) => n !== 1)).toBe(false);
+    });
+    (0, vitest_1.it)('predicado "es divisor de 6" es consistente bajo well-founded induction', () => {
+        // Cualquier elemento del poset divide a 6, así que la propiedad
+        // es trivialmente preservada por la inducción.
+        (0, vitest_1.expect)((0, order_theory_1.wellFoundedInduction)(divPoset, (n) => 6 % n === 0)).toBe(true);
+    });
+});
+//# sourceMappingURL=order-theory.test.js.map

package/dist/tests/reasoning/order-theory/order-theory.test.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"order-theory.test.js","sourceRoot":"","sources":["../../../../src/tests/reasoning/order-theory/order-theory.test.ts"],"names":[],"mappings":";;AAAA,mCAA8C;AAC9C,kEAyByC;AAEzC,uEAAuE;AACvE,4BAA4B;AAC5B,uEAAuE;AAEvE,MAAM,OAAO,GAAG,CAAC,CAAS,EAAE,CAAS,EAAW,EAAE,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;AAE/D,uCAAuC;AACvC,MAAM,QAAQ,GAAkB;IAC9B,QAAQ,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;IACtB,GAAG,EAAE,OAAO;CACb,CAAC;AAEF,6BAA6B;AAC7B,MAAM,UAAU,GAAG,CAAC,CAAS,EAAiB,EAAE,CAAC,CAAC;IAChD,QAAQ,EAAE,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC;IACpD,GAAG,EAAE,CAAC,CAAS,EAAE,CAAS,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC;CACtC,CAAC,CAAC;AAEH,+CAA+C;AAC/C,MAAM,cAAc,GAAG,CAAC,CAAS,EAAiB,EAAE,CAAC,CAAC;IACpD,QAAQ,EAAE,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;IAChD,GAAG,EAAE,CAAC,CAAS,EAAE,CAAS,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC;CACvC,CAAC,CAAC;AAEH,yDAAyD;AACzD,MAAM,YAAY,GAAkB;IAClC,QAAQ,EAAE,CAAC,KAAK,EAAE,GAAG,EAAE,GAAG,EAAE,KAAK,CAAC;IAClC,GAAG,EAAE,CAAC,CAAS,EAAE,CAAS,EAAW,EAAE;QACrC,IAAI,CAAC,KAAK,CAAC;YAAE,OAAO,IAAI,CAAC;QACzB,IAAI,CAAC,KAAK,KAAK;YAAE,OAAO,IAAI,CAAC;QAC7B,IAAI,CAAC,KAAK,KAAK;YAAE,OAAO,IAAI,CAAC;QAC7B,OAAO,KAAK,CAAC;IACf,CAAC;CACF,CAAC;AAEF,uEAAuE;AACvE,QAAQ;AACR,uEAAuE;AAEvE,IAAA,iBAAQ,EAAC,kCAAkC,EAAE,GAAG,EAAE;IAChD,IAAA,WAAE,EAAC,oCAAoC,EAAE,GAAG,EAAE;QAC5C,IAAA,eAAM,EAAC,IAAA,0BAAW,EAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACzC,IAAA,eAAM,EAAC,IAAA,8BAAe,EAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC7C,IAAA,eAAM,EAAC,IAAA,2BAAY,EAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC1C,IAAA,eAAM,EAAC,IAAA,sBAAO,EAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACvC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,+CAA+C,EAAE,GAAG,EAAE;QACvD,MAAM,CAAC,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;QACxB,IAAA,eAAM,EAAC,IAAA,sBAAO,EAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC9B,IAAA,eAAM,EAAC,IAAA,sBAAO,EAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAChC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,0DAA0D,EAAE,GAAG,EAAE;QAClE,IAAA,eAAM,EAAC,IAAA,sBAAO,EAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACxC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,iDAAiD,EAAE,GAAG,EAAE;QACzD,MAAM,CAAC,GAAG,cAAc,CAAC,CAAC,CAAC,CAAC;QAC5B,IAAA,eAAM,EAAC,IAAA,sBAAO,EAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC9B,IAAA,eAAM,EAAC,IAAA,sBAAO,EAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACjC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,wCAAwC,EAAE,GAAG,EAAE;QAChD,MAAM,GAAG,GAAkB;YACzB,QAAQ,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;YACnB,GAAG,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;SACvE,CAAC;QACF,IAAA,eAAM,EAAC,IAAA,2BAAY,EAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACtC,IAAA,eAAM,EAAC,IAAA,sBAAO,EAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACnC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,oCAAoC,EAAE,GAAG,EAAE;IAClD,IAAA,WAAE,EAAC,6DAA6D,EAAE,GAAG,EAAE;QACrE,IAAA,eAAM,EAAC,IAAA,sBAAO,EAAC,QAAQ,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAChD,IAAA,eAAM,EAAC,IAAA,sBAAO,EAAC,QAAQ,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC9C,IAAA,eAAM,EAAC,IAAA,0BAAW,EAAC,QAAQ,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACjD,IAAA,eAAM,EAAC,IAAA,0BAAW,EAAC,QAAQ,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACpD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,2CAA2C,EAAE,GAAG,EAAE;QACnD,MAAM,CAAC,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;QACxB,IAAA,eAAM,EAAC,IAAA,oBAAK,EAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACzB,IAAA,eAAM,EAAC,IAAA,qBAAM,EAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC5B,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,8CAA8C,EAAE,GAAG,EAAE;QACtD,MAAM,CAAC,GAAG,cAAc,CAAC,CAAC,CAAC,CAAC;QAC5B,IAAA,eAAM,EAAC,IAAA,oBAAK,EAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACzB,IAAA,eAAM,EAAC,IAAA,qBAAM,EAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC5B,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,8DAA8D,EAAE,GAAG,EAAE;QACtE,IAAA,eAAM,EAAC,IAAA,oBAAK,EAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAChC,IAAA,eAAM,EAAC,IAAA,qBAAM,EAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACnC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,gEAAgE,EAAE,GAAG,EAAE;QACxE,MAAM,MAAM,GAAG,IAAA,4BAAa,EAAC,QAAQ,CAAC,CAAC;QACvC,MAAM,IAAI,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;QAC5C,IAAA,eAAM,EAAC,IAAI,CAAC,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC;QAChC,IAAA,eAAM,EAAC,IAAI,CAAC,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC;IAClC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,2DAA2D,EAAE,GAAG,EAAE;QACnE,MAAM,IAAI,GAAG,IAAA,gCAAiB,EAAC,QAAQ,CAAC,CAAC;QACzC,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,CAAC,IAAI,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;QACjF,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC3B,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,yBAAyB,EAAE,GAAG,EAAE;IACvC,IAAA,WAAE,EAAC,sEAAsE,EAAE,GAAG,EAAE;QAC9E,MAAM,MAAM,GAAG,IAAA,uBAAQ,EAAC,QAAQ,CAAC,CAAC;QAClC,IAAA,eAAM,EAAC,MAAM,CAAC,MAAM,CAAC,CAAC,mBAAmB,CAAC,IAAA,oBAAK,EAAC,QAAQ,CAAC,CAAC,CAAC;QAC3D,6BAA6B;QAC7B,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAClC,KAAK,MAAM,CAAC,IAAI,MAAM;YAAE,KAAK,MAAM,CAAC,IAAI,CAAC;gBAAE,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAC1D,IAAA,eAAM,EAAC,OAAO,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;QACpD,4BAA4B;QAC5B,KAAK,MAAM,CAAC,IAAI,MAAM;YAAE,IAAA,eAAM,EAAC,IAAA,sBAAO,EAAC,QAAQ,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAClE,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,gFAAgF,EAAE,GAAG,EAAE;QACxF,MAAM,CAAC,GAAG,cAAc,CAAC,CAAC,CAAC,CAAC;QAC5B,MAAM,MAAM,GAAG,IAAA,uBAAQ,EAAC,CAAC,CAAC,CAAC;QAC3B,IAAA,eAAM,EAAC,MAAM,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC9B,KAAK,MAAM,CAAC,IAAI,MAAM;YAAE,IAAA,eAAM,EAAC,CAAC,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACnD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,0DAA0D,EAAE,GAAG,EAAE;QAClE,MAAM,CAAC,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;QACxB,MAAM,MAAM,GAAG,IAAA,uBAAQ,EAAC,CAAC,CAAC,CAAC;QAC3B,IAAA,eAAM,EAAC,MAAM,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC9B,IAAA,eAAM,EAAC,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACpC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,wCAAwC,EAAE,GAAG,EAAE;IACtD,IAAA,WAAE,EAAC,2DAA2D,EAAE,GAAG,EAAE;QACnE,IAAA,eAAM,EAAC,IAAA,8BAAe,EAAC,QAAQ,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC/C,IAAA,eAAM,EAAC,IAAA,8BAAe,EAAC,QAAQ,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACjD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,+BAA+B,EAAE,GAAG,EAAE;QACvC,IAAA,eAAM,EAAC,IAAA,2BAAY,EAAC,QAAQ,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,aAAa,EAAE,CAAC;QAC1D,IAAA,eAAM,EAAC,IAAA,8BAAe,EAAC,QAAQ,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACrD,IAAA,eAAM,EAAC,IAAA,2BAAY,EAAC,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACzD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,2DAA2D,EAAE,GAAG,EAAE;QACnE,IAAA,eAAM,EAAC,IAAA,4BAAa,EAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAChD,IAAA,eAAM,EAAC,IAAA,4BAAa,EAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC9C,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,yDAAyD,EAAE,GAAG,EAAE;QACjE,IAAA,eAAM,EAAC,IAAA,8BAAe,EAAC,YAAY,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,aAAa,EAAE,CAAC;QAClE,IAAA,eAAM,EAAC,IAAA,2BAAY,EAAC,YAAY,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,aAAa,EAAE,CAAC;IACjE,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,sBAAsB,EAAE,GAAG,EAAE;IACpC,IAAA,WAAE,EAAC,+DAA+D,EAAE,GAAG,EAAE;QACvE,MAAM,MAAM,GAAG,IAAA,6BAAc,EAAC,QAAQ,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACrE,IAAA,eAAM,EAAC,MAAM,CAAC,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;QAChC,IAAA,eAAM,EAAC,MAAM,CAAC,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;QAChC,IAAA,eAAM,EAAC,MAAM,CAAC,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;QAChC,IAAA,eAAM,EAAC,MAAM,CAAC,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;QAChC,IAAA,eAAM,EAAC,MAAM,CAAC,CAAC,GAAG,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC,+BAA+B;IACtE,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,kDAAkD,EAAE,GAAG,EAAE;QAC1D,MAAM,GAAG,GAAG,IAAA,uBAAQ,EAAC,QAAQ,CAAC,CAAC;QAC/B,IAAA,eAAM,EAAC,GAAG,CAAC,CAAC,OAAO,CAAC,gBAAgB,CAAC,CAAC;QACtC,IAAA,eAAM,EAAC,GAAG,CAAC,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;QAC7B,IAAA,eAAM,EAAC,GAAG,CAAC,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;QAC7B,IAAA,eAAM,EAAC,GAAG,CAAC,CAAC,SAAS,CAAC,YAAY,CAAC,CAAC;IACtC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,iCAAiC,EAAE,GAAG,EAAE;IAC/C,IAAA,WAAE,EAAC,mDAAmD,EAAE,GAAG,EAAE;QAC3D,IAAA,eAAM,EAAC,IAAA,uBAAQ,EAAC,QAAQ,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC3C,IAAA,eAAM,EAAC,IAAA,sBAAO,EAAC,QAAQ,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC5C,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,8DAA8D,EAAE,GAAG,EAAE;QACtE,MAAM,CAAC,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;QACxB,IAAA,eAAM,EAAC,IAAA,uBAAQ,EAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACvC,IAAA,eAAM,EAAC,IAAA,sBAAO,EAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACxC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,4BAA4B,EAAE,GAAG,EAAE;IAC1C,IAAA,WAAE,EAAC,2CAA2C,EAAE,GAAG,EAAE;QACnD,MAAM,CAAC,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;QACxB,MAAM,CAAC,GAAG,IAAA,gCAAiB,EAAC,CAAC,CAAC,CAAC;QAC/B,IAAA,eAAM,EAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACpB,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,2CAA2C,EAAE,GAAG,EAAE;QACnD,IAAA,eAAM,EAAC,IAAA,gCAAiB,EAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC9C,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,uCAAuC,EAAE,GAAG,EAAE;QAC/C,IAAA,eAAM,EAAC,IAAA,gCAAiB,EAAC,YAAY,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACtD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,8BAA8B,EAAE,GAAG,EAAE;QACtC,MAAM,KAAK,GAAkB,EAAE,QAAQ,EAAE,EAAE,EAAE,GAAG,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC;QACrE,MAAM,CAAC,GAAG,IAAA,gCAAiB,EAAC,KAAK,CAAC,CAAC;QACnC,IAAA,eAAM,EAAC,CAAC,CAAC,CAAC,cAAc,CAAC,OAAO,CAAC,CAAC;IACpC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,uCAAuC,EAAE,GAAG,EAAE;IACrD,IAAA,WAAE,EAAC,0CAA0C,EAAE,GAAG,EAAE;QAClD,IAAA,eAAM,EAAC,IAAA,mCAAoB,EAAC,QAAQ,EAAE,GAAG,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAChE,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,sDAAsD,EAAE,GAAG,EAAE;QAC9D,gEAAgE;QAChE,iEAAiE;QACjE,2DAA2D;QAC3D,IAAA,eAAM,EAAC,IAAA,mCAAoB,EAAC,QAAQ,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACrE,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,wEAAwE,EAAE,GAAG,EAAE;QAChF,gEAAgE;QAChE,+CAA+C;QAC/C,IAAA,eAAM,EAAC,IAAA,mCAAoB,EAAC,QAAQ,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACxE,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}

package/dist/tests/reasoning/peano-arithmetic/peano.test.d.ts

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

package/dist/tests/reasoning/peano-arithmetic/peano.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"peano.test.d.ts","sourceRoot":"","sources":["../../../../src/tests/reasoning/peano-arithmetic/peano.test.ts"],"names":[],"mappings":""}

package/dist/tests/reasoning/peano-arithmetic/peano.test.js

@@ -0,0 +1,159 @@
+"use strict";
+// ============================================================
+// ST Peano Arithmetic — Tests
+// ============================================================
+Object.defineProperty(exports, "__esModule", { value: true });
+const vitest_1 = require("vitest");
+const peano_arithmetic_1 = require("../../../reasoning/peano-arithmetic");
+(0, vitest_1.describe)('peano-arithmetic — evaluación de términos', () => {
+    (0, vitest_1.it)('evalNat(succ(succ(zero))) = 2', () => {
+        (0, vitest_1.expect)((0, peano_arithmetic_1.evalNat)((0, peano_arithmetic_1.succ)((0, peano_arithmetic_1.succ)(peano_arithmetic_1.zero)))).toBe(2);
+    });
+    (0, vitest_1.it)('evalNat(add(numeral(2), numeral(3))) = 5', () => {
+        (0, vitest_1.expect)((0, peano_arithmetic_1.evalNat)((0, peano_arithmetic_1.add)((0, peano_arithmetic_1.numeral)(2), (0, peano_arithmetic_1.numeral)(3)))).toBe(5);
+    });
+    (0, vitest_1.it)('evalNat(mul(numeral(3), numeral(4))) = 12', () => {
+        (0, vitest_1.expect)((0, peano_arithmetic_1.evalNat)((0, peano_arithmetic_1.mul)((0, peano_arithmetic_1.numeral)(3), (0, peano_arithmetic_1.numeral)(4)))).toBe(12);
+    });
+    (0, vitest_1.it)('evalNat con variable libre y entorno', () => {
+        (0, vitest_1.expect)((0, peano_arithmetic_1.evalNat)((0, peano_arithmetic_1.add)((0, peano_arithmetic_1.vt)('x'), (0, peano_arithmetic_1.numeral)(1)), { x: 7 })).toBe(8);
+    });
+    (0, vitest_1.it)('evalNat devuelve null para variable libre sin binding', () => {
+        (0, vitest_1.expect)((0, peano_arithmetic_1.evalNat)((0, peano_arithmetic_1.vt)('y'), {})).toBeNull();
+    });
+});
+(0, vitest_1.describe)('peano-arithmetic — axiomas P1..P6 en ℕ', () => {
+    (0, vitest_1.it)('P1: ¬(succ(x) = 0) se cumple', () => {
+        (0, vitest_1.expect)((0, peano_arithmetic_1.verifyTheoremBySampling)(peano_arithmetic_1.AXIOM_P1).valid).toBe(true);
+    });
+    (0, vitest_1.it)('P2: succ(x) = succ(y) → x = y se cumple', () => {
+        (0, vitest_1.expect)((0, peano_arithmetic_1.verifyTheoremBySampling)(peano_arithmetic_1.AXIOM_P2).valid).toBe(true);
+    });
+    (0, vitest_1.it)('P3: x + 0 = x se cumple', () => {
+        (0, vitest_1.expect)((0, peano_arithmetic_1.verifyTheoremBySampling)(peano_arithmetic_1.AXIOM_P3).valid).toBe(true);
+    });
+    (0, vitest_1.it)('P4: x + succ(y) = succ(x + y) se cumple', () => {
+        (0, vitest_1.expect)((0, peano_arithmetic_1.verifyTheoremBySampling)(peano_arithmetic_1.AXIOM_P4).valid).toBe(true);
+    });
+    (0, vitest_1.it)('P5: x · 0 = 0 se cumple', () => {
+        (0, vitest_1.expect)((0, peano_arithmetic_1.verifyTheoremBySampling)(peano_arithmetic_1.AXIOM_P5).valid).toBe(true);
+    });
+    (0, vitest_1.it)('P6: x · succ(y) = (x · y) + x se cumple', () => {
+        (0, vitest_1.expect)((0, peano_arithmetic_1.verifyTheoremBySampling)(peano_arithmetic_1.AXIOM_P6).valid).toBe(true);
+    });
+    (0, vitest_1.it)('PEANO_AXIOMS exporta los 6 axiomas', () => {
+        (0, vitest_1.expect)(peano_arithmetic_1.PEANO_AXIOMS).toHaveLength(6);
+        (0, vitest_1.expect)(peano_arithmetic_1.PEANO_AXIOMS).toContain(peano_arithmetic_1.AXIOM_P1);
+        (0, vitest_1.expect)(peano_arithmetic_1.PEANO_AXIOMS).toContain(peano_arithmetic_1.AXIOM_P6);
+    });
+});
+(0, vitest_1.describe)('peano-arithmetic — teoremas estándar', () => {
+    (0, vitest_1.it)('add commutative: ∀x,y. x+y = y+x', () => {
+        const res = (0, peano_arithmetic_1.verifyTheoremBySampling)((0, peano_arithmetic_1.theoremAddCommutative)());
+        (0, vitest_1.expect)(res.valid).toBe(true);
+        (0, vitest_1.expect)(res.counterexample).toBeUndefined();
+    });
+    (0, vitest_1.it)('add associative: ∀x,y,z. (x+y)+z = x+(y+z)', () => {
+        (0, vitest_1.expect)((0, peano_arithmetic_1.verifyTheoremBySampling)((0, peano_arithmetic_1.theoremAddAssociative)()).valid).toBe(true);
+    });
+    (0, vitest_1.it)('mul commutative: ∀x,y. x·y = y·x', () => {
+        (0, vitest_1.expect)((0, peano_arithmetic_1.verifyTheoremBySampling)((0, peano_arithmetic_1.theoremMulCommutative)()).valid).toBe(true);
+    });
+    (0, vitest_1.it)('mul distributes over add: ∀x,y,z. x·(y+z) = x·y + x·z', () => {
+        (0, vitest_1.expect)((0, peano_arithmetic_1.verifyTheoremBySampling)((0, peano_arithmetic_1.theoremMulDistOverAdd)()).valid).toBe(true);
+    });
+});
+(0, vitest_1.describe)('peano-arithmetic — contraejemplos', () => {
+    (0, vitest_1.it)('refuta ∀x. x = succ(x) con contraejemplo x=0', () => {
+        const falseFormula = (0, peano_arithmetic_1.forall)('x', (0, peano_arithmetic_1.eq)((0, peano_arithmetic_1.vt)('x'), (0, peano_arithmetic_1.succ)((0, peano_arithmetic_1.vt)('x'))));
+        const res = (0, peano_arithmetic_1.verifyTheoremBySampling)(falseFormula);
+        (0, vitest_1.expect)(res.valid).toBe(false);
+    });
+    (0, vitest_1.it)('refuta ∀x. x · x = x (falla para x=2)', () => {
+        const idempotentMul = (0, peano_arithmetic_1.forall)('x', (0, peano_arithmetic_1.eq)((0, peano_arithmetic_1.mul)((0, peano_arithmetic_1.vt)('x'), (0, peano_arithmetic_1.vt)('x')), (0, peano_arithmetic_1.vt)('x')));
+        const res = (0, peano_arithmetic_1.verifyTheoremBySampling)(idempotentMul);
+        (0, vitest_1.expect)(res.valid).toBe(false);
+    });
+    (0, vitest_1.it)('refuta abierta x = succ(x) con cualquier valor', () => {
+        const openFormula = (0, peano_arithmetic_1.eq)((0, peano_arithmetic_1.vt)('x'), (0, peano_arithmetic_1.succ)((0, peano_arithmetic_1.vt)('x')));
+        const res = (0, peano_arithmetic_1.verifyTheoremBySampling)(openFormula);
+        (0, vitest_1.expect)(res.valid).toBe(false);
+        (0, vitest_1.expect)(res.counterexample).toBeDefined();
+        (0, vitest_1.expect)(res.counterexample).toHaveProperty('x');
+    });
+    (0, vitest_1.it)('refuta ∃x. succ(x) = 0 (P1 negado)', () => {
+        const violateP1 = (0, peano_arithmetic_1.exists)('x', (0, peano_arithmetic_1.eq)((0, peano_arithmetic_1.succ)((0, peano_arithmetic_1.vt)('x')), peano_arithmetic_1.zero));
+        const res = (0, peano_arithmetic_1.verifyTheoremBySampling)(violateP1);
+        (0, vitest_1.expect)(res.valid).toBe(false);
+    });
+});
+(0, vitest_1.describe)('peano-arithmetic — evaluación de fórmulas', () => {
+    (0, vitest_1.it)('evalFormula cerrada: 2 + 3 = 5', () => {
+        const f = (0, peano_arithmetic_1.eq)((0, peano_arithmetic_1.add)((0, peano_arithmetic_1.numeral)(2), (0, peano_arithmetic_1.numeral)(3)), (0, peano_arithmetic_1.numeral)(5));
+        (0, vitest_1.expect)((0, peano_arithmetic_1.evalFormula)(f)).toBe(true);
+    });
+    (0, vitest_1.it)('evalFormula con conjunción y negación', () => {
+        const f = (0, peano_arithmetic_1.andF)((0, peano_arithmetic_1.eq)((0, peano_arithmetic_1.numeral)(2), (0, peano_arithmetic_1.numeral)(2)), (0, peano_arithmetic_1.notF)((0, peano_arithmetic_1.eq)((0, peano_arithmetic_1.numeral)(0), (0, peano_arithmetic_1.numeral)(1))));
+        (0, vitest_1.expect)((0, peano_arithmetic_1.evalFormula)(f)).toBe(true);
+    });
+    (0, vitest_1.it)('evalFormula con implicación cortocircuito', () => {
+        const f = (0, peano_arithmetic_1.eq)((0, peano_arithmetic_1.numeral)(0), (0, peano_arithmetic_1.numeral)(1));
+        const implFalse = { kind: 'implies', left: f, right: f };
+        (0, vitest_1.expect)((0, peano_arithmetic_1.evalFormula)(implFalse)).toBe(true);
+    });
+    (0, vitest_1.it)('evalFormula cuantificador acotado', () => {
+        const f = (0, peano_arithmetic_1.forall)('x', (0, peano_arithmetic_1.eq)((0, peano_arithmetic_1.add)((0, peano_arithmetic_1.vt)('x'), peano_arithmetic_1.zero), (0, peano_arithmetic_1.vt)('x')));
+        (0, vitest_1.expect)((0, peano_arithmetic_1.evalFormula)(f, {}, 5)).toBe(true);
+    });
+});
+(0, vitest_1.describe)('peano-arithmetic — esquema de inducción', () => {
+    (0, vitest_1.it)('inductionSchema construye base ∧ paso → conclusión', () => {
+        const P = (n) => (0, peano_arithmetic_1.eq)((0, peano_arithmetic_1.add)(n, peano_arithmetic_1.zero), n);
+        const schema = (0, peano_arithmetic_1.inductionSchema)(P);
+        (0, vitest_1.expect)(schema.kind).toBe('implies');
+    });
+    (0, vitest_1.it)('inducción aplicada a P(n) = (n + 0 = n) se cumple en ℕ', () => {
+        const P = (n) => (0, peano_arithmetic_1.eq)((0, peano_arithmetic_1.add)(n, peano_arithmetic_1.zero), n);
+        const schema = (0, peano_arithmetic_1.inductionSchema)(P);
+        (0, vitest_1.expect)((0, peano_arithmetic_1.verifyTheoremBySampling)(schema).valid).toBe(true);
+    });
+    (0, vitest_1.it)('inducción aplicada a P(n) = (n·0 = 0)', () => {
+        const P = (n) => (0, peano_arithmetic_1.eq)((0, peano_arithmetic_1.mul)(n, peano_arithmetic_1.zero), peano_arithmetic_1.zero);
+        const schema = (0, peano_arithmetic_1.inductionSchema)(P);
+        (0, vitest_1.expect)((0, peano_arithmetic_1.verifyTheoremBySampling)(schema).valid).toBe(true);
+    });
+});
+(0, vitest_1.describe)('peano-arithmetic — codificación de Gödel', () => {
+    (0, vitest_1.it)('godel round-trip para fórmula atómica eq(0, 0)', () => {
+        const f = (0, peano_arithmetic_1.eq)(peano_arithmetic_1.zero, peano_arithmetic_1.zero);
+        const n = (0, peano_arithmetic_1.godelNumber)(f);
+        (0, vitest_1.expect)(typeof n).toBe('bigint');
+        const back = (0, peano_arithmetic_1.fromGodel)(n);
+        (0, vitest_1.expect)(back).toEqual(f);
+    });
+    (0, vitest_1.it)('godel round-trip para AXIOM_P3', () => {
+        const n = (0, peano_arithmetic_1.godelNumber)(peano_arithmetic_1.AXIOM_P3);
+        const back = (0, peano_arithmetic_1.fromGodel)(n);
+        (0, vitest_1.expect)(back).toEqual(peano_arithmetic_1.AXIOM_P3);
+    });
+    (0, vitest_1.it)('godel round-trip para teorema commutativo', () => {
+        const thm = (0, peano_arithmetic_1.theoremAddCommutative)();
+        const n = (0, peano_arithmetic_1.godelNumber)(thm);
+        const back = (0, peano_arithmetic_1.fromGodel)(n);
+        (0, vitest_1.expect)(back).toEqual(thm);
+    });
+    (0, vitest_1.it)('godel round-trip para fórmula con and de 3 args', () => {
+        const f = (0, peano_arithmetic_1.andF)((0, peano_arithmetic_1.eq)((0, peano_arithmetic_1.numeral)(1), (0, peano_arithmetic_1.numeral)(1)), peano_arithmetic_1.AXIOM_P3, (0, peano_arithmetic_1.notF)(peano_arithmetic_1.AXIOM_P1));
+        const n = (0, peano_arithmetic_1.godelNumber)(f);
+        (0, vitest_1.expect)((0, peano_arithmetic_1.fromGodel)(n)).toEqual(f);
+    });
+    (0, vitest_1.it)('fromGodel devuelve null para bigint negativo', () => {
+        (0, vitest_1.expect)((0, peano_arithmetic_1.fromGodel)(-1n)).toBeNull();
+    });
+    (0, vitest_1.it)('códigos de Gödel son inyectivos sobre las 6 axiomas', () => {
+        const codes = peano_arithmetic_1.PEANO_AXIOMS.map(peano_arithmetic_1.godelNumber);
+        const unique = new Set(codes.map((c) => c.toString()));
+        (0, vitest_1.expect)(unique.size).toBe(codes.length);
+    });
+});
+//# sourceMappingURL=peano.test.js.map

package/dist/tests/reasoning/peano-arithmetic/peano.test.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"peano.test.js","sourceRoot":"","sources":["../../../../src/tests/reasoning/peano-arithmetic/peano.test.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,8BAA8B;AAC9B,+DAA+D;;AAE/D,mCAA8C;AAC9C,0EA6B6C;AAE7C,IAAA,iBAAQ,EAAC,2CAA2C,EAAE,GAAG,EAAE;IACzD,IAAA,WAAE,EAAC,+BAA+B,EAAE,GAAG,EAAE;QACvC,IAAA,eAAM,EAAC,IAAA,0BAAO,EAAC,IAAA,uBAAI,EAAC,IAAA,uBAAI,EAAC,uBAAI,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC5C,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,0CAA0C,EAAE,GAAG,EAAE;QAClD,IAAA,eAAM,EAAC,IAAA,0BAAO,EAAC,IAAA,sBAAG,EAAC,IAAA,0BAAO,EAAC,CAAC,CAAC,EAAE,IAAA,0BAAO,EAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACvD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,2CAA2C,EAAE,GAAG,EAAE;QACnD,IAAA,eAAM,EAAC,IAAA,0BAAO,EAAC,IAAA,sBAAG,EAAC,IAAA,0BAAO,EAAC,CAAC,CAAC,EAAE,IAAA,0BAAO,EAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACxD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,sCAAsC,EAAE,GAAG,EAAE;QAC9C,IAAA,eAAM,EAAC,IAAA,0BAAO,EAAC,IAAA,sBAAG,EAAC,IAAA,qBAAE,EAAC,GAAG,CAAC,EAAE,IAAA,0BAAO,EAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC9D,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,uDAAuD,EAAE,GAAG,EAAE;QAC/D,IAAA,eAAM,EAAC,IAAA,0BAAO,EAAC,IAAA,qBAAE,EAAC,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC;IAC1C,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,wCAAwC,EAAE,GAAG,EAAE;IACtD,IAAA,WAAE,EAAC,8BAA8B,EAAE,GAAG,EAAE;QACtC,IAAA,eAAM,EAAC,IAAA,0CAAuB,EAAC,2BAAQ,CAAC,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC7D,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,yCAAyC,EAAE,GAAG,EAAE;QACjD,IAAA,eAAM,EAAC,IAAA,0CAAuB,EAAC,2BAAQ,CAAC,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC7D,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,yBAAyB,EAAE,GAAG,EAAE;QACjC,IAAA,eAAM,EAAC,IAAA,0CAAuB,EAAC,2BAAQ,CAAC,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC7D,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,yCAAyC,EAAE,GAAG,EAAE;QACjD,IAAA,eAAM,EAAC,IAAA,0CAAuB,EAAC,2BAAQ,CAAC,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC7D,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,yBAAyB,EAAE,GAAG,EAAE;QACjC,IAAA,eAAM,EAAC,IAAA,0CAAuB,EAAC,2BAAQ,CAAC,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC7D,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,yCAAyC,EAAE,GAAG,EAAE;QACjD,IAAA,eAAM,EAAC,IAAA,0CAAuB,EAAC,2BAAQ,CAAC,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC7D,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,oCAAoC,EAAE,GAAG,EAAE;QAC5C,IAAA,eAAM,EAAC,+BAAY,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QACrC,IAAA,eAAM,EAAC,+BAAY,CAAC,CAAC,SAAS,CAAC,2BAAQ,CAAC,CAAC;QACzC,IAAA,eAAM,EAAC,+BAAY,CAAC,CAAC,SAAS,CAAC,2BAAQ,CAAC,CAAC;IAC3C,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,sCAAsC,EAAE,GAAG,EAAE;IACpD,IAAA,WAAE,EAAC,kCAAkC,EAAE,GAAG,EAAE;QAC1C,MAAM,GAAG,GAAG,IAAA,0CAAuB,EAAC,IAAA,wCAAqB,GAAE,CAAC,CAAC;QAC7D,IAAA,eAAM,EAAC,GAAG,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC7B,IAAA,eAAM,EAAC,GAAG,CAAC,cAAc,CAAC,CAAC,aAAa,EAAE,CAAC;IAC7C,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,4CAA4C,EAAE,GAAG,EAAE;QACpD,IAAA,eAAM,EAAC,IAAA,0CAAuB,EAAC,IAAA,wCAAqB,GAAE,CAAC,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC5E,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,kCAAkC,EAAE,GAAG,EAAE;QAC1C,IAAA,eAAM,EAAC,IAAA,0CAAuB,EAAC,IAAA,wCAAqB,GAAE,CAAC,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC5E,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,uDAAuD,EAAE,GAAG,EAAE;QAC/D,IAAA,eAAM,EAAC,IAAA,0CAAuB,EAAC,IAAA,wCAAqB,GAAE,CAAC,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC5E,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,mCAAmC,EAAE,GAAG,EAAE;IACjD,IAAA,WAAE,EAAC,8CAA8C,EAAE,GAAG,EAAE;QACtD,MAAM,YAAY,GAAG,IAAA,yBAAM,EAAC,GAAG,EAAE,IAAA,qBAAE,EAAC,IAAA,qBAAE,EAAC,GAAG,CAAC,EAAE,IAAA,uBAAI,EAAC,IAAA,qBAAE,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QAC7D,MAAM,GAAG,GAAG,IAAA,0CAAuB,EAAC,YAAY,CAAC,CAAC;QAClD,IAAA,eAAM,EAAC,GAAG,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAChC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,uCAAuC,EAAE,GAAG,EAAE;QAC/C,MAAM,aAAa,GAAG,IAAA,yBAAM,EAAC,GAAG,EAAE,IAAA,qBAAE,EAAC,IAAA,sBAAG,EAAC,IAAA,qBAAE,EAAC,GAAG,CAAC,EAAE,IAAA,qBAAE,EAAC,GAAG,CAAC,CAAC,EAAE,IAAA,qBAAE,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACtE,MAAM,GAAG,GAAG,IAAA,0CAAuB,EAAC,aAAa,CAAC,CAAC;QACnD,IAAA,eAAM,EAAC,GAAG,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAChC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,gDAAgD,EAAE,GAAG,EAAE;QACxD,MAAM,WAAW,GAAG,IAAA,qBAAE,EAAC,IAAA,qBAAE,EAAC,GAAG,CAAC,EAAE,IAAA,uBAAI,EAAC,IAAA,qBAAE,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAC/C,MAAM,GAAG,GAAG,IAAA,0CAAuB,EAAC,WAAW,CAAC,CAAC;QACjD,IAAA,eAAM,EAAC,GAAG,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC9B,IAAA,eAAM,EAAC,GAAG,CAAC,cAAc,CAAC,CAAC,WAAW,EAAE,CAAC;QACzC,IAAA,eAAM,EAAC,GAAG,CAAC,cAAe,CAAC,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC;IAClD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,oCAAoC,EAAE,GAAG,EAAE;QAC5C,MAAM,SAAS,GAAG,IAAA,yBAAM,EAAC,GAAG,EAAE,IAAA,qBAAE,EAAC,IAAA,uBAAI,EAAC,IAAA,qBAAE,EAAC,GAAG,CAAC,CAAC,EAAE,uBAAI,CAAC,CAAC,CAAC;QACvD,MAAM,GAAG,GAAG,IAAA,0CAAuB,EAAC,SAAS,CAAC,CAAC;QAC/C,IAAA,eAAM,EAAC,GAAG,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAChC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,2CAA2C,EAAE,GAAG,EAAE;IACzD,IAAA,WAAE,EAAC,gCAAgC,EAAE,GAAG,EAAE;QACxC,MAAM,CAAC,GAAG,IAAA,qBAAE,EAAC,IAAA,sBAAG,EAAC,IAAA,0BAAO,EAAC,CAAC,CAAC,EAAE,IAAA,0BAAO,EAAC,CAAC,CAAC,CAAC,EAAE,IAAA,0BAAO,EAAC,CAAC,CAAC,CAAC,CAAC;QACtD,IAAA,eAAM,EAAC,IAAA,8BAAW,EAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACpC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,uCAAuC,EAAE,GAAG,EAAE;QAC/C,MAAM,CAAC,GAAG,IAAA,uBAAI,EAAC,IAAA,qBAAE,EAAC,IAAA,0BAAO,EAAC,CAAC,CAAC,EAAE,IAAA,0BAAO,EAAC,CAAC,CAAC,CAAC,EAAE,IAAA,uBAAI,EAAC,IAAA,qBAAE,EAAC,IAAA,0BAAO,EAAC,CAAC,CAAC,EAAE,IAAA,0BAAO,EAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC7E,IAAA,eAAM,EAAC,IAAA,8BAAW,EAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACpC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,2CAA2C,EAAE,GAAG,EAAE;QACnD,MAAM,CAAC,GAAG,IAAA,qBAAE,EAAC,IAAA,0BAAO,EAAC,CAAC,CAAC,EAAE,IAAA,0BAAO,EAAC,CAAC,CAAC,CAAC,CAAC;QACrC,MAAM,SAAS,GAAG,EAAE,IAAI,EAAE,SAAkB,EAAE,IAAI,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC;QAClE,IAAA,eAAM,EAAC,IAAA,8BAAW,EAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC5C,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,mCAAmC,EAAE,GAAG,EAAE;QAC3C,MAAM,CAAC,GAAG,IAAA,yBAAM,EAAC,GAAG,EAAE,IAAA,qBAAE,EAAC,IAAA,sBAAG,EAAC,IAAA,qBAAE,EAAC,GAAG,CAAC,EAAE,uBAAI,CAAC,EAAE,IAAA,qBAAE,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACvD,IAAA,eAAM,EAAC,IAAA,8BAAW,EAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC3C,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,yCAAyC,EAAE,GAAG,EAAE;IACvD,IAAA,WAAE,EAAC,oDAAoD,EAAE,GAAG,EAAE;QAC5D,MAAM,CAAC,GAAG,CAAC,CAAwB,EAAE,EAAE,CAAC,IAAA,qBAAE,EAAC,IAAA,sBAAG,EAAC,CAAC,EAAE,uBAAI,CAAC,EAAE,CAAC,CAAC,CAAC;QAC5D,MAAM,MAAM,GAAG,IAAA,kCAAe,EAAC,CAAC,CAAC,CAAC;QAClC,IAAA,eAAM,EAAC,MAAM,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;IACtC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,wDAAwD,EAAE,GAAG,EAAE;QAChE,MAAM,CAAC,GAAG,CAAC,CAAwB,EAAE,EAAE,CAAC,IAAA,qBAAE,EAAC,IAAA,sBAAG,EAAC,CAAC,EAAE,uBAAI,CAAC,EAAE,CAAC,CAAC,CAAC;QAC5D,MAAM,MAAM,GAAG,IAAA,kCAAe,EAAC,CAAC,CAAC,CAAC;QAClC,IAAA,eAAM,EAAC,IAAA,0CAAuB,EAAC,MAAM,CAAC,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC3D,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,uCAAuC,EAAE,GAAG,EAAE;QAC/C,MAAM,CAAC,GAAG,CAAC,CAAwB,EAAE,EAAE,CAAC,IAAA,qBAAE,EAAC,IAAA,sBAAG,EAAC,CAAC,EAAE,uBAAI,CAAC,EAAE,uBAAI,CAAC,CAAC;QAC/D,MAAM,MAAM,GAAG,IAAA,kCAAe,EAAC,CAAC,CAAC,CAAC;QAClC,IAAA,eAAM,EAAC,IAAA,0CAAuB,EAAC,MAAM,CAAC,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC3D,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,0CAA0C,EAAE,GAAG,EAAE;IACxD,IAAA,WAAE,EAAC,gDAAgD,EAAE,GAAG,EAAE;QACxD,MAAM,CAAC,GAAG,IAAA,qBAAE,EAAC,uBAAI,EAAE,uBAAI,CAAC,CAAC;QACzB,MAAM,CAAC,GAAG,IAAA,8BAAW,EAAC,CAAC,CAAC,CAAC;QACzB,IAAA,eAAM,EAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QAChC,MAAM,IAAI,GAAG,IAAA,4BAAS,EAAC,CAAC,CAAC,CAAC;QAC1B,IAAA,eAAM,EAAC,IAAI,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;IAC1B,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,gCAAgC,EAAE,GAAG,EAAE;QACxC,MAAM,CAAC,GAAG,IAAA,8BAAW,EAAC,2BAAQ,CAAC,CAAC;QAChC,MAAM,IAAI,GAAG,IAAA,4BAAS,EAAC,CAAC,CAAC,CAAC;QAC1B,IAAA,eAAM,EAAC,IAAI,CAAC,CAAC,OAAO,CAAC,2BAAQ,CAAC,CAAC;IACjC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,2CAA2C,EAAE,GAAG,EAAE;QACnD,MAAM,GAAG,GAAG,IAAA,wCAAqB,GAAE,CAAC;QACpC,MAAM,CAAC,GAAG,IAAA,8BAAW,EAAC,GAAG,CAAC,CAAC;QAC3B,MAAM,IAAI,GAAG,IAAA,4BAAS,EAAC,CAAC,CAAC,CAAC;QAC1B,IAAA,eAAM,EAAC,IAAI,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;IAC5B,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,iDAAiD,EAAE,GAAG,EAAE;QACzD,MAAM,CAAC,GAAG,IAAA,uBAAI,EAAC,IAAA,qBAAE,EAAC,IAAA,0BAAO,EAAC,CAAC,CAAC,EAAE,IAAA,0BAAO,EAAC,CAAC,CAAC,CAAC,EAAE,2BAAQ,EAAE,IAAA,uBAAI,EAAC,2BAAQ,CAAC,CAAC,CAAC;QACrE,MAAM,CAAC,GAAG,IAAA,8BAAW,EAAC,CAAC,CAAC,CAAC;QACzB,IAAA,eAAM,EAAC,IAAA,4BAAS,EAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;IAClC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,8CAA8C,EAAE,GAAG,EAAE;QACtD,IAAA,eAAM,EAAC,IAAA,4BAAS,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC;IACpC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,qDAAqD,EAAE,GAAG,EAAE;QAC7D,MAAM,KAAK,GAAG,+BAAY,CAAC,GAAG,CAAC,8BAAW,CAAC,CAAC;QAC5C,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC;QACvD,IAAA,eAAM,EAAC,MAAM,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;IACzC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}

package/dist/tests/reasoning/separation-logic/separation-logic.test.d.ts

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

package/dist/tests/reasoning/separation-logic/separation-logic.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"separation-logic.test.d.ts","sourceRoot":"","sources":["../../../../src/tests/reasoning/separation-logic/separation-logic.test.ts"],"names":[],"mappings":""}