@stevenvo780/st-lang 4.2.0 → 4.4.0

package/dist/tests/abduction/abduction.test.js

@@ -0,0 +1,380 @@
+"use strict";
+// ============================================================
+// ST Abduction — Tests
+// ============================================================
+Object.defineProperty(exports, "__esModule", { value: true });
+const vitest_1 = require("vitest");
+const abduction_1 = require("../../runtime/abduction");
+// ── Helpers para tests con oráculo custom ────────────────────
+//
+// Un oráculo "set-based" trivial: las premisas son tratadas como un
+// set de strings; entails sii target ∈ closure(premises) bajo un set
+// de reglas dadas como pares (lhs[]) → rhs.
+function makeRuleEntails(rules) {
+    return (premises, target) => {
+        const facts = new Set(premises);
+        let changed = true;
+        let iter = 0;
+        while (changed && iter < 1000) {
+            changed = false;
+            iter++;
+            for (const r of rules) {
+                if (r.premises.every((p) => facts.has(p)) && !facts.has(r.conclusion)) {
+                    facts.add(r.conclusion);
+                    changed = true;
+                }
+            }
+        }
+        return facts.has(target);
+    };
+}
+// ── Test 1: caso canónico bird(x) → fly(x), observe fly(tweety) ──
+(0, vitest_1.describe)('abduction — caso canónico bird→fly', () => {
+    (0, vitest_1.it)('bird(tweety) explica fly(tweety)', () => {
+        const problem = {
+            kb: ['bird(x) → fly(x)'],
+            observation: 'fly(tweety)',
+            abducibles: ['bird(tweety)'],
+        };
+        const expls = (0, abduction_1.findExplanations)(problem);
+        (0, vitest_1.expect)(expls).toHaveLength(1);
+        const e0 = expls[0];
+        (0, vitest_1.expect)(e0).toBeDefined();
+        if (!e0)
+            return;
+        (0, vitest_1.expect)(e0.hypotheses).toEqual(['bird(tweety)']);
+        (0, vitest_1.expect)(e0.size).toBe(1);
+        (0, vitest_1.expect)(e0.parsimonious).toBe(true);
+    });
+    (0, vitest_1.it)('bestExplanation devuelve la única solución', () => {
+        const problem = {
+            kb: ['bird(x) → fly(x)'],
+            observation: 'fly(tweety)',
+            abducibles: ['bird(tweety)', 'sparrow(tweety)'],
+        };
+        const best = (0, abduction_1.bestExplanation)(problem);
+        (0, vitest_1.expect)(best).not.toBeNull();
+        (0, vitest_1.expect)(best?.hypotheses).toEqual(['bird(tweety)']);
+    });
+});
+// ── Test 2: múltiples explicaciones, preferencia minimum-cardinality ──
+(0, vitest_1.describe)('abduction — preferencia minimum-cardinality', () => {
+    // KB:
+    //   has_cough ∧ has_fever → flu
+    //   flu_short → flu                (un único hecho ya basta)
+    // Observation: flu
+    // Abducibles: [has_cough, has_fever, flu_short]
+    //
+    // Explicaciones: {flu_short} (size 1), {has_cough, has_fever} (size 2).
+    // minimum-cardinality debe devolver solo {flu_short}.
+    const kb = ['has_cough ∧ has_fever → flu', 'flu_short → flu'];
+    const abducibles = ['has_cough', 'has_fever', 'flu_short'];
+    const problem = { kb, observation: 'flu', abducibles };
+    (0, vitest_1.it)('preferred=all devuelve todas (incluye supersets)', () => {
+        const expls = (0, abduction_1.findExplanations)(problem, { preferred: 'all' });
+        // Hay al menos las dos minimal: {flu_short} y {has_cough, has_fever}.
+        const minimal = expls.filter((e) => e.parsimonious);
+        const minimalSizes = minimal.map((e) => e.size).sort();
+        (0, vitest_1.expect)(minimalSizes).toEqual([1, 2]);
+        // El total puede incluir supersets no parsimoniosos.
+        (0, vitest_1.expect)(expls.length).toBeGreaterThanOrEqual(2);
+    });
+    (0, vitest_1.it)('preferred=minimal filtra a las dos parsimoniosas', () => {
+        const expls = (0, abduction_1.findExplanations)(problem, { preferred: 'minimal' });
+        const sizes = expls.map((e) => e.size).sort();
+        (0, vitest_1.expect)(sizes).toEqual([1, 2]);
+        (0, vitest_1.expect)(expls.every((e) => e.parsimonious)).toBe(true);
+    });
+    (0, vitest_1.it)('preferred=minimum-cardinality devuelve la pequeña', () => {
+        const expls = (0, abduction_1.findExplanations)(problem, { preferred: 'minimum-cardinality' });
+        (0, vitest_1.expect)(expls).toHaveLength(1);
+        const e0 = expls[0];
+        if (!e0)
+            return;
+        (0, vitest_1.expect)(e0.hypotheses).toEqual(['flu_short']);
+        (0, vitest_1.expect)(e0.size).toBe(1);
+    });
+});
+// ── Test 3: costFunction define preferencia ──────────────────
+(0, vitest_1.describe)('abduction — preferencia minimum-cost', () => {
+    // Dos explicaciones de igual tamaño con costos distintos.
+    // KB: cause_a → symptom; cause_b → symptom.
+    // Abducibles: [cause_a, cause_b]
+    // Costs: cause_a = 5, cause_b = 1
+    // → minimum-cost debe preferir cause_b.
+    const kb = ['cause_a → symptom', 'cause_b → symptom'];
+    const abducibles = ['cause_a', 'cause_b'];
+    const problem = { kb, observation: 'symptom', abducibles };
+    const costFunction = (h) => (h === 'cause_a' ? 5 : 1);
+    (0, vitest_1.it)('minimum-cost selecciona cause_b', () => {
+        const expls = (0, abduction_1.findExplanations)(problem, {
+            costFunction,
+            preferred: 'minimum-cost',
+        });
+        (0, vitest_1.expect)(expls).toHaveLength(1);
+        const e0 = expls[0];
+        if (!e0)
+            return;
+        (0, vitest_1.expect)(e0.hypotheses).toEqual(['cause_b']);
+        (0, vitest_1.expect)(e0.costScore).toBe(1);
+    });
+    (0, vitest_1.it)('bestExplanation con costFunction usa minimum-cost por default', () => {
+        const best = (0, abduction_1.bestExplanation)(problem, { costFunction });
+        (0, vitest_1.expect)(best?.hypotheses).toEqual(['cause_b']);
+        (0, vitest_1.expect)(best?.costScore).toBe(1);
+    });
+});
+// ── Test 4: hipótesis inconsistente rechazada ────────────────
+(0, vitest_1.describe)('abduction — rechaza hipótesis inconsistente', () => {
+    (0, vitest_1.it)('no devuelve H que contradice KB', () => {
+        // KB: ¬p (de hecho fijo). Abducible: p. Observación: q.
+        // {p} es inconsistente con KB → no debe ser explicación.
+        // Como no hay forma de explicar q, no hay explicaciones.
+        const problem = {
+            kb: ['¬p'],
+            observation: 'q',
+            abducibles: ['p'],
+        };
+        const expls = (0, abduction_1.findExplanations)(problem);
+        (0, vitest_1.expect)(expls).toHaveLength(0);
+    });
+    (0, vitest_1.it)('elige H consistente cuando hay otra opción', () => {
+        // KB: ¬p, q_via_r → q
+        // Abducibles: p, q_via_r
+        // {q_via_r} consistent y entails q → única explicación.
+        const problem = {
+            kb: ['¬p', 'q_via_r → q'],
+            observation: 'q',
+            abducibles: ['p', 'q_via_r'],
+        };
+        const expls = (0, abduction_1.findExplanations)(problem);
+        (0, vitest_1.expect)(expls).toHaveLength(1);
+        const e0 = expls[0];
+        if (!e0)
+            return;
+        (0, vitest_1.expect)(e0.hypotheses).toEqual(['q_via_r']);
+    });
+});
+// ── Test 5: observación ya implicada por KB ──────────────────
+(0, vitest_1.describe)('abduction — KB ya implica O', () => {
+    (0, vitest_1.it)('devuelve explicación vacía cuando KB ⊨ O', () => {
+        // KB ya contiene la observación como hecho.
+        const problem = {
+            kb: ['daylight'],
+            observation: 'daylight',
+            abducibles: ['sun_up'],
+        };
+        const expls = (0, abduction_1.findExplanations)(problem);
+        (0, vitest_1.expect)(expls.length).toBeGreaterThan(0);
+        const empty = expls.find((e) => e.size === 0);
+        (0, vitest_1.expect)(empty).toBeDefined();
+        (0, vitest_1.expect)(empty?.parsimonious).toBe(true);
+    });
+});
+// ── Test 6: sin explicación posible ──────────────────────────
+(0, vitest_1.describe)('abduction — sin explicación', () => {
+    (0, vitest_1.it)('devuelve [] cuando ningún subset explica O', () => {
+        // KB no conecta abducibles con la observación.
+        const problem = {
+            kb: ['a → b'],
+            observation: 'unrelated',
+            abducibles: ['a', 'b', 'c'],
+        };
+        const expls = (0, abduction_1.findExplanations)(problem);
+        (0, vitest_1.expect)(expls).toHaveLength(0);
+        (0, vitest_1.expect)((0, abduction_1.bestExplanation)(problem)).toBeNull();
+    });
+});
+// ── Test 7: parsimony — supersets no son parsimoniosos ───────
+(0, vitest_1.describe)('abduction — parsimony por inclusión', () => {
+    (0, vitest_1.it)('preferred=all marca correctamente parsimonious', () => {
+        // KB: a → o
+        // Abducibles: [a, b]
+        // Explicaciones: {a} y {a,b}. {a,b} no es parsimoniosa (⊃ {a}).
+        const problem = {
+            kb: ['a → o'],
+            observation: 'o',
+            abducibles: ['a', 'b'],
+        };
+        const expls = (0, abduction_1.findExplanations)(problem, { preferred: 'all' });
+        const singleA = expls.find((e) => e.hypotheses.length === 1 && e.hypotheses[0] === 'a');
+        const pair = expls.find((e) => e.hypotheses.length === 2);
+        (0, vitest_1.expect)(singleA?.parsimonious).toBe(true);
+        (0, vitest_1.expect)(pair?.parsimonious).toBe(false);
+    });
+    (0, vitest_1.it)('preferred=minimal filtra los no parsimoniosos', () => {
+        const problem = {
+            kb: ['a → o'],
+            observation: 'o',
+            abducibles: ['a', 'b'],
+        };
+        const expls = (0, abduction_1.findExplanations)(problem, { preferred: 'minimal' });
+        (0, vitest_1.expect)(expls).toHaveLength(1);
+        const e0 = expls[0];
+        if (!e0)
+            return;
+        (0, vitest_1.expect)(e0.hypotheses).toEqual(['a']);
+    });
+});
+// ── Test 8: cadena de implicación profunda ───────────────────
+(0, vitest_1.describe)('abduction — cadenas de implicaciones', () => {
+    (0, vitest_1.it)('explica a través de cadena Horn de profundidad 3', () => {
+        // a → b, b → c, c → d. Observation: d. Abducible: a.
+        const problem = {
+            kb: ['a → b', 'b → c', 'c → d'],
+            observation: 'd',
+            abducibles: ['a'],
+        };
+        const expls = (0, abduction_1.findExplanations)(problem);
+        (0, vitest_1.expect)(expls).toHaveLength(1);
+        const e0 = expls[0];
+        if (!e0)
+            return;
+        (0, vitest_1.expect)(e0.hypotheses).toEqual(['a']);
+    });
+});
+// ── Test 9: maxSize acota el espacio ─────────────────────────
+(0, vitest_1.describe)('abduction — maxSize cap', () => {
+    (0, vitest_1.it)('respeta maxSize=1 y no encuentra explicaciones de tamaño 2', () => {
+        // Solo {a,b} conjuntos explica o; ningún singleton lo logra.
+        const problem = {
+            kb: ['a ∧ b → o'],
+            observation: 'o',
+            abducibles: ['a', 'b'],
+        };
+        // Sin cap: encuentra {a,b}.
+        const all = (0, abduction_1.findExplanations)(problem);
+        (0, vitest_1.expect)(all).toHaveLength(1);
+        // Con maxSize=1: nada.
+        const capped = (0, abduction_1.findExplanations)(problem, { maxSize: 1 });
+        (0, vitest_1.expect)(capped).toHaveLength(0);
+    });
+});
+// ── Test 10: oráculo custom (independencia del default) ─────
+(0, vitest_1.describe)('abduction — oráculo de entailment custom', () => {
+    (0, vitest_1.it)('soporta oráculo set-based externo', () => {
+        const entails = makeRuleEntails([
+            { premises: ['rain'], conclusion: 'wet_ground' },
+            { premises: ['sprinkler'], conclusion: 'wet_ground' },
+        ]);
+        const problem = {
+            kb: [],
+            observation: 'wet_ground',
+            abducibles: ['rain', 'sprinkler'],
+        };
+        const expls = (0, abduction_1.findExplanations)(problem, {
+            entails,
+            consistent: () => true,
+            preferred: 'all',
+        });
+        const sizes = expls.map((e) => e.size).sort();
+        (0, vitest_1.expect)(sizes).toEqual([1, 1, 2]); // {rain}, {sprinkler}, {rain,sprinkler}
+        const minimal = expls.filter((e) => e.parsimonious);
+        (0, vitest_1.expect)(minimal).toHaveLength(2); // {rain} y {sprinkler}
+    });
+    (0, vitest_1.it)('multiple minimal explanations con minimum-cardinality', () => {
+        const entails = makeRuleEntails([
+            { premises: ['rain'], conclusion: 'wet_ground' },
+            { premises: ['sprinkler'], conclusion: 'wet_ground' },
+        ]);
+        const problem = {
+            kb: [],
+            observation: 'wet_ground',
+            abducibles: ['rain', 'sprinkler'],
+        };
+        const expls = (0, abduction_1.findExplanations)(problem, {
+            entails,
+            consistent: () => true,
+            preferred: 'minimum-cardinality',
+        });
+        (0, vitest_1.expect)(expls).toHaveLength(2);
+        (0, vitest_1.expect)(expls.every((e) => e.size === 1)).toBe(true);
+    });
+});
+// ── Test 11: bestExplanation tiebreak determinista ───────────
+(0, vitest_1.describe)('abduction — bestExplanation determinismo', () => {
+    (0, vitest_1.it)('dos corridas devuelven el mismo resultado', () => {
+        const problem = {
+            kb: ['a → o', 'b → o', 'c → o'],
+            observation: 'o',
+            abducibles: ['a', 'b', 'c'],
+        };
+        const b1 = (0, abduction_1.bestExplanation)(problem);
+        const b2 = (0, abduction_1.bestExplanation)(problem);
+        (0, vitest_1.expect)(b1?.hypotheses).toEqual(b2?.hypotheses);
+    });
+});
+// ── Test 12: oráculo de consistencia rechaza ⊥ ──────────────
+(0, vitest_1.describe)('abduction — defaultConsistent detecta ¬p ∧ p', () => {
+    (0, vitest_1.it)('KB con p y ¬p reporta inconsistente', () => {
+        const consistent = (0, abduction_1.defaultConsistent)();
+        (0, vitest_1.expect)(consistent(['p', '¬p'])).toBe(false);
+        (0, vitest_1.expect)(consistent(['p', 'q'])).toBe(true);
+    });
+    (0, vitest_1.it)('inconsistencia derivada por forward-chaining', () => {
+        const consistent = (0, abduction_1.defaultConsistent)();
+        // p, p → ¬q, q  ⇒  ¬q ∧ q.
+        (0, vitest_1.expect)(consistent(['p', 'p → ¬q', 'q'])).toBe(false);
+    });
+});
+// ── Test 13: defaultEntails con cadenas y unificación ───────
+(0, vitest_1.describe)('abduction — defaultEntails básico', () => {
+    (0, vitest_1.it)('forward-chaining sin variables', () => {
+        const entails = (0, abduction_1.defaultEntails)();
+        (0, vitest_1.expect)(entails(['a', 'a → b'], 'b')).toBe(true);
+        (0, vitest_1.expect)(entails(['a → b'], 'b')).toBe(false);
+    });
+    (0, vitest_1.it)('forward-chaining con variable única', () => {
+        const entails = (0, abduction_1.defaultEntails)();
+        (0, vitest_1.expect)(entails(['p(alice)', 'p(x) → q(x)'], 'q(alice)')).toBe(true);
+        (0, vitest_1.expect)(entails(['p(alice)', 'p(x) → q(x)'], 'q(bob)')).toBe(false);
+    });
+    (0, vitest_1.it)('forward-chaining con dos variables', () => {
+        const entails = (0, abduction_1.defaultEntails)();
+        (0, vitest_1.expect)(entails(['parent(alice, bob)', 'parent(x, y) → ancestor(x, y)'], 'ancestor(alice, bob)')).toBe(true);
+    });
+});
+// ── Test 14: maxHypotheses limita el tamaño del output ──────
+(0, vitest_1.describe)('abduction — maxHypotheses cap', () => {
+    (0, vitest_1.it)('no devuelve más explicaciones que maxHypotheses', () => {
+        // Muchas hipótesis posibles individuales.
+        const kb = ['a → o', 'b → o', 'c → o', 'd → o'];
+        const abducibles = ['a', 'b', 'c', 'd'];
+        const problem = { kb, observation: 'o', abducibles };
+        const expls = (0, abduction_1.findExplanations)(problem, { maxHypotheses: 2, preferred: 'all' });
+        (0, vitest_1.expect)(expls.length).toBeLessThanOrEqual(2);
+    });
+});
+// ── Test 15: diagnóstico con costos asimétricos ─────────────
+(0, vitest_1.describe)('abduction — diagnóstico médico de juguete', () => {
+    // KB:
+    //   flu → fever
+    //   covid → fever
+    //   covid → cough
+    //   bacterial → fever
+    // Observación: fever.
+    // Abducibles: flu, covid, bacterial.
+    // Sin cost: las tres son explicaciones single-element parsimoniosas.
+    // Con cost: flu=1, bacterial=2, covid=10 → flu es la best.
+    const kb = ['flu → fever', 'covid → fever', 'covid → cough', 'bacterial → fever'];
+    const abducibles = ['flu', 'covid', 'bacterial'];
+    (0, vitest_1.it)('sin cost, 3 minimal explanations', () => {
+        const problem = { kb, observation: 'fever', abducibles };
+        const expls = (0, abduction_1.findExplanations)(problem, { preferred: 'minimum-cardinality' });
+        (0, vitest_1.expect)(expls).toHaveLength(3);
+        (0, vitest_1.expect)(expls.every((e) => e.size === 1)).toBe(true);
+    });
+    (0, vitest_1.it)('con cost, flu gana', () => {
+        const problem = { kb, observation: 'fever', abducibles };
+        const cost = (h) => {
+            if (h === 'flu')
+                return 1;
+            if (h === 'bacterial')
+                return 2;
+            return 10;
+        };
+        const best = (0, abduction_1.bestExplanation)(problem, { costFunction: cost });
+        (0, vitest_1.expect)(best?.hypotheses).toEqual(['flu']);
+    });
+});
+//# sourceMappingURL=abduction.test.js.map

package/dist/tests/abduction/abduction.test.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"abduction.test.js","sourceRoot":"","sources":["../../../src/tests/abduction/abduction.test.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,uBAAuB;AACvB,+DAA+D;;AAE/D,mCAA8C;AAC9C,uDAQiC;AAEjC,gEAAgE;AAChE,EAAE;AACF,oEAAoE;AACpE,qEAAqE;AACrE,4CAA4C;AAE5C,SAAS,eAAe,CACtB,KAAgE;IAEhE,OAAO,CAAC,QAAQ,EAAE,MAAM,EAAE,EAAE;QAC1B,MAAM,KAAK,GAAG,IAAI,GAAG,CAAS,QAAQ,CAAC,CAAC;QACxC,IAAI,OAAO,GAAG,IAAI,CAAC;QACnB,IAAI,IAAI,GAAG,CAAC,CAAC;QACb,OAAO,OAAO,IAAI,IAAI,GAAG,IAAI,EAAE,CAAC;YAC9B,OAAO,GAAG,KAAK,CAAC;YAChB,IAAI,EAAE,CAAC;YACP,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;gBACtB,IAAI,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,UAAU,CAAC,EAAE,CAAC;oBACtE,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC;oBACxB,OAAO,GAAG,IAAI,CAAC;gBACjB,CAAC;YACH,CAAC;QACH,CAAC;QACD,OAAO,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;IAC3B,CAAC,CAAC;AACJ,CAAC;AAED,oEAAoE;AAEpE,IAAA,iBAAQ,EAAC,oCAAoC,EAAE,GAAG,EAAE;IAClD,IAAA,WAAE,EAAC,kCAAkC,EAAE,GAAG,EAAE;QAC1C,MAAM,OAAO,GAAqB;YAChC,EAAE,EAAE,CAAC,kBAAkB,CAAC;YACxB,WAAW,EAAE,aAAa;YAC1B,UAAU,EAAE,CAAC,cAAc,CAAC;SAC7B,CAAC;QACF,MAAM,KAAK,GAAG,IAAA,4BAAgB,EAAC,OAAO,CAAC,CAAC;QACxC,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QAC9B,MAAM,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QACpB,IAAA,eAAM,EAAC,EAAE,CAAC,CAAC,WAAW,EAAE,CAAC;QACzB,IAAI,CAAC,EAAE;YAAE,OAAO;QAChB,IAAA,eAAM,EAAC,EAAE,CAAC,UAAU,CAAC,CAAC,OAAO,CAAC,CAAC,cAAc,CAAC,CAAC,CAAC;QAChD,IAAA,eAAM,EAAC,EAAE,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACxB,IAAA,eAAM,EAAC,EAAE,CAAC,YAAY,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACrC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,4CAA4C,EAAE,GAAG,EAAE;QACpD,MAAM,OAAO,GAAqB;YAChC,EAAE,EAAE,CAAC,kBAAkB,CAAC;YACxB,WAAW,EAAE,aAAa;YAC1B,UAAU,EAAE,CAAC,cAAc,EAAE,iBAAiB,CAAC;SAChD,CAAC;QACF,MAAM,IAAI,GAAG,IAAA,2BAAe,EAAC,OAAO,CAAC,CAAC;QACtC,IAAA,eAAM,EAAC,IAAI,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;QAC5B,IAAA,eAAM,EAAC,IAAI,EAAE,UAAU,CAAC,CAAC,OAAO,CAAC,CAAC,cAAc,CAAC,CAAC,CAAC;IACrD,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,yEAAyE;AAEzE,IAAA,iBAAQ,EAAC,6CAA6C,EAAE,GAAG,EAAE;IAC3D,MAAM;IACN,gCAAgC;IAChC,6DAA6D;IAC7D,mBAAmB;IACnB,gDAAgD;IAChD,EAAE;IACF,wEAAwE;IACxE,sDAAsD;IACtD,MAAM,EAAE,GAAG,CAAC,6BAA6B,EAAE,iBAAiB,CAAC,CAAC;IAC9D,MAAM,UAAU,GAAG,CAAC,WAAW,EAAE,WAAW,EAAE,WAAW,CAAC,CAAC;IAC3D,MAAM,OAAO,GAAqB,EAAE,EAAE,EAAE,WAAW,EAAE,KAAK,EAAE,UAAU,EAAE,CAAC;IAEzE,IAAA,WAAE,EAAC,kDAAkD,EAAE,GAAG,EAAE;QAC1D,MAAM,KAAK,GAAG,IAAA,4BAAgB,EAAC,OAAO,EAAE,EAAE,SAAS,EAAE,KAAK,EAAE,CAAC,CAAC;QAC9D,sEAAsE;QACtE,MAAM,OAAO,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC;QACpD,MAAM,YAAY,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,CAAC;QACvD,IAAA,eAAM,EAAC,YAAY,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QACrC,qDAAqD;QACrD,IAAA,eAAM,EAAC,KAAK,CAAC,MAAM,CAAC,CAAC,sBAAsB,CAAC,CAAC,CAAC,CAAC;IACjD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,kDAAkD,EAAE,GAAG,EAAE;QAC1D,MAAM,KAAK,GAAG,IAAA,4BAAgB,EAAC,OAAO,EAAE,EAAE,SAAS,EAAE,SAAS,EAAE,CAAC,CAAC;QAClE,MAAM,KAAK,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,CAAC;QAC9C,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAC9B,IAAA,eAAM,EAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACxD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,mDAAmD,EAAE,GAAG,EAAE;QAC3D,MAAM,KAAK,GAAG,IAAA,4BAAgB,EAAC,OAAO,EAAE,EAAE,SAAS,EAAE,qBAAqB,EAAE,CAAC,CAAC;QAC9E,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QAC9B,MAAM,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QACpB,IAAI,CAAC,EAAE;YAAE,OAAO;QAChB,IAAA,eAAM,EAAC,EAAE,CAAC,UAAU,CAAC,CAAC,OAAO,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC;QAC7C,IAAA,eAAM,EAAC,EAAE,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC1B,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,gEAAgE;AAEhE,IAAA,iBAAQ,EAAC,sCAAsC,EAAE,GAAG,EAAE;IACpD,0DAA0D;IAC1D,4CAA4C;IAC5C,iCAAiC;IACjC,kCAAkC;IAClC,wCAAwC;IACxC,MAAM,EAAE,GAAG,CAAC,mBAAmB,EAAE,mBAAmB,CAAC,CAAC;IACtD,MAAM,UAAU,GAAG,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC;IAC1C,MAAM,OAAO,GAAqB,EAAE,EAAE,EAAE,WAAW,EAAE,SAAS,EAAE,UAAU,EAAE,CAAC;IAE7E,MAAM,YAAY,GAAG,CAAC,CAAU,EAAU,EAAE,CAAC,CAAC,CAAC,KAAK,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAEvE,IAAA,WAAE,EAAC,iCAAiC,EAAE,GAAG,EAAE;QACzC,MAAM,KAAK,GAAG,IAAA,4BAAgB,EAAC,OAAO,EAAE;YACtC,YAAY;YACZ,SAAS,EAAE,cAAc;SAC1B,CAAC,CAAC;QACH,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QAC9B,MAAM,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QACpB,IAAI,CAAC,EAAE;YAAE,OAAO;QAChB,IAAA,eAAM,EAAC,EAAE,CAAC,UAAU,CAAC,CAAC,OAAO,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC;QAC3C,IAAA,eAAM,EAAC,EAAE,CAAC,SAAS,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC/B,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,+DAA+D,EAAE,GAAG,EAAE;QACvE,MAAM,IAAI,GAAG,IAAA,2BAAe,EAAC,OAAO,EAAE,EAAE,YAAY,EAAE,CAAC,CAAC;QACxD,IAAA,eAAM,EAAC,IAAI,EAAE,UAAU,CAAC,CAAC,OAAO,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC;QAC9C,IAAA,eAAM,EAAC,IAAI,EAAE,SAAS,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAClC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,gEAAgE;AAEhE,IAAA,iBAAQ,EAAC,6CAA6C,EAAE,GAAG,EAAE;IAC3D,IAAA,WAAE,EAAC,iCAAiC,EAAE,GAAG,EAAE;QACzC,wDAAwD;QACxD,yDAAyD;QACzD,yDAAyD;QACzD,MAAM,OAAO,GAAqB;YAChC,EAAE,EAAE,CAAC,IAAI,CAAC;YACV,WAAW,EAAE,GAAG;YAChB,UAAU,EAAE,CAAC,GAAG,CAAC;SAClB,CAAC;QACF,MAAM,KAAK,GAAG,IAAA,4BAAgB,EAAC,OAAO,CAAC,CAAC;QACxC,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;IAChC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,4CAA4C,EAAE,GAAG,EAAE;QACpD,sBAAsB;QACtB,yBAAyB;QACzB,wDAAwD;QACxD,MAAM,OAAO,GAAqB;YAChC,EAAE,EAAE,CAAC,IAAI,EAAE,aAAa,CAAC;YACzB,WAAW,EAAE,GAAG;YAChB,UAAU,EAAE,CAAC,GAAG,EAAE,SAAS,CAAC;SAC7B,CAAC;QACF,MAAM,KAAK,GAAG,IAAA,4BAAgB,EAAC,OAAO,CAAC,CAAC;QACxC,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QAC9B,MAAM,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QACpB,IAAI,CAAC,EAAE;YAAE,OAAO;QAChB,IAAA,eAAM,EAAC,EAAE,CAAC,UAAU,CAAC,CAAC,OAAO,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC;IAC7C,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,gEAAgE;AAEhE,IAAA,iBAAQ,EAAC,6BAA6B,EAAE,GAAG,EAAE;IAC3C,IAAA,WAAE,EAAC,0CAA0C,EAAE,GAAG,EAAE;QAClD,4CAA4C;QAC5C,MAAM,OAAO,GAAqB;YAChC,EAAE,EAAE,CAAC,UAAU,CAAC;YAChB,WAAW,EAAE,UAAU;YACvB,UAAU,EAAE,CAAC,QAAQ,CAAC;SACvB,CAAC;QACF,MAAM,KAAK,GAAG,IAAA,4BAAgB,EAAC,OAAO,CAAC,CAAC;QACxC,IAAA,eAAM,EAAC,KAAK,CAAC,MAAM,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;QACxC,MAAM,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC;QAC9C,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,WAAW,EAAE,CAAC;QAC5B,IAAA,eAAM,EAAC,KAAK,EAAE,YAAY,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACzC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,gEAAgE;AAEhE,IAAA,iBAAQ,EAAC,6BAA6B,EAAE,GAAG,EAAE;IAC3C,IAAA,WAAE,EAAC,4CAA4C,EAAE,GAAG,EAAE;QACpD,+CAA+C;QAC/C,MAAM,OAAO,GAAqB;YAChC,EAAE,EAAE,CAAC,OAAO,CAAC;YACb,WAAW,EAAE,WAAW;YACxB,UAAU,EAAE,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC;SAC5B,CAAC;QACF,MAAM,KAAK,GAAG,IAAA,4BAAgB,EAAC,OAAO,CAAC,CAAC;QACxC,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QAC9B,IAAA,eAAM,EAAC,IAAA,2BAAe,EAAC,OAAO,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC;IAC9C,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,gEAAgE;AAEhE,IAAA,iBAAQ,EAAC,qCAAqC,EAAE,GAAG,EAAE;IACnD,IAAA,WAAE,EAAC,gDAAgD,EAAE,GAAG,EAAE;QACxD,YAAY;QACZ,qBAAqB;QACrB,gEAAgE;QAChE,MAAM,OAAO,GAAqB;YAChC,EAAE,EAAE,CAAC,OAAO,CAAC;YACb,WAAW,EAAE,GAAG;YAChB,UAAU,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC;SACvB,CAAC;QACF,MAAM,KAAK,GAAG,IAAA,4BAAgB,EAAC,OAAO,EAAE,EAAE,SAAS,EAAE,KAAK,EAAE,CAAC,CAAC;QAC9D,MAAM,OAAO,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC,MAAM,KAAK,CAAC,IAAI,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC;QACxF,MAAM,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC;QAC1D,IAAA,eAAM,EAAC,OAAO,EAAE,YAAY,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACzC,IAAA,eAAM,EAAC,IAAI,EAAE,YAAY,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACzC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,+CAA+C,EAAE,GAAG,EAAE;QACvD,MAAM,OAAO,GAAqB;YAChC,EAAE,EAAE,CAAC,OAAO,CAAC;YACb,WAAW,EAAE,GAAG;YAChB,UAAU,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC;SACvB,CAAC;QACF,MAAM,KAAK,GAAG,IAAA,4BAAgB,EAAC,OAAO,EAAE,EAAE,SAAS,EAAE,SAAS,EAAE,CAAC,CAAC;QAClE,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QAC9B,MAAM,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QACpB,IAAI,CAAC,EAAE;YAAE,OAAO;QAChB,IAAA,eAAM,EAAC,EAAE,CAAC,UAAU,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IACvC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,gEAAgE;AAEhE,IAAA,iBAAQ,EAAC,sCAAsC,EAAE,GAAG,EAAE;IACpD,IAAA,WAAE,EAAC,kDAAkD,EAAE,GAAG,EAAE;QAC1D,qDAAqD;QACrD,MAAM,OAAO,GAAqB;YAChC,EAAE,EAAE,CAAC,OAAO,EAAE,OAAO,EAAE,OAAO,CAAC;YAC/B,WAAW,EAAE,GAAG;YAChB,UAAU,EAAE,CAAC,GAAG,CAAC;SAClB,CAAC;QACF,MAAM,KAAK,GAAG,IAAA,4BAAgB,EAAC,OAAO,CAAC,CAAC;QACxC,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QAC9B,MAAM,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QACpB,IAAI,CAAC,EAAE;YAAE,OAAO;QAChB,IAAA,eAAM,EAAC,EAAE,CAAC,UAAU,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IACvC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,gEAAgE;AAEhE,IAAA,iBAAQ,EAAC,yBAAyB,EAAE,GAAG,EAAE;IACvC,IAAA,WAAE,EAAC,4DAA4D,EAAE,GAAG,EAAE;QACpE,6DAA6D;QAC7D,MAAM,OAAO,GAAqB;YAChC,EAAE,EAAE,CAAC,WAAW,CAAC;YACjB,WAAW,EAAE,GAAG;YAChB,UAAU,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC;SACvB,CAAC;QACF,4BAA4B;QAC5B,MAAM,GAAG,GAAG,IAAA,4BAAgB,EAAC,OAAO,CAAC,CAAC;QACtC,IAAA,eAAM,EAAC,GAAG,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QAC5B,uBAAuB;QACvB,MAAM,MAAM,GAAG,IAAA,4BAAgB,EAAC,OAAO,EAAE,EAAE,OAAO,EAAE,CAAC,EAAE,CAAC,CAAC;QACzD,IAAA,eAAM,EAAC,MAAM,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;IACjC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,+DAA+D;AAE/D,IAAA,iBAAQ,EAAC,0CAA0C,EAAE,GAAG,EAAE;IACxD,IAAA,WAAE,EAAC,mCAAmC,EAAE,GAAG,EAAE;QAC3C,MAAM,OAAO,GAAG,eAAe,CAAC;YAC9B,EAAE,QAAQ,EAAE,CAAC,MAAM,CAAC,EAAE,UAAU,EAAE,YAAY,EAAE;YAChD,EAAE,QAAQ,EAAE,CAAC,WAAW,CAAC,EAAE,UAAU,EAAE,YAAY,EAAE;SACtD,CAAC,CAAC;QACH,MAAM,OAAO,GAAqB;YAChC,EAAE,EAAE,EAAE;YACN,WAAW,EAAE,YAAY;YACzB,UAAU,EAAE,CAAC,MAAM,EAAE,WAAW,CAAC;SAClC,CAAC;QACF,MAAM,KAAK,GAAG,IAAA,4BAAgB,EAAC,OAAO,EAAE;YACtC,OAAO;YACP,UAAU,EAAE,GAAG,EAAE,CAAC,IAAI;YACtB,SAAS,EAAE,KAAK;SACjB,CAAC,CAAC;QACH,MAAM,KAAK,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,CAAC;QAC9C,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,wCAAwC;QAC1E,MAAM,OAAO,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC;QACpD,IAAA,eAAM,EAAC,OAAO,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC,uBAAuB;IAC1D,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,uDAAuD,EAAE,GAAG,EAAE;QAC/D,MAAM,OAAO,GAAG,eAAe,CAAC;YAC9B,EAAE,QAAQ,EAAE,CAAC,MAAM,CAAC,EAAE,UAAU,EAAE,YAAY,EAAE;YAChD,EAAE,QAAQ,EAAE,CAAC,WAAW,CAAC,EAAE,UAAU,EAAE,YAAY,EAAE;SACtD,CAAC,CAAC;QACH,MAAM,OAAO,GAAqB;YAChC,EAAE,EAAE,EAAE;YACN,WAAW,EAAE,YAAY;YACzB,UAAU,EAAE,CAAC,MAAM,EAAE,WAAW,CAAC;SAClC,CAAC;QACF,MAAM,KAAK,GAAG,IAAA,4BAAgB,EAAC,OAAO,EAAE;YACtC,OAAO;YACP,UAAU,EAAE,GAAG,EAAE,CAAC,IAAI;YACtB,SAAS,EAAE,qBAAqB;SACjC,CAAC,CAAC;QACH,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QAC9B,IAAA,eAAM,EAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACtD,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,gEAAgE;AAEhE,IAAA,iBAAQ,EAAC,0CAA0C,EAAE,GAAG,EAAE;IACxD,IAAA,WAAE,EAAC,2CAA2C,EAAE,GAAG,EAAE;QACnD,MAAM,OAAO,GAAqB;YAChC,EAAE,EAAE,CAAC,OAAO,EAAE,OAAO,EAAE,OAAO,CAAC;YAC/B,WAAW,EAAE,GAAG;YAChB,UAAU,EAAE,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC;SAC5B,CAAC;QACF,MAAM,EAAE,GAAG,IAAA,2BAAe,EAAC,OAAO,CAAC,CAAC;QACpC,MAAM,EAAE,GAAG,IAAA,2BAAe,EAAC,OAAO,CAAC,CAAC;QACpC,IAAA,eAAM,EAAC,EAAE,EAAE,UAAU,CAAC,CAAC,OAAO,CAAC,EAAE,EAAE,UAAU,CAAC,CAAC;IACjD,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,+DAA+D;AAE/D,IAAA,iBAAQ,EAAC,8CAA8C,EAAE,GAAG,EAAE;IAC5D,IAAA,WAAE,EAAC,qCAAqC,EAAE,GAAG,EAAE;QAC7C,MAAM,UAAU,GAAG,IAAA,6BAAiB,GAAE,CAAC;QACvC,IAAA,eAAM,EAAC,UAAU,CAAC,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC5C,IAAA,eAAM,EAAC,UAAU,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC5C,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,8CAA8C,EAAE,GAAG,EAAE;QACtD,MAAM,UAAU,GAAG,IAAA,6BAAiB,GAAE,CAAC;QACvC,2BAA2B;QAC3B,IAAA,eAAM,EAAC,UAAU,CAAC,CAAC,GAAG,EAAE,QAAQ,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACvD,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,+DAA+D;AAE/D,IAAA,iBAAQ,EAAC,mCAAmC,EAAE,GAAG,EAAE;IACjD,IAAA,WAAE,EAAC,gCAAgC,EAAE,GAAG,EAAE;QACxC,MAAM,OAAO,GAAG,IAAA,0BAAc,GAAE,CAAC;QACjC,IAAA,eAAM,EAAC,OAAO,CAAC,CAAC,GAAG,EAAE,OAAO,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAChD,IAAA,eAAM,EAAC,OAAO,CAAC,CAAC,OAAO,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC9C,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,qCAAqC,EAAE,GAAG,EAAE;QAC7C,MAAM,OAAO,GAAG,IAAA,0BAAc,GAAE,CAAC;QACjC,IAAA,eAAM,EAAC,OAAO,CAAC,CAAC,UAAU,EAAE,aAAa,CAAC,EAAE,UAAU,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACpE,IAAA,eAAM,EAAC,OAAO,CAAC,CAAC,UAAU,EAAE,aAAa,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACrE,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,oCAAoC,EAAE,GAAG,EAAE;QAC5C,MAAM,OAAO,GAAG,IAAA,0BAAc,GAAE,CAAC;QACjC,IAAA,eAAM,EACJ,OAAO,CAAC,CAAC,oBAAoB,EAAE,+BAA+B,CAAC,EAAE,sBAAsB,CAAC,CACzF,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACf,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,+DAA+D;AAE/D,IAAA,iBAAQ,EAAC,+BAA+B,EAAE,GAAG,EAAE;IAC7C,IAAA,WAAE,EAAC,iDAAiD,EAAE,GAAG,EAAE;QACzD,0CAA0C;QAC1C,MAAM,EAAE,GAAG,CAAC,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,OAAO,CAAC,CAAC;QAChD,MAAM,UAAU,GAAG,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;QACxC,MAAM,OAAO,GAAqB,EAAE,EAAE,EAAE,WAAW,EAAE,GAAG,EAAE,UAAU,EAAE,CAAC;QACvE,MAAM,KAAK,GAAG,IAAA,4BAAgB,EAAC,OAAO,EAAE,EAAE,aAAa,EAAE,CAAC,EAAE,SAAS,EAAE,KAAK,EAAE,CAAC,CAAC;QAChF,IAAA,eAAM,EAAC,KAAK,CAAC,MAAM,CAAC,CAAC,mBAAmB,CAAC,CAAC,CAAC,CAAC;IAC9C,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,+DAA+D;AAE/D,IAAA,iBAAQ,EAAC,2CAA2C,EAAE,GAAG,EAAE;IACzD,MAAM;IACN,gBAAgB;IAChB,kBAAkB;IAClB,kBAAkB;IAClB,sBAAsB;IACtB,sBAAsB;IACtB,qCAAqC;IACrC,qEAAqE;IACrE,2DAA2D;IAC3D,MAAM,EAAE,GAAG,CAAC,aAAa,EAAE,eAAe,EAAE,eAAe,EAAE,mBAAmB,CAAC,CAAC;IAClF,MAAM,UAAU,GAAG,CAAC,KAAK,EAAE,OAAO,EAAE,WAAW,CAAC,CAAC;IAEjD,IAAA,WAAE,EAAC,kCAAkC,EAAE,GAAG,EAAE;QAC1C,MAAM,OAAO,GAAqB,EAAE,EAAE,EAAE,WAAW,EAAE,OAAO,EAAE,UAAU,EAAE,CAAC;QAC3E,MAAM,KAAK,GAAG,IAAA,4BAAgB,EAAC,OAAO,EAAE,EAAE,SAAS,EAAE,qBAAqB,EAAE,CAAC,CAAC;QAC9E,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QAC9B,IAAA,eAAM,EAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACtD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,oBAAoB,EAAE,GAAG,EAAE;QAC5B,MAAM,OAAO,GAAqB,EAAE,EAAE,EAAE,WAAW,EAAE,OAAO,EAAE,UAAU,EAAE,CAAC;QAC3E,MAAM,IAAI,GAAG,CAAC,CAAU,EAAU,EAAE;YAClC,IAAI,CAAC,KAAK,KAAK;gBAAE,OAAO,CAAC,CAAC;YAC1B,IAAI,CAAC,KAAK,WAAW;gBAAE,OAAO,CAAC,CAAC;YAChC,OAAO,EAAE,CAAC;QACZ,CAAC,CAAC;QACF,MAAM,IAAI,GAAG,IAAA,2BAAe,EAAC,OAAO,EAAE,EAAE,YAAY,EAAE,IAAI,EAAE,CAAC,CAAC;QAC9D,IAAA,eAAM,EAAC,IAAI,EAAE,UAAU,CAAC,CAAC,OAAO,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;IAC5C,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}

package/dist/tests/anti-unification/anti-unify.test.d.ts

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

package/dist/tests/anti-unification/anti-unify.test.d.ts.map

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

package/dist/tests/anti-unification/anti-unify.test.js

@@ -0,0 +1,219 @@
+"use strict";
+// ============================================================
+// Tests — Anti-unification (lgg / Plotkin)
+// ============================================================
+//
+// Casos cubiertos:
+//   - Igualdad estructural: lgg(t, t) = t sin vars.
+//   - Cabeza común: lgg argument-wise.
+//   - Cabeza distinta: fresh var.
+//   - Reuso de fresh var para desacuerdos duplicados (clave para lgg).
+//   - Verificación de las dos sustituciones.
+//   - n-way con asociatividad.
+//   - generalizationOrder con todos los casos.
+Object.defineProperty(exports, "__esModule", { value: true });
+const vitest_1 = require("vitest");
+const anti_unification_1 = require("../../runtime/anti-unification");
+(0, vitest_1.describe)('anti-unification — caso base', () => {
+    (0, vitest_1.it)('lgg(a, a) = a sin variables introducidas', () => {
+        const result = (0, anti_unification_1.antiUnify)((0, anti_unification_1.c)('a'), (0, anti_unification_1.c)('a'));
+        (0, vitest_1.expect)((0, anti_unification_1.termEquals)(result.generalization, (0, anti_unification_1.c)('a'))).toBe(true);
+        (0, vitest_1.expect)(result.variables).toHaveLength(0);
+        (0, vitest_1.expect)(result.substLeft.size).toBe(0);
+        (0, vitest_1.expect)(result.substRight.size).toBe(0);
+    });
+    (0, vitest_1.it)('lgg(X, X) = X (variables iguales no introducen fresh)', () => {
+        const result = (0, anti_unification_1.antiUnify)((0, anti_unification_1.v)('X'), (0, anti_unification_1.v)('X'));
+        (0, vitest_1.expect)((0, anti_unification_1.termEquals)(result.generalization, (0, anti_unification_1.v)('X'))).toBe(true);
+        (0, vitest_1.expect)(result.variables).toHaveLength(0);
+    });
+});
+(0, vitest_1.describe)('anti-unification — cabeza común', () => {
+    (0, vitest_1.it)('lgg(f(a, b), f(a, c)) = f(a, V) con substs correctas', () => {
+        const result = (0, anti_unification_1.antiUnify)((0, anti_unification_1.f)('f', (0, anti_unification_1.c)('a'), (0, anti_unification_1.c)('b')), (0, anti_unification_1.f)('f', (0, anti_unification_1.c)('a'), (0, anti_unification_1.c)('c')));
+        (0, vitest_1.expect)(result.variables).toHaveLength(1);
+        const vname = result.variables[0];
+        (0, vitest_1.expect)(vname).toBeDefined();
+        if (vname === undefined)
+            return;
+        (0, vitest_1.expect)((0, anti_unification_1.termEquals)(result.generalization, (0, anti_unification_1.f)('f', (0, anti_unification_1.c)('a'), (0, anti_unification_1.v)(vname)))).toBe(true);
+        (0, vitest_1.expect)((0, anti_unification_1.termEquals)(result.substLeft.get(vname), (0, anti_unification_1.c)('b'))).toBe(true);
+        (0, vitest_1.expect)((0, anti_unification_1.termEquals)(result.substRight.get(vname), (0, anti_unification_1.c)('c'))).toBe(true);
+        // σ_L(g) = t1 y σ_R(g) = t2
+        (0, vitest_1.expect)((0, anti_unification_1.termEquals)((0, anti_unification_1.applySubst)(result.generalization, result.substLeft), (0, anti_unification_1.f)('f', (0, anti_unification_1.c)('a'), (0, anti_unification_1.c)('b')))).toBe(true);
+        (0, vitest_1.expect)((0, anti_unification_1.termEquals)((0, anti_unification_1.applySubst)(result.generalization, result.substRight), (0, anti_unification_1.f)('f', (0, anti_unification_1.c)('a'), (0, anti_unification_1.c)('c')))).toBe(true);
+    });
+    (0, vitest_1.it)('lgg(f(a), f(a)) = f(a) sin variables', () => {
+        const result = (0, anti_unification_1.antiUnify)((0, anti_unification_1.f)('f', (0, anti_unification_1.c)('a')), (0, anti_unification_1.f)('f', (0, anti_unification_1.c)('a')));
+        (0, vitest_1.expect)((0, anti_unification_1.termEquals)(result.generalization, (0, anti_unification_1.f)('f', (0, anti_unification_1.c)('a')))).toBe(true);
+        (0, vitest_1.expect)(result.variables).toHaveLength(0);
+    });
+});
+(0, vitest_1.describe)('anti-unification — cabeza distinta', () => {
+    (0, vitest_1.it)('lgg(f(a), g(a)) = fresh var (funciones diferentes)', () => {
+        const result = (0, anti_unification_1.antiUnify)((0, anti_unification_1.f)('f', (0, anti_unification_1.c)('a')), (0, anti_unification_1.f)('g', (0, anti_unification_1.c)('a')));
+        (0, vitest_1.expect)(result.variables).toHaveLength(1);
+        (0, vitest_1.expect)(result.generalization.kind).toBe('var');
+        const vname = result.variables[0];
+        (0, vitest_1.expect)(vname).toBeDefined();
+        if (vname === undefined)
+            return;
+        (0, vitest_1.expect)((0, anti_unification_1.termEquals)(result.substLeft.get(vname), (0, anti_unification_1.f)('f', (0, anti_unification_1.c)('a')))).toBe(true);
+        (0, vitest_1.expect)((0, anti_unification_1.termEquals)(result.substRight.get(vname), (0, anti_unification_1.f)('g', (0, anti_unification_1.c)('a')))).toBe(true);
+    });
+    (0, vitest_1.it)('lgg(a, b) = fresh var (constantes distintas)', () => {
+        const result = (0, anti_unification_1.antiUnify)((0, anti_unification_1.c)('a'), (0, anti_unification_1.c)('b'));
+        (0, vitest_1.expect)(result.generalization.kind).toBe('var');
+        (0, vitest_1.expect)(result.variables).toHaveLength(1);
+    });
+    (0, vitest_1.it)('lgg(f(a, b), g(a, b)) = fresh var (no comparten cabeza)', () => {
+        const result = (0, anti_unification_1.antiUnify)((0, anti_unification_1.f)('f', (0, anti_unification_1.c)('a'), (0, anti_unification_1.c)('b')), (0, anti_unification_1.f)('g', (0, anti_unification_1.c)('a'), (0, anti_unification_1.c)('b')));
+        // La cabeza difiere → un solo fresh var, sin recursar en args.
+        (0, vitest_1.expect)(result.variables).toHaveLength(1);
+        (0, vitest_1.expect)(result.generalization.kind).toBe('var');
+    });
+});
+(0, vitest_1.describe)('anti-unification — aridad distinta', () => {
+    (0, vitest_1.it)('lgg(f(a), f(a, b)) = fresh var (misma cabeza pero aridad distinta)', () => {
+        const result = (0, anti_unification_1.antiUnify)((0, anti_unification_1.f)('f', (0, anti_unification_1.c)('a')), (0, anti_unification_1.f)('f', (0, anti_unification_1.c)('a'), (0, anti_unification_1.c)('b')));
+        (0, vitest_1.expect)(result.variables).toHaveLength(1);
+        (0, vitest_1.expect)(result.generalization.kind).toBe('var');
+    });
+});
+(0, vitest_1.describe)('anti-unification — desacuerdo repetido se comparte', () => {
+    (0, vitest_1.it)('lgg(p(a, a), p(b, b)) = p(V, V) (misma fresh var en ambas posiciones)', () => {
+        const result = (0, anti_unification_1.antiUnify)((0, anti_unification_1.f)('p', (0, anti_unification_1.c)('a'), (0, anti_unification_1.c)('a')), (0, anti_unification_1.f)('p', (0, anti_unification_1.c)('b'), (0, anti_unification_1.c)('b')));
+        (0, vitest_1.expect)(result.variables).toHaveLength(1);
+        const vname = result.variables[0];
+        (0, vitest_1.expect)(vname).toBeDefined();
+        if (vname === undefined)
+            return;
+        (0, vitest_1.expect)((0, anti_unification_1.termEquals)(result.generalization, (0, anti_unification_1.f)('p', (0, anti_unification_1.v)(vname), (0, anti_unification_1.v)(vname)))).toBe(true);
+        // Validamos que la generalización es LEAST: σ_L(g) = t1.
+        (0, vitest_1.expect)((0, anti_unification_1.termEquals)((0, anti_unification_1.applySubst)(result.generalization, result.substLeft), (0, anti_unification_1.f)('p', (0, anti_unification_1.c)('a'), (0, anti_unification_1.c)('a')))).toBe(true);
+        (0, vitest_1.expect)((0, anti_unification_1.termEquals)((0, anti_unification_1.applySubst)(result.generalization, result.substRight), (0, anti_unification_1.f)('p', (0, anti_unification_1.c)('b'), (0, anti_unification_1.c)('b')))).toBe(true);
+    });
+    (0, vitest_1.it)('lgg(f(a, b, c), f(b, a, c)) = f(X, Y, c) con swaps en cada lado', () => {
+        const result = (0, anti_unification_1.antiUnify)((0, anti_unification_1.f)('f', (0, anti_unification_1.c)('a'), (0, anti_unification_1.c)('b'), (0, anti_unification_1.c)('c')), (0, anti_unification_1.f)('f', (0, anti_unification_1.c)('b'), (0, anti_unification_1.c)('a'), (0, anti_unification_1.c)('c')));
+        // Dos desacuerdos: (a,b) en pos 0 y (b,a) en pos 1. Son pares
+        // distintos → dos fresh vars.
+        (0, vitest_1.expect)(result.variables).toHaveLength(2);
+        const [x, y] = result.variables;
+        (0, vitest_1.expect)(x).toBeDefined();
+        (0, vitest_1.expect)(y).toBeDefined();
+        if (x === undefined || y === undefined)
+            return;
+        (0, vitest_1.expect)((0, anti_unification_1.termEquals)(result.generalization, (0, anti_unification_1.f)('f', (0, anti_unification_1.v)(x), (0, anti_unification_1.v)(y), (0, anti_unification_1.c)('c')))).toBe(true);
+        // Left: X→a, Y→b. Right: X→b, Y→a.
+        (0, vitest_1.expect)((0, anti_unification_1.termEquals)(result.substLeft.get(x), (0, anti_unification_1.c)('a'))).toBe(true);
+        (0, vitest_1.expect)((0, anti_unification_1.termEquals)(result.substLeft.get(y), (0, anti_unification_1.c)('b'))).toBe(true);
+        (0, vitest_1.expect)((0, anti_unification_1.termEquals)(result.substRight.get(x), (0, anti_unification_1.c)('b'))).toBe(true);
+        (0, vitest_1.expect)((0, anti_unification_1.termEquals)(result.substRight.get(y), (0, anti_unification_1.c)('a'))).toBe(true);
+    });
+});
+(0, vitest_1.describe)('anti-unification — desacuerdos anidados', () => {
+    (0, vitest_1.it)('lgg(f(g(a), g(b)), f(g(c), g(d))) = f(g(V1), g(V2))', () => {
+        const result = (0, anti_unification_1.antiUnify)((0, anti_unification_1.f)('f', (0, anti_unification_1.f)('g', (0, anti_unification_1.c)('a')), (0, anti_unification_1.f)('g', (0, anti_unification_1.c)('b'))), (0, anti_unification_1.f)('f', (0, anti_unification_1.f)('g', (0, anti_unification_1.c)('c')), (0, anti_unification_1.f)('g', (0, anti_unification_1.c)('d'))));
+        (0, vitest_1.expect)(result.variables).toHaveLength(2);
+        (0, vitest_1.expect)((0, anti_unification_1.termEquals)((0, anti_unification_1.applySubst)(result.generalization, result.substLeft), (0, anti_unification_1.f)('f', (0, anti_unification_1.f)('g', (0, anti_unification_1.c)('a')), (0, anti_unification_1.f)('g', (0, anti_unification_1.c)('b'))))).toBe(true);
+        (0, vitest_1.expect)((0, anti_unification_1.termEquals)((0, anti_unification_1.applySubst)(result.generalization, result.substRight), (0, anti_unification_1.f)('f', (0, anti_unification_1.f)('g', (0, anti_unification_1.c)('c')), (0, anti_unification_1.f)('g', (0, anti_unification_1.c)('d'))))).toBe(true);
+    });
+    (0, vitest_1.it)('lgg(h(x, x), h(y, z)) — variables como términos comunes y distintos', () => {
+        // h(x, x) vs h(y, z): pos 0 desacuerdo (x, y), pos 1 desacuerdo (x, z).
+        // Son pares DISTINTOS porque el segundo componente difiere → dos
+        // fresh vars distintas.
+        const result = (0, anti_unification_1.antiUnify)((0, anti_unification_1.f)('h', (0, anti_unification_1.v)('x'), (0, anti_unification_1.v)('x')), (0, anti_unification_1.f)('h', (0, anti_unification_1.v)('y'), (0, anti_unification_1.v)('z')));
+        (0, vitest_1.expect)(result.variables).toHaveLength(2);
+    });
+});
+(0, vitest_1.describe)('antiUnifyMany — n-way lgg', () => {
+    (0, vitest_1.it)('lgg de 3 términos f(a, b), f(a, c), f(a, d) = f(a, V)', () => {
+        const result = (0, anti_unification_1.antiUnifyMany)([
+            (0, anti_unification_1.f)('f', (0, anti_unification_1.c)('a'), (0, anti_unification_1.c)('b')),
+            (0, anti_unification_1.f)('f', (0, anti_unification_1.c)('a'), (0, anti_unification_1.c)('c')),
+            (0, anti_unification_1.f)('f', (0, anti_unification_1.c)('a'), (0, anti_unification_1.c)('d')),
+        ]);
+        (0, vitest_1.expect)(result.variables).toHaveLength(1);
+        (0, vitest_1.expect)(result.generalization.kind).toBe('func');
+        if (result.generalization.kind !== 'func')
+            return;
+        (0, vitest_1.expect)(result.generalization.name).toBe('f');
+        (0, vitest_1.expect)(result.generalization.args).toBeDefined();
+        (0, vitest_1.expect)((result.generalization.args ?? [])[0]).toEqual((0, anti_unification_1.c)('a'));
+    });
+    (0, vitest_1.it)('lgg de 1 término devuelve el término mismo sin variables', () => {
+        const result = (0, anti_unification_1.antiUnifyMany)([(0, anti_unification_1.f)('f', (0, anti_unification_1.c)('a'))]);
+        (0, vitest_1.expect)((0, anti_unification_1.termEquals)(result.generalization, (0, anti_unification_1.f)('f', (0, anti_unification_1.c)('a')))).toBe(true);
+        (0, vitest_1.expect)(result.variables).toHaveLength(0);
+    });
+    (0, vitest_1.it)('lgg de array vacío lanza', () => {
+        (0, vitest_1.expect)(() => (0, anti_unification_1.antiUnifyMany)([])).toThrow();
+    });
+    (0, vitest_1.it)('antiUnifyManyDetailed devuelve N sustituciones, una por término', () => {
+        const terms = [(0, anti_unification_1.f)('p', (0, anti_unification_1.c)('a'), (0, anti_unification_1.c)('a')), (0, anti_unification_1.f)('p', (0, anti_unification_1.c)('b'), (0, anti_unification_1.c)('b')), (0, anti_unification_1.f)('p', (0, anti_unification_1.c)('c'), (0, anti_unification_1.c)('c'))];
+        const result = (0, anti_unification_1.antiUnifyManyDetailed)(terms);
+        (0, vitest_1.expect)(result.substs).toHaveLength(3);
+        for (let i = 0; i < terms.length; i++) {
+            const ti = terms[i];
+            const si = result.substs[i];
+            (0, vitest_1.expect)(ti).toBeDefined();
+            (0, vitest_1.expect)(si).toBeDefined();
+            if (ti === undefined || si === undefined)
+                continue;
+            (0, vitest_1.expect)((0, anti_unification_1.termEquals)((0, anti_unification_1.applySubst)(result.generalization, si), ti)).toBe(true);
+        }
+    });
+});
+(0, vitest_1.describe)('generalizationOrder', () => {
+    (0, vitest_1.it)('X es más general que f(X) → orden -1', () => {
+        (0, vitest_1.expect)((0, anti_unification_1.generalizationOrder)((0, anti_unification_1.v)('X'), (0, anti_unification_1.f)('f', (0, anti_unification_1.v)('X')))).toBe(-1);
+    });
+    (0, vitest_1.it)('f(X) es menos general que X → orden +1 (sentido inverso)', () => {
+        (0, vitest_1.expect)((0, anti_unification_1.generalizationOrder)((0, anti_unification_1.f)('f', (0, anti_unification_1.v)('X')), (0, anti_unification_1.v)('X'))).toBe(1);
+    });
+    (0, vitest_1.it)('términos idénticos → 0', () => {
+        (0, vitest_1.expect)((0, anti_unification_1.generalizationOrder)((0, anti_unification_1.f)('f', (0, anti_unification_1.c)('a')), (0, anti_unification_1.f)('f', (0, anti_unification_1.c)('a')))).toBe(0);
+    });
+    (0, vitest_1.it)('renombre puro de variables → 0 (equivalentes)', () => {
+        (0, vitest_1.expect)((0, anti_unification_1.generalizationOrder)((0, anti_unification_1.f)('f', (0, anti_unification_1.v)('X')), (0, anti_unification_1.f)('f', (0, anti_unification_1.v)('Y')))).toBe(0);
+    });
+    (0, vitest_1.it)('incomparables: f(X) vs g(X) → null', () => {
+        (0, vitest_1.expect)((0, anti_unification_1.generalizationOrder)((0, anti_unification_1.f)('f', (0, anti_unification_1.v)('X')), (0, anti_unification_1.f)('g', (0, anti_unification_1.v)('X')))).toBe(null);
+    });
+    (0, vitest_1.it)('f(X, X) vs f(X, Y): la primera es menos general (más específica) que la segunda', () => {
+        // f(X, Y) σ-instancia a f(X, X) con σ = {Y → X}.
+        // f(X, X) NO σ-instancia a f(X, Y) (variables del pattern no se pueden duplicar libremente).
+        // Resultado: f(X, Y) más general → generalizationOrder(f(X,X), f(X,Y)) = +1.
+        (0, vitest_1.expect)((0, anti_unification_1.generalizationOrder)((0, anti_unification_1.f)('f', (0, anti_unification_1.v)('X'), (0, anti_unification_1.v)('X')), (0, anti_unification_1.f)('f', (0, anti_unification_1.v)('X'), (0, anti_unification_1.v)('Y')))).toBe(1);
+    });
+});
+(0, vitest_1.describe)('antiUnify — verificación de propiedades invariantes', () => {
+    (0, vitest_1.it)('para cualquier par (t1, t2), σ_L(g) = t1 y σ_R(g) = t2', () => {
+        const pairs = [
+            [(0, anti_unification_1.f)('add', (0, anti_unification_1.c)('1'), (0, anti_unification_1.c)('2')), (0, anti_unification_1.f)('add', (0, anti_unification_1.c)('3'), (0, anti_unification_1.c)('4'))],
+            [(0, anti_unification_1.f)('node', (0, anti_unification_1.v)('x'), (0, anti_unification_1.f)('leaf')), (0, anti_unification_1.f)('node', (0, anti_unification_1.v)('y'), (0, anti_unification_1.f)('leaf'))],
+            [(0, anti_unification_1.c)('zero'), (0, anti_unification_1.f)('succ', (0, anti_unification_1.c)('zero'))],
+            [(0, anti_unification_1.f)('cons', (0, anti_unification_1.c)('a'), (0, anti_unification_1.c)('nil')), (0, anti_unification_1.f)('cons', (0, anti_unification_1.c)('b'), (0, anti_unification_1.f)('cons', (0, anti_unification_1.c)('c'), (0, anti_unification_1.c)('nil')))],
+        ];
+        for (const [t1, t2] of pairs) {
+            const result = (0, anti_unification_1.antiUnify)(t1, t2);
+            (0, vitest_1.expect)((0, anti_unification_1.termEquals)((0, anti_unification_1.applySubst)(result.generalization, result.substLeft), t1)).toBe(true);
+            (0, vitest_1.expect)((0, anti_unification_1.termEquals)((0, anti_unification_1.applySubst)(result.generalization, result.substRight), t2)).toBe(true);
+            // Las variables de la generalización deben ser exactamente las
+            // reportadas en `variables` (módulo el orden).
+            (0, vitest_1.expect)(new Set((0, anti_unification_1.varsOf)(result.generalization))).toEqual(new Set(result.variables));
+        }
+    });
+    (0, vitest_1.it)('freshSupply custom controla los nombres de variables', () => {
+        let i = 0;
+        const supply = () => `Z${i++}`;
+        const result = (0, anti_unification_1.antiUnify)((0, anti_unification_1.f)('f', (0, anti_unification_1.c)('a'), (0, anti_unification_1.c)('b')), (0, anti_unification_1.f)('f', (0, anti_unification_1.c)('c'), (0, anti_unification_1.c)('d')), supply);
+        (0, vitest_1.expect)(result.variables).toEqual(['Z0', 'Z1']);
+    });
+    (0, vitest_1.it)('defaultFreshSupply con prefijo personalizado genera nombres consistentes', () => {
+        const supply = (0, anti_unification_1.defaultFreshSupply)('var_');
+        const result = (0, anti_unification_1.antiUnify)((0, anti_unification_1.c)('a'), (0, anti_unification_1.c)('b'), supply);
+        (0, vitest_1.expect)(result.variables[0]).toBe('var_0');
+    });
+});
+//# sourceMappingURL=anti-unify.test.js.map