@stevenvo780/st-lang 4.5.0 → 4.5.2

package/dist/tests/optimization/lp.test.js

@@ -0,0 +1,224 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+const vitest_1 = require("vitest");
+const optimization_1 = require("../../optimization");
+(0, vitest_1.describe)('LP — Simplex de dos fases', () => {
+    (0, vitest_1.it)('LP trivial: max x s.t. x ≤ 5 → x = 5', () => {
+        const lp = {
+            objective: { kind: 'maximize', coefficients: [1] },
+            constraints: [{ coefficients: [1], operator: '<=', rhs: 5 }],
+        };
+        const sol = (0, optimization_1.solveLP)(lp);
+        (0, vitest_1.expect)(sol.status).toBe('optimal');
+        (0, vitest_1.expect)(sol.variables[0]).toBeCloseTo(5, 6);
+        (0, vitest_1.expect)(sol.objectiveValue).toBeCloseTo(5, 6);
+    });
+    (0, vitest_1.it)('LP clásico: max 3x+5y s.t. x+y≤6, x≤4, y≤4 → (4,2)=22', () => {
+        const lp = {
+            objective: { kind: 'maximize', coefficients: [3, 5] },
+            constraints: [
+                { coefficients: [1, 1], operator: '<=', rhs: 6 },
+                { coefficients: [1, 0], operator: '<=', rhs: 4 },
+                { coefficients: [0, 1], operator: '<=', rhs: 4 },
+            ],
+        };
+        const sol = (0, optimization_1.solveLP)(lp);
+        (0, vitest_1.expect)(sol.status).toBe('optimal');
+        // Óptimo en vértice (2,4) ya que 3·2 + 5·4 = 26 > 3·4 + 5·2 = 22.
+        // Recalculamos el caso clásico: max 3x+5y s.t. x+y≤6, x≤4, y≤4
+        // Vértices factibles: (0,0)=0, (4,0)=12, (4,2)=22, (2,4)=26, (0,4)=20.
+        // El óptimo real es (2,4)=26. Ajustamos el assert al óptimo
+        // verdadero del problema (no al del prompt, que tenía un typo).
+        (0, vitest_1.expect)(sol.objectiveValue).toBeCloseTo(26, 6);
+        (0, vitest_1.expect)(sol.variables[0]).toBeCloseTo(2, 6);
+        (0, vitest_1.expect)(sol.variables[1]).toBeCloseTo(4, 6);
+    });
+    (0, vitest_1.it)('LP minimización: min x+y s.t. x+y≥3, x≥0, y≥0 → (any) = 3', () => {
+        const lp = {
+            objective: { kind: 'minimize', coefficients: [1, 1] },
+            constraints: [{ coefficients: [1, 1], operator: '>=', rhs: 3 }],
+        };
+        const sol = (0, optimization_1.solveLP)(lp);
+        (0, vitest_1.expect)(sol.status).toBe('optimal');
+        (0, vitest_1.expect)(sol.objectiveValue).toBeCloseTo(3, 6);
+    });
+    (0, vitest_1.it)('LP infeasible: x ≤ 1 AND x ≥ 5', () => {
+        const lp = {
+            objective: { kind: 'maximize', coefficients: [1] },
+            constraints: [
+                { coefficients: [1], operator: '<=', rhs: 1 },
+                { coefficients: [1], operator: '>=', rhs: 5 },
+            ],
+        };
+        const sol = (0, optimization_1.solveLP)(lp);
+        (0, vitest_1.expect)(sol.status).toBe('infeasible');
+    });
+    (0, vitest_1.it)('LP unbounded: max x sin cota superior', () => {
+        const lp = {
+            objective: { kind: 'maximize', coefficients: [1] },
+            constraints: [{ coefficients: [-1], operator: '<=', rhs: 0 }], // x ≥ 0
+        };
+        const sol = (0, optimization_1.solveLP)(lp);
+        (0, vitest_1.expect)(sol.status).toBe('unbounded');
+    });
+    (0, vitest_1.it)('LP con igualdad: max x s.t. x+y=4, x≤3, y≥0', () => {
+        const lp = {
+            objective: { kind: 'maximize', coefficients: [1, 0] },
+            constraints: [
+                { coefficients: [1, 1], operator: '=', rhs: 4 },
+                { coefficients: [1, 0], operator: '<=', rhs: 3 },
+            ],
+        };
+        const sol = (0, optimization_1.solveLP)(lp);
+        (0, vitest_1.expect)(sol.status).toBe('optimal');
+        (0, vitest_1.expect)(sol.variables[0]).toBeCloseTo(3, 6);
+        (0, vitest_1.expect)(sol.variables[1]).toBeCloseTo(1, 6);
+    });
+    (0, vitest_1.it)('LP dieta clásico (pequeño): min 2x+3y s.t. x+y≥1, x≥0.2, y≥0.3', () => {
+        const lp = {
+            objective: { kind: 'minimize', coefficients: [2, 3] },
+            constraints: [
+                { coefficients: [1, 1], operator: '>=', rhs: 1 },
+                { coefficients: [1, 0], operator: '>=', rhs: 0.2 },
+                { coefficients: [0, 1], operator: '>=', rhs: 0.3 },
+            ],
+        };
+        const sol = (0, optimization_1.solveLP)(lp);
+        (0, vitest_1.expect)(sol.status).toBe('optimal');
+        // Óptimo: x=0.7, y=0.3, cost=2·0.7+3·0.3=1.4+0.9=2.3
+        (0, vitest_1.expect)(sol.objectiveValue).toBeCloseTo(2.3, 5);
+    });
+    (0, vitest_1.it)('LP con variableBounds (upper) actúa como restricción', () => {
+        const lp = {
+            objective: { kind: 'maximize', coefficients: [1] },
+            constraints: [],
+            variableBounds: [{ upper: 7 }],
+        };
+        const sol = (0, optimization_1.solveLP)(lp);
+        (0, vitest_1.expect)(sol.status).toBe('optimal');
+        (0, vitest_1.expect)(sol.variables[0]).toBeCloseTo(7, 6);
+    });
+    (0, vitest_1.it)('LP con 3 variables y 3 restricciones', () => {
+        // max 4x + 5y + 6z s.t.
+        //  x +  y +  z ≤ 10
+        // 2x +  y +  z ≤ 12
+        //  x + 2y + 3z ≤ 15
+        const lp = {
+            objective: { kind: 'maximize', coefficients: [4, 5, 6] },
+            constraints: [
+                { coefficients: [1, 1, 1], operator: '<=', rhs: 10 },
+                { coefficients: [2, 1, 1], operator: '<=', rhs: 12 },
+                { coefficients: [1, 2, 3], operator: '<=', rhs: 15 },
+            ],
+        };
+        const sol = (0, optimization_1.solveLP)(lp);
+        (0, vitest_1.expect)(sol.status).toBe('optimal');
+        // Comprobamos solo factibilidad y consistencia del objetivo
+        const [x, y, z] = sol.variables;
+        (0, vitest_1.expect)(x + y + z).toBeLessThanOrEqual(10 + 1e-6);
+        (0, vitest_1.expect)(2 * x + y + z).toBeLessThanOrEqual(12 + 1e-6);
+        (0, vitest_1.expect)(x + 2 * y + 3 * z).toBeLessThanOrEqual(15 + 1e-6);
+        (0, vitest_1.expect)(sol.objectiveValue).toBeCloseTo(4 * x + 5 * y + 6 * z, 6);
+        (0, vitest_1.expect)(sol.objectiveValue).toBeGreaterThan(30);
+    });
+    (0, vitest_1.it)('standardForm: minimización pasa a maximización con coefs negados', () => {
+        const lp = {
+            objective: { kind: 'minimize', coefficients: [3, 4] },
+            constraints: [{ coefficients: [1, 1], operator: '<=', rhs: 10 }],
+        };
+        const std = (0, optimization_1.standardForm)(lp);
+        (0, vitest_1.expect)(std.objective.kind).toBe('maximize');
+        (0, vitest_1.expect)(std.objective.coefficients).toEqual([-3, -4]);
+    });
+    (0, vitest_1.it)('standardForm: ≥ se invierte a ≤ con signos cambiados', () => {
+        const lp = {
+            objective: { kind: 'maximize', coefficients: [1] },
+            constraints: [{ coefficients: [2], operator: '>=', rhs: 8 }],
+        };
+        const std = (0, optimization_1.standardForm)(lp);
+        (0, vitest_1.expect)(std.constraints[0].operator).toBe('<=');
+        (0, vitest_1.expect)(std.constraints[0].coefficients).toEqual([-2]);
+        (0, vitest_1.expect)(std.constraints[0].rhs).toBe(-8);
+    });
+    (0, vitest_1.it)('standardForm: igualdad se expande a dos restricciones', () => {
+        const lp = {
+            objective: { kind: 'maximize', coefficients: [1] },
+            constraints: [{ coefficients: [1], operator: '=', rhs: 5 }],
+        };
+        const std = (0, optimization_1.standardForm)(lp);
+        (0, vitest_1.expect)(std.constraints).toHaveLength(2);
+        (0, vitest_1.expect)(std.constraints[0].operator).toBe('<=');
+        (0, vitest_1.expect)(std.constraints[1].operator).toBe('<=');
+    });
+    (0, vitest_1.it)('standardForm preserva solución óptima', () => {
+        const lp = {
+            objective: { kind: 'maximize', coefficients: [2, 3] },
+            constraints: [
+                { coefficients: [1, 1], operator: '<=', rhs: 4 },
+                { coefficients: [1, 2], operator: '<=', rhs: 6 },
+            ],
+        };
+        const sol1 = (0, optimization_1.solveLP)(lp);
+        const sol2 = (0, optimization_1.solveLP)((0, optimization_1.standardForm)(lp));
+        (0, vitest_1.expect)(sol1.status).toBe('optimal');
+        (0, vitest_1.expect)(sol2.status).toBe('optimal');
+        (0, vitest_1.expect)(sol1.objectiveValue).toBeCloseTo(sol2.objectiveValue, 6);
+    });
+    (0, vitest_1.it)('LP con iteration_limit retorna status correcto', () => {
+        const lp = {
+            objective: { kind: 'maximize', coefficients: [1, 1] },
+            constraints: [{ coefficients: [1, 1], operator: '<=', rhs: 10 }],
+        };
+        const sol = (0, optimization_1.solveLP)(lp, { maxIterations: 0 });
+        // Con 0 iteraciones, fase II no puede avanzar; el resultado es
+        // 'iteration_limit' o 'optimal' (si el tableau inicial ya es óptimo).
+        (0, vitest_1.expect)(['optimal', 'iteration_limit']).toContain(sol.status);
+    });
+    (0, vitest_1.it)('LP con coeficientes negativos en objetivo (minimización implícita)', () => {
+        // max -x s.t. x ≥ 0, x ≤ 10 → óptimo en x=0
+        const lp = {
+            objective: { kind: 'maximize', coefficients: [-1] },
+            constraints: [{ coefficients: [1], operator: '<=', rhs: 10 }],
+        };
+        const sol = (0, optimization_1.solveLP)(lp);
+        (0, vitest_1.expect)(sol.status).toBe('optimal');
+        (0, vitest_1.expect)(sol.variables[0]).toBeCloseTo(0, 6);
+        (0, vitest_1.expect)(sol.objectiveValue).toBeCloseTo(0, 6);
+    });
+    (0, vitest_1.it)('LP de transporte chico (4 nodos, factible)', () => {
+        // min c·x s.t. Ax = b (oferta-demanda balanceada).
+        // Oferta: o1=10, o2=15. Demanda: d1=12, d2=13.
+        // Variables: x11, x12, x21, x22.
+        // Coste: 4·x11 + 6·x12 + 5·x21 + 3·x22
+        const lp = {
+            objective: { kind: 'minimize', coefficients: [4, 6, 5, 3] },
+            constraints: [
+                // x11 + x12 = 10 (oferta o1)
+                { coefficients: [1, 1, 0, 0], operator: '=', rhs: 10 },
+                // x21 + x22 = 15 (oferta o2)
+                { coefficients: [0, 0, 1, 1], operator: '=', rhs: 15 },
+                // x11 + x21 = 12 (demanda d1)
+                { coefficients: [1, 0, 1, 0], operator: '=', rhs: 12 },
+                // x12 + x22 = 13 (demanda d2)
+                { coefficients: [0, 1, 0, 1], operator: '=', rhs: 13 },
+            ],
+        };
+        const sol = (0, optimization_1.solveLP)(lp);
+        (0, vitest_1.expect)(sol.status).toBe('optimal');
+        // Verificamos factibilidad (sumas) y coste positivo razonable
+        const [x11, x12, x21, x22] = sol.variables;
+        (0, vitest_1.expect)(x11 + x12).toBeCloseTo(10, 5);
+        (0, vitest_1.expect)(x21 + x22).toBeCloseTo(15, 5);
+        (0, vitest_1.expect)(x11 + x21).toBeCloseTo(12, 5);
+        (0, vitest_1.expect)(x12 + x22).toBeCloseTo(13, 5);
+    });
+    (0, vitest_1.it)('LP devuelve iterations >= 0', () => {
+        const lp = {
+            objective: { kind: 'maximize', coefficients: [1, 2] },
+            constraints: [{ coefficients: [1, 1], operator: '<=', rhs: 5 }],
+        };
+        const sol = (0, optimization_1.solveLP)(lp);
+        (0, vitest_1.expect)(sol.iterations).toBeGreaterThanOrEqual(0);
+    });
+});
+//# sourceMappingURL=lp.test.js.map

package/dist/tests/optimization/lp.test.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"lp.test.js","sourceRoot":"","sources":["../../../src/tests/optimization/lp.test.ts"],"names":[],"mappings":";;AAAA,mCAA8C;AAC9C,qDAA2D;AAG3D,IAAA,iBAAQ,EAAC,2BAA2B,EAAE,GAAG,EAAE;IACzC,IAAA,WAAE,EAAC,sCAAsC,EAAE,GAAG,EAAE;QAC9C,MAAM,EAAE,GAAc;YACpB,SAAS,EAAE,EAAE,IAAI,EAAE,UAAU,EAAE,YAAY,EAAE,CAAC,CAAC,CAAC,EAAE;YAClD,WAAW,EAAE,CAAC,EAAE,YAAY,EAAE,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,IAAI,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC;SAC7D,CAAC;QACF,MAAM,GAAG,GAAG,IAAA,sBAAO,EAAC,EAAE,CAAC,CAAC;QACxB,IAAA,eAAM,EAAC,GAAG,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QACnC,IAAA,eAAM,EAAC,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAC3C,IAAA,eAAM,EAAC,GAAG,CAAC,cAAc,CAAC,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC/C,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,uDAAuD,EAAE,GAAG,EAAE;QAC/D,MAAM,EAAE,GAAc;YACpB,SAAS,EAAE,EAAE,IAAI,EAAE,UAAU,EAAE,YAAY,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE;YACrD,WAAW,EAAE;gBACX,EAAE,YAAY,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,QAAQ,EAAE,IAAI,EAAE,GAAG,EAAE,CAAC,EAAE;gBAChD,EAAE,YAAY,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,QAAQ,EAAE,IAAI,EAAE,GAAG,EAAE,CAAC,EAAE;gBAChD,EAAE,YAAY,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,QAAQ,EAAE,IAAI,EAAE,GAAG,EAAE,CAAC,EAAE;aACjD;SACF,CAAC;QACF,MAAM,GAAG,GAAG,IAAA,sBAAO,EAAC,EAAE,CAAC,CAAC;QACxB,IAAA,eAAM,EAAC,GAAG,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QACnC,kEAAkE;QAClE,+DAA+D;QAC/D,uEAAuE;QACvE,4DAA4D;QAC5D,gEAAgE;QAChE,IAAA,eAAM,EAAC,GAAG,CAAC,cAAc,CAAC,CAAC,WAAW,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;QAC9C,IAAA,eAAM,EAAC,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAC3C,IAAA,eAAM,EAAC,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC7C,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,2DAA2D,EAAE,GAAG,EAAE;QACnE,MAAM,EAAE,GAAc;YACpB,SAAS,EAAE,EAAE,IAAI,EAAE,UAAU,EAAE,YAAY,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE;YACrD,WAAW,EAAE,CAAC,EAAE,YAAY,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,QAAQ,EAAE,IAAI,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC;SAChE,CAAC;QACF,MAAM,GAAG,GAAG,IAAA,sBAAO,EAAC,EAAE,CAAC,CAAC;QACxB,IAAA,eAAM,EAAC,GAAG,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QACnC,IAAA,eAAM,EAAC,GAAG,CAAC,cAAc,CAAC,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC/C,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,gCAAgC,EAAE,GAAG,EAAE;QACxC,MAAM,EAAE,GAAc;YACpB,SAAS,EAAE,EAAE,IAAI,EAAE,UAAU,EAAE,YAAY,EAAE,CAAC,CAAC,CAAC,EAAE;YAClD,WAAW,EAAE;gBACX,EAAE,YAAY,EAAE,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,IAAI,EAAE,GAAG,EAAE,CAAC,EAAE;gBAC7C,EAAE,YAAY,EAAE,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,IAAI,EAAE,GAAG,EAAE,CAAC,EAAE;aAC9C;SACF,CAAC;QACF,MAAM,GAAG,GAAG,IAAA,sBAAO,EAAC,EAAE,CAAC,CAAC;QACxB,IAAA,eAAM,EAAC,GAAG,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;IACxC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,uCAAuC,EAAE,GAAG,EAAE;QAC/C,MAAM,EAAE,GAAc;YACpB,SAAS,EAAE,EAAE,IAAI,EAAE,UAAU,EAAE,YAAY,EAAE,CAAC,CAAC,CAAC,EAAE;YAClD,WAAW,EAAE,CAAC,EAAE,YAAY,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,IAAI,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE,QAAQ;SACxE,CAAC;QACF,MAAM,GAAG,GAAG,IAAA,sBAAO,EAAC,EAAE,CAAC,CAAC;QACxB,IAAA,eAAM,EAAC,GAAG,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;IACvC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,6CAA6C,EAAE,GAAG,EAAE;QACrD,MAAM,EAAE,GAAc;YACpB,SAAS,EAAE,EAAE,IAAI,EAAE,UAAU,EAAE,YAAY,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE;YACrD,WAAW,EAAE;gBACX,EAAE,YAAY,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,QAAQ,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,EAAE;gBAC/C,EAAE,YAAY,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,QAAQ,EAAE,IAAI,EAAE,GAAG,EAAE,CAAC,EAAE;aACjD;SACF,CAAC;QACF,MAAM,GAAG,GAAG,IAAA,sBAAO,EAAC,EAAE,CAAC,CAAC;QACxB,IAAA,eAAM,EAAC,GAAG,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QACnC,IAAA,eAAM,EAAC,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAC3C,IAAA,eAAM,EAAC,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC7C,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,gEAAgE,EAAE,GAAG,EAAE;QACxE,MAAM,EAAE,GAAc;YACpB,SAAS,EAAE,EAAE,IAAI,EAAE,UAAU,EAAE,YAAY,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE;YACrD,WAAW,EAAE;gBACX,EAAE,YAAY,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,QAAQ,EAAE,IAAI,EAAE,GAAG,EAAE,CAAC,EAAE;gBAChD,EAAE,YAAY,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,QAAQ,EAAE,IAAI,EAAE,GAAG,EAAE,GAAG,EAAE;gBAClD,EAAE,YAAY,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,QAAQ,EAAE,IAAI,EAAE,GAAG,EAAE,GAAG,EAAE;aACnD;SACF,CAAC;QACF,MAAM,GAAG,GAAG,IAAA,sBAAO,EAAC,EAAE,CAAC,CAAC;QACxB,IAAA,eAAM,EAAC,GAAG,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QACnC,qDAAqD;QACrD,IAAA,eAAM,EAAC,GAAG,CAAC,cAAc,CAAC,CAAC,WAAW,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;IACjD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,sDAAsD,EAAE,GAAG,EAAE;QAC9D,MAAM,EAAE,GAAc;YACpB,SAAS,EAAE,EAAE,IAAI,EAAE,UAAU,EAAE,YAAY,EAAE,CAAC,CAAC,CAAC,EAAE;YAClD,WAAW,EAAE,EAAE;YACf,cAAc,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC;SAC/B,CAAC;QACF,MAAM,GAAG,GAAG,IAAA,sBAAO,EAAC,EAAE,CAAC,CAAC;QACxB,IAAA,eAAM,EAAC,GAAG,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QACnC,IAAA,eAAM,EAAC,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC7C,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,sCAAsC,EAAE,GAAG,EAAE;QAC9C,wBAAwB;QACxB,oBAAoB;QACpB,oBAAoB;QACpB,oBAAoB;QACpB,MAAM,EAAE,GAAc;YACpB,SAAS,EAAE,EAAE,IAAI,EAAE,UAAU,EAAE,YAAY,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE;YACxD,WAAW,EAAE;gBACX,EAAE,YAAY,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,QAAQ,EAAE,IAAI,EAAE,GAAG,EAAE,EAAE,EAAE;gBACpD,EAAE,YAAY,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,QAAQ,EAAE,IAAI,EAAE,GAAG,EAAE,EAAE,EAAE;gBACpD,EAAE,YAAY,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,QAAQ,EAAE,IAAI,EAAE,GAAG,EAAE,EAAE,EAAE;aACrD;SACF,CAAC;QACF,MAAM,GAAG,GAAG,IAAA,sBAAO,EAAC,EAAE,CAAC,CAAC;QACxB,IAAA,eAAM,EAAC,GAAG,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QACnC,4DAA4D;QAC5D,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,GAAG,GAAG,CAAC,SAAS,CAAC;QAChC,IAAA,eAAM,EAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,mBAAmB,CAAC,EAAE,GAAG,IAAI,CAAC,CAAC;QACjD,IAAA,eAAM,EAAC,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,mBAAmB,CAAC,EAAE,GAAG,IAAI,CAAC,CAAC;QACrD,IAAA,eAAM,EAAC,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,mBAAmB,CAAC,EAAE,GAAG,IAAI,CAAC,CAAC;QACzD,IAAA,eAAM,EAAC,GAAG,CAAC,cAAc,CAAC,CAAC,WAAW,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;QACjE,IAAA,eAAM,EAAC,GAAG,CAAC,cAAc,CAAC,CAAC,eAAe,CAAC,EAAE,CAAC,CAAC;IACjD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,kEAAkE,EAAE,GAAG,EAAE;QAC1E,MAAM,EAAE,GAAc;YACpB,SAAS,EAAE,EAAE,IAAI,EAAE,UAAU,EAAE,YAAY,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE;YACrD,WAAW,EAAE,CAAC,EAAE,YAAY,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,QAAQ,EAAE,IAAI,EAAE,GAAG,EAAE,EAAE,EAAE,CAAC;SACjE,CAAC;QACF,MAAM,GAAG,GAAG,IAAA,2BAAY,EAAC,EAAE,CAAC,CAAC;QAC7B,IAAA,eAAM,EAAC,GAAG,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QAC5C,IAAA,eAAM,EAAC,GAAG,CAAC,SAAS,CAAC,YAAY,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IACvD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,sDAAsD,EAAE,GAAG,EAAE;QAC9D,MAAM,EAAE,GAAc;YACpB,SAAS,EAAE,EAAE,IAAI,EAAE,UAAU,EAAE,YAAY,EAAE,CAAC,CAAC,CAAC,EAAE;YAClD,WAAW,EAAE,CAAC,EAAE,YAAY,EAAE,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,IAAI,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC;SAC7D,CAAC;QACF,MAAM,GAAG,GAAG,IAAA,2BAAY,EAAC,EAAE,CAAC,CAAC;QAC7B,IAAA,eAAM,EAAC,GAAG,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC/C,IAAA,eAAM,EAAC,GAAG,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACtD,IAAA,eAAM,EAAC,GAAG,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;IAC1C,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,uDAAuD,EAAE,GAAG,EAAE;QAC/D,MAAM,EAAE,GAAc;YACpB,SAAS,EAAE,EAAE,IAAI,EAAE,UAAU,EAAE,YAAY,EAAE,CAAC,CAAC,CAAC,EAAE;YAClD,WAAW,EAAE,CAAC,EAAE,YAAY,EAAE,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC;SAC5D,CAAC;QACF,MAAM,GAAG,GAAG,IAAA,2BAAY,EAAC,EAAE,CAAC,CAAC;QAC7B,IAAA,eAAM,EAAC,GAAG,CAAC,WAAW,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QACxC,IAAA,eAAM,EAAC,GAAG,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC/C,IAAA,eAAM,EAAC,GAAG,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACjD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,uCAAuC,EAAE,GAAG,EAAE;QAC/C,MAAM,EAAE,GAAc;YACpB,SAAS,EAAE,EAAE,IAAI,EAAE,UAAU,EAAE,YAAY,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE;YACrD,WAAW,EAAE;gBACX,EAAE,YAAY,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,QAAQ,EAAE,IAAI,EAAE,GAAG,EAAE,CAAC,EAAE;gBAChD,EAAE,YAAY,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,QAAQ,EAAE,IAAI,EAAE,GAAG,EAAE,CAAC,EAAE;aACjD;SACF,CAAC;QACF,MAAM,IAAI,GAAG,IAAA,sBAAO,EAAC,EAAE,CAAC,CAAC;QACzB,MAAM,IAAI,GAAG,IAAA,sBAAO,EAAC,IAAA,2BAAY,EAAC,EAAE,CAAC,CAAC,CAAC;QACvC,IAAA,eAAM,EAAC,IAAI,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QACpC,IAAA,eAAM,EAAC,IAAI,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QACpC,IAAA,eAAM,EAAC,IAAI,CAAC,cAAc,CAAC,CAAC,WAAW,CAAC,IAAI,CAAC,cAAc,EAAE,CAAC,CAAC,CAAC;IAClE,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,gDAAgD,EAAE,GAAG,EAAE;QACxD,MAAM,EAAE,GAAc;YACpB,SAAS,EAAE,EAAE,IAAI,EAAE,UAAU,EAAE,YAAY,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE;YACrD,WAAW,EAAE,CAAC,EAAE,YAAY,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,QAAQ,EAAE,IAAI,EAAE,GAAG,EAAE,EAAE,EAAE,CAAC;SACjE,CAAC;QACF,MAAM,GAAG,GAAG,IAAA,sBAAO,EAAC,EAAE,EAAE,EAAE,aAAa,EAAE,CAAC,EAAE,CAAC,CAAC;QAC9C,+DAA+D;QAC/D,sEAAsE;QACtE,IAAA,eAAM,EAAC,CAAC,SAAS,EAAE,iBAAiB,CAAC,CAAC,CAAC,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;IAC/D,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,oEAAoE,EAAE,GAAG,EAAE;QAC5E,4CAA4C;QAC5C,MAAM,EAAE,GAAc;YACpB,SAAS,EAAE,EAAE,IAAI,EAAE,UAAU,EAAE,YAAY,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE;YACnD,WAAW,EAAE,CAAC,EAAE,YAAY,EAAE,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,IAAI,EAAE,GAAG,EAAE,EAAE,EAAE,CAAC;SAC9D,CAAC;QACF,MAAM,GAAG,GAAG,IAAA,sBAAO,EAAC,EAAE,CAAC,CAAC;QACxB,IAAA,eAAM,EAAC,GAAG,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QACnC,IAAA,eAAM,EAAC,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAC3C,IAAA,eAAM,EAAC,GAAG,CAAC,cAAc,CAAC,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC/C,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,4CAA4C,EAAE,GAAG,EAAE;QACpD,mDAAmD;QACnD,+CAA+C;QAC/C,iCAAiC;QACjC,uCAAuC;QACvC,MAAM,EAAE,GAAc;YACpB,SAAS,EAAE,EAAE,IAAI,EAAE,UAAU,EAAE,YAAY,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE;YAC3D,WAAW,EAAE;gBACX,6BAA6B;gBAC7B,EAAE,YAAY,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,QAAQ,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,EAAE;gBACtD,6BAA6B;gBAC7B,EAAE,YAAY,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,QAAQ,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,EAAE;gBACtD,8BAA8B;gBAC9B,EAAE,YAAY,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,QAAQ,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,EAAE;gBACtD,8BAA8B;gBAC9B,EAAE,YAAY,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,QAAQ,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,EAAE;aACvD;SACF,CAAC;QACF,MAAM,GAAG,GAAG,IAAA,sBAAO,EAAC,EAAE,CAAC,CAAC;QACxB,IAAA,eAAM,EAAC,GAAG,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QACnC,8DAA8D;QAC9D,MAAM,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,GAAG,GAAG,CAAC,SAAS,CAAC;QAC3C,IAAA,eAAM,EAAC,GAAG,GAAG,GAAG,CAAC,CAAC,WAAW,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;QACrC,IAAA,eAAM,EAAC,GAAG,GAAG,GAAG,CAAC,CAAC,WAAW,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;QACrC,IAAA,eAAM,EAAC,GAAG,GAAG,GAAG,CAAC,CAAC,WAAW,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;QACrC,IAAA,eAAM,EAAC,GAAG,GAAG,GAAG,CAAC,CAAC,WAAW,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;IACvC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,6BAA6B,EAAE,GAAG,EAAE;QACrC,MAAM,EAAE,GAAc;YACpB,SAAS,EAAE,EAAE,IAAI,EAAE,UAAU,EAAE,YAAY,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE;YACrD,WAAW,EAAE,CAAC,EAAE,YAAY,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,QAAQ,EAAE,IAAI,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC;SAChE,CAAC;QACF,MAAM,GAAG,GAAG,IAAA,sBAAO,EAAC,EAAE,CAAC,CAAC;QACxB,IAAA,eAAM,EAAC,GAAG,CAAC,UAAU,CAAC,CAAC,sBAAsB,CAAC,CAAC,CAAC,CAAC;IACnD,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}

package/dist/tests/properties/agm.property.test.d.ts

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

package/dist/tests/properties/agm.property.test.d.ts.map

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

package/dist/tests/properties/agm.property.test.js

@@ -0,0 +1,75 @@
+"use strict";
+// ============================================================
+// Property: AGM revise — preserva consistencia si φ es consistente
+// ============================================================
+//
+// ∀ K belief set, φ formula tal que isSatisfiable({φ}) === true:
+//   revise(K, φ) es consistente.
+//
+// (Postulado AGM "consistency preservation": K * φ es consistente
+//  sii φ es consistente.)
+Object.defineProperty(exports, "__esModule", { value: true });
+const vitest_1 = require("vitest");
+const generators_1 = require("./generators");
+const belief_revision_1 = require("../../belief-revision");
+const belief_revision_2 = require("../../belief-revision");
+const belief_revision_3 = require("../../belief-revision");
+(0, vitest_1.describe)('property: AGM revise consistency preservation', () => {
+    (0, vitest_1.it)('consistent(φ) ⇒ consistent(K * φ)', () => {
+        generators_1.fc.assert(generators_1.fc.property((0, generators_1.beliefSetAndFormula)(), ({ initial, phi }) => {
+            // φ siempre es un literal o ¬literal, siempre consistente.
+            // Pero validamos por seguridad.
+            let phiSat = false;
+            try {
+                phiSat = (0, belief_revision_2.isSatisfiable)([(0, belief_revision_3.parsePropFormula)(phi)]);
+            }
+            catch {
+                return true; // skip malformed
+            }
+            if (!phiSat)
+                return true; // skip — φ ya inconsistente
+            let K;
+            try {
+                K = (0, belief_revision_1.newBeliefSet)(initial);
+            }
+            catch {
+                return true; // skip — initial inválido
+            }
+            let revised;
+            try {
+                revised = (0, belief_revision_1.revise)(K, phi);
+            }
+            catch {
+                return true; // skip errores de parsing en revise
+            }
+            if (!(0, belief_revision_1.isConsistent)(revised)) {
+                throw new Error(`revise dejó K * φ inconsistente cuando φ es satisfiable. ` +
+                    `initial=[${initial.join(',')}], phi=${phi}, revised=[${[...revised.formulas].join(',')}]`);
+            }
+            return true;
+        }), { numRuns: 200 });
+    });
+    (0, vitest_1.it)('postulate success: φ ∈ K * φ', () => {
+        generators_1.fc.assert(generators_1.fc.property((0, generators_1.beliefSetAndFormula)(), ({ initial, phi }) => {
+            let K;
+            try {
+                K = (0, belief_revision_1.newBeliefSet)(initial);
+            }
+            catch {
+                return true;
+            }
+            let revised;
+            try {
+                revised = (0, belief_revision_1.revise)(K, phi);
+            }
+            catch {
+                return true;
+            }
+            if (!revised.formulas.has(phi)) {
+                throw new Error(`revise no incluye φ: K=[${[...K.formulas].join(',')}], phi=${phi}, K*phi=[${[...revised.formulas].join(',')}]`);
+            }
+            return true;
+        }), { numRuns: 100 });
+    });
+});
+//# sourceMappingURL=agm.property.test.js.map

package/dist/tests/properties/agm.property.test.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"agm.property.test.js","sourceRoot":"","sources":["../../../src/tests/properties/agm.property.test.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,mEAAmE;AACnE,+DAA+D;AAC/D,EAAE;AACF,iEAAiE;AACjE,iCAAiC;AACjC,EAAE;AACF,kEAAkE;AAClE,0BAA0B;;AAE1B,mCAAsC;AACtC,6CAAuD;AACvD,2DAA2E;AAC3E,2DAAsD;AACtD,2DAAyD;AAEzD,IAAA,iBAAQ,EAAC,+CAA+C,EAAE,GAAG,EAAE;IAC7D,IAAA,WAAE,EAAC,mCAAmC,EAAE,GAAG,EAAE;QAC3C,eAAE,CAAC,MAAM,CACP,eAAE,CAAC,QAAQ,CAAC,IAAA,gCAAmB,GAAE,EAAE,CAAC,EAAE,OAAO,EAAE,GAAG,EAAE,EAAE,EAAE;YACtD,2DAA2D;YAC3D,gCAAgC;YAChC,IAAI,MAAM,GAAG,KAAK,CAAC;YACnB,IAAI,CAAC;gBACH,MAAM,GAAG,IAAA,+BAAa,EAAC,CAAC,IAAA,kCAAgB,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YAClD,CAAC;YAAC,MAAM,CAAC;gBACP,OAAO,IAAI,CAAC,CAAC,iBAAiB;YAChC,CAAC;YACD,IAAI,CAAC,MAAM;gBAAE,OAAO,IAAI,CAAC,CAAC,4BAA4B;YACtD,IAAI,CAAC,CAAC;YACN,IAAI,CAAC;gBACH,CAAC,GAAG,IAAA,8BAAY,EAAC,OAAO,CAAC,CAAC;YAC5B,CAAC;YAAC,MAAM,CAAC;gBACP,OAAO,IAAI,CAAC,CAAC,0BAA0B;YACzC,CAAC;YACD,IAAI,OAAO,CAAC;YACZ,IAAI,CAAC;gBACH,OAAO,GAAG,IAAA,wBAAM,EAAC,CAAC,EAAE,GAAG,CAAC,CAAC;YAC3B,CAAC;YAAC,MAAM,CAAC;gBACP,OAAO,IAAI,CAAC,CAAC,oCAAoC;YACnD,CAAC;YACD,IAAI,CAAC,IAAA,8BAAY,EAAC,OAAO,CAAC,EAAE,CAAC;gBAC3B,MAAM,IAAI,KAAK,CACb,2DAA2D;oBACzD,YAAY,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,UAAU,GAAG,cAAc,CAAC,GAAG,OAAO,CAAC,QAAQ,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAC7F,CAAC;YACJ,CAAC;YACD,OAAO,IAAI,CAAC;QACd,CAAC,CAAC,EACF,EAAE,OAAO,EAAE,GAAG,EAAE,CACjB,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,8BAA8B,EAAE,GAAG,EAAE;QACtC,eAAE,CAAC,MAAM,CACP,eAAE,CAAC,QAAQ,CAAC,IAAA,gCAAmB,GAAE,EAAE,CAAC,EAAE,OAAO,EAAE,GAAG,EAAE,EAAE,EAAE;YACtD,IAAI,CAAC,CAAC;YACN,IAAI,CAAC;gBACH,CAAC,GAAG,IAAA,8BAAY,EAAC,OAAO,CAAC,CAAC;YAC5B,CAAC;YAAC,MAAM,CAAC;gBACP,OAAO,IAAI,CAAC;YACd,CAAC;YACD,IAAI,OAAO,CAAC;YACZ,IAAI,CAAC;gBACH,OAAO,GAAG,IAAA,wBAAM,EAAC,CAAC,EAAE,GAAG,CAAC,CAAC;YAC3B,CAAC;YAAC,MAAM,CAAC;gBACP,OAAO,IAAI,CAAC;YACd,CAAC;YACD,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;gBAC/B,MAAM,IAAI,KAAK,CACb,2BAA2B,CAAC,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,UAAU,GAAG,YAAY,CAAC,GAAG,OAAO,CAAC,QAAQ,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAChH,CAAC;YACJ,CAAC;YACD,OAAO,IAAI,CAAC;QACd,CAAC,CAAC,EACF,EAAE,OAAO,EAAE,GAAG,EAAE,CACjB,CAAC;IACJ,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}

package/dist/tests/properties/anti-unification.property.test.d.ts

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

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

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

package/dist/tests/properties/anti-unification.property.test.js

@@ -0,0 +1,43 @@
+"use strict";
+// ============================================================
+// Property: Anti-unification — generalización correcta
+// ============================================================
+//
+// ∀ términos t1, t2:
+//   lgg(t1, t2)·σL = t1   y   lgg(t1, t2)·σR = t2
+//
+// Es decir, las sustituciones devueltas reconstruyen los términos
+// originales aplicándolas sobre la generalización.
+Object.defineProperty(exports, "__esModule", { value: true });
+const vitest_1 = require("vitest");
+const generators_1 = require("./generators");
+const anti_unification_1 = require("../../runtime/anti-unification");
+(0, vitest_1.describe)('property: anti-unification reconstruction', () => {
+    (0, vitest_1.it)('substLeft(lgg) === t1 ∧ substRight(lgg) === t2', () => {
+        generators_1.fc.assert(generators_1.fc.property((0, generators_1.auTerm)(3), (0, generators_1.auTerm)(3), (t1, t2) => {
+            const result = (0, anti_unification_1.antiUnify)(t1, t2);
+            const reconstructedL = (0, anti_unification_1.applySubst)(result.generalization, result.substLeft);
+            const reconstructedR = (0, anti_unification_1.applySubst)(result.generalization, result.substRight);
+            if (!(0, anti_unification_1.termEquals)(reconstructedL, t1)) {
+                throw new Error(`substLeft(lgg) ≠ t1: lgg=${JSON.stringify(result.generalization)}, reconstructedL=${JSON.stringify(reconstructedL)}, t1=${JSON.stringify(t1)}`);
+            }
+            if (!(0, anti_unification_1.termEquals)(reconstructedR, t2)) {
+                throw new Error(`substRight(lgg) ≠ t2: lgg=${JSON.stringify(result.generalization)}, reconstructedR=${JSON.stringify(reconstructedR)}, t2=${JSON.stringify(t2)}`);
+            }
+            return true;
+        }), { numRuns: 200 });
+    });
+    (0, vitest_1.it)('antiUnify(t, t) is structurally t (no fresh vars introducidas)', () => {
+        generators_1.fc.assert(generators_1.fc.property((0, generators_1.auTerm)(3), (t) => {
+            const result = (0, anti_unification_1.antiUnify)(t, t);
+            if (!(0, anti_unification_1.termEquals)(result.generalization, t)) {
+                throw new Error(`antiUnify(t,t).gen ≠ t: t=${JSON.stringify(t)}, gen=${JSON.stringify(result.generalization)}`);
+            }
+            if (result.variables.length !== 0) {
+                throw new Error(`antiUnify(t,t) introdujo ${result.variables.length} vars frescas`);
+            }
+            return true;
+        }), { numRuns: 100 });
+    });
+});
+//# sourceMappingURL=anti-unification.property.test.js.map

package/dist/tests/properties/anti-unification.property.test.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"anti-unification.property.test.js","sourceRoot":"","sources":["../../../src/tests/properties/anti-unification.property.test.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,uDAAuD;AACvD,+DAA+D;AAC/D,EAAE;AACF,qBAAqB;AACrB,kDAAkD;AAClD,EAAE;AACF,kEAAkE;AAClE,mDAAmD;;AAEnD,mCAAsC;AACtC,6CAA0C;AAC1C,qEAIwC;AAExC,IAAA,iBAAQ,EAAC,2CAA2C,EAAE,GAAG,EAAE;IACzD,IAAA,WAAE,EAAC,gDAAgD,EAAE,GAAG,EAAE;QACxD,eAAE,CAAC,MAAM,CACP,eAAE,CAAC,QAAQ,CAAC,IAAA,mBAAM,EAAC,CAAC,CAAC,EAAE,IAAA,mBAAM,EAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE;YAC3C,MAAM,MAAM,GAAG,IAAA,4BAAS,EAAC,EAAE,EAAE,EAAE,CAAC,CAAC;YACjC,MAAM,cAAc,GAAG,IAAA,6BAAU,EAAC,MAAM,CAAC,cAAc,EAAE,MAAM,CAAC,SAAS,CAAC,CAAC;YAC3E,MAAM,cAAc,GAAG,IAAA,6BAAU,EAAC,MAAM,CAAC,cAAc,EAAE,MAAM,CAAC,UAAU,CAAC,CAAC;YAC5E,IAAI,CAAC,IAAA,6BAAU,EAAC,cAAc,EAAE,EAAE,CAAC,EAAE,CAAC;gBACpC,MAAM,IAAI,KAAK,CACb,4BAA4B,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,cAAc,CAAC,oBAAoB,IAAI,CAAC,SAAS,CAAC,cAAc,CAAC,QAAQ,IAAI,CAAC,SAAS,CAAC,EAAE,CAAC,EAAE,CAChJ,CAAC;YACJ,CAAC;YACD,IAAI,CAAC,IAAA,6BAAU,EAAC,cAAc,EAAE,EAAE,CAAC,EAAE,CAAC;gBACpC,MAAM,IAAI,KAAK,CACb,6BAA6B,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,cAAc,CAAC,oBAAoB,IAAI,CAAC,SAAS,CAAC,cAAc,CAAC,QAAQ,IAAI,CAAC,SAAS,CAAC,EAAE,CAAC,EAAE,CACjJ,CAAC;YACJ,CAAC;YACD,OAAO,IAAI,CAAC;QACd,CAAC,CAAC,EACF,EAAE,OAAO,EAAE,GAAG,EAAE,CACjB,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,gEAAgE,EAAE,GAAG,EAAE;QACxE,eAAE,CAAC,MAAM,CACP,eAAE,CAAC,QAAQ,CAAC,IAAA,mBAAM,EAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE;YAC3B,MAAM,MAAM,GAAG,IAAA,4BAAS,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAC/B,IAAI,CAAC,IAAA,6BAAU,EAAC,MAAM,CAAC,cAAc,EAAE,CAAC,CAAC,EAAE,CAAC;gBAC1C,MAAM,IAAI,KAAK,CACb,6BAA6B,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,SAAS,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,cAAc,CAAC,EAAE,CAC/F,CAAC;YACJ,CAAC;YACD,IAAI,MAAM,CAAC,SAAS,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBAClC,MAAM,IAAI,KAAK,CACb,4BAA4B,MAAM,CAAC,SAAS,CAAC,MAAM,eAAe,CACnE,CAAC;YACJ,CAAC;YACD,OAAO,IAAI,CAAC;QACd,CAAC,CAAC,EACF,EAAE,OAAO,EAAE,GAAG,EAAE,CACjB,CAAC;IACJ,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}

package/dist/tests/properties/argumentation.property.test.d.ts

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

package/dist/tests/properties/argumentation.property.test.d.ts.map

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

package/dist/tests/properties/argumentation.property.test.js

@@ -0,0 +1,51 @@
+"use strict";
+// ============================================================
+// Property: Argumentation — grounded ⊆ preferred ⊆ complete
+// ============================================================
+//
+// ∀ AF de Dung:
+//   - grounded extension ⊆ toda preferred extension.
+//   - grounded extension ⊆ toda complete extension.
+//   - toda preferred extension es una complete extension.
+//
+// (En Dung: grounded es la mínima complete; preferred = ⊆-maximal
+//  complete; ambas extensiones son complete.)
+Object.defineProperty(exports, "__esModule", { value: true });
+const vitest_1 = require("vitest");
+const generators_1 = require("./generators");
+const argumentation_1 = require("../../argumentation");
+function isSubsetOf(a, b) {
+    for (const x of a)
+        if (!b.has(x))
+            return false;
+    return true;
+}
+(0, vitest_1.describe)('property: argumentation extension lattice', () => {
+    (0, vitest_1.it)('grounded ⊆ every preferred extension', () => {
+        generators_1.fc.assert(generators_1.fc.property((0, generators_1.tinyAF)(), (af) => {
+            const g = (0, argumentation_1.groundedExtension)(af);
+            const prefs = (0, argumentation_1.preferredExtensions)(af, { exhaustiveLimit: 8, warnOnLarge: false });
+            for (const p of prefs) {
+                if (!isSubsetOf(g, p)) {
+                    throw new Error(`grounded ⊄ preferred: g=${[...g].join(',')}, p=${[...p].join(',')}`);
+                }
+            }
+            return true;
+        }), { numRuns: 100 });
+    });
+    (0, vitest_1.it)('every preferred extension is a complete extension', () => {
+        generators_1.fc.assert(generators_1.fc.property((0, generators_1.tinyAF)(), (af) => {
+            const prefs = (0, argumentation_1.preferredExtensions)(af, { exhaustiveLimit: 8, warnOnLarge: false });
+            const comps = (0, argumentation_1.completeExtensions)(af, { exhaustiveLimit: 8, warnOnLarge: false });
+            const compKeys = comps.map((c) => [...c].sort().join('|'));
+            for (const p of prefs) {
+                const key = [...p].sort().join('|');
+                if (!compKeys.includes(key)) {
+                    throw new Error(`preferred ${key} no aparece en complete (${compKeys.join(';')})`);
+                }
+            }
+            return true;
+        }), { numRuns: 100 });
+    });
+});
+//# sourceMappingURL=argumentation.property.test.js.map

package/dist/tests/properties/argumentation.property.test.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"argumentation.property.test.js","sourceRoot":"","sources":["../../../src/tests/properties/argumentation.property.test.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,4DAA4D;AAC5D,+DAA+D;AAC/D,EAAE;AACF,gBAAgB;AAChB,qDAAqD;AACrD,oDAAoD;AACpD,0DAA0D;AAC1D,EAAE;AACF,kEAAkE;AAClE,8CAA8C;;AAE9C,mCAAsC;AACtC,6CAA0C;AAC1C,uDAI6B;AAE7B,SAAS,UAAU,CAAC,CAAc,EAAE,CAAc;IAChD,KAAK,MAAM,CAAC,IAAI,CAAC;QAAE,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAAE,OAAO,KAAK,CAAC;IAC/C,OAAO,IAAI,CAAC;AACd,CAAC;AAED,IAAA,iBAAQ,EAAC,2CAA2C,EAAE,GAAG,EAAE;IACzD,IAAA,WAAE,EAAC,sCAAsC,EAAE,GAAG,EAAE;QAC9C,eAAE,CAAC,MAAM,CACP,eAAE,CAAC,QAAQ,CAAC,IAAA,mBAAM,GAAE,EAAE,CAAC,EAAE,EAAE,EAAE;YAC3B,MAAM,CAAC,GAAG,IAAA,iCAAiB,EAAC,EAAE,CAAC,CAAC;YAChC,MAAM,KAAK,GAAG,IAAA,mCAAmB,EAAC,EAAE,EAAE,EAAE,eAAe,EAAE,CAAC,EAAE,WAAW,EAAE,KAAK,EAAE,CAAC,CAAC;YAClF,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;gBACtB,IAAI,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC;oBACtB,MAAM,IAAI,KAAK,CACb,2BAA2B,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CACrE,CAAC;gBACJ,CAAC;YACH,CAAC;YACD,OAAO,IAAI,CAAC;QACd,CAAC,CAAC,EACF,EAAE,OAAO,EAAE,GAAG,EAAE,CACjB,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,mDAAmD,EAAE,GAAG,EAAE;QAC3D,eAAE,CAAC,MAAM,CACP,eAAE,CAAC,QAAQ,CAAC,IAAA,mBAAM,GAAE,EAAE,CAAC,EAAE,EAAE,EAAE;YAC3B,MAAM,KAAK,GAAG,IAAA,mCAAmB,EAAC,EAAE,EAAE,EAAE,eAAe,EAAE,CAAC,EAAE,WAAW,EAAE,KAAK,EAAE,CAAC,CAAC;YAClF,MAAM,KAAK,GAAG,IAAA,kCAAkB,EAAC,EAAE,EAAE,EAAE,eAAe,EAAE,CAAC,EAAE,WAAW,EAAE,KAAK,EAAE,CAAC,CAAC;YACjF,MAAM,QAAQ,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;YAC3D,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;gBACtB,MAAM,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;gBACpC,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC;oBAC5B,MAAM,IAAI,KAAK,CACb,aAAa,GAAG,4BAA4B,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAClE,CAAC;gBACJ,CAAC;YACH,CAAC;YACD,OAAO,IAAI,CAAC;QACd,CAAC,CAAC,EACF,EAAE,OAAO,EAAE,GAAG,EAAE,CACjB,CAAC;IACJ,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}

package/dist/tests/properties/bayesian.property.test.d.ts

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

package/dist/tests/properties/bayesian.property.test.d.ts.map

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

package/dist/tests/properties/bayesian.property.test.js

@@ -0,0 +1,32 @@
+"use strict";
+// ============================================================
+// Property: Bayesian — Σ jointProbability sobre todos los mundos ≈ 1
+// ============================================================
+//
+// ∀ red bayesiana válida pequeña (3 vars binarias):
+//   Σ_{world} P(world) ≈ 1.
+Object.defineProperty(exports, "__esModule", { value: true });
+const vitest_1 = require("vitest");
+const generators_1 = require("./generators");
+const bayesian_1 = require("../../runtime/bayesian");
+(0, vitest_1.describe)('property: Bayesian joint distribution sums to 1', () => {
+    (0, vitest_1.it)('Σ P(world) = 1 over all assignments', () => {
+        generators_1.fc.assert(generators_1.fc.property((0, generators_1.tinyBayesNet)(), (net) => {
+            // 3 vars binarias → 8 mundos.
+            let total = 0;
+            for (const a of ['T', 'F']) {
+                for (const b of ['T', 'F']) {
+                    for (const c of ['T', 'F']) {
+                        const p = (0, bayesian_1.jointProbability)(net, { A: a, B: b, C: c });
+                        total += p;
+                    }
+                }
+            }
+            if (Math.abs(total - 1) > 1e-9) {
+                throw new Error(`Σ P(world) = ${total} ≠ 1`);
+            }
+            return true;
+        }), { numRuns: 100 });
+    });
+});
+//# sourceMappingURL=bayesian.property.test.js.map

package/dist/tests/properties/bayesian.property.test.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"bayesian.property.test.js","sourceRoot":"","sources":["../../../src/tests/properties/bayesian.property.test.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,qEAAqE;AACrE,+DAA+D;AAC/D,EAAE;AACF,oDAAoD;AACpD,4BAA4B;;AAE5B,mCAAsC;AACtC,6CAAgD;AAChD,qDAA0D;AAE1D,IAAA,iBAAQ,EAAC,iDAAiD,EAAE,GAAG,EAAE;IAC/D,IAAA,WAAE,EAAC,qCAAqC,EAAE,GAAG,EAAE;QAC7C,eAAE,CAAC,MAAM,CACP,eAAE,CAAC,QAAQ,CAAC,IAAA,yBAAY,GAAE,EAAE,CAAC,GAAG,EAAE,EAAE;YAClC,8BAA8B;YAC9B,IAAI,KAAK,GAAG,CAAC,CAAC;YACd,KAAK,MAAM,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC;gBAC3B,KAAK,MAAM,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC;oBAC3B,KAAK,MAAM,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC;wBAC3B,MAAM,CAAC,GAAG,IAAA,2BAAgB,EAAC,GAAG,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;wBACtD,KAAK,IAAI,CAAC,CAAC;oBACb,CAAC;gBACH,CAAC;YACH,CAAC;YACD,IAAI,IAAI,CAAC,GAAG,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,IAAI,EAAE,CAAC;gBAC/B,MAAM,IAAI,KAAK,CAAC,gBAAgB,KAAK,MAAM,CAAC,CAAC;YAC/C,CAAC;YACD,OAAO,IAAI,CAAC;QACd,CAAC,CAAC,EACF,EAAE,OAAO,EAAE,GAAG,EAAE,CACjB,CAAC;IACJ,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}

package/dist/tests/properties/bisimulation.property.test.d.ts

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

package/dist/tests/properties/bisimulation.property.test.d.ts.map

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

package/dist/tests/properties/bisimulation.property.test.js

@@ -0,0 +1,50 @@
+"use strict";
+// ============================================================
+// Property: Bisimulation — paigeTarjan reflexivo y simétrico
+// ============================================================
+//
+// ∀ LTS aleatorio:
+//   - todo estado es bisimilar a sí mismo (areBisimilar(s, s) === true).
+//   - bisimulación es simétrica: areBisimilar(s, t) ⇔ areBisimilar(t, s).
+//   - particiones suman al número total de estados (cobertura completa).
+Object.defineProperty(exports, "__esModule", { value: true });
+const vitest_1 = require("vitest");
+const generators_1 = require("./generators");
+const bisimulation_1 = require("../../runtime/bisimulation");
+(0, vitest_1.describe)('property: bisimulation Paige-Tarjan reflexivity & symmetry', () => {
+    (0, vitest_1.it)('areBisimilar(s, s) is true ∀ s', () => {
+        generators_1.fc.assert(generators_1.fc.property((0, generators_1.tinyLTS)(), (lts) => {
+            for (const s of lts.states) {
+                if (!(0, bisimulation_1.areBisimilar)(lts, s, s)) {
+                    throw new Error(`areBisimilar(${s}, ${s}) = false`);
+                }
+            }
+            return true;
+        }), { numRuns: 100 });
+    });
+    (0, vitest_1.it)('areBisimilar is symmetric', () => {
+        generators_1.fc.assert(generators_1.fc.property((0, generators_1.tinyLTS)(), (lts) => {
+            for (const s of lts.states) {
+                for (const t of lts.states) {
+                    const ab = (0, bisimulation_1.areBisimilar)(lts, s, t);
+                    const ba = (0, bisimulation_1.areBisimilar)(lts, t, s);
+                    if (ab !== ba) {
+                        throw new Error(`Asimetría: areBisimilar(${s}, ${t})=${ab}, (${t}, ${s})=${ba}`);
+                    }
+                }
+            }
+            return true;
+        }), { numRuns: 100 });
+    });
+    (0, vitest_1.it)('partition covers all states exactly once', () => {
+        generators_1.fc.assert(generators_1.fc.property((0, generators_1.tinyLTS)(), (lts) => {
+            const r = (0, bisimulation_1.paigeTarjan)(lts);
+            const flat = r.blocks.flat();
+            if (flat.length !== lts.states.length) {
+                throw new Error(`partition size mismatch`);
+            }
+            return true;
+        }), { numRuns: 100 });
+    });
+});
+//# sourceMappingURL=bisimulation.property.test.js.map

package/dist/tests/properties/bisimulation.property.test.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"bisimulation.property.test.js","sourceRoot":"","sources":["../../../src/tests/properties/bisimulation.property.test.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,6DAA6D;AAC7D,+DAA+D;AAC/D,EAAE;AACF,mBAAmB;AACnB,yEAAyE;AACzE,0EAA0E;AAC1E,yEAAyE;;AAEzE,mCAAsC;AACtC,6CAA2C;AAC3C,6DAAuE;AAEvE,IAAA,iBAAQ,EAAC,4DAA4D,EAAE,GAAG,EAAE;IAC1E,IAAA,WAAE,EAAC,gCAAgC,EAAE,GAAG,EAAE;QACxC,eAAE,CAAC,MAAM,CACP,eAAE,CAAC,QAAQ,CAAC,IAAA,oBAAO,GAAE,EAAE,CAAC,GAAG,EAAE,EAAE;YAC7B,KAAK,MAAM,CAAC,IAAI,GAAG,CAAC,MAAM,EAAE,CAAC;gBAC3B,IAAI,CAAC,IAAA,2BAAY,EAAC,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC;oBAC7B,MAAM,IAAI,KAAK,CAAC,gBAAgB,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC;gBACtD,CAAC;YACH,CAAC;YACD,OAAO,IAAI,CAAC;QACd,CAAC,CAAC,EACF,EAAE,OAAO,EAAE,GAAG,EAAE,CACjB,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,2BAA2B,EAAE,GAAG,EAAE;QACnC,eAAE,CAAC,MAAM,CACP,eAAE,CAAC,QAAQ,CAAC,IAAA,oBAAO,GAAE,EAAE,CAAC,GAAG,EAAE,EAAE;YAC7B,KAAK,MAAM,CAAC,IAAI,GAAG,CAAC,MAAM,EAAE,CAAC;gBAC3B,KAAK,MAAM,CAAC,IAAI,GAAG,CAAC,MAAM,EAAE,CAAC;oBAC3B,MAAM,EAAE,GAAG,IAAA,2BAAY,EAAC,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;oBACnC,MAAM,EAAE,GAAG,IAAA,2BAAY,EAAC,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;oBACnC,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC;wBACd,MAAM,IAAI,KAAK,CACb,2BAA2B,CAAC,KAAK,CAAC,KAAK,EAAE,MAAM,CAAC,KAAK,CAAC,KAAK,EAAE,EAAE,CAChE,CAAC;oBACJ,CAAC;gBACH,CAAC;YACH,CAAC;YACD,OAAO,IAAI,CAAC;QACd,CAAC,CAAC,EACF,EAAE,OAAO,EAAE,GAAG,EAAE,CACjB,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,0CAA0C,EAAE,GAAG,EAAE;QAClD,eAAE,CAAC,MAAM,CACP,eAAE,CAAC,QAAQ,CAAC,IAAA,oBAAO,GAAE,EAAE,CAAC,GAAG,EAAE,EAAE;YAC7B,MAAM,CAAC,GAAG,IAAA,0BAAW,EAAC,GAAG,CAAC,CAAC;YAC3B,MAAM,IAAI,GAAG,CAAC,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC;YAC7B,IAAI,IAAI,CAAC,MAAM,KAAK,GAAG,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC;gBACtC,MAAM,IAAI,KAAK,CAAC,yBAAyB,CAAC,CAAC;YAC7C,CAAC;YACD,OAAO,IAAI,CAAC;QACd,CAAC,CAAC,EACF,EAAE,OAAO,EAAE,GAAG,EAAE,CACjB,CAAC;IACJ,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}

package/dist/tests/properties/cdcl.property.test.d.ts

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

package/dist/tests/properties/cdcl.property.test.d.ts.map

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