MSC-180: A Benchmark for Automated Formal Theorem Proving from Mathematical Subject Classification
Not on the map. Why?
Abstract (arXiv)
Automated Theorem Proving (ATP) represents a core research direction in artificial intelligence for achieving formal reasoning and verification, playing a significant role in advancing machine intelligence. However, current large language model (LLM)-based theorem provers suffer from limitations such as restricted domain coverage and weak generalization in mathematical reasoning. To address these issues, we propose MSC-180, a benchmark for evaluation based on the MSC2020 mathematical subject classification. It comprises 180 formal verification problems, 3 advanced problems from each of 60 mathematical branches, spanning from undergraduate to graduate levels. Each problem has undergone multiple rounds of verification and refinement by domain experts to ensure formal accuracy. Evaluations of state-of-the-art LLM-based theorem provers under the pass@32 setting reveal that the best model achieves only an 18.89% overall pass rate, with prominent issues including significant domain bias (maximum domain coverage 41.7%) and a difficulty gap (significantly lower pass rates on graduate-level problems). To further quantify performance variability across mathematical domains, we introduce the coefficient of variation (CV) as an evaluation metric. The observed CV values are 4-6 times higher than the statistical high-variability threshold, indicating that the models still rely on pattern matching from training corpora rather than possessing transferable reasoning mechanisms and systematic generalization capabilities. MSC-180, together with its multi-dimensional evaluation framework, provides a discriminative and systematic benchmark for driving the development of next-generation AI systems with genuine mathematical reasoning abilities.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 12 of its 21 references that are in the map. First posted on arXiv 20 Dec 2025.
Builds on
12 of 21 references.
References · 12
- 2021MiniF2F: a cross-system benchmark for formal Olympiad-level mathematicscited by 380
- 2020Generative Language Modeling for Automated Theorem Provingcited by 379
- 2025DeepSeek-Prover-V2: Advancing Formal Mathematical Reasoning via Reinforcement Learning for Subgoal Decompositioncited by 270
- 2023ProofNet: Autoformalizing and Formally Proving Undergraduate-Level Mathematicscited by 180
- 2025Kimina-Prover Preview: Towards Large Formal Reasoning Models with Reinforcement Learningcited by 173
- 2024PutnamBench: Evaluating Neural Theorem-Provers on the Putnam Mathematical Competitioncited by 153
- 2025Goedel-Prover-V2: Scaling Formal Theorem Proving with Scaffolded Data Synthesis and Self-Correctioncited by 140
- 2025Seed-Prover: Deep and Broad Reasoning for Automated Theorem Provingcited by 96
- 2025BFS-Prover: Scalable Best-First Tree Search for LLM-based Automatic Theorem Provingcited by 82
- 2024Formal Mathematical Reasoning: A New Frontier in AIcited by 80
- 2024A Survey on Deep Learning for Theorem Provingcited by 55
- 2023FIMO: A Challenge Formal Dataset for Automated Theorem Provingcited by 54
Built on by
Citing papers per year: 2026: 2.
2 papers.
Similar, not cited
Close in wording, no citation either way
- 2025FormalMATH: Benchmarking Formal Mathematical Reasoning of Large Language Models
- 2026MA-ProofBench: A Two-Tiered Evaluation of LLMs for Theorem Proving in Mathematical Analysis
- 2025HERMES: Towards Efficient and Verifiable Mathematical Reasoning in LLMs
- 2025ProofCompass: Enhancing Specialized Provers with LLM Guidance
- 2025From Informal to Formal -- Incorporating and Evaluating LLMs on Natural Language Requirements to Verifiable Formal Proofs
- 2023math-PVS: A Large Language Model Framework to Map Scientific Publications to PVS Theories
- 2026AdvancedMathBench: A Benchmark Suite for Advanced Mathematical Proof Generation and Verification
- 2025Spark-Prover-X1: Formal Theorem Proving Through Diverse Data Training