@nahisaho/musubix-lean 1.8.5

package/dist/proof/ProofGenerator.js

@@ -0,0 +1,324 @@
+/**
+ * @fileoverview Proof generation for Lean theorems
+ * @module @nahisaho/musubix-lean/proof
+ * @traceability REQ-LEAN-PROOF-001 to REQ-LEAN-PROOF-003
+ */
+import { ProofTimeoutError } from '../errors.js';
+/**
+ * Standard proof tactics
+ * @traceability REQ-LEAN-PROOF-001
+ */
+const STANDARD_TACTICS = [
+    'rfl',
+    'decide',
+    'native_decide',
+    'simp',
+    'trivial',
+    'assumption',
+    'contradiction',
+    'exact h',
+    'intro',
+    'constructor',
+];
+/**
+ * Induction tactics for recursive data
+ * @traceability REQ-LEAN-PROOF-002
+ */
+const INDUCTION_TACTICS = [
+    'induction',
+    'cases',
+    'match_hyp',
+    'rcases',
+];
+/**
+ * Default proof strategies
+ */
+const DEFAULT_STRATEGIES = [
+    {
+        name: 'simple',
+        tactics: ['rfl', 'decide', 'trivial'],
+        applicability: () => true,
+    },
+    {
+        name: 'simplification',
+        tactics: ['simp', 'simp_all', 'simp [*]'],
+        applicability: () => true,
+    },
+    {
+        name: 'assumption-based',
+        tactics: ['assumption', 'exact h', 'exact h_event', 'exact h_pre_0'],
+        applicability: (theorem) => theorem.hypotheses.length > 0,
+    },
+    {
+        name: 'induction',
+        tactics: ['induction n with n ih', 'cases h'],
+        applicability: (theorem) => (theorem.conclusion?.leanCode.includes('Nat') ?? false) ||
+            (theorem.conclusion?.leanCode.includes('List') ?? false),
+    },
+    {
+        name: 'propositional',
+        tactics: ['intro', 'constructor', 'left', 'right', 'apply And.intro'],
+        applicability: (theorem) => (theorem.conclusion?.leanCode.includes('∧') ?? false) ||
+            (theorem.conclusion?.leanCode.includes('∨') ?? false) ||
+            (theorem.conclusion?.leanCode.includes('→') ?? false),
+    },
+];
+/**
+ * Create initial proof state from theorem
+ */
+function createInitialProofState(theorem) {
+    return {
+        goals: [
+            {
+                id: 0,
+                type: theorem.conclusion?.type ?? '',
+                leanCode: theorem.conclusion?.leanCode ?? '',
+            },
+        ],
+        hypotheses: theorem.hypotheses,
+        currentGoal: 0,
+    };
+}
+/**
+ * Generate proof for a Lean theorem
+ * @traceability REQ-LEAN-PROOF-001
+ */
+export async function generateProof(theorem, options = {}) {
+    const startTime = Date.now();
+    const timeout = options.timeout ?? 30000;
+    const maxTactics = options.maxTactics ?? 5;
+    const strategies = options.strategies ?? DEFAULT_STRATEGIES;
+    const tacticsAttempted = [];
+    let proofState = createInitialProofState(theorem);
+    try {
+        // Try each applicable strategy
+        for (const strategy of strategies) {
+            if (strategy.applicability && !strategy.applicability(theorem)) {
+                continue;
+            }
+            // Try tactics from strategy
+            for (const tactic of strategy.tactics) {
+                if (tacticsAttempted.length >= maxTactics) {
+                    break;
+                }
+                if (Date.now() - startTime > timeout) {
+                    throw new ProofTimeoutError(theorem.name, timeout);
+                }
+                tacticsAttempted.push(tactic);
+                // Simulate tactic application
+                const result = await applyTactic(proofState, tactic);
+                if (result.success && result.newState) {
+                    proofState = result.newState;
+                    // Check if proof is complete
+                    if (proofState.goals.length === 0) {
+                        const proof = {
+                            id: `proof-${theorem.id}`,
+                            theoremId: theorem.id,
+                            tactics: tacticsAttempted,
+                            leanCode: generateProofCode(theorem, tacticsAttempted),
+                            isComplete: true,
+                            generatedAt: new Date().toISOString(),
+                        };
+                        return {
+                            success: true,
+                            proof,
+                            proofState: null,
+                            tacticsAttempted,
+                            duration: Date.now() - startTime,
+                        };
+                    }
+                }
+            }
+        }
+        // Proof not found with standard tactics
+        return {
+            success: false,
+            proof: null,
+            proofState,
+            tacticsAttempted,
+            duration: Date.now() - startTime,
+            error: 'Could not complete proof with available tactics',
+        };
+    }
+    catch (error) {
+        if (error instanceof ProofTimeoutError) {
+            return {
+                success: false,
+                proof: null,
+                proofState,
+                tacticsAttempted,
+                duration: Date.now() - startTime,
+                error: error.message,
+            };
+        }
+        throw error;
+    }
+}
+/**
+ * Apply a single tactic to proof state
+ */
+export async function applyTactic(state, tactic) {
+    // This is a simplified simulation
+    // In real implementation, this would call Lean via LeanRunner
+    // Simulate success for certain tactics on certain goals
+    const currentGoal = state.goals[state.currentGoal];
+    if (!currentGoal) {
+        return { success: false, newState: null, error: 'No goals' };
+    }
+    // Simple heuristics for tactic success
+    const goalCode = currentGoal.leanCode.toLowerCase();
+    if (tactic === 'rfl' && goalCode.includes('=')) {
+        // rfl succeeds on reflexive equality
+        return {
+            success: true,
+            newState: {
+                ...state,
+                goals: state.goals.filter((_, i) => i !== state.currentGoal),
+            },
+        };
+    }
+    if (tactic === 'trivial' && goalCode === 'true') {
+        return {
+            success: true,
+            newState: {
+                ...state,
+                goals: state.goals.filter((_, i) => i !== state.currentGoal),
+            },
+        };
+    }
+    if (tactic === 'assumption' && state.hypotheses.length > 0) {
+        // Check if any hypothesis matches the goal
+        const matchingHyp = state.hypotheses.find((h) => h.type.toLowerCase() === goalCode);
+        if (matchingHyp) {
+            return {
+                success: true,
+                newState: {
+                    ...state,
+                    goals: state.goals.filter((_, i) => i !== state.currentGoal),
+                },
+            };
+        }
+    }
+    // Default: tactic doesn't change state
+    return {
+        success: false,
+        newState: null,
+        error: `Tactic '${tactic}' did not make progress`,
+    };
+}
+/**
+ * Generate Lean proof code
+ */
+function generateProofCode(theorem, tactics) {
+    const tacticBlock = tactics.length > 0
+        ? tactics.map((t) => `  ${t}`).join('\n')
+        : '  sorry';
+    return `
+theorem ${theorem.name} : ${theorem.conclusion?.leanCode ?? 'True'} := by
+${tacticBlock}
+`;
+}
+/**
+ * Generate proof sketch with sorry markers
+ * @traceability REQ-LEAN-PROOF-003
+ */
+export function generateProofSketch(theorem, partialTactics = []) {
+    const sorryLocations = [];
+    const hints = [];
+    let completionRate = 0;
+    // Analyze theorem to provide hints
+    const conclusion = theorem.conclusion?.leanCode ?? '';
+    if (conclusion.includes('∧')) {
+        hints.push('Use "constructor" to split conjunction');
+        hints.push('Prove each side separately');
+    }
+    if (conclusion.includes('→')) {
+        hints.push('Use "intro" to introduce hypothesis');
+    }
+    if (conclusion.includes('∀')) {
+        hints.push('Use "intro" to introduce universally quantified variable');
+    }
+    if (conclusion.includes('¬')) {
+        hints.push('Use "intro h_unwanted" and derive contradiction');
+    }
+    // Build partial proof with sorry
+    const tacticBlock = partialTactics.length > 0
+        ? partialTactics.map((t) => `  ${t}`).join('\n') + '\n  sorry'
+        : '  sorry';
+    sorryLocations.push({
+        line: partialTactics.length + 2,
+        expectedType: conclusion,
+        hint: hints[0] || 'Complete the proof',
+    });
+    const partialProof = `
+theorem ${theorem.name} : ${conclusion} := by
+${tacticBlock}
+`;
+    // Calculate completion rate (simplified)
+    completionRate = partialTactics.length > 0 ? partialTactics.length * 20 : 0;
+    completionRate = Math.min(completionRate, 80); // Max 80% without verification
+    return {
+        theoremName: theorem.name,
+        partialProof,
+        sorryLocations,
+        hints,
+        completionRate,
+    };
+}
+/**
+ * Select best strategy for theorem
+ */
+export function selectStrategy(theorem, strategies = DEFAULT_STRATEGIES) {
+    // Find first applicable strategy
+    for (const strategy of strategies) {
+        if (strategy.applicability && strategy.applicability(theorem)) {
+            return strategy;
+        }
+    }
+    // Default to simple strategy
+    return strategies[0];
+}
+/**
+ * ProofGenerator class implementation
+ * @traceability REQ-LEAN-PROOF-001
+ */
+export class ProofGenerator {
+    strategies;
+    constructor(strategies = DEFAULT_STRATEGIES) {
+        this.strategies = strategies;
+    }
+    /**
+     * Generate proof for theorem
+     */
+    async generate(theorem, options) {
+        return generateProof(theorem, {
+            ...options,
+            strategies: options?.strategies ?? this.strategies,
+        });
+    }
+    /**
+     * Apply single tactic
+     */
+    async applyTactic(state, tactic) {
+        return applyTactic(state, tactic);
+    }
+    /**
+     * Generate proof sketch
+     */
+    generateSketch(theorem, partialTactics) {
+        return generateProofSketch(theorem, partialTactics);
+    }
+    /**
+     * Select best strategy
+     */
+    selectStrategy(theorem) {
+        return selectStrategy(theorem, this.strategies);
+    }
+    /**
+     * Add custom strategy
+     */
+    addStrategy(strategy) {
+        this.strategies.push(strategy);
+    }
+}
+//# sourceMappingURL=ProofGenerator.js.map

package/dist/proof/ProofGenerator.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"ProofGenerator.js","sourceRoot":"","sources":["../../src/proof/ProofGenerator.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAcH,OAAO,EAAE,iBAAiB,EAAwB,MAAM,cAAc,CAAC;AAEvE;;;GAGG;AACH,MAAM,gBAAgB,GAAG;IACvB,KAAK;IACL,QAAQ;IACR,eAAe;IACf,MAAM;IACN,SAAS;IACT,YAAY;IACZ,eAAe;IACf,SAAS;IACT,OAAO;IACP,aAAa;CACd,CAAC;AAEF;;;GAGG;AACH,MAAM,iBAAiB,GAAG;IACxB,WAAW;IACX,OAAO;IACP,WAAW;IACX,QAAQ;CACT,CAAC;AAEF;;GAEG;AACH,MAAM,kBAAkB,GAAoB;IAC1C;QACE,IAAI,EAAE,QAAQ;QACd,OAAO,EAAE,CAAC,KAAK,EAAE,QAAQ,EAAE,SAAS,CAAC;QACrC,aAAa,EAAE,GAAG,EAAE,CAAC,IAAI;KAC1B;IACD;QACE,IAAI,EAAE,gBAAgB;QACtB,OAAO,EAAE,CAAC,MAAM,EAAE,UAAU,EAAE,UAAU,CAAC;QACzC,aAAa,EAAE,GAAG,EAAE,CAAC,IAAI;KAC1B;IACD;QACE,IAAI,EAAE,kBAAkB;QACxB,OAAO,EAAE,CAAC,YAAY,EAAE,SAAS,EAAE,eAAe,EAAE,eAAe,CAAC;QACpE,aAAa,EAAE,CAAC,OAAO,EAAE,EAAE,CAAC,OAAO,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC;KAC1D;IACD;QACE,IAAI,EAAE,WAAW;QACjB,OAAO,EAAE,CAAC,uBAAuB,EAAE,SAAS,CAAC;QAC7C,aAAa,EAAE,CAAC,OAAO,EAAE,EAAE,CACzB,CAAC,OAAO,CAAC,UAAU,EAAE,QAAQ,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,KAAK,CAAC;YACvD,CAAC,OAAO,CAAC,UAAU,EAAE,QAAQ,CAAC,QAAQ,CAAC,MAAM,CAAC,IAAI,KAAK,CAAC;KAC3D;IACD;QACE,IAAI,EAAE,eAAe;QACrB,OAAO,EAAE,CAAC,OAAO,EAAE,aAAa,EAAE,MAAM,EAAE,OAAO,EAAE,iBAAiB,CAAC;QACrE,aAAa,EAAE,CAAC,OAAO,EAAE,EAAE,CACzB,CAAC,OAAO,CAAC,UAAU,EAAE,QAAQ,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,KAAK,CAAC;YACrD,CAAC,OAAO,CAAC,UAAU,EAAE,QAAQ,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,KAAK,CAAC;YACrD,CAAC,OAAO,CAAC,UAAU,EAAE,QAAQ,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,KAAK,CAAC;KACxD;CACF,CAAC;AAEF;;GAEG;AACH,SAAS,uBAAuB,CAAC,OAAoB;IACnD,OAAO;QACL,KAAK,EAAE;YACL;gBACE,EAAE,EAAE,CAAC;gBACL,IAAI,EAAE,OAAO,CAAC,UAAU,EAAE,IAAI,IAAI,EAAE;gBACpC,QAAQ,EAAE,OAAO,CAAC,UAAU,EAAE,QAAQ,IAAI,EAAE;aAC7C;SACF;QACD,UAAU,EAAE,OAAO,CAAC,UAAU;QAC9B,WAAW,EAAE,CAAC;KACf,CAAC;AACJ,CAAC;AAED;;;GAGG;AACH,MAAM,CAAC,KAAK,UAAU,aAAa,CACjC,OAAoB,EACpB,UAAwB,EAAE;IAE1B,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;IAC7B,MAAM,OAAO,GAAG,OAAO,CAAC,OAAO,IAAI,KAAK,CAAC;IACzC,MAAM,UAAU,GAAG,OAAO,CAAC,UAAU,IAAI,CAAC,CAAC;IAC3C,MAAM,UAAU,GAAG,OAAO,CAAC,UAAU,IAAI,kBAAkB,CAAC;IAE5D,MAAM,gBAAgB,GAAa,EAAE,CAAC;IACtC,IAAI,UAAU,GAAe,uBAAuB,CAAC,OAAO,CAAC,CAAC;IAE9D,IAAI,CAAC;QACH,+BAA+B;QAC/B,KAAK,MAAM,QAAQ,IAAI,UAAU,EAAE,CAAC;YAClC,IAAI,QAAQ,CAAC,aAAa,IAAI,CAAC,QAAQ,CAAC,aAAa,CAAC,OAAO,CAAC,EAAE,CAAC;gBAC/D,SAAS;YACX,CAAC;YAED,4BAA4B;YAC5B,KAAK,MAAM,MAAM,IAAI,QAAQ,CAAC,OAAO,EAAE,CAAC;gBACtC,IAAI,gBAAgB,CAAC,MAAM,IAAI,UAAU,EAAE,CAAC;oBAC1C,MAAM;gBACR,CAAC;gBAED,IAAI,IAAI,CAAC,GAAG,EAAE,GAAG,SAAS,GAAG,OAAO,EAAE,CAAC;oBACrC,MAAM,IAAI,iBAAiB,CAAC,OAAO,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;gBACrD,CAAC;gBAED,gBAAgB,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;gBAE9B,8BAA8B;gBAC9B,MAAM,MAAM,GAAG,MAAM,WAAW,CAAC,UAAU,EAAE,MAAM,CAAC,CAAC;gBACrD,IAAI,MAAM,CAAC,OAAO,IAAI,MAAM,CAAC,QAAQ,EAAE,CAAC;oBACtC,UAAU,GAAG,MAAM,CAAC,QAAQ,CAAC;oBAE7B,6BAA6B;oBAC7B,IAAI,UAAU,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;wBAClC,MAAM,KAAK,GAAc;4BACvB,EAAE,EAAE,SAAS,OAAO,CAAC,EAAE,EAAE;4BACzB,SAAS,EAAE,OAAO,CAAC,EAAE;4BACrB,OAAO,EAAE,gBAAgB;4BACzB,QAAQ,EAAE,iBAAiB,CAAC,OAAO,EAAE,gBAAgB,CAAC;4BACtD,UAAU,EAAE,IAAI;4BAChB,WAAW,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;yBACtC,CAAC;wBAEF,OAAO;4BACL,OAAO,EAAE,IAAI;4BACb,KAAK;4BACL,UAAU,EAAE,IAAI;4BAChB,gBAAgB;4BAChB,QAAQ,EAAE,IAAI,CAAC,GAAG,EAAE,GAAG,SAAS;yBACjC,CAAC;oBACJ,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QAED,wCAAwC;QACxC,OAAO;YACL,OAAO,EAAE,KAAK;YACd,KAAK,EAAE,IAAI;YACX,UAAU;YACV,gBAAgB;YAChB,QAAQ,EAAE,IAAI,CAAC,GAAG,EAAE,GAAG,SAAS;YAChC,KAAK,EAAE,iDAAiD;SACzD,CAAC;IACJ,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACf,IAAI,KAAK,YAAY,iBAAiB,EAAE,CAAC;YACvC,OAAO;gBACL,OAAO,EAAE,KAAK;gBACd,KAAK,EAAE,IAAI;gBACX,UAAU;gBACV,gBAAgB;gBAChB,QAAQ,EAAE,IAAI,CAAC,GAAG,EAAE,GAAG,SAAS;gBAChC,KAAK,EAAE,KAAK,CAAC,OAAO;aACrB,CAAC;QACJ,CAAC;QACD,MAAM,KAAK,CAAC;IACd,CAAC;AACH,CAAC;AAED;;GAEG;AACH,MAAM,CAAC,KAAK,UAAU,WAAW,CAC/B,KAAiB,EACjB,MAAc;IAEd,kCAAkC;IAClC,8DAA8D;IAE9D,wDAAwD;IACxD,MAAM,WAAW,GAAG,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC;IACnD,IAAI,CAAC,WAAW,EAAE,CAAC;QACjB,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,QAAQ,EAAE,IAAI,EAAE,KAAK,EAAE,UAAU,EAAE,CAAC;IAC/D,CAAC;IAED,uCAAuC;IACvC,MAAM,QAAQ,GAAG,WAAW,CAAC,QAAQ,CAAC,WAAW,EAAE,CAAC;IAEpD,IAAI,MAAM,KAAK,KAAK,IAAI,QAAQ,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC;QAC/C,qCAAqC;QACrC,OAAO;YACL,OAAO,EAAE,IAAI;YACb,QAAQ,EAAE;gBACR,GAAG,KAAK;gBACR,KAAK,EAAE,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,KAAK,CAAC,WAAW,CAAC;aAC7D;SACF,CAAC;IACJ,CAAC;IAED,IAAI,MAAM,KAAK,SAAS,IAAI,QAAQ,KAAK,MAAM,EAAE,CAAC;QAChD,OAAO;YACL,OAAO,EAAE,IAAI;YACb,QAAQ,EAAE;gBACR,GAAG,KAAK;gBACR,KAAK,EAAE,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,KAAK,CAAC,WAAW,CAAC;aAC7D;SACF,CAAC;IACJ,CAAC;IAED,IAAI,MAAM,KAAK,YAAY,IAAI,KAAK,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC3D,2CAA2C;QAC3C,MAAM,WAAW,GAAG,KAAK,CAAC,UAAU,CAAC,IAAI,CACvC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,WAAW,EAAE,KAAK,QAAQ,CACzC,CAAC;QACF,IAAI,WAAW,EAAE,CAAC;YAChB,OAAO;gBACL,OAAO,EAAE,IAAI;gBACb,QAAQ,EAAE;oBACR,GAAG,KAAK;oBACR,KAAK,EAAE,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,KAAK,CAAC,WAAW,CAAC;iBAC7D;aACF,CAAC;QACJ,CAAC;IACH,CAAC;IAED,uCAAuC;IACvC,OAAO;QACL,OAAO,EAAE,KAAK;QACd,QAAQ,EAAE,IAAI;QACd,KAAK,EAAE,WAAW,MAAM,yBAAyB;KAClD,CAAC;AACJ,CAAC;AAED;;GAEG;AACH,SAAS,iBAAiB,CAAC,OAAoB,EAAE,OAAiB;IAChE,MAAM,WAAW,GAAG,OAAO,CAAC,MAAM,GAAG,CAAC;QACpC,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC;QACzC,CAAC,CAAC,SAAS,CAAC;IAEd,OAAO;UACC,OAAO,CAAC,IAAI,MAAM,OAAO,CAAC,UAAU,EAAE,QAAQ,IAAI,MAAM;EAChE,WAAW;CACZ,CAAC;AACF,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,mBAAmB,CACjC,OAAoB,EACpB,iBAA2B,EAAE;IAE7B,MAAM,cAAc,GAAoB,EAAE,CAAC;IAC3C,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,IAAI,cAAc,GAAG,CAAC,CAAC;IAEvB,mCAAmC;IACnC,MAAM,UAAU,GAAG,OAAO,CAAC,UAAU,EAAE,QAAQ,IAAI,EAAE,CAAC;IAEtD,IAAI,UAAU,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC;QAC7B,KAAK,CAAC,IAAI,CAAC,wCAAwC,CAAC,CAAC;QACrD,KAAK,CAAC,IAAI,CAAC,4BAA4B,CAAC,CAAC;IAC3C,CAAC;IAED,IAAI,UAAU,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC;QAC7B,KAAK,CAAC,IAAI,CAAC,qCAAqC,CAAC,CAAC;IACpD,CAAC;IAED,IAAI,UAAU,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC;QAC7B,KAAK,CAAC,IAAI,CAAC,0DAA0D,CAAC,CAAC;IACzE,CAAC;IAED,IAAI,UAAU,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC;QAC7B,KAAK,CAAC,IAAI,CAAC,iDAAiD,CAAC,CAAC;IAChE,CAAC;IAED,iCAAiC;IACjC,MAAM,WAAW,GAAG,cAAc,CAAC,MAAM,GAAG,CAAC;QAC3C,CAAC,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,WAAW;QAC9D,CAAC,CAAC,SAAS,CAAC;IAEd,cAAc,CAAC,IAAI,CAAC;QAClB,IAAI,EAAE,cAAc,CAAC,MAAM,GAAG,CAAC;QAC/B,YAAY,EAAE,UAAU;QACxB,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC,IAAI,oBAAoB;KACvC,CAAC,CAAC;IAEH,MAAM,YAAY,GAAG;UACb,OAAO,CAAC,IAAI,MAAM,UAAU;EACpC,WAAW;CACZ,CAAC;IAEA,yCAAyC;IACzC,cAAc,GAAG,cAAc,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,cAAc,CAAC,MAAM,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAC5E,cAAc,GAAG,IAAI,CAAC,GAAG,CAAC,cAAc,EAAE,EAAE,CAAC,CAAC,CAAC,+BAA+B;IAE9E,OAAO;QACL,WAAW,EAAE,OAAO,CAAC,IAAI;QACzB,YAAY;QACZ,cAAc;QACd,KAAK;QACL,cAAc;KACf,CAAC;AACJ,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,cAAc,CAC5B,OAAoB,EACpB,aAA8B,kBAAkB;IAEhD,iCAAiC;IACjC,KAAK,MAAM,QAAQ,IAAI,UAAU,EAAE,CAAC;QAClC,IAAI,QAAQ,CAAC,aAAa,IAAI,QAAQ,CAAC,aAAa,CAAC,OAAO,CAAC,EAAE,CAAC;YAC9D,OAAO,QAAQ,CAAC;QAClB,CAAC;IACH,CAAC;IAED,6BAA6B;IAC7B,OAAO,UAAU,CAAC,CAAC,CAAC,CAAC;AACvB,CAAC;AAED;;;GAGG;AACH,MAAM,OAAO,cAAc;IACjB,UAAU,CAAkB;IAEpC,YAAY,aAA8B,kBAAkB;QAC1D,IAAI,CAAC,UAAU,GAAG,UAAU,CAAC;IAC/B,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,QAAQ,CACZ,OAAoB,EACpB,OAAsB;QAEtB,OAAO,aAAa,CAAC,OAAO,EAAE;YAC5B,GAAG,OAAO;YACV,UAAU,EAAE,OAAO,EAAE,UAAU,IAAI,IAAI,CAAC,UAAU;SACnD,CAAC,CAAC;IACL,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,WAAW,CAAC,KAAiB,EAAE,MAAc;QACjD,OAAO,WAAW,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;IACpC,CAAC;IAED;;OAEG;IACH,cAAc,CACZ,OAAoB,EACpB,cAAyB;QAEzB,OAAO,mBAAmB,CAAC,OAAO,EAAE,cAAc,CAAC,CAAC;IACtD,CAAC;IAED;;OAEG;IACH,cAAc,CAAC,OAAoB;QACjC,OAAO,cAAc,CAAC,OAAO,EAAE,IAAI,CAAC,UAAU,CAAC,CAAC;IAClD,CAAC;IAED;;OAEG;IACH,WAAW,CAAC,QAAuB;QACjC,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;IACjC,CAAC;CACF"}

package/dist/proof/ReProverClient.d.ts

@@ -0,0 +1,58 @@
+/**
+ * @fileoverview ReProver client for external proof search
+ * @module @nahisaho/musubix-lean/proof
+ * @traceability REQ-LEAN-REPROVER-001 to REQ-LEAN-REPROVER-003
+ */
+import type { ReProverConfig, ReProverSearchResult, ProofState, ProofFeedback } from '../types.js';
+/**
+ * ReProver client for neural proof search
+ * @traceability REQ-LEAN-REPROVER-001
+ */
+export declare class ReProverClient {
+    private config;
+    private connected;
+    constructor(config?: Partial<ReProverConfig>);
+    /**
+     * Connect to ReProver service
+     * @traceability REQ-LEAN-REPROVER-001
+     */
+    connect(config?: Partial<ReProverConfig>): Promise<void>;
+    /**
+     * Check if connected to ReProver
+     */
+    isAvailable(): boolean;
+    /**
+     * Perform health check on ReProver service
+     */
+    private healthCheck;
+    /**
+     * Search for proof using ReProver
+     * @traceability REQ-LEAN-REPROVER-002
+     */
+    search(proofState: ProofState, options?: {
+        maxDepth?: number;
+        timeout?: number;
+    }): Promise<ReProverSearchResult>;
+    /**
+     * Parse ReProver response into SearchResult
+     */
+    private parseSearchResult;
+    /**
+     * Parse search path from response
+     */
+    private parseSearchPath;
+    /**
+     * Get feedback for failed proof attempt
+     * @traceability REQ-LEAN-REPROVER-003
+     */
+    getFeedback(failedState: ProofState): ProofFeedback;
+    /**
+     * Disconnect from ReProver
+     */
+    disconnect(): void;
+    /**
+     * Get current configuration
+     */
+    getConfig(): ReProverConfig;
+}
+//# sourceMappingURL=ReProverClient.d.ts.map

package/dist/proof/ReProverClient.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"ReProverClient.d.ts","sourceRoot":"","sources":["../../src/proof/ReProverClient.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,KAAK,EACV,cAAc,EACd,oBAAoB,EACpB,UAAU,EACV,aAAa,EAEd,MAAM,aAAa,CAAC;AAYrB;;;GAGG;AACH,qBAAa,cAAc;IACzB,OAAO,CAAC,MAAM,CAAiB;IAC/B,OAAO,CAAC,SAAS,CAAkB;gBAEvB,MAAM,GAAE,OAAO,CAAC,cAAc,CAAM;IAIhD;;;OAGG;IACG,OAAO,CAAC,MAAM,CAAC,EAAE,OAAO,CAAC,cAAc,CAAC,GAAG,OAAO,CAAC,IAAI,CAAC;IAsB9D;;OAEG;IACH,WAAW,IAAI,OAAO;IAItB;;OAEG;YACW,WAAW;IAmBzB;;;OAGG;IACG,MAAM,CACV,UAAU,EAAE,UAAU,EACtB,OAAO,CAAC,EAAE;QAAE,QAAQ,CAAC,EAAE,MAAM,CAAC;QAAC,OAAO,CAAC,EAAE,MAAM,CAAA;KAAE,GAChD,OAAO,CAAC,oBAAoB,CAAC;IAwEhC;;OAEG;IACH,OAAO,CAAC,iBAAiB;IAsBzB;;OAEG;IACH,OAAO,CAAC,eAAe;IAoBvB;;;OAGG;IACH,WAAW,CAAC,WAAW,EAAE,UAAU,GAAG,aAAa;IAsEnD;;OAEG;IACH,UAAU,IAAI,IAAI;IAIlB;;OAEG;IACH,SAAS,IAAI,cAAc;CAG5B"}

package/dist/proof/ReProverClient.js

@@ -0,0 +1,260 @@
+/**
+ * @fileoverview ReProver client for external proof search
+ * @module @nahisaho/musubix-lean/proof
+ * @traceability REQ-LEAN-REPROVER-001 to REQ-LEAN-REPROVER-003
+ */
+import { ReProverConnectionError } from '../errors.js';
+/**
+ * Default ReProver configuration
+ */
+const DEFAULT_CONFIG = {
+    endpoint: 'http://localhost:8000/api/prove',
+    timeout: 60000,
+    maxDepth: 10,
+};
+/**
+ * ReProver client for neural proof search
+ * @traceability REQ-LEAN-REPROVER-001
+ */
+export class ReProverClient {
+    config;
+    connected = false;
+    constructor(config = {}) {
+        this.config = { ...DEFAULT_CONFIG, ...config };
+    }
+    /**
+     * Connect to ReProver service
+     * @traceability REQ-LEAN-REPROVER-001
+     */
+    async connect(config) {
+        if (config) {
+            this.config = { ...this.config, ...config };
+        }
+        try {
+            // Health check
+            const response = await this.healthCheck();
+            if (response) {
+                this.connected = true;
+            }
+            else {
+                throw new Error('Health check failed');
+            }
+        }
+        catch (error) {
+            this.connected = false;
+            throw new ReProverConnectionError(this.config.endpoint, error instanceof Error ? error.message : String(error));
+        }
+    }
+    /**
+     * Check if connected to ReProver
+     */
+    isAvailable() {
+        return this.connected;
+    }
+    /**
+     * Perform health check on ReProver service
+     */
+    async healthCheck() {
+        try {
+            const controller = new AbortController();
+            const timeoutId = setTimeout(() => controller.abort(), 5000);
+            const healthEndpoint = this.config.endpoint.replace('/api/prove', '/health');
+            const response = await fetch(healthEndpoint, {
+                method: 'GET',
+                signal: controller.signal,
+            });
+            clearTimeout(timeoutId);
+            return response.ok;
+        }
+        catch {
+            // If fetch fails, ReProver is not available
+            return false;
+        }
+    }
+    /**
+     * Search for proof using ReProver
+     * @traceability REQ-LEAN-REPROVER-002
+     */
+    async search(proofState, options) {
+        if (!this.connected) {
+            return {
+                found: false,
+                proof: null,
+                searchPath: [],
+                suggestions: ['ReProver is not connected. Use basic proof tactics.'],
+            };
+        }
+        const maxDepth = options?.maxDepth ?? this.config.maxDepth;
+        const timeout = options?.timeout ?? this.config.timeout;
+        try {
+            const controller = new AbortController();
+            const timeoutId = setTimeout(() => controller.abort(), timeout);
+            const response = await fetch(this.config.endpoint, {
+                method: 'POST',
+                headers: {
+                    'Content-Type': 'application/json',
+                    ...(this.config.apiKey && {
+                        Authorization: `Bearer ${this.config.apiKey}`,
+                    }),
+                },
+                body: JSON.stringify({
+                    proof_state: {
+                        goals: proofState.goals.map((g) => ({
+                            id: g.id,
+                            type: g.type,
+                            lean_code: g.leanCode,
+                        })),
+                        hypotheses: proofState.hypotheses.map((h) => ({
+                            name: h.name,
+                            type: h.type,
+                        })),
+                        current_goal: proofState.currentGoal,
+                    },
+                    max_depth: maxDepth,
+                }),
+                signal: controller.signal,
+            });
+            clearTimeout(timeoutId);
+            if (!response.ok) {
+                throw new Error(`ReProver request failed: ${response.status}`);
+            }
+            const result = await response.json();
+            return this.parseSearchResult(result);
+        }
+        catch (error) {
+            if (error instanceof Error && error.name === 'AbortError') {
+                return {
+                    found: false,
+                    proof: null,
+                    searchPath: [],
+                    suggestions: [`Proof search timed out after ${timeout}ms`],
+                };
+            }
+            return {
+                found: false,
+                proof: null,
+                searchPath: [],
+                suggestions: [
+                    `ReProver error: ${error instanceof Error ? error.message : String(error)}`,
+                ],
+            };
+        }
+    }
+    /**
+     * Parse ReProver response into SearchResult
+     */
+    parseSearchResult(response) {
+        const data = response;
+        if (data.found && data.proof) {
+            return {
+                found: true,
+                proof: String(data.proof),
+                searchPath: this.parseSearchPath(data.search_path),
+                suggestions: [],
+            };
+        }
+        return {
+            found: false,
+            proof: null,
+            searchPath: this.parseSearchPath(data.search_path),
+            suggestions: Array.isArray(data.suggestions)
+                ? data.suggestions.map(String)
+                : [],
+        };
+    }
+    /**
+     * Parse search path from response
+     */
+    parseSearchPath(path) {
+        if (!Array.isArray(path)) {
+            return [];
+        }
+        return path.map((node) => {
+            const n = node;
+            return {
+                tactic: String(n.tactic || ''),
+                state: {
+                    goals: [],
+                    hypotheses: [],
+                    currentGoal: 0,
+                },
+                score: Number(n.score || 0),
+                children: [],
+            };
+        });
+    }
+    /**
+     * Get feedback for failed proof attempt
+     * @traceability REQ-LEAN-REPROVER-003
+     */
+    getFeedback(failedState) {
+        const guidance = [];
+        const suggestions = [];
+        // Analyze the stuck state
+        const currentGoal = failedState.goals[failedState.currentGoal];
+        if (currentGoal) {
+            const goalType = currentGoal.leanCode;
+            // Provide guidance based on goal structure
+            if (goalType.includes('∧')) {
+                guidance.push('This is a conjunction. Try using "constructor" to split it.');
+                suggestions.push('constructor');
+            }
+            if (goalType.includes('∨')) {
+                guidance.push('This is a disjunction. Try "left" or "right" to choose a side.');
+                suggestions.push('left', 'right');
+            }
+            if (goalType.includes('→')) {
+                guidance.push('This is an implication. Use "intro h" to assume the antecedent.');
+                suggestions.push('intro h');
+            }
+            if (goalType.includes('∀')) {
+                guidance.push('This is a universal statement. Use "intro x" to introduce a variable.');
+                suggestions.push('intro x');
+            }
+            if (goalType.includes('∃')) {
+                guidance.push('This is an existential statement. Use "use value" to provide a witness.');
+                suggestions.push('use _');
+            }
+            if (goalType.includes('¬')) {
+                guidance.push('This is a negation. Use "intro h" and derive a contradiction.');
+                suggestions.push('intro h');
+            }
+            if (goalType.includes('Nat') || goalType.includes('List')) {
+                guidance.push('Consider using induction on the data structure.');
+                suggestions.push('induction n', 'cases n');
+            }
+        }
+        // Check hypotheses for applicable tactics
+        if (failedState.hypotheses.length > 0) {
+            guidance.push('You have hypotheses available. Try "assumption" or "exact h".');
+            for (const hyp of failedState.hypotheses) {
+                if (hyp.type === currentGoal?.type) {
+                    suggestions.push(`exact ${hyp.name}`);
+                }
+            }
+        }
+        if (guidance.length === 0) {
+            guidance.push('Try simplification tactics: simp, simp_all, or decide.');
+            suggestions.push('simp', 'decide');
+        }
+        return {
+            stuckState: failedState,
+            attemptedTactics: [],
+            similarTheorems: [], // Would be populated from a theorem database
+            guidance,
+        };
+    }
+    /**
+     * Disconnect from ReProver
+     */
+    disconnect() {
+        this.connected = false;
+    }
+    /**
+     * Get current configuration
+     */
+    getConfig() {
+        return { ...this.config };
+    }
+}
+//# sourceMappingURL=ReProverClient.js.map

package/dist/proof/ReProverClient.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"ReProverClient.js","sourceRoot":"","sources":["../../src/proof/ReProverClient.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AASH,OAAO,EAAE,uBAAuB,EAAE,MAAM,cAAc,CAAC;AAEvD;;GAEG;AACH,MAAM,cAAc,GAAmB;IACrC,QAAQ,EAAE,iCAAiC;IAC3C,OAAO,EAAE,KAAK;IACd,QAAQ,EAAE,EAAE;CACb,CAAC;AAEF;;;GAGG;AACH,MAAM,OAAO,cAAc;IACjB,MAAM,CAAiB;IACvB,SAAS,GAAY,KAAK,CAAC;IAEnC,YAAY,SAAkC,EAAE;QAC9C,IAAI,CAAC,MAAM,GAAG,EAAE,GAAG,cAAc,EAAE,GAAG,MAAM,EAAE,CAAC;IACjD,CAAC;IAED;;;OAGG;IACH,KAAK,CAAC,OAAO,CAAC,MAAgC;QAC5C,IAAI,MAAM,EAAE,CAAC;YACX,IAAI,CAAC,MAAM,GAAG,EAAE,GAAG,IAAI,CAAC,MAAM,EAAE,GAAG,MAAM,EAAE,CAAC;QAC9C,CAAC;QAED,IAAI,CAAC;YACH,eAAe;YACf,MAAM,QAAQ,GAAG,MAAM,IAAI,CAAC,WAAW,EAAE,CAAC;YAC1C,IAAI,QAAQ,EAAE,CAAC;gBACb,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC;YACxB,CAAC;iBAAM,CAAC;gBACN,MAAM,IAAI,KAAK,CAAC,qBAAqB,CAAC,CAAC;YACzC,CAAC;QACH,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,IAAI,CAAC,SAAS,GAAG,KAAK,CAAC;YACvB,MAAM,IAAI,uBAAuB,CAC/B,IAAI,CAAC,MAAM,CAAC,QAAQ,EACpB,KAAK,YAAY,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CACvD,CAAC;QACJ,CAAC;IACH,CAAC;IAED;;OAEG;IACH,WAAW;QACT,OAAO,IAAI,CAAC,SAAS,CAAC;IACxB,CAAC;IAED;;OAEG;IACK,KAAK,CAAC,WAAW;QACvB,IAAI,CAAC;YACH,MAAM,UAAU,GAAG,IAAI,eAAe,EAAE,CAAC;YACzC,MAAM,SAAS,GAAG,UAAU,CAAC,GAAG,EAAE,CAAC,UAAU,CAAC,KAAK,EAAE,EAAE,IAAI,CAAC,CAAC;YAE7D,MAAM,cAAc,GAAG,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,OAAO,CAAC,YAAY,EAAE,SAAS,CAAC,CAAC;YAC7E,MAAM,QAAQ,GAAG,MAAM,KAAK,CAAC,cAAc,EAAE;gBAC3C,MAAM,EAAE,KAAK;gBACb,MAAM,EAAE,UAAU,CAAC,MAAM;aAC1B,CAAC,CAAC;YAEH,YAAY,CAAC,SAAS,CAAC,CAAC;YACxB,OAAO,QAAQ,CAAC,EAAE,CAAC;QACrB,CAAC;QAAC,MAAM,CAAC;YACP,4CAA4C;YAC5C,OAAO,KAAK,CAAC;QACf,CAAC;IACH,CAAC;IAED;;;OAGG;IACH,KAAK,CAAC,MAAM,CACV,UAAsB,EACtB,OAAiD;QAEjD,IAAI,CAAC,IAAI,CAAC,SAAS,EAAE,CAAC;YACpB,OAAO;gBACL,KAAK,EAAE,KAAK;gBACZ,KAAK,EAAE,IAAI;gBACX,UAAU,EAAE,EAAE;gBACd,WAAW,EAAE,CAAC,qDAAqD,CAAC;aACrE,CAAC;QACJ,CAAC;QAED,MAAM,QAAQ,GAAG,OAAO,EAAE,QAAQ,IAAI,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC;QAC3D,MAAM,OAAO,GAAG,OAAO,EAAE,OAAO,IAAI,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC;QAExD,IAAI,CAAC;YACH,MAAM,UAAU,GAAG,IAAI,eAAe,EAAE,CAAC;YACzC,MAAM,SAAS,GAAG,UAAU,CAAC,GAAG,EAAE,CAAC,UAAU,CAAC,KAAK,EAAE,EAAE,OAAO,CAAC,CAAC;YAEhE,MAAM,QAAQ,GAAG,MAAM,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE;gBACjD,MAAM,EAAE,MAAM;gBACd,OAAO,EAAE;oBACP,cAAc,EAAE,kBAAkB;oBAClC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,IAAI;wBACxB,aAAa,EAAE,UAAU,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE;qBAC9C,CAAC;iBACH;gBACD,IAAI,EAAE,IAAI,CAAC,SAAS,CAAC;oBACnB,WAAW,EAAE;wBACX,KAAK,EAAE,UAAU,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;4BAClC,EAAE,EAAE,CAAC,CAAC,EAAE;4BACR,IAAI,EAAE,CAAC,CAAC,IAAI;4BACZ,SAAS,EAAE,CAAC,CAAC,QAAQ;yBACtB,CAAC,CAAC;wBACH,UAAU,EAAE,UAAU,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;4BAC5C,IAAI,EAAE,CAAC,CAAC,IAAI;4BACZ,IAAI,EAAE,CAAC,CAAC,IAAI;yBACb,CAAC,CAAC;wBACH,YAAY,EAAE,UAAU,CAAC,WAAW;qBACrC;oBACD,SAAS,EAAE,QAAQ;iBACpB,CAAC;gBACF,MAAM,EAAE,UAAU,CAAC,MAAM;aAC1B,CAAC,CAAC;YAEH,YAAY,CAAC,SAAS,CAAC,CAAC;YAExB,IAAI,CAAC,QAAQ,CAAC,EAAE,EAAE,CAAC;gBACjB,MAAM,IAAI,KAAK,CAAC,4BAA4B,QAAQ,CAAC,MAAM,EAAE,CAAC,CAAC;YACjE,CAAC;YAED,MAAM,MAAM,GAAG,MAAM,QAAQ,CAAC,IAAI,EAAE,CAAC;YACrC,OAAO,IAAI,CAAC,iBAAiB,CAAC,MAAM,CAAC,CAAC;QACxC,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,IAAI,KAAK,YAAY,KAAK,IAAI,KAAK,CAAC,IAAI,KAAK,YAAY,EAAE,CAAC;gBAC1D,OAAO;oBACL,KAAK,EAAE,KAAK;oBACZ,KAAK,EAAE,IAAI;oBACX,UAAU,EAAE,EAAE;oBACd,WAAW,EAAE,CAAC,gCAAgC,OAAO,IAAI,CAAC;iBAC3D,CAAC;YACJ,CAAC;YAED,OAAO;gBACL,KAAK,EAAE,KAAK;gBACZ,KAAK,EAAE,IAAI;gBACX,UAAU,EAAE,EAAE;gBACd,WAAW,EAAE;oBACX,mBAAmB,KAAK,YAAY,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE;iBAC5E;aACF,CAAC;QACJ,CAAC;IACH,CAAC;IAED;;OAEG;IACK,iBAAiB,CAAC,QAAiB;QACzC,MAAM,IAAI,GAAG,QAAmC,CAAC;QAEjD,IAAI,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YAC7B,OAAO;gBACL,KAAK,EAAE,IAAI;gBACX,KAAK,EAAE,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC;gBACzB,UAAU,EAAE,IAAI,CAAC,eAAe,CAAC,IAAI,CAAC,WAAW,CAAC;gBAClD,WAAW,EAAE,EAAE;aAChB,CAAC;QACJ,CAAC;QAED,OAAO;YACL,KAAK,EAAE,KAAK;YACZ,KAAK,EAAE,IAAI;YACX,UAAU,EAAE,IAAI,CAAC,eAAe,CAAC,IAAI,CAAC,WAAW,CAAC;YAClD,WAAW,EAAE,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,WAAW,CAAC;gBAC1C,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,MAAM,CAAC;gBAC9B,CAAC,CAAC,EAAE;SACP,CAAC;IACJ,CAAC;IAED;;OAEG;IACK,eAAe,CAAC,IAAa;QACnC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC;YACzB,OAAO,EAAE,CAAC;QACZ,CAAC;QAED,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,IAAa,EAAE,EAAE;YAChC,MAAM,CAAC,GAAG,IAA+B,CAAC;YAC1C,OAAO;gBACL,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC,MAAM,IAAI,EAAE,CAAC;gBAC9B,KAAK,EAAE;oBACL,KAAK,EAAE,EAAE;oBACT,UAAU,EAAE,EAAE;oBACd,WAAW,EAAE,CAAC;iBACf;gBACD,KAAK,EAAE,MAAM,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC;gBAC3B,QAAQ,EAAE,EAAE;aACb,CAAC;QACJ,CAAC,CAAC,CAAC;IACL,CAAC;IAED;;;OAGG;IACH,WAAW,CAAC,WAAuB;QACjC,MAAM,QAAQ,GAAa,EAAE,CAAC;QAC9B,MAAM,WAAW,GAAa,EAAE,CAAC;QAEjC,0BAA0B;QAC1B,MAAM,WAAW,GAAG,WAAW,CAAC,KAAK,CAAC,WAAW,CAAC,WAAW,CAAC,CAAC;QAC/D,IAAI,WAAW,EAAE,CAAC;YAChB,MAAM,QAAQ,GAAG,WAAW,CAAC,QAAQ,CAAC;YAEtC,2CAA2C;YAC3C,IAAI,QAAQ,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC;gBAC3B,QAAQ,CAAC,IAAI,CAAC,6DAA6D,CAAC,CAAC;gBAC7E,WAAW,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;YAClC,CAAC;YAED,IAAI,QAAQ,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC;gBAC3B,QAAQ,CAAC,IAAI,CAAC,gEAAgE,CAAC,CAAC;gBAChF,WAAW,CAAC,IAAI,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;YACpC,CAAC;YAED,IAAI,QAAQ,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC;gBAC3B,QAAQ,CAAC,IAAI,CAAC,iEAAiE,CAAC,CAAC;gBACjF,WAAW,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;YAC9B,CAAC;YAED,IAAI,QAAQ,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC;gBAC3B,QAAQ,CAAC,IAAI,CAAC,uEAAuE,CAAC,CAAC;gBACvF,WAAW,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;YAC9B,CAAC;YAED,IAAI,QAAQ,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC;gBAC3B,QAAQ,CAAC,IAAI,CAAC,yEAAyE,CAAC,CAAC;gBACzF,WAAW,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YAC5B,CAAC;YAED,IAAI,QAAQ,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC;gBAC3B,QAAQ,CAAC,IAAI,CAAC,+DAA+D,CAAC,CAAC;gBAC/E,WAAW,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;YAC9B,CAAC;YAED,IAAI,QAAQ,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,QAAQ,CAAC,QAAQ,CAAC,MAAM,CAAC,EAAE,CAAC;gBAC1D,QAAQ,CAAC,IAAI,CAAC,iDAAiD,CAAC,CAAC;gBACjE,WAAW,CAAC,IAAI,CAAC,aAAa,EAAE,SAAS,CAAC,CAAC;YAC7C,CAAC;QACH,CAAC;QAED,0CAA0C;QAC1C,IAAI,WAAW,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACtC,QAAQ,CAAC,IAAI,CAAC,+DAA+D,CAAC,CAAC;YAE/E,KAAK,MAAM,GAAG,IAAI,WAAW,CAAC,UAAU,EAAE,CAAC;gBACzC,IAAI,GAAG,CAAC,IAAI,KAAK,WAAW,EAAE,IAAI,EAAE,CAAC;oBACnC,WAAW,CAAC,IAAI,CAAC,SAAS,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC;gBACxC,CAAC;YACH,CAAC;QACH,CAAC;QAED,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC1B,QAAQ,CAAC,IAAI,CAAC,wDAAwD,CAAC,CAAC;YACxE,WAAW,CAAC,IAAI,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;QACrC,CAAC;QAED,OAAO;YACL,UAAU,EAAE,WAAW;YACvB,gBAAgB,EAAE,EAAE;YACpB,eAAe,EAAE,EAAE,EAAE,6CAA6C;YAClE,QAAQ;SACT,CAAC;IACJ,CAAC;IAED;;OAEG;IACH,UAAU;QACR,IAAI,CAAC,SAAS,GAAG,KAAK,CAAC;IACzB,CAAC;IAED;;OAEG;IACH,SAAS;QACP,OAAO,EAAE,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;IAC5B,CAAC;CACF"}

package/dist/proof/index.d.ts

@@ -0,0 +1,7 @@
+/**
+ * @fileoverview Proof module exports
+ * @module @nahisaho/musubix-lean/proof
+ */
+export { ProofGenerator, generateProof, generateProofSketch } from './ProofGenerator.js';
+export { ReProverClient } from './ReProverClient.js';
+//# sourceMappingURL=index.d.ts.map

package/dist/proof/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/proof/index.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,cAAc,EAAE,aAAa,EAAE,mBAAmB,EAAE,MAAM,qBAAqB,CAAC;AACzF,OAAO,EAAE,cAAc,EAAE,MAAM,qBAAqB,CAAC"}