@stevenvo780/st-lang 4.6.0 → 4.8.0

package/dist/tests/fol-prover/unify.test.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"unify.test.js","sourceRoot":"","sources":["../../../src/tests/fol-prover/unify.test.ts"],"names":[],"mappings":";;AAAA,mCAA8C;AAC9C,kDAAyE;AACzE,kDAA0D;AAE1D,IAAA,iBAAQ,EAAC,4BAA4B,EAAE,GAAG,EAAE;IAC1C,IAAA,WAAE,EAAC,oCAAoC,EAAE,GAAG,EAAE;QAC5C,MAAM,EAAE,GAAG,IAAA,aAAK,EAAC,GAAG,CAAC,CAAC;QACtB,MAAM,EAAE,GAAG,IAAA,eAAO,EAAC,GAAG,CAAC,CAAC;QACxB,MAAM,CAAC,GAAG,IAAA,aAAK,EAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QACxB,IAAA,eAAM,EAAC,CAAC,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;QACzB,IAAI,CAAC,CAAC;YAAE,OAAO;QACf,IAAA,eAAM,EAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,IAAI,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IACrC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,qCAAqC,EAAE,GAAG,EAAE;QAC7C,MAAM,EAAE,GAAG,IAAA,cAAM,EAAC,GAAG,EAAE,CAAC,IAAA,aAAK,EAAC,GAAG,CAAC,EAAE,IAAA,aAAK,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACjD,MAAM,EAAE,GAAG,IAAA,cAAM,EAAC,GAAG,EAAE,CAAC,IAAA,eAAO,EAAC,GAAG,CAAC,EAAE,IAAA,eAAO,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACrD,MAAM,CAAC,GAAG,IAAA,aAAK,EAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QACxB,IAAA,eAAM,EAAC,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC;IACvB,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,oCAAoC,EAAE,GAAG,EAAE;QAC5C,MAAM,EAAE,GAAG,IAAA,cAAM,EAAC,GAAG,EAAE,CAAC,IAAA,aAAK,EAAC,GAAG,CAAC,EAAE,IAAA,cAAM,EAAC,GAAG,EAAE,CAAC,IAAA,aAAK,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAChE,MAAM,EAAE,GAAG,IAAA,cAAM,EAAC,GAAG,EAAE,CAAC,IAAA,eAAO,EAAC,GAAG,CAAC,EAAE,IAAA,cAAM,EAAC,GAAG,EAAE,CAAC,IAAA,eAAO,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACpE,MAAM,CAAC,GAAG,IAAA,aAAK,EAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QACxB,IAAA,eAAM,EAAC,CAAC,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;QACzB,IAAI,CAAC,CAAC;YAAE,OAAO;QACf,IAAA,eAAM,EAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,IAAI,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACnC,IAAA,eAAM,EAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,IAAI,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IACrC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,mCAAmC,EAAE,GAAG,EAAE;QAC3C,MAAM,EAAE,GAAG,IAAA,aAAK,EAAC,GAAG,CAAC,CAAC;QACtB,MAAM,EAAE,GAAG,IAAA,cAAM,EAAC,GAAG,EAAE,CAAC,IAAA,aAAK,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACrC,MAAM,CAAC,GAAG,IAAA,aAAK,EAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QACxB,IAAA,eAAM,EAAC,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC;IACvB,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,2CAA2C,EAAE,GAAG,EAAE;QACnD,MAAM,EAAE,GAAG,IAAA,aAAK,EAAC,GAAG,CAAC,CAAC;QACtB,MAAM,EAAE,GAAG,IAAA,aAAK,EAAC,GAAG,CAAC,CAAC;QACtB,MAAM,CAAC,GAAG,IAAA,aAAK,EAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QACxB,IAAA,eAAM,EAAC,CAAC,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;QACzB,IAAI,CAAC,CAAC;YAAE,OAAO;QACf,MAAM,KAAK,GAAG,IAAA,iBAAS,EAAC,IAAA,aAAK,EAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;QACvC,IAAA,eAAM,EAAC,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IAC/B,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,wBAAwB,EAAE,GAAG,EAAE;QAChC,MAAM,CAAC,GAAG,IAAA,aAAK,EAAC,IAAA,eAAO,EAAC,GAAG,CAAC,EAAE,IAAA,eAAO,EAAC,GAAG,CAAC,CAAC,CAAC;QAC5C,IAAA,eAAM,EAAC,CAAC,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;IAC3B,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,8BAA8B,EAAE,GAAG,EAAE;QACtC,MAAM,CAAC,GAAG,IAAA,aAAK,EAAC,IAAA,eAAO,EAAC,GAAG,CAAC,EAAE,IAAA,eAAO,EAAC,GAAG,CAAC,CAAC,CAAC;QAC5C,IAAA,eAAM,EAAC,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC;IACvB,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,qCAAqC,EAAE,GAAG,EAAE;QAC7C,MAAM,GAAG,GAAG,IAAI,GAAG,CAAkB,CAAC,CAAC,GAAG,EAAE,IAAA,eAAO,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QAC5D,MAAM,CAAC,GAAG,IAAA,cAAM,EAAC,GAAG,EAAE,CAAC,IAAA,aAAK,EAAC,GAAG,CAAC,EAAE,IAAA,cAAM,EAAC,GAAG,EAAE,CAAC,IAAA,aAAK,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC/D,MAAM,GAAG,GAAG,IAAA,iBAAS,EAAC,CAAC,EAAE,GAAG,CAAC,CAAC;QAC9B,IAAA,eAAM,EAAC,GAAG,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAC9B,IAAA,eAAM,EAAC,GAAG,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAC3B,IAAA,eAAM,EAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACtC,IAAA,eAAM,EAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IACnD,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}

package/dist/tests/fol-prover-equality/prove.test.d.ts.map

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

package/dist/tests/fol-prover-equality/prove.test.js

@@ -1,179 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-const vitest_1 = require("vitest");
-const fol_prover_equality_1 = require("../../fol-prover-equality");
-// ---------- Formula helpers ----------
-function predicate(name, params) {
-    return { kind: 'predicate', name, params, terms: params };
-}
-function equals(a, b) {
-    return { kind: 'equals', params: [a, b], terms: [a, b] };
-}
-function forall(v, body) {
-    return { kind: 'forall', variable: v, args: [body] };
-}
-// ---------- Term helpers ----------
-function v(name) {
-    return { kind: 'var', name };
-}
-function c(name) {
-    return { kind: 'const', name };
-}
-function f(name, args) {
-    return { kind: 'func', name, args };
-}
-function eqLit(a, b, negated = false) {
-    return { negated, predicate: fol_prover_equality_1.EQ_PREDICATE, args: [a, b] };
-}
-function predLit(name, args, negated = false) {
-    return { negated, predicate: name, args };
-}
-(0, vitest_1.describe)('FOL equality — paramodulation core', () => {
-    (0, vitest_1.it)('1. f(a) = a, P(f(a)) ⊢ P(a)  (paramodulation)', () => {
-        const p1 = forall('x', equals('x', 'x')); // dummy reflex
-        // Build manually because `equals` formula parses string params; we use predicate trick.
-        const eq_fa_a = {
-            kind: 'predicate',
-            name: '=',
-            params: ['f(a)', 'a'],
-            terms: ['f(a)', 'a'],
-        };
-        // Above won't decompose f(a) correctly via CNF (it would treat "f(a)" as a const).
-        // Instead, we drive the prover with raw clauses through paramodulate() directly
-        // for this specific test, and also assert that the high-level prover handles a
-        // simpler form: c = a, P(c) ⊢ P(a) (the c-case is what naturally appears in CNF).
-        void p1;
-        void eq_fa_a;
-        const eqClause = [eqLit(f('f', [c('a')]), c('a'))];
-        const targetClause = [predLit('P', [f('f', [c('a')])])];
-        const result = (0, fol_prover_equality_1.paramodulate)(eqClause, 0, targetClause, 0, [0]);
-        (0, vitest_1.expect)(result).not.toBeNull();
-        (0, vitest_1.expect)(result?.length).toBe(1);
-        (0, vitest_1.expect)(result?.[0]?.predicate).toBe('P');
-        (0, vitest_1.expect)(result?.[0]?.args[0]?.kind).toBe('const');
-        (0, vitest_1.expect)((result?.[0]?.args[0]).name).toBe('a');
-    });
-    (0, vitest_1.it)('2. a = b, b = c ⊢ a = c (transitividad via paramodulation chain)', () => {
-        const p1 = equals('a', 'b');
-        const p2 = equals('b', 'c');
-        const goal = equals('a', 'c');
-        const r = (0, fol_prover_equality_1.proveWithEquality)([p1, p2], goal, { timeoutMs: 3000, maxSteps: 500 });
-        (0, vitest_1.expect)(r.proven).toBe(true);
-    });
-    (0, vitest_1.it)('3. a = b, P(a) ⊢ P(b) (paramodulation substitutiva)', () => {
-        const p1 = equals('a', 'b');
-        const p2 = predicate('P', ['a']);
-        const goal = predicate('P', ['b']);
-        const r = (0, fol_prover_equality_1.proveWithEquality)([p1, p2], goal, { timeoutMs: 3000, maxSteps: 500 });
-        (0, vitest_1.expect)(r.proven).toBe(true);
-    });
-    (0, vitest_1.it)('4. ⊢ ∀x. x = x  (reflexividad trivial)', () => {
-        const goal = forall('x', equals('x', 'x'));
-        const r = (0, fol_prover_equality_1.proveWithEquality)([], goal, { timeoutMs: 2000, maxSteps: 200 });
-        (0, vitest_1.expect)(r.proven).toBe(true);
-    });
-    (0, vitest_1.it)('5. f(a) = a ⊢ f(f(a)) = a (rewriting iterado via paramodulation)', () => {
-        // Drive at clause level: from {f(a)=a} we should derive {f(f(a))=a}.
-        const eqClause = [eqLit(f('f', [c('a')]), c('a'))];
-        // target clause: f(f(a)) = a as negated goal would become ¬(f(f(a))=a)
-        const negGoal = [eqLit(f('f', [f('f', [c('a')])]), c('a'), true)];
-        // Paramodulate eqClause into negGoal at the inner f(a) (position [0, 0]):
-        //   negGoal's literal arg[0] = f(f(a)); descend into arg[0] of that = f(a).
-        const r1 = (0, fol_prover_equality_1.paramodulate)(eqClause, 0, negGoal, 0, [0, 0]);
-        (0, vitest_1.expect)(r1).not.toBeNull();
-        // Result should be ¬(f(a) = a). Apply paramodulation once more.
-        (0, vitest_1.expect)(r1?.length).toBe(1);
-        const lit1 = r1?.[0];
-        (0, vitest_1.expect)(lit1?.predicate).toBe(fol_prover_equality_1.EQ_PREDICATE);
-        (0, vitest_1.expect)(lit1?.negated).toBe(true);
-        const r2 = (0, fol_prover_equality_1.paramodulate)(eqClause, 0, r1 ?? [], 0, [0]);
-        (0, vitest_1.expect)(r2).not.toBeNull();
-        // Result: ¬(a = a) — apply reflexivity to close it.
-        const closed = (0, fol_prover_equality_1.reflexivityResolve)(r2 ?? []);
-        (0, vitest_1.expect)(closed).not.toBeNull();
-        (0, vitest_1.expect)(closed?.length).toBe(0);
-    });
-    (0, vitest_1.it)('6. Reflexivity resolution closes ¬(a = a)', () => {
-        const cl = [eqLit(c('a'), c('a'), true)];
-        const r = (0, fol_prover_equality_1.reflexivityResolve)(cl);
-        (0, vitest_1.expect)(r).not.toBeNull();
-        (0, vitest_1.expect)(r?.length).toBe(0);
-    });
-    (0, vitest_1.it)('7. demodulate replaces f(a) with a in P(f(a))', () => {
-        const cl = [predLit('P', [f('f', [c('a')])])];
-        const out = (0, fol_prover_equality_1.demodulate)(cl, [{ from: f('f', [c('a')]), to: c('a') }]);
-        (0, vitest_1.expect)(out.length).toBe(1);
-        (0, vitest_1.expect)(out[0]?.args[0]?.kind).toBe('const');
-        (0, vitest_1.expect)((out[0]?.args[0]).name).toBe('a');
-    });
-    (0, vitest_1.it)('8. demodulate is idempotent at fixed point', () => {
-        const cl = [predLit('P', [c('a')])];
-        const out = (0, fol_prover_equality_1.demodulate)(cl, [{ from: f('f', [c('a')]), to: c('a') }]);
-        (0, vitest_1.expect)(out.length).toBe(1);
-        (0, vitest_1.expect)((out[0]?.args[0]).name).toBe('a');
-    });
-    (0, vitest_1.it)('9. demodulate orients rules so the larger side is rewritten away', () => {
-        // Rule given backwards: from a, to f(a). Should be flipped to f(a) → a.
-        const cl = [predLit('P', [f('f', [c('a')])])];
-        const out = (0, fol_prover_equality_1.demodulate)(cl, [{ from: c('a'), to: f('f', [c('a')]) }]);
-        (0, vitest_1.expect)((out[0]?.args[0]).name).toBe('a');
-    });
-    (0, vitest_1.it)('10. equalityFactor on x = b ∨ x = c (with x variable) produces a factor', () => {
-        const cl = [eqLit(v('x'), c('b')), eqLit(v('x'), c('c'))];
-        const factors = (0, fol_prover_equality_1.equalityFactor)(cl);
-        (0, vitest_1.expect)(factors.length).toBeGreaterThan(0);
-        // Each factor must contain a negative __eq__(b, c) or __eq__(c, b)
-        for (const fac of factors) {
-            const hasNeg = fac.some((l) => l.negated && (0, fol_prover_equality_1.isEqualityLiteral)(l));
-            (0, vitest_1.expect)(hasNeg).toBe(true);
-        }
-    });
-    (0, vitest_1.it)('11. proves chained substitution: a=b, b=c, P(a) ⊢ P(c)', () => {
-        const r = (0, fol_prover_equality_1.proveWithEquality)([equals('a', 'b'), equals('b', 'c'), predicate('P', ['a'])], predicate('P', ['c']), { timeoutMs: 4000, maxSteps: 800 });
-        (0, vitest_1.expect)(r.proven).toBe(true);
-    });
-    (0, vitest_1.it)('12. does NOT prove P(c) from a=b and P(a) (c is unrelated)', () => {
-        const r = (0, fol_prover_equality_1.proveWithEquality)([equals('a', 'b'), predicate('P', ['a'])], predicate('P', ['c']), {
-            timeoutMs: 800,
-            maxSteps: 200,
-        });
-        (0, vitest_1.expect)(r.proven).toBe(false);
-    });
-    (0, vitest_1.it)('13. paramodulate returns null when unification fails', () => {
-        const eqClause = [eqLit(c('a'), c('b'))];
-        const target = [predLit('P', [c('z')])];
-        const r = (0, fol_prover_equality_1.paramodulate)(eqClause, 0, target, 0, [0]);
-        (0, vitest_1.expect)(r).toBeNull();
-    });
-    (0, vitest_1.it)('14. paramodulate skips bare variable subterms (no useless rewrites)', () => {
-        const eqClause = [eqLit(c('a'), c('b'))];
-        const target = [predLit('P', [v('y')])];
-        const r = (0, fol_prover_equality_1.paramodulate)(eqClause, 0, target, 0, [0]);
-        // arg is a variable, must be null per design.
-        (0, vitest_1.expect)(r).toBeNull();
-    });
-    (0, vitest_1.it)('15. timeout: explosive equality search hits timeout cleanly', () => {
-        // a=b, b=c, c=d, d=e ... goal is an unrelated predicate that can't be reached.
-        const premises = [
-            equals('a', 'b'),
-            equals('b', 'c'),
-            equals('c', 'd'),
-            equals('d', 'e'),
-            predicate('P', ['a']),
-        ];
-        const goal = predicate('Q', ['z']);
-        const start = Date.now();
-        const r = (0, fol_prover_equality_1.proveWithEquality)(premises, goal, { timeoutMs: 150, maxSteps: 5000 });
-        const elapsed = Date.now() - start;
-        (0, vitest_1.expect)(r.proven).toBe(false);
-        (0, vitest_1.expect)(elapsed).toBeLessThan(150 + 500);
-    });
-    (0, vitest_1.it)('16. proves symmetric goal: a = b ⊢ b = a', () => {
-        const r = (0, fol_prover_equality_1.proveWithEquality)([equals('a', 'b')], equals('b', 'a'), {
-            timeoutMs: 2000,
-            maxSteps: 300,
-        });
-        (0, vitest_1.expect)(r.proven).toBe(true);
-    });
-});
-//# sourceMappingURL=prove.test.js.map

package/dist/tests/fol-prover-equality/prove.test.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"prove.test.js","sourceRoot":"","sources":["../../../src/tests/fol-prover-equality/prove.test.ts"],"names":[],"mappings":";;AAAA,mCAA8C;AAG9C,mEAQmC;AAEnC,wCAAwC;AAExC,SAAS,SAAS,CAAC,IAAY,EAAE,MAAgB;IAC/C,OAAO,EAAE,IAAI,EAAE,WAAW,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,CAAC;AAC5D,CAAC;AAED,SAAS,MAAM,CAAC,CAAS,EAAE,CAAS;IAClC,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,MAAM,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC;AAC3D,CAAC;AAED,SAAS,MAAM,CAAC,CAAS,EAAE,IAAa;IACtC,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,QAAQ,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;AACvD,CAAC;AAED,qCAAqC;AAErC,SAAS,CAAC,CAAC,IAAY;IACrB,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC;AAC/B,CAAC;AACD,SAAS,CAAC,CAAC,IAAY;IACrB,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC;AACjC,CAAC;AACD,SAAS,CAAC,CAAC,IAAY,EAAE,IAAe;IACtC,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC;AACtC,CAAC;AAED,SAAS,KAAK,CAAC,CAAU,EAAE,CAAU,EAAE,OAAO,GAAG,KAAK;IACpD,OAAO,EAAE,OAAO,EAAE,SAAS,EAAE,kCAAY,EAAE,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC;AAC5D,CAAC;AACD,SAAS,OAAO,CAAC,IAAY,EAAE,IAAe,EAAE,OAAO,GAAG,KAAK;IAC7D,OAAO,EAAE,OAAO,EAAE,SAAS,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC;AAC5C,CAAC;AAED,IAAA,iBAAQ,EAAC,oCAAoC,EAAE,GAAG,EAAE;IAClD,IAAA,WAAE,EAAC,+CAA+C,EAAE,GAAG,EAAE;QACvD,MAAM,EAAE,GAAG,MAAM,CAAC,GAAG,EAAE,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,eAAe;QACzD,wFAAwF;QACxF,MAAM,OAAO,GAAY;YACvB,IAAI,EAAE,WAAW;YACjB,IAAI,EAAE,GAAG;YACT,MAAM,EAAE,CAAC,MAAM,EAAE,GAAG,CAAC;YACrB,KAAK,EAAE,CAAC,MAAM,EAAE,GAAG,CAAC;SACrB,CAAC;QACF,mFAAmF;QACnF,gFAAgF;QAChF,+EAA+E;QAC/E,kFAAkF;QAClF,KAAK,EAAE,CAAC;QACR,KAAK,OAAO,CAAC;QAEb,MAAM,QAAQ,GAAc,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAC9D,MAAM,YAAY,GAAc,CAAC,OAAO,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACnE,MAAM,MAAM,GAAG,IAAA,kCAAY,EAAC,QAAQ,EAAE,CAAC,EAAE,YAAY,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QAC/D,IAAA,eAAM,EAAC,MAAM,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;QAC9B,IAAA,eAAM,EAAC,MAAM,EAAE,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC/B,IAAA,eAAM,EAAC,MAAM,EAAE,CAAC,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACzC,IAAA,eAAM,EAAC,MAAM,EAAE,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QACjD,IAAA,eAAM,EAAC,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAsB,CAAA,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IACpE,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,kEAAkE,EAAE,GAAG,EAAE;QAC1E,MAAM,EAAE,GAAG,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;QAC5B,MAAM,EAAE,GAAG,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;QAC5B,MAAM,IAAI,GAAG,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;QAC9B,MAAM,CAAC,GAAG,IAAA,uCAAiB,EAAC,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,IAAI,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,QAAQ,EAAE,GAAG,EAAE,CAAC,CAAC;QAChF,IAAA,eAAM,EAAC,CAAC,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC9B,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,qDAAqD,EAAE,GAAG,EAAE;QAC7D,MAAM,EAAE,GAAG,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;QAC5B,MAAM,EAAE,GAAG,SAAS,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;QACjC,MAAM,IAAI,GAAG,SAAS,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;QACnC,MAAM,CAAC,GAAG,IAAA,uCAAiB,EAAC,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,IAAI,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,QAAQ,EAAE,GAAG,EAAE,CAAC,CAAC;QAChF,IAAA,eAAM,EAAC,CAAC,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC9B,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,wCAAwC,EAAE,GAAG,EAAE;QAChD,MAAM,IAAI,GAAG,MAAM,CAAC,GAAG,EAAE,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;QAC3C,MAAM,CAAC,GAAG,IAAA,uCAAiB,EAAC,EAAE,EAAE,IAAI,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,QAAQ,EAAE,GAAG,EAAE,CAAC,CAAC;QAC1E,IAAA,eAAM,EAAC,CAAC,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC9B,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,kEAAkE,EAAE,GAAG,EAAE;QAC1E,qEAAqE;QACrE,MAAM,QAAQ,GAAc,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAC9D,uEAAuE;QACvE,MAAM,OAAO,GAAc,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC;QAE7E,0EAA0E;QAC1E,4EAA4E;QAC5E,MAAM,EAAE,GAAG,IAAA,kCAAY,EAAC,QAAQ,EAAE,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QACzD,IAAA,eAAM,EAAC,EAAE,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;QAC1B,gEAAgE;QAChE,IAAA,eAAM,EAAC,EAAE,EAAE,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC3B,MAAM,IAAI,GAAG,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;QACrB,IAAA,eAAM,EAAC,IAAI,EAAE,SAAS,CAAC,CAAC,IAAI,CAAC,kCAAY,CAAC,CAAC;QAC3C,IAAA,eAAM,EAAC,IAAI,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAEjC,MAAM,EAAE,GAAG,IAAA,kCAAY,EAAC,QAAQ,EAAE,CAAC,EAAE,EAAE,IAAI,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QACvD,IAAA,eAAM,EAAC,EAAE,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;QAC1B,oDAAoD;QACpD,MAAM,MAAM,GAAG,IAAA,wCAAkB,EAAC,EAAE,IAAI,EAAE,CAAC,CAAC;QAC5C,IAAA,eAAM,EAAC,MAAM,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;QAC9B,IAAA,eAAM,EAAC,MAAM,EAAE,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACjC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,2CAA2C,EAAE,GAAG,EAAE;QACnD,MAAM,EAAE,GAAc,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC;QACpD,MAAM,CAAC,GAAG,IAAA,wCAAkB,EAAC,EAAE,CAAC,CAAC;QACjC,IAAA,eAAM,EAAC,CAAC,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;QACzB,IAAA,eAAM,EAAC,CAAC,EAAE,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC5B,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,+CAA+C,EAAE,GAAG,EAAE;QACvD,MAAM,EAAE,GAAc,CAAC,OAAO,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACzD,MAAM,GAAG,GAAG,IAAA,gCAAU,EAAC,EAAE,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;QACrE,IAAA,eAAM,EAAC,GAAG,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC3B,IAAA,eAAM,EAAC,GAAG,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QAC5C,IAAA,eAAM,EAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAsB,CAAA,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IAC/D,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,4CAA4C,EAAE,GAAG,EAAE;QACpD,MAAM,EAAE,GAAc,CAAC,OAAO,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QAC/C,MAAM,GAAG,GAAG,IAAA,gCAAU,EAAC,EAAE,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;QACrE,IAAA,eAAM,EAAC,GAAG,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC3B,IAAA,eAAM,EAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAsB,CAAA,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IAC/D,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,kEAAkE,EAAE,GAAG,EAAE;QAC1E,wEAAwE;QACxE,MAAM,EAAE,GAAc,CAAC,OAAO,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACzD,MAAM,GAAG,GAAG,IAAA,gCAAU,EAAC,EAAE,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACrE,IAAA,eAAM,EAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAsB,CAAA,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IAC/D,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,yEAAyE,EAAE,GAAG,EAAE;QACjF,MAAM,EAAE,GAAc,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACrE,MAAM,OAAO,GAAG,IAAA,oCAAc,EAAC,EAAE,CAAC,CAAC;QACnC,IAAA,eAAM,EAAC,OAAO,CAAC,MAAM,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;QAC1C,mEAAmE;QACnE,KAAK,MAAM,GAAG,IAAI,OAAO,EAAE,CAAC;YAC1B,MAAM,MAAM,GAAG,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,IAAI,IAAA,uCAAiB,EAAC,CAAC,CAAC,CAAC,CAAC;YAClE,IAAA,eAAM,EAAC,MAAM,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC5B,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,wDAAwD,EAAE,GAAG,EAAE;QAChE,MAAM,CAAC,GAAG,IAAA,uCAAiB,EACzB,CAAC,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,SAAS,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,EAC3D,SAAS,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,EACrB,EAAE,SAAS,EAAE,IAAI,EAAE,QAAQ,EAAE,GAAG,EAAE,CACnC,CAAC;QACF,IAAA,eAAM,EAAC,CAAC,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC9B,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,4DAA4D,EAAE,GAAG,EAAE;QACpE,MAAM,CAAC,GAAG,IAAA,uCAAiB,EAAC,CAAC,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,SAAS,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,SAAS,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,EAAE;YAC5F,SAAS,EAAE,GAAG;YACd,QAAQ,EAAE,GAAG;SACd,CAAC,CAAC;QACH,IAAA,eAAM,EAAC,CAAC,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC/B,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,sDAAsD,EAAE,GAAG,EAAE;QAC9D,MAAM,QAAQ,GAAc,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACpD,MAAM,MAAM,GAAc,CAAC,OAAO,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACnD,MAAM,CAAC,GAAG,IAAA,kCAAY,EAAC,QAAQ,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QACpD,IAAA,eAAM,EAAC,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC;IACvB,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,qEAAqE,EAAE,GAAG,EAAE;QAC7E,MAAM,QAAQ,GAAc,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACpD,MAAM,MAAM,GAAc,CAAC,OAAO,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACnD,MAAM,CAAC,GAAG,IAAA,kCAAY,EAAC,QAAQ,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QACpD,8CAA8C;QAC9C,IAAA,eAAM,EAAC,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC;IACvB,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,6DAA6D,EAAE,GAAG,EAAE;QACrE,+EAA+E;QAC/E,MAAM,QAAQ,GAAc;YAC1B,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC;YAChB,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC;YAChB,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC;YAChB,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC;YAChB,SAAS,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC;SACtB,CAAC;QACF,MAAM,IAAI,GAAG,SAAS,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;QACnC,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QACzB,MAAM,CAAC,GAAG,IAAA,uCAAiB,EAAC,QAAQ,EAAE,IAAI,EAAE,EAAE,SAAS,EAAE,GAAG,EAAE,QAAQ,EAAE,IAAI,EAAE,CAAC,CAAC;QAChF,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,KAAK,CAAC;QACnC,IAAA,eAAM,EAAC,CAAC,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC7B,IAAA,eAAM,EAAC,OAAO,CAAC,CAAC,YAAY,CAAC,GAAG,GAAG,GAAG,CAAC,CAAC;IAC1C,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,0CAA0C,EAAE,GAAG,EAAE;QAClD,MAAM,CAAC,GAAG,IAAA,uCAAiB,EAAC,CAAC,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE;YAChE,SAAS,EAAE,IAAI;YACf,QAAQ,EAAE,GAAG;SACd,CAAC,CAAC;QACH,IAAA,eAAM,EAAC,CAAC,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC9B,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}

package/dist/tests/game-semantics/game-semantics.test.d.ts.map

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

package/dist/tests/game-semantics/game-semantics.test.js

@@ -1,143 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-const vitest_1 = require("vitest");
-const game_semantics_1 = require("../../game-semantics");
-const P = (0, game_semantics_1.ipcAtom)('P');
-const Q = (0, game_semantics_1.ipcAtom)('Q');
-const R = (0, game_semantics_1.ipcAtom)('R');
-(0, vitest_1.describe)('Game semantics IPC — winningStrategy', () => {
-    (0, vitest_1.it)('P → P: proponente tiene estrategia ganadora', () => {
-        const result = (0, game_semantics_1.winningStrategy)((0, game_semantics_1.ipcImplies)(P, P));
-        (0, vitest_1.expect)(result.exists).toBe(true);
-        (0, vitest_1.expect)(typeof result.strategy).toBe('function');
-    });
-    (0, vitest_1.it)('P ∨ ¬P: proponente NO tiene estrategia (no es válida en IPC)', () => {
-        const result = (0, game_semantics_1.winningStrategy)((0, game_semantics_1.ipcOr)(P, (0, game_semantics_1.ipcNot)(P)));
-        (0, vitest_1.expect)(result.exists).toBe(false);
-        (0, vitest_1.expect)(result.strategy).toBeUndefined();
-    });
-    (0, vitest_1.it)('(P ∧ Q) → P: proponente gana (proyección)', () => {
-        const result = (0, game_semantics_1.winningStrategy)((0, game_semantics_1.ipcImplies)((0, game_semantics_1.ipcAnd)(P, Q), P));
-        (0, vitest_1.expect)(result.exists).toBe(true);
-    });
-    (0, vitest_1.it)('(P ∧ Q) → Q: proponente gana (proyección derecha)', () => {
-        const result = (0, game_semantics_1.winningStrategy)((0, game_semantics_1.ipcImplies)((0, game_semantics_1.ipcAnd)(P, Q), Q));
-        (0, vitest_1.expect)(result.exists).toBe(true);
-    });
-    (0, vitest_1.it)('P → (Q → P): proponente gana (axioma K débil)', () => {
-        const result = (0, game_semantics_1.winningStrategy)((0, game_semantics_1.ipcImplies)(P, (0, game_semantics_1.ipcImplies)(Q, P)));
-        (0, vitest_1.expect)(result.exists).toBe(true);
-    });
-    (0, vitest_1.it)('(P → Q) → ((Q → R) → (P → R)): transitividad de →', () => {
-        const phi = (0, game_semantics_1.ipcImplies)((0, game_semantics_1.ipcImplies)(P, Q), (0, game_semantics_1.ipcImplies)((0, game_semantics_1.ipcImplies)(Q, R), (0, game_semantics_1.ipcImplies)(P, R)));
-        const result = (0, game_semantics_1.winningStrategy)(phi);
-        (0, vitest_1.expect)(result.exists).toBe(true);
-    });
-    (0, vitest_1.it)('¬¬(P ∨ ¬P): proponente gana (estable en IPC aunque P∨¬P no)', () => {
-        const phi = (0, game_semantics_1.ipcNot)((0, game_semantics_1.ipcNot)((0, game_semantics_1.ipcOr)(P, (0, game_semantics_1.ipcNot)(P))));
-        const result = (0, game_semantics_1.winningStrategy)(phi);
-        (0, vitest_1.expect)(result.exists).toBe(true);
-    });
-    (0, vitest_1.it)('¬¬P → P (DNE): proponente NO tiene estrategia (clásica pero no intuicionista)', () => {
-        const phi = (0, game_semantics_1.ipcImplies)((0, game_semantics_1.ipcNot)((0, game_semantics_1.ipcNot)(P)), P);
-        const result = (0, game_semantics_1.winningStrategy)(phi);
-        (0, vitest_1.expect)(result.exists).toBe(false);
-    });
-    (0, vitest_1.it)('((P → Q) → P) → P (Peirce): proponente NO tiene estrategia', () => {
-        const phi = (0, game_semantics_1.ipcImplies)((0, game_semantics_1.ipcImplies)((0, game_semantics_1.ipcImplies)(P, Q), P), P);
-        const result = (0, game_semantics_1.winningStrategy)(phi);
-        (0, vitest_1.expect)(result.exists).toBe(false);
-    });
-    (0, vitest_1.it)('⊥ → P (ex falso): proponente gana', () => {
-        const phi = (0, game_semantics_1.ipcImplies)((0, game_semantics_1.ipcBottom)(), P);
-        const result = (0, game_semantics_1.winningStrategy)(phi);
-        (0, vitest_1.expect)(result.exists).toBe(true);
-    });
-    (0, vitest_1.it)('P: átomo aislado NO es válido (proponente pierde)', () => {
-        const result = (0, game_semantics_1.winningStrategy)(P);
-        (0, vitest_1.expect)(result.exists).toBe(false);
-    });
-});
-(0, vitest_1.describe)('Game semantics IPC — play (simulación de partida)', () => {
-    (0, vitest_1.it)('P → P contra ataque-implica: P gana', () => {
-        const phi = (0, game_semantics_1.ipcImplies)(P, P);
-        const opp = [{ kind: 'attack-implies' }];
-        const { winner, trace } = (0, game_semantics_1.play)(phi, opp);
-        (0, vitest_1.expect)(winner).toBe('proponent');
-        (0, vitest_1.expect)(trace.length).toBeGreaterThan(1);
-        // El primer estado refleja la tesis original.
-        (0, vitest_1.expect)((0, game_semantics_1.ipcEquals)(trace[0].current, phi)).toBe(true);
-    });
-    (0, vitest_1.it)('(P ∧ Q) → P: O ataca →, luego pide ∧-left, P concluye P', () => {
-        const phi = (0, game_semantics_1.ipcImplies)((0, game_semantics_1.ipcAnd)(P, Q), P);
-        const opp = [{ kind: 'attack-implies' }];
-        const { winner, trace } = (0, game_semantics_1.play)(phi, opp);
-        (0, vitest_1.expect)(winner).toBe('proponent');
-        // El contexto en algún momento contiene P∧Q (concedido por O).
-        const sawConjunction = trace.some((s) => s.context.some((c) => (0, game_semantics_1.ipcEquals)(c, (0, game_semantics_1.ipcAnd)(P, Q))));
-        (0, vitest_1.expect)(sawConjunction).toBe(true);
-    });
-    (0, vitest_1.it)('P (átomo aislado): O no necesita atacar, P pierde inmediatamente', () => {
-        const { winner } = (0, game_semantics_1.play)(P, []);
-        (0, vitest_1.expect)(winner).toBe('opponent');
-    });
-    (0, vitest_1.it)('P ∨ ¬P: P no tiene estrategia → O gana', () => {
-        const phi = (0, game_semantics_1.ipcOr)(P, (0, game_semantics_1.ipcNot)(P));
-        const { winner } = (0, game_semantics_1.play)(phi, []);
-        (0, vitest_1.expect)(winner).toBe('opponent');
-    });
-    (0, vitest_1.it)('history acumula movidas con etiquetas legibles', () => {
-        const phi = (0, game_semantics_1.ipcImplies)(P, P);
-        const opp = [{ kind: 'attack-implies' }];
-        const { trace } = (0, game_semantics_1.play)(phi, opp);
-        const last = trace[trace.length - 1];
-        (0, vitest_1.expect)(last.history.length).toBeGreaterThanOrEqual(2);
-        // Hay al menos una movida del oponente y otra del proponente.
-        const players = new Set(last.history.map((h) => h.player));
-        (0, vitest_1.expect)(players.has('proponent')).toBe(true);
-        (0, vitest_1.expect)(players.has('opponent')).toBe(true);
-    });
-});
-(0, vitest_1.describe)('Game semantics IPC — invariantes y serialización', () => {
-    (0, vitest_1.it)('ipcToString es estable y legible', () => {
-        (0, vitest_1.expect)((0, game_semantics_1.ipcToString)(P)).toBe('P');
-        (0, vitest_1.expect)((0, game_semantics_1.ipcToString)((0, game_semantics_1.ipcBottom)())).toBe('⊥');
-        (0, vitest_1.expect)((0, game_semantics_1.ipcToString)((0, game_semantics_1.ipcImplies)(P, Q))).toBe('(P → Q)');
-        (0, vitest_1.expect)((0, game_semantics_1.ipcToString)((0, game_semantics_1.ipcAnd)(P, Q))).toBe('(P ∧ Q)');
-        (0, vitest_1.expect)((0, game_semantics_1.ipcToString)((0, game_semantics_1.ipcOr)(P, Q))).toBe('(P ∨ Q)');
-        (0, vitest_1.expect)((0, game_semantics_1.ipcToString)((0, game_semantics_1.ipcNot)(P))).toBe('(P → ⊥)');
-    });
-    (0, vitest_1.it)('toIntuit preserva la estructura sintáctica', () => {
-        const phi = (0, game_semantics_1.ipcImplies)((0, game_semantics_1.ipcAnd)(P, Q), (0, game_semantics_1.ipcOr)(P, (0, game_semantics_1.ipcBottom)()));
-        const t = (0, game_semantics_1.toIntuit)(phi);
-        (0, vitest_1.expect)(t.kind).toBe('implies');
-        if (t.kind === 'implies') {
-            (0, vitest_1.expect)(t.left.kind).toBe('and');
-            (0, vitest_1.expect)(t.right.kind).toBe('or');
-        }
-    });
-    (0, vitest_1.it)('winningStrategy es determinista para la misma fórmula', () => {
-        const phi = (0, game_semantics_1.ipcImplies)(P, P);
-        const r1 = (0, game_semantics_1.winningStrategy)(phi);
-        const r2 = (0, game_semantics_1.winningStrategy)(phi);
-        (0, vitest_1.expect)(r1.exists).toBe(r2.exists);
-    });
-    (0, vitest_1.it)('estrategia de P → P produce una movida válida desde el estado inicial', () => {
-        const phi = (0, game_semantics_1.ipcImplies)(P, P);
-        const r = (0, game_semantics_1.winningStrategy)(phi);
-        (0, vitest_1.expect)(r.exists).toBe(true);
-        const move = r.strategy({
-            current: phi,
-            context: [],
-            history: [],
-        });
-        // La movida es alguna de las del ADT (no es null/undefined).
-        (0, vitest_1.expect)(['choose-and', 'choose-or', 'attack-implies', 'defend-bottom']).toContain(move.kind);
-    });
-    (0, vitest_1.it)('play preserva la fórmula original en trace[0].current', () => {
-        const phi = (0, game_semantics_1.ipcImplies)((0, game_semantics_1.ipcAnd)(P, Q), Q);
-        const { trace } = (0, game_semantics_1.play)(phi, [{ kind: 'attack-implies' }]);
-        (0, vitest_1.expect)((0, game_semantics_1.ipcEquals)(trace[0].current, phi)).toBe(true);
-    });
-});
-//# sourceMappingURL=game-semantics.test.js.map

package/dist/tests/game-semantics/game-semantics.test.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"game-semantics.test.js","sourceRoot":"","sources":["../../../src/tests/game-semantics/game-semantics.test.ts"],"names":[],"mappings":";;AAAA,mCAA8C;AAC9C,yDAa8B;AAE9B,MAAM,CAAC,GAAG,IAAA,wBAAO,EAAC,GAAG,CAAC,CAAC;AACvB,MAAM,CAAC,GAAG,IAAA,wBAAO,EAAC,GAAG,CAAC,CAAC;AACvB,MAAM,CAAC,GAAG,IAAA,wBAAO,EAAC,GAAG,CAAC,CAAC;AAEvB,IAAA,iBAAQ,EAAC,sCAAsC,EAAE,GAAG,EAAE;IACpD,IAAA,WAAE,EAAC,6CAA6C,EAAE,GAAG,EAAE;QACrD,MAAM,MAAM,GAAG,IAAA,gCAAe,EAAC,IAAA,2BAAU,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QACjD,IAAA,eAAM,EAAC,MAAM,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACjC,IAAA,eAAM,EAAC,OAAO,MAAM,CAAC,QAAQ,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;IAClD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,8DAA8D,EAAE,GAAG,EAAE;QACtE,MAAM,MAAM,GAAG,IAAA,gCAAe,EAAC,IAAA,sBAAK,EAAC,CAAC,EAAE,IAAA,uBAAM,EAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACpD,IAAA,eAAM,EAAC,MAAM,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAClC,IAAA,eAAM,EAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,aAAa,EAAE,CAAC;IAC1C,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,2CAA2C,EAAE,GAAG,EAAE;QACnD,MAAM,MAAM,GAAG,IAAA,gCAAe,EAAC,IAAA,2BAAU,EAAC,IAAA,uBAAM,EAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAC5D,IAAA,eAAM,EAAC,MAAM,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACnC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,mDAAmD,EAAE,GAAG,EAAE;QAC3D,MAAM,MAAM,GAAG,IAAA,gCAAe,EAAC,IAAA,2BAAU,EAAC,IAAA,uBAAM,EAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAC5D,IAAA,eAAM,EAAC,MAAM,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACnC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,+CAA+C,EAAE,GAAG,EAAE;QACvD,MAAM,MAAM,GAAG,IAAA,gCAAe,EAAC,IAAA,2BAAU,EAAC,CAAC,EAAE,IAAA,2BAAU,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QAChE,IAAA,eAAM,EAAC,MAAM,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACnC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,mDAAmD,EAAE,GAAG,EAAE;QAC3D,MAAM,GAAG,GAAG,IAAA,2BAAU,EAAC,IAAA,2BAAU,EAAC,CAAC,EAAE,CAAC,CAAC,EAAE,IAAA,2BAAU,EAAC,IAAA,2BAAU,EAAC,CAAC,EAAE,CAAC,CAAC,EAAE,IAAA,2BAAU,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QACzF,MAAM,MAAM,GAAG,IAAA,gCAAe,EAAC,GAAG,CAAC,CAAC;QACpC,IAAA,eAAM,EAAC,MAAM,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACnC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,6DAA6D,EAAE,GAAG,EAAE;QACrE,MAAM,GAAG,GAAG,IAAA,uBAAM,EAAC,IAAA,uBAAM,EAAC,IAAA,sBAAK,EAAC,CAAC,EAAE,IAAA,uBAAM,EAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAChD,MAAM,MAAM,GAAG,IAAA,gCAAe,EAAC,GAAG,CAAC,CAAC;QACpC,IAAA,eAAM,EAAC,MAAM,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACnC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,+EAA+E,EAAE,GAAG,EAAE;QACvF,MAAM,GAAG,GAAG,IAAA,2BAAU,EAAC,IAAA,uBAAM,EAAC,IAAA,uBAAM,EAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAC7C,MAAM,MAAM,GAAG,IAAA,gCAAe,EAAC,GAAG,CAAC,CAAC;QACpC,IAAA,eAAM,EAAC,MAAM,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACpC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,4DAA4D,EAAE,GAAG,EAAE;QACpE,MAAM,GAAG,GAAG,IAAA,2BAAU,EAAC,IAAA,2BAAU,EAAC,IAAA,2BAAU,EAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAC3D,MAAM,MAAM,GAAG,IAAA,gCAAe,EAAC,GAAG,CAAC,CAAC;QACpC,IAAA,eAAM,EAAC,MAAM,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACpC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,mCAAmC,EAAE,GAAG,EAAE;QAC3C,MAAM,GAAG,GAAG,IAAA,2BAAU,EAAC,IAAA,0BAAS,GAAE,EAAE,CAAC,CAAC,CAAC;QACvC,MAAM,MAAM,GAAG,IAAA,gCAAe,EAAC,GAAG,CAAC,CAAC;QACpC,IAAA,eAAM,EAAC,MAAM,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACnC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,mDAAmD,EAAE,GAAG,EAAE;QAC3D,MAAM,MAAM,GAAG,IAAA,gCAAe,EAAC,CAAC,CAAC,CAAC;QAClC,IAAA,eAAM,EAAC,MAAM,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACpC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,mDAAmD,EAAE,GAAG,EAAE;IACjE,IAAA,WAAE,EAAC,qCAAqC,EAAE,GAAG,EAAE;QAC7C,MAAM,GAAG,GAAG,IAAA,2BAAU,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAC7B,MAAM,GAAG,GAAW,CAAC,EAAE,IAAI,EAAE,gBAAgB,EAAE,CAAC,CAAC;QACjD,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,GAAG,IAAA,qBAAI,EAAC,GAAG,EAAE,GAAG,CAAC,CAAC;QACzC,IAAA,eAAM,EAAC,MAAM,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;QACjC,IAAA,eAAM,EAAC,KAAK,CAAC,MAAM,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;QACxC,8CAA8C;QAC9C,IAAA,eAAM,EAAC,IAAA,0BAAS,EAAC,KAAK,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACtD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,yDAAyD,EAAE,GAAG,EAAE;QACjE,MAAM,GAAG,GAAG,IAAA,2BAAU,EAAC,IAAA,uBAAM,EAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACxC,MAAM,GAAG,GAAW,CAAC,EAAE,IAAI,EAAE,gBAAgB,EAAE,CAAC,CAAC;QACjD,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,GAAG,IAAA,qBAAI,EAAC,GAAG,EAAE,GAAG,CAAC,CAAC;QACzC,IAAA,eAAM,EAAC,MAAM,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;QACjC,+DAA+D;QAC/D,MAAM,cAAc,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAA,0BAAS,EAAC,CAAC,EAAE,IAAA,uBAAM,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC5F,IAAA,eAAM,EAAC,cAAc,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACpC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,kEAAkE,EAAE,GAAG,EAAE;QAC1E,MAAM,EAAE,MAAM,EAAE,GAAG,IAAA,qBAAI,EAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QAC/B,IAAA,eAAM,EAAC,MAAM,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;IAClC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,wCAAwC,EAAE,GAAG,EAAE;QAChD,MAAM,GAAG,GAAG,IAAA,sBAAK,EAAC,CAAC,EAAE,IAAA,uBAAM,EAAC,CAAC,CAAC,CAAC,CAAC;QAChC,MAAM,EAAE,MAAM,EAAE,GAAG,IAAA,qBAAI,EAAC,GAAG,EAAE,EAAE,CAAC,CAAC;QACjC,IAAA,eAAM,EAAC,MAAM,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;IAClC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,gDAAgD,EAAE,GAAG,EAAE;QACxD,MAAM,GAAG,GAAG,IAAA,2BAAU,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAC7B,MAAM,GAAG,GAAW,CAAC,EAAE,IAAI,EAAE,gBAAgB,EAAE,CAAC,CAAC;QACjD,MAAM,EAAE,KAAK,EAAE,GAAG,IAAA,qBAAI,EAAC,GAAG,EAAE,GAAG,CAAC,CAAC;QACjC,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QACrC,IAAA,eAAM,EAAC,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,sBAAsB,CAAC,CAAC,CAAC,CAAC;QACtD,8DAA8D;QAC9D,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC;QAC3D,IAAA,eAAM,EAAC,OAAO,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC5C,IAAA,eAAM,EAAC,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC7C,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,kDAAkD,EAAE,GAAG,EAAE;IAChE,IAAA,WAAE,EAAC,kCAAkC,EAAE,GAAG,EAAE;QAC1C,IAAA,eAAM,EAAC,IAAA,4BAAW,EAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACjC,IAAA,eAAM,EAAC,IAAA,4BAAW,EAAC,IAAA,0BAAS,GAAE,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAC3C,IAAA,eAAM,EAAC,IAAA,4BAAW,EAAC,IAAA,2BAAU,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QACtD,IAAA,eAAM,EAAC,IAAA,4BAAW,EAAC,IAAA,uBAAM,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QAClD,IAAA,eAAM,EAAC,IAAA,4BAAW,EAAC,IAAA,sBAAK,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QACjD,IAAA,eAAM,EAAC,IAAA,4BAAW,EAAC,IAAA,uBAAM,EAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;IACjD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,4CAA4C,EAAE,GAAG,EAAE;QACpD,MAAM,GAAG,GAAG,IAAA,2BAAU,EAAC,IAAA,uBAAM,EAAC,CAAC,EAAE,CAAC,CAAC,EAAE,IAAA,sBAAK,EAAC,CAAC,EAAE,IAAA,0BAAS,GAAE,CAAC,CAAC,CAAC;QAC5D,MAAM,CAAC,GAAG,IAAA,yBAAQ,EAAC,GAAG,CAAC,CAAC;QACxB,IAAA,eAAM,EAAC,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QAC/B,IAAI,CAAC,CAAC,IAAI,KAAK,SAAS,EAAE,CAAC;YACzB,IAAA,eAAM,EAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAChC,IAAA,eAAM,EAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAClC,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,uDAAuD,EAAE,GAAG,EAAE;QAC/D,MAAM,GAAG,GAAG,IAAA,2BAAU,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAC7B,MAAM,EAAE,GAAG,IAAA,gCAAe,EAAC,GAAG,CAAC,CAAC;QAChC,MAAM,EAAE,GAAG,IAAA,gCAAe,EAAC,GAAG,CAAC,CAAC;QAChC,IAAA,eAAM,EAAC,EAAE,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,MAAM,CAAC,CAAC;IACpC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,uEAAuE,EAAE,GAAG,EAAE;QAC/E,MAAM,GAAG,GAAG,IAAA,2BAAU,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAC7B,MAAM,CAAC,GAAG,IAAA,gCAAe,EAAC,GAAG,CAAC,CAAC;QAC/B,IAAA,eAAM,EAAC,CAAC,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC5B,MAAM,IAAI,GAAG,CAAC,CAAC,QAAS,CAAC;YACvB,OAAO,EAAE,GAAG;YACZ,OAAO,EAAE,EAAE;YACX,OAAO,EAAE,EAAE;SACZ,CAAC,CAAC;QACH,6DAA6D;QAC7D,IAAA,eAAM,EAAC,CAAC,YAAY,EAAE,WAAW,EAAE,gBAAgB,EAAE,eAAe,CAAC,CAAC,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC9F,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,uDAAuD,EAAE,GAAG,EAAE;QAC/D,MAAM,GAAG,GAAG,IAAA,2BAAU,EAAC,IAAA,uBAAM,EAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACxC,MAAM,EAAE,KAAK,EAAE,GAAG,IAAA,qBAAI,EAAC,GAAG,EAAE,CAAC,EAAE,IAAI,EAAE,gBAAgB,EAAE,CAAC,CAAC,CAAC;QAC1D,IAAA,eAAM,EAAC,IAAA,0BAAS,EAAC,KAAK,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACtD,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}

package/dist/tests/game-theory/game-theory.test.d.ts.map

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

package/dist/tests/game-theory/game-theory.test.js

@@ -1,252 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-const vitest_1 = require("vitest");
-const game_theory_1 = require("../../game-theory");
-function pure(player, s, size) {
-    return { player, distribution: (0, game_theory_1.pureDistribution)(s, size) };
-}
-function mixed(player, dist) {
-    return { player, distribution: dist };
-}
-(0, vitest_1.describe)('game-theory — common-games sanity', () => {
-    (0, vitest_1.it)("Prisoner's Dilemma: único Nash puro (D, D) con payoff (1, 1)", () => {
-        const g = (0, game_theory_1.prisonersDilemma)();
-        const eqs = (0, game_theory_1.findPureNash)(g);
-        (0, vitest_1.expect)(eqs).toHaveLength(1);
-        const eq = eqs[0];
-        (0, vitest_1.expect)(eq.isPure).toBe(true);
-        (0, vitest_1.expect)(eq.isStrict).toBe(true);
-        (0, vitest_1.expect)(eq.strategies[0].distribution).toEqual([0, 1]);
-        (0, vitest_1.expect)(eq.strategies[1].distribution).toEqual([0, 1]);
-        (0, vitest_1.expect)(eq.payoffs).toEqual([1, 1]);
-    });
-    (0, vitest_1.it)('Matching Pennies: no hay Nash puro', () => {
-        const g = (0, game_theory_1.matchingPennies)();
-        const eqs = (0, game_theory_1.findPureNash)(g);
-        (0, vitest_1.expect)(eqs).toHaveLength(0);
-    });
-    (0, vitest_1.it)('Matching Pennies: Nash mixto (1/2, 1/2) via support enumeration', () => {
-        const g = (0, game_theory_1.matchingPennies)();
-        const all = (0, game_theory_1.enumerateAllNash)(g);
-        (0, vitest_1.expect)(all).toHaveLength(1);
-        const eq = all[0];
-        (0, vitest_1.expect)(eq.isPure).toBe(false);
-        (0, vitest_1.expect)((0, game_theory_1.vectorsApproxEqual)(eq.strategies[0].distribution, [0.5, 0.5], 1e-7)).toBe(true);
-        (0, vitest_1.expect)((0, game_theory_1.vectorsApproxEqual)(eq.strategies[1].distribution, [0.5, 0.5], 1e-7)).toBe(true);
-        (0, vitest_1.expect)((0, game_theory_1.approxEqual)(eq.payoffs[0], 0, 1e-7)).toBe(true);
-        (0, vitest_1.expect)((0, game_theory_1.approxEqual)(eq.payoffs[1], 0, 1e-7)).toBe(true);
-    });
-    (0, vitest_1.it)('Rock-Paper-Scissors: único Nash mixto (1/3, 1/3, 1/3) cada jugador', () => {
-        const g = (0, game_theory_1.rockPaperScissors)();
-        (0, vitest_1.expect)((0, game_theory_1.findPureNash)(g)).toHaveLength(0);
-        const all = (0, game_theory_1.enumerateAllNash)(g);
-        (0, vitest_1.expect)(all).toHaveLength(1);
-        const eq = all[0];
-        (0, vitest_1.expect)(eq.isPure).toBe(false);
-        (0, vitest_1.expect)((0, game_theory_1.vectorsApproxEqual)(eq.strategies[0].distribution, [1 / 3, 1 / 3, 1 / 3], 1e-7)).toBe(true);
-        (0, vitest_1.expect)((0, game_theory_1.vectorsApproxEqual)(eq.strategies[1].distribution, [1 / 3, 1 / 3, 1 / 3], 1e-7)).toBe(true);
-    });
-    (0, vitest_1.it)('Battle of the Sexes: 2 Nash puros + 1 mixto', () => {
-        const g = (0, game_theory_1.battleOfSexes)();
-        const pures = (0, game_theory_1.findPureNash)(g);
-        (0, vitest_1.expect)(pures).toHaveLength(2);
-        const all = (0, game_theory_1.enumerateAllNash)(g);
-        (0, vitest_1.expect)(all).toHaveLength(3);
-        const mixedEq = all.find((e) => !e.isPure);
-        (0, vitest_1.expect)(mixedEq).toBeDefined();
-        // En BoS con (2,1)/(0,0)/(0,0)/(1,2), el mixto es p=2/3 para player1
-        // (probabilidad de Opera) y q=1/3 para player2.
-        (0, vitest_1.expect)((0, game_theory_1.vectorsApproxEqual)(mixedEq.strategies[0].distribution, [2 / 3, 1 / 3], 1e-7)).toBe(true);
-        (0, vitest_1.expect)((0, game_theory_1.vectorsApproxEqual)(mixedEq.strategies[1].distribution, [1 / 3, 2 / 3], 1e-7)).toBe(true);
-    });
-    (0, vitest_1.it)('Stag Hunt: 2 Nash puros + 1 mixto', () => {
-        const g = (0, game_theory_1.stagHunt)();
-        const pures = (0, game_theory_1.findPureNash)(g);
-        (0, vitest_1.expect)(pures).toHaveLength(2);
-        const all = (0, game_theory_1.enumerateAllNash)(g);
-        (0, vitest_1.expect)(all).toHaveLength(3);
-    });
-});
-(0, vitest_1.describe)('game-theory — bestResponse', () => {
-    (0, vitest_1.it)('PD: best response a coop puro es D', () => {
-        const g = (0, game_theory_1.prisonersDilemma)();
-        // opponentStrategies debe incluir todos los jugadores; la entrada
-        // de "player" se ignora — usamos una distribución placeholder.
-        const opp = [pure(0, 0, 2), pure(1, 0, 2)];
-        const br = (0, game_theory_1.bestResponse)(g, 0, opp);
-        (0, vitest_1.expect)(br).toEqual([1]); // Defect
-    });
-    (0, vitest_1.it)('Matching Pennies: best response a mezcla 50/50 son todas las puras (empate)', () => {
-        const g = (0, game_theory_1.matchingPennies)();
-        const opp = [pure(0, 0, 2), mixed(1, [0.5, 0.5])];
-        const br = (0, game_theory_1.bestResponse)(g, 0, opp);
-        (0, vitest_1.expect)(br.sort()).toEqual([0, 1]);
-    });
-    (0, vitest_1.it)('Battle of the Sexes: best response a "Opera" puro del rival es "Opera"', () => {
-        const g = (0, game_theory_1.battleOfSexes)();
-        const opp = [pure(0, 0, 2), pure(1, 0, 2)];
-        const br0 = (0, game_theory_1.bestResponse)(g, 0, opp);
-        (0, vitest_1.expect)(br0).toEqual([0]);
-    });
-});
-(0, vitest_1.describe)('game-theory — dominance', () => {
-    (0, vitest_1.it)('isDominated detecta estrategia estrictamente dominada', () => {
-        // Jugador 1: estrategia 0 da [1,1], estrategia 1 da [3,3] → 0 dominada
-        const g = (0, game_theory_1.createTwoPlayerGame)([
-            [1, 1],
-            [3, 3],
-        ], [
-            [0, 0],
-            [0, 0],
-        ]);
-        (0, vitest_1.expect)((0, game_theory_1.isDominated)(g, 0, 0, true)).toBe(true);
-        (0, vitest_1.expect)((0, game_theory_1.isDominated)(g, 0, 1, true)).toBe(false);
-    });
-    (0, vitest_1.it)('eliminateDominated reduce el juego', () => {
-        // 3x2: la estrategia 2 del jugador 1 está dominada por la 0 (estricta).
-        // Las otras dos filas de P1 dan los mismos pagos, así que ninguna
-        // está estrictamente dominada por la otra. P2 tiene pagos planos →
-        // tampoco se elimina nada del lado 2.
-        const g = (0, game_theory_1.createTwoPlayerGame)([
-            [5, 5],
-            [5, 5], // mismo que fila 0 → no estrictamente dominada
-            [1, 1], // dominada por estrategia 0
-        ], [
-            [0, 0],
-            [0, 0],
-            [0, 0],
-        ]);
-        const reduced = (0, game_theory_1.eliminateDominated)(g, true);
-        (0, vitest_1.expect)(reduced.strategies[0]).toBe(2);
-        (0, vitest_1.expect)(reduced.strategies[1]).toBe(2);
-    });
-    (0, vitest_1.it)('eliminateDominated: iterado encuentra mas reducciones', () => {
-        // Juego donde tras eliminar una de player 1, una de player 2 queda dominada.
-        // Player 1 elige fila, Player 2 elige columna.
-        // Row 2 dominada por row 0 para P1; tras eliminarla, col 2 queda dominada por col 0 para P2.
-        const g = (0, game_theory_1.createTwoPlayerGame)([
-            [5, 4, 3], // P1 utility
-            [4, 3, 2],
-            [1, 0, -1], // dominada por fila 0
-        ], [
-            [3, 4, 2], // P2 utility
-            [3, 4, 2],
-            [3, 4, 2],
-        ]);
-        const reduced = (0, game_theory_1.eliminateDominated)(g, true);
-        // Tras eliminar fila 2 de P1, miramos columnas de P2.
-        // P2 ahora tiene matrices [[3,4,2],[3,4,2]]. col 2 (=2) está dominada por col 1 (=4).
-        (0, vitest_1.expect)(reduced.strategies[0]).toBeLessThanOrEqual(2);
-        (0, vitest_1.expect)(reduced.strategies[1]).toBeLessThanOrEqual(3);
-        // Al menos UNA dimensión debe haberse reducido del original
-        const originalProfiles = 3 * 3;
-        const newProfiles = reduced.strategies[0] * reduced.strategies[1];
-        (0, vitest_1.expect)(newProfiles).toBeLessThan(originalProfiles);
-    });
-    (0, vitest_1.it)('PD: ninguna estrategia esta dominada (D es weak-better pero ambos prefieren D)', () => {
-        const g = (0, game_theory_1.prisonersDilemma)();
-        // Cooperate está estrictamente dominada por Defect en PD
-        (0, vitest_1.expect)((0, game_theory_1.isDominated)(g, 0, 0, true)).toBe(true);
-        (0, vitest_1.expect)((0, game_theory_1.isDominated)(g, 0, 1, true)).toBe(false);
-        (0, vitest_1.expect)((0, game_theory_1.isDominated)(g, 1, 0, true)).toBe(true);
-        (0, vitest_1.expect)((0, game_theory_1.isDominated)(g, 1, 1, true)).toBe(false);
-        const reduced = (0, game_theory_1.eliminateDominated)(g, true);
-        (0, vitest_1.expect)(reduced.strategies).toEqual([1, 1]);
-        (0, vitest_1.expect)(reduced.payoffs[0]).toEqual([1]);
-        (0, vitest_1.expect)(reduced.payoffs[1]).toEqual([1]);
-    });
-});
-(0, vitest_1.describe)('game-theory — lemke-howson', () => {
-    (0, vitest_1.it)('lemkeHowson encuentra Nash en matching pennies', () => {
-        const g = (0, game_theory_1.matchingPennies)();
-        const eq = (0, game_theory_1.lemkeHowson)(g, 0);
-        (0, vitest_1.expect)(eq).not.toBeNull();
-        (0, vitest_1.expect)((0, game_theory_1.vectorsApproxEqual)(eq.strategies[0].distribution, [0.5, 0.5], 1e-6)).toBe(true);
-        (0, vitest_1.expect)((0, game_theory_1.vectorsApproxEqual)(eq.strategies[1].distribution, [0.5, 0.5], 1e-6)).toBe(true);
-    });
-    (0, vitest_1.it)('lemkeHowson encuentra Nash en RPS', () => {
-        const g = (0, game_theory_1.rockPaperScissors)();
-        const eq = (0, game_theory_1.lemkeHowson)(g, 0);
-        (0, vitest_1.expect)(eq).not.toBeNull();
-        (0, vitest_1.expect)((0, game_theory_1.vectorsApproxEqual)(eq.strategies[0].distribution, [1 / 3, 1 / 3, 1 / 3], 1e-6)).toBe(true);
-    });
-    (0, vitest_1.it)('lemkeHowson encuentra UN Nash en battle of sexes', () => {
-        const g = (0, game_theory_1.battleOfSexes)();
-        const eq = (0, game_theory_1.lemkeHowson)(g, 0);
-        (0, vitest_1.expect)(eq).not.toBeNull();
-        // Debe ser uno de los 3 Nash conocidos
-        const allEqs = (0, game_theory_1.enumerateAllNash)(g);
-        const match = allEqs.some((e) => (0, game_theory_1.vectorsApproxEqual)(e.strategies[0].distribution, eq.strategies[0].distribution, 1e-5) &&
-            (0, game_theory_1.vectorsApproxEqual)(e.strategies[1].distribution, eq.strategies[1].distribution, 1e-5));
-        (0, vitest_1.expect)(match).toBe(true);
-    });
-});
-(0, vitest_1.describe)('game-theory — expectedPayoff', () => {
-    (0, vitest_1.it)('expectedPayoff es lineal en el perfil mixto', () => {
-        const g = (0, game_theory_1.matchingPennies)();
-        const halfHalf = [mixed(0, [0.5, 0.5]), mixed(1, [0.5, 0.5])];
-        (0, vitest_1.expect)((0, game_theory_1.approxEqual)((0, game_theory_1.expectedPayoff)(g, 0, halfHalf), 0, 1e-9)).toBe(true);
-        (0, vitest_1.expect)((0, game_theory_1.approxEqual)((0, game_theory_1.expectedPayoff)(g, 1, halfHalf), 0, 1e-9)).toBe(true);
-        // Si player 2 juega H puro y player 1 juega 50/50, payoff de player 1 = 0
-        const allH = [mixed(0, [0.5, 0.5]), pure(1, 0, 2)];
-        (0, vitest_1.expect)((0, game_theory_1.approxEqual)((0, game_theory_1.expectedPayoff)(g, 0, allH), 0, 1e-9)).toBe(true);
-        // y payoff de player 2 = 0
-        (0, vitest_1.expect)((0, game_theory_1.approxEqual)((0, game_theory_1.expectedPayoff)(g, 1, allH), 0, 1e-9)).toBe(true);
-    });
-});
-(0, vitest_1.describe)('game-theory — asymmetric NxM games', () => {
-    (0, vitest_1.it)('2x3 con única Nash pura', () => {
-        // Construido para que (0, 1) sea la única Nash:
-        //   P1: fila 0 le da 5,7,3 ; fila 1 le da 4,2,1 → fila 0 domina
-        //   P2: dada fila 0, columna 1 (=7) le da 6 vs 1 y 2 → mejor.
-        const g = (0, game_theory_1.createTwoPlayerGame)([
-            [5, 7, 3],
-            [4, 2, 1],
-        ], [
-            [1, 6, 2],
-            [3, 5, 4],
-        ]);
-        const eqs = (0, game_theory_1.findPureNash)(g);
-        (0, vitest_1.expect)(eqs.length).toBeGreaterThanOrEqual(1);
-        const has01 = eqs.some((e) => e.strategies[0].distribution[0] === 1 && e.strategies[1].distribution[1] === 1);
-        (0, vitest_1.expect)(has01).toBe(true);
-    });
-    (0, vitest_1.it)('enumerateAllNash respeta maxSize cap', () => {
-        const g = (0, game_theory_1.rockPaperScissors)();
-        const cap1 = (0, game_theory_1.enumerateAllNash)(g, 1);
-        // Cap a tamaño 1 → solo busca puros (no hay en RPS)
-        (0, vitest_1.expect)(cap1).toHaveLength(0);
-        const cap3 = (0, game_theory_1.enumerateAllNash)(g, 3);
-        (0, vitest_1.expect)(cap3).toHaveLength(1);
-    });
-});
-(0, vitest_1.describe)('game-theory — N-player simétricos chicos', () => {
-    (0, vitest_1.it)('3-player coordination game: hay Nash puros donde todos coordinan', () => {
-        // 3 jugadores, 2 estrategias cada uno (A=0, B=1).
-        // payoff[player][profile_index]: si todos juegan lo mismo dan 1, sino 0.
-        // perfil index: (s1, s2, s3) → s1*4 + s2*2 + s3
-        const players = 3;
-        const sizes = [2, 2, 2];
-        const payoff = (s1, s2, s3) => (s1 === s2 && s2 === s3 ? 1 : 0);
-        const payoffs = [];
-        for (let p = 0; p < players; p++) {
-            const row = [];
-            for (let s1 = 0; s1 < 2; s1++) {
-                for (let s2 = 0; s2 < 2; s2++) {
-                    for (let s3 = 0; s3 < 2; s3++) {
-                        row.push(payoff(s1, s2, s3));
-                    }
-                }
-            }
-            payoffs.push(row);
-        }
-        const g = { players, strategies: sizes, payoffs };
-        const pures = (0, game_theory_1.findPureNash)(g);
-        // (0,0,0) y (1,1,1) son Nash; (0,0,1) no (player 3 desviaría a 0).
-        (0, vitest_1.expect)(pures.length).toBeGreaterThanOrEqual(2);
-        const allCoord = pures.filter((e) => e.strategies.every((s) => s.distribution[0] === 1) ||
-            e.strategies.every((s) => s.distribution[1] === 1));
-        (0, vitest_1.expect)(allCoord).toHaveLength(2);
-    });
-});
-//# sourceMappingURL=game-theory.test.js.map