APE-Bench: Agentic Theorem Proving in Lean
huajian_xin · x · 2026-07-06
The Seed Prover team will present APE-Bench at ICML 2026 (July 9), a benchmark that merges theorem proving with the coding agent paradigm. It models formal proofs (in Lean) into a task structure similar to SWE-Bench. The researchers propose the concept of "Agentic Proof Engineering," unifying three core challenges—deep reasoning, automated research, and coding agents—into a single task. The author has paused their PhD studies at the University of Edinburgh to pursue this research direction.
More from coding & agent
- Bugbot rejects an MCP permission flag because it would break path-scoped isolation — zeeg · 2026-07-27
- One GPT-5.6 agent is guarding a Blink security system while another makes a parody rap album — repligate · 2026-07-27
- An agent got unblocked by reusing a logged-in browser, not stealth tricks — armanidev_ · 2026-07-27
- Paper argues graph topology can become the core operating system for AI agents — theomitsa · 2026-07-27
- Claude Code desktop adds UI markup feedback for smoother visual editing — EricBuess · 2026-07-27
- Anthropic says Claude Code can drop 80% of its system prompt with no coding loss — krishnan · 2026-07-27