id string | source string | formal_statement string | header string | lean4_code string | has_proof bool | proof_body string | natural_language null | lean_version string | split string | tags list | category null | metadata string | verification string | v4210_is_valid bool | v4210_compiles bool | v4210_has_sorry bool | v4210_latency_s float64 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
compfiles_Bulgaria1998P1 | compfiles | Copyright (c) 2023 David Renshaw. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: David Renshaw
-/
import Mathlib
/-!
# Bulgarian Mathematical Olympiad 1998, Problem 1
We will be considering colorings in 2 colors of n (distinct) points
A₁, A₂, ..., Aₙ. Call such a ... | /- | /-
Copyright (c) 2023 David Renshaw. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: David Renshaw
-/
import Mathlib
/-!
# Bulgarian Mathematical Olympiad 1998, Problem 1
We will be considering colorings in 2 colors of n (distinct) points
A₁, A₂, ..., Aₙ. Call such... | false | null | null | v4.29.0-rc6 | test | [
"competition"
] | null | {"filename": "Bulgaria1998P1.lean"} | {"v4.21.0": {"is_valid": false, "has_sorry": true, "errors": [], "timeout_s": 600.0, "latency_s": 34.5438, "verified_at": "2026-03-26T18:15:55.711664+00:00"}} | false | true | true | 34.5438 |
compfiles_Bulgaria1998P11 | compfiles | Copyright (c) 2023 The Compfiles Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: David Renshaw, Adam Kurkiewicz
-/
import Mathlib
/-!
Bulgarian Mathematical Olympiad 1998, Problem 11
Let m,n be natural numbers such that
A = ((m + 3)ⁿ + 1) / (3m)
... | /- | /-
Copyright (c) 2023 The Compfiles Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: David Renshaw, Adam Kurkiewicz
-/
import Mathlib
/-!
Bulgarian Mathematical Olympiad 1998, Problem 11
Let m,n be natural numbers such that
A = ((m + 3)ⁿ + 1) / (3m... | true | Copyright (c) 2023 The Compfiles Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: David Renshaw, Adam Kurkiewicz
-/
import Mathlib
/-!
Bulgarian Mathematical Olympiad 1998, Problem 11
Let m,n be natural numbers such that
A = ((m + 3)ⁿ + 1) / (3m)
... | null | v4.29.0-rc6 | test | [
"competition"
] | null | {"filename": "Bulgaria1998P11.lean"} | {"v4.21.0": {"is_valid": false, "has_sorry": false, "errors": ["unknown tactic", "unsolved goals\ncase neg\nm n A : \u2115\nh : 3 * m * A = (m + 3) ^ 0 + 1\nn_gt_zero : \u00acn > 0\n\u22a2 Odd n \u2227 m \u2261 2 [MOD 3]", "unknown tactic", "unsolved goals\nm : \u2115\neven_m : Even m\nh : 0 < m\na : \u2115\nha : m = 2... | false | true | false | 40.3366 |
compfiles_Bulgaria1998P2 | compfiles | Copyright (c) 2023 David Renshaw. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: David Renshaw
-/
import Mathlib
/-!
# Bulgarian Mathematical Olympiad 1998, Problem 2
A convex quadrilateral ABCD has AD = CD and ∠DAB = ∠ABC < 90°.
The line through D and the midpoin... | /- | /-
Copyright (c) 2023 David Renshaw. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: David Renshaw
-/
import Mathlib
/-!
# Bulgarian Mathematical Olympiad 1998, Problem 2
A convex quadrilateral ABCD has AD = CD and ∠DAB = ∠ABC < 90°.
The line through D and the midp... | false | null | null | v4.29.0-rc6 | test | [
"competition"
] | null | {"filename": "Bulgaria1998P2.lean"} | {"v4.21.0": {"is_valid": false, "has_sorry": true, "errors": [], "timeout_s": 600.0, "latency_s": 33.2751, "verified_at": "2026-03-26T18:15:54.443933+00:00"}} | false | true | true | 33.2751 |
compfiles_Bulgaria1998P3 | compfiles | Copyright (c) 2023 David Renshaw. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: David Renshaw
-/
import Mathlib
/-!
# Bulgarian Mathematical Olympiad 1998, Problem 3
Let ℝ⁺ be the set of positive real numbers. Prove that there does not exist a function
f: ℝ⁺ → ℝ⁺... | /- | /-
Copyright (c) 2023 David Renshaw. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: David Renshaw
-/
import Mathlib
/-!
# Bulgarian Mathematical Olympiad 1998, Problem 3
Let ℝ⁺ be the set of positive real numbers. Prove that there does not exist a function
f: ℝ⁺ →... | true | Copyright (c) 2023 David Renshaw. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: David Renshaw
-/
import Mathlib
/-!
# Bulgarian Mathematical Olympiad 1998, Problem 3
Let ℝ⁺ be the set of positive real numbers. Prove that there does not exist a function
f: ℝ⁺ → ℝ⁺... | null | v4.29.0-rc6 | test | [
"competition"
] | null | {"filename": "Bulgaria1998P3.lean"} | {"v4.21.0": {"is_valid": false, "has_sorry": false, "errors": ["unknown identifier 'mul_lt_mul_iff_left\u2080'"], "timeout_s": 600.0, "latency_s": 35.1685, "verified_at": "2026-03-26T18:15:56.337288+00:00"}} | false | true | false | 35.1685 |
compfiles_Bulgaria1998P6 | compfiles | Copyright (c) 2023 David Renshaw. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: David Renshaw
-/
import Mathlib
/-!
# Bulgarian Mathematical Olympiad 1998, Problem 6
Prove that the equation
x²y² = z²(z² - x² - y²)
has no solutions in positive integers.
-/... | /- | /-
Copyright (c) 2023 David Renshaw. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: David Renshaw
-/
import Mathlib
/-!
# Bulgarian Mathematical Olympiad 1998, Problem 6
Prove that the equation
x²y² = z²(z² - x² - y²)
has no solutions in positive integers.
... | false | null | null | v4.29.0-rc6 | test | [
"competition"
] | null | {"filename": "Bulgaria1998P6.lean"} | {"v4.21.0": {"is_valid": false, "has_sorry": true, "errors": [], "timeout_s": 600.0, "latency_s": 1.6128, "verified_at": "2026-03-26T18:15:56.056907+00:00"}} | false | true | true | 1.6128 |
compfiles_Bulgaria1998P8 | compfiles | Copyright (c) 2023 David Renshaw. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: David Renshaw
-/
import Mathlib
/-!
# Bulgarian Mathematical Olympiad 1998, Problem 8
The polynomials Pₙ(x,y) for n = 1, 2, ... are defined by P₁(x,y) = 1 and
Pₙ₊₁(x,y) = (x + y - 1)... | /- | /-
Copyright (c) 2023 David Renshaw. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: David Renshaw
-/
import Mathlib
/-!
# Bulgarian Mathematical Olympiad 1998, Problem 8
The polynomials Pₙ(x,y) for n = 1, 2, ... are defined by P₁(x,y) = 1 and
Pₙ₊₁(x,y) = (x + y -... | true | Copyright (c) 2023 David Renshaw. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: David Renshaw
-/
import Mathlib
/-!
# Bulgarian Mathematical Olympiad 1998, Problem 8
The polynomials Pₙ(x,y) for n = 1, 2, ... are defined by P₁(x,y) = 1 and
Pₙ₊₁(x,y) = (x + y - 1)... | null | v4.29.0-rc6 | test | [
"competition"
] | null | {"filename": "Bulgaria1998P8.lean"} | {"v4.21.0": {"is_valid": true, "has_sorry": false, "errors": [], "timeout_s": 600.0, "latency_s": 1.7539, "verified_at": "2026-03-26T18:15:57.465676+00:00"}} | true | true | false | 1.7539 |
compfiles_CIIM2022P6 | compfiles | Copyright (c) 2024 David Renshaw. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: David Renshaw
-/
import Mathlib
/-!
# Iberoamerican Interuniversity Mathematics Competition 2022, Problem 6
Given a positive integer m, let d(m) be the number of postive
divisors of m... | /- | /-
Copyright (c) 2024 David Renshaw. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: David Renshaw
-/
import Mathlib
/-!
# Iberoamerican Interuniversity Mathematics Competition 2022, Problem 6
Given a positive integer m, let d(m) be the number of postive
divisors o... | false | null | null | v4.29.0-rc6 | test | [
"competition"
] | null | {"filename": "CIIM2022P6.lean"} | {"v4.21.0": {"is_valid": false, "has_sorry": true, "errors": [], "timeout_s": 600.0, "latency_s": 0.0288, "verified_at": "2026-03-26T18:15:56.085817+00:00"}} | false | true | true | 0.0288 |
compfiles_Canada1998P3 | compfiles | Copyright (c) 2023 David Renshaw. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: David Renshaw
-/
import Mathlib
/-!
Canadian Mathematical Olympiad 1998, Problem 3
Let n be a natural number such that n ≥ 2. Show that
(1/(n + 1))(1 + 1/3 + ... + 1/(2n - 1)) > (1... | /- | /-
Copyright (c) 2023 David Renshaw. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: David Renshaw
-/
import Mathlib
/-!
Canadian Mathematical Olympiad 1998, Problem 3
Let n be a natural number such that n ≥ 2. Show that
(1/(n + 1))(1 + 1/3 + ... + 1/(2n - 1)) >... | true | Copyright (c) 2023 David Renshaw. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: David Renshaw
-/
import Mathlib
/-!
Canadian Mathematical Olympiad 1998, Problem 3
Let n be a natural number such that n ≥ 2. Show that
(1/(n + 1))(1 + 1/3 + ... + 1/(2n - 1)) > (1... | null | v4.29.0-rc6 | test | [
"competition"
] | null | {"filename": "Canada1998P3.lean"} | {"v4.21.0": {"is_valid": false, "has_sorry": false, "errors": ["unknown tactic", "unknown constant 'Finset.nonempty_range_add_one'", "unsolved goals\nm : \u2115\nih :\n (\u2191m.succ.succ + 1) * \u2211 i \u2208 Finset.range m.succ.succ, 1 / (2 * \u2191i + 2) <\n \u2191m.succ.succ * \u2211 i \u2208 Finset.range m.su... | false | true | false | 5.2525 |
compfiles_Canada1998P5 | compfiles | Copyright (c) 2023 David Renshaw. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: David Renshaw
-/
import Mathlib
/-!
Canadian Mathematical Olympiad 1998, Problem 5
Let m be a positive integer. Define the sequence {aₙ} by a₀ = 0,
a₁ = m, and aₙ₊₁ = m²aₙ - aₙ₋₁ for ... | /- | /-
Copyright (c) 2023 David Renshaw. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: David Renshaw
-/
import Mathlib
/-!
Canadian Mathematical Olympiad 1998, Problem 5
Let m be a positive integer. Define the sequence {aₙ} by a₀ = 0,
a₁ = m, and aₙ₊₁ = m²aₙ - aₙ₋₁ f... | false | null | null | v4.29.0-rc6 | test | [
"competition"
] | null | {"filename": "Canada1998P5.lean"} | {"v4.21.0": {"is_valid": false, "has_sorry": true, "errors": [], "timeout_s": 600.0, "latency_s": 0.0672, "verified_at": "2026-03-26T18:15:56.404638+00:00"}} | false | true | true | 0.0672 |
compfiles_Egmo2023P1 | compfiles | Copyright (c) 2025 The Compfiles Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Ansar Azharov
-/
import Mathlib
/-!
# European Girls' Mathematical Olympiad 2023, Problem 1
There are n ≥ 3 positive real numbers a_1, a_2, . . . , a_n. For each 1 ≤ i ≤ ... | /- | /-
Copyright (c) 2025 The Compfiles Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Ansar Azharov
-/
import Mathlib
/-!
# European Girls' Mathematical Olympiad 2023, Problem 1
There are n ≥ 3 positive real numbers a_1, a_2, . . . , a_n. For each 1 ≤ i... | true | Copyright (c) 2025 The Compfiles Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Ansar Azharov
-/
import Mathlib
/-!
# European Girls' Mathematical Olympiad 2023, Problem 1
There are n ≥ 3 positive real numbers a_1, a_2, . . . , a_n. For each 1 ≤ i ≤ ... | null | v4.29.0-rc6 | test | [
"competition"
] | null | {"filename": "Egmo2023P1.lean"} | {"v4.21.0": {"is_valid": false, "has_sorry": false, "errors": ["failed to prove positivity/nonnegativity/nonzeroness", "unsolved goals\ncase intro.intro\nn : \u2115\ninst\u271d : NeZero n\nx\u271d : n \u2265 3\na : Fin n \u2192 \u211d\nha : \u2200 (i : Fin n), a i > 0\nb : Fin n \u2192 \u211d\nhb : \u2200 (i : Fin n), ... | false | true | false | 0.2509 |
compfiles_Hungary1998P6 | compfiles | Copyright (c) 2023 David Renshaw. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: David Renshaw
-/
import Mathlib
/-!
# Hungarian Mathematical Olympiad 1998, Problem 6
Let x, y, z be integers with z > 1. Show that
(x + 1)² + (x + 2)² + ... + (x + 99)² ≠ yᶻ.
-/
n... | /- | /-
Copyright (c) 2023 David Renshaw. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: David Renshaw
-/
import Mathlib
/-!
# Hungarian Mathematical Olympiad 1998, Problem 6
Let x, y, z be integers with z > 1. Show that
(x + 1)² + (x + 2)² + ... + (x + 99)² ≠ yᶻ.
-/... | true | Copyright (c) 2023 David Renshaw. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: David Renshaw
-/
import Mathlib
/-!
# Hungarian Mathematical Olympiad 1998, Problem 6
Let x, y, z be integers with z > 1. Show that
(x + 1)² + (x + 2)² + ... + (x + 99)² ≠ yᶻ.
-/
n... | null | v4.29.0-rc6 | test | [
"competition"
] | null | {"filename": "Hungary1998P6.lean"} | {"v4.21.0": {"is_valid": false, "has_sorry": false, "errors": ["unknown tactic", "unsolved goals\ncase intro.succ.succ\nx y : \u2124\nh2 : \u2211 i \u2208 Finset.range 99, x ^ 2 = 99 * x ^ 2\nh4 : \u2211 i \u2208 Finset.range 99, (\u2191i + 1) = \u2211 i \u2208 Finset.range 100, \u2191i\nh5 : \u2211 i \u2208 Finset.ran... | false | true | false | 1.7075 |
compfiles_Imo1959P1 | compfiles | Copyright (c) 2020 Kevin Lacker. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kevin Lacker
-/
import Mathlib
/-!
# International Mathematical Olympiad 1959, Problem 1.
Prove that the fraction `(21n+4)/(14n+3)` is irreducible for every
natural number `n`.
-/
name... | /- | /-
Copyright (c) 2020 Kevin Lacker. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kevin Lacker
-/
import Mathlib
/-!
# International Mathematical Olympiad 1959, Problem 1.
Prove that the fraction `(21n+4)/(14n+3)` is irreducible for every
natural number `n`.
-/
n... | true | Copyright (c) 2020 Kevin Lacker. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Kevin Lacker
-/
import Mathlib
/-!
# International Mathematical Olympiad 1959, Problem 1.
Prove that the fraction `(21n+4)/(14n+3)` is irreducible for every
natural number `n`.
-/
name... | null | v4.29.0-rc6 | test | [
"competition",
"imo"
] | null | {"filename": "Imo1959P1.lean"} | {"v4.21.0": {"is_valid": true, "has_sorry": false, "errors": [], "timeout_s": 600.0, "latency_s": 0.0842, "verified_at": "2026-03-26T18:15:57.549955+00:00"}} | true | true | false | 0.0842 |
compfiles_Imo1959P2 | compfiles | Copyright (c) 2024 Yury Kudryashov. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yury Kudryashov
-/
import Mathlib
/-!
# International Mathematical Olympiad 1959, Problem 2
For what real values of x is
√(x+√(2x-1)) + √(x-√(2x-1)) = A,
given:
(a) A = √2
(b)... | /- | /-
Copyright (c) 2024 Yury Kudryashov. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yury Kudryashov
-/
import Mathlib
/-!
# International Mathematical Olympiad 1959, Problem 2
For what real values of x is
√(x+√(2x-1)) + √(x-√(2x-1)) = A,
given:
(a) A = √2
... | true | Copyright (c) 2024 Yury Kudryashov. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yury Kudryashov
-/
import Mathlib
/-!
# International Mathematical Olympiad 1959, Problem 2
For what real values of x is
√(x+√(2x-1)) + √(x-√(2x-1)) = A,
given:
(a) A = √2
(b)... | null | v4.29.0-rc6 | test | [
"competition",
"imo"
] | null | {"filename": "Imo1959P2.lean"} | {"v4.21.0": {"is_valid": false, "has_sorry": false, "errors": ["unknown identifier 'sqrt'", "unknown identifier 'sqrt'", "unknown identifier 'sqrt'", "unknown identifier 'sqrt'", "function expected at\n sqrt\nterm has type\n ?m.449", "function expected at\n sqrt\nterm has type\n ?m.449", "function expected at\n sq... | false | true | false | 0.8435 |
End of preview. Expand in Data Studio
ai4math-lean
21 Lean 4 formal mathematics datasets with machine-verified labels.
Every problem has been verified against lean-server v4.21.0 on UVA's HPC cluster.
Results are embedded in each row as both structured verification JSON and flattened convenience columns.
Quick Start
from datasets import load_dataset
# Load a single dataset
ds = load_dataset("charliemeyer2000/ai4math-lean", "deepseek_prover")
# Load a large dataset with streaming
ds = load_dataset("charliemeyer2000/ai4math-lean", "goedel_pset", streaming=True)
# Filter to valid proofs
valid = ds.filter(lambda x: x["v4210_is_valid"] == True)
# Filter to RL targets (compiles but no proof)
rl = ds.filter(lambda x: x["v4210_compiles"] and not x["has_proof"])
Totals
| Metric | Count |
|---|---|
| Total problems | 3,394,310 |
| With proofs (SFT) | 1,273,472 |
| Valid on v4.21.0 | 352,065 |
Datasets
| Dataset | Problems | Proofs | Valid v4.21.0 |
|---|---|---|---|
| compfiles | 297 | 259 | 67 |
| deepseek_prover | 27,503 | 27,503 | 27,126 |
| deepseek_proverbench | 325 | 0 | 0 |
| formal_conjectures | 618 | 13 | 13 |
| formalmath | 5,560 | 5,556 | 2 |
| goedel_minif2f | 244 | 0 | 0 |
| goedel_mobench | 360 | 0 | 0 |
| goedel_pset | 1,732,594 | 263,589 | 9,755 |
| goedel_test | 8 | 0 | 0 |
| hf_lean_workbook | 29,750 | 29,750 | 29,208 |
| hf_minif2f_lean4 | 231 | 0 | 0 |
| hf_minif2f_v2 | 488 | 0 | 0 |
| hf_tonic_minif2f | 488 | 0 | 0 |
| lean_proofs | 98 | 97 | 15 |
| lean_workbook_full | 140,214 | 0 | 0 |
| matholympiadbench | 360 | 0 | 0 |
| nemotron_proofs | 1,349,950 | 915,078 | 285,867 |
| numinamath_lean | 104,155 | 31,615 | 0 |
| proofnet | 371 | 0 | 0 |
| putnam2025 | 24 | 12 | 12 |
| putnam_bench | 672 | 0 | 0 |
Schema
Each row contains:
| Field | Type | Description |
|---|---|---|
id |
string | Unique problem identifier |
source |
string | Dataset source name |
formal_statement |
string | Lean 4 theorem statement (no proof body) |
header |
string | Import/setup code |
lean4_code |
string | Full runnable Lean 4 code |
has_proof |
bool | True if contains a real proof (not sorry) |
proof_body |
string? | Proof tactic block (if has_proof) |
natural_language |
string? | NL problem statement (if available) |
lean_version |
string? | Original Lean toolchain version |
split |
string? | train/test/val split |
tags |
list[string] | Tags (topic, difficulty, etc.) |
category |
string? | Math category |
verification |
string (JSON) | Full verification results per Lean version |
v4210_is_valid |
bool? | True=valid, False=errors/sorry, None=timeout |
v4210_compiles |
bool | Whether the code compiled (is_valid is not None) |
v4210_has_sorry |
bool? | Whether sorry was detected |
v4210_latency_s |
float? | Verification wall time in seconds |
Verification Details
The verification column contains a JSON string mapping Lean versions to results:
{
"v4.21.0": {
"is_valid": false,
"has_sorry": true,
"errors": [],
"timeout_s": 600.0,
"latency_s": 34.59,
"verified_at": "2026-03-26T21:57:47Z"
}
}
License
Apache 2.0
- Downloads last month
- 84