mlsanityData to 13 Oct 2026

A Lean Dataset for International Math Olympiad: Small Steps towards Writing Math Proofs for Hard Problems

arXiv 2411.18872 ↗First posted 28 Nov 2024cs.LGcited by 6

Not on the map. Why?

Abstract (arXiv)

Using AI to write formal proofs for mathematical problems is a challenging task that has seen some advancements in recent years. Automated systems such as Lean can verify the correctness of proofs written in formal language, yet writing the proofs in formal language can be challenging for humans and machines. The miniF2F benchmark has 20 IMO problems in its test set, yet formal proofs are available only for 6 of these problems (3 of which are only written by mathematicians). The model with best accuracy can only prove 2 of these 20 IMO problems, from 1950s and 60s, while its training set is a secret. In this work, we write complete, original formal proofs for the remaining IMO problems in Lean along with 3 extra problems from IMO 2022 and 2023. This effort expands the availability of proof currently in the public domain by creating 5,880 lines of Lean proof. The goal of the paper is to pave the way for developing AI models that can automatically write the formal proofs for all the IMO problems in miniF2F and beyond by providing an evaluation benchmark. In this pursuit, we devise a method to decompose the proofs of these problems into their building blocks, constructing a dataset of 1,329 lemmas with more than 40k lines of Lean code. These lemmas are not trivial, yet they are approachable, providing the opportunity to evaluate and diagnose the failures and successes of AI models. We evaluate the ability of the SOTA LLMs on our dataset and analyze their success and failure modes from different perspectives. Our dataset and code is available at: https://github.com/roozbeh-yz/IMO-Steps.

Key facts. Cited by 6 papers in the map (data through 13 Oct 2026). Builds on 19 of its 31 references that are in the map. First posted on arXiv 28 Nov 2024.

Builds on

19 of 31 references.

References · 19

  1. 2024The Llama 3 Herd of Modelscited by 14,486
  2. 2022Large Language Models are Zero-Shot Reasonerscited by 4,348
  3. 2023Let's Verify Step by Stepcited by 3,672
  4. 2023Sparks of Artificial General Intelligence: Early experiments with GPT-4cited by 2,586
  5. 2019Do ImageNet Classifiers Generalize to ImageNet?cited by 1,510
  6. 2018Datasheets for Datasetscited by 1,377
  7. 2024Qwen2.5-Math Technical Report: Toward Mathematical Expert Model via Self-Improvementcited by 1,077
  8. 2023LeanDojo: Theorem Proving with Retrieval-Augmented Language Modelscited by 420
  9. 2021MiniF2F: a cross-system benchmark for formal Olympiad-level mathematicscited by 383
  10. 2022Draft, Sketch, and Prove: Guiding Formal Theorem Provers with Informal Proofscited by 285
  11. 2024DeepSeek-Prover: Advancing Theorem Proving in LLMs through Large-Scale Synthetic Datacited by 231
  12. 2022HyperTree Proof Search for Neural Theorem Provingcited by 195
7 more
  1. 2024DeepSeek-Prover-V1.5: Harnessing Proof Assistant Feedback for Reinforcement Learning and Monte-Carlo Tree Searchcited by 194
  2. 2023OpenWebMath: An Open Dataset of High-Quality Mathematical Web Textcited by 153
  3. 2022Formal Mathematics Statement Curriculum Learningcited by 141
  4. 2023Baldur: Whole-Proof Generation and Repair with Large Language Modelscited by 119
  5. 2023LEGO-Prover: Neural Theorem Proving with Growing Librariescited by 109
  6. 2023Skill-Mix: a Flexible and Expandable Family of Evaluations for AI modelscited by 64
  7. 2024Cedar: A New Language for Expressive, Fast, Safe, and Analyzable Authorization (Extended Version)cited by 31

Built on by

Cited by year (2026 to 13 Oct)

Citing papers per year: 2025: 4; 2026: 2.

6 papers.