@stevenvo780/st-lang 4.7.0 → 4.9.0

package/dist/tooling/mathlib/ring.js

@@ -0,0 +1,91 @@
+"use strict";
+// ============================================================
+// ST Mathlib — Ring theory
+// Verificación de axiomas de anillo y check de campo.
+// ============================================================
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.verifyRing = verifyRing;
+exports.isField = isField;
+const group_1 = require("./group");
+/**
+ * Verifica los axiomas de anillo (con identidad multiplicativa):
+ *   - (R, +, 0) grupo abeliano.
+ *   - (R, ·, 1) monoide (asociatividad + identidad).
+ *   - · distribuye sobre + por ambos lados.
+ */
+function verifyRing(r, elements, eq = (a, b) => a === b) {
+    const failures = [];
+    // Grupo abeliano aditivo.
+    const addMagma = { op: r.add };
+    if (!(0, group_1.isAssociative)(addMagma, elements, eq))
+        failures.push('asociatividad aditiva');
+    if (!(0, group_1.hasIdentity)(addMagma, elements, r.zero, eq))
+        failures.push('identidad aditiva (0)');
+    if (!(0, group_1.hasInverses)({ op: r.add, identity: r.zero, inverse: r.neg }, elements, eq)) {
+        failures.push('inversos aditivos');
+    }
+    if (!(0, group_1.isCommutative)(addMagma, elements, eq))
+        failures.push('conmutatividad aditiva');
+    // Monoide multiplicativo.
+    const mulMagma = { op: r.mul };
+    if (!(0, group_1.isAssociative)(mulMagma, elements, eq))
+        failures.push('asociatividad multiplicativa');
+    if (!(0, group_1.hasIdentity)(mulMagma, elements, r.one, eq))
+        failures.push('identidad multiplicativa (1)');
+    // Distributividad: a·(b+c) = a·b + a·c  y  (a+b)·c = a·c + b·c.
+    for (const a of elements) {
+        for (const b of elements) {
+            for (const c of elements) {
+                const left = r.mul(a, r.add(b, c));
+                const right = r.add(r.mul(a, b), r.mul(a, c));
+                if (!eq(left, right)) {
+                    failures.push('distributividad por izquierda');
+                    break;
+                }
+            }
+            if (failures.includes('distributividad por izquierda'))
+                break;
+        }
+        if (failures.includes('distributividad por izquierda'))
+            break;
+    }
+    for (const a of elements) {
+        for (const b of elements) {
+            for (const c of elements) {
+                const left = r.mul(r.add(a, b), c);
+                const right = r.add(r.mul(a, c), r.mul(b, c));
+                if (!eq(left, right)) {
+                    failures.push('distributividad por derecha');
+                    break;
+                }
+            }
+            if (failures.includes('distributividad por derecha'))
+                break;
+        }
+        if (failures.includes('distributividad por derecha'))
+            break;
+    }
+    return { valid: failures.length === 0, failures };
+}
+/**
+ * Un anillo conmutativo R es campo si todo elemento no nulo tiene
+ * inverso multiplicativo dentro del conjunto. `div` debe devolver
+ * un T para argumentos válidos o `undefined` cuando no existe inverso.
+ */
+function isField(r, elements, div, eq = (a, b) => a === b) {
+    // Conmutatividad multiplicativa (requerido para campo).
+    if (!(0, group_1.isCommutative)({ op: r.mul }, elements, eq))
+        return false;
+    // Todo elemento no cero tiene inverso multiplicativo.
+    for (const a of elements) {
+        if (eq(a, r.zero))
+            continue;
+        const inv = div(r.one, a);
+        if (inv === undefined)
+            return false;
+        if (!eq(r.mul(a, inv), r.one))
+            return false;
+    }
+    return true;
+}
+//# sourceMappingURL=ring.js.map

package/dist/tooling/mathlib/ring.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"ring.js","sourceRoot":"","sources":["../../../src/tooling/mathlib/ring.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,2BAA2B;AAC3B,sDAAsD;AACtD,+DAA+D;;AAW/D,gCAqDC;AAOD,0BAiBC;AAtFD,mCAAiF;AAGjF;;;;;GAKG;AACH,SAAgB,UAAU,CACxB,CAAU,EACV,QAAa,EACb,KAA8B,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC;IAE/C,MAAM,QAAQ,GAAa,EAAE,CAAC;IAE9B,0BAA0B;IAC1B,MAAM,QAAQ,GAAG,EAAE,EAAE,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC;IAC/B,IAAI,CAAC,IAAA,qBAAa,EAAC,QAAQ,EAAE,QAAQ,EAAE,EAAE,CAAC;QAAE,QAAQ,CAAC,IAAI,CAAC,uBAAuB,CAAC,CAAC;IACnF,IAAI,CAAC,IAAA,mBAAW,EAAC,QAAQ,EAAE,QAAQ,EAAE,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC;QAAE,QAAQ,CAAC,IAAI,CAAC,uBAAuB,CAAC,CAAC;IACzF,IAAI,CAAC,IAAA,mBAAW,EAAC,EAAE,EAAE,EAAE,CAAC,CAAC,GAAG,EAAE,QAAQ,EAAE,CAAC,CAAC,IAAI,EAAE,OAAO,EAAE,CAAC,CAAC,GAAG,EAAE,EAAE,QAAQ,EAAE,EAAE,CAAC,EAAE,CAAC;QAChF,QAAQ,CAAC,IAAI,CAAC,mBAAmB,CAAC,CAAC;IACrC,CAAC;IACD,IAAI,CAAC,IAAA,qBAAa,EAAC,QAAQ,EAAE,QAAQ,EAAE,EAAE,CAAC;QAAE,QAAQ,CAAC,IAAI,CAAC,wBAAwB,CAAC,CAAC;IAEpF,0BAA0B;IAC1B,MAAM,QAAQ,GAAG,EAAE,EAAE,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC;IAC/B,IAAI,CAAC,IAAA,qBAAa,EAAC,QAAQ,EAAE,QAAQ,EAAE,EAAE,CAAC;QAAE,QAAQ,CAAC,IAAI,CAAC,8BAA8B,CAAC,CAAC;IAC1F,IAAI,CAAC,IAAA,mBAAW,EAAC,QAAQ,EAAE,QAAQ,EAAE,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC;QAAE,QAAQ,CAAC,IAAI,CAAC,8BAA8B,CAAC,CAAC;IAE/F,gEAAgE;IAChE,KAAK,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;QACzB,KAAK,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;YACzB,KAAK,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;gBACzB,MAAM,IAAI,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;gBACnC,MAAM,KAAK,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;gBAC9C,IAAI,CAAC,EAAE,CAAC,IAAI,EAAE,KAAK,CAAC,EAAE,CAAC;oBACrB,QAAQ,CAAC,IAAI,CAAC,+BAA+B,CAAC,CAAC;oBAC/C,MAAM;gBACR,CAAC;YACH,CAAC;YACD,IAAI,QAAQ,CAAC,QAAQ,CAAC,+BAA+B,CAAC;gBAAE,MAAM;QAChE,CAAC;QACD,IAAI,QAAQ,CAAC,QAAQ,CAAC,+BAA+B,CAAC;YAAE,MAAM;IAChE,CAAC;IAED,KAAK,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;QACzB,KAAK,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;YACzB,KAAK,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;gBACzB,MAAM,IAAI,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;gBACnC,MAAM,KAAK,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;gBAC9C,IAAI,CAAC,EAAE,CAAC,IAAI,EAAE,KAAK,CAAC,EAAE,CAAC;oBACrB,QAAQ,CAAC,IAAI,CAAC,6BAA6B,CAAC,CAAC;oBAC7C,MAAM;gBACR,CAAC;YACH,CAAC;YACD,IAAI,QAAQ,CAAC,QAAQ,CAAC,6BAA6B,CAAC;gBAAE,MAAM;QAC9D,CAAC;QACD,IAAI,QAAQ,CAAC,QAAQ,CAAC,6BAA6B,CAAC;YAAE,MAAM;IAC9D,CAAC;IAED,OAAO,EAAE,KAAK,EAAE,QAAQ,CAAC,MAAM,KAAK,CAAC,EAAE,QAAQ,EAAE,CAAC;AACpD,CAAC;AAED;;;;GAIG;AACH,SAAgB,OAAO,CACrB,CAAU,EACV,QAAa,EACb,GAAkC,EAClC,KAA8B,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC;IAE/C,wDAAwD;IACxD,IAAI,CAAC,IAAA,qBAAa,EAAC,EAAE,EAAE,EAAE,CAAC,CAAC,GAAG,EAAE,EAAE,QAAQ,EAAE,EAAE,CAAC;QAAE,OAAO,KAAK,CAAC;IAE9D,sDAAsD;IACtD,KAAK,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;QACzB,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC;YAAE,SAAS;QAC5B,MAAM,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;QAC1B,IAAI,GAAG,KAAK,SAAS;YAAE,OAAO,KAAK,CAAC;QACpC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC;YAAE,OAAO,KAAK,CAAC;IAC9C,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC"}

package/dist/tooling/mathlib/types.d.ts

@@ -0,0 +1,62 @@
+/**
+ * Estructura algebraica genérica: un dominio de elementos + un
+ * diccionario de operaciones + una lista de axiomas declarados.
+ *
+ * `elements` puede ser un arreglo finito (para grupos finitos como S_3)
+ * o un generador indexado (para anillos infinitos como Z donde se
+ * muestrea un subconjunto representativo).
+ */
+export interface AlgebraicStructure<T> {
+    name: string;
+    elements: T[] | ((idx: number) => T);
+    operations: Map<string, (...args: T[]) => T>;
+    axioms: AlgebraAxiom[];
+}
+/**
+ * Un axioma con su fórmula informal (template) y un verificador
+ * computacional opcional que decide si los elementos lo cumplen.
+ */
+export interface AlgebraAxiom {
+    name: string;
+    formula: string;
+    verifier?: (elements: unknown[], ops: Map<string, unknown>) => boolean;
+}
+export interface PartialOrder<T> {
+    leq(a: T, b: T): boolean;
+}
+export interface TotalOrder<T> extends PartialOrder<T> {
+    compare(a: T, b: T): -1 | 0 | 1;
+}
+export interface Magma<T> {
+    op: (a: T, b: T) => T;
+}
+export interface Semigroup<T> extends Magma<T> {
+    readonly _semigroup?: true;
+}
+export interface Monoid<T> extends Semigroup<T> {
+    identity: T;
+}
+export interface Group<T> extends Monoid<T> {
+    inverse: (a: T) => T;
+}
+export interface AbelianGroup<T> extends Group<T> {
+    readonly _abelian?: true;
+}
+export interface Ring<T> {
+    add: (a: T, b: T) => T;
+    mul: (a: T, b: T) => T;
+    zero: T;
+    one: T;
+    neg: (a: T) => T;
+}
+export interface Lemma {
+    name: string;
+    statement: string;
+    applicableTo: (structure: AlgebraicStructure<unknown>) => boolean;
+    proof?: string;
+}
+export interface VerificationResult {
+    valid: boolean;
+    failures: string[];
+}
+//# sourceMappingURL=types.d.ts.map

package/dist/tooling/mathlib/types.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../../../src/tooling/mathlib/types.ts"],"names":[],"mappings":"AAKA;;;;;;;GAOG;AACH,MAAM,WAAW,kBAAkB,CAAC,CAAC;IACnC,IAAI,EAAE,MAAM,CAAC;IACb,QAAQ,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,EAAE,MAAM,KAAK,CAAC,CAAC,CAAC;IACrC,UAAU,EAAE,GAAG,CAAC,MAAM,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC;IAC7C,MAAM,EAAE,YAAY,EAAE,CAAC;CACxB;AAED;;;GAGG;AACH,MAAM,WAAW,YAAY;IAC3B,IAAI,EAAE,MAAM,CAAC;IACb,OAAO,EAAE,MAAM,CAAC;IAChB,QAAQ,CAAC,EAAE,CAAC,QAAQ,EAAE,OAAO,EAAE,EAAE,GAAG,EAAE,GAAG,CAAC,MAAM,EAAE,OAAO,CAAC,KAAK,OAAO,CAAC;CACxE;AAMD,MAAM,WAAW,YAAY,CAAC,CAAC;IAC7B,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC;CAC1B;AAED,MAAM,WAAW,UAAU,CAAC,CAAC,CAAE,SAAQ,YAAY,CAAC,CAAC,CAAC;IACpD,OAAO,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;CACjC;AAMD,MAAM,WAAW,KAAK,CAAC,CAAC;IACtB,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC;CACvB;AAID,MAAM,WAAW,SAAS,CAAC,CAAC,CAAE,SAAQ,KAAK,CAAC,CAAC,CAAC;IAC5C,QAAQ,CAAC,UAAU,CAAC,EAAE,IAAI,CAAC;CAC5B;AAED,MAAM,WAAW,MAAM,CAAC,CAAC,CAAE,SAAQ,SAAS,CAAC,CAAC,CAAC;IAC7C,QAAQ,EAAE,CAAC,CAAC;CACb;AAED,MAAM,WAAW,KAAK,CAAC,CAAC,CAAE,SAAQ,MAAM,CAAC,CAAC,CAAC;IACzC,OAAO,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC;CACtB;AAED,MAAM,WAAW,YAAY,CAAC,CAAC,CAAE,SAAQ,KAAK,CAAC,CAAC,CAAC;IAC/C,QAAQ,CAAC,QAAQ,CAAC,EAAE,IAAI,CAAC;CAC1B;AAMD,MAAM,WAAW,IAAI,CAAC,CAAC;IACrB,GAAG,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC;IACvB,GAAG,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC;IACvB,IAAI,EAAE,CAAC,CAAC;IACR,GAAG,EAAE,CAAC,CAAC;IACP,GAAG,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC;CAClB;AAMD,MAAM,WAAW,KAAK;IACpB,IAAI,EAAE,MAAM,CAAC;IACb,SAAS,EAAE,MAAM,CAAC;IAClB,YAAY,EAAE,CAAC,SAAS,EAAE,kBAAkB,CAAC,OAAO,CAAC,KAAK,OAAO,CAAC;IAClE,KAAK,CAAC,EAAE,MAAM,CAAC;CAChB;AAMD,MAAM,WAAW,kBAAkB;IACjC,KAAK,EAAE,OAAO,CAAC;IACf,QAAQ,EAAE,MAAM,EAAE,CAAC;CACpB"}

package/dist/tooling/mathlib/types.js

@@ -0,0 +1,7 @@
+"use strict";
+// ============================================================
+// ST Mathlib — Tipos base para estructuras algebraicas
+// Inspirado en Lean mathlib, subset mínimo para enseñanza.
+// ============================================================
+Object.defineProperty(exports, "__esModule", { value: true });
+//# sourceMappingURL=types.js.map

package/dist/tooling/mathlib/types.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.js","sourceRoot":"","sources":["../../../src/tooling/mathlib/types.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,uDAAuD;AACvD,2DAA2D;AAC3D,+DAA+D"}

package/dist/tooling/proof-guidance/features.d.ts

@@ -0,0 +1,10 @@
+import type { Feature, ProofState } from './types';
+/**
+ * Extrae features del estado. Estabilidad:
+ * - mismo state → mismo array (orden, nombres, valores).
+ * - todos los valores son números finitos.
+ */
+export declare function extractFeatures(state: ProofState): Feature[];
+/** Lista cerrada de feature names — útil para inicializar el modelo. */
+export declare function featureNames(): string[];
+//# sourceMappingURL=features.d.ts.map

package/dist/tooling/proof-guidance/features.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"features.d.ts","sourceRoot":"","sources":["../../../src/tooling/proof-guidance/features.ts"],"names":[],"mappings":"AASA,OAAO,KAAK,EAAE,OAAO,EAAE,UAAU,EAAE,MAAM,SAAS,CAAC;AAgDnD;;;;GAIG;AACH,wBAAgB,eAAe,CAAC,KAAK,EAAE,UAAU,GAAG,OAAO,EAAE,CAkC5D;AAED,wEAAwE;AACxE,wBAAgB,YAAY,IAAI,MAAM,EAAE,CAMvC"}

package/dist/tooling/proof-guidance/features.js

@@ -0,0 +1,97 @@
+"use strict";
+// ============================================================
+// ST Proof Guidance — Feature extraction
+//
+// Features simples y baratas (sin embeddings). El extractor es
+// determinístico: para el mismo state siempre devuelve los mismos
+// (name, value). Los tests de `extractFeatures determinístico'
+// dependen de esa propiedad.
+// ============================================================
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.extractFeatures = extractFeatures;
+exports.featureNames = featureNames;
+/**
+ * Símbolos top-level que reconocemos como features one-hot.
+ * El orden es estable — esos son los nombres de feature usados por
+ * el modelo.
+ */
+const TOP_LEVEL_SYMBOLS = ['→', '∧', '∨', '¬', '↔', '∀', '∃', '='];
+/**
+ * Operadores que cuentan para "depth" del goal — cualquier ocurrencia
+ * de uno de estos (no solo top-level) suma 1.
+ */
+const DEPTH_OPERATORS = ['→', '∧', '∨', '¬', '↔', '∀', '∃', '⊥', '⊤'];
+function countOperators(s) {
+    let n = 0;
+    for (const op of DEPTH_OPERATORS) {
+        let idx = 0;
+        while ((idx = s.indexOf(op, idx)) !== -1) {
+            n++;
+            idx += op.length;
+        }
+    }
+    return n;
+}
+/** ¿el goal contiene el símbolo? (no necesariamente top-level). */
+function containsSymbol(goal, sym) {
+    return goal.includes(sym);
+}
+/** ¿alguna hipótesis aparece textualmente dentro del goal? */
+function hypInGoal(state) {
+    if (state.hypotheses.length === 0)
+        return false;
+    for (const h of state.hypotheses) {
+        const trimmed = h.trim();
+        if (trimmed.length > 0 && state.goal.includes(trimmed))
+            return true;
+    }
+    return false;
+}
+/** ¿alguna hipótesis es exactamente el goal? (caso trivial de assumption). */
+function hypEqualsGoal(state) {
+    const goal = state.goal.trim();
+    return state.hypotheses.some((h) => h.trim() === goal);
+}
+/**
+ * Extrae features del estado. Estabilidad:
+ * - mismo state → mismo array (orden, nombres, valores).
+ * - todos los valores son números finitos.
+ */
+function extractFeatures(state) {
+    const goal = state.goal;
+    const features = [];
+    // Conteo de hipótesis (saturado en 10 para evitar dominio del feature).
+    features.push({ name: 'numHypotheses', value: Math.min(state.hypotheses.length, 10) });
+    // Profundidad del goal (saturada en 20).
+    features.push({ name: 'goalDepth', value: Math.min(countOperators(goal), 20) });
+    // Longitud del goal en chars / 10 (proxy de complejidad sintáctica).
+    features.push({ name: 'goalLength', value: Math.min(goal.length / 10, 20) });
+    // One-hot de símbolos presentes en el goal.
+    for (const sym of TOP_LEVEL_SYMBOLS) {
+        features.push({
+            name: `hasSymbol:${sym}`,
+            value: containsSymbol(goal, sym) ? 1 : 0,
+        });
+    }
+    // Booleanos derivados.
+    features.push({ name: 'hypInGoal', value: hypInGoal(state) ? 1 : 0 });
+    features.push({ name: 'hypEqualsGoal', value: hypEqualsGoal(state) ? 1 : 0 });
+    features.push({ name: 'goalIsEmpty', value: goal.trim().length === 0 ? 1 : 0 });
+    // Goal contiene `→`, `∧`, `∨` ya está cubierto arriba pero los
+    // duplicamos con nombres explícitos del spec para legibilidad y
+    // para que los tests que buscan estos nombres pasen.
+    features.push({ name: 'goalHasArrow', value: containsSymbol(goal, '→') ? 1 : 0 });
+    features.push({ name: 'goalHasAnd', value: containsSymbol(goal, '∧') ? 1 : 0 });
+    features.push({ name: 'goalHasOr', value: containsSymbol(goal, '∨') ? 1 : 0 });
+    return features;
+}
+/** Lista cerrada de feature names — útil para inicializar el modelo. */
+function featureNames() {
+    const names = ['numHypotheses', 'goalDepth', 'goalLength'];
+    for (const sym of TOP_LEVEL_SYMBOLS)
+        names.push(`hasSymbol:${sym}`);
+    names.push('hypInGoal', 'hypEqualsGoal', 'goalIsEmpty');
+    names.push('goalHasArrow', 'goalHasAnd', 'goalHasOr');
+    return names;
+}
+//# sourceMappingURL=features.js.map

package/dist/tooling/proof-guidance/features.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"features.js","sourceRoot":"","sources":["../../../src/tooling/proof-guidance/features.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,yCAAyC;AACzC,EAAE;AACF,+DAA+D;AAC/D,kEAAkE;AAClE,+DAA+D;AAC/D,6BAA6B;AAC7B,+DAA+D;;AAuD/D,0CAkCC;AAGD,oCAMC;AA9FD;;;;GAIG;AACH,MAAM,iBAAiB,GAAG,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAU,CAAC;AAE5E;;;GAGG;AACH,MAAM,eAAe,GAAG,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAU,CAAC;AAE/E,SAAS,cAAc,CAAC,CAAS;IAC/B,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,KAAK,MAAM,EAAE,IAAI,eAAe,EAAE,CAAC;QACjC,IAAI,GAAG,GAAG,CAAC,CAAC;QACZ,OAAO,CAAC,GAAG,GAAG,CAAC,CAAC,OAAO,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC;YACzC,CAAC,EAAE,CAAC;YACJ,GAAG,IAAI,EAAE,CAAC,MAAM,CAAC;QACnB,CAAC;IACH,CAAC;IACD,OAAO,CAAC,CAAC;AACX,CAAC;AAED,mEAAmE;AACnE,SAAS,cAAc,CAAC,IAAY,EAAE,GAAW;IAC/C,OAAO,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;AAC5B,CAAC;AAED,8DAA8D;AAC9D,SAAS,SAAS,CAAC,KAAiB;IAClC,IAAI,KAAK,CAAC,UAAU,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,KAAK,CAAC;IAChD,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,UAAU,EAAE,CAAC;QACjC,MAAM,OAAO,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC;QACzB,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,IAAI,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC;YAAE,OAAO,IAAI,CAAC;IACtE,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED,8EAA8E;AAC9E,SAAS,aAAa,CAAC,KAAiB;IACtC,MAAM,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;IAC/B,OAAO,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,KAAK,IAAI,CAAC,CAAC;AACzD,CAAC;AAED;;;;GAIG;AACH,SAAgB,eAAe,CAAC,KAAiB;IAC/C,MAAM,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC;IACxB,MAAM,QAAQ,GAAc,EAAE,CAAC;IAE/B,wEAAwE;IACxE,QAAQ,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,eAAe,EAAE,KAAK,EAAE,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,UAAU,CAAC,MAAM,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC;IAEvF,yCAAyC;IACzC,QAAQ,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,WAAW,EAAE,KAAK,EAAE,IAAI,CAAC,GAAG,CAAC,cAAc,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC;IAEhF,qEAAqE;IACrE,QAAQ,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,YAAY,EAAE,KAAK,EAAE,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,GAAG,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC;IAE7E,4CAA4C;IAC5C,KAAK,MAAM,GAAG,IAAI,iBAAiB,EAAE,CAAC;QACpC,QAAQ,CAAC,IAAI,CAAC;YACZ,IAAI,EAAE,aAAa,GAAG,EAAE;YACxB,KAAK,EAAE,cAAc,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;SACzC,CAAC,CAAC;IACL,CAAC;IAED,uBAAuB;IACvB,QAAQ,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,WAAW,EAAE,KAAK,EAAE,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;IACtE,QAAQ,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,eAAe,EAAE,KAAK,EAAE,aAAa,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;IAC9E,QAAQ,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,aAAa,EAAE,KAAK,EAAE,IAAI,CAAC,IAAI,EAAE,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;IAEhF,+DAA+D;IAC/D,gEAAgE;IAChE,qDAAqD;IACrD,QAAQ,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,cAAc,EAAE,KAAK,EAAE,cAAc,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;IAClF,QAAQ,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,YAAY,EAAE,KAAK,EAAE,cAAc,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;IAChF,QAAQ,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,WAAW,EAAE,KAAK,EAAE,cAAc,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;IAE/E,OAAO,QAAQ,CAAC;AAClB,CAAC;AAED,wEAAwE;AACxE,SAAgB,YAAY;IAC1B,MAAM,KAAK,GAAa,CAAC,eAAe,EAAE,WAAW,EAAE,YAAY,CAAC,CAAC;IACrE,KAAK,MAAM,GAAG,IAAI,iBAAiB;QAAE,KAAK,CAAC,IAAI,CAAC,aAAa,GAAG,EAAE,CAAC,CAAC;IACpE,KAAK,CAAC,IAAI,CAAC,WAAW,EAAE,eAAe,EAAE,aAAa,CAAC,CAAC;IACxD,KAAK,CAAC,IAAI,CAAC,cAAc,EAAE,YAAY,EAAE,WAAW,CAAC,CAAC;IACtD,OAAO,KAAK,CAAC;AACf,CAAC"}

package/dist/tooling/proof-guidance/index.d.ts

@@ -0,0 +1,5 @@
+export type { ApplyTactic, Feature, ProofState, RankedTactic, RankingModel, SearchOptions, SearchResult, TacticRecord, } from './types';
+export { extractFeatures, featureNames } from './features';
+export { createEmptyModel, rankTactics, tacticSuccessProbability, trainModel, updateModel, } from './model';
+export { guidedSearch } from './search';
+//# sourceMappingURL=index.d.ts.map

package/dist/tooling/proof-guidance/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/tooling/proof-guidance/index.ts"],"names":[],"mappings":"AAWA,YAAY,EACV,WAAW,EACX,OAAO,EACP,UAAU,EACV,YAAY,EACZ,YAAY,EACZ,aAAa,EACb,YAAY,EACZ,YAAY,GACb,MAAM,SAAS,CAAC;AAEjB,OAAO,EAAE,eAAe,EAAE,YAAY,EAAE,MAAM,YAAY,CAAC;AAE3D,OAAO,EACL,gBAAgB,EAChB,WAAW,EACX,wBAAwB,EACxB,UAAU,EACV,WAAW,GACZ,MAAM,SAAS,CAAC;AAEjB,OAAO,EAAE,YAAY,EAAE,MAAM,UAAU,CAAC"}

package/dist/tooling/proof-guidance/index.js

@@ -0,0 +1,25 @@
+"use strict";
+// ============================================================
+// ST Proof Guidance — ML-guided proof search
+//
+// Sistema de ranking de tácticas/lemas con feature extraction
+// simple + logistic regression + beam search guiada.
+//
+// Sin dependencias externas, sin embeddings — todo deterministic
+// y barato. Pensado para integrarse al agente IA del Agora como
+// heurística previa a aplicar tácticas reales sobre ST.
+// ============================================================
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.guidedSearch = exports.updateModel = exports.trainModel = exports.tacticSuccessProbability = exports.rankTactics = exports.createEmptyModel = exports.featureNames = exports.extractFeatures = void 0;
+var features_1 = require("./features");
+Object.defineProperty(exports, "extractFeatures", { enumerable: true, get: function () { return features_1.extractFeatures; } });
+Object.defineProperty(exports, "featureNames", { enumerable: true, get: function () { return features_1.featureNames; } });
+var model_1 = require("./model");
+Object.defineProperty(exports, "createEmptyModel", { enumerable: true, get: function () { return model_1.createEmptyModel; } });
+Object.defineProperty(exports, "rankTactics", { enumerable: true, get: function () { return model_1.rankTactics; } });
+Object.defineProperty(exports, "tacticSuccessProbability", { enumerable: true, get: function () { return model_1.tacticSuccessProbability; } });
+Object.defineProperty(exports, "trainModel", { enumerable: true, get: function () { return model_1.trainModel; } });
+Object.defineProperty(exports, "updateModel", { enumerable: true, get: function () { return model_1.updateModel; } });
+var search_1 = require("./search");
+Object.defineProperty(exports, "guidedSearch", { enumerable: true, get: function () { return search_1.guidedSearch; } });
+//# sourceMappingURL=index.js.map

package/dist/tooling/proof-guidance/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/tooling/proof-guidance/index.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,6CAA6C;AAC7C,EAAE;AACF,8DAA8D;AAC9D,qDAAqD;AACrD,EAAE;AACF,iEAAiE;AACjE,gEAAgE;AAChE,wDAAwD;AACxD,+DAA+D;;;AAa/D,uCAA2D;AAAlD,2GAAA,eAAe,OAAA;AAAE,wGAAA,YAAY,OAAA;AAEtC,iCAMiB;AALf,yGAAA,gBAAgB,OAAA;AAChB,oGAAA,WAAW,OAAA;AACX,iHAAA,wBAAwB,OAAA;AACxB,mGAAA,UAAU,OAAA;AACV,oGAAA,WAAW,OAAA;AAGb,mCAAwC;AAA/B,sGAAA,YAAY,OAAA"}

package/dist/tooling/proof-guidance/model.d.ts

@@ -0,0 +1,42 @@
+import type { ProofState, RankedTactic, RankingModel, TacticRecord } from './types';
+/**
+ * Inicializa modelo vacío con feature names canónicos.
+ * Los pesos arrancan en 0 — equivalente a "uniform prior".
+ */
+export declare function createEmptyModel(): RankingModel;
+interface TrainOptions {
+    /** Pasadas sobre el dataset. Default: 50. */
+    epochs?: number;
+    /** Learning rate. Default: 0.1. */
+    learningRate?: number;
+    /** L2 regularization. Default: 0.001 — leve, evita pesos enormes. */
+    l2?: number;
+}
+/**
+ * Entrena un `RankingModel` via logistic regression mini-batch full-epoch.
+ *
+ * Para cada record: target = `successful ? 1 : 0`, ponderado por
+ * `1 / (1 + proofDepthRemaining ?? 0)` cuando está presente — tácticas
+ * que dejan menos profundidad pesan más.
+ *
+ * Las features son las de `extractFeatures(record.beforeState)`.
+ */
+export declare function trainModel(records: TacticRecord[], opts?: TrainOptions): RankingModel;
+/**
+ * Rankea candidatas por score descendente. Las tácticas sin pesos
+ * aprendidos reciben score 0 (bias 0 + features × 0) y quedan al
+ * final establemente (sort estable por index).
+ */
+export declare function rankTactics(state: ProofState, model: RankingModel, candidates: string[]): RankedTactic[];
+/**
+ * Update online: 1 paso de gradient descent con el record nuevo.
+ * Devuelve un modelo nuevo (no mutación in-place del Map original).
+ *
+ * Útil cuando el agente IA acaba de probar una táctica y queremos
+ * incorporar la señal sin re-entrenar desde cero.
+ */
+export declare function updateModel(model: RankingModel, record: TacticRecord, learningRate?: number): RankingModel;
+/** Probabilidad calibrada [0,1] de éxito según el modelo. */
+export declare function tacticSuccessProbability(state: ProofState, model: RankingModel, tactic: string): number;
+export {};
+//# sourceMappingURL=model.d.ts.map

package/dist/tooling/proof-guidance/model.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"model.d.ts","sourceRoot":"","sources":["../../../src/tooling/proof-guidance/model.ts"],"names":[],"mappings":"AASA,OAAO,KAAK,EAAW,UAAU,EAAE,YAAY,EAAE,YAAY,EAAE,YAAY,EAAE,MAAM,SAAS,CAAC;AAgC7F;;;GAGG;AACH,wBAAgB,gBAAgB,IAAI,YAAY,CAM/C;AAED,UAAU,YAAY;IACpB,6CAA6C;IAC7C,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB,mCAAmC;IACnC,YAAY,CAAC,EAAE,MAAM,CAAC;IACtB,qEAAqE;IACrE,EAAE,CAAC,EAAE,MAAM,CAAC;CACb;AAED;;;;;;;;GAQG;AACH,wBAAgB,UAAU,CAAC,OAAO,EAAE,YAAY,EAAE,EAAE,IAAI,GAAE,YAAiB,GAAG,YAAY,CAuCzF;AAED;;;;GAIG;AACH,wBAAgB,WAAW,CACzB,KAAK,EAAE,UAAU,EACjB,KAAK,EAAE,YAAY,EACnB,UAAU,EAAE,MAAM,EAAE,GACnB,YAAY,EAAE,CAchB;AAED;;;;;;GAMG;AACH,wBAAgB,WAAW,CACzB,KAAK,EAAE,YAAY,EACnB,MAAM,EAAE,YAAY,EACpB,YAAY,SAAM,GACjB,YAAY,CA2Bd;AAED,6DAA6D;AAC7D,wBAAgB,wBAAwB,CACtC,KAAK,EAAE,UAAU,EACjB,KAAK,EAAE,YAAY,EACnB,MAAM,EAAE,MAAM,GACb,MAAM,CAGR"}

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

@@ -0,0 +1,149 @@
+"use strict";
+// ============================================================
+// ST Proof Guidance — Modelo de ranking
+//
+// Aprende un peso por par (tactic, feature) via logistic regression
+// con descenso por gradiente. Sin embeddings, sin librerías externas
+// — todo en memoria, vectorizable a mano.
+// ============================================================
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.createEmptyModel = createEmptyModel;
+exports.trainModel = trainModel;
+exports.rankTactics = rankTactics;
+exports.updateModel = updateModel;
+exports.tacticSuccessProbability = tacticSuccessProbability;
+const features_1 = require("./features");
+const KEY_SEP = '::';
+function weightKey(tactic, featureName) {
+    return `${tactic}${KEY_SEP}${featureName}`;
+}
+function sigmoid(z) {
+    // Clamp para evitar overflow numérico en exp().
+    if (z > 30)
+        return 1;
+    if (z < -30)
+        return 0;
+    return 1 / (1 + Math.exp(-z));
+}
+/**
+ * Score lineal de una táctica para un set de features.
+ * z = bias[tactic] + Σ_f weights[tactic, f] * featureValue.
+ */
+function linearScore(tactic, features, model) {
+    let z = model.bias.get(tactic) ?? 0;
+    for (const f of features) {
+        const w = model.weights.get(weightKey(tactic, f.name));
+        if (w !== undefined)
+            z += w * f.value;
+    }
+    return z;
+}
+/**
+ * Inicializa modelo vacío con feature names canónicos.
+ * Los pesos arrancan en 0 — equivalente a "uniform prior".
+ */
+function createEmptyModel() {
+    return {
+        features: (0, features_1.featureNames)(),
+        weights: new Map(),
+        bias: new Map(),
+    };
+}
+/**
+ * Entrena un `RankingModel` via logistic regression mini-batch full-epoch.
+ *
+ * Para cada record: target = `successful ? 1 : 0`, ponderado por
+ * `1 / (1 + proofDepthRemaining ?? 0)` cuando está presente — tácticas
+ * que dejan menos profundidad pesan más.
+ *
+ * Las features son las de `extractFeatures(record.beforeState)`.
+ */
+function trainModel(records, opts = {}) {
+    const epochs = opts.epochs ?? 50;
+    const lr = opts.learningRate ?? 0.1;
+    const l2 = opts.l2 ?? 0.001;
+    const model = createEmptyModel();
+    if (records.length === 0)
+        return model;
+    // Pre-extraemos features por record (1 vez, no por epoch).
+    const extracted = records.map((r) => ({
+        tactic: r.tactic,
+        features: (0, features_1.extractFeatures)(r.beforeState),
+        target: r.successful ? 1 : 0,
+        weight: r.proofDepthRemaining !== undefined ? 1 / (1 + Math.max(0, r.proofDepthRemaining)) : 1,
+    }));
+    for (let epoch = 0; epoch < epochs; epoch++) {
+        for (const sample of extracted) {
+            const z = linearScore(sample.tactic, sample.features, model);
+            const p = sigmoid(z);
+            const error = (p - sample.target) * sample.weight;
+            // Gradiente por feature.
+            for (const f of sample.features) {
+                const key = weightKey(sample.tactic, f.name);
+                const w = model.weights.get(key) ?? 0;
+                const grad = error * f.value + l2 * w;
+                model.weights.set(key, w - lr * grad);
+            }
+            // Gradiente del bias.
+            const b = model.bias.get(sample.tactic) ?? 0;
+            const gradB = error + l2 * b;
+            model.bias.set(sample.tactic, b - lr * gradB);
+        }
+    }
+    return model;
+}
+/**
+ * Rankea candidatas por score descendente. Las tácticas sin pesos
+ * aprendidos reciben score 0 (bias 0 + features × 0) y quedan al
+ * final establemente (sort estable por index).
+ */
+function rankTactics(state, model, candidates) {
+    const features = (0, features_1.extractFeatures)(state);
+    const scored = candidates.map((tactic, idx) => ({
+        tactic,
+        score: linearScore(tactic, features, model),
+        idx,
+    }));
+    scored.sort((a, b) => {
+        if (b.score !== a.score)
+            return b.score - a.score;
+        return a.idx - b.idx; // tie-break determinístico.
+    });
+    return scored.map(({ tactic, score }) => ({ tactic, score }));
+}
+/**
+ * Update online: 1 paso de gradient descent con el record nuevo.
+ * Devuelve un modelo nuevo (no mutación in-place del Map original).
+ *
+ * Útil cuando el agente IA acaba de probar una táctica y queremos
+ * incorporar la señal sin re-entrenar desde cero.
+ */
+function updateModel(model, record, learningRate = 0.1) {
+    const next = {
+        features: model.features,
+        weights: new Map(model.weights),
+        bias: new Map(model.bias),
+    };
+    const features = (0, features_1.extractFeatures)(record.beforeState);
+    const target = record.successful ? 1 : 0;
+    const sampleWeight = record.proofDepthRemaining !== undefined
+        ? 1 / (1 + Math.max(0, record.proofDepthRemaining))
+        : 1;
+    const z = linearScore(record.tactic, features, next);
+    const p = sigmoid(z);
+    const error = (p - target) * sampleWeight;
+    for (const f of features) {
+        const key = weightKey(record.tactic, f.name);
+        const w = next.weights.get(key) ?? 0;
+        next.weights.set(key, w - learningRate * error * f.value);
+    }
+    const b = next.bias.get(record.tactic) ?? 0;
+    next.bias.set(record.tactic, b - learningRate * error);
+    return next;
+}
+/** Probabilidad calibrada [0,1] de éxito según el modelo. */
+function tacticSuccessProbability(state, model, tactic) {
+    const features = (0, features_1.extractFeatures)(state);
+    return sigmoid(linearScore(tactic, features, model));
+}
+//# sourceMappingURL=model.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"model.js","sourceRoot":"","sources":["../../../src/tooling/proof-guidance/model.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,wCAAwC;AACxC,EAAE;AACF,oEAAoE;AACpE,qEAAqE;AACrE,0CAA0C;AAC1C,+DAA+D;;AAuC/D,4CAMC;AAoBD,gCAuCC;AAOD,kCAkBC;AASD,kCA+BC;AAGD,4DAOC;AAjLD,yCAA2D;AAG3D,MAAM,OAAO,GAAG,IAAI,CAAC;AAErB,SAAS,SAAS,CAAC,MAAc,EAAE,WAAmB;IACpD,OAAO,GAAG,MAAM,GAAG,OAAO,GAAG,WAAW,EAAE,CAAC;AAC7C,CAAC;AAED,SAAS,OAAO,CAAC,CAAS;IACxB,gDAAgD;IAChD,IAAI,CAAC,GAAG,EAAE;QAAE,OAAO,CAAC,CAAC;IACrB,IAAI,CAAC,GAAG,CAAC,EAAE;QAAE,OAAO,CAAC,CAAC;IACtB,OAAO,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AAChC,CAAC;AAED;;;GAGG;AACH,SAAS,WAAW,CAClB,MAAc,EACd,QAAmB,EACnB,KAA6C;IAE7C,IAAI,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;IACpC,KAAK,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;QACzB,MAAM,CAAC,GAAG,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,SAAS,CAAC,MAAM,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;QACvD,IAAI,CAAC,KAAK,SAAS;YAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC;IACxC,CAAC;IACD,OAAO,CAAC,CAAC;AACX,CAAC;AAED;;;GAGG;AACH,SAAgB,gBAAgB;IAC9B,OAAO;QACL,QAAQ,EAAE,IAAA,uBAAY,GAAE;QACxB,OAAO,EAAE,IAAI,GAAG,EAAkB;QAClC,IAAI,EAAE,IAAI,GAAG,EAAkB;KAChC,CAAC;AACJ,CAAC;AAWD;;;;;;;;GAQG;AACH,SAAgB,UAAU,CAAC,OAAuB,EAAE,OAAqB,EAAE;IACzE,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,IAAI,EAAE,CAAC;IACjC,MAAM,EAAE,GAAG,IAAI,CAAC,YAAY,IAAI,GAAG,CAAC;IACpC,MAAM,EAAE,GAAG,IAAI,CAAC,EAAE,IAAI,KAAK,CAAC;IAE5B,MAAM,KAAK,GAAG,gBAAgB,EAAE,CAAC;IAEjC,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,KAAK,CAAC;IAEvC,2DAA2D;IAC3D,MAAM,SAAS,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QACpC,MAAM,EAAE,CAAC,CAAC,MAAM;QAChB,QAAQ,EAAE,IAAA,0BAAe,EAAC,CAAC,CAAC,WAAW,CAAC;QACxC,MAAM,EAAE,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC5B,MAAM,EAAE,CAAC,CAAC,mBAAmB,KAAK,SAAS,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,mBAAmB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;KAC/F,CAAC,CAAC,CAAC;IAEJ,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,MAAM,EAAE,KAAK,EAAE,EAAE,CAAC;QAC5C,KAAK,MAAM,MAAM,IAAI,SAAS,EAAE,CAAC;YAC/B,MAAM,CAAC,GAAG,WAAW,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC;YAC7D,MAAM,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;YACrB,MAAM,KAAK,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC;YAElD,yBAAyB;YACzB,KAAK,MAAM,CAAC,IAAI,MAAM,CAAC,QAAQ,EAAE,CAAC;gBAChC,MAAM,GAAG,GAAG,SAAS,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC;gBAC7C,MAAM,CAAC,GAAG,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;gBACtC,MAAM,IAAI,GAAG,KAAK,GAAG,CAAC,CAAC,KAAK,GAAG,EAAE,GAAG,CAAC,CAAC;gBACtC,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,EAAE,GAAG,IAAI,CAAC,CAAC;YACxC,CAAC;YAED,sBAAsB;YACtB,MAAM,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;YAC7C,MAAM,KAAK,GAAG,KAAK,GAAG,EAAE,GAAG,CAAC,CAAC;YAC7B,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,GAAG,EAAE,GAAG,KAAK,CAAC,CAAC;QAChD,CAAC;IACH,CAAC;IAED,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;;;GAIG;AACH,SAAgB,WAAW,CACzB,KAAiB,EACjB,KAAmB,EACnB,UAAoB;IAEpB,MAAM,QAAQ,GAAG,IAAA,0BAAe,EAAC,KAAK,CAAC,CAAC;IACxC,MAAM,MAAM,GAA0C,UAAU,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,GAAG,EAAE,EAAE,CAAC,CAAC;QACrF,MAAM;QACN,KAAK,EAAE,WAAW,CAAC,MAAM,EAAE,QAAQ,EAAE,KAAK,CAAC;QAC3C,GAAG;KACJ,CAAC,CAAC,CAAC;IAEJ,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QACnB,IAAI,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,KAAK;YAAE,OAAO,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC;QAClD,OAAO,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,4BAA4B;IACpD,CAAC,CAAC,CAAC;IAEH,OAAO,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC;AAChE,CAAC;AAED;;;;;;GAMG;AACH,SAAgB,WAAW,CACzB,KAAmB,EACnB,MAAoB,EACpB,YAAY,GAAG,GAAG;IAElB,MAAM,IAAI,GAAiB;QACzB,QAAQ,EAAE,KAAK,CAAC,QAAQ;QACxB,OAAO,EAAE,IAAI,GAAG,CAAC,KAAK,CAAC,OAAO,CAAC;QAC/B,IAAI,EAAE,IAAI,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC;KAC1B,CAAC;IAEF,MAAM,QAAQ,GAAG,IAAA,0BAAe,EAAC,MAAM,CAAC,WAAW,CAAC,CAAC;IACrD,MAAM,MAAM,GAAG,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACzC,MAAM,YAAY,GAChB,MAAM,CAAC,mBAAmB,KAAK,SAAS;QACtC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,mBAAmB,CAAC,CAAC;QACnD,CAAC,CAAC,CAAC,CAAC;IAER,MAAM,CAAC,GAAG,WAAW,CAAC,MAAM,CAAC,MAAM,EAAE,QAAQ,EAAE,IAAI,CAAC,CAAC;IACrD,MAAM,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;IACrB,MAAM,KAAK,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,GAAG,YAAY,CAAC;IAE1C,KAAK,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;QACzB,MAAM,GAAG,GAAG,SAAS,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC;QAC7C,MAAM,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QACrC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,YAAY,GAAG,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;IAC5D,CAAC;IACD,MAAM,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;IAC5C,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,GAAG,YAAY,GAAG,KAAK,CAAC,CAAC;IAEvD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,6DAA6D;AAC7D,SAAgB,wBAAwB,CACtC,KAAiB,EACjB,KAAmB,EACnB,MAAc;IAEd,MAAM,QAAQ,GAAG,IAAA,0BAAe,EAAC,KAAK,CAAC,CAAC;IACxC,OAAO,OAAO,CAAC,WAAW,CAAC,MAAM,EAAE,QAAQ,EAAE,KAAK,CAAC,CAAC,CAAC;AACvD,CAAC"}

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

@@ -0,0 +1,7 @@
+import type { ApplyTactic, ProofState, RankingModel, SearchOptions, SearchResult } from './types';
+/**
+ * Beam search guiado por el modelo. `applyTactic` define la semántica
+ * de cada táctica — el módulo no asume nada sobre la lógica de fondo.
+ */
+export declare function guidedSearch(initialState: ProofState, applyTactic: ApplyTactic, model: RankingModel, candidates: string[], opts?: SearchOptions): SearchResult;
+//# sourceMappingURL=search.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"search.d.ts","sourceRoot":"","sources":["../../../src/tooling/proof-guidance/search.ts"],"names":[],"mappings":"AAUA,OAAO,KAAK,EACV,WAAW,EACX,UAAU,EACV,YAAY,EACZ,aAAa,EACb,YAAY,EAEb,MAAM,SAAS,CAAC;AA+BjB;;;GAGG;AACH,wBAAgB,YAAY,CAC1B,YAAY,EAAE,UAAU,EACxB,WAAW,EAAE,WAAW,EACxB,KAAK,EAAE,YAAY,EACnB,UAAU,EAAE,MAAM,EAAE,EACpB,IAAI,GAAE,aAAkB,GACvB,YAAY,CAyEd"}