AdvancedMathBench: A Benchmark Suite for Advanced Mathematical Proof Generation and Verification
Summary
AdvancedMathBench is a new benchmark suite for evaluating LLMs on advanced mathematical proof generation and verification. It includes ProverBench for generation and VerifierBench for verification, demonstrating that current models like GPT-5.5-xhigh achieve only modest performance.
View Cached Full Text
Cached at: 07/14/26, 04:13 AM
Paper page - AdvancedMathBench: A Benchmark Suite for Advanced Mathematical Proof Generation and Verification
Source: https://huggingface.co/papers/2607.11849 Authors:
,
,
,
,
,
,
,
,
,
,
,
Abstract
Largelanguagemodels(LLMs)haveachievedremarkableperformanceonhigh-schoolandolympiad-stylemathematics,yettheircapabilitiesonadvancedmathematicsremainpoorlyunderstood.Existingbenchmarks,however,fallshortinbothscopeandevaluationgranularity:theyprovidelimiteddisciplinarycoverageandoftenrelyonfinal-answercorrectnessorcoarsejudgments,leavingthevalidityofthereasoningprocessinadequatelyassessed.Tobridgethisgap,weintroduceAdvancedMathBench,abenchmarksuitedesignedtoevaluateadvancedmathematicalreasoningcapabilities.Itscoreproof-generationbenchmark,ProverBench,contains296problemsspanningundergraduateanddoctoralqualifying-examlevels.Toprovidereliableevaluationoftheproofs,wedevelopadedicatedautomaticverificationpipelinetrainedonlarge-scaleexpertannotationstoproducebothcorrectnessverdictsandfine-grainedassessmentsofprooferrors,whichexhibitsstrongagreementwithhumanexpertsonheld-outprooftrajectories.WefurtherintroduceVerifierBench,consistingof888model-generatedprooftrajectoriespairedwithexpertgroundtruth,toevaluatewhethermodelscancorrectlyjudgeproofvalidityandprovidesoundverificationrationales.ExperimentsshowthatAdvancedMathBenchremainschallengingforfrontiermodels.Onproofgeneration,thebest-performingmodel,GPT-5.5-xhigh,achievesonly75.8and66.1ontheUGDandQEsplits,respectively,indicatingsubstantialroomforimprovementonadvancedmathematicalproofconstruction.Onproofverification,thebestmodelattainsaBalancedF1ofonly65.1,andmodelsgenerallyexhibitlowtruenegativerates,suggestingthatcriticalerrordetectionremainsamajorbottleneck.
View arXiv pageView PDFAdd to collection
Models citing this paper0
No model linking this paper
Cite arxiv.org/abs/2607.11849 in a model README.md to link it from this page.
Datasets citing this paper0
No dataset linking this paper
Cite arxiv.org/abs/2607.11849 in a dataset README.md to link it from this page.
Spaces citing this paper0
No Space linking this paper
Cite arxiv.org/abs/2607.11849 in a Space README.md to link it from this page.
Collections including this paper0
No Collection including this paper
Add this paper to acollectionto link it from this page.
Similar Articles
MA-ProofBench: A Two-Tiered Evaluation of LLMs for Theorem Proving in Mathematical Analysis
MA-ProofBench is a new formal benchmark for evaluating LLMs on theorem proving in mathematical analysis, containing 200 problems across two difficulty levels. The best model, GPT-5.5, achieves only 16% on Level I and 5% on Level II, highlighting a significant gap between informal and formal reasoning.
VerifierBench: Benchmarking the Generation of Executable Verifiers for LLM Agents
VerifierBench introduces a benchmark of 222 tasks and 4,993 hidden test cases to evaluate how well LLM agents generate executable verifiers, finding that verifiers tend to over-reject valid solutions due to hidden assumptions that survive self-testing.
GTBench: A Curriculum-Grounded Benchmark for Evaluating LLMs as Mathematical Research Assistants in Graph Theory
The paper introduces GTBench, a curriculum-grounded benchmark for evaluating LLMs as mathematical research assistants in graph theory, containing 63 problems across three difficulty levels. It evaluates five frontier models and finds that performance degrades with difficulty, with GPT-5 achieving near-perfect results on basic problems but only 82% on graduate-level proofs.
ComBench: A Benchmark for Rigorous Proof Reasoning and Constructive Realization in Olympiad-Level Combinatorics
ComBench is an Olympiad-level combinatorics benchmark with 100 problems designed to evaluate rigorous proof reasoning and constructive realization in large language models, revealing that frontier models like GPT-5.5 achieve only 65.4% overall average and that these two capabilities are distinct.
RePro: Proof-Verified Benchmark Rewriting for Reliable Evaluation of LLM Mathematical Problem Solving
RePro integrates Lean-oriented neural automated theorem provers into benchmark rewriting to ensure problem validity and answer correctness for reliable evaluation of LLMs in mathematical problem solving.