Lean Meets Theoretical Computer Science: Scalable Synthesis of Theorem Proving Challenges in Formal-Informal Pairs

In three linesNew approach to generate formal theorem proving challenges by leveraging theoretical computer science (TCS). Framework automatically synthesizes problem-proof pairs in Lean4 and Markdown across two domains: Busy Beaver and Mixed Boolean Arithmetic. DeepSeekProver-V2-671B achieves 57.5% on Busy Beaver but only 12% on Mixed Boolean Arithmetic, revealing major gaps in long-form proof generation.

Summary generated by Claude — human-verified