@stevenvo780/st-lang 4.13.0 → 4.14.1

package/dist/tests/reasoning/separation-logic/separation-logic.test.js

@@ -0,0 +1,311 @@
+"use strict";
+// ============================================================
+// Separation Logic — Tests
+// ============================================================
+Object.defineProperty(exports, "__esModule", { value: true });
+const vitest_1 = require("vitest");
+const separation_logic_1 = require("../../../reasoning/separation-logic");
+(0, vitest_1.describe)('separation-logic — heap basics', () => {
+    (0, vitest_1.it)('newHeap es vacío y heapEquals lo confirma', () => {
+        const h = (0, separation_logic_1.newHeap)();
+        (0, vitest_1.expect)(h.size()).toBe(0);
+        (0, vitest_1.expect)(h.domain()).toEqual([]);
+        (0, vitest_1.expect)((0, separation_logic_1.heapEquals)(h, (0, separation_logic_1.newHeap)())).toBe(true);
+    });
+    (0, vitest_1.it)('fromMap crea heap con las entradas dadas e immutabilidad estructural', () => {
+        const h = (0, separation_logic_1.fromMap)([
+            [1, (0, separation_logic_1.intVal)(42)],
+            [3, (0, separation_logic_1.nullVal)()],
+        ]);
+        (0, vitest_1.expect)(h.size()).toBe(2);
+        (0, vitest_1.expect)(h.domain()).toEqual([1, 3]);
+        const v = h.read(1);
+        (0, vitest_1.expect)(v).toBeDefined();
+        (0, vitest_1.expect)((0, separation_logic_1.valueEquals)(v, (0, separation_logic_1.intVal)(42))).toBe(true);
+    });
+    (0, vitest_1.it)('write/delete devuelven nuevos heaps sin mutar el original', () => {
+        const h0 = (0, separation_logic_1.fromMap)([[1, (0, separation_logic_1.intVal)(1)]]);
+        const h1 = h0.write(2, (0, separation_logic_1.intVal)(2));
+        const h2 = h1.delete(1);
+        (0, vitest_1.expect)(h0.size()).toBe(1);
+        (0, vitest_1.expect)(h1.size()).toBe(2);
+        (0, vitest_1.expect)(h2.size()).toBe(1);
+        (0, vitest_1.expect)(h2.has(1)).toBe(false);
+        (0, vitest_1.expect)(h2.has(2)).toBe(true);
+    });
+    (0, vitest_1.it)('disjoint es simétrico y detecta colisiones', () => {
+        const h1 = (0, separation_logic_1.fromMap)([[1, (0, separation_logic_1.intVal)(1)]]);
+        const h2 = (0, separation_logic_1.fromMap)([[2, (0, separation_logic_1.intVal)(2)]]);
+        const h3 = (0, separation_logic_1.fromMap)([[1, (0, separation_logic_1.intVal)(99)]]);
+        (0, vitest_1.expect)((0, separation_logic_1.disjoint)(h1, h2)).toBe(true);
+        (0, vitest_1.expect)((0, separation_logic_1.disjoint)(h2, h1)).toBe(true);
+        (0, vitest_1.expect)((0, separation_logic_1.disjoint)(h1, h3)).toBe(false);
+    });
+    (0, vitest_1.it)('combine produce unión disjunta y devuelve null si hay colisión', () => {
+        const h1 = (0, separation_logic_1.fromMap)([[1, (0, separation_logic_1.intVal)(1)]]);
+        const h2 = (0, separation_logic_1.fromMap)([[2, (0, separation_logic_1.intVal)(2)]]);
+        const merged = (0, separation_logic_1.combine)(h1, h2);
+        (0, vitest_1.expect)(merged).not.toBeNull();
+        (0, vitest_1.expect)(merged.size()).toBe(2);
+        (0, vitest_1.expect)((0, separation_logic_1.combine)(h1, h1)).toBeNull();
+    });
+});
+(0, vitest_1.describe)('separation-logic — semántica de fórmulas', () => {
+    const val = {};
+    (0, vitest_1.it)('emp es verdadero sólo en heap vacío', () => {
+        (0, vitest_1.expect)((0, separation_logic_1.satisfies)((0, separation_logic_1.emp)(), (0, separation_logic_1.newHeap)(), val)).toBe(true);
+        (0, vitest_1.expect)((0, separation_logic_1.satisfies)((0, separation_logic_1.emp)(), (0, separation_logic_1.fromMap)([[1, (0, separation_logic_1.intVal)(1)]]), val)).toBe(false);
+    });
+    (0, vitest_1.it)('pointsTo true sólo en heap con exactamente esa celda', () => {
+        const h = (0, separation_logic_1.fromMap)([[5, (0, separation_logic_1.intVal)(7)]]);
+        (0, vitest_1.expect)((0, separation_logic_1.satisfies)((0, separation_logic_1.pointsTo)((0, separation_logic_1.addrVal)(5), (0, separation_logic_1.intVal)(7)), h, val)).toBe(true);
+        // Valor distinto
+        (0, vitest_1.expect)((0, separation_logic_1.satisfies)((0, separation_logic_1.pointsTo)((0, separation_logic_1.addrVal)(5), (0, separation_logic_1.intVal)(8)), h, val)).toBe(false);
+        // Heap con más de una celda — pointsTo NO es satisfecho (es exacto)
+        const h2 = (0, separation_logic_1.fromMap)([
+            [5, (0, separation_logic_1.intVal)(7)],
+            [6, (0, separation_logic_1.intVal)(7)],
+        ]);
+        (0, vitest_1.expect)((0, separation_logic_1.satisfies)((0, separation_logic_1.pointsTo)((0, separation_logic_1.addrVal)(5), (0, separation_logic_1.intVal)(7)), h2, val)).toBe(false);
+        // pointsTo con loc no-addr no tiene sentido
+        (0, vitest_1.expect)((0, separation_logic_1.satisfies)((0, separation_logic_1.pointsTo)((0, separation_logic_1.intVal)(5), (0, separation_logic_1.intVal)(7)), h, val)).toBe(false);
+    });
+    (0, vitest_1.it)('star: dos pointsTo disjuntos satisfacen su conjunción separadora', () => {
+        const h = (0, separation_logic_1.fromMap)([
+            [1, (0, separation_logic_1.intVal)(10)],
+            [2, (0, separation_logic_1.intVal)(20)],
+        ]);
+        const f = (0, separation_logic_1.star)((0, separation_logic_1.pointsTo)((0, separation_logic_1.addrVal)(1), (0, separation_logic_1.intVal)(10)), (0, separation_logic_1.pointsTo)((0, separation_logic_1.addrVal)(2), (0, separation_logic_1.intVal)(20)));
+        (0, vitest_1.expect)((0, separation_logic_1.satisfies)(f, h, val)).toBe(true);
+        // Si la fórmula menciona una sola celda y el heap tiene dos, la
+        // conjunción separadora no se satisface salvo con emp
+        const f2 = (0, separation_logic_1.pointsTo)((0, separation_logic_1.addrVal)(1), (0, separation_logic_1.intVal)(10));
+        (0, vitest_1.expect)((0, separation_logic_1.satisfies)(f2, h, val)).toBe(false);
+        // Pero star con emp recupera la equivalencia esperada
+        (0, vitest_1.expect)((0, separation_logic_1.satisfies)((0, separation_logic_1.star)(f2, (0, separation_logic_1.emp)()), (0, separation_logic_1.fromMap)([[1, (0, separation_logic_1.intVal)(10)]]), val)).toBe(true);
+    });
+    (0, vitest_1.it)('star: NO se satisface si la misma celda aparece en ambos operandos (no disjoint)', () => {
+        const h = (0, separation_logic_1.fromMap)([[1, (0, separation_logic_1.intVal)(10)]]);
+        const f = (0, separation_logic_1.star)((0, separation_logic_1.pointsTo)((0, separation_logic_1.addrVal)(1), (0, separation_logic_1.intVal)(10)), (0, separation_logic_1.pointsTo)((0, separation_logic_1.addrVal)(1), (0, separation_logic_1.intVal)(10)));
+        (0, vitest_1.expect)((0, separation_logic_1.satisfies)(f, h, val)).toBe(false);
+    });
+    (0, vitest_1.it)('and, or, implies, not se comportan clásicamente sobre fórmulas SL', () => {
+        const h = (0, separation_logic_1.fromMap)([[1, (0, separation_logic_1.intVal)(5)]]);
+        const pX = (0, separation_logic_1.pointsTo)((0, separation_logic_1.addrVal)(1), (0, separation_logic_1.intVal)(5));
+        const pY = (0, separation_logic_1.pointsTo)((0, separation_logic_1.addrVal)(1), (0, separation_logic_1.intVal)(99));
+        (0, vitest_1.expect)((0, separation_logic_1.satisfies)((0, separation_logic_1.andF)(pX, pX), h, val)).toBe(true);
+        (0, vitest_1.expect)((0, separation_logic_1.satisfies)((0, separation_logic_1.andF)(pX, pY), h, val)).toBe(false);
+        (0, vitest_1.expect)((0, separation_logic_1.satisfies)((0, separation_logic_1.orF)(pX, pY), h, val)).toBe(true);
+        (0, vitest_1.expect)((0, separation_logic_1.satisfies)((0, separation_logic_1.notF)(pY), h, val)).toBe(true);
+    });
+    (0, vitest_1.it)('exists/forall sobre dominio finito observable', () => {
+        const h = (0, separation_logic_1.fromMap)([
+            [1, (0, separation_logic_1.intVal)(10)],
+            [2, (0, separation_logic_1.intVal)(10)],
+        ]);
+        // ∃v. (1 ↦ v * 2 ↦ v)  — existe v=10
+        const f = (0, separation_logic_1.existsF)('v', (0, separation_logic_1.star)((0, separation_logic_1.pointsTo)((0, separation_logic_1.addrVal)(1), { kind: 'int', value: 10 }), (0, separation_logic_1.pointsTo)((0, separation_logic_1.addrVal)(2), { kind: 'int', value: 10 })));
+        (0, vitest_1.expect)((0, separation_logic_1.satisfies)(f, h, val)).toBe(true);
+        // ∀v. emp — falso en heap no vacío
+        (0, vitest_1.expect)((0, separation_logic_1.satisfies)((0, separation_logic_1.forallF)('v', (0, separation_logic_1.emp)()), h, val)).toBe(false);
+    });
+    (0, vitest_1.it)('pure: predicado lógico sobre la valuación', () => {
+        const v = { x: (0, separation_logic_1.intVal)(5) };
+        const f = (0, separation_logic_1.pure)('x > 0', (vv) => vv.x?.kind === 'int' && vv.x.value > 0);
+        (0, vitest_1.expect)((0, separation_logic_1.satisfies)(f, (0, separation_logic_1.newHeap)(), v)).toBe(true);
+        (0, vitest_1.expect)((0, separation_logic_1.satisfies)(f, (0, separation_logic_1.newHeap)(), { x: (0, separation_logic_1.intVal)(-1) })).toBe(false);
+    });
+});
+(0, vitest_1.describe)('separation-logic — splits', () => {
+    (0, vitest_1.it)('un heap de n celdas tiene 2^n particiones', () => {
+        const h = (0, separation_logic_1.fromMap)([
+            [1, (0, separation_logic_1.intVal)(1)],
+            [2, (0, separation_logic_1.intVal)(2)],
+            [3, (0, separation_logic_1.intVal)(3)],
+        ]);
+        (0, vitest_1.expect)((0, separation_logic_1.splits)(h).length).toBe(8);
+        // Cada split es disjoint y se recombina al original
+        for (const { h1, h2 } of (0, separation_logic_1.splits)(h)) {
+            (0, vitest_1.expect)((0, separation_logic_1.disjoint)(h1, h2)).toBe(true);
+            const merged = (0, separation_logic_1.combine)(h1, h2);
+            (0, vitest_1.expect)(merged).not.toBeNull();
+            (0, vitest_1.expect)((0, separation_logic_1.heapEquals)(merged, h)).toBe(true);
+        }
+    });
+});
+(0, vitest_1.describe)('separation-logic — comandos / triplas / frame rule', () => {
+    (0, vitest_1.it)('alloc: {emp} x := cons(v) {x ↦ v}', () => {
+        const triple = {
+            pre: (0, separation_logic_1.emp)(),
+            cmd: separation_logic_1.Cmd.alloc('x', (0, separation_logic_1.intVal)(42)),
+            post: (0, separation_logic_1.existsF)('x', (0, separation_logic_1.pointsTo)({ kind: 'addr', loc: 1 }, (0, separation_logic_1.intVal)(42))),
+        };
+        // Verificar manualmente sobre heap vacío
+        const result = (0, separation_logic_1.checkTriple)({
+            pre: (0, separation_logic_1.emp)(),
+            cmd: triple.cmd,
+            post: (0, separation_logic_1.pointsTo)({ kind: 'addr', loc: 1 }, (0, separation_logic_1.intVal)(42)),
+        }, { candidates: [{ heap: (0, separation_logic_1.newHeap)(), val: {} }], samples: 0 });
+        (0, vitest_1.expect)(result.valid).toBe(true);
+        (0, vitest_1.expect)(result.modelsChecked).toBeGreaterThan(0);
+    });
+    (0, vitest_1.it)('store: {x ↦ -} [x] ← v {x ↦ v}', () => {
+        const candidates = [
+            { heap: (0, separation_logic_1.fromMap)([[1, (0, separation_logic_1.intVal)(0)]]), val: { x: (0, separation_logic_1.addrVal)(1) } },
+            { heap: (0, separation_logic_1.fromMap)([[1, (0, separation_logic_1.intVal)(99)]]), val: { x: (0, separation_logic_1.addrVal)(1) } },
+        ];
+        const triple = {
+            pre: (0, separation_logic_1.pointsTo)((0, separation_logic_1.addrVal)(1), (0, separation_logic_1.intVal)(0)),
+            cmd: separation_logic_1.Cmd.store('x', (0, separation_logic_1.intVal)(7)),
+            post: (0, separation_logic_1.pointsTo)((0, separation_logic_1.addrVal)(1), (0, separation_logic_1.intVal)(7)),
+        };
+        const result = (0, separation_logic_1.checkTriple)(triple, { candidates, samples: 0 });
+        (0, vitest_1.expect)(result.valid).toBe(true);
+    });
+    (0, vitest_1.it)('load: {x ↦ v} y := [x] {x ↦ v ∧ y = v}  — se verifica sobre modelo concreto', () => {
+        const heap = (0, separation_logic_1.fromMap)([[3, (0, separation_logic_1.intVal)(11)]]);
+        const val = { x: (0, separation_logic_1.addrVal)(3) };
+        const cmd = separation_logic_1.Cmd.load('y', 'x');
+        // Verificación manual del axioma
+        const result = (0, separation_logic_1.checkTriple)({
+            pre: (0, separation_logic_1.pointsTo)((0, separation_logic_1.addrVal)(3), (0, separation_logic_1.intVal)(11)),
+            cmd,
+            post: (0, separation_logic_1.pointsTo)((0, separation_logic_1.addrVal)(3), (0, separation_logic_1.intVal)(11)),
+        }, { candidates: [{ heap, val }], samples: 0 });
+        (0, vitest_1.expect)(result.valid).toBe(true);
+    });
+    (0, vitest_1.it)('free: {x ↦ v} free(x) {emp}', () => {
+        const heap = (0, separation_logic_1.fromMap)([[2, (0, separation_logic_1.intVal)(5)]]);
+        const val = { x: (0, separation_logic_1.addrVal)(2) };
+        const result = (0, separation_logic_1.checkTriple)({
+            pre: (0, separation_logic_1.pointsTo)((0, separation_logic_1.addrVal)(2), (0, separation_logic_1.intVal)(5)),
+            cmd: separation_logic_1.Cmd.free('x'),
+            post: (0, separation_logic_1.emp)(),
+        }, { candidates: [{ heap, val }], samples: 0 });
+        (0, vitest_1.expect)(result.valid).toBe(true);
+    });
+    (0, vitest_1.it)('frame rule: {P} c {Q} extiende a {P * R} c {Q * R} preservando disjunción', () => {
+        // {1 ↦ 0} store(x, 7) {1 ↦ 7}   donde x = &1
+        const base = {
+            pre: (0, separation_logic_1.pointsTo)((0, separation_logic_1.addrVal)(1), (0, separation_logic_1.intVal)(0)),
+            cmd: separation_logic_1.Cmd.store('x', (0, separation_logic_1.intVal)(7)),
+            post: (0, separation_logic_1.pointsTo)((0, separation_logic_1.addrVal)(1), (0, separation_logic_1.intVal)(7)),
+        };
+        const frameFormula = (0, separation_logic_1.pointsTo)((0, separation_logic_1.addrVal)(2), (0, separation_logic_1.intVal)(100));
+        const framed = (0, separation_logic_1.frame)(base, frameFormula);
+        (0, vitest_1.expect)(framed.pre.kind).toBe('star');
+        (0, vitest_1.expect)(framed.post.kind).toBe('star');
+        const heap = (0, separation_logic_1.fromMap)([
+            [1, (0, separation_logic_1.intVal)(0)],
+            [2, (0, separation_logic_1.intVal)(100)],
+        ]);
+        const val = { x: (0, separation_logic_1.addrVal)(1) };
+        const result = (0, separation_logic_1.checkTriple)(framed, {
+            candidates: [{ heap, val }],
+            samples: 0,
+        });
+        (0, vitest_1.expect)(result.valid).toBe(true);
+    });
+    (0, vitest_1.it)('checkTriple detecta contraejemplo cuando la postcondición miente', () => {
+        const result = (0, separation_logic_1.checkTriple)({
+            pre: (0, separation_logic_1.pointsTo)((0, separation_logic_1.addrVal)(1), (0, separation_logic_1.intVal)(0)),
+            cmd: separation_logic_1.Cmd.store('x', (0, separation_logic_1.intVal)(7)),
+            post: (0, separation_logic_1.pointsTo)((0, separation_logic_1.addrVal)(1), (0, separation_logic_1.intVal)(99)), // mentira: dijo 99
+        }, {
+            candidates: [{ heap: (0, separation_logic_1.fromMap)([[1, (0, separation_logic_1.intVal)(0)]]), val: { x: (0, separation_logic_1.addrVal)(1) } }],
+            samples: 0,
+        });
+        (0, vitest_1.expect)(result.valid).toBe(false);
+        (0, vitest_1.expect)(result.counterexample).toBeDefined();
+    });
+    (0, vitest_1.it)('store sobre celda libre produce memory fault (no es valid en post)', () => {
+        const result = (0, separation_logic_1.checkTriple)({
+            pre: (0, separation_logic_1.emp)(),
+            cmd: separation_logic_1.Cmd.store('x', (0, separation_logic_1.intVal)(7)),
+            post: (0, separation_logic_1.emp)(),
+        }, {
+            candidates: [{ heap: (0, separation_logic_1.newHeap)(), val: { x: (0, separation_logic_1.addrVal)(1) } }],
+            samples: 0,
+        });
+        (0, vitest_1.expect)(result.valid).toBe(false);
+        (0, vitest_1.expect)(result.counterexample?.reason).toMatch(/fault/);
+    });
+});
+(0, vitest_1.describe)('separation-logic — predicados inductivos', () => {
+    (0, vitest_1.it)('isListSegment: ls(x, null) sobre lista de 3 nodos', () => {
+        // 1 → 2 → 3 → null
+        const heap = (0, separation_logic_1.fromMap)([
+            [1, (0, separation_logic_1.addrVal)(2)],
+            [2, (0, separation_logic_1.addrVal)(3)],
+            [3, (0, separation_logic_1.nullVal)()],
+        ]);
+        (0, vitest_1.expect)((0, separation_logic_1.isListSegment)((0, separation_logic_1.addrVal)(1), (0, separation_logic_1.nullVal)(), heap)).toBe(true);
+        // ls(x, x) sobre heap vacío
+        (0, vitest_1.expect)((0, separation_logic_1.isListSegment)((0, separation_logic_1.addrVal)(1), (0, separation_logic_1.addrVal)(1), (0, separation_logic_1.newHeap)())).toBe(true);
+        // Heap no vacío y start = end → falso (ls requiere emp)
+        (0, vitest_1.expect)((0, separation_logic_1.isListSegment)((0, separation_logic_1.addrVal)(1), (0, separation_logic_1.addrVal)(1), heap)).toBe(false);
+        // Ciclo: 1 → 2 → 1
+        const cyclic = (0, separation_logic_1.fromMap)([
+            [1, (0, separation_logic_1.addrVal)(2)],
+            [2, (0, separation_logic_1.addrVal)(1)],
+        ]);
+        (0, vitest_1.expect)((0, separation_logic_1.isListSegment)((0, separation_logic_1.addrVal)(1), (0, separation_logic_1.nullVal)(), cyclic)).toBe(false);
+    });
+    (0, vitest_1.it)('listSegment(x, null) bajo satisfiesShape sobre heap de lista', () => {
+        const heap = (0, separation_logic_1.fromMap)([
+            [1, (0, separation_logic_1.addrVal)(2)],
+            [2, (0, separation_logic_1.nullVal)()],
+        ]);
+        const val = { x: (0, separation_logic_1.addrVal)(1) };
+        const f = (0, separation_logic_1.listSegment)((0, separation_logic_1.addrVal)(1), (0, separation_logic_1.nullVal)());
+        (0, vitest_1.expect)((0, separation_logic_1.satisfiesShape)(f, heap, val)).toBe(true);
+        // El printer respeta la notación ls(...)
+        (0, vitest_1.expect)((0, separation_logic_1.formulaToString)(f)).toMatch(/ls\(/);
+    });
+    (0, vitest_1.it)('isTree: árbol binario con 3 nodos', () => {
+        //      &1
+        //     /   \
+        //   &10   null
+        //   / \
+        // null null
+        const heap = (0, separation_logic_1.fromMap)([
+            [1, (0, separation_logic_1.addrVal)(10)],
+            [2, (0, separation_logic_1.nullVal)()],
+            [10, (0, separation_logic_1.nullVal)()],
+            [11, (0, separation_logic_1.nullVal)()],
+        ]);
+        (0, vitest_1.expect)((0, separation_logic_1.isTree)((0, separation_logic_1.addrVal)(1), heap)).toBe(true);
+        (0, vitest_1.expect)((0, separation_logic_1.isTree)((0, separation_logic_1.nullVal)(), (0, separation_logic_1.newHeap)())).toBe(true);
+    });
+    (0, vitest_1.it)('tree(...) via satisfiesShape detecta árboles válidos', () => {
+        const heap = (0, separation_logic_1.fromMap)([
+            [1, (0, separation_logic_1.nullVal)()],
+            [2, (0, separation_logic_1.nullVal)()],
+        ]);
+        const f = (0, separation_logic_1.tree)((0, separation_logic_1.addrVal)(1));
+        (0, vitest_1.expect)((0, separation_logic_1.satisfiesShape)(f, heap, {})).toBe(true);
+        (0, vitest_1.expect)((0, separation_logic_1.formulaToString)(f)).toMatch(/tree\(/);
+        // Árbol que comparte nodos no es árbol
+        const cyclic = (0, separation_logic_1.fromMap)([
+            [1, (0, separation_logic_1.addrVal)(1)],
+            [2, (0, separation_logic_1.addrVal)(1)],
+        ]);
+        (0, vitest_1.expect)((0, separation_logic_1.satisfiesShape)(f, cyclic, {})).toBe(false);
+    });
+});
+(0, vitest_1.describe)('separation-logic — magic wand', () => {
+    (0, vitest_1.it)('P -* P es verdadero en heap vacío (frame de uno mismo)', () => {
+        // emp ⊨ (emp -* emp) trivialmente
+        const f = (0, separation_logic_1.magicWand)((0, separation_logic_1.emp)(), (0, separation_logic_1.emp)());
+        (0, vitest_1.expect)((0, separation_logic_1.satisfies)(f, (0, separation_logic_1.newHeap)(), {})).toBe(true);
+    });
+    (0, vitest_1.it)('h ⊨ (P -* Q) implica que extender h con P satisface Q', () => {
+        // Heap: 1 ↦ 5
+        // Fórmula: (2 ↦ 7) -* ((1 ↦ 5) * (2 ↦ 7))
+        // Cualquier extensión que cumpla 2 ↦ 7 produce el resultado esperado.
+        const h = (0, separation_logic_1.fromMap)([[1, (0, separation_logic_1.intVal)(5)]]);
+        const f = (0, separation_logic_1.magicWand)((0, separation_logic_1.pointsTo)((0, separation_logic_1.addrVal)(2), (0, separation_logic_1.intVal)(7)), (0, separation_logic_1.star)((0, separation_logic_1.pointsTo)((0, separation_logic_1.addrVal)(1), (0, separation_logic_1.intVal)(5)), (0, separation_logic_1.pointsTo)((0, separation_logic_1.addrVal)(2), (0, separation_logic_1.intVal)(7))));
+        (0, vitest_1.expect)((0, separation_logic_1.satisfies)(f, h, {})).toBe(true);
+    });
+});
+//# sourceMappingURL=separation-logic.test.js.map

package/dist/tests/reasoning/separation-logic/separation-logic.test.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"separation-logic.test.js","sourceRoot":"","sources":["../../../../src/tests/reasoning/separation-logic/separation-logic.test.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,2BAA2B;AAC3B,+DAA+D;;AAE/D,mCAA8C;AAC9C,0EAgC6C;AAE7C,IAAA,iBAAQ,EAAC,gCAAgC,EAAE,GAAG,EAAE;IAC9C,IAAA,WAAE,EAAC,2CAA2C,EAAE,GAAG,EAAE;QACnD,MAAM,CAAC,GAAG,IAAA,0BAAO,GAAE,CAAC;QACpB,IAAA,eAAM,EAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACzB,IAAA,eAAM,EAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;QAC/B,IAAA,eAAM,EAAC,IAAA,6BAAU,EAAC,CAAC,EAAE,IAAA,0BAAO,GAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC9C,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,sEAAsE,EAAE,GAAG,EAAE;QAC9E,MAAM,CAAC,GAAG,IAAA,0BAAO,EAAC;YAChB,CAAC,CAAC,EAAE,IAAA,yBAAM,EAAC,EAAE,CAAC,CAAC;YACf,CAAC,CAAC,EAAE,IAAA,0BAAO,GAAE,CAAC;SACf,CAAC,CAAC;QACH,IAAA,eAAM,EAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACzB,IAAA,eAAM,EAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QACnC,MAAM,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACpB,IAAA,eAAM,EAAC,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC;QACxB,IAAA,eAAM,EAAC,IAAA,8BAAW,EAAC,CAAE,EAAE,IAAA,yBAAM,EAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACjD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,2DAA2D,EAAE,GAAG,EAAE;QACnE,MAAM,EAAE,GAAG,IAAA,0BAAO,EAAC,CAAC,CAAC,CAAC,EAAE,IAAA,yBAAM,EAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACrC,MAAM,EAAE,GAAG,EAAE,CAAC,KAAK,CAAC,CAAC,EAAE,IAAA,yBAAM,EAAC,CAAC,CAAC,CAAC,CAAC;QAClC,MAAM,EAAE,GAAG,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QACxB,IAAA,eAAM,EAAC,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC1B,IAAA,eAAM,EAAC,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC1B,IAAA,eAAM,EAAC,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC1B,IAAA,eAAM,EAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC9B,IAAA,eAAM,EAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC/B,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,4CAA4C,EAAE,GAAG,EAAE;QACpD,MAAM,EAAE,GAAG,IAAA,0BAAO,EAAC,CAAC,CAAC,CAAC,EAAE,IAAA,yBAAM,EAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACrC,MAAM,EAAE,GAAG,IAAA,0BAAO,EAAC,CAAC,CAAC,CAAC,EAAE,IAAA,yBAAM,EAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACrC,MAAM,EAAE,GAAG,IAAA,0BAAO,EAAC,CAAC,CAAC,CAAC,EAAE,IAAA,yBAAM,EAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QACtC,IAAA,eAAM,EAAC,IAAA,2BAAQ,EAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACpC,IAAA,eAAM,EAAC,IAAA,2BAAQ,EAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACpC,IAAA,eAAM,EAAC,IAAA,2BAAQ,EAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACvC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,gEAAgE,EAAE,GAAG,EAAE;QACxE,MAAM,EAAE,GAAG,IAAA,0BAAO,EAAC,CAAC,CAAC,CAAC,EAAE,IAAA,yBAAM,EAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACrC,MAAM,EAAE,GAAG,IAAA,0BAAO,EAAC,CAAC,CAAC,CAAC,EAAE,IAAA,yBAAM,EAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACrC,MAAM,MAAM,GAAG,IAAA,0BAAO,EAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QAC/B,IAAA,eAAM,EAAC,MAAM,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;QAC9B,IAAA,eAAM,EAAC,MAAO,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC/B,IAAA,eAAM,EAAC,IAAA,0BAAO,EAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC;IACrC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,0CAA0C,EAAE,GAAG,EAAE;IACxD,MAAM,GAAG,GAAgB,EAAE,CAAC;IAE5B,IAAA,WAAE,EAAC,qCAAqC,EAAE,GAAG,EAAE;QAC7C,IAAA,eAAM,EAAC,IAAA,4BAAS,EAAC,IAAA,sBAAG,GAAE,EAAE,IAAA,0BAAO,GAAE,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACpD,IAAA,eAAM,EAAC,IAAA,4BAAS,EAAC,IAAA,sBAAG,GAAE,EAAE,IAAA,0BAAO,EAAC,CAAC,CAAC,CAAC,EAAE,IAAA,yBAAM,EAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACvE,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,sDAAsD,EAAE,GAAG,EAAE;QAC9D,MAAM,CAAC,GAAG,IAAA,0BAAO,EAAC,CAAC,CAAC,CAAC,EAAE,IAAA,yBAAM,EAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACpC,IAAA,eAAM,EAAC,IAAA,4BAAS,EAAC,IAAA,2BAAQ,EAAC,IAAA,0BAAO,EAAC,CAAC,CAAC,EAAE,IAAA,yBAAM,EAAC,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACtE,iBAAiB;QACjB,IAAA,eAAM,EAAC,IAAA,4BAAS,EAAC,IAAA,2BAAQ,EAAC,IAAA,0BAAO,EAAC,CAAC,CAAC,EAAE,IAAA,yBAAM,EAAC,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACvE,oEAAoE;QACpE,MAAM,EAAE,GAAG,IAAA,0BAAO,EAAC;YACjB,CAAC,CAAC,EAAE,IAAA,yBAAM,EAAC,CAAC,CAAC,CAAC;YACd,CAAC,CAAC,EAAE,IAAA,yBAAM,EAAC,CAAC,CAAC,CAAC;SACf,CAAC,CAAC;QACH,IAAA,eAAM,EAAC,IAAA,4BAAS,EAAC,IAAA,2BAAQ,EAAC,IAAA,0BAAO,EAAC,CAAC,CAAC,EAAE,IAAA,yBAAM,EAAC,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACxE,4CAA4C;QAC5C,IAAA,eAAM,EAAC,IAAA,4BAAS,EAAC,IAAA,2BAAQ,EAAC,IAAA,yBAAM,EAAC,CAAC,CAAC,EAAE,IAAA,yBAAM,EAAC,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACxE,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,kEAAkE,EAAE,GAAG,EAAE;QAC1E,MAAM,CAAC,GAAG,IAAA,0BAAO,EAAC;YAChB,CAAC,CAAC,EAAE,IAAA,yBAAM,EAAC,EAAE,CAAC,CAAC;YACf,CAAC,CAAC,EAAE,IAAA,yBAAM,EAAC,EAAE,CAAC,CAAC;SAChB,CAAC,CAAC;QACH,MAAM,CAAC,GAAG,IAAA,uBAAI,EAAC,IAAA,2BAAQ,EAAC,IAAA,0BAAO,EAAC,CAAC,CAAC,EAAE,IAAA,yBAAM,EAAC,EAAE,CAAC,CAAC,EAAE,IAAA,2BAAQ,EAAC,IAAA,0BAAO,EAAC,CAAC,CAAC,EAAE,IAAA,yBAAM,EAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QACnF,IAAA,eAAM,EAAC,IAAA,4BAAS,EAAC,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACxC,gEAAgE;QAChE,sDAAsD;QACtD,MAAM,EAAE,GAAG,IAAA,2BAAQ,EAAC,IAAA,0BAAO,EAAC,CAAC,CAAC,EAAE,IAAA,yBAAM,EAAC,EAAE,CAAC,CAAC,CAAC;QAC5C,IAAA,eAAM,EAAC,IAAA,4BAAS,EAAC,EAAE,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC1C,sDAAsD;QACtD,IAAA,eAAM,EAAC,IAAA,4BAAS,EAAC,IAAA,uBAAI,EAAC,EAAE,EAAE,IAAA,sBAAG,GAAE,CAAC,EAAE,IAAA,0BAAO,EAAC,CAAC,CAAC,CAAC,EAAE,IAAA,yBAAM,EAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACjF,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,kFAAkF,EAAE,GAAG,EAAE;QAC1F,MAAM,CAAC,GAAG,IAAA,0BAAO,EAAC,CAAC,CAAC,CAAC,EAAE,IAAA,yBAAM,EAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QACrC,MAAM,CAAC,GAAG,IAAA,uBAAI,EAAC,IAAA,2BAAQ,EAAC,IAAA,0BAAO,EAAC,CAAC,CAAC,EAAE,IAAA,yBAAM,EAAC,EAAE,CAAC,CAAC,EAAE,IAAA,2BAAQ,EAAC,IAAA,0BAAO,EAAC,CAAC,CAAC,EAAE,IAAA,yBAAM,EAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QACnF,IAAA,eAAM,EAAC,IAAA,4BAAS,EAAC,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC3C,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,mEAAmE,EAAE,GAAG,EAAE;QAC3E,MAAM,CAAC,GAAG,IAAA,0BAAO,EAAC,CAAC,CAAC,CAAC,EAAE,IAAA,yBAAM,EAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACpC,MAAM,EAAE,GAAG,IAAA,2BAAQ,EAAC,IAAA,0BAAO,EAAC,CAAC,CAAC,EAAE,IAAA,yBAAM,EAAC,CAAC,CAAC,CAAC,CAAC;QAC3C,MAAM,EAAE,GAAG,IAAA,2BAAQ,EAAC,IAAA,0BAAO,EAAC,CAAC,CAAC,EAAE,IAAA,yBAAM,EAAC,EAAE,CAAC,CAAC,CAAC;QAC5C,IAAA,eAAM,EAAC,IAAA,4BAAS,EAAC,IAAA,uBAAI,EAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACnD,IAAA,eAAM,EAAC,IAAA,4BAAS,EAAC,IAAA,uBAAI,EAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACpD,IAAA,eAAM,EAAC,IAAA,4BAAS,EAAC,IAAA,sBAAG,EAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAClD,IAAA,eAAM,EAAC,IAAA,4BAAS,EAAC,IAAA,uBAAI,EAAC,EAAE,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACjD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,+CAA+C,EAAE,GAAG,EAAE;QACvD,MAAM,CAAC,GAAG,IAAA,0BAAO,EAAC;YAChB,CAAC,CAAC,EAAE,IAAA,yBAAM,EAAC,EAAE,CAAC,CAAC;YACf,CAAC,CAAC,EAAE,IAAA,yBAAM,EAAC,EAAE,CAAC,CAAC;SAChB,CAAC,CAAC;QACH,qCAAqC;QACrC,MAAM,CAAC,GAAG,IAAA,0BAAO,EACf,GAAG,EACH,IAAA,uBAAI,EACF,IAAA,2BAAQ,EAAC,IAAA,0BAAO,EAAC,CAAC,CAAC,EAAE,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC,EAChD,IAAA,2BAAQ,EAAC,IAAA,0BAAO,EAAC,CAAC,CAAC,EAAE,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC,CACjD,CACF,CAAC;QACF,IAAA,eAAM,EAAC,IAAA,4BAAS,EAAC,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAExC,mCAAmC;QACnC,IAAA,eAAM,EAAC,IAAA,4BAAS,EAAC,IAAA,0BAAO,EAAC,GAAG,EAAE,IAAA,sBAAG,GAAE,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC7D,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,2CAA2C,EAAE,GAAG,EAAE;QACnD,MAAM,CAAC,GAAgB,EAAE,CAAC,EAAE,IAAA,yBAAM,EAAC,CAAC,CAAC,EAAE,CAAC;QACxC,MAAM,CAAC,GAAG,IAAA,uBAAI,EAAC,OAAO,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,IAAI,KAAK,KAAK,IAAI,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;QACxE,IAAA,eAAM,EAAC,IAAA,4BAAS,EAAC,CAAC,EAAE,IAAA,0BAAO,GAAE,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC9C,IAAA,eAAM,EAAC,IAAA,4BAAS,EAAC,CAAC,EAAE,IAAA,0BAAO,GAAE,EAAE,EAAE,CAAC,EAAE,IAAA,yBAAM,EAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACjE,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,2BAA2B,EAAE,GAAG,EAAE;IACzC,IAAA,WAAE,EAAC,2CAA2C,EAAE,GAAG,EAAE;QACnD,MAAM,CAAC,GAAG,IAAA,0BAAO,EAAC;YAChB,CAAC,CAAC,EAAE,IAAA,yBAAM,EAAC,CAAC,CAAC,CAAC;YACd,CAAC,CAAC,EAAE,IAAA,yBAAM,EAAC,CAAC,CAAC,CAAC;YACd,CAAC,CAAC,EAAE,IAAA,yBAAM,EAAC,CAAC,CAAC,CAAC;SACf,CAAC,CAAC;QACH,IAAA,eAAM,EAAC,IAAA,yBAAM,EAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACjC,oDAAoD;QACpD,KAAK,MAAM,EAAE,EAAE,EAAE,EAAE,EAAE,IAAI,IAAA,yBAAM,EAAC,CAAC,CAAC,EAAE,CAAC;YACnC,IAAA,eAAM,EAAC,IAAA,2BAAQ,EAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACpC,MAAM,MAAM,GAAG,IAAA,0BAAO,EAAC,EAAE,EAAE,EAAE,CAAC,CAAC;YAC/B,IAAA,eAAM,EAAC,MAAM,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;YAC9B,IAAA,eAAM,EAAC,IAAA,6BAAU,EAAC,MAAO,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC5C,CAAC;IACH,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,oDAAoD,EAAE,GAAG,EAAE;IAClE,IAAA,WAAE,EAAC,mCAAmC,EAAE,GAAG,EAAE;QAC3C,MAAM,MAAM,GAAG;YACb,GAAG,EAAE,IAAA,sBAAG,GAAE;YACV,GAAG,EAAE,sBAAG,CAAC,KAAK,CAAC,GAAG,EAAE,IAAA,yBAAM,EAAC,EAAE,CAAC,CAAC;YAC/B,IAAI,EAAE,IAAA,0BAAO,EAAC,GAAG,EAAE,IAAA,2BAAQ,EAAC,EAAE,IAAI,EAAE,MAAM,EAAE,GAAG,EAAE,CAAC,EAAE,EAAE,IAAA,yBAAM,EAAC,EAAE,CAAC,CAAC,CAAC;SACnE,CAAC;QACF,yCAAyC;QACzC,MAAM,MAAM,GAAG,IAAA,8BAAW,EACxB;YACE,GAAG,EAAE,IAAA,sBAAG,GAAE;YACV,GAAG,EAAE,MAAM,CAAC,GAAG;YACf,IAAI,EAAE,IAAA,2BAAQ,EAAC,EAAE,IAAI,EAAE,MAAM,EAAE,GAAG,EAAE,CAAC,EAAE,EAAE,IAAA,yBAAM,EAAC,EAAE,CAAC,CAAC;SACrD,EACD,EAAE,UAAU,EAAE,CAAC,EAAE,IAAI,EAAE,IAAA,0BAAO,GAAE,EAAE,GAAG,EAAE,EAAE,EAAE,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,CAC3D,CAAC;QACF,IAAA,eAAM,EAAC,MAAM,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAChC,IAAA,eAAM,EAAC,MAAM,CAAC,aAAa,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;IAClD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,gCAAgC,EAAE,GAAG,EAAE;QACxC,MAAM,UAAU,GAAG;YACjB,EAAE,IAAI,EAAE,IAAA,0BAAO,EAAC,CAAC,CAAC,CAAC,EAAE,IAAA,yBAAM,EAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,EAAE,CAAC,EAAE,IAAA,0BAAO,EAAC,CAAC,CAAC,EAAE,EAAE;YAC3D,EAAE,IAAI,EAAE,IAAA,0BAAO,EAAC,CAAC,CAAC,CAAC,EAAE,IAAA,yBAAM,EAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,EAAE,CAAC,EAAE,IAAA,0BAAO,EAAC,CAAC,CAAC,EAAE,EAAE;SAC7D,CAAC;QACF,MAAM,MAAM,GAAG;YACb,GAAG,EAAE,IAAA,2BAAQ,EAAC,IAAA,0BAAO,EAAC,CAAC,CAAC,EAAE,IAAA,yBAAM,EAAC,CAAC,CAAC,CAAC;YACpC,GAAG,EAAE,sBAAG,CAAC,KAAK,CAAC,GAAG,EAAE,IAAA,yBAAM,EAAC,CAAC,CAAC,CAAC;YAC9B,IAAI,EAAE,IAAA,2BAAQ,EAAC,IAAA,0BAAO,EAAC,CAAC,CAAC,EAAE,IAAA,yBAAM,EAAC,CAAC,CAAC,CAAC;SACtC,CAAC;QACF,MAAM,MAAM,GAAG,IAAA,8BAAW,EAAC,MAAM,EAAE,EAAE,UAAU,EAAE,OAAO,EAAE,CAAC,EAAE,CAAC,CAAC;QAC/D,IAAA,eAAM,EAAC,MAAM,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAClC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,6EAA6E,EAAE,GAAG,EAAE;QACrF,MAAM,IAAI,GAAG,IAAA,0BAAO,EAAC,CAAC,CAAC,CAAC,EAAE,IAAA,yBAAM,EAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QACxC,MAAM,GAAG,GAAgB,EAAE,CAAC,EAAE,IAAA,0BAAO,EAAC,CAAC,CAAC,EAAE,CAAC;QAC3C,MAAM,GAAG,GAAG,sBAAG,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;QAC/B,iCAAiC;QACjC,MAAM,MAAM,GAAG,IAAA,8BAAW,EACxB;YACE,GAAG,EAAE,IAAA,2BAAQ,EAAC,IAAA,0BAAO,EAAC,CAAC,CAAC,EAAE,IAAA,yBAAM,EAAC,EAAE,CAAC,CAAC;YACrC,GAAG;YACH,IAAI,EAAE,IAAA,2BAAQ,EAAC,IAAA,0BAAO,EAAC,CAAC,CAAC,EAAE,IAAA,yBAAM,EAAC,EAAE,CAAC,CAAC;SACvC,EACD,EAAE,UAAU,EAAE,CAAC,EAAE,IAAI,EAAE,GAAG,EAAE,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,CAC5C,CAAC;QACF,IAAA,eAAM,EAAC,MAAM,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAClC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,6BAA6B,EAAE,GAAG,EAAE;QACrC,MAAM,IAAI,GAAG,IAAA,0BAAO,EAAC,CAAC,CAAC,CAAC,EAAE,IAAA,yBAAM,EAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACvC,MAAM,GAAG,GAAgB,EAAE,CAAC,EAAE,IAAA,0BAAO,EAAC,CAAC,CAAC,EAAE,CAAC;QAC3C,MAAM,MAAM,GAAG,IAAA,8BAAW,EACxB;YACE,GAAG,EAAE,IAAA,2BAAQ,EAAC,IAAA,0BAAO,EAAC,CAAC,CAAC,EAAE,IAAA,yBAAM,EAAC,CAAC,CAAC,CAAC;YACpC,GAAG,EAAE,sBAAG,CAAC,IAAI,CAAC,GAAG,CAAC;YAClB,IAAI,EAAE,IAAA,sBAAG,GAAE;SACZ,EACD,EAAE,UAAU,EAAE,CAAC,EAAE,IAAI,EAAE,GAAG,EAAE,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,CAC5C,CAAC;QACF,IAAA,eAAM,EAAC,MAAM,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAClC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,2EAA2E,EAAE,GAAG,EAAE;QACnF,6CAA6C;QAC7C,MAAM,IAAI,GAAG;YACX,GAAG,EAAE,IAAA,2BAAQ,EAAC,IAAA,0BAAO,EAAC,CAAC,CAAC,EAAE,IAAA,yBAAM,EAAC,CAAC,CAAC,CAAC;YACpC,GAAG,EAAE,sBAAG,CAAC,KAAK,CAAC,GAAG,EAAE,IAAA,yBAAM,EAAC,CAAC,CAAC,CAAC;YAC9B,IAAI,EAAE,IAAA,2BAAQ,EAAC,IAAA,0BAAO,EAAC,CAAC,CAAC,EAAE,IAAA,yBAAM,EAAC,CAAC,CAAC,CAAC;SACtC,CAAC;QACF,MAAM,YAAY,GAAG,IAAA,2BAAQ,EAAC,IAAA,0BAAO,EAAC,CAAC,CAAC,EAAE,IAAA,yBAAM,EAAC,GAAG,CAAC,CAAC,CAAC;QACvD,MAAM,MAAM,GAAG,IAAA,wBAAK,EAAC,IAAI,EAAE,YAAY,CAAC,CAAC;QACzC,IAAA,eAAM,EAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACrC,IAAA,eAAM,EAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAEtC,MAAM,IAAI,GAAG,IAAA,0BAAO,EAAC;YACnB,CAAC,CAAC,EAAE,IAAA,yBAAM,EAAC,CAAC,CAAC,CAAC;YACd,CAAC,CAAC,EAAE,IAAA,yBAAM,EAAC,GAAG,CAAC,CAAC;SACjB,CAAC,CAAC;QACH,MAAM,GAAG,GAAgB,EAAE,CAAC,EAAE,IAAA,0BAAO,EAAC,CAAC,CAAC,EAAE,CAAC;QAC3C,MAAM,MAAM,GAAG,IAAA,8BAAW,EAAC,MAAM,EAAE;YACjC,UAAU,EAAE,CAAC,EAAE,IAAI,EAAE,GAAG,EAAE,CAAC;YAC3B,OAAO,EAAE,CAAC;SACX,CAAC,CAAC;QACH,IAAA,eAAM,EAAC,MAAM,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAClC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,kEAAkE,EAAE,GAAG,EAAE;QAC1E,MAAM,MAAM,GAAG,IAAA,8BAAW,EACxB;YACE,GAAG,EAAE,IAAA,2BAAQ,EAAC,IAAA,0BAAO,EAAC,CAAC,CAAC,EAAE,IAAA,yBAAM,EAAC,CAAC,CAAC,CAAC;YACpC,GAAG,EAAE,sBAAG,CAAC,KAAK,CAAC,GAAG,EAAE,IAAA,yBAAM,EAAC,CAAC,CAAC,CAAC;YAC9B,IAAI,EAAE,IAAA,2BAAQ,EAAC,IAAA,0BAAO,EAAC,CAAC,CAAC,EAAE,IAAA,yBAAM,EAAC,EAAE,CAAC,CAAC,EAAE,mBAAmB;SAC5D,EACD;YACE,UAAU,EAAE,CAAC,EAAE,IAAI,EAAE,IAAA,0BAAO,EAAC,CAAC,CAAC,CAAC,EAAE,IAAA,yBAAM,EAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,EAAE,CAAC,EAAE,IAAA,0BAAO,EAAC,CAAC,CAAC,EAAE,EAAE,CAAC;YACzE,OAAO,EAAE,CAAC;SACX,CACF,CAAC;QACF,IAAA,eAAM,EAAC,MAAM,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACjC,IAAA,eAAM,EAAC,MAAM,CAAC,cAAc,CAAC,CAAC,WAAW,EAAE,CAAC;IAC9C,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,oEAAoE,EAAE,GAAG,EAAE;QAC5E,MAAM,MAAM,GAAG,IAAA,8BAAW,EACxB;YACE,GAAG,EAAE,IAAA,sBAAG,GAAE;YACV,GAAG,EAAE,sBAAG,CAAC,KAAK,CAAC,GAAG,EAAE,IAAA,yBAAM,EAAC,CAAC,CAAC,CAAC;YAC9B,IAAI,EAAE,IAAA,sBAAG,GAAE;SACZ,EACD;YACE,UAAU,EAAE,CAAC,EAAE,IAAI,EAAE,IAAA,0BAAO,GAAE,EAAE,GAAG,EAAE,EAAE,CAAC,EAAE,IAAA,0BAAO,EAAC,CAAC,CAAC,EAAE,EAAE,CAAC;YACzD,OAAO,EAAE,CAAC;SACX,CACF,CAAC;QACF,IAAA,eAAM,EAAC,MAAM,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACjC,IAAA,eAAM,EAAC,MAAM,CAAC,cAAc,EAAE,MAAM,CAAC,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;IACzD,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,0CAA0C,EAAE,GAAG,EAAE;IACxD,IAAA,WAAE,EAAC,mDAAmD,EAAE,GAAG,EAAE;QAC3D,mBAAmB;QACnB,MAAM,IAAI,GAAG,IAAA,0BAAO,EAAC;YACnB,CAAC,CAAC,EAAE,IAAA,0BAAO,EAAC,CAAC,CAAC,CAAC;YACf,CAAC,CAAC,EAAE,IAAA,0BAAO,EAAC,CAAC,CAAC,CAAC;YACf,CAAC,CAAC,EAAE,IAAA,0BAAO,GAAE,CAAC;SACf,CAAC,CAAC;QACH,IAAA,eAAM,EAAC,IAAA,gCAAa,EAAC,IAAA,0BAAO,EAAC,CAAC,CAAC,EAAE,IAAA,0BAAO,GAAE,EAAE,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC9D,4BAA4B;QAC5B,IAAA,eAAM,EAAC,IAAA,gCAAa,EAAC,IAAA,0BAAO,EAAC,CAAC,CAAC,EAAE,IAAA,0BAAO,EAAC,CAAC,CAAC,EAAE,IAAA,0BAAO,GAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACpE,wDAAwD;QACxD,IAAA,eAAM,EAAC,IAAA,gCAAa,EAAC,IAAA,0BAAO,EAAC,CAAC,CAAC,EAAE,IAAA,0BAAO,EAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAChE,mBAAmB;QACnB,MAAM,MAAM,GAAG,IAAA,0BAAO,EAAC;YACrB,CAAC,CAAC,EAAE,IAAA,0BAAO,EAAC,CAAC,CAAC,CAAC;YACf,CAAC,CAAC,EAAE,IAAA,0BAAO,EAAC,CAAC,CAAC,CAAC;SAChB,CAAC,CAAC;QACH,IAAA,eAAM,EAAC,IAAA,gCAAa,EAAC,IAAA,0BAAO,EAAC,CAAC,CAAC,EAAE,IAAA,0BAAO,GAAE,EAAE,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACnE,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,8DAA8D,EAAE,GAAG,EAAE;QACtE,MAAM,IAAI,GAAG,IAAA,0BAAO,EAAC;YACnB,CAAC,CAAC,EAAE,IAAA,0BAAO,EAAC,CAAC,CAAC,CAAC;YACf,CAAC,CAAC,EAAE,IAAA,0BAAO,GAAE,CAAC;SACf,CAAC,CAAC;QACH,MAAM,GAAG,GAAgB,EAAE,CAAC,EAAE,IAAA,0BAAO,EAAC,CAAC,CAAC,EAAE,CAAC;QAC3C,MAAM,CAAC,GAAG,IAAA,8BAAW,EAAC,IAAA,0BAAO,EAAC,CAAC,CAAC,EAAE,IAAA,0BAAO,GAAE,CAAC,CAAC;QAC7C,IAAA,eAAM,EAAC,IAAA,iCAAc,EAAC,CAAC,EAAE,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAChD,yCAAyC;QACzC,IAAA,eAAM,EAAC,IAAA,kCAAe,EAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;IAC7C,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,mCAAmC,EAAE,GAAG,EAAE;QAC3C,UAAU;QACV,YAAY;QACZ,eAAe;QACf,QAAQ;QACR,YAAY;QACZ,MAAM,IAAI,GAAG,IAAA,0BAAO,EAAC;YACnB,CAAC,CAAC,EAAE,IAAA,0BAAO,EAAC,EAAE,CAAC,CAAC;YAChB,CAAC,CAAC,EAAE,IAAA,0BAAO,GAAE,CAAC;YACd,CAAC,EAAE,EAAE,IAAA,0BAAO,GAAE,CAAC;YACf,CAAC,EAAE,EAAE,IAAA,0BAAO,GAAE,CAAC;SAChB,CAAC,CAAC;QACH,IAAA,eAAM,EAAC,IAAA,yBAAM,EAAC,IAAA,0BAAO,EAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC5C,IAAA,eAAM,EAAC,IAAA,yBAAM,EAAC,IAAA,0BAAO,GAAE,EAAE,IAAA,0BAAO,GAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAClD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,sDAAsD,EAAE,GAAG,EAAE;QAC9D,MAAM,IAAI,GAAG,IAAA,0BAAO,EAAC;YACnB,CAAC,CAAC,EAAE,IAAA,0BAAO,GAAE,CAAC;YACd,CAAC,CAAC,EAAE,IAAA,0BAAO,GAAE,CAAC;SACf,CAAC,CAAC;QACH,MAAM,CAAC,GAAG,IAAA,uBAAI,EAAC,IAAA,0BAAO,EAAC,CAAC,CAAC,CAAC,CAAC;QAC3B,IAAA,eAAM,EAAC,IAAA,iCAAc,EAAC,CAAC,EAAE,IAAI,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC/C,IAAA,eAAM,EAAC,IAAA,kCAAe,EAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;QAC7C,uCAAuC;QACvC,MAAM,MAAM,GAAG,IAAA,0BAAO,EAAC;YACrB,CAAC,CAAC,EAAE,IAAA,0BAAO,EAAC,CAAC,CAAC,CAAC;YACf,CAAC,CAAC,EAAE,IAAA,0BAAO,EAAC,CAAC,CAAC,CAAC;SAChB,CAAC,CAAC;QACH,IAAA,eAAM,EAAC,IAAA,iCAAc,EAAC,CAAC,EAAE,MAAM,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACpD,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,+BAA+B,EAAE,GAAG,EAAE;IAC7C,IAAA,WAAE,EAAC,wDAAwD,EAAE,GAAG,EAAE;QAChE,kCAAkC;QAClC,MAAM,CAAC,GAAG,IAAA,4BAAS,EAAC,IAAA,sBAAG,GAAE,EAAE,IAAA,sBAAG,GAAE,CAAC,CAAC;QAClC,IAAA,eAAM,EAAC,IAAA,4BAAS,EAAC,CAAC,EAAE,IAAA,0BAAO,GAAE,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACjD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,uDAAuD,EAAE,GAAG,EAAE;QAC/D,cAAc;QACd,0CAA0C;QAC1C,sEAAsE;QACtE,MAAM,CAAC,GAAG,IAAA,0BAAO,EAAC,CAAC,CAAC,CAAC,EAAE,IAAA,yBAAM,EAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACpC,MAAM,CAAC,GAAG,IAAA,4BAAS,EACjB,IAAA,2BAAQ,EAAC,IAAA,0BAAO,EAAC,CAAC,CAAC,EAAE,IAAA,yBAAM,EAAC,CAAC,CAAC,CAAC,EAC/B,IAAA,uBAAI,EAAC,IAAA,2BAAQ,EAAC,IAAA,0BAAO,EAAC,CAAC,CAAC,EAAE,IAAA,yBAAM,EAAC,CAAC,CAAC,CAAC,EAAE,IAAA,2BAAQ,EAAC,IAAA,0BAAO,EAAC,CAAC,CAAC,EAAE,IAAA,yBAAM,EAAC,CAAC,CAAC,CAAC,CAAC,CACvE,CAAC;QACF,IAAA,eAAM,EAAC,IAAA,4BAAS,EAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACzC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}

package/dist/tests/reasoning/set-theory/hf-functions.test.js

@@ -9,7 +9,7 @@ const set_theory_1 = require("../../../reasoning/set-theory");
         const id = (0, set_theory_1.makeFunction)(dom, cod, [
             [(0, set_theory_1.nat)(0), (0, set_theory_1.nat)(0)],
             [(0, set_theory_1.nat)(1), (0, set_theory_1.nat)(1)],
-            [(0, set_theory_1.nat)(2), (0, set_theory_1.nat)(2)]
+            [(0, set_theory_1.nat)(2), (0, set_theory_1.nat)(2)],
         ]);
         (0, vitest_1.expect)((0, set_theory_1.isValidFunction)(id)).toBe(true);
         (0, vitest_1.expect)((0, set_theory_1.isInjective)(id)).toBe(true);
@@ -22,7 +22,7 @@ const set_theory_1 = require("../../../reasoning/set-theory");
         const f = (0, set_theory_1.makeFunction)(dom, cod, [
             [(0, set_theory_1.nat)(0), (0, set_theory_1.nat)(2)],
             [(0, set_theory_1.nat)(1), (0, set_theory_1.nat)(4)],
-            [(0, set_theory_1.nat)(2), (0, set_theory_1.nat)(0)]
+            [(0, set_theory_1.nat)(2), (0, set_theory_1.nat)(0)],
         ]);
         const y = (0, set_theory_1.applyHF)(f, (0, set_theory_1.nat)(1));
         (0, vitest_1.expect)(y).not.toBeNull();
@@ -37,7 +37,7 @@ const set_theory_1 = require("../../../reasoning/set-theory");
         const f = (0, set_theory_1.makeFunction)(dom, cod, [
             [(0, set_theory_1.nat)(0), (0, set_theory_1.nat)(1)],
             [(0, set_theory_1.nat)(1), (0, set_theory_1.nat)(1)],
-            [(0, set_theory_1.nat)(2), (0, set_theory_1.nat)(2)]
+            [(0, set_theory_1.nat)(2), (0, set_theory_1.nat)(2)],
         ]);
         (0, vitest_1.expect)((0, set_theory_1.isInjective)(f)).toBe(false);
         (0, vitest_1.expect)((0, set_theory_1.isSurjective)(f)).toBe(false);
@@ -47,7 +47,7 @@ const set_theory_1 = require("../../../reasoning/set-theory");
         const cod = (0, set_theory_1.singleton)((0, set_theory_1.nat)(7));
         const f = (0, set_theory_1.makeFunction)(dom, cod, [
             [set_theory_1.EMPTY, (0, set_theory_1.nat)(7)],
-            [(0, set_theory_1.singleton)(set_theory_1.EMPTY), (0, set_theory_1.nat)(7)]
+            [(0, set_theory_1.singleton)(set_theory_1.EMPTY), (0, set_theory_1.nat)(7)],
         ]);
         (0, vitest_1.expect)((0, set_theory_1.isSurjective)(f)).toBe(true);
         (0, vitest_1.expect)((0, set_theory_1.isInjective)(f)).toBe(false);
@@ -59,13 +59,13 @@ const set_theory_1 = require("../../../reasoning/set-theory");
         const g = (0, set_theory_1.makeFunction)(a, b, [
             [(0, set_theory_1.nat)(0), (0, set_theory_1.nat)(1)],
             [(0, set_theory_1.nat)(1), (0, set_theory_1.nat)(2)],
-            [(0, set_theory_1.nat)(2), (0, set_theory_1.nat)(3)]
+            [(0, set_theory_1.nat)(2), (0, set_theory_1.nat)(3)],
         ]);
         const f = (0, set_theory_1.makeFunction)(b, c, [
             [(0, set_theory_1.nat)(0), (0, set_theory_1.nat)(0)],
             [(0, set_theory_1.nat)(1), (0, set_theory_1.nat)(2)],
             [(0, set_theory_1.nat)(2), (0, set_theory_1.nat)(3)],
-            [(0, set_theory_1.nat)(3), (0, set_theory_1.nat)(4)]
+            [(0, set_theory_1.nat)(3), (0, set_theory_1.nat)(4)],
         ]);
         (0, vitest_1.expect)((0, set_theory_1.isValidFunction)(g)).toBe(true);
         (0, vitest_1.expect)((0, set_theory_1.isValidFunction)(f)).toBe(true);
@@ -85,12 +85,12 @@ const set_theory_1 = require("../../../reasoning/set-theory");
     (0, vitest_1.it)('composeHF retorna null si codominio(g) ≠ dominio(f)', () => {
         const g = (0, set_theory_1.makeFunction)((0, set_theory_1.nat)(2), (0, set_theory_1.nat)(2), [
             [(0, set_theory_1.nat)(0), (0, set_theory_1.nat)(0)],
-            [(0, set_theory_1.nat)(1), (0, set_theory_1.nat)(1)]
+            [(0, set_theory_1.nat)(1), (0, set_theory_1.nat)(1)],
         ]);
         const f = (0, set_theory_1.makeFunction)((0, set_theory_1.nat)(3), (0, set_theory_1.nat)(3), [
             [(0, set_theory_1.nat)(0), (0, set_theory_1.nat)(0)],
             [(0, set_theory_1.nat)(1), (0, set_theory_1.nat)(1)],
-            [(0, set_theory_1.nat)(2), (0, set_theory_1.nat)(2)]
+            [(0, set_theory_1.nat)(2), (0, set_theory_1.nat)(2)],
         ]);
         (0, vitest_1.expect)((0, set_theory_1.composeHF)(f, g)).toBeNull();
     });
@@ -101,13 +101,13 @@ const set_theory_1 = require("../../../reasoning/set-theory");
             elements: [
                 (0, set_theory_1.orderedPair)((0, set_theory_1.nat)(0), (0, set_theory_1.nat)(0)),
                 (0, set_theory_1.orderedPair)((0, set_theory_1.nat)(0), (0, set_theory_1.nat)(1)),
-                (0, set_theory_1.orderedPair)((0, set_theory_1.nat)(1), (0, set_theory_1.nat)(1))
-            ]
+                (0, set_theory_1.orderedPair)((0, set_theory_1.nat)(1), (0, set_theory_1.nat)(1)),
+            ],
         };
         const f = {
             graph: badGraph,
             domain: (0, set_theory_1.nat)(2),
-            codomain: (0, set_theory_1.nat)(2)
+            codomain: (0, set_theory_1.nat)(2),
         };
         (0, vitest_1.expect)((0, set_theory_1.isValidFunction)(f)).toBe(false);
     });

package/dist/tests/reasoning/set-theory/zfc-axioms.test.js

@@ -45,7 +45,7 @@ const set_theory_1 = require("../../../reasoning/set-theory");
             'Infinity',
             'Pairing',
             'Power Set',
-            'Union'
+            'Union',
         ]);
         // Sólo Infinity falla.
         const failing = all.filter((a) => !a.holds);

package/dist/tests/reasoning/universal-algebra/universal-algebra.test.d.ts

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

package/dist/tests/reasoning/universal-algebra/universal-algebra.test.d.ts.map

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