@stevenvo780/st-lang 4.7.0 → 4.8.0

package/dist/tests/tooling/proof-guidance/model.test.js

@@ -0,0 +1,165 @@
+"use strict";
+// ============================================================
+// Tests: trainModel, rankTactics, updateModel, tacticSuccessProbability
+// ============================================================
+Object.defineProperty(exports, "__esModule", { value: true });
+const vitest_1 = require("vitest");
+const proof_guidance_1 = require("../../../tooling/proof-guidance");
+function record(tactic, beforeState, afterState, successful) {
+    return { tactic, beforeState, afterState, successful };
+}
+(0, vitest_1.describe)('trainModel', () => {
+    (0, vitest_1.it)('con 10 records produce modelo con weights aprendidos', () => {
+        // Dataset sintético: 'assumption' funciona cuando hypEqualsGoal=1.
+        // 'intro' funciona cuando el goal tiene →.
+        const records = [
+            record('assumption', { goal: 'P', hypotheses: ['P'] }, { goal: '', hypotheses: ['P'] }, true),
+            record('assumption', { goal: 'Q', hypotheses: ['Q'] }, { goal: '', hypotheses: ['Q'] }, true),
+            record('assumption', { goal: 'R', hypotheses: ['R'] }, { goal: '', hypotheses: ['R'] }, true),
+            record('assumption', { goal: 'P', hypotheses: ['Q'] }, { goal: 'P', hypotheses: ['Q'] }, false),
+            record('assumption', { goal: 'A', hypotheses: ['B'] }, { goal: 'A', hypotheses: ['B'] }, false),
+            record('intro', { goal: 'P → Q', hypotheses: [] }, { goal: 'Q', hypotheses: ['P'] }, true),
+            record('intro', { goal: 'A → B', hypotheses: [] }, { goal: 'B', hypotheses: ['A'] }, true),
+            record('intro', { goal: 'X → Y', hypotheses: [] }, { goal: 'Y', hypotheses: ['X'] }, true),
+            record('intro', { goal: 'P', hypotheses: [] }, { goal: 'P', hypotheses: [] }, false),
+            record('intro', { goal: 'Q', hypotheses: [] }, { goal: 'Q', hypotheses: [] }, false),
+        ];
+        const model = (0, proof_guidance_1.trainModel)(records, { epochs: 100 });
+        (0, vitest_1.expect)(model.weights.size).toBeGreaterThan(0);
+        (0, vitest_1.expect)(model.bias.size).toBeGreaterThan(0);
+        (0, vitest_1.expect)(model.features.length).toBeGreaterThan(0);
+        // El modelo debe puntuar 'assumption' alto cuando hypEqualsGoal=1.
+        const goodForAssumption = { goal: 'P', hypotheses: ['P'] };
+        const ranked1 = (0, proof_guidance_1.rankTactics)(goodForAssumption, model, ['assumption', 'intro']);
+        (0, vitest_1.expect)(ranked1[0].tactic).toBe('assumption');
+        // Y 'intro' alto cuando el goal tiene →.
+        const goodForIntro = { goal: 'A → B', hypotheses: [] };
+        const ranked2 = (0, proof_guidance_1.rankTactics)(goodForIntro, model, ['assumption', 'intro']);
+        (0, vitest_1.expect)(ranked2[0].tactic).toBe('intro');
+    });
+    (0, vitest_1.it)('modelo vacío (sin records) tiene weights vacíos pero rankea sin crashear', () => {
+        const model = (0, proof_guidance_1.trainModel)([]);
+        (0, vitest_1.expect)(model.weights.size).toBe(0);
+        const ranked = (0, proof_guidance_1.rankTactics)({ goal: 'P', hypotheses: [] }, model, ['a', 'b', 'c']);
+        (0, vitest_1.expect)(ranked.length).toBe(3);
+        // Todas con score 0 — orden estable por idx.
+        (0, vitest_1.expect)(ranked.every((r) => r.score === 0)).toBe(true);
+        (0, vitest_1.expect)(ranked.map((r) => r.tactic)).toEqual(['a', 'b', 'c']);
+    });
+});
+(0, vitest_1.describe)('rankTactics', () => {
+    (0, vitest_1.it)('ordena consistentemente: mismo state + model + candidates → mismo ranking', () => {
+        const records = [
+            record('apply', { goal: 'P', hypotheses: ['P → Q'] }, { goal: 'Q', hypotheses: [] }, true),
+            record('apply', { goal: 'A', hypotheses: ['A → B'] }, { goal: 'B', hypotheses: [] }, true),
+            record('intro', { goal: 'P → Q', hypotheses: [] }, { goal: 'Q', hypotheses: ['P'] }, true),
+            record('intro', { goal: 'X → Y', hypotheses: [] }, { goal: 'Y', hypotheses: ['X'] }, true),
+            record('apply', { goal: 'P', hypotheses: [] }, { goal: 'P', hypotheses: [] }, false),
+        ];
+        const model = (0, proof_guidance_1.trainModel)(records, { epochs: 80 });
+        const state = { goal: 'P', hypotheses: ['P → Q'] };
+        const r1 = (0, proof_guidance_1.rankTactics)(state, model, ['intro', 'apply', 'assumption']);
+        const r2 = (0, proof_guidance_1.rankTactics)(state, model, ['intro', 'apply', 'assumption']);
+        (0, vitest_1.expect)(r1).toEqual(r2);
+    });
+    (0, vitest_1.it)('candidatos no vistos en training reciben score 0 y quedan al final', () => {
+        const records = [
+            record('foo', { goal: 'P', hypotheses: ['P'] }, { goal: '', hypotheses: ['P'] }, true),
+            record('foo', { goal: 'Q', hypotheses: ['Q'] }, { goal: '', hypotheses: ['Q'] }, true),
+            record('foo', { goal: 'R', hypotheses: ['R'] }, { goal: '', hypotheses: ['R'] }, true),
+        ];
+        const model = (0, proof_guidance_1.trainModel)(records, { epochs: 80 });
+        const state = { goal: 'P', hypotheses: ['P'] };
+        const ranked = (0, proof_guidance_1.rankTactics)(state, model, ['nunca-visto', 'foo']);
+        (0, vitest_1.expect)(ranked[0].tactic).toBe('foo');
+        (0, vitest_1.expect)(ranked[0].score).toBeGreaterThan(ranked[1].score);
+    });
+    (0, vitest_1.it)('tie-break determinístico cuando todos los scores son iguales', () => {
+        const model = (0, proof_guidance_1.createEmptyModel)();
+        const state = { goal: 'P', hypotheses: [] };
+        const ranked = (0, proof_guidance_1.rankTactics)(state, model, ['c', 'b', 'a']);
+        (0, vitest_1.expect)(ranked.map((r) => r.tactic)).toEqual(['c', 'b', 'a']); // mismo orden de entrada
+    });
+});
+(0, vitest_1.describe)('updateModel', () => {
+    (0, vitest_1.it)('converge con repeated updates: la probabilidad estimada se mueve hacia el target', () => {
+        let model = (0, proof_guidance_1.createEmptyModel)();
+        const state = { goal: 'P', hypotheses: ['P'] };
+        const successRecord = {
+            tactic: 'assumption',
+            beforeState: state,
+            afterState: { goal: '', hypotheses: ['P'] },
+            successful: true,
+        };
+        const p0 = (0, proof_guidance_1.tacticSuccessProbability)(state, model, 'assumption');
+        (0, vitest_1.expect)(p0).toBeCloseTo(0.5); // bias 0 + features × 0 → sigmoid(0)
+        // 200 actualizaciones positivas → la probabilidad debe subir mucho.
+        for (let i = 0; i < 200; i++) {
+            model = (0, proof_guidance_1.updateModel)(model, successRecord, 0.3);
+        }
+        const pAfter = (0, proof_guidance_1.tacticSuccessProbability)(state, model, 'assumption');
+        (0, vitest_1.expect)(pAfter).toBeGreaterThan(0.9);
+    });
+    (0, vitest_1.it)('updateModel no muta el modelo original (immutable update)', () => {
+        const model = (0, proof_guidance_1.createEmptyModel)();
+        const record = {
+            tactic: 'foo',
+            beforeState: { goal: 'P', hypotheses: ['P'] },
+            afterState: { goal: '', hypotheses: ['P'] },
+            successful: true,
+        };
+        const sizeBefore = model.weights.size;
+        const biasBefore = model.bias.size;
+        const next = (0, proof_guidance_1.updateModel)(model, record, 0.5);
+        (0, vitest_1.expect)(model.weights.size).toBe(sizeBefore);
+        (0, vitest_1.expect)(model.bias.size).toBe(biasBefore);
+        (0, vitest_1.expect)(next.weights.size).toBeGreaterThanOrEqual(sizeBefore);
+    });
+    (0, vitest_1.it)('updates negativos bajan la probabilidad', () => {
+        let model = (0, proof_guidance_1.createEmptyModel)();
+        const state = { goal: 'P', hypotheses: [] };
+        const failRecord = {
+            tactic: 'wrong-tactic',
+            beforeState: state,
+            afterState: state,
+            successful: false,
+        };
+        for (let i = 0; i < 200; i++) {
+            model = (0, proof_guidance_1.updateModel)(model, failRecord, 0.3);
+        }
+        const p = (0, proof_guidance_1.tacticSuccessProbability)(state, model, 'wrong-tactic');
+        (0, vitest_1.expect)(p).toBeLessThan(0.1);
+    });
+});
+(0, vitest_1.describe)('proofDepthRemaining weighting', () => {
+    (0, vitest_1.it)('records con menos depth remaining tienen más peso en train', () => {
+        // Mismos features y mismas tácticas; el record "close to QED" pesa más.
+        const records = [
+            {
+                tactic: 'finish',
+                beforeState: { goal: 'P', hypotheses: ['P'] },
+                afterState: { goal: '', hypotheses: ['P'] },
+                successful: true,
+                proofDepthRemaining: 0,
+            },
+            {
+                tactic: 'finish',
+                beforeState: { goal: 'Q', hypotheses: ['Q'] },
+                afterState: { goal: '', hypotheses: ['Q'] },
+                successful: true,
+                proofDepthRemaining: 0,
+            },
+            {
+                tactic: 'finish',
+                beforeState: { goal: 'R', hypotheses: ['R'] },
+                afterState: { goal: '', hypotheses: ['R'] },
+                successful: true,
+                proofDepthRemaining: 0,
+            },
+        ];
+        const model = (0, proof_guidance_1.trainModel)(records, { epochs: 100 });
+        const p = (0, proof_guidance_1.tacticSuccessProbability)({ goal: 'X', hypotheses: ['X'] }, model, 'finish');
+        (0, vitest_1.expect)(p).toBeGreaterThan(0.6);
+    });
+});
+//# sourceMappingURL=model.test.js.map

package/dist/tests/tooling/proof-guidance/model.test.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"model.test.js","sourceRoot":"","sources":["../../../../src/tests/tooling/proof-guidance/model.test.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,wEAAwE;AACxE,+DAA+D;;AAE/D,mCAA8C;AAC9C,oEAMyC;AAGzC,SAAS,MAAM,CACb,MAAc,EACd,WAAuB,EACvB,UAAsB,EACtB,UAAmB;IAEnB,OAAO,EAAE,MAAM,EAAE,WAAW,EAAE,UAAU,EAAE,UAAU,EAAE,CAAC;AACzD,CAAC;AAED,IAAA,iBAAQ,EAAC,YAAY,EAAE,GAAG,EAAE;IAC1B,IAAA,WAAE,EAAC,sDAAsD,EAAE,GAAG,EAAE;QAC9D,mEAAmE;QACnE,2CAA2C;QAC3C,MAAM,OAAO,GAAmB;YAC9B,MAAM,CAAC,YAAY,EAAE,EAAE,IAAI,EAAE,GAAG,EAAE,UAAU,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,IAAI,EAAE,EAAE,EAAE,UAAU,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC;YAC7F,MAAM,CAAC,YAAY,EAAE,EAAE,IAAI,EAAE,GAAG,EAAE,UAAU,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,IAAI,EAAE,EAAE,EAAE,UAAU,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC;YAC7F,MAAM,CAAC,YAAY,EAAE,EAAE,IAAI,EAAE,GAAG,EAAE,UAAU,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,IAAI,EAAE,EAAE,EAAE,UAAU,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC;YAC7F,MAAM,CACJ,YAAY,EACZ,EAAE,IAAI,EAAE,GAAG,EAAE,UAAU,EAAE,CAAC,GAAG,CAAC,EAAE,EAChC,EAAE,IAAI,EAAE,GAAG,EAAE,UAAU,EAAE,CAAC,GAAG,CAAC,EAAE,EAChC,KAAK,CACN;YACD,MAAM,CACJ,YAAY,EACZ,EAAE,IAAI,EAAE,GAAG,EAAE,UAAU,EAAE,CAAC,GAAG,CAAC,EAAE,EAChC,EAAE,IAAI,EAAE,GAAG,EAAE,UAAU,EAAE,CAAC,GAAG,CAAC,EAAE,EAChC,KAAK,CACN;YACD,MAAM,CAAC,OAAO,EAAE,EAAE,IAAI,EAAE,OAAO,EAAE,UAAU,EAAE,EAAE,EAAE,EAAE,EAAE,IAAI,EAAE,GAAG,EAAE,UAAU,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC;YAC1F,MAAM,CAAC,OAAO,EAAE,EAAE,IAAI,EAAE,OAAO,EAAE,UAAU,EAAE,EAAE,EAAE,EAAE,EAAE,IAAI,EAAE,GAAG,EAAE,UAAU,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC;YAC1F,MAAM,CAAC,OAAO,EAAE,EAAE,IAAI,EAAE,OAAO,EAAE,UAAU,EAAE,EAAE,EAAE,EAAE,EAAE,IAAI,EAAE,GAAG,EAAE,UAAU,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC;YAC1F,MAAM,CAAC,OAAO,EAAE,EAAE,IAAI,EAAE,GAAG,EAAE,UAAU,EAAE,EAAE,EAAE,EAAE,EAAE,IAAI,EAAE,GAAG,EAAE,UAAU,EAAE,EAAE,EAAE,EAAE,KAAK,CAAC;YACpF,MAAM,CAAC,OAAO,EAAE,EAAE,IAAI,EAAE,GAAG,EAAE,UAAU,EAAE,EAAE,EAAE,EAAE,EAAE,IAAI,EAAE,GAAG,EAAE,UAAU,EAAE,EAAE,EAAE,EAAE,KAAK,CAAC;SACrF,CAAC;QAEF,MAAM,KAAK,GAAG,IAAA,2BAAU,EAAC,OAAO,EAAE,EAAE,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC;QAEnD,IAAA,eAAM,EAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;QAC9C,IAAA,eAAM,EAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;QAC3C,IAAA,eAAM,EAAC,KAAK,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;QAEjD,mEAAmE;QACnE,MAAM,iBAAiB,GAAe,EAAE,IAAI,EAAE,GAAG,EAAE,UAAU,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC;QACvE,MAAM,OAAO,GAAG,IAAA,4BAAW,EAAC,iBAAiB,EAAE,KAAK,EAAE,CAAC,YAAY,EAAE,OAAO,CAAC,CAAC,CAAC;QAC/E,IAAA,eAAM,EAAC,OAAO,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;QAE7C,yCAAyC;QACzC,MAAM,YAAY,GAAe,EAAE,IAAI,EAAE,OAAO,EAAE,UAAU,EAAE,EAAE,EAAE,CAAC;QACnE,MAAM,OAAO,GAAG,IAAA,4BAAW,EAAC,YAAY,EAAE,KAAK,EAAE,CAAC,YAAY,EAAE,OAAO,CAAC,CAAC,CAAC;QAC1E,IAAA,eAAM,EAAC,OAAO,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IAC1C,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,0EAA0E,EAAE,GAAG,EAAE;QAClF,MAAM,KAAK,GAAG,IAAA,2BAAU,EAAC,EAAE,CAAC,CAAC;QAC7B,IAAA,eAAM,EAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACnC,MAAM,MAAM,GAAG,IAAA,4BAAW,EAAC,EAAE,IAAI,EAAE,GAAG,EAAE,UAAU,EAAE,EAAE,EAAE,EAAE,KAAK,EAAE,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;QAClF,IAAA,eAAM,EAAC,MAAM,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC9B,6CAA6C;QAC7C,IAAA,eAAM,EAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACtD,IAAA,eAAM,EAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;IAC/D,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,aAAa,EAAE,GAAG,EAAE;IAC3B,IAAA,WAAE,EAAC,2EAA2E,EAAE,GAAG,EAAE;QACnF,MAAM,OAAO,GAAmB;YAC9B,MAAM,CAAC,OAAO,EAAE,EAAE,IAAI,EAAE,GAAG,EAAE,UAAU,EAAE,CAAC,OAAO,CAAC,EAAE,EAAE,EAAE,IAAI,EAAE,GAAG,EAAE,UAAU,EAAE,EAAE,EAAE,EAAE,IAAI,CAAC;YAC1F,MAAM,CAAC,OAAO,EAAE,EAAE,IAAI,EAAE,GAAG,EAAE,UAAU,EAAE,CAAC,OAAO,CAAC,EAAE,EAAE,EAAE,IAAI,EAAE,GAAG,EAAE,UAAU,EAAE,EAAE,EAAE,EAAE,IAAI,CAAC;YAC1F,MAAM,CAAC,OAAO,EAAE,EAAE,IAAI,EAAE,OAAO,EAAE,UAAU,EAAE,EAAE,EAAE,EAAE,EAAE,IAAI,EAAE,GAAG,EAAE,UAAU,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC;YAC1F,MAAM,CAAC,OAAO,EAAE,EAAE,IAAI,EAAE,OAAO,EAAE,UAAU,EAAE,EAAE,EAAE,EAAE,EAAE,IAAI,EAAE,GAAG,EAAE,UAAU,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC;YAC1F,MAAM,CAAC,OAAO,EAAE,EAAE,IAAI,EAAE,GAAG,EAAE,UAAU,EAAE,EAAE,EAAE,EAAE,EAAE,IAAI,EAAE,GAAG,EAAE,UAAU,EAAE,EAAE,EAAE,EAAE,KAAK,CAAC;SACrF,CAAC;QACF,MAAM,KAAK,GAAG,IAAA,2BAAU,EAAC,OAAO,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,CAAC,CAAC;QAClD,MAAM,KAAK,GAAe,EAAE,IAAI,EAAE,GAAG,EAAE,UAAU,EAAE,CAAC,OAAO,CAAC,EAAE,CAAC;QAC/D,MAAM,EAAE,GAAG,IAAA,4BAAW,EAAC,KAAK,EAAE,KAAK,EAAE,CAAC,OAAO,EAAE,OAAO,EAAE,YAAY,CAAC,CAAC,CAAC;QACvE,MAAM,EAAE,GAAG,IAAA,4BAAW,EAAC,KAAK,EAAE,KAAK,EAAE,CAAC,OAAO,EAAE,OAAO,EAAE,YAAY,CAAC,CAAC,CAAC;QACvE,IAAA,eAAM,EAAC,EAAE,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;IACzB,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,oEAAoE,EAAE,GAAG,EAAE;QAC5E,MAAM,OAAO,GAAmB;YAC9B,MAAM,CAAC,KAAK,EAAE,EAAE,IAAI,EAAE,GAAG,EAAE,UAAU,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,IAAI,EAAE,EAAE,EAAE,UAAU,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC;YACtF,MAAM,CAAC,KAAK,EAAE,EAAE,IAAI,EAAE,GAAG,EAAE,UAAU,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,IAAI,EAAE,EAAE,EAAE,UAAU,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC;YACtF,MAAM,CAAC,KAAK,EAAE,EAAE,IAAI,EAAE,GAAG,EAAE,UAAU,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,IAAI,EAAE,EAAE,EAAE,UAAU,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC;SACvF,CAAC;QACF,MAAM,KAAK,GAAG,IAAA,2BAAU,EAAC,OAAO,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,CAAC,CAAC;QAClD,MAAM,KAAK,GAAe,EAAE,IAAI,EAAE,GAAG,EAAE,UAAU,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC;QAC3D,MAAM,MAAM,GAAG,IAAA,4BAAW,EAAC,KAAK,EAAE,KAAK,EAAE,CAAC,aAAa,EAAE,KAAK,CAAC,CAAC,CAAC;QACjE,IAAA,eAAM,EAAC,MAAM,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACrC,IAAA,eAAM,EAAC,MAAM,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,eAAe,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;IAC3D,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,8DAA8D,EAAE,GAAG,EAAE;QACtE,MAAM,KAAK,GAAG,IAAA,iCAAgB,GAAE,CAAC;QACjC,MAAM,KAAK,GAAe,EAAE,IAAI,EAAE,GAAG,EAAE,UAAU,EAAE,EAAE,EAAE,CAAC;QACxD,MAAM,MAAM,GAAG,IAAA,4BAAW,EAAC,KAAK,EAAE,KAAK,EAAE,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;QAC1D,IAAA,eAAM,EAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,yBAAyB;IACzF,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,aAAa,EAAE,GAAG,EAAE;IAC3B,IAAA,WAAE,EAAC,kFAAkF,EAAE,GAAG,EAAE;QAC1F,IAAI,KAAK,GAAG,IAAA,iCAAgB,GAAE,CAAC;QAC/B,MAAM,KAAK,GAAe,EAAE,IAAI,EAAE,GAAG,EAAE,UAAU,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC;QAC3D,MAAM,aAAa,GAAiB;YAClC,MAAM,EAAE,YAAY;YACpB,WAAW,EAAE,KAAK;YAClB,UAAU,EAAE,EAAE,IAAI,EAAE,EAAE,EAAE,UAAU,EAAE,CAAC,GAAG,CAAC,EAAE;YAC3C,UAAU,EAAE,IAAI;SACjB,CAAC;QAEF,MAAM,EAAE,GAAG,IAAA,yCAAwB,EAAC,KAAK,EAAE,KAAK,EAAE,YAAY,CAAC,CAAC;QAChE,IAAA,eAAM,EAAC,EAAE,CAAC,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,qCAAqC;QAElE,oEAAoE;QACpE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;YAC7B,KAAK,GAAG,IAAA,4BAAW,EAAC,KAAK,EAAE,aAAa,EAAE,GAAG,CAAC,CAAC;QACjD,CAAC;QACD,MAAM,MAAM,GAAG,IAAA,yCAAwB,EAAC,KAAK,EAAE,KAAK,EAAE,YAAY,CAAC,CAAC;QACpE,IAAA,eAAM,EAAC,MAAM,CAAC,CAAC,eAAe,CAAC,GAAG,CAAC,CAAC;IACtC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,2DAA2D,EAAE,GAAG,EAAE;QACnE,MAAM,KAAK,GAAG,IAAA,iCAAgB,GAAE,CAAC;QACjC,MAAM,MAAM,GAAiB;YAC3B,MAAM,EAAE,KAAK;YACb,WAAW,EAAE,EAAE,IAAI,EAAE,GAAG,EAAE,UAAU,EAAE,CAAC,GAAG,CAAC,EAAE;YAC7C,UAAU,EAAE,EAAE,IAAI,EAAE,EAAE,EAAE,UAAU,EAAE,CAAC,GAAG,CAAC,EAAE;YAC3C,UAAU,EAAE,IAAI;SACjB,CAAC;QACF,MAAM,UAAU,GAAG,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC;QACtC,MAAM,UAAU,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC;QACnC,MAAM,IAAI,GAAG,IAAA,4BAAW,EAAC,KAAK,EAAE,MAAM,EAAE,GAAG,CAAC,CAAC;QAC7C,IAAA,eAAM,EAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QAC5C,IAAA,eAAM,EAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QACzC,IAAA,eAAM,EAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,sBAAsB,CAAC,UAAU,CAAC,CAAC;IAC/D,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,yCAAyC,EAAE,GAAG,EAAE;QACjD,IAAI,KAAK,GAAG,IAAA,iCAAgB,GAAE,CAAC;QAC/B,MAAM,KAAK,GAAe,EAAE,IAAI,EAAE,GAAG,EAAE,UAAU,EAAE,EAAE,EAAE,CAAC;QACxD,MAAM,UAAU,GAAiB;YAC/B,MAAM,EAAE,cAAc;YACtB,WAAW,EAAE,KAAK;YAClB,UAAU,EAAE,KAAK;YACjB,UAAU,EAAE,KAAK;SAClB,CAAC;QACF,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;YAC7B,KAAK,GAAG,IAAA,4BAAW,EAAC,KAAK,EAAE,UAAU,EAAE,GAAG,CAAC,CAAC;QAC9C,CAAC;QACD,MAAM,CAAC,GAAG,IAAA,yCAAwB,EAAC,KAAK,EAAE,KAAK,EAAE,cAAc,CAAC,CAAC;QACjE,IAAA,eAAM,EAAC,CAAC,CAAC,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC;IAC9B,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,+BAA+B,EAAE,GAAG,EAAE;IAC7C,IAAA,WAAE,EAAC,4DAA4D,EAAE,GAAG,EAAE;QACpE,wEAAwE;QACxE,MAAM,OAAO,GAAmB;YAC9B;gBACE,MAAM,EAAE,QAAQ;gBAChB,WAAW,EAAE,EAAE,IAAI,EAAE,GAAG,EAAE,UAAU,EAAE,CAAC,GAAG,CAAC,EAAE;gBAC7C,UAAU,EAAE,EAAE,IAAI,EAAE,EAAE,EAAE,UAAU,EAAE,CAAC,GAAG,CAAC,EAAE;gBAC3C,UAAU,EAAE,IAAI;gBAChB,mBAAmB,EAAE,CAAC;aACvB;YACD;gBACE,MAAM,EAAE,QAAQ;gBAChB,WAAW,EAAE,EAAE,IAAI,EAAE,GAAG,EAAE,UAAU,EAAE,CAAC,GAAG,CAAC,EAAE;gBAC7C,UAAU,EAAE,EAAE,IAAI,EAAE,EAAE,EAAE,UAAU,EAAE,CAAC,GAAG,CAAC,EAAE;gBAC3C,UAAU,EAAE,IAAI;gBAChB,mBAAmB,EAAE,CAAC;aACvB;YACD;gBACE,MAAM,EAAE,QAAQ;gBAChB,WAAW,EAAE,EAAE,IAAI,EAAE,GAAG,EAAE,UAAU,EAAE,CAAC,GAAG,CAAC,EAAE;gBAC7C,UAAU,EAAE,EAAE,IAAI,EAAE,EAAE,EAAE,UAAU,EAAE,CAAC,GAAG,CAAC,EAAE;gBAC3C,UAAU,EAAE,IAAI;gBAChB,mBAAmB,EAAE,CAAC;aACvB;SACF,CAAC;QAEF,MAAM,KAAK,GAAG,IAAA,2BAAU,EAAC,OAAO,EAAE,EAAE,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC;QACnD,MAAM,CAAC,GAAG,IAAA,yCAAwB,EAAC,EAAE,IAAI,EAAE,GAAG,EAAE,UAAU,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,KAAK,EAAE,QAAQ,CAAC,CAAC;QACtF,IAAA,eAAM,EAAC,CAAC,CAAC,CAAC,eAAe,CAAC,GAAG,CAAC,CAAC;IACjC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}

package/dist/tests/tooling/proof-guidance/search.test.d.ts

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

package/dist/tests/tooling/proof-guidance/search.test.d.ts.map

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

package/dist/tests/tooling/proof-guidance/search.test.js

@@ -0,0 +1,238 @@
+"use strict";
+// ============================================================
+// Tests: guidedSearch (beam search guiada por modelo)
+// ============================================================
+Object.defineProperty(exports, "__esModule", { value: true });
+const vitest_1 = require("vitest");
+const proof_guidance_1 = require("../../../tooling/proof-guidance");
+/**
+ * Mini-motor de tácticas mock — lo suficientemente rico para
+ * que el beam search tenga algo no-trivial que decidir.
+ *
+ * Tácticas:
+ *  - 'assumption': cierra si goal ∈ hypotheses.
+ *  - 'intro': si goal = "A → B", deja goal = B con A agregado a hyps.
+ *  - 'modusPonens': si goal = G y hay "X → G" + "X" en hyps, cierra.
+ *  - 'split-and': si goal = "A ∧ B", deja goal = A (rama simplificada).
+ *  - 'noop': no aplica (siempre devuelve null) — táctica trampa.
+ */
+const mockApply = (state, tactic) => {
+    const goal = state.goal.trim();
+    if (tactic === 'assumption') {
+        if (state.hypotheses.some((h) => h.trim() === goal)) {
+            return { goal: '', hypotheses: state.hypotheses };
+        }
+        return null;
+    }
+    if (tactic === 'intro') {
+        const m = /^(.+?)\s*→\s*(.+)$/.exec(goal);
+        if (m) {
+            const [, antecedent, consequent] = m;
+            return {
+                goal: consequent.trim(),
+                hypotheses: [...state.hypotheses, antecedent.trim()],
+            };
+        }
+        return null;
+    }
+    if (tactic === 'modusPonens') {
+        // busca "X → G" con X también en hyps
+        for (const h of state.hypotheses) {
+            const m = /^(.+?)\s*→\s*(.+)$/.exec(h.trim());
+            if (m && m[2].trim() === goal) {
+                const x = m[1].trim();
+                if (state.hypotheses.some((h2) => h2.trim() === x)) {
+                    return { goal: '', hypotheses: state.hypotheses };
+                }
+            }
+        }
+        return null;
+    }
+    if (tactic === 'split-and') {
+        const m = /^(.+?)\s*∧\s*(.+)$/.exec(goal);
+        if (m) {
+            return { goal: m[1].trim(), hypotheses: state.hypotheses };
+        }
+        return null;
+    }
+    return null;
+};
+(0, vitest_1.describe)('guidedSearch', () => {
+    (0, vitest_1.it)('encuentra prueba simple por assumption directa (intro → assumption)', () => {
+        // Goal "A → A" requiere: intro deja goal=A con A en hyps → assumption cierra.
+        const model = (0, proof_guidance_1.createEmptyModel)();
+        const initial = { goal: 'P', hypotheses: [] };
+        // Test caso donde NO está pre-cerrado: necesita aplicar al menos 1 táctica.
+        const wrapped = { goal: 'P → P', hypotheses: [] };
+        const result = (0, proof_guidance_1.guidedSearch)(wrapped, mockApply, model, ['assumption', 'intro', 'modusPonens']);
+        (0, vitest_1.expect)(result.success).toBe(true);
+        (0, vitest_1.expect)(result.proof).toBeDefined();
+        (0, vitest_1.expect)(result.proof.length).toBeGreaterThanOrEqual(1);
+        // El último paso debe cerrar el goal.
+        (0, vitest_1.expect)(result.proof[result.proof.length - 1].successful).toBe(true);
+        // initial nunca se usa por el caller — sólo lo mantenemos para tipado.
+        void initial;
+    });
+    (0, vitest_1.it)('encuentra prueba de modus ponens: P→Q + P ⊢ Q', () => {
+        // Entrenamos un modelo trivial para que prefiera modusPonens
+        // cuando el goal está en el consecuente de una hipótesis.
+        const trainingData = [
+            {
+                tactic: 'modusPonens',
+                beforeState: { goal: 'Q', hypotheses: ['P → Q', 'P'] },
+                afterState: { goal: '', hypotheses: ['P → Q', 'P'] },
+                successful: true,
+            },
+            {
+                tactic: 'modusPonens',
+                beforeState: { goal: 'B', hypotheses: ['A → B', 'A'] },
+                afterState: { goal: '', hypotheses: ['A → B', 'A'] },
+                successful: true,
+            },
+            {
+                tactic: 'assumption',
+                beforeState: { goal: 'Q', hypotheses: ['P → Q', 'P'] },
+                afterState: { goal: 'Q', hypotheses: ['P → Q', 'P'] },
+                successful: false,
+            },
+        ];
+        const model = (0, proof_guidance_1.trainModel)(trainingData, { epochs: 100 });
+        const initial = { goal: 'Q', hypotheses: ['P → Q', 'P'] };
+        const result = (0, proof_guidance_1.guidedSearch)(initial, mockApply, model, [
+            'assumption',
+            'intro',
+            'modusPonens',
+            'split-and',
+        ]);
+        (0, vitest_1.expect)(result.success).toBe(true);
+        (0, vitest_1.expect)(result.proof).toBeDefined();
+        // La prueba minimal es 1 paso (modusPonens directo).
+        (0, vitest_1.expect)(result.proof.length).toBeGreaterThanOrEqual(1);
+        (0, vitest_1.expect)(result.proof.some((p) => p.tactic === 'modusPonens')).toBe(true);
+    });
+    (0, vitest_1.it)('encuentra prueba de implicación: ⊢ A → A usando intro', () => {
+        // Tras `intro`, queda {goal:'A', hypotheses:['A']} — `isClosed` lo detecta
+        // (assumption implícita) sin necesidad de un paso extra. La prueba se cierra
+        // en 1 táctica.
+        const model = (0, proof_guidance_1.createEmptyModel)();
+        const initial = { goal: 'A → A', hypotheses: [] };
+        const result = (0, proof_guidance_1.guidedSearch)(initial, mockApply, model, ['intro', 'assumption']);
+        (0, vitest_1.expect)(result.success).toBe(true);
+        (0, vitest_1.expect)(result.proof.length).toBeGreaterThanOrEqual(1);
+        (0, vitest_1.expect)(result.proof[0].tactic).toBe('intro');
+    });
+    (0, vitest_1.it)('respeta timeout: retorna failure con reason=timeout si excede el presupuesto', () => {
+        // Apply que tarda artificialmente — usamos busy-wait corto.
+        const slowApply = (state) => {
+            const t0 = Date.now();
+            while (Date.now() - t0 < 5) {
+                /* burn */
+            }
+            // Nunca cierra el goal → search nunca tendrá éxito.
+            return { goal: state.goal + 'x', hypotheses: state.hypotheses };
+        };
+        const model = (0, proof_guidance_1.createEmptyModel)();
+        const initial = { goal: 'P', hypotheses: [] };
+        const result = (0, proof_guidance_1.guidedSearch)(initial, slowApply, model, ['t1', 't2', 't3'], {
+            timeoutMs: 20,
+            maxDepth: 50,
+            beamWidth: 5,
+        });
+        (0, vitest_1.expect)(result.success).toBe(false);
+        (0, vitest_1.expect)(result.reason === 'timeout' || result.reason === 'cap').toBe(true);
+    });
+    (0, vitest_1.it)('respeta maxDepth: falla con reason=depth si no puede probar en N pasos', () => {
+        // Aplicador que estira el goal indefinidamente sin cerrarlo.
+        const grow = (state, _tactic) => ({ goal: state.goal + 'x', hypotheses: state.hypotheses });
+        const model = (0, proof_guidance_1.createEmptyModel)();
+        const initial = { goal: 'P', hypotheses: [] };
+        const result = (0, proof_guidance_1.guidedSearch)(initial, grow, model, ['extender'], {
+            maxDepth: 3,
+            timeoutMs: 5000,
+            beamWidth: 1,
+        });
+        (0, vitest_1.expect)(result.success).toBe(false);
+        (0, vitest_1.expect)(result.reason).toBe('depth');
+    });
+    (0, vitest_1.it)('beam width afecta el número de estados explorados', () => {
+        // Aplicador que produce muchos hijos: cada tactic genera estado distinto.
+        const fanout = (state, tactic) => ({
+            goal: `${state.goal}-${tactic}`,
+            hypotheses: state.hypotheses,
+        });
+        const model = (0, proof_guidance_1.createEmptyModel)();
+        const initial = { goal: 'P', hypotheses: [] };
+        const candidates = ['t1', 't2', 't3', 't4'];
+        const narrow = (0, proof_guidance_1.guidedSearch)(initial, fanout, model, candidates, {
+            maxDepth: 4,
+            beamWidth: 1,
+            timeoutMs: 1000,
+        });
+        const wide = (0, proof_guidance_1.guidedSearch)(initial, fanout, model, candidates, {
+            maxDepth: 4,
+            beamWidth: 4,
+            timeoutMs: 1000,
+        });
+        (0, vitest_1.expect)(wide.exploredStates).toBeGreaterThan(narrow.exploredStates);
+    });
+    (0, vitest_1.it)('retorna éxito inmediato (proof vacío) si el goal ya está cerrado', () => {
+        const model = (0, proof_guidance_1.createEmptyModel)();
+        const initial = { goal: '', hypotheses: [] };
+        const result = (0, proof_guidance_1.guidedSearch)(initial, mockApply, model, ['assumption']);
+        (0, vitest_1.expect)(result.success).toBe(true);
+        (0, vitest_1.expect)(result.proof).toEqual([]);
+        (0, vitest_1.expect)(result.exploredStates).toBe(0);
+    });
+    (0, vitest_1.it)('no entra en ciclo: estados ya visitados se descartan', () => {
+        // Aplicador que devuelve el mismo estado (cycle detector debe cortar).
+        const identity = (state) => ({ goal: state.goal, hypotheses: state.hypotheses });
+        const model = (0, proof_guidance_1.createEmptyModel)();
+        const initial = { goal: 'P', hypotheses: [] };
+        const result = (0, proof_guidance_1.guidedSearch)(initial, identity, model, ['noop'], {
+            maxDepth: 100,
+            timeoutMs: 1000,
+            beamWidth: 5,
+        });
+        (0, vitest_1.expect)(result.success).toBe(false);
+        (0, vitest_1.expect)(result.exploredStates).toBeLessThan(50); // no debe explotar
+    });
+    (0, vitest_1.it)('exploredStates es coherente: aumenta con maxDepth', () => {
+        const fanout = (state, tactic) => ({
+            goal: `${state.goal}|${tactic}`,
+            hypotheses: state.hypotheses,
+        });
+        const model = (0, proof_guidance_1.createEmptyModel)();
+        const initial = { goal: 'X', hypotheses: [] };
+        const shallow = (0, proof_guidance_1.guidedSearch)(initial, fanout, model, ['a', 'b', 'c'], {
+            maxDepth: 2,
+            beamWidth: 3,
+            timeoutMs: 1000,
+        });
+        const deep = (0, proof_guidance_1.guidedSearch)(initial, fanout, model, ['a', 'b', 'c'], {
+            maxDepth: 6,
+            beamWidth: 3,
+            timeoutMs: 1000,
+        });
+        (0, vitest_1.expect)(deep.exploredStates).toBeGreaterThan(shallow.exploredStates);
+    });
+});
+(0, vitest_1.describe)('integración: train → search', () => {
+    (0, vitest_1.it)('un modelo entrenado guía la búsqueda hacia tácticas exitosas (modus ponens)', () => {
+        // Train data fuerte sobre modusPonens.
+        let model = (0, proof_guidance_1.createEmptyModel)();
+        const goodRecord = {
+            tactic: 'modusPonens',
+            beforeState: { goal: 'Q', hypotheses: ['P → Q', 'P'] },
+            afterState: { goal: '', hypotheses: ['P → Q', 'P'] },
+            successful: true,
+        };
+        for (let i = 0; i < 30; i++) {
+            model = (0, proof_guidance_1.updateModel)(model, goodRecord, 0.2);
+        }
+        const initial = { goal: 'Z', hypotheses: ['Y → Z', 'Y'] };
+        const result = (0, proof_guidance_1.guidedSearch)(initial, mockApply, model, ['split-and', 'intro', 'modusPonens', 'assumption'], { beamWidth: 1, maxDepth: 5, timeoutMs: 2000 });
+        (0, vitest_1.expect)(result.success).toBe(true);
+        (0, vitest_1.expect)(result.proof[0].tactic).toBe('modusPonens');
+    });
+});
+//# sourceMappingURL=search.test.js.map

package/dist/tests/tooling/proof-guidance/search.test.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"search.test.js","sourceRoot":"","sources":["../../../../src/tests/tooling/proof-guidance/search.test.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,sDAAsD;AACtD,+DAA+D;;AAE/D,mCAA8C;AAC9C,oEAKyC;AAGzC;;;;;;;;;;GAUG;AACH,MAAM,SAAS,GAAgB,CAAC,KAAK,EAAE,MAAM,EAAE,EAAE;IAC/C,MAAM,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;IAE/B,IAAI,MAAM,KAAK,YAAY,EAAE,CAAC;QAC5B,IAAI,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,KAAK,IAAI,CAAC,EAAE,CAAC;YACpD,OAAO,EAAE,IAAI,EAAE,EAAE,EAAE,UAAU,EAAE,KAAK,CAAC,UAAU,EAAE,CAAC;QACpD,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED,IAAI,MAAM,KAAK,OAAO,EAAE,CAAC;QACvB,MAAM,CAAC,GAAG,oBAAoB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC1C,IAAI,CAAC,EAAE,CAAC;YACN,MAAM,CAAC,EAAE,UAAU,EAAE,UAAU,CAAC,GAAG,CAAC,CAAC;YACrC,OAAO;gBACL,IAAI,EAAE,UAAU,CAAC,IAAI,EAAE;gBACvB,UAAU,EAAE,CAAC,GAAG,KAAK,CAAC,UAAU,EAAE,UAAU,CAAC,IAAI,EAAE,CAAC;aACrD,CAAC;QACJ,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED,IAAI,MAAM,KAAK,aAAa,EAAE,CAAC;QAC7B,sCAAsC;QACtC,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,UAAU,EAAE,CAAC;YACjC,MAAM,CAAC,GAAG,oBAAoB,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC;YAC9C,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,KAAK,IAAI,EAAE,CAAC;gBAC9B,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;gBACtB,IAAI,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,EAAE,CAAC;oBACnD,OAAO,EAAE,IAAI,EAAE,EAAE,EAAE,UAAU,EAAE,KAAK,CAAC,UAAU,EAAE,CAAC;gBACpD,CAAC;YACH,CAAC;QACH,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED,IAAI,MAAM,KAAK,WAAW,EAAE,CAAC;QAC3B,MAAM,CAAC,GAAG,oBAAoB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC1C,IAAI,CAAC,EAAE,CAAC;YACN,OAAO,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,EAAE,UAAU,EAAE,KAAK,CAAC,UAAU,EAAE,CAAC;QAC7D,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED,OAAO,IAAI,CAAC;AACd,CAAC,CAAC;AAEF,IAAA,iBAAQ,EAAC,cAAc,EAAE,GAAG,EAAE;IAC5B,IAAA,WAAE,EAAC,qEAAqE,EAAE,GAAG,EAAE;QAC7E,8EAA8E;QAC9E,MAAM,KAAK,GAAG,IAAA,iCAAgB,GAAE,CAAC;QACjC,MAAM,OAAO,GAAe,EAAE,IAAI,EAAE,GAAG,EAAE,UAAU,EAAE,EAAE,EAAE,CAAC;QAC1D,4EAA4E;QAC5E,MAAM,OAAO,GAAe,EAAE,IAAI,EAAE,OAAO,EAAE,UAAU,EAAE,EAAE,EAAE,CAAC;QAC9D,MAAM,MAAM,GAAG,IAAA,6BAAY,EAAC,OAAO,EAAE,SAAS,EAAE,KAAK,EAAE,CAAC,YAAY,EAAE,OAAO,EAAE,aAAa,CAAC,CAAC,CAAC;QAC/F,IAAA,eAAM,EAAC,MAAM,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAClC,IAAA,eAAM,EAAC,MAAM,CAAC,KAAK,CAAC,CAAC,WAAW,EAAE,CAAC;QACnC,IAAA,eAAM,EAAC,MAAM,CAAC,KAAM,CAAC,MAAM,CAAC,CAAC,sBAAsB,CAAC,CAAC,CAAC,CAAC;QACvD,sCAAsC;QACtC,IAAA,eAAM,EAAC,MAAM,CAAC,KAAM,CAAC,MAAM,CAAC,KAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACtE,uEAAuE;QACvE,KAAK,OAAO,CAAC;IACf,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,+CAA+C,EAAE,GAAG,EAAE;QACvD,6DAA6D;QAC7D,0DAA0D;QAC1D,MAAM,YAAY,GAAmB;YACnC;gBACE,MAAM,EAAE,aAAa;gBACrB,WAAW,EAAE,EAAE,IAAI,EAAE,GAAG,EAAE,UAAU,EAAE,CAAC,OAAO,EAAE,GAAG,CAAC,EAAE;gBACtD,UAAU,EAAE,EAAE,IAAI,EAAE,EAAE,EAAE,UAAU,EAAE,CAAC,OAAO,EAAE,GAAG,CAAC,EAAE;gBACpD,UAAU,EAAE,IAAI;aACjB;YACD;gBACE,MAAM,EAAE,aAAa;gBACrB,WAAW,EAAE,EAAE,IAAI,EAAE,GAAG,EAAE,UAAU,EAAE,CAAC,OAAO,EAAE,GAAG,CAAC,EAAE;gBACtD,UAAU,EAAE,EAAE,IAAI,EAAE,EAAE,EAAE,UAAU,EAAE,CAAC,OAAO,EAAE,GAAG,CAAC,EAAE;gBACpD,UAAU,EAAE,IAAI;aACjB;YACD;gBACE,MAAM,EAAE,YAAY;gBACpB,WAAW,EAAE,EAAE,IAAI,EAAE,GAAG,EAAE,UAAU,EAAE,CAAC,OAAO,EAAE,GAAG,CAAC,EAAE;gBACtD,UAAU,EAAE,EAAE,IAAI,EAAE,GAAG,EAAE,UAAU,EAAE,CAAC,OAAO,EAAE,GAAG,CAAC,EAAE;gBACrD,UAAU,EAAE,KAAK;aAClB;SACF,CAAC;QACF,MAAM,KAAK,GAAG,IAAA,2BAAU,EAAC,YAAY,EAAE,EAAE,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC;QAExD,MAAM,OAAO,GAAe,EAAE,IAAI,EAAE,GAAG,EAAE,UAAU,EAAE,CAAC,OAAO,EAAE,GAAG,CAAC,EAAE,CAAC;QACtE,MAAM,MAAM,GAAG,IAAA,6BAAY,EAAC,OAAO,EAAE,SAAS,EAAE,KAAK,EAAE;YACrD,YAAY;YACZ,OAAO;YACP,aAAa;YACb,WAAW;SACZ,CAAC,CAAC;QAEH,IAAA,eAAM,EAAC,MAAM,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAClC,IAAA,eAAM,EAAC,MAAM,CAAC,KAAK,CAAC,CAAC,WAAW,EAAE,CAAC;QACnC,qDAAqD;QACrD,IAAA,eAAM,EAAC,MAAM,CAAC,KAAM,CAAC,MAAM,CAAC,CAAC,sBAAsB,CAAC,CAAC,CAAC,CAAC;QACvD,IAAA,eAAM,EAAC,MAAM,CAAC,KAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC3E,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,uDAAuD,EAAE,GAAG,EAAE;QAC/D,2EAA2E;QAC3E,6EAA6E;QAC7E,gBAAgB;QAChB,MAAM,KAAK,GAAG,IAAA,iCAAgB,GAAE,CAAC;QACjC,MAAM,OAAO,GAAe,EAAE,IAAI,EAAE,OAAO,EAAE,UAAU,EAAE,EAAE,EAAE,CAAC;QAC9D,MAAM,MAAM,GAAG,IAAA,6BAAY,EAAC,OAAO,EAAE,SAAS,EAAE,KAAK,EAAE,CAAC,OAAO,EAAE,YAAY,CAAC,CAAC,CAAC;QAChF,IAAA,eAAM,EAAC,MAAM,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAClC,IAAA,eAAM,EAAC,MAAM,CAAC,KAAM,CAAC,MAAM,CAAC,CAAC,sBAAsB,CAAC,CAAC,CAAC,CAAC;QACvD,IAAA,eAAM,EAAC,MAAM,CAAC,KAAM,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IAChD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,8EAA8E,EAAE,GAAG,EAAE;QACtF,4DAA4D;QAC5D,MAAM,SAAS,GAAgB,CAAC,KAAK,EAAE,EAAE;YACvC,MAAM,EAAE,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;YACtB,OAAO,IAAI,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC;gBAC3B,UAAU;YACZ,CAAC;YACD,oDAAoD;YACpD,OAAO,EAAE,IAAI,EAAE,KAAK,CAAC,IAAI,GAAG,GAAG,EAAE,UAAU,EAAE,KAAK,CAAC,UAAU,EAAE,CAAC;QAClE,CAAC,CAAC;QACF,MAAM,KAAK,GAAG,IAAA,iCAAgB,GAAE,CAAC;QACjC,MAAM,OAAO,GAAe,EAAE,IAAI,EAAE,GAAG,EAAE,UAAU,EAAE,EAAE,EAAE,CAAC;QAC1D,MAAM,MAAM,GAAG,IAAA,6BAAY,EAAC,OAAO,EAAE,SAAS,EAAE,KAAK,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,EAAE;YACzE,SAAS,EAAE,EAAE;YACb,QAAQ,EAAE,EAAE;YACZ,SAAS,EAAE,CAAC;SACb,CAAC,CAAC;QACH,IAAA,eAAM,EAAC,MAAM,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACnC,IAAA,eAAM,EAAC,MAAM,CAAC,MAAM,KAAK,SAAS,IAAI,MAAM,CAAC,MAAM,KAAK,KAAK,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC5E,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,wEAAwE,EAAE,GAAG,EAAE;QAChF,6DAA6D;QAC7D,MAAM,IAAI,GAAgB,CAAC,KAAK,EAAE,OAAO,EAAE,EAAE,CAC3C,CAAC,EAAE,IAAI,EAAE,KAAK,CAAC,IAAI,GAAG,GAAG,EAAE,UAAU,EAAE,KAAK,CAAC,UAAU,EAAE,CAAe,CAAC;QAC3E,MAAM,KAAK,GAAG,IAAA,iCAAgB,GAAE,CAAC;QACjC,MAAM,OAAO,GAAe,EAAE,IAAI,EAAE,GAAG,EAAE,UAAU,EAAE,EAAE,EAAE,CAAC;QAC1D,MAAM,MAAM,GAAG,IAAA,6BAAY,EAAC,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC,UAAU,CAAC,EAAE;YAC9D,QAAQ,EAAE,CAAC;YACX,SAAS,EAAE,IAAI;YACf,SAAS,EAAE,CAAC;SACb,CAAC,CAAC;QACH,IAAA,eAAM,EAAC,MAAM,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACnC,IAAA,eAAM,EAAC,MAAM,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IACtC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,mDAAmD,EAAE,GAAG,EAAE;QAC3D,0EAA0E;QAC1E,MAAM,MAAM,GAAgB,CAAC,KAAK,EAAE,MAAM,EAAE,EAAE,CAAC,CAAC;YAC9C,IAAI,EAAE,GAAG,KAAK,CAAC,IAAI,IAAI,MAAM,EAAE;YAC/B,UAAU,EAAE,KAAK,CAAC,UAAU;SAC7B,CAAC,CAAC;QACH,MAAM,KAAK,GAAG,IAAA,iCAAgB,GAAE,CAAC;QACjC,MAAM,OAAO,GAAe,EAAE,IAAI,EAAE,GAAG,EAAE,UAAU,EAAE,EAAE,EAAE,CAAC;QAC1D,MAAM,UAAU,GAAG,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;QAE5C,MAAM,MAAM,GAAG,IAAA,6BAAY,EAAC,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,UAAU,EAAE;YAC9D,QAAQ,EAAE,CAAC;YACX,SAAS,EAAE,CAAC;YACZ,SAAS,EAAE,IAAI;SAChB,CAAC,CAAC;QACH,MAAM,IAAI,GAAG,IAAA,6BAAY,EAAC,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,UAAU,EAAE;YAC5D,QAAQ,EAAE,CAAC;YACX,SAAS,EAAE,CAAC;YACZ,SAAS,EAAE,IAAI;SAChB,CAAC,CAAC;QAEH,IAAA,eAAM,EAAC,IAAI,CAAC,cAAc,CAAC,CAAC,eAAe,CAAC,MAAM,CAAC,cAAc,CAAC,CAAC;IACrE,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,kEAAkE,EAAE,GAAG,EAAE;QAC1E,MAAM,KAAK,GAAG,IAAA,iCAAgB,GAAE,CAAC;QACjC,MAAM,OAAO,GAAe,EAAE,IAAI,EAAE,EAAE,EAAE,UAAU,EAAE,EAAE,EAAE,CAAC;QACzD,MAAM,MAAM,GAAG,IAAA,6BAAY,EAAC,OAAO,EAAE,SAAS,EAAE,KAAK,EAAE,CAAC,YAAY,CAAC,CAAC,CAAC;QACvE,IAAA,eAAM,EAAC,MAAM,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAClC,IAAA,eAAM,EAAC,MAAM,CAAC,KAAK,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;QACjC,IAAA,eAAM,EAAC,MAAM,CAAC,cAAc,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACxC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,sDAAsD,EAAE,GAAG,EAAE;QAC9D,uEAAuE;QACvE,MAAM,QAAQ,GAAgB,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,KAAK,CAAC,IAAI,EAAE,UAAU,EAAE,KAAK,CAAC,UAAU,EAAE,CAAC,CAAC;QAC9F,MAAM,KAAK,GAAG,IAAA,iCAAgB,GAAE,CAAC;QACjC,MAAM,OAAO,GAAe,EAAE,IAAI,EAAE,GAAG,EAAE,UAAU,EAAE,EAAE,EAAE,CAAC;QAC1D,MAAM,MAAM,GAAG,IAAA,6BAAY,EAAC,OAAO,EAAE,QAAQ,EAAE,KAAK,EAAE,CAAC,MAAM,CAAC,EAAE;YAC9D,QAAQ,EAAE,GAAG;YACb,SAAS,EAAE,IAAI;YACf,SAAS,EAAE,CAAC;SACb,CAAC,CAAC;QACH,IAAA,eAAM,EAAC,MAAM,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACnC,IAAA,eAAM,EAAC,MAAM,CAAC,cAAc,CAAC,CAAC,YAAY,CAAC,EAAE,CAAC,CAAC,CAAC,mBAAmB;IACrE,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,mDAAmD,EAAE,GAAG,EAAE;QAC3D,MAAM,MAAM,GAAgB,CAAC,KAAK,EAAE,MAAM,EAAE,EAAE,CAAC,CAAC;YAC9C,IAAI,EAAE,GAAG,KAAK,CAAC,IAAI,IAAI,MAAM,EAAE;YAC/B,UAAU,EAAE,KAAK,CAAC,UAAU;SAC7B,CAAC,CAAC;QACH,MAAM,KAAK,GAAG,IAAA,iCAAgB,GAAE,CAAC;QACjC,MAAM,OAAO,GAAe,EAAE,IAAI,EAAE,GAAG,EAAE,UAAU,EAAE,EAAE,EAAE,CAAC;QAC1D,MAAM,OAAO,GAAG,IAAA,6BAAY,EAAC,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,EAAE;YACpE,QAAQ,EAAE,CAAC;YACX,SAAS,EAAE,CAAC;YACZ,SAAS,EAAE,IAAI;SAChB,CAAC,CAAC;QACH,MAAM,IAAI,GAAG,IAAA,6BAAY,EAAC,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,EAAE;YACjE,QAAQ,EAAE,CAAC;YACX,SAAS,EAAE,CAAC;YACZ,SAAS,EAAE,IAAI;SAChB,CAAC,CAAC;QACH,IAAA,eAAM,EAAC,IAAI,CAAC,cAAc,CAAC,CAAC,eAAe,CAAC,OAAO,CAAC,cAAc,CAAC,CAAC;IACtE,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,6BAA6B,EAAE,GAAG,EAAE;IAC3C,IAAA,WAAE,EAAC,6EAA6E,EAAE,GAAG,EAAE;QACrF,uCAAuC;QACvC,IAAI,KAAK,GAAG,IAAA,iCAAgB,GAAE,CAAC;QAC/B,MAAM,UAAU,GAAiB;YAC/B,MAAM,EAAE,aAAa;YACrB,WAAW,EAAE,EAAE,IAAI,EAAE,GAAG,EAAE,UAAU,EAAE,CAAC,OAAO,EAAE,GAAG,CAAC,EAAE;YACtD,UAAU,EAAE,EAAE,IAAI,EAAE,EAAE,EAAE,UAAU,EAAE,CAAC,OAAO,EAAE,GAAG,CAAC,EAAE;YACpD,UAAU,EAAE,IAAI;SACjB,CAAC;QACF,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;YAC5B,KAAK,GAAG,IAAA,4BAAW,EAAC,KAAK,EAAE,UAAU,EAAE,GAAG,CAAC,CAAC;QAC9C,CAAC;QAED,MAAM,OAAO,GAAe,EAAE,IAAI,EAAE,GAAG,EAAE,UAAU,EAAE,CAAC,OAAO,EAAE,GAAG,CAAC,EAAE,CAAC;QACtE,MAAM,MAAM,GAAG,IAAA,6BAAY,EACzB,OAAO,EACP,SAAS,EACT,KAAK,EACL,CAAC,WAAW,EAAE,OAAO,EAAE,aAAa,EAAE,YAAY,CAAC,EACnD,EAAE,SAAS,EAAE,CAAC,EAAE,QAAQ,EAAE,CAAC,EAAE,SAAS,EAAE,IAAI,EAAE,CAC/C,CAAC;QACF,IAAA,eAAM,EAAC,MAAM,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAClC,IAAA,eAAM,EAAC,MAAM,CAAC,KAAM,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;IACtD,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}

package/dist/tests/type-theory/cubical/cubical.test.d.ts

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

package/dist/tests/type-theory/cubical/cubical.test.d.ts.map

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