FATE: A Formal Benchmark Series for Frontier Algebra of Multiple Difficulty Levels
Jiedong Jiang, Wanyi He, Yuefeng Wang, Guoxiong Gao, Yongle Hu, Jingting Wang, Nailin Guan, Peihao Wu, Bryan Dai, Liang Xiao, Bin Dong
摘要
Recent advances in large language models (LLMs) have demonstrated impressive capabilities in formal theorem proving, particularly on contest-based mathematical benchmarks like the IMO. However, these contests do not reflect the depth, breadth, and abstraction of modern mathematical research. To bridge this gap, we introduce FATE (Formal Algebra Theorem Evaluation), a new benchmark series in formal algebra designed to chart a course toward advanced mathematical reasoning. We present two new components, FATE-H and FATE-X, each with 100 problems in abstract and commutative algebra. The FATE series spans a difficulty spectrum from undergraduate exercises to problems exceeding PhD qualifying exams. Notably, FATE-X is the first formal benchmark to surpass both PhD-level exam difficulty and the coverage of the Mathlib library. Our evaluations of state-of-the-art LLM provers on this new benchmark reveal a stark performance gap compared to contest math: the best model achieves only 3% (pass@64) accuracy on FATE-H and 0% on FATE-X. Our two-stage evaluation reveals that models'natural-language reasoning is notably more accurate than their ability to formalize this reasoning. We systematically classify the common errors that arise during this formalization process. Furthermore, a comparative study shows that a specialized prover can exhibit less effective reflection than general-purpose models, reducing its accuracy at the natural-language stage. We believe FATE provides a robust and challenging benchmark that establishes essential checkpoints on the path toward research-level formal mathematical reasoning.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper4
- A Minimal Agent for Automated Theorem ProvingBorja Requena, Austin Letson, Krystian Nowakowski, Izan Beltran Ferreiro 等ICML 2026 · 被引用 9 次
- APE-Bench: Evaluating Automated Proof Engineering for Formal Math LibrariesHuajian Xin, Zheng Yuan, Jacques Fleuriot, Wenda LiICML 2026 · 被引用 4 次
- SorryDB: Can AI Provers Complete Real-World Lean Theorems?Austin Letson, Leopoldo Sarra, Auguste Poiroux, Oliver Dressler 等ICML 2026 · 被引用 4 次
- Decompose, Structure, and Repair: A Neuro-Symbolic Framework for Autoformalization via Operator TreesXiaoyang Liu, Zineng Dong, Yifan Bai, Yantao Li 等ICML 2026 · 被引用 1 次
它引用的顶会 Paper10
- miniF2F: a cross-system benchmark for formal Olympiad-level mathematicsKunhao Zheng, Jesse Michael Han, Stanislas PoluICLR 2022 · 被引用 342 次
- HyperTree Proof Search for Neural Theorem ProvingGuillaume Lample, Timothée Lacroix, Marie-Anne Lachaux, Aurélien Rodriguez 等NeurIPS 2022 · 被引用 271 次
- Goedel-Prover-V2: Scaling Formal Theorem Proving with Scaffolded Data Synthesis and Self-CorrectionYong Lin, Shange Tang, Bohan Lyu, Ziran Yang 等ICLR 2026 · 被引用 160 次
- BFS-Prover: Scalable Best-First Tree Search for LLM-based Automatic Theorem ProvingRan Xin, Chenguang Xi, Jie Yang, Feng Chen 等ACL 2025 · 被引用 66 次
- OlympiadBench: A Challenging Benchmark for Promoting AGI with Olympiad-Level Bilingual Multimodal Scientific ProblemsChaoqun He, Renjie Luo, Yuzhuo Bai, Shengding Hu 等ACL 2024 · 被引用 18 次
相关 Paper
- Beyond Detection: Evaluating Fallacy Awareness of LLMs in Interactive ScenariosConghui Niu, Ningxin Wu, Ziran Zhao, Dong Yu 等ACL 2026
- FormalML: A Benchmark for Evaluating Formal Subgoal Completion in Machine Learning TheoryXiao-Wen Yang, Zihao Zhang, Jianuo Cao, Zhi Zhou 等ICLR 2026 · 被引用 8 次
- Omni-MATH: A Universal Olympiad Level Mathematic Benchmark for Large Language ModelsBofei Gao, Feifan Song, Zhe Yang, Zefan Cai 等ICLR 2025 · 被引用 3 次
- MathConstruct: Challenging LLM Reasoning with Constructive ProofsMislav Balunovic, Jasper Dekoninck, Nikola Jovanovic, Ivo Petrov 等ICML 2025
- DAG-Math: Graph-of-Thought Guided Mathematical Reasoning in LLMsYuanhe Zhang, Ilja Kuzborskij, Jason D. Lee, Chenlei Leng 等ICLR 2026 · 被引用 6 次
