@stevenvo780/st-lang 4.1.0 → 4.3.0

package/dist/tests/intuitionistic-nj/nj.test.js

@@ -0,0 +1,216 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+const vitest_1 = require("vitest");
+const intuitionistic_nj_1 = require("../../profiles/intuitionistic-nj");
+// --- Helpers ---
+const P = (0, intuitionistic_nj_1.atom)('P');
+const Q = (0, intuitionistic_nj_1.atom)('Q');
+const R = (0, intuitionistic_nj_1.atom)('R');
+function rules(tree) {
+    const out = new Set();
+    const walk = (t) => {
+        out.add(t.rule);
+        t.premises.forEach(walk);
+    };
+    if (tree)
+        walk(tree);
+    return out;
+}
+// --- Provable en NJ ---
+(0, vitest_1.describe)('NJ — fórmulas demostrables intuicionistamente', () => {
+    (0, vitest_1.it)('demuestra P → P (identidad)', () => {
+        const proof = (0, intuitionistic_nj_1.proveIntuitionistically)([], (0, intuitionistic_nj_1.implies)(P, P));
+        (0, vitest_1.expect)(proof).not.toBeNull();
+        (0, vitest_1.expect)((0, intuitionistic_nj_1.verifyProof)(proof)).toBe(true);
+        (0, vitest_1.expect)(rules(proof).has('impI')).toBe(true);
+        (0, vitest_1.expect)(rules(proof).has('assumption')).toBe(true);
+    });
+    (0, vitest_1.it)('demuestra (P ∧ Q) → P (proyección izquierda)', () => {
+        const proof = (0, intuitionistic_nj_1.proveIntuitionistically)([], (0, intuitionistic_nj_1.implies)((0, intuitionistic_nj_1.and)(P, Q), P));
+        (0, vitest_1.expect)(proof).not.toBeNull();
+        (0, vitest_1.expect)((0, intuitionistic_nj_1.verifyProof)(proof)).toBe(true);
+    });
+    (0, vitest_1.it)('demuestra (P ∧ Q) → Q (proyección derecha)', () => {
+        const proof = (0, intuitionistic_nj_1.proveIntuitionistically)([], (0, intuitionistic_nj_1.implies)((0, intuitionistic_nj_1.and)(P, Q), Q));
+        (0, vitest_1.expect)(proof).not.toBeNull();
+        (0, vitest_1.expect)((0, intuitionistic_nj_1.verifyProof)(proof)).toBe(true);
+    });
+    (0, vitest_1.it)('demuestra P → (Q → P) (estabilidad)', () => {
+        const proof = (0, intuitionistic_nj_1.proveIntuitionistically)([], (0, intuitionistic_nj_1.implies)(P, (0, intuitionistic_nj_1.implies)(Q, P)));
+        (0, vitest_1.expect)(proof).not.toBeNull();
+        (0, vitest_1.expect)((0, intuitionistic_nj_1.verifyProof)(proof)).toBe(true);
+    });
+    (0, vitest_1.it)('demuestra ((P → Q) ∧ P) → Q (modus ponens curry)', () => {
+        const proof = (0, intuitionistic_nj_1.proveIntuitionistically)([], (0, intuitionistic_nj_1.implies)((0, intuitionistic_nj_1.and)((0, intuitionistic_nj_1.implies)(P, Q), P), Q));
+        (0, vitest_1.expect)(proof).not.toBeNull();
+        (0, vitest_1.expect)((0, intuitionistic_nj_1.verifyProof)(proof)).toBe(true);
+        (0, vitest_1.expect)(rules(proof).has('impE')).toBe(true);
+    });
+    (0, vitest_1.it)('demuestra ¬(P ∧ ¬P) (no-contradicción)', () => {
+        const proof = (0, intuitionistic_nj_1.proveIntuitionistically)([], (0, intuitionistic_nj_1.not)((0, intuitionistic_nj_1.and)(P, (0, intuitionistic_nj_1.not)(P))));
+        (0, vitest_1.expect)(proof).not.toBeNull();
+        (0, vitest_1.expect)((0, intuitionistic_nj_1.verifyProof)(proof)).toBe(true);
+        (0, vitest_1.expect)(rules(proof).has('notI')).toBe(true);
+    });
+    (0, vitest_1.it)('demuestra P → ¬¬P (introducción de doble negación)', () => {
+        const proof = (0, intuitionistic_nj_1.proveIntuitionistically)([], (0, intuitionistic_nj_1.implies)(P, (0, intuitionistic_nj_1.not)((0, intuitionistic_nj_1.not)(P))));
+        (0, vitest_1.expect)(proof).not.toBeNull();
+        (0, vitest_1.expect)((0, intuitionistic_nj_1.verifyProof)(proof)).toBe(true);
+    });
+    (0, vitest_1.it)('demuestra ¬P → (P → ⊥) (definición de negación)', () => {
+        const proof = (0, intuitionistic_nj_1.proveIntuitionistically)([], (0, intuitionistic_nj_1.implies)((0, intuitionistic_nj_1.not)(P), (0, intuitionistic_nj_1.implies)(P, (0, intuitionistic_nj_1.bottom)())));
+        (0, vitest_1.expect)(proof).not.toBeNull();
+        (0, vitest_1.expect)((0, intuitionistic_nj_1.verifyProof)(proof)).toBe(true);
+    });
+    (0, vitest_1.it)('demuestra (P → Q) → (¬Q → ¬P) (contraposición)', () => {
+        const proof = (0, intuitionistic_nj_1.proveIntuitionistically)([], (0, intuitionistic_nj_1.implies)((0, intuitionistic_nj_1.implies)(P, Q), (0, intuitionistic_nj_1.implies)((0, intuitionistic_nj_1.not)(Q), (0, intuitionistic_nj_1.not)(P))));
+        (0, vitest_1.expect)(proof).not.toBeNull();
+        (0, vitest_1.expect)((0, intuitionistic_nj_1.verifyProof)(proof)).toBe(true);
+    });
+    (0, vitest_1.it)('demuestra (P ∧ ¬P) → Q (ex falso vía contradicción)', () => {
+        const proof = (0, intuitionistic_nj_1.proveIntuitionistically)([], (0, intuitionistic_nj_1.implies)((0, intuitionistic_nj_1.and)(P, (0, intuitionistic_nj_1.not)(P)), Q));
+        (0, vitest_1.expect)(proof).not.toBeNull();
+        (0, vitest_1.expect)((0, intuitionistic_nj_1.verifyProof)(proof)).toBe(true);
+    });
+    (0, vitest_1.it)('demuestra ⊥ → Q desde el contexto (ex falso quodlibet)', () => {
+        const proof = (0, intuitionistic_nj_1.proveIntuitionistically)([(0, intuitionistic_nj_1.bottom)()], Q);
+        (0, vitest_1.expect)(proof).not.toBeNull();
+        (0, vitest_1.expect)((0, intuitionistic_nj_1.verifyProof)(proof, [(0, intuitionistic_nj_1.bottom)()])).toBe(true);
+        (0, vitest_1.expect)(rules(proof).has('bottomE')).toBe(true);
+    });
+    (0, vitest_1.it)('demuestra (P ∨ Q) → (Q ∨ P) (commutatividad de ∨)', () => {
+        const proof = (0, intuitionistic_nj_1.proveIntuitionistically)([], (0, intuitionistic_nj_1.implies)((0, intuitionistic_nj_1.or)(P, Q), (0, intuitionistic_nj_1.or)(Q, P)));
+        (0, vitest_1.expect)(proof).not.toBeNull();
+        (0, vitest_1.expect)((0, intuitionistic_nj_1.verifyProof)(proof)).toBe(true);
+        (0, vitest_1.expect)(rules(proof).has('orE')).toBe(true);
+    });
+    (0, vitest_1.it)('demuestra P ∨ ¬P bajo la asunción de P (asunción directa)', () => {
+        const proof = (0, intuitionistic_nj_1.proveIntuitionistically)([P], (0, intuitionistic_nj_1.or)(P, (0, intuitionistic_nj_1.not)(P)));
+        (0, vitest_1.expect)(proof).not.toBeNull();
+        (0, vitest_1.expect)((0, intuitionistic_nj_1.verifyProof)(proof, [P])).toBe(true);
+    });
+    (0, vitest_1.it)('demuestra modus ponens: {P, P→Q} ⊢ Q', () => {
+        const proof = (0, intuitionistic_nj_1.proveIntuitionistically)([P, (0, intuitionistic_nj_1.implies)(P, Q)], Q);
+        (0, vitest_1.expect)(proof).not.toBeNull();
+        (0, vitest_1.expect)((0, intuitionistic_nj_1.verifyProof)(proof, [P, (0, intuitionistic_nj_1.implies)(P, Q)])).toBe(true);
+        (0, vitest_1.expect)(rules(proof).has('impE')).toBe(true);
+    });
+    (0, vitest_1.it)('demuestra (P → Q) → ((Q → R) → (P → R)) (composición)', () => {
+        const proof = (0, intuitionistic_nj_1.proveIntuitionistically)([], (0, intuitionistic_nj_1.implies)((0, intuitionistic_nj_1.implies)(P, Q), (0, intuitionistic_nj_1.implies)((0, intuitionistic_nj_1.implies)(Q, R), (0, intuitionistic_nj_1.implies)(P, R))));
+        (0, vitest_1.expect)(proof).not.toBeNull();
+        (0, vitest_1.expect)((0, intuitionistic_nj_1.verifyProof)(proof)).toBe(true);
+    });
+});
+// --- No provable en NJ: contraejemplos clásicos ---
+(0, vitest_1.describe)('NJ — fórmulas no demostrables intuicionistamente (counter-model Kripke)', () => {
+    (0, vitest_1.it)('NO demuestra ¬¬P → P (DNE clásica)', () => {
+        const proof = (0, intuitionistic_nj_1.proveIntuitionistically)([], (0, intuitionistic_nj_1.implies)((0, intuitionistic_nj_1.not)((0, intuitionistic_nj_1.not)(P)), P));
+        (0, vitest_1.expect)(proof).toBeNull();
+        const cm = (0, intuitionistic_nj_1.kripkeCounterModel)((0, intuitionistic_nj_1.implies)((0, intuitionistic_nj_1.not)((0, intuitionistic_nj_1.not)(P)), P));
+        (0, vitest_1.expect)(cm).not.toBeNull();
+        (0, vitest_1.expect)(cm.worlds.length).toBeGreaterThanOrEqual(2);
+    });
+    (0, vitest_1.it)('NO demuestra P ∨ ¬P (LEM)', () => {
+        const proof = (0, intuitionistic_nj_1.proveIntuitionistically)([], (0, intuitionistic_nj_1.or)(P, (0, intuitionistic_nj_1.not)(P)));
+        (0, vitest_1.expect)(proof).toBeNull();
+        const cm = (0, intuitionistic_nj_1.kripkeCounterModel)((0, intuitionistic_nj_1.or)(P, (0, intuitionistic_nj_1.not)(P)));
+        (0, vitest_1.expect)(cm).not.toBeNull();
+        // El counter-model típico: w0 no fuerza P pero algún w0 ≤ v fuerza P.
+        (0, vitest_1.expect)(cm.worlds.length).toBeGreaterThanOrEqual(2);
+    });
+    (0, vitest_1.it)('NO demuestra ((P → Q) → P) → P (ley de Peirce)', () => {
+        const proof = (0, intuitionistic_nj_1.proveIntuitionistically)([], (0, intuitionistic_nj_1.implies)((0, intuitionistic_nj_1.implies)((0, intuitionistic_nj_1.implies)(P, Q), P), P));
+        (0, vitest_1.expect)(proof).toBeNull();
+        const cm = (0, intuitionistic_nj_1.kripkeCounterModel)((0, intuitionistic_nj_1.implies)((0, intuitionistic_nj_1.implies)((0, intuitionistic_nj_1.implies)(P, Q), P), P));
+        (0, vitest_1.expect)(cm).not.toBeNull();
+    });
+    (0, vitest_1.it)('NO demuestra ¬(P ∧ Q) → (¬P ∨ ¬Q) (De Morgan unilateral)', () => {
+        const proof = (0, intuitionistic_nj_1.proveIntuitionistically)([], (0, intuitionistic_nj_1.implies)((0, intuitionistic_nj_1.not)((0, intuitionistic_nj_1.and)(P, Q)), (0, intuitionistic_nj_1.or)((0, intuitionistic_nj_1.not)(P), (0, intuitionistic_nj_1.not)(Q))));
+        (0, vitest_1.expect)(proof).toBeNull();
+        const cm = (0, intuitionistic_nj_1.kripkeCounterModel)((0, intuitionistic_nj_1.implies)((0, intuitionistic_nj_1.not)((0, intuitionistic_nj_1.and)(P, Q)), (0, intuitionistic_nj_1.or)((0, intuitionistic_nj_1.not)(P), (0, intuitionistic_nj_1.not)(Q))));
+        (0, vitest_1.expect)(cm).not.toBeNull();
+    });
+    (0, vitest_1.it)('SÍ demuestra (¬P ∨ ¬Q) → ¬(P ∧ Q) (De Morgan trivial)', () => {
+        // El otro sentido de De Morgan SÍ es intuicionista — sanity check.
+        const proof = (0, intuitionistic_nj_1.proveIntuitionistically)([], (0, intuitionistic_nj_1.implies)((0, intuitionistic_nj_1.or)((0, intuitionistic_nj_1.not)(P), (0, intuitionistic_nj_1.not)(Q)), (0, intuitionistic_nj_1.not)((0, intuitionistic_nj_1.and)(P, Q))));
+        (0, vitest_1.expect)(proof).not.toBeNull();
+        (0, vitest_1.expect)((0, intuitionistic_nj_1.verifyProof)(proof)).toBe(true);
+    });
+});
+// --- Cross-check prover vs Kripke ---
+(0, vitest_1.describe)('NJ — coherencia entre prover y semántica Kripke', () => {
+    (0, vitest_1.it)('toda fórmula demostrada NJ es válida en Kripke', () => {
+        const provables = [
+            (0, intuitionistic_nj_1.implies)(P, P),
+            (0, intuitionistic_nj_1.implies)((0, intuitionistic_nj_1.and)(P, Q), P),
+            (0, intuitionistic_nj_1.implies)(P, (0, intuitionistic_nj_1.implies)(Q, P)),
+            (0, intuitionistic_nj_1.not)((0, intuitionistic_nj_1.and)(P, (0, intuitionistic_nj_1.not)(P))),
+            (0, intuitionistic_nj_1.implies)(P, (0, intuitionistic_nj_1.not)((0, intuitionistic_nj_1.not)(P))),
+            (0, intuitionistic_nj_1.implies)((0, intuitionistic_nj_1.and)((0, intuitionistic_nj_1.implies)(P, Q), P), Q),
+        ];
+        for (const f of provables) {
+            (0, vitest_1.expect)((0, intuitionistic_nj_1.proveIntuitionistically)([], f), `prover should prove`).not.toBeNull();
+            (0, vitest_1.expect)((0, intuitionistic_nj_1.isIPCValid)(f), `kripke should validate`).toBe(true);
+        }
+    });
+    (0, vitest_1.it)('toda fórmula con counter-model NO es demostrable NJ', () => {
+        const refutables = [
+            (0, intuitionistic_nj_1.implies)((0, intuitionistic_nj_1.not)((0, intuitionistic_nj_1.not)(P)), P), // DNE
+            (0, intuitionistic_nj_1.or)(P, (0, intuitionistic_nj_1.not)(P)), // LEM
+            (0, intuitionistic_nj_1.implies)((0, intuitionistic_nj_1.implies)((0, intuitionistic_nj_1.implies)(P, Q), P), P), // Peirce
+        ];
+        for (const f of refutables) {
+            (0, vitest_1.expect)((0, intuitionistic_nj_1.kripkeCounterModel)(f), `counter-model exists`).not.toBeNull();
+            (0, vitest_1.expect)((0, intuitionistic_nj_1.proveIntuitionistically)([], f), `prover should fail`).toBeNull();
+        }
+    });
+    (0, vitest_1.it)('counter-model LEM: w0 ⊮ P ∨ ¬P (estructura del modelo de Kripke)', () => {
+        const cm = (0, intuitionistic_nj_1.kripkeCounterModel)((0, intuitionistic_nj_1.or)(P, (0, intuitionistic_nj_1.not)(P)));
+        (0, vitest_1.expect)(cm).not.toBeNull();
+        // El modelo mínimo tiene dos mundos: w0 (sin P) y un w0 ≤ v (con P).
+        // En w0, ¬P falla porque hay un futuro v con P; P falla porque w0 no lo fuerza.
+        (0, vitest_1.expect)(cm.worlds).toContain('w0');
+        const allAtoms = new Set();
+        for (const set of cm.forcing.values())
+            for (const a of set)
+                allAtoms.add(a);
+        (0, vitest_1.expect)(allAtoms.has('P')).toBe(true);
+        (0, vitest_1.expect)(cm.forcing.get('w0')?.has('P') ?? false).toBe(false);
+    });
+});
+// --- Estructura del árbol NJ ---
+(0, vitest_1.describe)('NJ — propiedades estructurales del árbol', () => {
+    (0, vitest_1.it)('verifyProof rechaza un árbol mal formado', () => {
+        const bad = {
+            conclusion: P,
+            rule: 'assumption',
+            premises: [],
+        };
+        // P no está en el contexto vacío.
+        (0, vitest_1.expect)((0, intuitionistic_nj_1.verifyProof)(bad, [])).toBe(false);
+    });
+    (0, vitest_1.it)('impI descarga el antecedente del contexto', () => {
+        const proof = (0, intuitionistic_nj_1.proveIntuitionistically)([], (0, intuitionistic_nj_1.implies)(P, P));
+        (0, vitest_1.expect)(proof).not.toBeNull();
+        (0, vitest_1.expect)(proof.rule).toBe('impI');
+        (0, vitest_1.expect)(proof.discharged?.length).toBe(1);
+        (0, vitest_1.expect)(proof.discharged[0].kind).toBe('atom');
+    });
+    (0, vitest_1.it)('notI deriva ⊥ desde la asunción descargada', () => {
+        const proof = (0, intuitionistic_nj_1.proveIntuitionistically)([], (0, intuitionistic_nj_1.not)((0, intuitionistic_nj_1.and)(P, (0, intuitionistic_nj_1.not)(P))));
+        (0, vitest_1.expect)(proof).not.toBeNull();
+        (0, vitest_1.expect)((0, intuitionistic_nj_1.verifyProof)(proof)).toBe(true);
+        // La raíz es notI con discharge sobre P ∧ ¬P
+        (0, vitest_1.expect)(proof.rule).toBe('notI');
+        (0, vitest_1.expect)(proof.discharged?.length).toBe(1);
+    });
+    (0, vitest_1.it)('cada premisa de andI prueba la respectiva conjunción', () => {
+        const proof = (0, intuitionistic_nj_1.proveIntuitionistically)([P, Q], (0, intuitionistic_nj_1.and)(P, Q));
+        (0, vitest_1.expect)(proof).not.toBeNull();
+        (0, vitest_1.expect)(proof.rule).toBe('andI');
+        (0, vitest_1.expect)(proof.premises.length).toBe(2);
+        (0, vitest_1.expect)(proof.premises[0].conclusion.kind).toBe('atom');
+        (0, vitest_1.expect)(proof.premises[1].conclusion.kind).toBe('atom');
+    });
+});
+//# sourceMappingURL=nj.test.js.map

package/dist/tests/intuitionistic-nj/nj.test.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"nj.test.js","sourceRoot":"","sources":["../../../src/tests/intuitionistic-nj/nj.test.ts"],"names":[],"mappings":";;AAAA,mCAA8C;AAC9C,wEAa0C;AAE1C,kBAAkB;AAElB,MAAM,CAAC,GAAG,IAAA,wBAAI,EAAC,GAAG,CAAC,CAAC;AACpB,MAAM,CAAC,GAAG,IAAA,wBAAI,EAAC,GAAG,CAAC,CAAC;AACpB,MAAM,CAAC,GAAG,IAAA,wBAAI,EAAC,GAAG,CAAC,CAAC;AAEpB,SAAS,KAAK,CAAC,IAAoB;IACjC,MAAM,GAAG,GAAG,IAAI,GAAG,EAAa,CAAC;IACjC,MAAM,IAAI,GAAG,CAAC,CAAU,EAAE,EAAE;QAC1B,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QAChB,CAAC,CAAC,QAAQ,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;IAC3B,CAAC,CAAC;IACF,IAAI,IAAI;QAAE,IAAI,CAAC,IAAI,CAAC,CAAC;IACrB,OAAO,GAAG,CAAC;AACb,CAAC;AAED,yBAAyB;AAEzB,IAAA,iBAAQ,EAAC,+CAA+C,EAAE,GAAG,EAAE;IAC7D,IAAA,WAAE,EAAC,6BAA6B,EAAE,GAAG,EAAE;QACrC,MAAM,KAAK,GAAG,IAAA,2CAAuB,EAAC,EAAE,EAAE,IAAA,2BAAO,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QACzD,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;QAC7B,IAAA,eAAM,EAAC,IAAA,+BAAW,EAAC,KAAM,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACvC,IAAA,eAAM,EAAC,KAAK,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC5C,IAAA,eAAM,EAAC,KAAK,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACpD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,8CAA8C,EAAE,GAAG,EAAE;QACtD,MAAM,KAAK,GAAG,IAAA,2CAAuB,EAAC,EAAE,EAAE,IAAA,2BAAO,EAAC,IAAA,uBAAG,EAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QACjE,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;QAC7B,IAAA,eAAM,EAAC,IAAA,+BAAW,EAAC,KAAM,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACzC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,4CAA4C,EAAE,GAAG,EAAE;QACpD,MAAM,KAAK,GAAG,IAAA,2CAAuB,EAAC,EAAE,EAAE,IAAA,2BAAO,EAAC,IAAA,uBAAG,EAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QACjE,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;QAC7B,IAAA,eAAM,EAAC,IAAA,+BAAW,EAAC,KAAM,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACzC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,qCAAqC,EAAE,GAAG,EAAE;QAC7C,MAAM,KAAK,GAAG,IAAA,2CAAuB,EAAC,EAAE,EAAE,IAAA,2BAAO,EAAC,CAAC,EAAE,IAAA,2BAAO,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QACrE,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;QAC7B,IAAA,eAAM,EAAC,IAAA,+BAAW,EAAC,KAAM,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACzC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,kDAAkD,EAAE,GAAG,EAAE;QAC1D,MAAM,KAAK,GAAG,IAAA,2CAAuB,EAAC,EAAE,EAAE,IAAA,2BAAO,EAAC,IAAA,uBAAG,EAAC,IAAA,2BAAO,EAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAC7E,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;QAC7B,IAAA,eAAM,EAAC,IAAA,+BAAW,EAAC,KAAM,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACvC,IAAA,eAAM,EAAC,KAAK,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC9C,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,wCAAwC,EAAE,GAAG,EAAE;QAChD,MAAM,KAAK,GAAG,IAAA,2CAAuB,EAAC,EAAE,EAAE,IAAA,uBAAG,EAAC,IAAA,uBAAG,EAAC,CAAC,EAAE,IAAA,uBAAG,EAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC/D,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;QAC7B,IAAA,eAAM,EAAC,IAAA,+BAAW,EAAC,KAAM,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACvC,IAAA,eAAM,EAAC,KAAK,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC9C,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,oDAAoD,EAAE,GAAG,EAAE;QAC5D,MAAM,KAAK,GAAG,IAAA,2CAAuB,EAAC,EAAE,EAAE,IAAA,2BAAO,EAAC,CAAC,EAAE,IAAA,uBAAG,EAAC,IAAA,uBAAG,EAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACnE,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;QAC7B,IAAA,eAAM,EAAC,IAAA,+BAAW,EAAC,KAAM,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACzC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,iDAAiD,EAAE,GAAG,EAAE;QACzD,MAAM,KAAK,GAAG,IAAA,2CAAuB,EAAC,EAAE,EAAE,IAAA,2BAAO,EAAC,IAAA,uBAAG,EAAC,CAAC,CAAC,EAAE,IAAA,2BAAO,EAAC,CAAC,EAAE,IAAA,0BAAM,GAAE,CAAC,CAAC,CAAC,CAAC;QACjF,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;QAC7B,IAAA,eAAM,EAAC,IAAA,+BAAW,EAAC,KAAM,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACzC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,gDAAgD,EAAE,GAAG,EAAE;QACxD,MAAM,KAAK,GAAG,IAAA,2CAAuB,EAAC,EAAE,EAAE,IAAA,2BAAO,EAAC,IAAA,2BAAO,EAAC,CAAC,EAAE,CAAC,CAAC,EAAE,IAAA,2BAAO,EAAC,IAAA,uBAAG,EAAC,CAAC,CAAC,EAAE,IAAA,uBAAG,EAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC3F,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;QAC7B,IAAA,eAAM,EAAC,IAAA,+BAAW,EAAC,KAAM,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACzC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,qDAAqD,EAAE,GAAG,EAAE;QAC7D,MAAM,KAAK,GAAG,IAAA,2CAAuB,EAAC,EAAE,EAAE,IAAA,2BAAO,EAAC,IAAA,uBAAG,EAAC,CAAC,EAAE,IAAA,uBAAG,EAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QACtE,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;QAC7B,IAAA,eAAM,EAAC,IAAA,+BAAW,EAAC,KAAM,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACzC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,wDAAwD,EAAE,GAAG,EAAE;QAChE,MAAM,KAAK,GAAG,IAAA,2CAAuB,EAAC,CAAC,IAAA,0BAAM,GAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QACrD,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;QAC7B,IAAA,eAAM,EAAC,IAAA,+BAAW,EAAC,KAAM,EAAE,CAAC,IAAA,0BAAM,GAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACnD,IAAA,eAAM,EAAC,KAAK,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACjD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,mDAAmD,EAAE,GAAG,EAAE;QAC3D,MAAM,KAAK,GAAG,IAAA,2CAAuB,EAAC,EAAE,EAAE,IAAA,2BAAO,EAAC,IAAA,sBAAE,EAAC,CAAC,EAAE,CAAC,CAAC,EAAE,IAAA,sBAAE,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QACvE,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;QAC7B,IAAA,eAAM,EAAC,IAAA,+BAAW,EAAC,KAAM,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACvC,IAAA,eAAM,EAAC,KAAK,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC7C,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,2DAA2D,EAAE,GAAG,EAAE;QACnE,MAAM,KAAK,GAAG,IAAA,2CAAuB,EAAC,CAAC,CAAC,CAAC,EAAE,IAAA,sBAAE,EAAC,CAAC,EAAE,IAAA,uBAAG,EAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC1D,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;QAC7B,IAAA,eAAM,EAAC,IAAA,+BAAW,EAAC,KAAM,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC9C,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,sCAAsC,EAAE,GAAG,EAAE;QAC9C,MAAM,KAAK,GAAG,IAAA,2CAAuB,EAAC,CAAC,CAAC,EAAE,IAAA,2BAAO,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAC7D,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;QAC7B,IAAA,eAAM,EAAC,IAAA,+BAAW,EAAC,KAAM,EAAE,CAAC,CAAC,EAAE,IAAA,2BAAO,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC3D,IAAA,eAAM,EAAC,KAAK,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC9C,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,uDAAuD,EAAE,GAAG,EAAE;QAC/D,MAAM,KAAK,GAAG,IAAA,2CAAuB,EACnC,EAAE,EACF,IAAA,2BAAO,EAAC,IAAA,2BAAO,EAAC,CAAC,EAAE,CAAC,CAAC,EAAE,IAAA,2BAAO,EAAC,IAAA,2BAAO,EAAC,CAAC,EAAE,CAAC,CAAC,EAAE,IAAA,2BAAO,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAC9D,CAAC;QACF,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;QAC7B,IAAA,eAAM,EAAC,IAAA,+BAAW,EAAC,KAAM,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACzC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,qDAAqD;AAErD,IAAA,iBAAQ,EAAC,yEAAyE,EAAE,GAAG,EAAE;IACvF,IAAA,WAAE,EAAC,oCAAoC,EAAE,GAAG,EAAE;QAC5C,MAAM,KAAK,GAAG,IAAA,2CAAuB,EAAC,EAAE,EAAE,IAAA,2BAAO,EAAC,IAAA,uBAAG,EAAC,IAAA,uBAAG,EAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QACnE,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,QAAQ,EAAE,CAAC;QACzB,MAAM,EAAE,GAAG,IAAA,sCAAkB,EAAC,IAAA,2BAAO,EAAC,IAAA,uBAAG,EAAC,IAAA,uBAAG,EAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QACvD,IAAA,eAAM,EAAC,EAAE,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;QAC1B,IAAA,eAAM,EAAC,EAAG,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,sBAAsB,CAAC,CAAC,CAAC,CAAC;IACtD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,2BAA2B,EAAE,GAAG,EAAE;QACnC,MAAM,KAAK,GAAG,IAAA,2CAAuB,EAAC,EAAE,EAAE,IAAA,sBAAE,EAAC,CAAC,EAAE,IAAA,uBAAG,EAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACzD,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,QAAQ,EAAE,CAAC;QACzB,MAAM,EAAE,GAAG,IAAA,sCAAkB,EAAC,IAAA,sBAAE,EAAC,CAAC,EAAE,IAAA,uBAAG,EAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC7C,IAAA,eAAM,EAAC,EAAE,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;QAC1B,sEAAsE;QACtE,IAAA,eAAM,EAAC,EAAG,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,sBAAsB,CAAC,CAAC,CAAC,CAAC;IACtD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,gDAAgD,EAAE,GAAG,EAAE;QACxD,MAAM,KAAK,GAAG,IAAA,2CAAuB,EAAC,EAAE,EAAE,IAAA,2BAAO,EAAC,IAAA,2BAAO,EAAC,IAAA,2BAAO,EAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QACjF,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,QAAQ,EAAE,CAAC;QACzB,MAAM,EAAE,GAAG,IAAA,sCAAkB,EAAC,IAAA,2BAAO,EAAC,IAAA,2BAAO,EAAC,IAAA,2BAAO,EAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QACrE,IAAA,eAAM,EAAC,EAAE,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;IAC5B,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,0DAA0D,EAAE,GAAG,EAAE;QAClE,MAAM,KAAK,GAAG,IAAA,2CAAuB,EAAC,EAAE,EAAE,IAAA,2BAAO,EAAC,IAAA,uBAAG,EAAC,IAAA,uBAAG,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,IAAA,sBAAE,EAAC,IAAA,uBAAG,EAAC,CAAC,CAAC,EAAE,IAAA,uBAAG,EAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACvF,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,QAAQ,EAAE,CAAC;QACzB,MAAM,EAAE,GAAG,IAAA,sCAAkB,EAAC,IAAA,2BAAO,EAAC,IAAA,uBAAG,EAAC,IAAA,uBAAG,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,IAAA,sBAAE,EAAC,IAAA,uBAAG,EAAC,CAAC,CAAC,EAAE,IAAA,uBAAG,EAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC3E,IAAA,eAAM,EAAC,EAAE,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;IAC5B,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,uDAAuD,EAAE,GAAG,EAAE;QAC/D,mEAAmE;QACnE,MAAM,KAAK,GAAG,IAAA,2CAAuB,EAAC,EAAE,EAAE,IAAA,2BAAO,EAAC,IAAA,sBAAE,EAAC,IAAA,uBAAG,EAAC,CAAC,CAAC,EAAE,IAAA,uBAAG,EAAC,CAAC,CAAC,CAAC,EAAE,IAAA,uBAAG,EAAC,IAAA,uBAAG,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACvF,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;QAC7B,IAAA,eAAM,EAAC,IAAA,+BAAW,EAAC,KAAM,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACzC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,uCAAuC;AAEvC,IAAA,iBAAQ,EAAC,iDAAiD,EAAE,GAAG,EAAE;IAC/D,IAAA,WAAE,EAAC,gDAAgD,EAAE,GAAG,EAAE;QACxD,MAAM,SAAS,GAAG;YAChB,IAAA,2BAAO,EAAC,CAAC,EAAE,CAAC,CAAC;YACb,IAAA,2BAAO,EAAC,IAAA,uBAAG,EAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC;YACrB,IAAA,2BAAO,EAAC,CAAC,EAAE,IAAA,2BAAO,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YACzB,IAAA,uBAAG,EAAC,IAAA,uBAAG,EAAC,CAAC,EAAE,IAAA,uBAAG,EAAC,CAAC,CAAC,CAAC,CAAC;YACnB,IAAA,2BAAO,EAAC,CAAC,EAAE,IAAA,uBAAG,EAAC,IAAA,uBAAG,EAAC,CAAC,CAAC,CAAC,CAAC;YACvB,IAAA,2BAAO,EAAC,IAAA,uBAAG,EAAC,IAAA,2BAAO,EAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC;SAClC,CAAC;QACF,KAAK,MAAM,CAAC,IAAI,SAAS,EAAE,CAAC;YAC1B,IAAA,eAAM,EAAC,IAAA,2CAAuB,EAAC,EAAE,EAAE,CAAC,CAAC,EAAE,qBAAqB,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;YAC7E,IAAA,eAAM,EAAC,IAAA,8BAAU,EAAC,CAAC,CAAC,EAAE,wBAAwB,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC7D,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,qDAAqD,EAAE,GAAG,EAAE;QAC7D,MAAM,UAAU,GAAG;YACjB,IAAA,2BAAO,EAAC,IAAA,uBAAG,EAAC,IAAA,uBAAG,EAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,MAAM;YAC/B,IAAA,sBAAE,EAAC,CAAC,EAAE,IAAA,uBAAG,EAAC,CAAC,CAAC,CAAC,EAAE,MAAM;YACrB,IAAA,2BAAO,EAAC,IAAA,2BAAO,EAAC,IAAA,2BAAO,EAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,SAAS;SACjD,CAAC;QACF,KAAK,MAAM,CAAC,IAAI,UAAU,EAAE,CAAC;YAC3B,IAAA,eAAM,EAAC,IAAA,sCAAkB,EAAC,CAAC,CAAC,EAAE,sBAAsB,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;YACrE,IAAA,eAAM,EAAC,IAAA,2CAAuB,EAAC,EAAE,EAAE,CAAC,CAAC,EAAE,oBAAoB,CAAC,CAAC,QAAQ,EAAE,CAAC;QAC1E,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,kEAAkE,EAAE,GAAG,EAAE;QAC1E,MAAM,EAAE,GAAG,IAAA,sCAAkB,EAAC,IAAA,sBAAE,EAAC,CAAC,EAAE,IAAA,uBAAG,EAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC7C,IAAA,eAAM,EAAC,EAAE,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;QAC1B,qEAAqE;QACrE,gFAAgF;QAChF,IAAA,eAAM,EAAC,EAAG,CAAC,MAAM,CAAC,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;QACnC,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAU,CAAC;QACnC,KAAK,MAAM,GAAG,IAAI,EAAG,CAAC,OAAO,CAAC,MAAM,EAAE;YAAE,KAAK,MAAM,CAAC,IAAI,GAAG;gBAAE,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAC7E,IAAA,eAAM,EAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACrC,IAAA,eAAM,EAAC,EAAG,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,GAAG,CAAC,GAAG,CAAC,IAAI,KAAK,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC/D,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,kCAAkC;AAElC,IAAA,iBAAQ,EAAC,0CAA0C,EAAE,GAAG,EAAE;IACxD,IAAA,WAAE,EAAC,0CAA0C,EAAE,GAAG,EAAE;QAClD,MAAM,GAAG,GAAY;YACnB,UAAU,EAAE,CAAC;YACb,IAAI,EAAE,YAAY;YAClB,QAAQ,EAAE,EAAE;SACb,CAAC;QACF,kCAAkC;QAClC,IAAA,eAAM,EAAC,IAAA,+BAAW,EAAC,GAAG,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC3C,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,2CAA2C,EAAE,GAAG,EAAE;QACnD,MAAM,KAAK,GAAG,IAAA,2CAAuB,EAAC,EAAE,EAAE,IAAA,2BAAO,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QACzD,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;QAC7B,IAAA,eAAM,EAAC,KAAM,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACjC,IAAA,eAAM,EAAC,KAAM,CAAC,UAAU,EAAE,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC1C,IAAA,eAAM,EAAC,KAAM,CAAC,UAAW,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IAClD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,4CAA4C,EAAE,GAAG,EAAE;QACpD,MAAM,KAAK,GAAG,IAAA,2CAAuB,EAAC,EAAE,EAAE,IAAA,uBAAG,EAAC,IAAA,uBAAG,EAAC,CAAC,EAAE,IAAA,uBAAG,EAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC/D,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;QAC7B,IAAA,eAAM,EAAC,IAAA,+BAAW,EAAC,KAAM,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACvC,6CAA6C;QAC7C,IAAA,eAAM,EAAC,KAAM,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACjC,IAAA,eAAM,EAAC,KAAM,CAAC,UAAU,EAAE,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC5C,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,sDAAsD,EAAE,GAAG,EAAE;QAC9D,MAAM,KAAK,GAAG,IAAA,2CAAuB,EAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,IAAA,uBAAG,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QACzD,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;QAC7B,IAAA,eAAM,EAAC,KAAM,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACjC,IAAA,eAAM,EAAC,KAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACvC,IAAA,eAAM,EAAC,KAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACxD,IAAA,eAAM,EAAC,KAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IAC1D,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}

package/dist/tests/lambda-calc/lambda-calc.test.d.ts

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

package/dist/tests/lambda-calc/lambda-calc.test.d.ts.map

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

package/dist/tests/lambda-calc/lambda-calc.test.js

@@ -0,0 +1,164 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+const vitest_1 = require("vitest");
+const lambda_calc_1 = require("../../lambda-calc");
+(0, vitest_1.describe)('lambda-calc / sustitución y α', () => {
+    (0, vitest_1.it)('freeVars enumera variables libres respetando binders', () => {
+        // λx. x y   → libres = {y}
+        const t = (0, lambda_calc_1.lam)('x', (0, lambda_calc_1.ap)((0, lambda_calc_1.v)('x'), (0, lambda_calc_1.v)('y')));
+        (0, vitest_1.expect)(Array.from((0, lambda_calc_1.freeVars)(t))).toEqual(['y']);
+    });
+    (0, vitest_1.it)('substitute capture-avoiding: (λy. x)[x := y] → λy#0. y', () => {
+        // El binder `y` choca con la `y` libre del valor sustituido; se debe renombrar.
+        const t = (0, lambda_calc_1.lam)('y', (0, lambda_calc_1.v)('x'));
+        const r = (0, lambda_calc_1.substitute)(t, 'x', (0, lambda_calc_1.v)('y'));
+        (0, vitest_1.expect)(r.kind).toBe('abs');
+        if (r.kind === 'abs') {
+            (0, vitest_1.expect)(r.param).not.toBe('y');
+            // El cuerpo es exactamente la `y` libre original.
+            (0, vitest_1.expect)(r.body).toEqual((0, lambda_calc_1.v)('y'));
+        }
+    });
+    (0, vitest_1.it)('betaStep: (λx.x) y → y', () => {
+        const t = (0, lambda_calc_1.ap)(lambda_calc_1.I, (0, lambda_calc_1.v)('y'));
+        const r = (0, lambda_calc_1.betaStep)(t);
+        (0, vitest_1.expect)(r).toEqual((0, lambda_calc_1.v)('y'));
+    });
+    (0, vitest_1.it)('betaStep capture avoidance: (λx.λy.x) y → λz.y (z fresh)', () => {
+        // (λx.λy.x) y debe renombrar el binder interno para no capturar.
+        const t = (0, lambda_calc_1.ap)((0, lambda_calc_1.lam)('x', (0, lambda_calc_1.lam)('y', (0, lambda_calc_1.v)('x'))), (0, lambda_calc_1.v)('y'));
+        const r = (0, lambda_calc_1.betaStep)(t);
+        (0, vitest_1.expect)(r).not.toBeNull();
+        if (r === null)
+            return;
+        (0, vitest_1.expect)(r.kind).toBe('abs');
+        if (r.kind === 'abs') {
+            // El binder fue renombrado → ya no se llama 'y'.
+            (0, vitest_1.expect)(r.param).not.toBe('y');
+            // Y el cuerpo es la `y` libre, no la antigua ligada.
+            (0, vitest_1.expect)(r.body).toEqual((0, lambda_calc_1.v)('y'));
+        }
+        // α-equivalente a λz.y.
+        (0, vitest_1.expect)((0, lambda_calc_1.alphaEq)(r, (0, lambda_calc_1.lam)('z', (0, lambda_calc_1.v)('y')))).toBe(true);
+    });
+});
+(0, vitest_1.describe)('lambda-calc / β-reducción y estrategias', () => {
+    (0, vitest_1.it)('normalize(SKK) →* I (módulo α)', () => {
+        const term = (0, lambda_calc_1.apN)(lambda_calc_1.S, lambda_calc_1.K, lambda_calc_1.K);
+        const { result, terminated } = (0, lambda_calc_1.normalize)(term);
+        (0, vitest_1.expect)(terminated).toBe(true);
+        // SKK es la implementación clásica de I.
+        (0, vitest_1.expect)((0, lambda_calc_1.alphaEq)(result, lambda_calc_1.I)).toBe(true);
+    });
+    (0, vitest_1.it)('normalize(omega) no termina: maxSteps agotado y terminated=false', () => {
+        const { steps, terminated } = (0, lambda_calc_1.normalize)(lambda_calc_1.omega, { maxSteps: 100 });
+        (0, vitest_1.expect)(terminated).toBe(false);
+        (0, vitest_1.expect)(steps).toBe(100);
+    });
+    (0, vitest_1.it)('cbn termina en weak-head normal form, no entra bajo λ', () => {
+        // λz. (λx.x) z  — bajo cbn es ya WHNF (no reduce bajo lambda).
+        const t = (0, lambda_calc_1.lam)('z', (0, lambda_calc_1.ap)(lambda_calc_1.I, (0, lambda_calc_1.v)('z')));
+        const { result, terminated } = (0, lambda_calc_1.normalize)(t, { strategy: 'cbn', maxSteps: 50 });
+        (0, vitest_1.expect)(terminated).toBe(true);
+        (0, vitest_1.expect)((0, lambda_calc_1.isWeakHeadNormalForm)(result)).toBe(true);
+        // No se reduce: el redex interno queda intacto.
+        (0, vitest_1.expect)(result.kind).toBe('abs');
+        if (result.kind === 'abs') {
+            (0, vitest_1.expect)(result.body.kind).toBe('app');
+        }
+    });
+    (0, vitest_1.it)('cbv reduce argumentos antes de aplicar — (λx.y) ((λw.w) z) →* y', () => {
+        // El argumento se reduce primero pero al final el lambda lo descarta.
+        const t = (0, lambda_calc_1.ap)((0, lambda_calc_1.lam)('x', (0, lambda_calc_1.v)('y')), (0, lambda_calc_1.ap)(lambda_calc_1.I, (0, lambda_calc_1.v)('z')));
+        const { result, terminated } = (0, lambda_calc_1.normalize)(t, { strategy: 'cbv', maxSteps: 50 });
+        (0, vitest_1.expect)(terminated).toBe(true);
+        (0, vitest_1.expect)(result).toEqual((0, lambda_calc_1.v)('y'));
+    });
+    (0, vitest_1.it)('leftmost-innermost vs outermost: ambos preservan ((λx.x) y) → y en este caso', () => {
+        const t = (0, lambda_calc_1.ap)(lambda_calc_1.I, (0, lambda_calc_1.v)('y'));
+        (0, vitest_1.expect)((0, lambda_calc_1.betaStep)(t, 'leftmost-outermost')).toEqual((0, lambda_calc_1.v)('y'));
+        (0, vitest_1.expect)((0, lambda_calc_1.betaStep)(t, 'leftmost-innermost')).toEqual((0, lambda_calc_1.v)('y'));
+    });
+    (0, vitest_1.it)('isNormalForm distingue normal de redex', () => {
+        (0, vitest_1.expect)((0, lambda_calc_1.isNormalForm)((0, lambda_calc_1.v)('x'))).toBe(true);
+        (0, vitest_1.expect)((0, lambda_calc_1.isNormalForm)(lambda_calc_1.I)).toBe(true);
+        (0, vitest_1.expect)((0, lambda_calc_1.isNormalForm)((0, lambda_calc_1.ap)(lambda_calc_1.I, (0, lambda_calc_1.v)('y')))).toBe(false);
+    });
+    (0, vitest_1.it)('isWeakHeadNormalForm: λ y aplicación var-headed son WHNF; redex no', () => {
+        (0, vitest_1.expect)((0, lambda_calc_1.isWeakHeadNormalForm)(lambda_calc_1.I)).toBe(true);
+        (0, vitest_1.expect)((0, lambda_calc_1.isWeakHeadNormalForm)((0, lambda_calc_1.ap)((0, lambda_calc_1.v)('f'), (0, lambda_calc_1.v)('y')))).toBe(true);
+        (0, vitest_1.expect)((0, lambda_calc_1.isWeakHeadNormalForm)((0, lambda_calc_1.ap)(lambda_calc_1.I, (0, lambda_calc_1.v)('y')))).toBe(false);
+    });
+});
+(0, vitest_1.describe)('lambda-calc / η-reducción', () => {
+    (0, vitest_1.it)('etaStep: (λx. f x) → f cuando x ∉ FV(f)', () => {
+        const t = (0, lambda_calc_1.lam)('x', (0, lambda_calc_1.ap)((0, lambda_calc_1.v)('f'), (0, lambda_calc_1.v)('x')));
+        (0, vitest_1.expect)((0, lambda_calc_1.etaStep)(t)).toEqual((0, lambda_calc_1.v)('f'));
+    });
+    (0, vitest_1.it)('etaStep NO aplica cuando x ∈ FV(f): (λx. x x) se queda igual', () => {
+        const t = (0, lambda_calc_1.lam)('x', (0, lambda_calc_1.ap)((0, lambda_calc_1.v)('x'), (0, lambda_calc_1.v)('x')));
+        (0, vitest_1.expect)((0, lambda_calc_1.etaStep)(t)).toBeNull();
+    });
+});
+(0, vitest_1.describe)('lambda-calc / Church numerals', () => {
+    (0, vitest_1.it)('churchNumeral(0..3) son normalmente decodificables', () => {
+        for (let n = 0; n <= 3; n += 1) {
+            (0, vitest_1.expect)((0, lambda_calc_1.decodeChurch)((0, lambda_calc_1.churchNumeral)(n))).toBe(n);
+        }
+    });
+    (0, vitest_1.it)('SUCC: succ(2̄) →* 3̄', () => {
+        const term = (0, lambda_calc_1.ap)(lambda_calc_1.churchSucc, (0, lambda_calc_1.churchNumeral)(2));
+        (0, vitest_1.expect)((0, lambda_calc_1.evalChurch)(term)).toBe(3);
+    });
+    (0, vitest_1.it)('ADD: 2 + 3 →* 5', () => {
+        const term = (0, lambda_calc_1.apN)(lambda_calc_1.churchAdd, (0, lambda_calc_1.churchNumeral)(2), (0, lambda_calc_1.churchNumeral)(3));
+        (0, vitest_1.expect)((0, lambda_calc_1.evalChurch)(term)).toBe(5);
+    });
+    (0, vitest_1.it)('MUL: 3 * 4 →* 12', () => {
+        const term = (0, lambda_calc_1.apN)(lambda_calc_1.churchMul, (0, lambda_calc_1.churchNumeral)(3), (0, lambda_calc_1.churchNumeral)(4));
+        (0, vitest_1.expect)((0, lambda_calc_1.evalChurch)(term)).toBe(12);
+    });
+    (0, vitest_1.it)('decodeChurch devuelve null para términos que no son numerales', () => {
+        // y libre, no es Church numeral.
+        (0, vitest_1.expect)((0, lambda_calc_1.decodeChurch)((0, lambda_calc_1.v)('y'))).toBeNull();
+        // Función pero no tiene la forma λf.λx. f^n x.
+        (0, vitest_1.expect)((0, lambda_calc_1.decodeChurch)((0, lambda_calc_1.lam)('f', (0, lambda_calc_1.v)('x')))).toBeNull();
+    });
+});
+(0, vitest_1.describe)('lambda-calc / utilidades', () => {
+    (0, vitest_1.it)('alphaEq detecta equivalencia y rechaza diferencias estructurales', () => {
+        (0, vitest_1.expect)((0, lambda_calc_1.alphaEq)((0, lambda_calc_1.lam)('x', (0, lambda_calc_1.v)('x')), (0, lambda_calc_1.lam)('y', (0, lambda_calc_1.v)('y')))).toBe(true);
+        (0, vitest_1.expect)((0, lambda_calc_1.alphaEq)((0, lambda_calc_1.lam)('x', (0, lambda_calc_1.v)('x')), (0, lambda_calc_1.lam)('x', (0, lambda_calc_1.v)('y')))).toBe(false);
+        // Variables libres con nombres distintos NO son α-equivalentes.
+        (0, vitest_1.expect)((0, lambda_calc_1.alphaEq)((0, lambda_calc_1.v)('x'), (0, lambda_calc_1.v)('y'))).toBe(false);
+    });
+    (0, vitest_1.it)('alphaRename produce términos α-equivalentes al original', () => {
+        const t = (0, lambda_calc_1.lam)('x', (0, lambda_calc_1.lam)('y', (0, lambda_calc_1.ap)((0, lambda_calc_1.v)('x'), (0, lambda_calc_1.v)('y'))));
+        const supply = (0, lambda_calc_1.makeFreshSupply)();
+        const renamed = (0, lambda_calc_1.alphaRename)(t, supply);
+        (0, vitest_1.expect)((0, lambda_calc_1.alphaEq)(t, renamed)).toBe(true);
+        // Y los binders quedaron con los nombres frescos.
+        if (renamed.kind === 'abs') {
+            (0, vitest_1.expect)(renamed.param).toMatch(/^_x\d+$/);
+        }
+    });
+    (0, vitest_1.it)('termToString produce algo legible para combinadores', () => {
+        (0, vitest_1.expect)((0, lambda_calc_1.termToString)(lambda_calc_1.I)).toBe('(λx.x)');
+        (0, vitest_1.expect)((0, lambda_calc_1.termToString)((0, lambda_calc_1.ap)(lambda_calc_1.I, (0, lambda_calc_1.v)('y')))).toBe('((λx.x) y)');
+    });
+    (0, vitest_1.it)('Y-combinator es un punto fijo: Y f →* f (Y f)  (1 paso de unfolding bajo cbn)', () => {
+        // Bajo cbn, Y f hace UN paso β y revela la forma f ((λx.f(xx))(λx.f(xx))).
+        const term = (0, lambda_calc_1.ap)(lambda_calc_1.Y, (0, lambda_calc_1.v)('f'));
+        const next = (0, lambda_calc_1.betaStep)(term);
+        (0, vitest_1.expect)(next).not.toBeNull();
+        if (next === null)
+            return;
+        // El primer paso debe producir (λx. f (x x)) (λx. f (x x)).
+        (0, vitest_1.expect)(next.kind).toBe('app');
+        if (next.kind === 'app') {
+            // La cabeza es λx. f (x x).
+            (0, vitest_1.expect)(next.fn.kind).toBe('abs');
+        }
+    });
+});
+//# sourceMappingURL=lambda-calc.test.js.map

package/dist/tests/lambda-calc/lambda-calc.test.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"lambda-calc.test.js","sourceRoot":"","sources":["../../../src/tests/lambda-calc/lambda-calc.test.ts"],"names":[],"mappings":";;AAAA,mCAA8C;AAC9C,mDA4B2B;AAE3B,IAAA,iBAAQ,EAAC,+BAA+B,EAAE,GAAG,EAAE;IAC7C,IAAA,WAAE,EAAC,sDAAsD,EAAE,GAAG,EAAE;QAC9D,2BAA2B;QAC3B,MAAM,CAAC,GAAG,IAAA,iBAAG,EAAC,GAAG,EAAE,IAAA,gBAAE,EAAC,IAAA,eAAC,EAAC,GAAG,CAAC,EAAE,IAAA,eAAC,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACvC,IAAA,eAAM,EAAC,KAAK,CAAC,IAAI,CAAC,IAAA,sBAAQ,EAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IACjD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,wDAAwD,EAAE,GAAG,EAAE;QAChE,gFAAgF;QAChF,MAAM,CAAC,GAAG,IAAA,iBAAG,EAAC,GAAG,EAAE,IAAA,eAAC,EAAC,GAAG,CAAC,CAAC,CAAC;QAC3B,MAAM,CAAC,GAAG,IAAA,wBAAU,EAAC,CAAC,EAAE,GAAG,EAAE,IAAA,eAAC,EAAC,GAAG,CAAC,CAAC,CAAC;QACrC,IAAA,eAAM,EAAC,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC3B,IAAI,CAAC,CAAC,IAAI,KAAK,KAAK,EAAE,CAAC;YACrB,IAAA,eAAM,EAAC,CAAC,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YAC9B,kDAAkD;YAClD,IAAA,eAAM,EAAC,CAAC,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,IAAA,eAAC,EAAC,GAAG,CAAC,CAAC,CAAC;QACjC,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,wBAAwB,EAAE,GAAG,EAAE;QAChC,MAAM,CAAC,GAAG,IAAA,gBAAE,EAAC,eAAC,EAAE,IAAA,eAAC,EAAC,GAAG,CAAC,CAAC,CAAC;QACxB,MAAM,CAAC,GAAG,IAAA,sBAAQ,EAAC,CAAC,CAAC,CAAC;QACtB,IAAA,eAAM,EAAC,CAAC,CAAC,CAAC,OAAO,CAAC,IAAA,eAAC,EAAC,GAAG,CAAC,CAAC,CAAC;IAC5B,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,0DAA0D,EAAE,GAAG,EAAE;QAClE,iEAAiE;QACjE,MAAM,CAAC,GAAG,IAAA,gBAAE,EAAC,IAAA,iBAAG,EAAC,GAAG,EAAE,IAAA,iBAAG,EAAC,GAAG,EAAE,IAAA,eAAC,EAAC,GAAG,CAAC,CAAC,CAAC,EAAE,IAAA,eAAC,EAAC,GAAG,CAAC,CAAC,CAAC;QACjD,MAAM,CAAC,GAAG,IAAA,sBAAQ,EAAC,CAAC,CAAC,CAAC;QACtB,IAAA,eAAM,EAAC,CAAC,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;QACzB,IAAI,CAAC,KAAK,IAAI;YAAE,OAAO;QACvB,IAAA,eAAM,EAAC,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC3B,IAAI,CAAC,CAAC,IAAI,KAAK,KAAK,EAAE,CAAC;YACrB,iDAAiD;YACjD,IAAA,eAAM,EAAC,CAAC,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YAC9B,qDAAqD;YACrD,IAAA,eAAM,EAAC,CAAC,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,IAAA,eAAC,EAAC,GAAG,CAAC,CAAC,CAAC;QACjC,CAAC;QACD,wBAAwB;QACxB,IAAA,eAAM,EAAC,IAAA,qBAAO,EAAC,CAAC,EAAE,IAAA,iBAAG,EAAC,GAAG,EAAE,IAAA,eAAC,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAClD,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,yCAAyC,EAAE,GAAG,EAAE;IACvD,IAAA,WAAE,EAAC,gCAAgC,EAAE,GAAG,EAAE;QACxC,MAAM,IAAI,GAAG,IAAA,iBAAG,EAAC,eAAC,EAAE,eAAC,EAAE,eAAC,CAAC,CAAC;QAC1B,MAAM,EAAE,MAAM,EAAE,UAAU,EAAE,GAAG,IAAA,uBAAS,EAAC,IAAI,CAAC,CAAC;QAC/C,IAAA,eAAM,EAAC,UAAU,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC9B,yCAAyC;QACzC,IAAA,eAAM,EAAC,IAAA,qBAAO,EAAC,MAAM,EAAE,eAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACxC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,kEAAkE,EAAE,GAAG,EAAE;QAC1E,MAAM,EAAE,KAAK,EAAE,UAAU,EAAE,GAAG,IAAA,uBAAS,EAAC,mBAAK,EAAE,EAAE,QAAQ,EAAE,GAAG,EAAE,CAAC,CAAC;QAClE,IAAA,eAAM,EAAC,UAAU,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC/B,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IAC1B,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,uDAAuD,EAAE,GAAG,EAAE;QAC/D,+DAA+D;QAC/D,MAAM,CAAC,GAAG,IAAA,iBAAG,EAAC,GAAG,EAAE,IAAA,gBAAE,EAAC,eAAC,EAAE,IAAA,eAAC,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAClC,MAAM,EAAE,MAAM,EAAE,UAAU,EAAE,GAAG,IAAA,uBAAS,EAAC,CAAC,EAAE,EAAE,QAAQ,EAAE,KAAK,EAAE,QAAQ,EAAE,EAAE,EAAE,CAAC,CAAC;QAC/E,IAAA,eAAM,EAAC,UAAU,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC9B,IAAA,eAAM,EAAC,IAAA,kCAAoB,EAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAChD,gDAAgD;QAChD,IAAA,eAAM,EAAC,MAAM,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAChC,IAAI,MAAM,CAAC,IAAI,KAAK,KAAK,EAAE,CAAC;YAC1B,IAAA,eAAM,EAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACvC,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,iEAAiE,EAAE,GAAG,EAAE;QACzE,sEAAsE;QACtE,MAAM,CAAC,GAAG,IAAA,gBAAE,EAAC,IAAA,iBAAG,EAAC,GAAG,EAAE,IAAA,eAAC,EAAC,GAAG,CAAC,CAAC,EAAE,IAAA,gBAAE,EAAC,eAAC,EAAE,IAAA,eAAC,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAC9C,MAAM,EAAE,MAAM,EAAE,UAAU,EAAE,GAAG,IAAA,uBAAS,EAAC,CAAC,EAAE,EAAE,QAAQ,EAAE,KAAK,EAAE,QAAQ,EAAE,EAAE,EAAE,CAAC,CAAC;QAC/E,IAAA,eAAM,EAAC,UAAU,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC9B,IAAA,eAAM,EAAC,MAAM,CAAC,CAAC,OAAO,CAAC,IAAA,eAAC,EAAC,GAAG,CAAC,CAAC,CAAC;IACjC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,8EAA8E,EAAE,GAAG,EAAE;QACtF,MAAM,CAAC,GAAG,IAAA,gBAAE,EAAC,eAAC,EAAE,IAAA,eAAC,EAAC,GAAG,CAAC,CAAC,CAAC;QACxB,IAAA,eAAM,EAAC,IAAA,sBAAQ,EAAC,CAAC,EAAE,oBAAoB,CAAC,CAAC,CAAC,OAAO,CAAC,IAAA,eAAC,EAAC,GAAG,CAAC,CAAC,CAAC;QAC1D,IAAA,eAAM,EAAC,IAAA,sBAAQ,EAAC,CAAC,EAAE,oBAAoB,CAAC,CAAC,CAAC,OAAO,CAAC,IAAA,eAAC,EAAC,GAAG,CAAC,CAAC,CAAC;IAC5D,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,wCAAwC,EAAE,GAAG,EAAE;QAChD,IAAA,eAAM,EAAC,IAAA,0BAAY,EAAC,IAAA,eAAC,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACxC,IAAA,eAAM,EAAC,IAAA,0BAAY,EAAC,eAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACnC,IAAA,eAAM,EAAC,IAAA,0BAAY,EAAC,IAAA,gBAAE,EAAC,eAAC,EAAE,IAAA,eAAC,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAClD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,oEAAoE,EAAE,GAAG,EAAE;QAC5E,IAAA,eAAM,EAAC,IAAA,kCAAoB,EAAC,eAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC3C,IAAA,eAAM,EAAC,IAAA,kCAAoB,EAAC,IAAA,gBAAE,EAAC,IAAA,eAAC,EAAC,GAAG,CAAC,EAAE,IAAA,eAAC,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC5D,IAAA,eAAM,EAAC,IAAA,kCAAoB,EAAC,IAAA,gBAAE,EAAC,eAAC,EAAE,IAAA,eAAC,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC1D,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,2BAA2B,EAAE,GAAG,EAAE;IACzC,IAAA,WAAE,EAAC,yCAAyC,EAAE,GAAG,EAAE;QACjD,MAAM,CAAC,GAAG,IAAA,iBAAG,EAAC,GAAG,EAAE,IAAA,gBAAE,EAAC,IAAA,eAAC,EAAC,GAAG,CAAC,EAAE,IAAA,eAAC,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACvC,IAAA,eAAM,EAAC,IAAA,qBAAO,EAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,IAAA,eAAC,EAAC,GAAG,CAAC,CAAC,CAAC;IACrC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,8DAA8D,EAAE,GAAG,EAAE;QACtE,MAAM,CAAC,GAAG,IAAA,iBAAG,EAAC,GAAG,EAAE,IAAA,gBAAE,EAAC,IAAA,eAAC,EAAC,GAAG,CAAC,EAAE,IAAA,eAAC,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACvC,IAAA,eAAM,EAAC,IAAA,qBAAO,EAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC;IAChC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,+BAA+B,EAAE,GAAG,EAAE;IAC7C,IAAA,WAAE,EAAC,oDAAoD,EAAE,GAAG,EAAE;QAC5D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;YAC/B,IAAA,eAAM,EAAC,IAAA,0BAAY,EAAC,IAAA,2BAAa,EAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACjD,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,sBAAsB,EAAE,GAAG,EAAE;QAC9B,MAAM,IAAI,GAAG,IAAA,gBAAE,EAAC,wBAAU,EAAE,IAAA,2BAAa,EAAC,CAAC,CAAC,CAAC,CAAC;QAC9C,IAAA,eAAM,EAAC,IAAA,wBAAU,EAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACnC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,iBAAiB,EAAE,GAAG,EAAE;QACzB,MAAM,IAAI,GAAG,IAAA,iBAAG,EAAC,uBAAS,EAAE,IAAA,2BAAa,EAAC,CAAC,CAAC,EAAE,IAAA,2BAAa,EAAC,CAAC,CAAC,CAAC,CAAC;QAChE,IAAA,eAAM,EAAC,IAAA,wBAAU,EAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACnC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,kBAAkB,EAAE,GAAG,EAAE;QAC1B,MAAM,IAAI,GAAG,IAAA,iBAAG,EAAC,uBAAS,EAAE,IAAA,2BAAa,EAAC,CAAC,CAAC,EAAE,IAAA,2BAAa,EAAC,CAAC,CAAC,CAAC,CAAC;QAChE,IAAA,eAAM,EAAC,IAAA,wBAAU,EAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACpC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,+DAA+D,EAAE,GAAG,EAAE;QACvE,iCAAiC;QACjC,IAAA,eAAM,EAAC,IAAA,0BAAY,EAAC,IAAA,eAAC,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC;QACxC,+CAA+C;QAC/C,IAAA,eAAM,EAAC,IAAA,0BAAY,EAAC,IAAA,iBAAG,EAAC,GAAG,EAAE,IAAA,eAAC,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC;IACpD,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,0BAA0B,EAAE,GAAG,EAAE;IACxC,IAAA,WAAE,EAAC,kEAAkE,EAAE,GAAG,EAAE;QAC1E,IAAA,eAAM,EAAC,IAAA,qBAAO,EAAC,IAAA,iBAAG,EAAC,GAAG,EAAE,IAAA,eAAC,EAAC,GAAG,CAAC,CAAC,EAAE,IAAA,iBAAG,EAAC,GAAG,EAAE,IAAA,eAAC,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC/D,IAAA,eAAM,EAAC,IAAA,qBAAO,EAAC,IAAA,iBAAG,EAAC,GAAG,EAAE,IAAA,eAAC,EAAC,GAAG,CAAC,CAAC,EAAE,IAAA,iBAAG,EAAC,GAAG,EAAE,IAAA,eAAC,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAChE,gEAAgE;QAChE,IAAA,eAAM,EAAC,IAAA,qBAAO,EAAC,IAAA,eAAC,EAAC,GAAG,CAAC,EAAE,IAAA,eAAC,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC9C,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,yDAAyD,EAAE,GAAG,EAAE;QACjE,MAAM,CAAC,GAAG,IAAA,iBAAG,EAAC,GAAG,EAAE,IAAA,iBAAG,EAAC,GAAG,EAAE,IAAA,gBAAE,EAAC,IAAA,eAAC,EAAC,GAAG,CAAC,EAAE,IAAA,eAAC,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACjD,MAAM,MAAM,GAAG,IAAA,6BAAe,GAAE,CAAC;QACjC,MAAM,OAAO,GAAG,IAAA,yBAAW,EAAC,CAAC,EAAE,MAAM,CAAC,CAAC;QACvC,IAAA,eAAM,EAAC,IAAA,qBAAO,EAAC,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACvC,kDAAkD;QAClD,IAAI,OAAO,CAAC,IAAI,KAAK,KAAK,EAAE,CAAC;YAC3B,IAAA,eAAM,EAAC,OAAO,CAAC,KAAK,CAAC,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;QAC3C,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,qDAAqD,EAAE,GAAG,EAAE;QAC7D,IAAA,eAAM,EAAC,IAAA,0BAAY,EAAC,eAAC,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QACvC,IAAA,eAAM,EAAC,IAAA,0BAAY,EAAC,IAAA,gBAAE,EAAC,eAAC,EAAE,IAAA,eAAC,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;IACzD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,+EAA+E,EAAE,GAAG,EAAE;QACvF,2EAA2E;QAC3E,MAAM,IAAI,GAAG,IAAA,gBAAE,EAAC,eAAC,EAAE,IAAA,eAAC,EAAC,GAAG,CAAC,CAAC,CAAC;QAC3B,MAAM,IAAI,GAAG,IAAA,sBAAQ,EAAC,IAAI,CAAC,CAAC;QAC5B,IAAA,eAAM,EAAC,IAAI,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;QAC5B,IAAI,IAAI,KAAK,IAAI;YAAE,OAAO;QAC1B,4DAA4D;QAC5D,IAAA,eAAM,EAAC,IAAI,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC9B,IAAI,IAAI,CAAC,IAAI,KAAK,KAAK,EAAE,CAAC;YACxB,4BAA4B;YAC5B,IAAA,eAAM,EAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACnC,CAAC;IACH,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}

package/dist/tests/ltl-sat/sat.test.d.ts

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

package/dist/tests/ltl-sat/sat.test.d.ts.map

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

package/dist/tests/ltl-sat/sat.test.js

@@ -0,0 +1,160 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+const vitest_1 = require("vitest");
+const ltl_sat_1 = require("../../profiles/ltl-sat");
+const p = (0, ltl_sat_1.atom)('p');
+const q = (0, ltl_sat_1.atom)('q');
+const r = (0, ltl_sat_1.atom)('r');
+(0, vitest_1.describe)('LTL-SAT — fórmulas básicas', () => {
+    (0, vitest_1.it)('un átomo simple es satisfacible', () => {
+        const res = (0, ltl_sat_1.isSatisfiable)(p);
+        (0, vitest_1.expect)(res.sat).toBe(true);
+        (0, vitest_1.expect)(res.witness).toBeDefined();
+        (0, vitest_1.expect)(res.witness.loop.length).toBeGreaterThan(0);
+    });
+    (0, vitest_1.it)('p ∧ ¬p es insatisfacible', () => {
+        const res = (0, ltl_sat_1.isSatisfiable)((0, ltl_sat_1.and)(p, (0, ltl_sat_1.not)(p)));
+        (0, vitest_1.expect)(res.sat).toBe(false);
+    });
+    (0, vitest_1.it)('p ∨ ¬p es válido', () => {
+        (0, vitest_1.expect)((0, ltl_sat_1.isValid)((0, ltl_sat_1.or)(p, (0, ltl_sat_1.not)(p)))).toBe(true);
+    });
+});
+(0, vitest_1.describe)('LTL-SAT — operadores temporales', () => {
+    (0, vitest_1.it)('F p es satisfacible (eventualidad alcanzable)', () => {
+        const res = (0, ltl_sat_1.isSatisfiable)((0, ltl_sat_1.eventually)(p));
+        (0, vitest_1.expect)(res.sat).toBe(true);
+        // El witness debe contener p en algún estado (prefijo o lazo).
+        const allStates = [...(res.witness?.prefix ?? []), ...(res.witness?.loop ?? [])];
+        const hasP = allStates.some((s) => s.includes('p') && !s.includes('¬p'));
+        (0, vitest_1.expect)(hasP).toBe(true);
+    });
+    (0, vitest_1.it)('G p ∧ ¬p es insatisfacible', () => {
+        const res = (0, ltl_sat_1.isSatisfiable)((0, ltl_sat_1.and)((0, ltl_sat_1.globally)(p), (0, ltl_sat_1.not)(p)));
+        (0, vitest_1.expect)(res.sat).toBe(false);
+    });
+    (0, vitest_1.it)('G(p → X p) ∧ p ∧ F ¬p es insatisfacible (p se vuelve permanente)', () => {
+        const phi = (0, ltl_sat_1.and)((0, ltl_sat_1.globally)((0, ltl_sat_1.implies)(p, (0, ltl_sat_1.next)(p))), p, (0, ltl_sat_1.eventually)((0, ltl_sat_1.not)(p)));
+        (0, vitest_1.expect)((0, ltl_sat_1.isSatisfiable)(phi).sat).toBe(false);
+    });
+    (0, vitest_1.it)('p U q es satisfacible con witness donde q aparece eventualmente', () => {
+        const res = (0, ltl_sat_1.isSatisfiable)((0, ltl_sat_1.until)(p, q));
+        (0, vitest_1.expect)(res.sat).toBe(true);
+        const allStates = [...(res.witness?.prefix ?? []), ...(res.witness?.loop ?? [])];
+        const hasQ = allStates.some((s) => s.split(',').includes('q'));
+        (0, vitest_1.expect)(hasQ).toBe(true);
+    });
+    (0, vitest_1.it)('(p U q) ∧ G ¬q es insatisfacible', () => {
+        const phi = (0, ltl_sat_1.and)((0, ltl_sat_1.until)(p, q), (0, ltl_sat_1.globally)((0, ltl_sat_1.not)(q)));
+        (0, vitest_1.expect)((0, ltl_sat_1.isSatisfiable)(phi).sat).toBe(false);
+    });
+    (0, vitest_1.it)('G F p es satisfacible (fairness — p infinitamente a menudo)', () => {
+        const res = (0, ltl_sat_1.isSatisfiable)((0, ltl_sat_1.globally)((0, ltl_sat_1.eventually)(p)));
+        (0, vitest_1.expect)(res.sat).toBe(true);
+        // El lazo debe contener un estado con p positivo.
+        const loopHasP = (res.witness?.loop ?? []).some((s) => s.split(',').includes('p'));
+        (0, vitest_1.expect)(loopHasP).toBe(true);
+    });
+    (0, vitest_1.it)('F G p es satisfacible (eventualmente p se vuelve permanente)', () => {
+        const res = (0, ltl_sat_1.isSatisfiable)((0, ltl_sat_1.eventually)((0, ltl_sat_1.globally)(p)));
+        (0, vitest_1.expect)(res.sat).toBe(true);
+    });
+});
+(0, vitest_1.describe)('LTL-SAT — validez', () => {
+    (0, vitest_1.it)('G p → p es válido', () => {
+        (0, vitest_1.expect)((0, ltl_sat_1.isValid)((0, ltl_sat_1.implies)((0, ltl_sat_1.globally)(p), p))).toBe(true);
+    });
+    (0, vitest_1.it)('p → F p es válido', () => {
+        (0, vitest_1.expect)((0, ltl_sat_1.isValid)((0, ltl_sat_1.implies)(p, (0, ltl_sat_1.eventually)(p)))).toBe(true);
+    });
+    (0, vitest_1.it)('G p → G G p es válido', () => {
+        (0, vitest_1.expect)((0, ltl_sat_1.isValid)((0, ltl_sat_1.implies)((0, ltl_sat_1.globally)(p), (0, ltl_sat_1.globally)((0, ltl_sat_1.globally)(p))))).toBe(true);
+    });
+    (0, vitest_1.it)('p → X p NO es válido (en general el siguiente puede diferir)', () => {
+        (0, vitest_1.expect)((0, ltl_sat_1.isValid)((0, ltl_sat_1.implies)(p, (0, ltl_sat_1.next)(p)))).toBe(false);
+    });
+    (0, vitest_1.it)('F p ∨ G ¬p es válido (tertium)', () => {
+        (0, vitest_1.expect)((0, ltl_sat_1.isValid)((0, ltl_sat_1.or)((0, ltl_sat_1.eventually)(p), (0, ltl_sat_1.globally)((0, ltl_sat_1.not)(p))))).toBe(true);
+    });
+});
+(0, vitest_1.describe)('LTL-SAT — operadores derivados y release', () => {
+    (0, vitest_1.it)('p R q es satisfacible', () => {
+        const res = (0, ltl_sat_1.isSatisfiable)((0, ltl_sat_1.release)(p, q));
+        (0, vitest_1.expect)(res.sat).toBe(true);
+    });
+    (0, vitest_1.it)('false R p ≡ G p (false R φ siempre tiene φ permanente)', () => {
+        // Lo modelamos como atom that never holds: usamos ¬p ∧ p contradictorio
+        // en lugar de un "false" literal. En su lugar testeamos que
+        // p R q ∧ ¬q is unsat (porque φ R ψ exige ψ).
+        const phi = (0, ltl_sat_1.and)((0, ltl_sat_1.release)(p, q), (0, ltl_sat_1.not)(q));
+        (0, vitest_1.expect)((0, ltl_sat_1.isSatisfiable)(phi).sat).toBe(false);
+    });
+    (0, vitest_1.it)('p W q (weak until) es satisfacible', () => {
+        const res = (0, ltl_sat_1.isSatisfiable)((0, ltl_sat_1.weakUntil)(p, q));
+        (0, vitest_1.expect)(res.sat).toBe(true);
+    });
+    (0, vitest_1.it)('(p W q) ∧ G ¬p ∧ G ¬q es insatisfacible', () => {
+        // weak until: o φ U ψ (q llega) o G φ (p siempre). Negar ambas → unsat.
+        const phi = (0, ltl_sat_1.and)((0, ltl_sat_1.weakUntil)(p, q), (0, ltl_sat_1.globally)((0, ltl_sat_1.not)(p)), (0, ltl_sat_1.globally)((0, ltl_sat_1.not)(q)));
+        (0, vitest_1.expect)((0, ltl_sat_1.isSatisfiable)(phi).sat).toBe(false);
+    });
+});
+(0, vitest_1.describe)('LTL-SAT — utilidades estructurales', () => {
+    (0, vitest_1.it)('toNNF empuja negaciones hasta átomos', () => {
+        const phi = (0, ltl_sat_1.not)((0, ltl_sat_1.and)(p, q));
+        const nnf = (0, ltl_sat_1.toNNF)(phi);
+        (0, vitest_1.expect)(nnf.kind).toBe('or');
+        // No debe haber un `not` directamente sobre un `and`.
+        const s = (0, ltl_sat_1.formulaToString)(nnf);
+        (0, vitest_1.expect)(s).toContain('¬p');
+        (0, vitest_1.expect)(s).toContain('¬q');
+    });
+    (0, vitest_1.it)('toNNF maneja la dualidad de Until: ¬(p U q) ≡ ¬q R ¬p', () => {
+        const phi = (0, ltl_sat_1.not)((0, ltl_sat_1.until)(p, q));
+        const nnf = (0, ltl_sat_1.toNNF)(phi);
+        (0, vitest_1.expect)(nnf.kind).toBe('R');
+    });
+    (0, vitest_1.it)('closure es finita y contiene la fórmula original', () => {
+        const phi = (0, ltl_sat_1.until)(p, q);
+        const cl = (0, ltl_sat_1.closure)(phi);
+        (0, vitest_1.expect)(cl.length).toBeGreaterThan(0);
+        (0, vitest_1.expect)(cl.length).toBeLessThan(50);
+        // Debe contener X(p U q).
+        const hasXU = cl.some((f) => f.kind === 'X' && f.arg.kind === 'U');
+        (0, vitest_1.expect)(hasXU).toBe(true);
+    });
+    (0, vitest_1.it)('toBuchi devuelve estadísticas razonables', () => {
+        const stats = (0, ltl_sat_1.toBuchi)((0, ltl_sat_1.eventually)(p));
+        (0, vitest_1.expect)(stats.states).toBeGreaterThan(0);
+        (0, vitest_1.expect)(stats.accepting).toBeGreaterThanOrEqual(0);
+        (0, vitest_1.expect)(stats.accepting).toBeLessThanOrEqual(stats.states);
+    });
+});
+(0, vitest_1.describe)('LTL-SAT — combinaciones realistas', () => {
+    (0, vitest_1.it)('G(p → F q) es satisfacible (response pattern)', () => {
+        (0, vitest_1.expect)((0, ltl_sat_1.isSatisfiable)((0, ltl_sat_1.globally)((0, ltl_sat_1.implies)(p, (0, ltl_sat_1.eventually)(q)))).sat).toBe(true);
+    });
+    (0, vitest_1.it)('G(p → F q) ∧ G p ∧ G ¬q es insatisfacible', () => {
+        const phi = (0, ltl_sat_1.and)((0, ltl_sat_1.globally)((0, ltl_sat_1.implies)(p, (0, ltl_sat_1.eventually)(q))), (0, ltl_sat_1.globally)(p), (0, ltl_sat_1.globally)((0, ltl_sat_1.not)(q)));
+        (0, vitest_1.expect)((0, ltl_sat_1.isSatisfiable)(phi).sat).toBe(false);
+    });
+    (0, vitest_1.it)('X X p ∧ X X ¬p es insatisfacible', () => {
+        const phi = (0, ltl_sat_1.and)((0, ltl_sat_1.next)((0, ltl_sat_1.next)(p)), (0, ltl_sat_1.next)((0, ltl_sat_1.next)((0, ltl_sat_1.not)(p))));
+        (0, vitest_1.expect)((0, ltl_sat_1.isSatisfiable)(phi).sat).toBe(false);
+    });
+    (0, vitest_1.it)('alternancia (p ∧ X ¬p ∧ X X p) es satisfacible', () => {
+        const phi = (0, ltl_sat_1.and)(p, (0, ltl_sat_1.next)((0, ltl_sat_1.not)(p)), (0, ltl_sat_1.next)((0, ltl_sat_1.next)(p)));
+        (0, vitest_1.expect)((0, ltl_sat_1.isSatisfiable)(phi).sat).toBe(true);
+    });
+    (0, vitest_1.it)('mutex G ¬(p ∧ q) es satisfacible', () => {
+        (0, vitest_1.expect)((0, ltl_sat_1.isSatisfiable)((0, ltl_sat_1.globally)((0, ltl_sat_1.not)((0, ltl_sat_1.and)(p, q)))).sat).toBe(true);
+    });
+    (0, vitest_1.it)('G(p → X q) ∧ F p ∧ G ¬q es insatisfacible', () => {
+        const phi = (0, ltl_sat_1.and)((0, ltl_sat_1.globally)((0, ltl_sat_1.implies)(p, (0, ltl_sat_1.next)(q))), (0, ltl_sat_1.eventually)(p), (0, ltl_sat_1.globally)((0, ltl_sat_1.not)(q)));
+        (0, vitest_1.expect)((0, ltl_sat_1.isSatisfiable)(phi).sat).toBe(false);
+    });
+    (0, vitest_1.it)('formula con 3 átomos (p ∧ F q ∧ G r) es satisfacible', () => {
+        (0, vitest_1.expect)((0, ltl_sat_1.isSatisfiable)((0, ltl_sat_1.and)(p, (0, ltl_sat_1.eventually)(q), (0, ltl_sat_1.globally)(r))).sat).toBe(true);
+    });
+});
+//# sourceMappingURL=sat.test.js.map