task_id stringlengths 38 100 | task_type stringclasses 1
value | theorem_statement stringlengths 120 11.9k | target_workspace dict | difficulty stringclasses 3
values | source stringclasses 4
values | source_id stringlengths 10 74 | source_license stringclasses 1
value | theorem_names listlengths 1 1 | statement_sha256 stringlengths 64 64 | task_path stringlengths 44 106 | metadata dict |
|---|---|---|---|---|---|---|---|---|---|---|---|
nmp3_0001e8eb-17b3-5bd9-b7ec-fa259a6b2a02 | lean_theorem_proving | -- Original natural-language problem:
-- Determine all functions $f:\mathbb{R}_{\ge0}\to\mathbb{R}_{\ge0}$ such that for all $x,y\ge0$
-- \[
-- f(x^2)+f(f(y))=f\bigl(f(x)+y^2\bigr)-2f(xy).
-- \]
import Mathlib
namespace Problem
/-- The admissibility predicate for the functional equation.
The domain and codomain are ... | {
"name": "target",
"commit_hash": "56a005855ea17e0b0958f73ec801ae140b0a1679",
"repo_url": "https://github.com/leanprover-community/mathlib4.git",
"default_target": "Mathlib",
"read_only_path_patterns": [
"**/*"
],
"toolchain": "leanprover/lean4:v4.35.0"
} | medium | nvidia/Nemotron-Math-Proofs-v3-RL | 0001e8eb-17b3-5bd9-b7ec-fa259a6b2a02 | cc-by-4.0 | [
"nmp3_proof"
] | 24f7bbc31cb277e12075f7fbc845bc8ffad109ebdd6baf0db9e6e72c0528fb99 | tasks/nmp3_0001e8eb-17b3-5bd9-b7ec-fa259a6b2a02 | {
"split": "train",
"difficulty": "medium",
"source": "nvidia/Nemotron-Math-Proofs-v3-RL",
"source_id": "0001e8eb-17b3-5bd9-b7ec-fa259a6b2a02",
"source_license": "cc-by-4.0",
"source_dataset": "davinci-prover/agentic-prover-RL",
"source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"
} |
nmp3_0038fcfc-14de-5989-bd2e-befab5715d65 | lean_theorem_proving | -- Original natural-language problem:
-- Let $f:[a,b]\to[a,b]$ be a continuous function. Suppose there exist $\alpha,\beta\in(a,b)$ such that $f(\alpha)=a$ and $f(\beta)=b$. Prove that the composition $f\circ f$ has at least three fixed points (i.e., there are at least three distinct $x\in[a,b]$ with $f(f(x))=x$).
impo... | {
"name": "target",
"commit_hash": "56a005855ea17e0b0958f73ec801ae140b0a1679",
"repo_url": "https://github.com/leanprover-community/mathlib4.git",
"default_target": "Mathlib",
"read_only_path_patterns": [
"**/*"
],
"toolchain": "leanprover/lean4:v4.35.0"
} | medium | nvidia/Nemotron-Math-Proofs-v3-RL | 0038fcfc-14de-5989-bd2e-befab5715d65 | cc-by-4.0 | [
"nmp3_proof"
] | c3d4dc381108bba26b8ae824740ade88a83d711432b6a30f6e02e3f76b7af946 | tasks/nmp3_0038fcfc-14de-5989-bd2e-befab5715d65 | {
"split": "train",
"difficulty": "medium",
"source": "nvidia/Nemotron-Math-Proofs-v3-RL",
"source_id": "0038fcfc-14de-5989-bd2e-befab5715d65",
"source_license": "cc-by-4.0",
"source_dataset": "davinci-prover/agentic-prover-RL",
"source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"
} |
nmp3_00433297-225c-5a9a-9365-f121df4aee70 | lean_theorem_proving | -- Original natural-language problem:
-- Suppose $a,b,c$ are real numbers with $a+b+c=3$. Prove that
-- $$\frac{1}{5a^2-4a+11}+\frac{1}{5b^2-4b+11}+\frac{1}{5c^2-4c+11}\le\frac14.$$
import Mathlib
namespace Problem
/-- The quadratic denominator appearing in each summand of the problem. -/
def denominator (x : Real) ... | {
"name": "target",
"commit_hash": "56a005855ea17e0b0958f73ec801ae140b0a1679",
"repo_url": "https://github.com/leanprover-community/mathlib4.git",
"default_target": "Mathlib",
"read_only_path_patterns": [
"**/*"
],
"toolchain": "leanprover/lean4:v4.35.0"
} | medium | nvidia/Nemotron-Math-Proofs-v3-RL | 00433297-225c-5a9a-9365-f121df4aee70 | cc-by-4.0 | [
"nmp3_proof"
] | 74257e36b1b317e671cc6ee18c7bb1b6e043b3f66d60269e374835374bbc7d6c | tasks/nmp3_00433297-225c-5a9a-9365-f121df4aee70 | {
"split": "train",
"difficulty": "medium",
"source": "nvidia/Nemotron-Math-Proofs-v3-RL",
"source_id": "00433297-225c-5a9a-9365-f121df4aee70",
"source_license": "cc-by-4.0",
"source_dataset": "davinci-prover/agentic-prover-RL",
"source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"
} |
nmp3_005bdb6d-a4be-59c4-90a2-b42904244471 | lean_theorem_proving | -- Original natural-language problem:
-- The $2001$ towns in a country are connected by some roads, with at least one road incident to each town, and no town is connected by a road to every other town. A set $D$ of towns is called **dominant** if every town not in $D$ is adjacent to at least one town in $D$. Suppose ... | {
"name": "target",
"commit_hash": "56a005855ea17e0b0958f73ec801ae140b0a1679",
"repo_url": "https://github.com/leanprover-community/mathlib4.git",
"default_target": "Mathlib",
"read_only_path_patterns": [
"**/*"
],
"toolchain": "leanprover/lean4:v4.35.0"
} | medium | nvidia/Nemotron-Math-Proofs-v3-RL | 005bdb6d-a4be-59c4-90a2-b42904244471 | cc-by-4.0 | [
"nmp3_proof"
] | 5a55fd25545c3401debc3fdbc652be34c9bd25a7e4d544efad94b856eb21c692 | tasks/nmp3_005bdb6d-a4be-59c4-90a2-b42904244471 | {
"split": "train",
"difficulty": "medium",
"source": "nvidia/Nemotron-Math-Proofs-v3-RL",
"source_id": "005bdb6d-a4be-59c4-90a2-b42904244471",
"source_license": "cc-by-4.0",
"source_dataset": "davinci-prover/agentic-prover-RL",
"source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"
} |
nmp3_0060bc23-6a89-55a0-a2e2-51056a34aae9 | lean_theorem_proving | -- Original natural-language problem:
-- Let $a,b,c\ge 0$ satisfy $a^{2}b+b^{2}c+c^{2}a=1$. Prove that
-- \[
-- a^{3}+b^{3}+c^{3}+1\;\ge\;2\sqrt{\Bigl(a^{2}+b^{2}+c^{2}\Bigr)\Bigl(a^{3}b+b^{3}c+c^{3}a\Bigr)}.
-- \]
import Mathlib
namespace Problem
/-- The constraint `a^2 * b + b^2 * c + c^2 * a = 1`. -/
def Constra... | {
"name": "target",
"commit_hash": "56a005855ea17e0b0958f73ec801ae140b0a1679",
"repo_url": "https://github.com/leanprover-community/mathlib4.git",
"default_target": "Mathlib",
"read_only_path_patterns": [
"**/*"
],
"toolchain": "leanprover/lean4:v4.35.0"
} | hard | nvidia/Nemotron-Math-Proofs-v3-RL | 0060bc23-6a89-55a0-a2e2-51056a34aae9 | cc-by-4.0 | [
"nmp3_proof"
] | 819298faf1830be34b36be3e2d861ec9485281e9f4b204545dad909a1e13ac55 | tasks/nmp3_0060bc23-6a89-55a0-a2e2-51056a34aae9 | {
"split": "train",
"difficulty": "hard",
"source": "nvidia/Nemotron-Math-Proofs-v3-RL",
"source_id": "0060bc23-6a89-55a0-a2e2-51056a34aae9",
"source_license": "cc-by-4.0",
"source_dataset": "davinci-prover/agentic-prover-RL",
"source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"
} |
nmp3_006262ed-772c-5620-b3fe-20a443b17b3d | lean_theorem_proving | -- Original natural-language problem:
-- Every integer greater than 1000 is colored either red or blue. The coloring must satisfy the condition that the product of any two distinct red numbers is blue. Prove that it is impossible for such a coloring to have the property that no two blue numbers differ by 1 (i.e., there... | {
"name": "target",
"commit_hash": "56a005855ea17e0b0958f73ec801ae140b0a1679",
"repo_url": "https://github.com/leanprover-community/mathlib4.git",
"default_target": "Mathlib",
"read_only_path_patterns": [
"**/*"
],
"toolchain": "leanprover/lean4:v4.35.0"
} | medium | nvidia/Nemotron-Math-Proofs-v3-RL | 006262ed-772c-5620-b3fe-20a443b17b3d | cc-by-4.0 | [
"nmp3_proof"
] | f5902d752dec75f3237017ef240a12c175f290e2f205d7790de12711f7df25c0 | tasks/nmp3_006262ed-772c-5620-b3fe-20a443b17b3d | {
"split": "train",
"difficulty": "medium",
"source": "nvidia/Nemotron-Math-Proofs-v3-RL",
"source_id": "006262ed-772c-5620-b3fe-20a443b17b3d",
"source_license": "cc-by-4.0",
"source_dataset": "davinci-prover/agentic-prover-RL",
"source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"
} |
nmp3_00636aa7-4b2f-52ba-8da3-8973991f2ead | lean_theorem_proving | -- Original natural-language problem:
-- Let $a,b,c>0$ be real numbers such that $a^{2}+b^{2}+c^{2}=1$. Prove that
-- \[
-- \frac{a}{1+bc}+\frac{b}{1+ac}+\frac{c}{1+ab}\le \sqrt{2}\,.
-- \]
import Mathlib
/-!
# Formal statement of the problem
Let `a`, `b`, and `c` be positive real numbers satisfying
`a^2 + b^2 + c^2... | {
"name": "target",
"commit_hash": "56a005855ea17e0b0958f73ec801ae140b0a1679",
"repo_url": "https://github.com/leanprover-community/mathlib4.git",
"default_target": "Mathlib",
"read_only_path_patterns": [
"**/*"
],
"toolchain": "leanprover/lean4:v4.35.0"
} | medium | nvidia/Nemotron-Math-Proofs-v3-RL | 00636aa7-4b2f-52ba-8da3-8973991f2ead | cc-by-4.0 | [
"nmp3_proof"
] | ef1c60b685a2725602747ffbd497a8776df0ff84182b1081b9183b59cddc0e91 | tasks/nmp3_00636aa7-4b2f-52ba-8da3-8973991f2ead | {
"split": "train",
"difficulty": "medium",
"source": "nvidia/Nemotron-Math-Proofs-v3-RL",
"source_id": "00636aa7-4b2f-52ba-8da3-8973991f2ead",
"source_license": "cc-by-4.0",
"source_dataset": "davinci-prover/agentic-prover-RL",
"source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"
} |
nmp3_009daa63-9878-5893-b975-ac888618b565 | lean_theorem_proving | -- Original natural-language problem:
-- Let $a,b,c$ be positive real numbers such that $a+b+c=3$. Prove that
-- \[
-- \bigl(ab^3+bc^3+ca^3\bigr)\bigl(ab+bc+ca\bigr)\le 16.
-- \]
import Mathlib
/-!
# Formal statement for the inequality problem
The source problem asks to prove that for all positive real numbers `a`, ... | {
"name": "target",
"commit_hash": "56a005855ea17e0b0958f73ec801ae140b0a1679",
"repo_url": "https://github.com/leanprover-community/mathlib4.git",
"default_target": "Mathlib",
"read_only_path_patterns": [
"**/*"
],
"toolchain": "leanprover/lean4:v4.35.0"
} | hard | nvidia/Nemotron-Math-Proofs-v3-RL | 009daa63-9878-5893-b975-ac888618b565 | cc-by-4.0 | [
"nmp3_proof"
] | 4e81d996c2226f25a393cde50d5c8dc447a4dd99cb01d8462c403e6daf52ac10 | tasks/nmp3_009daa63-9878-5893-b975-ac888618b565 | {
"split": "train",
"difficulty": "hard",
"source": "nvidia/Nemotron-Math-Proofs-v3-RL",
"source_id": "009daa63-9878-5893-b975-ac888618b565",
"source_license": "cc-by-4.0",
"source_dataset": "davinci-prover/agentic-prover-RL",
"source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"
} |
nmp3_00ac1c64-6c7b-5f4a-a0d1-f61461ca525d | lean_theorem_proving | -- Original natural-language problem:
-- Let $n\ge 3$ be an integer. There are $n$ people and exactly $n$ meetings are held, one each day. Every meeting is attended by at least three of the people, and at a meeting each attendant shakes hands with every other attendant of that meeting. After the $n$‑th meeting, each un... | {
"name": "target",
"commit_hash": "56a005855ea17e0b0958f73ec801ae140b0a1679",
"repo_url": "https://github.com/leanprover-community/mathlib4.git",
"default_target": "Mathlib",
"read_only_path_patterns": [
"**/*"
],
"toolchain": "leanprover/lean4:v4.35.0"
} | medium | nvidia/Nemotron-Math-Proofs-v3-RL | 00ac1c64-6c7b-5f4a-a0d1-f61461ca525d | cc-by-4.0 | [
"nmp3_proof"
] | 554d29c29b726779fd86cb6e44cc497b6efba18d4f96ca3e79e4abe4c5dc5fbc | tasks/nmp3_00ac1c64-6c7b-5f4a-a0d1-f61461ca525d | {
"split": "train",
"difficulty": "medium",
"source": "nvidia/Nemotron-Math-Proofs-v3-RL",
"source_id": "00ac1c64-6c7b-5f4a-a0d1-f61461ca525d",
"source_license": "cc-by-4.0",
"source_dataset": "davinci-prover/agentic-prover-RL",
"source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"
} |
nmp3_00ac344b-9d0b-5051-87c0-b106c9048e51 | lean_theorem_proving | -- Original natural-language problem:
-- Let $a,b,n$ be integers with $a>b>1$, $b$ odd, and $n\ge1$. If $b^n\mid a^n-1$, prove that
-- $$a^b>\frac{3^n}{n}\,. $$
import Mathlib
/-!
# Formalization of the divisibility and inequality problem
The original problem asks us to prove, for integers `a`, `b`, and `n` with
`a ... | {
"name": "target",
"commit_hash": "56a005855ea17e0b0958f73ec801ae140b0a1679",
"repo_url": "https://github.com/leanprover-community/mathlib4.git",
"default_target": "Mathlib",
"read_only_path_patterns": [
"**/*"
],
"toolchain": "leanprover/lean4:v4.35.0"
} | medium | nvidia/Nemotron-Math-Proofs-v3-RL | 00ac344b-9d0b-5051-87c0-b106c9048e51 | cc-by-4.0 | [
"nmp3_proof"
] | 443891494d4f0a14ecf32c61f740ea4b658eadeb65d567d76f0100fdcfc887a3 | tasks/nmp3_00ac344b-9d0b-5051-87c0-b106c9048e51 | {
"split": "train",
"difficulty": "medium",
"source": "nvidia/Nemotron-Math-Proofs-v3-RL",
"source_id": "00ac344b-9d0b-5051-87c0-b106c9048e51",
"source_license": "cc-by-4.0",
"source_dataset": "davinci-prover/agentic-prover-RL",
"source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"
} |
nmp3_00bb5767-64ce-5a68-bc5d-cded70380691 | lean_theorem_proving | -- Original natural-language problem:
-- Let $x,y,z$ be positive real numbers such that $\sqrt{x}+\sqrt{y}+\sqrt{z}=1$. Prove that
-- \[
-- \frac{x^{2}+yz}{\sqrt{2x^{2}(y+z)}}+\frac{y^{2}+zx}{\sqrt{2y^{2}(z+x)}}+\frac{z^{2}+xy}{\sqrt{2z^{2}(x+y)}}\ge 1.
-- \]
import Mathlib
/-!
# Formal statement of the square-root-... | {
"name": "target",
"commit_hash": "56a005855ea17e0b0958f73ec801ae140b0a1679",
"repo_url": "https://github.com/leanprover-community/mathlib4.git",
"default_target": "Mathlib",
"read_only_path_patterns": [
"**/*"
],
"toolchain": "leanprover/lean4:v4.35.0"
} | medium | nvidia/Nemotron-Math-Proofs-v3-RL | 00bb5767-64ce-5a68-bc5d-cded70380691 | cc-by-4.0 | [
"nmp3_proof"
] | fe619ae6f737de24279ab89905d2763805e5b0be549f20d4b52884a2b7317386 | tasks/nmp3_00bb5767-64ce-5a68-bc5d-cded70380691 | {
"split": "train",
"difficulty": "medium",
"source": "nvidia/Nemotron-Math-Proofs-v3-RL",
"source_id": "00bb5767-64ce-5a68-bc5d-cded70380691",
"source_license": "cc-by-4.0",
"source_dataset": "davinci-prover/agentic-prover-RL",
"source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"
} |
nmp3_00ce5740-0a39-5f85-8513-cdd2b3974366 | lean_theorem_proving | -- Original natural-language problem:
-- Show that there is no integer $n\neq0$ such that the three numbers $2n^{2}+1$, $3n^{2}+1$, and $6n^{2}+1$ are all perfect squares.
import Mathlib
/-!
# Formalization of the integer perfect-square problem
The original problem asks to show that no nonzero integer `n` makes all t... | {
"name": "target",
"commit_hash": "56a005855ea17e0b0958f73ec801ae140b0a1679",
"repo_url": "https://github.com/leanprover-community/mathlib4.git",
"default_target": "Mathlib",
"read_only_path_patterns": [
"**/*"
],
"toolchain": "leanprover/lean4:v4.35.0"
} | medium | nvidia/Nemotron-Math-Proofs-v3-RL | 00ce5740-0a39-5f85-8513-cdd2b3974366 | cc-by-4.0 | [
"nmp3_proof"
] | b2097dffaef2fdf70832e6a1fbb59fac09a0fc935212ed0004dfaff2451cac0c | tasks/nmp3_00ce5740-0a39-5f85-8513-cdd2b3974366 | {
"split": "train",
"difficulty": "medium",
"source": "nvidia/Nemotron-Math-Proofs-v3-RL",
"source_id": "00ce5740-0a39-5f85-8513-cdd2b3974366",
"source_license": "cc-by-4.0",
"source_dataset": "davinci-prover/agentic-prover-RL",
"source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"
} |
nmp3_00df6b1c-a479-5af6-b1bf-25af692e0e1d | lean_theorem_proving | -- Original natural-language problem:
-- Given any $n$ points on a unit circle, prove that the number of segments (chords) joining two of the points whose length is greater than $\sqrt{2}$ is at most $\displaystyle\frac{n^{2}}{3}\,. $
import Mathlib
/-!
# Formal statement: long chords among points on the unit circle
... | {
"name": "target",
"commit_hash": "56a005855ea17e0b0958f73ec801ae140b0a1679",
"repo_url": "https://github.com/leanprover-community/mathlib4.git",
"default_target": "Mathlib",
"read_only_path_patterns": [
"**/*"
],
"toolchain": "leanprover/lean4:v4.35.0"
} | hard | nvidia/Nemotron-Math-Proofs-v3-RL | 00df6b1c-a479-5af6-b1bf-25af692e0e1d | cc-by-4.0 | [
"nmp3_proof"
] | 26b31030282d2aeaf5d56b706f81a2f88deec4c2e232172c33f3ac4ba81e4a51 | tasks/nmp3_00df6b1c-a479-5af6-b1bf-25af692e0e1d | {
"split": "train",
"difficulty": "hard",
"source": "nvidia/Nemotron-Math-Proofs-v3-RL",
"source_id": "00df6b1c-a479-5af6-b1bf-25af692e0e1d",
"source_license": "cc-by-4.0",
"source_dataset": "davinci-prover/agentic-prover-RL",
"source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"
} |
nmp3_00f0830e-fd86-511c-9b0d-1c0b06f8e0ad | lean_theorem_proving | -- Original natural-language problem:
-- Let $x,y,z>0$ be real numbers such that $x+y+z=3$. Prove that
-- \[
-- \frac{x^{3}}{y^{3}+8}+\frac{y^{3}}{z^{3}+8}+\frac{z^{3}}{x^{3}+8}\ge \frac19+\frac{2}{27}\,(xy+xz+yz)\,.
-- \]
import Mathlib
/-!
# Formal statement
Problem: for positive real numbers `x`, `y`, `z` with `... | {
"name": "target",
"commit_hash": "56a005855ea17e0b0958f73ec801ae140b0a1679",
"repo_url": "https://github.com/leanprover-community/mathlib4.git",
"default_target": "Mathlib",
"read_only_path_patterns": [
"**/*"
],
"toolchain": "leanprover/lean4:v4.35.0"
} | medium | nvidia/Nemotron-Math-Proofs-v3-RL | 00f0830e-fd86-511c-9b0d-1c0b06f8e0ad | cc-by-4.0 | [
"nmp3_proof"
] | ea45bc85445cdfc4ca2e470ff570ee2fe94ef57b62a96f473f4a145de5f606a5 | tasks/nmp3_00f0830e-fd86-511c-9b0d-1c0b06f8e0ad | {
"split": "train",
"difficulty": "medium",
"source": "nvidia/Nemotron-Math-Proofs-v3-RL",
"source_id": "00f0830e-fd86-511c-9b0d-1c0b06f8e0ad",
"source_license": "cc-by-4.0",
"source_dataset": "davinci-prover/agentic-prover-RL",
"source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"
} |
nmp3_00f88d1a-eb0c-594c-b460-b5213b23f69c | lean_theorem_proving | -- Original natural-language problem:
-- For $a,b,c\ge 0$, prove that
-- $$a^2+b^2+c^2+2abc+1\ge 2(ab+bc+ca).$$
import Mathlib
/-!
# Formal statement: nonnegative real three-variable inequality
The original problem asks, for nonnegative `a`, `b`, and `c`, to prove
`a^2 + b^2 + c^2 + 2abc + 1 ≥ 2(ab + bc + ca)`.
Th... | {
"name": "target",
"commit_hash": "56a005855ea17e0b0958f73ec801ae140b0a1679",
"repo_url": "https://github.com/leanprover-community/mathlib4.git",
"default_target": "Mathlib",
"read_only_path_patterns": [
"**/*"
],
"toolchain": "leanprover/lean4:v4.35.0"
} | easy | nvidia/Nemotron-Math-Proofs-v3-RL | 00f88d1a-eb0c-594c-b460-b5213b23f69c | cc-by-4.0 | [
"nmp3_proof"
] | 58054e5c2c7b1c0a68b41148207a6c2e440fc0eb932edb3dfa9b67b8f55cdf5b | tasks/nmp3_00f88d1a-eb0c-594c-b460-b5213b23f69c | {
"split": "train",
"difficulty": "easy",
"source": "nvidia/Nemotron-Math-Proofs-v3-RL",
"source_id": "00f88d1a-eb0c-594c-b460-b5213b23f69c",
"source_license": "cc-by-4.0",
"source_dataset": "davinci-prover/agentic-prover-RL",
"source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"
} |
nmp3_0102dc7c-9292-549e-b15b-27d4fe8d5119 | lean_theorem_proving | -- Original natural-language problem:
-- Prove that for all positive real numbers \(a,b,c\),
-- \[
-- 2a+3b+5c-\frac{8}{3}\bigl(\sqrt{ab}+\sqrt{bc}+\sqrt{ca}\bigr)\;\le\;\frac13\left(\frac{a^{2}}{b}+\frac{b^{2}}{c}+\frac{4c^{2}}{a}\right).
-- \]
import Mathlib
/-!
# Formal statement of the target inequality
This file... | {
"name": "target",
"commit_hash": "56a005855ea17e0b0958f73ec801ae140b0a1679",
"repo_url": "https://github.com/leanprover-community/mathlib4.git",
"default_target": "Mathlib",
"read_only_path_patterns": [
"**/*"
],
"toolchain": "leanprover/lean4:v4.35.0"
} | hard | nvidia/Nemotron-Math-Proofs-v3-RL | 0102dc7c-9292-549e-b15b-27d4fe8d5119 | cc-by-4.0 | [
"nmp3_proof"
] | a97e451994adb29b03f634d4c7001bba6992de9543f9c7b96cb243eadca06a66 | tasks/nmp3_0102dc7c-9292-549e-b15b-27d4fe8d5119 | {
"split": "train",
"difficulty": "hard",
"source": "nvidia/Nemotron-Math-Proofs-v3-RL",
"source_id": "0102dc7c-9292-549e-b15b-27d4fe8d5119",
"source_license": "cc-by-4.0",
"source_dataset": "davinci-prover/agentic-prover-RL",
"source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"
} |
nmp3_0109d911-5554-581f-8c4b-5bd93de39338 | lean_theorem_proving | -- Original natural-language problem:
-- Let $k$ be a nonzero natural number and $m$ an odd natural number. Prove that there exists a natural number $n$ such that the number $m^n+n^m$ has at least $k$ distinct prime factors.
import Mathlib.Data.Nat.PrimeFin
import Mathlib.Algebra.Ring.Parity
/-!
# Formalization of the... | {
"name": "target",
"commit_hash": "56a005855ea17e0b0958f73ec801ae140b0a1679",
"repo_url": "https://github.com/leanprover-community/mathlib4.git",
"default_target": "Mathlib",
"read_only_path_patterns": [
"**/*"
],
"toolchain": "leanprover/lean4:v4.35.0"
} | medium | nvidia/Nemotron-Math-Proofs-v3-RL | 0109d911-5554-581f-8c4b-5bd93de39338 | cc-by-4.0 | [
"nmp3_proof"
] | d291e8d34c9d999497c677a4c523962cccaa5a19240891564ebe81b44ea03849 | tasks/nmp3_0109d911-5554-581f-8c4b-5bd93de39338 | {
"split": "train",
"difficulty": "medium",
"source": "nvidia/Nemotron-Math-Proofs-v3-RL",
"source_id": "0109d911-5554-581f-8c4b-5bd93de39338",
"source_license": "cc-by-4.0",
"source_dataset": "davinci-prover/agentic-prover-RL",
"source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"
} |
nmp3_01148b2c-6ad6-53bd-9cb8-ff57109ee9cc | lean_theorem_proving | -- Original natural-language problem:
-- Fifty teams take part in a round‑robin tournament that lasts 50 days. On each day a non‑empty subset of the teams (at least two teams) shows up, and any two teams that are present on the same day play each other that day (i.e., the set of teams present on a day forms a complete ... | {
"name": "target",
"commit_hash": "56a005855ea17e0b0958f73ec801ae140b0a1679",
"repo_url": "https://github.com/leanprover-community/mathlib4.git",
"default_target": "Mathlib",
"read_only_path_patterns": [
"**/*"
],
"toolchain": "leanprover/lean4:v4.35.0"
} | medium | nvidia/Nemotron-Math-Proofs-v3-RL | 01148b2c-6ad6-53bd-9cb8-ff57109ee9cc | cc-by-4.0 | [
"nmp3_proof"
] | 43f7771bff92b85fbc9932a7c92304604a4167c4592de1fb3fb6903df4f1306f | tasks/nmp3_01148b2c-6ad6-53bd-9cb8-ff57109ee9cc | {
"split": "train",
"difficulty": "medium",
"source": "nvidia/Nemotron-Math-Proofs-v3-RL",
"source_id": "01148b2c-6ad6-53bd-9cb8-ff57109ee9cc",
"source_license": "cc-by-4.0",
"source_dataset": "davinci-prover/agentic-prover-RL",
"source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"
} |
nmp3_012ad00c-45e5-52e9-b03e-cf1e9272a28d | lean_theorem_proving | -- Original natural-language problem:
-- There are 64 towns in a country. Between some unordered pairs of towns there may be a road, but we do not know which pairs are connected. We are allowed to query any unordered pair of towns and receive a “yes’’ if a road exists between them and a “no’’ otherwise. Prove that any ... | {
"name": "target",
"commit_hash": "56a005855ea17e0b0958f73ec801ae140b0a1679",
"repo_url": "https://github.com/leanprover-community/mathlib4.git",
"default_target": "Mathlib",
"read_only_path_patterns": [
"**/*"
],
"toolchain": "leanprover/lean4:v4.35.0"
} | hard | nvidia/Nemotron-Math-Proofs-v3-RL | 012ad00c-45e5-52e9-b03e-cf1e9272a28d | cc-by-4.0 | [
"nmp3_proof"
] | 4ce8f24a1a190e92e7919dc27dba2ded71c33b50fcda0e879d396bc2a5ac28f9 | tasks/nmp3_012ad00c-45e5-52e9-b03e-cf1e9272a28d | {
"split": "train",
"difficulty": "hard",
"source": "nvidia/Nemotron-Math-Proofs-v3-RL",
"source_id": "012ad00c-45e5-52e9-b03e-cf1e9272a28d",
"source_license": "cc-by-4.0",
"source_dataset": "davinci-prover/agentic-prover-RL",
"source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"
} |
nmp3_012d67cc-72b6-5f2f-9702-898a85c25dc1 | lean_theorem_proving | -- Original natural-language problem:
-- Let $a,b,c>0$ be the side lengths of a triangle (so $a+b>c$, $b+c>a$, $c+a>b$) and suppose $a^{2}+b^{2}+c^{2}=3$. Prove that
--
-- \[
-- \frac{a+b}{\sqrt{a+b-c}}+\frac{b+c}{\sqrt{b+c-a}}+\frac{c+a}{\sqrt{c+a-b}}\ge 6.
-- \]
import Mathlib.Analysis.Real.Sqrt
/-!
# Formal stat... | {
"name": "target",
"commit_hash": "56a005855ea17e0b0958f73ec801ae140b0a1679",
"repo_url": "https://github.com/leanprover-community/mathlib4.git",
"default_target": "Mathlib",
"read_only_path_patterns": [
"**/*"
],
"toolchain": "leanprover/lean4:v4.35.0"
} | medium | nvidia/Nemotron-Math-Proofs-v3-RL | 012d67cc-72b6-5f2f-9702-898a85c25dc1 | cc-by-4.0 | [
"nmp3_proof"
] | 787d5a551d8531b35933f3b03184aaefab14f962597358bc26a7f1f401bfbb10 | tasks/nmp3_012d67cc-72b6-5f2f-9702-898a85c25dc1 | {
"split": "train",
"difficulty": "medium",
"source": "nvidia/Nemotron-Math-Proofs-v3-RL",
"source_id": "012d67cc-72b6-5f2f-9702-898a85c25dc1",
"source_license": "cc-by-4.0",
"source_dataset": "davinci-prover/agentic-prover-RL",
"source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"
} |
nmp3_014b7c63-da53-59ca-bf80-812e5fd6a70e | lean_theorem_proving | -- Original natural-language problem:
-- Let $n$ be a positive integer and let $a_1,\dots,a_n$ be complex numbers. Assume that for every non‑empty subset $I\subseteq\{1,2,\dots,n\}$ one has
-- \[
-- \Bigl|\, -1+\prod_{j\in I}(1+a_j)\Bigr|\le\frac12.
-- \]
-- Prove that
-- \[
-- \sum_{j=1}^{n}|a_j|\le 3.
-- \]
imp... | {
"name": "target",
"commit_hash": "56a005855ea17e0b0958f73ec801ae140b0a1679",
"repo_url": "https://github.com/leanprover-community/mathlib4.git",
"default_target": "Mathlib",
"read_only_path_patterns": [
"**/*"
],
"toolchain": "leanprover/lean4:v4.35.0"
} | hard | nvidia/Nemotron-Math-Proofs-v3-RL | 014b7c63-da53-59ca-bf80-812e5fd6a70e | cc-by-4.0 | [
"nmp3_proof"
] | ae0ead6f4cf293ac41f1e677f9de9a7d554d6647e591311959a777a7c6991a14 | tasks/nmp3_014b7c63-da53-59ca-bf80-812e5fd6a70e | {
"split": "train",
"difficulty": "hard",
"source": "nvidia/Nemotron-Math-Proofs-v3-RL",
"source_id": "014b7c63-da53-59ca-bf80-812e5fd6a70e",
"source_license": "cc-by-4.0",
"source_dataset": "davinci-prover/agentic-prover-RL",
"source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"
} |
nmp3_015b38ab-676d-50d5-8783-ed229d4f1093 | lean_theorem_proving | -- Original natural-language problem:
-- Let $a,b,c>0$. Prove that
-- \[
-- \frac{ab}{c(c+a)}+\frac{bc}{a(a+b)}+\frac{ca}{b(b+c)}\ge \frac{a}{c+a}+\frac{b}{a+b}+\frac{c}{b+c}\,.
-- \]
import Mathlib.Basic.Real.Basic
/-!
# Formal statement for the positive-real inequality problem
The source asks, for positive real n... | {
"name": "target",
"commit_hash": "56a005855ea17e0b0958f73ec801ae140b0a1679",
"repo_url": "https://github.com/leanprover-community/mathlib4.git",
"default_target": "Mathlib",
"read_only_path_patterns": [
"**/*"
],
"toolchain": "leanprover/lean4:v4.35.0"
} | medium | nvidia/Nemotron-Math-Proofs-v3-RL | 015b38ab-676d-50d5-8783-ed229d4f1093 | cc-by-4.0 | [
"nmp3_proof"
] | f12d869951e8b727d09928384c8eec5b0982221c8c81553949fe707ef4bfb35b | tasks/nmp3_015b38ab-676d-50d5-8783-ed229d4f1093 | {
"split": "train",
"difficulty": "medium",
"source": "nvidia/Nemotron-Math-Proofs-v3-RL",
"source_id": "015b38ab-676d-50d5-8783-ed229d4f1093",
"source_license": "cc-by-4.0",
"source_dataset": "davinci-prover/agentic-prover-RL",
"source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"
} |
nmp3_015ccf91-a35d-5ad9-a703-d3a64c6bca82 | lean_theorem_proving | -- Original natural-language problem:
-- Let $a,b,c>0$. Prove that
-- \[
-- \sqrt{a^{2}+bc}+\sqrt{b^{2}+ca}+\sqrt{c^{2}+ab}\le\frac32\,(a+b+c).
-- \]
import Mathlib
/-!
# Formal statement for the three-variable radical inequality
The source problem asks, for positive real numbers `a`, `b`, and `c`, to prove
`sqrt (a... | {
"name": "target",
"commit_hash": "56a005855ea17e0b0958f73ec801ae140b0a1679",
"repo_url": "https://github.com/leanprover-community/mathlib4.git",
"default_target": "Mathlib",
"read_only_path_patterns": [
"**/*"
],
"toolchain": "leanprover/lean4:v4.35.0"
} | medium | nvidia/Nemotron-Math-Proofs-v3-RL | 015ccf91-a35d-5ad9-a703-d3a64c6bca82 | cc-by-4.0 | [
"nmp3_proof"
] | 46c95779d4978ed7a547d7f2f59b0bd351ca51c2299a56c24379a24acfb1073f | tasks/nmp3_015ccf91-a35d-5ad9-a703-d3a64c6bca82 | {
"split": "train",
"difficulty": "medium",
"source": "nvidia/Nemotron-Math-Proofs-v3-RL",
"source_id": "015ccf91-a35d-5ad9-a703-d3a64c6bca82",
"source_license": "cc-by-4.0",
"source_dataset": "davinci-prover/agentic-prover-RL",
"source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"
} |
nmp3_019fe152-b07d-5333-ad03-4bc0a34c3e00 | lean_theorem_proving | -- Original natural-language problem:
-- Let $\mathbb N$ denote the set of non‑negative integers and let $f:\mathbb N\to\mathbb N$ satisfy
-- \[
-- f\big(f\big(f(n)\big)\big)<f(n+1)\qquad\text{for all }n\in\mathbb N .
-- \]
-- Prove that $f(n)=n$ for every $n\in\mathbb N$.
import Mathlib.Data.Nat.Basic
/-!
# Forma... | {
"name": "target",
"commit_hash": "56a005855ea17e0b0958f73ec801ae140b0a1679",
"repo_url": "https://github.com/leanprover-community/mathlib4.git",
"default_target": "Mathlib",
"read_only_path_patterns": [
"**/*"
],
"toolchain": "leanprover/lean4:v4.35.0"
} | medium | nvidia/Nemotron-Math-Proofs-v3-RL | 019fe152-b07d-5333-ad03-4bc0a34c3e00 | cc-by-4.0 | [
"nmp3_proof"
] | d3b46937acd17a493cde1e13a8e79b964af73f83c1577836fce650b250ecb4ff | tasks/nmp3_019fe152-b07d-5333-ad03-4bc0a34c3e00 | {
"split": "train",
"difficulty": "medium",
"source": "nvidia/Nemotron-Math-Proofs-v3-RL",
"source_id": "019fe152-b07d-5333-ad03-4bc0a34c3e00",
"source_license": "cc-by-4.0",
"source_dataset": "davinci-prover/agentic-prover-RL",
"source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"
} |
nmp3_01a8f6df-ed6d-5ebf-ad3d-05faa93c3a61 | lean_theorem_proving | -- Original natural-language problem:
-- Let $A,B,C$ be the interior angles of a triangle (so $A,B,C>0$ and $A+B+C=\pi$). Prove that
-- \[
-- \cos A\cos\Bigl(\frac{B-C}{2}\Bigr)+\cos B\cos\Bigl(\frac{C-A}{2}\Bigr)+\cos C\cos\Bigl(\frac{A-B}{2}\Bigr)\le\frac32\,.
-- \]
import Mathlib
/-!
# Triangle-angle cosine inequ... | {
"name": "target",
"commit_hash": "56a005855ea17e0b0958f73ec801ae140b0a1679",
"repo_url": "https://github.com/leanprover-community/mathlib4.git",
"default_target": "Mathlib",
"read_only_path_patterns": [
"**/*"
],
"toolchain": "leanprover/lean4:v4.35.0"
} | medium | nvidia/Nemotron-Math-Proofs-v3-RL | 01a8f6df-ed6d-5ebf-ad3d-05faa93c3a61 | cc-by-4.0 | [
"nmp3_proof"
] | 74091bf1101a35b5971242afd4e4a34618b0adfbedaa1369f63e9fb25565baf9 | tasks/nmp3_01a8f6df-ed6d-5ebf-ad3d-05faa93c3a61 | {
"split": "train",
"difficulty": "medium",
"source": "nvidia/Nemotron-Math-Proofs-v3-RL",
"source_id": "01a8f6df-ed6d-5ebf-ad3d-05faa93c3a61",
"source_license": "cc-by-4.0",
"source_dataset": "davinci-prover/agentic-prover-RL",
"source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"
} |
nmp3_01b614de-cbf9-5830-865f-65e17dd783e0 | lean_theorem_proving | -- Original natural-language problem:
-- Let $(a_i)_{i=1}^\infty$ be an infinite sequence of real numbers for which there exists a real constant $c$ satisfying $0\le a_i\le c$ for all $i$, and such that
-- \[
-- |a_i-a_j|\ge\frac1{i+j}\qquad\text{for all }i\neq j.
-- \]
-- Prove that $c\ge 1\,.
import Mathlib
/-!
# ... | {
"name": "target",
"commit_hash": "56a005855ea17e0b0958f73ec801ae140b0a1679",
"repo_url": "https://github.com/leanprover-community/mathlib4.git",
"default_target": "Mathlib",
"read_only_path_patterns": [
"**/*"
],
"toolchain": "leanprover/lean4:v4.35.0"
} | hard | nvidia/Nemotron-Math-Proofs-v3-RL | 01b614de-cbf9-5830-865f-65e17dd783e0 | cc-by-4.0 | [
"nmp3_proof"
] | f2c074280c4bffe9e2501e54c3fcb239ae27ee8a813a9b64b93fae14a050f537 | tasks/nmp3_01b614de-cbf9-5830-865f-65e17dd783e0 | {
"split": "train",
"difficulty": "hard",
"source": "nvidia/Nemotron-Math-Proofs-v3-RL",
"source_id": "01b614de-cbf9-5830-865f-65e17dd783e0",
"source_license": "cc-by-4.0",
"source_dataset": "davinci-prover/agentic-prover-RL",
"source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"
} |
nmp3_021e0854-40f1-5b92-a02c-cb1adfe36448 | lean_theorem_proving | -- Original natural-language problem:
-- Let $a,b,c$ be the side lengths of a triangle (so $a,b,c>0$ and $a+b>c,\;b+c>a,\;c+a>b$) satisfying
-- \[
-- \frac{a^{2}b+b^{2}c+c^{2}a}{ab^{2}+bc^{2}+ca^{2}}=\frac{7}{9}.
-- \]
-- Prove that
-- \[
-- 3(a^{3}+b^{3}+c^{3})+4(ab+bc+ca)+a+b+c\;\ge\;6\bigl(a^{2}+b^{2}+c^{2}+2a... | {
"name": "target",
"commit_hash": "56a005855ea17e0b0958f73ec801ae140b0a1679",
"repo_url": "https://github.com/leanprover-community/mathlib4.git",
"default_target": "Mathlib",
"read_only_path_patterns": [
"**/*"
],
"toolchain": "leanprover/lean4:v4.35.0"
} | medium | nvidia/Nemotron-Math-Proofs-v3-RL | 021e0854-40f1-5b92-a02c-cb1adfe36448 | cc-by-4.0 | [
"nmp3_proof"
] | 49fe9033e157daf8f4ed6d3f939e89eea5bbc2d53d1014fce92867b44f830af2 | tasks/nmp3_021e0854-40f1-5b92-a02c-cb1adfe36448 | {
"split": "train",
"difficulty": "medium",
"source": "nvidia/Nemotron-Math-Proofs-v3-RL",
"source_id": "021e0854-40f1-5b92-a02c-cb1adfe36448",
"source_license": "cc-by-4.0",
"source_dataset": "davinci-prover/agentic-prover-RL",
"source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"
} |
nmp3_02238f43-7f2d-5df3-b7b4-adb506e098e8 | lean_theorem_proving | -- Original natural-language problem:
-- Let $x,y,z$ be positive real numbers such that $xyz\ge 1$. Prove that
-- \[
-- \frac{x^5-x^2}{\,x^5+y^2+z^2\,}+\frac{y^5-y^2}{\,x^2+y^5+z^2\,}+\frac{z^5-z^2}{\,x^2+y^2+z^5\,}\ge 0.
-- \]
import Mathlib
namespace Problem
/-- The hypothesis that `x`, `y`, and `z` are positive ... | {
"name": "target",
"commit_hash": "56a005855ea17e0b0958f73ec801ae140b0a1679",
"repo_url": "https://github.com/leanprover-community/mathlib4.git",
"default_target": "Mathlib",
"read_only_path_patterns": [
"**/*"
],
"toolchain": "leanprover/lean4:v4.35.0"
} | hard | nvidia/Nemotron-Math-Proofs-v3-RL | 02238f43-7f2d-5df3-b7b4-adb506e098e8 | cc-by-4.0 | [
"nmp3_proof"
] | 52ae1062408236a268fbfc3742913df481220c8ca1204ec9b7acc797bd263ff3 | tasks/nmp3_02238f43-7f2d-5df3-b7b4-adb506e098e8 | {
"split": "train",
"difficulty": "hard",
"source": "nvidia/Nemotron-Math-Proofs-v3-RL",
"source_id": "02238f43-7f2d-5df3-b7b4-adb506e098e8",
"source_license": "cc-by-4.0",
"source_dataset": "davinci-prover/agentic-prover-RL",
"source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"
} |
nmp3_022a8bd3-1846-58e5-942c-bf545cedbf49 | lean_theorem_proving | -- Original natural-language problem:
-- Let \(a,b,c>0\). Prove that
-- \[
-- \frac{a+b}{a^{2}+b^{2}}+\frac{b+c}{b^{2}+c^{2}}+\frac{c+a}{c^{2}+a^{2}}
-- \;\ge\;
-- \frac{3\,(a^{3}+b^{3}+c^{3})}{a^{4}+b^{4}+c^{4}}\,.
-- \]
import Mathlib.Basic.Real.Basic
/-!
# Formal statement: cyclic rational inequality
The source ... | {
"name": "target",
"commit_hash": "56a005855ea17e0b0958f73ec801ae140b0a1679",
"repo_url": "https://github.com/leanprover-community/mathlib4.git",
"default_target": "Mathlib",
"read_only_path_patterns": [
"**/*"
],
"toolchain": "leanprover/lean4:v4.35.0"
} | medium | nvidia/Nemotron-Math-Proofs-v3-RL | 022a8bd3-1846-58e5-942c-bf545cedbf49 | cc-by-4.0 | [
"nmp3_proof"
] | 34e472ec253619aea43fbac503a54a9156aa77473614ea8d08d734e9d4d5d98f | tasks/nmp3_022a8bd3-1846-58e5-942c-bf545cedbf49 | {
"split": "train",
"difficulty": "medium",
"source": "nvidia/Nemotron-Math-Proofs-v3-RL",
"source_id": "022a8bd3-1846-58e5-942c-bf545cedbf49",
"source_license": "cc-by-4.0",
"source_dataset": "davinci-prover/agentic-prover-RL",
"source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"
} |
nmp3_0267c852-08a2-5017-b249-a7b6673d8932 | lean_theorem_proving | -- Original natural-language problem:
-- A rational number $x$ is given. Prove that there exists a sequence of rational numbers $x_0,x_1,x_2,\dots$ such that
--
-- (a) $x_0=x$;
--
-- (b) for every $n\ge 1$, either $x_n=2x_{\,n-1}$ or $x_n=2x_{\,n-1}+\frac1n$;
--
-- (c) $x_n$ is an integer for some $n$.
import ... | {
"name": "target",
"commit_hash": "56a005855ea17e0b0958f73ec801ae140b0a1679",
"repo_url": "https://github.com/leanprover-community/mathlib4.git",
"default_target": "Mathlib",
"read_only_path_patterns": [
"**/*"
],
"toolchain": "leanprover/lean4:v4.35.0"
} | hard | nvidia/Nemotron-Math-Proofs-v3-RL | 0267c852-08a2-5017-b249-a7b6673d8932 | cc-by-4.0 | [
"nmp3_proof"
] | 62f133837aa95cef8b2fd767ae117487df8aac49795279d07998aee093957993 | tasks/nmp3_0267c852-08a2-5017-b249-a7b6673d8932 | {
"split": "train",
"difficulty": "hard",
"source": "nvidia/Nemotron-Math-Proofs-v3-RL",
"source_id": "0267c852-08a2-5017-b249-a7b6673d8932",
"source_license": "cc-by-4.0",
"source_dataset": "davinci-prover/agentic-prover-RL",
"source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"
} |
nmp3_0278239b-800e-5aea-82c9-11a2d68dcf8c | lean_theorem_proving | -- Original natural-language problem:
-- Let $a$, $b$, $c$ be positive real numbers. Prove that
-- \[
-- \frac{a}{b+c}+\frac{b}{c+a}+\frac{c}{a+b}\ge \frac32+\frac{2\bigl(a^3+b^3+c^3-3abc\bigr)}{(a+b+c)^3}.
-- \]
import Mathlib
/-!
# Formal statement for a three-variable real inequality
The source problem asks to pro... | {
"name": "target",
"commit_hash": "56a005855ea17e0b0958f73ec801ae140b0a1679",
"repo_url": "https://github.com/leanprover-community/mathlib4.git",
"default_target": "Mathlib",
"read_only_path_patterns": [
"**/*"
],
"toolchain": "leanprover/lean4:v4.35.0"
} | medium | nvidia/Nemotron-Math-Proofs-v3-RL | 0278239b-800e-5aea-82c9-11a2d68dcf8c | cc-by-4.0 | [
"nmp3_proof"
] | 64fb31569330e09dabdde718f867711dec4572b6981f6a585742a0de1b759002 | tasks/nmp3_0278239b-800e-5aea-82c9-11a2d68dcf8c | {
"split": "train",
"difficulty": "medium",
"source": "nvidia/Nemotron-Math-Proofs-v3-RL",
"source_id": "0278239b-800e-5aea-82c9-11a2d68dcf8c",
"source_license": "cc-by-4.0",
"source_dataset": "davinci-prover/agentic-prover-RL",
"source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"
} |
nmp3_029bf7ff-39bf-585e-b5b2-52d06b233a45 | lean_theorem_proving | -- Original natural-language problem:
-- Let $a,b,c>0$. Prove that
-- \[
-- \frac{(a+b)(b+c)}{c^3+a^3}+\frac{(b+c)(c+a)}{a^3+b^3}+\frac{(c+a)(a+b)}{b^3+c^3}\ge\frac{2\,(a+b+c)^3}{\bigl(a^2+b^2+c^2\bigr)^2}\,.
-- \]
import Mathlib
/-!
# Formal statement for the cyclic cubic inequality
The original problem asks, for ... | {
"name": "target",
"commit_hash": "56a005855ea17e0b0958f73ec801ae140b0a1679",
"repo_url": "https://github.com/leanprover-community/mathlib4.git",
"default_target": "Mathlib",
"read_only_path_patterns": [
"**/*"
],
"toolchain": "leanprover/lean4:v4.35.0"
} | medium | nvidia/Nemotron-Math-Proofs-v3-RL | 029bf7ff-39bf-585e-b5b2-52d06b233a45 | cc-by-4.0 | [
"nmp3_proof"
] | ad9a6f842a617ae65dc074c4fc505952ea6806c138b9612c2cd28405ba0a8370 | tasks/nmp3_029bf7ff-39bf-585e-b5b2-52d06b233a45 | {
"split": "train",
"difficulty": "medium",
"source": "nvidia/Nemotron-Math-Proofs-v3-RL",
"source_id": "029bf7ff-39bf-585e-b5b2-52d06b233a45",
"source_license": "cc-by-4.0",
"source_dataset": "davinci-prover/agentic-prover-RL",
"source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"
} |
nmp3_02ccf615-e889-5fdf-950e-6132d227fc43 | lean_theorem_proving | -- Original natural-language problem:
-- Let $x,\;y,\;z>0$ be real numbers. Prove that
-- \[
-- x^4+y^4+z^4+1+2xyz\;\ge\;x^2+y^2+z^2+x^2y^2+y^2z^2+z^2x^2.
-- \]
import Mathlib
/-!
# Formal statement: a three-variable real polynomial inequality
The source problem asks to prove, for positive reals `x`, `y`, and `z`, th... | {
"name": "target",
"commit_hash": "56a005855ea17e0b0958f73ec801ae140b0a1679",
"repo_url": "https://github.com/leanprover-community/mathlib4.git",
"default_target": "Mathlib",
"read_only_path_patterns": [
"**/*"
],
"toolchain": "leanprover/lean4:v4.35.0"
} | medium | nvidia/Nemotron-Math-Proofs-v3-RL | 02ccf615-e889-5fdf-950e-6132d227fc43 | cc-by-4.0 | [
"nmp3_proof"
] | 67df20591b52ea881c537a188c09646b415652383a7db86bef4055e1dc4566c0 | tasks/nmp3_02ccf615-e889-5fdf-950e-6132d227fc43 | {
"split": "train",
"difficulty": "medium",
"source": "nvidia/Nemotron-Math-Proofs-v3-RL",
"source_id": "02ccf615-e889-5fdf-950e-6132d227fc43",
"source_license": "cc-by-4.0",
"source_dataset": "davinci-prover/agentic-prover-RL",
"source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"
} |
nmp3_02ed466f-1103-5bfc-b26c-1d19fd7e2991 | lean_theorem_proving | -- Original natural-language problem:
-- Let $a,b,c$ be non‑negative real numbers satisfying $ab+bc+ca>0$. Prove that
-- \[
-- \frac{a^{2}}{a^{2}+bc}+\frac{b^{2}}{b^{2}+ca}+\frac{c^{2}}{c^{2}+ab}+\frac{(a+b+c)^{3}+9abc}{(a+b)(b+c)(c+a)}\ge 6.
-- \]
import Mathlib
/-!
# Formal statement for the non-negative real ineq... | {
"name": "target",
"commit_hash": "56a005855ea17e0b0958f73ec801ae140b0a1679",
"repo_url": "https://github.com/leanprover-community/mathlib4.git",
"default_target": "Mathlib",
"read_only_path_patterns": [
"**/*"
],
"toolchain": "leanprover/lean4:v4.35.0"
} | medium | nvidia/Nemotron-Math-Proofs-v3-RL | 02ed466f-1103-5bfc-b26c-1d19fd7e2991 | cc-by-4.0 | [
"nmp3_proof"
] | 275913f71860f43f5a2467b4dfb9c119030ac34f4523f20542ce8d1838f3eab0 | tasks/nmp3_02ed466f-1103-5bfc-b26c-1d19fd7e2991 | {
"split": "train",
"difficulty": "medium",
"source": "nvidia/Nemotron-Math-Proofs-v3-RL",
"source_id": "02ed466f-1103-5bfc-b26c-1d19fd7e2991",
"source_license": "cc-by-4.0",
"source_dataset": "davinci-prover/agentic-prover-RL",
"source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"
} |
nmp3_032d2e17-1214-5940-bdfa-af061e9b9e94 | lean_theorem_proving | -- Original natural-language problem:
-- Let \(a,b,c>0\) satisfy \(ab+bc+ca=3\). Prove that
-- \[
-- \frac{a}{2a+b^{2}}+\frac{b}{2b+c^{2}}+\frac{c}{2c+a^{2}}\le 1 .
-- \]
import Mathlib
namespace Problem
/-- The admissibility condition for the parameters `a`, `b`, and `c`:
they are positive real numbers satisfying ... | {
"name": "target",
"commit_hash": "56a005855ea17e0b0958f73ec801ae140b0a1679",
"repo_url": "https://github.com/leanprover-community/mathlib4.git",
"default_target": "Mathlib",
"read_only_path_patterns": [
"**/*"
],
"toolchain": "leanprover/lean4:v4.35.0"
} | medium | nvidia/Nemotron-Math-Proofs-v3-RL | 032d2e17-1214-5940-bdfa-af061e9b9e94 | cc-by-4.0 | [
"nmp3_proof"
] | f49f5e2dcab4080caabc47e46c9738715f017e940f5ab64f3fc9d903f619d2f1 | tasks/nmp3_032d2e17-1214-5940-bdfa-af061e9b9e94 | {
"split": "train",
"difficulty": "medium",
"source": "nvidia/Nemotron-Math-Proofs-v3-RL",
"source_id": "032d2e17-1214-5940-bdfa-af061e9b9e94",
"source_license": "cc-by-4.0",
"source_dataset": "davinci-prover/agentic-prover-RL",
"source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"
} |
nmp3_03504ebf-70b6-53bb-80db-700cfe58e144 | lean_theorem_proving | -- Original natural-language problem:
-- Let $ABC$ be a triangle inscribed in a circle $(O)$. Let $AD$ be the internal bisector of $\angle BAC$, intersecting $BC$ at $D$ and intersecting $(O)$ again at $E$. Let $M$ and $N$ be the midpoints of $AD$ and $AC$, respectively. The line $MB$ meets the circumcircle of $\triang... | {
"name": "target",
"commit_hash": "56a005855ea17e0b0958f73ec801ae140b0a1679",
"repo_url": "https://github.com/leanprover-community/mathlib4.git",
"default_target": "Mathlib",
"read_only_path_patterns": [
"**/*"
],
"toolchain": "leanprover/lean4:v4.35.0"
} | hard | nvidia/Nemotron-Math-Proofs-v3-RL | 03504ebf-70b6-53bb-80db-700cfe58e144 | cc-by-4.0 | [
"nmp3_proof"
] | 3e7b2a23904dfea6b39f6da6d113333ebc21c5f69ba5b6be39a59967074a036d | tasks/nmp3_03504ebf-70b6-53bb-80db-700cfe58e144 | {
"split": "train",
"difficulty": "hard",
"source": "nvidia/Nemotron-Math-Proofs-v3-RL",
"source_id": "03504ebf-70b6-53bb-80db-700cfe58e144",
"source_license": "cc-by-4.0",
"source_dataset": "davinci-prover/agentic-prover-RL",
"source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"
} |
nmp3_037228b9-fcbc-5108-a04c-39989f6a03e7 | lean_theorem_proving | -- Original natural-language problem:
-- Given an integer $n\ge 4$, let $S=\{1,2,\dots ,n\}$. Let $A$ and $B$ be subsets of $S$ such that for every $a\in A$ and $b\in B$ the number $ab+1$ is a perfect square. Prove that
-- \[
-- \min\{|A|,|B|\}\le \log_2 n\, .
-- \]
import Mathlib
/-!
# Formal statement for the produ... | {
"name": "target",
"commit_hash": "56a005855ea17e0b0958f73ec801ae140b0a1679",
"repo_url": "https://github.com/leanprover-community/mathlib4.git",
"default_target": "Mathlib",
"read_only_path_patterns": [
"**/*"
],
"toolchain": "leanprover/lean4:v4.35.0"
} | hard | nvidia/Nemotron-Math-Proofs-v3-RL | 037228b9-fcbc-5108-a04c-39989f6a03e7 | cc-by-4.0 | [
"nmp3_proof"
] | 8353e2fbee493f11064b9609df839d1f87850bc463e46efc4b379447f186c144 | tasks/nmp3_037228b9-fcbc-5108-a04c-39989f6a03e7 | {
"split": "train",
"difficulty": "hard",
"source": "nvidia/Nemotron-Math-Proofs-v3-RL",
"source_id": "037228b9-fcbc-5108-a04c-39989f6a03e7",
"source_license": "cc-by-4.0",
"source_dataset": "davinci-prover/agentic-prover-RL",
"source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"
} |
nmp3_0378cb21-a34c-5e6c-9e25-3f667bcfcfb3 | lean_theorem_proving | -- Original natural-language problem:
-- Let $k,n\in\mathbb N$ (positive integers). Prove that
-- $$n(n+1)\mid (k+1)!\bigl(1^k+2^k+\cdots+n^k\bigr).$$
import Mathlib
/-!
# Formalization of the divisibility statement
The source problem asks, for positive integers `k` and `n`, to prove that
`n * (n + 1)` divides `(k +... | {
"name": "target",
"commit_hash": "56a005855ea17e0b0958f73ec801ae140b0a1679",
"repo_url": "https://github.com/leanprover-community/mathlib4.git",
"default_target": "Mathlib",
"read_only_path_patterns": [
"**/*"
],
"toolchain": "leanprover/lean4:v4.35.0"
} | medium | nvidia/Nemotron-Math-Proofs-v3-RL | 0378cb21-a34c-5e6c-9e25-3f667bcfcfb3 | cc-by-4.0 | [
"nmp3_proof"
] | dd428202799b33bce4839dcb89e310df6acb3424654b468f1f2790522831c8c1 | tasks/nmp3_0378cb21-a34c-5e6c-9e25-3f667bcfcfb3 | {
"split": "train",
"difficulty": "medium",
"source": "nvidia/Nemotron-Math-Proofs-v3-RL",
"source_id": "0378cb21-a34c-5e6c-9e25-3f667bcfcfb3",
"source_license": "cc-by-4.0",
"source_dataset": "davinci-prover/agentic-prover-RL",
"source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"
} |
nmp3_03aa86d4-4d11-539b-bd23-c0c69054983d | lean_theorem_proving | -- Original natural-language problem:
-- Let $x,y,z$ be positive real numbers. Prove that
-- \[
-- \frac{x^4}{8y^3+5z^3}+\frac{y^4}{8z^3+5x^3}+\frac{z^4}{8x^3+5y^3}\ge\frac{x+y+z}{13}\, .
-- \]
import Mathlib
namespace Problem
/-- The assertion of the problem: for every triple of positive real numbers
`x`, `y`, and... | {
"name": "target",
"commit_hash": "56a005855ea17e0b0958f73ec801ae140b0a1679",
"repo_url": "https://github.com/leanprover-community/mathlib4.git",
"default_target": "Mathlib",
"read_only_path_patterns": [
"**/*"
],
"toolchain": "leanprover/lean4:v4.35.0"
} | medium | nvidia/Nemotron-Math-Proofs-v3-RL | 03aa86d4-4d11-539b-bd23-c0c69054983d | cc-by-4.0 | [
"nmp3_proof"
] | 25e0c85cf3fba4ab8329de1a4a242505b13dfc0160b5a8236e9b2033df43265f | tasks/nmp3_03aa86d4-4d11-539b-bd23-c0c69054983d | {
"split": "train",
"difficulty": "medium",
"source": "nvidia/Nemotron-Math-Proofs-v3-RL",
"source_id": "03aa86d4-4d11-539b-bd23-c0c69054983d",
"source_license": "cc-by-4.0",
"source_dataset": "davinci-prover/agentic-prover-RL",
"source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"
} |
nmp3_03b3d17e-db91-54bc-910a-841b090f6cf2 | lean_theorem_proving | -- Original natural-language problem:
-- Prove that for any triangle whose interior angles are all less than $120^\circ$, there exists a point inside the triangle such that the three angles formed by the segments joining the point to the vertices are each equal to $120^\circ$.
import Mathlib
noncomputable section
ope... | {
"name": "target",
"commit_hash": "56a005855ea17e0b0958f73ec801ae140b0a1679",
"repo_url": "https://github.com/leanprover-community/mathlib4.git",
"default_target": "Mathlib",
"read_only_path_patterns": [
"**/*"
],
"toolchain": "leanprover/lean4:v4.35.0"
} | hard | nvidia/Nemotron-Math-Proofs-v3-RL | 03b3d17e-db91-54bc-910a-841b090f6cf2 | cc-by-4.0 | [
"nmp3_proof"
] | 03f05103733ee699d26978d273aefb94faf519993b806a4e1e6b1a13469e92c7 | tasks/nmp3_03b3d17e-db91-54bc-910a-841b090f6cf2 | {
"split": "train",
"difficulty": "hard",
"source": "nvidia/Nemotron-Math-Proofs-v3-RL",
"source_id": "03b3d17e-db91-54bc-910a-841b090f6cf2",
"source_license": "cc-by-4.0",
"source_dataset": "davinci-prover/agentic-prover-RL",
"source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"
} |
nmp3_03c1e611-d008-5e0b-b822-0dac2d0e6439 | lean_theorem_proving | -- Original natural-language problem:
-- Let $n>3$ be a positive integer. $n$ children sit in a circle and $n$ identical coins are distributed among them (some children may receive zero coins). In one move a child who currently has at least two coins may give one coin to each of his two immediate neighbours (thus loses... | {
"name": "target",
"commit_hash": "56a005855ea17e0b0958f73ec801ae140b0a1679",
"repo_url": "https://github.com/leanprover-community/mathlib4.git",
"default_target": "Mathlib",
"read_only_path_patterns": [
"**/*"
],
"toolchain": "leanprover/lean4:v4.35.0"
} | hard | nvidia/Nemotron-Math-Proofs-v3-RL | 03c1e611-d008-5e0b-b822-0dac2d0e6439 | cc-by-4.0 | [
"nmp3_proof"
] | 2e854add150dbce025fdad06025036f8b9c1515997cc90efeee1981867a4a9b6 | tasks/nmp3_03c1e611-d008-5e0b-b822-0dac2d0e6439 | {
"split": "train",
"difficulty": "hard",
"source": "nvidia/Nemotron-Math-Proofs-v3-RL",
"source_id": "03c1e611-d008-5e0b-b822-0dac2d0e6439",
"source_license": "cc-by-4.0",
"source_dataset": "davinci-prover/agentic-prover-RL",
"source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"
} |
nmp3_03c7b87a-865f-59b3-830d-8684ee33b727 | lean_theorem_proving | -- Original natural-language problem:
-- Let $n>k\ge 1$ be integers and let $p$ be a prime such that $p\mid\binom{n}{k}$. Prove that the $k$‑element subsets of $\{1,2,\dots ,n\}$ can be partitioned into $p$ classes of equal size, and that any two subsets with the same sum of elements belong to the same class.
import Ma... | {
"name": "target",
"commit_hash": "56a005855ea17e0b0958f73ec801ae140b0a1679",
"repo_url": "https://github.com/leanprover-community/mathlib4.git",
"default_target": "Mathlib",
"read_only_path_patterns": [
"**/*"
],
"toolchain": "leanprover/lean4:v4.35.0"
} | hard | nvidia/Nemotron-Math-Proofs-v3-RL | 03c7b87a-865f-59b3-830d-8684ee33b727 | cc-by-4.0 | [
"nmp3_proof"
] | 3f0447a12d7667d0adcde1d447e41376a71a00c596c2229dd3087989c9b7e1a3 | tasks/nmp3_03c7b87a-865f-59b3-830d-8684ee33b727 | {
"split": "train",
"difficulty": "hard",
"source": "nvidia/Nemotron-Math-Proofs-v3-RL",
"source_id": "03c7b87a-865f-59b3-830d-8684ee33b727",
"source_license": "cc-by-4.0",
"source_dataset": "davinci-prover/agentic-prover-RL",
"source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"
} |
nmp3_03cb7436-c3e8-51ce-9757-0cd3d507a2eb | lean_theorem_proving | -- Original natural-language problem:
-- Let $n>1$ be a given integer. Prove that infinitely many terms of the sequence $(a_k)_{k\ge 1}$, defined by
-- \[
-- a_k=\Big\lfloor\frac{n^{k}}{k}\Big\rfloor,
-- \]
-- are odd. (Here $\lfloor x\rfloor$ denotes the greatest integer not exceeding $x$.)
import Mathlib
namespace... | {
"name": "target",
"commit_hash": "56a005855ea17e0b0958f73ec801ae140b0a1679",
"repo_url": "https://github.com/leanprover-community/mathlib4.git",
"default_target": "Mathlib",
"read_only_path_patterns": [
"**/*"
],
"toolchain": "leanprover/lean4:v4.35.0"
} | hard | nvidia/Nemotron-Math-Proofs-v3-RL | 03cb7436-c3e8-51ce-9757-0cd3d507a2eb | cc-by-4.0 | [
"nmp3_proof"
] | f47018341a19bcef7fcdc1d7363882694ae0e29b911ae78795aefc6a558965c6 | tasks/nmp3_03cb7436-c3e8-51ce-9757-0cd3d507a2eb | {
"split": "train",
"difficulty": "hard",
"source": "nvidia/Nemotron-Math-Proofs-v3-RL",
"source_id": "03cb7436-c3e8-51ce-9757-0cd3d507a2eb",
"source_license": "cc-by-4.0",
"source_dataset": "davinci-prover/agentic-prover-RL",
"source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"
} |
nmp3_0433c78b-a393-52b8-8f85-9690f0eab56f | lean_theorem_proving | -- Original natural-language problem:
-- Let $a$ and $b$ be positive integers with $a-b>1$. Prove that there exist infinitely many positive integers $n$ such that
-- $$n^2\mid a^n-b^n.$$
import Mathlib
/-!
# Formalization of the target problem
Let `a` and `b` be positive integers with `a - b > 1`. Then there are
in... | {
"name": "target",
"commit_hash": "56a005855ea17e0b0958f73ec801ae140b0a1679",
"repo_url": "https://github.com/leanprover-community/mathlib4.git",
"default_target": "Mathlib",
"read_only_path_patterns": [
"**/*"
],
"toolchain": "leanprover/lean4:v4.35.0"
} | medium | nvidia/Nemotron-Math-Proofs-v3-RL | 0433c78b-a393-52b8-8f85-9690f0eab56f | cc-by-4.0 | [
"nmp3_proof"
] | 9402759edca108c9db608ff7dd043d8032781a4e0eb381d5b8ba142c550057d6 | tasks/nmp3_0433c78b-a393-52b8-8f85-9690f0eab56f | {
"split": "train",
"difficulty": "medium",
"source": "nvidia/Nemotron-Math-Proofs-v3-RL",
"source_id": "0433c78b-a393-52b8-8f85-9690f0eab56f",
"source_license": "cc-by-4.0",
"source_dataset": "davinci-prover/agentic-prover-RL",
"source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"
} |
nmp3_04366e49-981c-5f8c-a893-039c92eeabe0 | lean_theorem_proving | -- Original natural-language problem:
-- Let $a,b,c>0$. Prove that
-- \[
-- ab\frac{a^{3}+b^{3}}{a^{2}+b^{2}}+bc\frac{b^{3}+c^{3}}{b^{2}+c^{2}}+ca\frac{c^{3}+a^{3}}{c^{2}+a^{2}}\;\ge\;\sqrt{\,3abc\,(a^{3}+b^{3}+c^{3})\,}.
-- \]
import Mathlib.Analysis.Real.Sqrt
/-!
# Formal statement
The source problem asks to prov... | {
"name": "target",
"commit_hash": "56a005855ea17e0b0958f73ec801ae140b0a1679",
"repo_url": "https://github.com/leanprover-community/mathlib4.git",
"default_target": "Mathlib",
"read_only_path_patterns": [
"**/*"
],
"toolchain": "leanprover/lean4:v4.35.0"
} | hard | nvidia/Nemotron-Math-Proofs-v3-RL | 04366e49-981c-5f8c-a893-039c92eeabe0 | cc-by-4.0 | [
"nmp3_proof"
] | 59aa53a2366c52c32df61d0a867525d0ae1a06cb4f3e5af11cfd8feeea788ab1 | tasks/nmp3_04366e49-981c-5f8c-a893-039c92eeabe0 | {
"split": "train",
"difficulty": "hard",
"source": "nvidia/Nemotron-Math-Proofs-v3-RL",
"source_id": "04366e49-981c-5f8c-a893-039c92eeabe0",
"source_license": "cc-by-4.0",
"source_dataset": "davinci-prover/agentic-prover-RL",
"source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"
} |
nmp3_04bc1c3a-605c-55f2-a507-8a3164678700 | lean_theorem_proving | -- Original natural-language problem:
-- Let $m$ and $n$ be positive integers. Prove that there exist infinitely many ordered pairs of positive integers $(a,b)$ with $\gcd(a,b)=1$ such that
-- $$a+b\mid a\,m^{\,a}+b\,n^{\,b}\,. $$
import Mathlib.Data.Nat.GCD.Basic
import Mathlib.Data.Set.Finite.Basic
namespace Proble... | {
"name": "target",
"commit_hash": "56a005855ea17e0b0958f73ec801ae140b0a1679",
"repo_url": "https://github.com/leanprover-community/mathlib4.git",
"default_target": "Mathlib",
"read_only_path_patterns": [
"**/*"
],
"toolchain": "leanprover/lean4:v4.35.0"
} | hard | nvidia/Nemotron-Math-Proofs-v3-RL | 04bc1c3a-605c-55f2-a507-8a3164678700 | cc-by-4.0 | [
"nmp3_proof"
] | 88419d59220ee17d885511b3ad765ec73eff1f362eecf98407fb2041a1c09839 | tasks/nmp3_04bc1c3a-605c-55f2-a507-8a3164678700 | {
"split": "train",
"difficulty": "hard",
"source": "nvidia/Nemotron-Math-Proofs-v3-RL",
"source_id": "04bc1c3a-605c-55f2-a507-8a3164678700",
"source_license": "cc-by-4.0",
"source_dataset": "davinci-prover/agentic-prover-RL",
"source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"
} |
nmp3_04d29e31-d4f8-59ec-9021-6792eb10e9e2 | lean_theorem_proving | -- Original natural-language problem:
-- Let $a,b,c$ be real numbers with $0\le a,b,c\le1$. Prove that
-- \[
-- \left(\frac{a}{1+a}\right)^{3}+\left(\frac{b}{1+b}\right)^{3}+\left(\frac{c}{1+c}\right)^{3}
-- \;\ge\; abc\Bigg[\left(\frac{1}{1+a}\right)^{3}+\left(\frac{1}{1+b}\right)^{3}+\left(\frac{1}{1+c}\right)^{3}\... | {
"name": "target",
"commit_hash": "56a005855ea17e0b0958f73ec801ae140b0a1679",
"repo_url": "https://github.com/leanprover-community/mathlib4.git",
"default_target": "Mathlib",
"read_only_path_patterns": [
"**/*"
],
"toolchain": "leanprover/lean4:v4.35.0"
} | easy | nvidia/Nemotron-Math-Proofs-v3-RL | 04d29e31-d4f8-59ec-9021-6792eb10e9e2 | cc-by-4.0 | [
"nmp3_proof"
] | 93b16d5249149cbfc464a22cf6bf14def82abe73da855d5e20f3ce5aa8bc1af2 | tasks/nmp3_04d29e31-d4f8-59ec-9021-6792eb10e9e2 | {
"split": "train",
"difficulty": "easy",
"source": "nvidia/Nemotron-Math-Proofs-v3-RL",
"source_id": "04d29e31-d4f8-59ec-9021-6792eb10e9e2",
"source_license": "cc-by-4.0",
"source_dataset": "davinci-prover/agentic-prover-RL",
"source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"
} |
nmp3_04f56662-128d-5246-bc21-1b60f2cd2040 | lean_theorem_proving | -- Original natural-language problem:
-- Let $p$ be a prime such that $p^2\mid 2^{\,p-1}-1$. Prove that for every positive integer $n$, the integer
-- $$T=(p-1)(p!+2^{\,n})$$
-- has at least three distinct prime divisors.
import Mathlib
/-!
# Formalization of the source problem
The source problem asks to prove that... | {
"name": "target",
"commit_hash": "56a005855ea17e0b0958f73ec801ae140b0a1679",
"repo_url": "https://github.com/leanprover-community/mathlib4.git",
"default_target": "Mathlib",
"read_only_path_patterns": [
"**/*"
],
"toolchain": "leanprover/lean4:v4.35.0"
} | hard | nvidia/Nemotron-Math-Proofs-v3-RL | 04f56662-128d-5246-bc21-1b60f2cd2040 | cc-by-4.0 | [
"nmp3_proof"
] | d74e0e3f738844b4ab996ae6532a6d434fb903cebbfb636cdaf36f0a06f9df74 | tasks/nmp3_04f56662-128d-5246-bc21-1b60f2cd2040 | {
"split": "train",
"difficulty": "hard",
"source": "nvidia/Nemotron-Math-Proofs-v3-RL",
"source_id": "04f56662-128d-5246-bc21-1b60f2cd2040",
"source_license": "cc-by-4.0",
"source_dataset": "davinci-prover/agentic-prover-RL",
"source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"
} |
nmp3_050e8491-e779-53f5-966f-e4f84f959027 | lean_theorem_proving | -- Original natural-language problem:
-- Let $A_1,A_2,\dots,A_{n+2}$ be non‑empty subsets of $\{1,2,\dots,n\}$. Prove that there exist non‑empty disjoint subsets $I,J\subseteq\{1,2,\dots,n+2\}$ such that
-- \[
-- \bigcup_{k\in I}A_k=\bigcup_{k\in J}A_k\qquad\text{and}\qquad
-- \bigcap_{k\in I}A_k=\bigcap_{k\in J}A_k\... | {
"name": "target",
"commit_hash": "56a005855ea17e0b0958f73ec801ae140b0a1679",
"repo_url": "https://github.com/leanprover-community/mathlib4.git",
"default_target": "Mathlib",
"read_only_path_patterns": [
"**/*"
],
"toolchain": "leanprover/lean4:v4.35.0"
} | hard | nvidia/Nemotron-Math-Proofs-v3-RL | 050e8491-e779-53f5-966f-e4f84f959027 | cc-by-4.0 | [
"nmp3_proof"
] | 524a0a865ee2024f981f0d3b1ffa8b6675dd5c3e21eba1e1b7f13cd8fdbe51a6 | tasks/nmp3_050e8491-e779-53f5-966f-e4f84f959027 | {
"split": "train",
"difficulty": "hard",
"source": "nvidia/Nemotron-Math-Proofs-v3-RL",
"source_id": "050e8491-e779-53f5-966f-e4f84f959027",
"source_license": "cc-by-4.0",
"source_dataset": "davinci-prover/agentic-prover-RL",
"source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"
} |
nmp3_0533e1aa-f9ef-55f4-a930-33d629eb7439 | lean_theorem_proving | -- Original natural-language problem:
-- Let $x,y,z$ be positive real numbers. Prove that
-- \[
-- \sum_{cyc}\frac{xy}{xy+x^{2}+y^{2}}\le \sum_{cyc}\frac{x}{2x+z}.
-- \]
import Mathlib
/-!
Formalization of the cyclic inequality problem in `problem.md`.
The source states: for positive real numbers `x`, `y`, and `z`,... | {
"name": "target",
"commit_hash": "56a005855ea17e0b0958f73ec801ae140b0a1679",
"repo_url": "https://github.com/leanprover-community/mathlib4.git",
"default_target": "Mathlib",
"read_only_path_patterns": [
"**/*"
],
"toolchain": "leanprover/lean4:v4.35.0"
} | medium | nvidia/Nemotron-Math-Proofs-v3-RL | 0533e1aa-f9ef-55f4-a930-33d629eb7439 | cc-by-4.0 | [
"nmp3_proof"
] | a880130f481df72533ab6ba2009ab7be32c06003a808778f3793a6afbdd1709b | tasks/nmp3_0533e1aa-f9ef-55f4-a930-33d629eb7439 | {
"split": "train",
"difficulty": "medium",
"source": "nvidia/Nemotron-Math-Proofs-v3-RL",
"source_id": "0533e1aa-f9ef-55f4-a930-33d629eb7439",
"source_license": "cc-by-4.0",
"source_dataset": "davinci-prover/agentic-prover-RL",
"source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"
} |
nmp3_0533fb56-28c6-5805-bc89-e9ffd19b17cd | lean_theorem_proving | -- Original natural-language problem:
-- Show that for all positive real numbers \(a,b,c\),
--
-- \[
-- \frac{3a^{2}-2ab-b^{2}}{3a^{2}+2ab+3b^{2}}
-- +\frac{3b^{2}-2bc-c^{2}}{3b^{2}+2bc+3c^{2}}
-- +\frac{3c^{2}-2ca-a^{2}}{3c^{2}+2ca+3a^{2}}
-- \ge 0.
-- \]
import Mathlib
/-!
# Formal statement for the cyclic real ine... | {
"name": "target",
"commit_hash": "56a005855ea17e0b0958f73ec801ae140b0a1679",
"repo_url": "https://github.com/leanprover-community/mathlib4.git",
"default_target": "Mathlib",
"read_only_path_patterns": [
"**/*"
],
"toolchain": "leanprover/lean4:v4.35.0"
} | medium | nvidia/Nemotron-Math-Proofs-v3-RL | 0533fb56-28c6-5805-bc89-e9ffd19b17cd | cc-by-4.0 | [
"nmp3_proof"
] | 543402b8b5c4540dbce3dbac1ebc88a3d2a895bcc1836cbc924498133cda129d | tasks/nmp3_0533fb56-28c6-5805-bc89-e9ffd19b17cd | {
"split": "train",
"difficulty": "medium",
"source": "nvidia/Nemotron-Math-Proofs-v3-RL",
"source_id": "0533fb56-28c6-5805-bc89-e9ffd19b17cd",
"source_license": "cc-by-4.0",
"source_dataset": "davinci-prover/agentic-prover-RL",
"source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"
} |
nmp3_0565fc8f-4f00-58f0-a37b-4e28d04af7d9 | lean_theorem_proving | -- Original natural-language problem:
-- Suppose $a_1,\dots,a_n$ are rational numbers such that for every positive integer $m$ the sum $a_1^m+\cdots+a_n^m$ is an integer. Prove that each $a_i$ is an integer.
import Mathlib
/-!
# Formalization of the rational power-sum problem
The source problem asks to prove that a f... | {
"name": "target",
"commit_hash": "56a005855ea17e0b0958f73ec801ae140b0a1679",
"repo_url": "https://github.com/leanprover-community/mathlib4.git",
"default_target": "Mathlib",
"read_only_path_patterns": [
"**/*"
],
"toolchain": "leanprover/lean4:v4.35.0"
} | hard | nvidia/Nemotron-Math-Proofs-v3-RL | 0565fc8f-4f00-58f0-a37b-4e28d04af7d9 | cc-by-4.0 | [
"nmp3_proof"
] | e69bd4a4ff1a369f9dace9786241f09c6ddb7369d85c88b1c0b1164eac0d98b9 | tasks/nmp3_0565fc8f-4f00-58f0-a37b-4e28d04af7d9 | {
"split": "train",
"difficulty": "hard",
"source": "nvidia/Nemotron-Math-Proofs-v3-RL",
"source_id": "0565fc8f-4f00-58f0-a37b-4e28d04af7d9",
"source_license": "cc-by-4.0",
"source_dataset": "davinci-prover/agentic-prover-RL",
"source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"
} |
nmp3_0569f0dd-cebf-5f10-8667-d33cf64da62b | lean_theorem_proving | -- Original natural-language problem:
-- Let $a,b,c$ be the side lengths of a triangle $ABC$ (so $a,b,c>0$ and $a+b>c$, $a+c>b$, $b+c>a$). Prove that
-- \[
-- \Bigl(\frac{4bc}{a}-a\Bigr)(a-b)(a-c)\;+\;\Bigl(\frac{4ac}{b}-b\Bigr)(b-c)(b-a)\;+\;\Bigl(\frac{4ab}{c}-c\Bigr)(c-a)(c-b)\;\ge 0.
-- \]
import Mathlib
namespa... | {
"name": "target",
"commit_hash": "56a005855ea17e0b0958f73ec801ae140b0a1679",
"repo_url": "https://github.com/leanprover-community/mathlib4.git",
"default_target": "Mathlib",
"read_only_path_patterns": [
"**/*"
],
"toolchain": "leanprover/lean4:v4.35.0"
} | medium | nvidia/Nemotron-Math-Proofs-v3-RL | 0569f0dd-cebf-5f10-8667-d33cf64da62b | cc-by-4.0 | [
"nmp3_proof"
] | ec441483cf83e0f2e93861a84ad9a42f3b9b48e05dac387fd7942179f8e77e70 | tasks/nmp3_0569f0dd-cebf-5f10-8667-d33cf64da62b | {
"split": "train",
"difficulty": "medium",
"source": "nvidia/Nemotron-Math-Proofs-v3-RL",
"source_id": "0569f0dd-cebf-5f10-8667-d33cf64da62b",
"source_license": "cc-by-4.0",
"source_dataset": "davinci-prover/agentic-prover-RL",
"source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"
} |
nmp3_056c17dd-1e22-5096-87a9-2f6c89bcd437 | lean_theorem_proving | -- Original natural-language problem:
-- Let $a,b,c$ be positive real numbers. Prove that
-- \[
-- \left(\sum_{cyc}\frac{a}{\,b+c\,}\right)^2\le\left(\sum_{cyc}\frac{a^2}{\,bc+c^2\,}\right)\left(\sum_{cyc}\frac{a}{\,a+b\,}\right).
-- \]
import Mathlib
/-!
# Formalization of a cyclic sum inequality
For positive real... | {
"name": "target",
"commit_hash": "56a005855ea17e0b0958f73ec801ae140b0a1679",
"repo_url": "https://github.com/leanprover-community/mathlib4.git",
"default_target": "Mathlib",
"read_only_path_patterns": [
"**/*"
],
"toolchain": "leanprover/lean4:v4.35.0"
} | medium | nvidia/Nemotron-Math-Proofs-v3-RL | 056c17dd-1e22-5096-87a9-2f6c89bcd437 | cc-by-4.0 | [
"nmp3_proof"
] | 964ebe00abe083d19de03c160018caa98448c9cd12902625acdb182430d4ed55 | tasks/nmp3_056c17dd-1e22-5096-87a9-2f6c89bcd437 | {
"split": "train",
"difficulty": "medium",
"source": "nvidia/Nemotron-Math-Proofs-v3-RL",
"source_id": "056c17dd-1e22-5096-87a9-2f6c89bcd437",
"source_license": "cc-by-4.0",
"source_dataset": "davinci-prover/agentic-prover-RL",
"source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"
} |
nmp3_0579d7ef-7b0d-57ec-a2e4-6506e21977aa | lean_theorem_proving | -- Original natural-language problem:
-- Let $x_1,x_2,\ldots,x_n$ be positive real numbers such that $x_1+x_2+\cdots+x_n=1$, where $n\ge 2$, and define $x_{n+1}=x_1$. Prove that
-- \[
-- \sum_{i=1}^n\frac{x_i}{\,x_{i+1}-x_{i+1}^3\,}\ge\frac{n^3}{\,n^2-1\,}.
-- \]
import Mathlib
open scoped BigOperators
namespace Pro... | {
"name": "target",
"commit_hash": "56a005855ea17e0b0958f73ec801ae140b0a1679",
"repo_url": "https://github.com/leanprover-community/mathlib4.git",
"default_target": "Mathlib",
"read_only_path_patterns": [
"**/*"
],
"toolchain": "leanprover/lean4:v4.35.0"
} | medium | nvidia/Nemotron-Math-Proofs-v3-RL | 0579d7ef-7b0d-57ec-a2e4-6506e21977aa | cc-by-4.0 | [
"nmp3_proof"
] | 3a00aa24dd141ed4a81ea14fcc9cba8822a0b7e26b6130fb34196f8f668d757c | tasks/nmp3_0579d7ef-7b0d-57ec-a2e4-6506e21977aa | {
"split": "train",
"difficulty": "medium",
"source": "nvidia/Nemotron-Math-Proofs-v3-RL",
"source_id": "0579d7ef-7b0d-57ec-a2e4-6506e21977aa",
"source_license": "cc-by-4.0",
"source_dataset": "davinci-prover/agentic-prover-RL",
"source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"
} |
nmp3_0599ceef-1849-5046-8714-f53261072892 | lean_theorem_proving | -- Original natural-language problem:
-- Let $a$ and $b$ be positive integers greater than $2$. Prove that there exist a positive integer $k$ and a finite sequence of positive integers $n_1,n_2,\dots,n_k$ such that $n_1=a$, $n_k=b$, and for each $i$ with $1\le i<k$ the product $n_i n_{i+1}$ is divisible by $n_i+n_{i+1}... | {
"name": "target",
"commit_hash": "56a005855ea17e0b0958f73ec801ae140b0a1679",
"repo_url": "https://github.com/leanprover-community/mathlib4.git",
"default_target": "Mathlib",
"read_only_path_patterns": [
"**/*"
],
"toolchain": "leanprover/lean4:v4.35.0"
} | medium | nvidia/Nemotron-Math-Proofs-v3-RL | 0599ceef-1849-5046-8714-f53261072892 | cc-by-4.0 | [
"nmp3_proof"
] | 8939e6e26fff14133101341c2941f60e9aa285523589b3c67a731dfb513e3687 | tasks/nmp3_0599ceef-1849-5046-8714-f53261072892 | {
"split": "train",
"difficulty": "medium",
"source": "nvidia/Nemotron-Math-Proofs-v3-RL",
"source_id": "0599ceef-1849-5046-8714-f53261072892",
"source_license": "cc-by-4.0",
"source_dataset": "davinci-prover/agentic-prover-RL",
"source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"
} |
nmp3_05c85213-3deb-5850-8225-32e3aa807e5d | lean_theorem_proving | -- Original natural-language problem:
-- Let $a,b,c$ be non‑negative numbers. Prove that
-- \[
-- \sum_{cyc}\sqrt{2\bigl(a^{2}+b^{2}\bigr)}\;\ge\;\sqrt[3]{\,9\sum_{cyc}(a+b)^{3}\,}.
-- \]
import Mathlib
/-!
# Formal statement for the cyclic inequality problem
The source problem asks to prove, for non-negative real ... | {
"name": "target",
"commit_hash": "56a005855ea17e0b0958f73ec801ae140b0a1679",
"repo_url": "https://github.com/leanprover-community/mathlib4.git",
"default_target": "Mathlib",
"read_only_path_patterns": [
"**/*"
],
"toolchain": "leanprover/lean4:v4.35.0"
} | hard | nvidia/Nemotron-Math-Proofs-v3-RL | 05c85213-3deb-5850-8225-32e3aa807e5d | cc-by-4.0 | [
"nmp3_proof"
] | 018a81df8adf771d5974e2552c334ba3e076cdb5038fb35709d918dbc891cc9c | tasks/nmp3_05c85213-3deb-5850-8225-32e3aa807e5d | {
"split": "train",
"difficulty": "hard",
"source": "nvidia/Nemotron-Math-Proofs-v3-RL",
"source_id": "05c85213-3deb-5850-8225-32e3aa807e5d",
"source_license": "cc-by-4.0",
"source_dataset": "davinci-prover/agentic-prover-RL",
"source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"
} |
nmp3_06153bc7-bbe0-5562-ab7e-3ef53677bd18 | lean_theorem_proving | -- Original natural-language problem:
-- Let $a,b,c\ge0$ be real numbers such that no two of them are zero. Prove that
-- \[
-- \frac{b+c}{2b^{2}+3bc+2c^{2}}+\frac{c+a}{2c^{2}+3ca+2a^{2}}+\frac{a+b}{2a^{2}+3ab+2b^{2}}\ge\frac{18}{7(a+b+c)}.
-- \]
import Mathlib
namespace Problem
/-- The condition that no two of `a`... | {
"name": "target",
"commit_hash": "56a005855ea17e0b0958f73ec801ae140b0a1679",
"repo_url": "https://github.com/leanprover-community/mathlib4.git",
"default_target": "Mathlib",
"read_only_path_patterns": [
"**/*"
],
"toolchain": "leanprover/lean4:v4.35.0"
} | medium | nvidia/Nemotron-Math-Proofs-v3-RL | 06153bc7-bbe0-5562-ab7e-3ef53677bd18 | cc-by-4.0 | [
"nmp3_proof"
] | 6d0276d55b2ed3c46d2d4581849561514c936dca123f4283c7a29f8790e0dc28 | tasks/nmp3_06153bc7-bbe0-5562-ab7e-3ef53677bd18 | {
"split": "train",
"difficulty": "medium",
"source": "nvidia/Nemotron-Math-Proofs-v3-RL",
"source_id": "06153bc7-bbe0-5562-ab7e-3ef53677bd18",
"source_license": "cc-by-4.0",
"source_dataset": "davinci-prover/agentic-prover-RL",
"source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"
} |
nmp3_06281e92-2cee-5fe9-8a9f-d5095a0a2864 | lean_theorem_proving | -- Original natural-language problem:
-- Prove that for every integer $n\ge 2$ and every real $x\ge 0$,
-- \[
-- \frac{x^{\,n}+1}{2}\;\ge\;\sqrt{\frac{1}{\,n-1\,}\sum_{i=1}^{\,n-1}x^{2i}}\,,
-- \]
-- with equality if and only if $x=1$.
import Mathlib
namespace Problem
/-- The left-hand side of the stated inequality. ... | {
"name": "target",
"commit_hash": "56a005855ea17e0b0958f73ec801ae140b0a1679",
"repo_url": "https://github.com/leanprover-community/mathlib4.git",
"default_target": "Mathlib",
"read_only_path_patterns": [
"**/*"
],
"toolchain": "leanprover/lean4:v4.35.0"
} | hard | nvidia/Nemotron-Math-Proofs-v3-RL | 06281e92-2cee-5fe9-8a9f-d5095a0a2864 | cc-by-4.0 | [
"nmp3_proof"
] | 470c6e7528b0b42d37041da528d63c7e19e73eb4fd202f7eaa9a9dc894934b3f | tasks/nmp3_06281e92-2cee-5fe9-8a9f-d5095a0a2864 | {
"split": "train",
"difficulty": "hard",
"source": "nvidia/Nemotron-Math-Proofs-v3-RL",
"source_id": "06281e92-2cee-5fe9-8a9f-d5095a0a2864",
"source_license": "cc-by-4.0",
"source_dataset": "davinci-prover/agentic-prover-RL",
"source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"
} |
nmp3_06298c0e-89fb-588e-8b09-2b79064f7d68 | lean_theorem_proving | -- Original natural-language problem:
-- We are given six points in the plane, no three of which are collinear, and all $\binom{6}{2}=15$ distances between pairs of points are distinct. Prove that there exists a segment joining two of the points which is the shortest side of some triangle with vertices among the six po... | {
"name": "target",
"commit_hash": "56a005855ea17e0b0958f73ec801ae140b0a1679",
"repo_url": "https://github.com/leanprover-community/mathlib4.git",
"default_target": "Mathlib",
"read_only_path_patterns": [
"**/*"
],
"toolchain": "leanprover/lean4:v4.35.0"
} | hard | nvidia/Nemotron-Math-Proofs-v3-RL | 06298c0e-89fb-588e-8b09-2b79064f7d68 | cc-by-4.0 | [
"nmp3_proof"
] | a7bf104a2aad09cec6f8beb9a4c67f708dbb7432bc7cf62921cb19d856f83b77 | tasks/nmp3_06298c0e-89fb-588e-8b09-2b79064f7d68 | {
"split": "train",
"difficulty": "hard",
"source": "nvidia/Nemotron-Math-Proofs-v3-RL",
"source_id": "06298c0e-89fb-588e-8b09-2b79064f7d68",
"source_license": "cc-by-4.0",
"source_dataset": "davinci-prover/agentic-prover-RL",
"source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"
} |
nmp3_06517da1-51f5-5e56-adc8-05f47d6bea28 | lean_theorem_proving | -- Original natural-language problem:
-- Prove that for positive real numbers \(a,b,c\) the inequality
-- \[
-- \frac{c+2a}{\,b+2c\,}a^{3}+\frac{a+2b}{\,c+2a\,}b^{3}+\frac{b+2c}{\,a+2b\,}c^{3}\ge a^{3}+b^{3}+c^{3}
-- \]
-- holds.
import Mathlib
namespace Problem
/-- For positive real numbers `a`, `b`, and `c`, the st... | {
"name": "target",
"commit_hash": "56a005855ea17e0b0958f73ec801ae140b0a1679",
"repo_url": "https://github.com/leanprover-community/mathlib4.git",
"default_target": "Mathlib",
"read_only_path_patterns": [
"**/*"
],
"toolchain": "leanprover/lean4:v4.35.0"
} | medium | nvidia/Nemotron-Math-Proofs-v3-RL | 06517da1-51f5-5e56-adc8-05f47d6bea28 | cc-by-4.0 | [
"nmp3_proof"
] | abab8fdad8795d52609bd598754bb8c29eee3e320390fc194e75ac94cf52448c | tasks/nmp3_06517da1-51f5-5e56-adc8-05f47d6bea28 | {
"split": "train",
"difficulty": "medium",
"source": "nvidia/Nemotron-Math-Proofs-v3-RL",
"source_id": "06517da1-51f5-5e56-adc8-05f47d6bea28",
"source_license": "cc-by-4.0",
"source_dataset": "davinci-prover/agentic-prover-RL",
"source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"
} |
nmp3_0662ed57-2afc-5c02-aa82-737d77233fc2 | lean_theorem_proving | -- Original natural-language problem:
-- Let $M$ be the set of positive integers whose prime divisors are at most $3$ (equivalently $M=\{2^a3^b\mid a,b\in\mathbb N_0\}$).
-- Given an infinite family of subsets $A_1,A_2,\dots\subseteq M$, prove that there exist distinct indices $i\neq j$ such that for every $x\in A_i$... | {
"name": "target",
"commit_hash": "56a005855ea17e0b0958f73ec801ae140b0a1679",
"repo_url": "https://github.com/leanprover-community/mathlib4.git",
"default_target": "Mathlib",
"read_only_path_patterns": [
"**/*"
],
"toolchain": "leanprover/lean4:v4.35.0"
} | hard | nvidia/Nemotron-Math-Proofs-v3-RL | 0662ed57-2afc-5c02-aa82-737d77233fc2 | cc-by-4.0 | [
"nmp3_proof"
] | bb19c0f2ee8ca1f66a76f261753ba5bfb2fb93841614d9013ae0201bc2496f7f | tasks/nmp3_0662ed57-2afc-5c02-aa82-737d77233fc2 | {
"split": "train",
"difficulty": "hard",
"source": "nvidia/Nemotron-Math-Proofs-v3-RL",
"source_id": "0662ed57-2afc-5c02-aa82-737d77233fc2",
"source_license": "cc-by-4.0",
"source_dataset": "davinci-prover/agentic-prover-RL",
"source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"
} |
nmp3_06921822-99cf-5bfb-8ef2-f757429792d2 | lean_theorem_proving | -- Original natural-language problem:
-- Let $x,y,z$ be positive numbers. Prove that
-- $$\frac{\sqrt{xy}}{x+y}+\frac{\sqrt{yz}}{y+z}+\frac{\sqrt{xz}}{x+z}+\frac{5}{2}\ge\frac{36xyz}{(x+y+z)(xy+yz+xz)}.$$
import Mathlib
/-!
# Formal statement of the target inequality
This module records the mathematical statement fr... | {
"name": "target",
"commit_hash": "56a005855ea17e0b0958f73ec801ae140b0a1679",
"repo_url": "https://github.com/leanprover-community/mathlib4.git",
"default_target": "Mathlib",
"read_only_path_patterns": [
"**/*"
],
"toolchain": "leanprover/lean4:v4.35.0"
} | medium | nvidia/Nemotron-Math-Proofs-v3-RL | 06921822-99cf-5bfb-8ef2-f757429792d2 | cc-by-4.0 | [
"nmp3_proof"
] | a70256aa436c746387135bc873fb88a095d90ad3e4472fbd7bf4b2cf2d9db0cc | tasks/nmp3_06921822-99cf-5bfb-8ef2-f757429792d2 | {
"split": "train",
"difficulty": "medium",
"source": "nvidia/Nemotron-Math-Proofs-v3-RL",
"source_id": "06921822-99cf-5bfb-8ef2-f757429792d2",
"source_license": "cc-by-4.0",
"source_dataset": "davinci-prover/agentic-prover-RL",
"source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"
} |
nmp3_06fdfbb4-732f-5d45-88aa-f60c8c469f45 | lean_theorem_proving | -- Original natural-language problem:
-- Let $a,b,c\ge 0$ be real numbers such that none of the pairs $(a,b)$, $(b,c)$, $(c,a)$ are both zero (so all denominators are defined). Prove that
-- \[
-- \frac{1}{a^{2}+b^{2}}+\frac{1}{b^{2}+c^{2}}+\frac{1}{c^{2}+a^{2}}\ge \frac{10}{(a+b+c)^{2}}\,.
-- \]
import Mathlib
/-!
... | {
"name": "target",
"commit_hash": "56a005855ea17e0b0958f73ec801ae140b0a1679",
"repo_url": "https://github.com/leanprover-community/mathlib4.git",
"default_target": "Mathlib",
"read_only_path_patterns": [
"**/*"
],
"toolchain": "leanprover/lean4:v4.35.0"
} | medium | nvidia/Nemotron-Math-Proofs-v3-RL | 06fdfbb4-732f-5d45-88aa-f60c8c469f45 | cc-by-4.0 | [
"nmp3_proof"
] | 76cda8bd0988c539fd8cf6766ca2e7985714c19f7c2bd4bcde6d0bc22d736f78 | tasks/nmp3_06fdfbb4-732f-5d45-88aa-f60c8c469f45 | {
"split": "train",
"difficulty": "medium",
"source": "nvidia/Nemotron-Math-Proofs-v3-RL",
"source_id": "06fdfbb4-732f-5d45-88aa-f60c8c469f45",
"source_license": "cc-by-4.0",
"source_dataset": "davinci-prover/agentic-prover-RL",
"source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"
} |
nmp3_070daab2-e8b3-53cf-8d94-a8e214df44de | lean_theorem_proving | -- Original natural-language problem:
-- In triangle $ABC$, let $M$ be the midpoint of side $AC$. Let $N$ be the midpoint of the arc $ABC$ of the circumcircle of $ABC$ (the arc from $A$ to $C$ that passes through $B$). Let $I_1$ and $I_2$ be the incenters of triangles $ABM$ and $CBM$, respectively. Prove that the four ... | {
"name": "target",
"commit_hash": "56a005855ea17e0b0958f73ec801ae140b0a1679",
"repo_url": "https://github.com/leanprover-community/mathlib4.git",
"default_target": "Mathlib",
"read_only_path_patterns": [
"**/*"
],
"toolchain": "leanprover/lean4:v4.35.0"
} | hard | nvidia/Nemotron-Math-Proofs-v3-RL | 070daab2-e8b3-53cf-8d94-a8e214df44de | cc-by-4.0 | [
"nmp3_proof"
] | 364b75e68177232ab0e06d1f12d0f9ccf7adca3645454dc418989a77fa30663e | tasks/nmp3_070daab2-e8b3-53cf-8d94-a8e214df44de | {
"split": "train",
"difficulty": "hard",
"source": "nvidia/Nemotron-Math-Proofs-v3-RL",
"source_id": "070daab2-e8b3-53cf-8d94-a8e214df44de",
"source_license": "cc-by-4.0",
"source_dataset": "davinci-prover/agentic-prover-RL",
"source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"
} |
nmp3_0720ac41-7fea-5aaa-8422-2c09c86d0878 | lean_theorem_proving | -- Original natural-language problem:
-- Let $x,y,z>0$ with $x\ge y\ge z$ and $xy+yz+zx=1$. Prove that
-- \[
-- x^{3}z^{2}+y^{3}x^{2}+z^{3}y^{2}\;\ge\;\frac{2}{\,5(x+y+z)+9xyz\,}.
-- \]
import Mathlib
namespace Problem
/-- The three strict positivity assumptions on the variables. -/
def Positive (x y z : ℝ) : Prop :... | {
"name": "target",
"commit_hash": "56a005855ea17e0b0958f73ec801ae140b0a1679",
"repo_url": "https://github.com/leanprover-community/mathlib4.git",
"default_target": "Mathlib",
"read_only_path_patterns": [
"**/*"
],
"toolchain": "leanprover/lean4:v4.35.0"
} | easy | nvidia/Nemotron-Math-Proofs-v3-RL | 0720ac41-7fea-5aaa-8422-2c09c86d0878 | cc-by-4.0 | [
"nmp3_proof"
] | c115ab97df0f8b75f10061021ecdb9df5b36e2bba6de3427bf3372230e285298 | tasks/nmp3_0720ac41-7fea-5aaa-8422-2c09c86d0878 | {
"split": "train",
"difficulty": "easy",
"source": "nvidia/Nemotron-Math-Proofs-v3-RL",
"source_id": "0720ac41-7fea-5aaa-8422-2c09c86d0878",
"source_license": "cc-by-4.0",
"source_dataset": "davinci-prover/agentic-prover-RL",
"source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"
} |
nmp3_07442508-5806-5629-a3d7-e644f2e5e7af | lean_theorem_proving | -- Original natural-language problem:
-- Let $a,b,c$ be positive real numbers such that $abc=1$. Prove that
-- \[
-- \frac{ac+ab^{2}}{a+b}+\frac{ba+bc^{2}}{b+c}+\frac{cb+ca^{2}}{c+a}\ge \frac{9}{a^{2}+b^{2}+c^{2}}.
-- \]
import Mathlib
/-!
# Formal statement of the inequality problem
The source problem asks to prov... | {
"name": "target",
"commit_hash": "56a005855ea17e0b0958f73ec801ae140b0a1679",
"repo_url": "https://github.com/leanprover-community/mathlib4.git",
"default_target": "Mathlib",
"read_only_path_patterns": [
"**/*"
],
"toolchain": "leanprover/lean4:v4.35.0"
} | hard | nvidia/Nemotron-Math-Proofs-v3-RL | 07442508-5806-5629-a3d7-e644f2e5e7af | cc-by-4.0 | [
"nmp3_proof"
] | 3e78da892384be07c06ea961e57aa8a84963c9457c15e7fcb3dfcad80c522713 | tasks/nmp3_07442508-5806-5629-a3d7-e644f2e5e7af | {
"split": "train",
"difficulty": "hard",
"source": "nvidia/Nemotron-Math-Proofs-v3-RL",
"source_id": "07442508-5806-5629-a3d7-e644f2e5e7af",
"source_license": "cc-by-4.0",
"source_dataset": "davinci-prover/agentic-prover-RL",
"source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"
} |
nmp3_0759d031-53d5-5308-acb1-614eb9c9f26c | lean_theorem_proving | -- Original natural-language problem:
-- Two circles $C_{1}$ and $C_{2}$ intersect at points $P$ and $Q$. Let $AB$ be their common tangent line that is closer to $P$ than to $Q$, with $A\in C_{1}$ and $B\in C_{2}$. The tangent to $C_{1}$ at $P$ meets $C_{2}$ again at $E\neq P$, and the tangent to $C_{2}$ at $P$ meets $... | {
"name": "target",
"commit_hash": "56a005855ea17e0b0958f73ec801ae140b0a1679",
"repo_url": "https://github.com/leanprover-community/mathlib4.git",
"default_target": "Mathlib",
"read_only_path_patterns": [
"**/*"
],
"toolchain": "leanprover/lean4:v4.35.0"
} | hard | nvidia/Nemotron-Math-Proofs-v3-RL | 0759d031-53d5-5308-acb1-614eb9c9f26c | cc-by-4.0 | [
"nmp3_proof"
] | f1e646b01f94ae60729ebd3055d75550b3cefeddf4af73b61832bee80ebca8ac | tasks/nmp3_0759d031-53d5-5308-acb1-614eb9c9f26c | {
"split": "train",
"difficulty": "hard",
"source": "nvidia/Nemotron-Math-Proofs-v3-RL",
"source_id": "0759d031-53d5-5308-acb1-614eb9c9f26c",
"source_license": "cc-by-4.0",
"source_dataset": "davinci-prover/agentic-prover-RL",
"source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"
} |
nmp3_075bb2be-717d-57ed-8c14-18431984bf99 | lean_theorem_proving | -- Original natural-language problem:
-- Prove that for all real numbers $a,b,c$,
-- \[
-- \frac{ab(a+b)+bc(b+c)+ca(c+a)}{(a^2+1)(b^2+1)(c^2+1)}\le\frac34.
-- \]
import Mathlib
namespace Problem
/-- The numerator of the displayed expression, for real numbers `a`, `b`, `c`. -/
def Numerator (a b c : ℝ) : ℝ :=
a * b ... | {
"name": "target",
"commit_hash": "56a005855ea17e0b0958f73ec801ae140b0a1679",
"repo_url": "https://github.com/leanprover-community/mathlib4.git",
"default_target": "Mathlib",
"read_only_path_patterns": [
"**/*"
],
"toolchain": "leanprover/lean4:v4.35.0"
} | easy | nvidia/Nemotron-Math-Proofs-v3-RL | 075bb2be-717d-57ed-8c14-18431984bf99 | cc-by-4.0 | [
"nmp3_proof"
] | 64a4d2403969bbffa2d8d84b6099fc1b8114021015f4467b63bc5c1a7a777938 | tasks/nmp3_075bb2be-717d-57ed-8c14-18431984bf99 | {
"split": "train",
"difficulty": "easy",
"source": "nvidia/Nemotron-Math-Proofs-v3-RL",
"source_id": "075bb2be-717d-57ed-8c14-18431984bf99",
"source_license": "cc-by-4.0",
"source_dataset": "davinci-prover/agentic-prover-RL",
"source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"
} |
nmp3_075c0b23-d098-5976-8796-6c46175173aa | lean_theorem_proving | -- Original natural-language problem:
-- Let $P(x)\in\mathbb Z[x]$ be a polynomial such that for every prime $p$ there exists a polynomial $Q_p(x)\in\mathbb Z[x]$ with
-- $$P(x)\equiv Q_p(x)^2\pmod p.$$
-- Prove that there exists a polynomial $R(x)\in\mathbb Z[x]$ satisfying $P(x)=R(x)^2\,. $
import Mathlib
/-!
# Fo... | {
"name": "target",
"commit_hash": "56a005855ea17e0b0958f73ec801ae140b0a1679",
"repo_url": "https://github.com/leanprover-community/mathlib4.git",
"default_target": "Mathlib",
"read_only_path_patterns": [
"**/*"
],
"toolchain": "leanprover/lean4:v4.35.0"
} | hard | nvidia/Nemotron-Math-Proofs-v3-RL | 075c0b23-d098-5976-8796-6c46175173aa | cc-by-4.0 | [
"nmp3_proof"
] | 65cd33ec0db8c3a3fbed67c54d2e9cc82e716308fbba7d8a317222c2ed3835d5 | tasks/nmp3_075c0b23-d098-5976-8796-6c46175173aa | {
"split": "train",
"difficulty": "hard",
"source": "nvidia/Nemotron-Math-Proofs-v3-RL",
"source_id": "075c0b23-d098-5976-8796-6c46175173aa",
"source_license": "cc-by-4.0",
"source_dataset": "davinci-prover/agentic-prover-RL",
"source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"
} |
nmp3_0762ab31-43c6-5375-947d-2632badee080 | lean_theorem_proving | -- Original natural-language problem:
-- Let $a,b,c\ge0$ satisfy $ab+bc+ca+abc=4$. Prove that
-- $$a^2+b^2+c^2+a^2b+b^2c+c^2a\ge2(ab+bc+ca).$$
import Mathlib
namespace Problem
/-- The three variables are nonnegative real numbers. -/
def Nonnegative (a b c : ℝ) : Prop :=
0 ≤ a ∧ 0 ≤ b ∧ 0 ≤ c
/-- The equation `ab ... | {
"name": "target",
"commit_hash": "56a005855ea17e0b0958f73ec801ae140b0a1679",
"repo_url": "https://github.com/leanprover-community/mathlib4.git",
"default_target": "Mathlib",
"read_only_path_patterns": [
"**/*"
],
"toolchain": "leanprover/lean4:v4.35.0"
} | medium | nvidia/Nemotron-Math-Proofs-v3-RL | 0762ab31-43c6-5375-947d-2632badee080 | cc-by-4.0 | [
"nmp3_proof"
] | 2d3f5cf89e9ea91356dc31cdea4ab5190efd48439440d71599a933cdaa677b79 | tasks/nmp3_0762ab31-43c6-5375-947d-2632badee080 | {
"split": "train",
"difficulty": "medium",
"source": "nvidia/Nemotron-Math-Proofs-v3-RL",
"source_id": "0762ab31-43c6-5375-947d-2632badee080",
"source_license": "cc-by-4.0",
"source_dataset": "davinci-prover/agentic-prover-RL",
"source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"
} |
nmp3_07778375-580f-5a8d-bb3c-29c0dbb80cc0 | lean_theorem_proving | -- Original natural-language problem:
-- Assume that $a,b,c$ are positive integers such that $\gcd(a,b)=\gcd(b,c)=\gcd(c,a)=1$, $a+b\mid b^{2}+c^{2}$, $b+c\mid c^{2}+a^{2}$, and $c+a\mid a^{2}+b^{2}$. Prove that $a=b=c=1$.
import Mathlib
/-!
# Formalization of a positive-integers gcd/divisibility problem
The source p... | {
"name": "target",
"commit_hash": "56a005855ea17e0b0958f73ec801ae140b0a1679",
"repo_url": "https://github.com/leanprover-community/mathlib4.git",
"default_target": "Mathlib",
"read_only_path_patterns": [
"**/*"
],
"toolchain": "leanprover/lean4:v4.35.0"
} | hard | nvidia/Nemotron-Math-Proofs-v3-RL | 07778375-580f-5a8d-bb3c-29c0dbb80cc0 | cc-by-4.0 | [
"nmp3_proof"
] | 20e19da75ac08c768957f63210363119641bf2b660ad7ebcf9a165c46ea3bc6a | tasks/nmp3_07778375-580f-5a8d-bb3c-29c0dbb80cc0 | {
"split": "train",
"difficulty": "hard",
"source": "nvidia/Nemotron-Math-Proofs-v3-RL",
"source_id": "07778375-580f-5a8d-bb3c-29c0dbb80cc0",
"source_license": "cc-by-4.0",
"source_dataset": "davinci-prover/agentic-prover-RL",
"source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"
} |
nmp3_0782f131-144a-54ea-81cf-7c78adc0fa6f | lean_theorem_proving | -- Original natural-language problem:
-- Let \(a,b,c\) be non‑negative real numbers, with at most one of them equal to zero (so that \(b+c>0,\;c+a>0,\;a+b>0\)). Prove that
-- \[
-- 2\Bigl(\frac{a^{3}}{b+c}+\frac{b^{3}}{c+a}+\frac{c^{3}}{a+b}\Bigr)+(a+b+c)^{2}\ge 4\,(a^{2}+b^{2}+c^{2})\,.
-- \]
import Mathlib
namespa... | {
"name": "target",
"commit_hash": "56a005855ea17e0b0958f73ec801ae140b0a1679",
"repo_url": "https://github.com/leanprover-community/mathlib4.git",
"default_target": "Mathlib",
"read_only_path_patterns": [
"**/*"
],
"toolchain": "leanprover/lean4:v4.35.0"
} | medium | nvidia/Nemotron-Math-Proofs-v3-RL | 0782f131-144a-54ea-81cf-7c78adc0fa6f | cc-by-4.0 | [
"nmp3_proof"
] | 40acb4dad9651e6630f755ccfec0784214bee8ca373419264667eb70916b9151 | tasks/nmp3_0782f131-144a-54ea-81cf-7c78adc0fa6f | {
"split": "train",
"difficulty": "medium",
"source": "nvidia/Nemotron-Math-Proofs-v3-RL",
"source_id": "0782f131-144a-54ea-81cf-7c78adc0fa6f",
"source_license": "cc-by-4.0",
"source_dataset": "davinci-prover/agentic-prover-RL",
"source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"
} |
nmp3_0792c7d6-c665-5c8c-8588-2d0d81953f37 | lean_theorem_proving | -- Original natural-language problem:
-- Let $f:\mathbb{Q}\to\mathbb{Z}$ assign an integer to each rational point on the real line. Prove that there exist rational numbers $a<b$ such that
-- $$f(a)+f(b)\le 2\,f\!\Big(\frac{a+b}{2}\Big).$$
import Mathlib
/-!
# Formalization of the midpoint inequality problem
The sour... | {
"name": "target",
"commit_hash": "56a005855ea17e0b0958f73ec801ae140b0a1679",
"repo_url": "https://github.com/leanprover-community/mathlib4.git",
"default_target": "Mathlib",
"read_only_path_patterns": [
"**/*"
],
"toolchain": "leanprover/lean4:v4.35.0"
} | medium | nvidia/Nemotron-Math-Proofs-v3-RL | 0792c7d6-c665-5c8c-8588-2d0d81953f37 | cc-by-4.0 | [
"nmp3_proof"
] | 46e0e51170bbdf60a3a63fc97638a37f7d8b3999e59f5e5c681aaac365606538 | tasks/nmp3_0792c7d6-c665-5c8c-8588-2d0d81953f37 | {
"split": "train",
"difficulty": "medium",
"source": "nvidia/Nemotron-Math-Proofs-v3-RL",
"source_id": "0792c7d6-c665-5c8c-8588-2d0d81953f37",
"source_license": "cc-by-4.0",
"source_dataset": "davinci-prover/agentic-prover-RL",
"source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"
} |
nmp3_07def91c-39db-5a54-8b9a-0aa138ffa55f | lean_theorem_proving | -- Original natural-language problem:
-- Let $a,b,c\ge0$ with $ab+bc+ca>0$. Prove that
-- \[
-- \frac{\sqrt{a^{4}+4abc(b+c)}}{a^{2}+2bc}+\frac{\sqrt{b^{4}+4abc(c+a)}}{b^{2}+2ca}+\frac{\sqrt{c^{4}+4abc(a+b)}}{c^{2}+2ab}\ge\frac{(a+b+c)^{2}}{a^{2}+b^{2}+c^{2}}\,.
-- \]
import Mathlib
/-!
# Formalization of the inequa... | {
"name": "target",
"commit_hash": "56a005855ea17e0b0958f73ec801ae140b0a1679",
"repo_url": "https://github.com/leanprover-community/mathlib4.git",
"default_target": "Mathlib",
"read_only_path_patterns": [
"**/*"
],
"toolchain": "leanprover/lean4:v4.35.0"
} | hard | nvidia/Nemotron-Math-Proofs-v3-RL | 07def91c-39db-5a54-8b9a-0aa138ffa55f | cc-by-4.0 | [
"nmp3_proof"
] | 75fa44fa17b68b203dc1d3e9fe00f1bc6beabda043ef38073a43379b87eebc1f | tasks/nmp3_07def91c-39db-5a54-8b9a-0aa138ffa55f | {
"split": "train",
"difficulty": "hard",
"source": "nvidia/Nemotron-Math-Proofs-v3-RL",
"source_id": "07def91c-39db-5a54-8b9a-0aa138ffa55f",
"source_license": "cc-by-4.0",
"source_dataset": "davinci-prover/agentic-prover-RL",
"source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"
} |
nmp3_0818ce94-9da4-5257-9aa2-41e7b77c5a2f | lean_theorem_proving | -- Original natural-language problem:
-- Suppose each point of the plane is colored either red or yellow. Prove that there exists a convex pentagon having three right interior angles whose five vertices are all the same color.
import Mathlib
noncomputable section
open Classical
namespace Problem
/-- The Euclidean pl... | {
"name": "target",
"commit_hash": "56a005855ea17e0b0958f73ec801ae140b0a1679",
"repo_url": "https://github.com/leanprover-community/mathlib4.git",
"default_target": "Mathlib",
"read_only_path_patterns": [
"**/*"
],
"toolchain": "leanprover/lean4:v4.35.0"
} | medium | nvidia/Nemotron-Math-Proofs-v3-RL | 0818ce94-9da4-5257-9aa2-41e7b77c5a2f | cc-by-4.0 | [
"nmp3_proof"
] | 9106990f1badcdc8ee71eee147abbc347400bdd8f407397839a19f32775d564f | tasks/nmp3_0818ce94-9da4-5257-9aa2-41e7b77c5a2f | {
"split": "train",
"difficulty": "medium",
"source": "nvidia/Nemotron-Math-Proofs-v3-RL",
"source_id": "0818ce94-9da4-5257-9aa2-41e7b77c5a2f",
"source_license": "cc-by-4.0",
"source_dataset": "davinci-prover/agentic-prover-RL",
"source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"
} |
nmp3_08222375-1b9d-56f7-8ba3-eb6f8cc6846e | lean_theorem_proving | -- Original natural-language problem:
-- Let $m,n$ be positive integers and let $(a_i)_{i\ge1}$ be an $n$‑periodic sequence of integers, i.e. $a_i=a_{i-n}$ for all $i>n$. For each $j$ with $1\le j\le n$, define $l_j$ to be the smallest positive integer such that
-- $$m\mid a_j+a_{j+1}+\dots +a_{j+l_j-1}.$$
-- Prove t... | {
"name": "target",
"commit_hash": "56a005855ea17e0b0958f73ec801ae140b0a1679",
"repo_url": "https://github.com/leanprover-community/mathlib4.git",
"default_target": "Mathlib",
"read_only_path_patterns": [
"**/*"
],
"toolchain": "leanprover/lean4:v4.35.0"
} | hard | nvidia/Nemotron-Math-Proofs-v3-RL | 08222375-1b9d-56f7-8ba3-eb6f8cc6846e | cc-by-4.0 | [
"nmp3_proof"
] | 6c6d8ddd42681a3787cc4cd5206f409198bd2735bb14c38521f540e10ca617a1 | tasks/nmp3_08222375-1b9d-56f7-8ba3-eb6f8cc6846e | {
"split": "train",
"difficulty": "hard",
"source": "nvidia/Nemotron-Math-Proofs-v3-RL",
"source_id": "08222375-1b9d-56f7-8ba3-eb6f8cc6846e",
"source_license": "cc-by-4.0",
"source_dataset": "davinci-prover/agentic-prover-RL",
"source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"
} |
nmp3_082ac614-e21d-576a-9ffb-56502ec63a8f | lean_theorem_proving | -- Original natural-language problem:
-- Let $x,y,z$ be positive real numbers such that $x+y+z=1$. Prove that
-- \[
-- \sum_{\text{cyc}}\frac{xy}{\sqrt{xy+yz}}\le\frac{\sqrt2}{2}\,.
-- \]
import Mathlib.Analysis.SpecialFunctions.Sqrt
/-!
# Formal statement for the cyclic square-root inequality
The source problem ask... | {
"name": "target",
"commit_hash": "56a005855ea17e0b0958f73ec801ae140b0a1679",
"repo_url": "https://github.com/leanprover-community/mathlib4.git",
"default_target": "Mathlib",
"read_only_path_patterns": [
"**/*"
],
"toolchain": "leanprover/lean4:v4.35.0"
} | medium | nvidia/Nemotron-Math-Proofs-v3-RL | 082ac614-e21d-576a-9ffb-56502ec63a8f | cc-by-4.0 | [
"nmp3_proof"
] | c436398e6db3a4f0f6cad16979a153305299812c9e9fbdbe46c2218cec269c0d | tasks/nmp3_082ac614-e21d-576a-9ffb-56502ec63a8f | {
"split": "train",
"difficulty": "medium",
"source": "nvidia/Nemotron-Math-Proofs-v3-RL",
"source_id": "082ac614-e21d-576a-9ffb-56502ec63a8f",
"source_license": "cc-by-4.0",
"source_dataset": "davinci-prover/agentic-prover-RL",
"source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"
} |
nmp3_082dc2dd-fc97-5fc4-904c-fd68753e618e | lean_theorem_proving | -- Original natural-language problem:
-- Let $a,b,c>0$ satisfy $a+b+c=3$. Prove that
-- \[
-- \frac{ab^2}{13a+3b^2}+\frac{bc^2}{13b+3c^2}+\frac{ca^2}{13c+3a^2}\le\frac{3}{16}.
-- \]
import Mathlib.Data.Real.Basic
namespace Problem
/-- The hypotheses of the inequality: `a`, `b`, and `c` are positive reals
whose sum i... | {
"name": "target",
"commit_hash": "56a005855ea17e0b0958f73ec801ae140b0a1679",
"repo_url": "https://github.com/leanprover-community/mathlib4.git",
"default_target": "Mathlib",
"read_only_path_patterns": [
"**/*"
],
"toolchain": "leanprover/lean4:v4.35.0"
} | hard | nvidia/Nemotron-Math-Proofs-v3-RL | 082dc2dd-fc97-5fc4-904c-fd68753e618e | cc-by-4.0 | [
"nmp3_proof"
] | a9a4d68cb29c0a01d2acdd96832e9b9e62cfeb389974447743a6dd66097cad5e | tasks/nmp3_082dc2dd-fc97-5fc4-904c-fd68753e618e | {
"split": "train",
"difficulty": "hard",
"source": "nvidia/Nemotron-Math-Proofs-v3-RL",
"source_id": "082dc2dd-fc97-5fc4-904c-fd68753e618e",
"source_license": "cc-by-4.0",
"source_dataset": "davinci-prover/agentic-prover-RL",
"source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"
} |
nmp3_0850e212-3989-524f-9179-2dee411d8a13 | lean_theorem_proving | -- Original natural-language problem:
-- Show that the set of positive integers that cannot be represented as a sum of distinct perfect squares is finite; i.e., prove that there exists a bound M such that every integer n > M can be written as a sum of distinct squares of positive integers.
import Mathlib
namespace Pro... | {
"name": "target",
"commit_hash": "56a005855ea17e0b0958f73ec801ae140b0a1679",
"repo_url": "https://github.com/leanprover-community/mathlib4.git",
"default_target": "Mathlib",
"read_only_path_patterns": [
"**/*"
],
"toolchain": "leanprover/lean4:v4.35.0"
} | medium | nvidia/Nemotron-Math-Proofs-v3-RL | 0850e212-3989-524f-9179-2dee411d8a13 | cc-by-4.0 | [
"nmp3_proof"
] | 16a4f22c888a41d6139d0e92af443533262cd7a1dafd6aa23aee453caaaa2c75 | tasks/nmp3_0850e212-3989-524f-9179-2dee411d8a13 | {
"split": "train",
"difficulty": "medium",
"source": "nvidia/Nemotron-Math-Proofs-v3-RL",
"source_id": "0850e212-3989-524f-9179-2dee411d8a13",
"source_license": "cc-by-4.0",
"source_dataset": "davinci-prover/agentic-prover-RL",
"source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"
} |
nmp3_08570448-11bf-5d67-b72d-4319324eb581 | lean_theorem_proving | -- Original natural-language problem:
-- Let $a,b,c\ge 0$ such that $a+b+c=3$. Prove that
-- \[
-- \bigl(a^2b+b^2c+c^2a\bigr)\,(ab+bc+ca)\le 9.
-- \]
import Mathlib.Basic.Real.Basic
/-!
# Formal statement: a cyclic cubic-times-symmetric quadratic inequality
Source problem: for nonnegative real numbers `a`, `b`, and ... | {
"name": "target",
"commit_hash": "56a005855ea17e0b0958f73ec801ae140b0a1679",
"repo_url": "https://github.com/leanprover-community/mathlib4.git",
"default_target": "Mathlib",
"read_only_path_patterns": [
"**/*"
],
"toolchain": "leanprover/lean4:v4.35.0"
} | hard | nvidia/Nemotron-Math-Proofs-v3-RL | 08570448-11bf-5d67-b72d-4319324eb581 | cc-by-4.0 | [
"nmp3_proof"
] | 58adce4c8d2cf318ce4635f22365721179ea505f803795bf0c22db4bfd479e84 | tasks/nmp3_08570448-11bf-5d67-b72d-4319324eb581 | {
"split": "train",
"difficulty": "hard",
"source": "nvidia/Nemotron-Math-Proofs-v3-RL",
"source_id": "08570448-11bf-5d67-b72d-4319324eb581",
"source_license": "cc-by-4.0",
"source_dataset": "davinci-prover/agentic-prover-RL",
"source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"
} |
nmp3_08acbe00-b29f-5a3b-9b9b-2031bff62e9d | lean_theorem_proving | -- Original natural-language problem:
-- Let $f:\mathbb R\to\mathbb R$ satisfy
--
-- 1. $f(1)=1$,
-- 2. $f(a+b)=f(a)+f(b)$ for all $a,b\in\mathbb R$,
-- 3. $f(x)\,f\!\bigl(\tfrac1x\bigr)=1$ for all $x\in\mathbb R\setminus\{0\}$.
--
-- Prove that $f(x)=x$ for every real $x$.
import Mathlib.Basic.Real.Basic
na... | {
"name": "target",
"commit_hash": "56a005855ea17e0b0958f73ec801ae140b0a1679",
"repo_url": "https://github.com/leanprover-community/mathlib4.git",
"default_target": "Mathlib",
"read_only_path_patterns": [
"**/*"
],
"toolchain": "leanprover/lean4:v4.35.0"
} | easy | nvidia/Nemotron-Math-Proofs-v3-RL | 08acbe00-b29f-5a3b-9b9b-2031bff62e9d | cc-by-4.0 | [
"nmp3_proof"
] | be6cdef4219a7f94004e48fb55805b4b534ef613789143bdbfeea9b050e3b042 | tasks/nmp3_08acbe00-b29f-5a3b-9b9b-2031bff62e9d | {
"split": "train",
"difficulty": "easy",
"source": "nvidia/Nemotron-Math-Proofs-v3-RL",
"source_id": "08acbe00-b29f-5a3b-9b9b-2031bff62e9d",
"source_license": "cc-by-4.0",
"source_dataset": "davinci-prover/agentic-prover-RL",
"source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"
} |
nmp3_08e59a5e-9446-5ced-86d2-c903cb6bd96d | lean_theorem_proving | -- Original natural-language problem:
-- A sequence of real numbers $(a_n)_{n\ge1}$ satisfies
-- \[
-- a_n=-\max_{\,i+j=n}(a_i+a_j)\qquad\text{for every integer }n>2017,
-- \]
-- where the maximum is taken over all positive integers $i,j$ with $i+j=n$. Prove that the sequence $(a_n)$ is bounded; i.e. there exists a... | {
"name": "target",
"commit_hash": "56a005855ea17e0b0958f73ec801ae140b0a1679",
"repo_url": "https://github.com/leanprover-community/mathlib4.git",
"default_target": "Mathlib",
"read_only_path_patterns": [
"**/*"
],
"toolchain": "leanprover/lean4:v4.35.0"
} | medium | nvidia/Nemotron-Math-Proofs-v3-RL | 08e59a5e-9446-5ced-86d2-c903cb6bd96d | cc-by-4.0 | [
"nmp3_proof"
] | c5f27238cee5c7c35795d47ae923d97a6c838e437b190b9f9d89ea1d48007dfe | tasks/nmp3_08e59a5e-9446-5ced-86d2-c903cb6bd96d | {
"split": "train",
"difficulty": "medium",
"source": "nvidia/Nemotron-Math-Proofs-v3-RL",
"source_id": "08e59a5e-9446-5ced-86d2-c903cb6bd96d",
"source_license": "cc-by-4.0",
"source_dataset": "davinci-prover/agentic-prover-RL",
"source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"
} |
nmp3_08f48b0c-515f-5e98-97d5-32919822c1f8 | lean_theorem_proving | -- Original natural-language problem:
-- Let $a,b,c>0$ with $abc=1$. Prove that
-- \[
-- \frac{3a^{2}+2b^{2}}{a\,(a^{2}+b^{2})}+\frac{3b^{2}+2c^{2}}{b\,(b^{2}+c^{2})}+\frac{3c^{2}+2a^{2}}{c\,(c^{2}+a^{2})}\ge\frac{15}{2}.
-- \]
import Mathlib
/-!
# Formal statement for the three-variable real inequality
The source ... | {
"name": "target",
"commit_hash": "56a005855ea17e0b0958f73ec801ae140b0a1679",
"repo_url": "https://github.com/leanprover-community/mathlib4.git",
"default_target": "Mathlib",
"read_only_path_patterns": [
"**/*"
],
"toolchain": "leanprover/lean4:v4.35.0"
} | medium | nvidia/Nemotron-Math-Proofs-v3-RL | 08f48b0c-515f-5e98-97d5-32919822c1f8 | cc-by-4.0 | [
"nmp3_proof"
] | 2a3a07586acff6735dbca55a735c4957b39202f76a722e9becf872b0b52672ac | tasks/nmp3_08f48b0c-515f-5e98-97d5-32919822c1f8 | {
"split": "train",
"difficulty": "medium",
"source": "nvidia/Nemotron-Math-Proofs-v3-RL",
"source_id": "08f48b0c-515f-5e98-97d5-32919822c1f8",
"source_license": "cc-by-4.0",
"source_dataset": "davinci-prover/agentic-prover-RL",
"source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"
} |
nmp3_094ae2ce-bc84-5d73-889e-473ed983ee46 | lean_theorem_proving | -- Original natural-language problem:
-- For positive real numbers \(a,b,c,x,y,z\) satisfying \(a+x=b+y=c+z=1\), prove that
-- \[
-- (abc+xyz)\Big(\frac{1}{ay}+\frac{1}{bz}+\frac{1}{cx}\Big)\ge 3.
-- \]
import Mathlib
/-!
# Formal statement of the target inequality
The source problem asks to prove, for positive real... | {
"name": "target",
"commit_hash": "56a005855ea17e0b0958f73ec801ae140b0a1679",
"repo_url": "https://github.com/leanprover-community/mathlib4.git",
"default_target": "Mathlib",
"read_only_path_patterns": [
"**/*"
],
"toolchain": "leanprover/lean4:v4.35.0"
} | medium | nvidia/Nemotron-Math-Proofs-v3-RL | 094ae2ce-bc84-5d73-889e-473ed983ee46 | cc-by-4.0 | [
"nmp3_proof"
] | 365653b66960da87b07e0fc12a97f3f5db8d4275cb78af082b7abd287fd51ac6 | tasks/nmp3_094ae2ce-bc84-5d73-889e-473ed983ee46 | {
"split": "train",
"difficulty": "medium",
"source": "nvidia/Nemotron-Math-Proofs-v3-RL",
"source_id": "094ae2ce-bc84-5d73-889e-473ed983ee46",
"source_license": "cc-by-4.0",
"source_dataset": "davinci-prover/agentic-prover-RL",
"source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"
} |
nmp3_0977561f-225d-55ee-ad91-19418d057820 | lean_theorem_proving | -- Original natural-language problem:
-- Let $x,y,z>0$ with $xyz=1$. Prove that
-- \[
-- \frac{x}{\frac{1}{x^{8}}+y+z}+\frac{y}{\frac{1}{y^{8}}+z+x}+\frac{z}{\frac{1}{z^{8}}+x+y}\ge 1.
-- \]
import Mathlib
/-!
# Formal statement of the xyz inequality
The source problem asks to prove, for positive real numbers `x`, ... | {
"name": "target",
"commit_hash": "56a005855ea17e0b0958f73ec801ae140b0a1679",
"repo_url": "https://github.com/leanprover-community/mathlib4.git",
"default_target": "Mathlib",
"read_only_path_patterns": [
"**/*"
],
"toolchain": "leanprover/lean4:v4.35.0"
} | medium | nvidia/Nemotron-Math-Proofs-v3-RL | 0977561f-225d-55ee-ad91-19418d057820 | cc-by-4.0 | [
"nmp3_proof"
] | da416674246cf0fee7ef4ae8d57d9896abd407a4754c668aebeb4388eadcc0e7 | tasks/nmp3_0977561f-225d-55ee-ad91-19418d057820 | {
"split": "train",
"difficulty": "medium",
"source": "nvidia/Nemotron-Math-Proofs-v3-RL",
"source_id": "0977561f-225d-55ee-ad91-19418d057820",
"source_license": "cc-by-4.0",
"source_dataset": "davinci-prover/agentic-prover-RL",
"source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"
} |
nmp3_0984e84b-88a4-5fc0-84a4-9adf6f89ba03 | lean_theorem_proving | -- Original natural-language problem:
-- Determine all continuous functions $f:\mathbb{R}\to\mathbb{R}$ such that
-- \[f(x+y+xy)=f(x)+f(y)+f(xy)\]
-- for every $x,y\in\mathbb{R}$.
import Mathlib
/-!
# Formal statement of the functional-equation classification problem
The problem asks for all continuous real-value... | {
"name": "target",
"commit_hash": "56a005855ea17e0b0958f73ec801ae140b0a1679",
"repo_url": "https://github.com/leanprover-community/mathlib4.git",
"default_target": "Mathlib",
"read_only_path_patterns": [
"**/*"
],
"toolchain": "leanprover/lean4:v4.35.0"
} | medium | nvidia/Nemotron-Math-Proofs-v3-RL | 0984e84b-88a4-5fc0-84a4-9adf6f89ba03 | cc-by-4.0 | [
"nmp3_proof"
] | 5fbca6b70f27ece82270434e68fc0278f33b039e0a24039e868bc525d099d1e7 | tasks/nmp3_0984e84b-88a4-5fc0-84a4-9adf6f89ba03 | {
"split": "train",
"difficulty": "medium",
"source": "nvidia/Nemotron-Math-Proofs-v3-RL",
"source_id": "0984e84b-88a4-5fc0-84a4-9adf6f89ba03",
"source_license": "cc-by-4.0",
"source_dataset": "davinci-prover/agentic-prover-RL",
"source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"
} |
nmp3_09a43ec3-fcce-5e24-9332-7f7e304fca97 | lean_theorem_proving | -- Original natural-language problem:
-- Let $x,y,z>0$. Prove that
-- \[
-- \frac{1}{x+y}+\frac{1}{y+z}+\frac{1}{z+x}\ge
-- \frac{x}{x^{2}+yz}+\frac{y}{y^{2}+xz}+\frac{z}{z^{2}+xy}\, .
-- \]
import Mathlib
namespace Problem
/-- The inequality stated in the problem, for positive real `x`, `y`, and `z`. -/
def Target... | {
"name": "target",
"commit_hash": "56a005855ea17e0b0958f73ec801ae140b0a1679",
"repo_url": "https://github.com/leanprover-community/mathlib4.git",
"default_target": "Mathlib",
"read_only_path_patterns": [
"**/*"
],
"toolchain": "leanprover/lean4:v4.35.0"
} | medium | nvidia/Nemotron-Math-Proofs-v3-RL | 09a43ec3-fcce-5e24-9332-7f7e304fca97 | cc-by-4.0 | [
"nmp3_proof"
] | e9ffe3e1688bd90b7264093a7eed55177b5594b452edc1e61af0e189170ec2cb | tasks/nmp3_09a43ec3-fcce-5e24-9332-7f7e304fca97 | {
"split": "train",
"difficulty": "medium",
"source": "nvidia/Nemotron-Math-Proofs-v3-RL",
"source_id": "09a43ec3-fcce-5e24-9332-7f7e304fca97",
"source_license": "cc-by-4.0",
"source_dataset": "davinci-prover/agentic-prover-RL",
"source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"
} |
nmp3_09f1de93-968e-5ae5-aeaf-3d732a3d145a | lean_theorem_proving | -- Original natural-language problem:
-- Let $n\ge1$ be an integer and let $a_1,a_2,\dots,a_{2n+1}$ be real numbers. For every index $i$ ($1\le i\le2n+1$) the multiset $\{a_j\mid j\neq i\}$ of the remaining $2n$ numbers can be partitioned into two subsets, each containing exactly $n$ elements, whose sums are equal. Pro... | {
"name": "target",
"commit_hash": "56a005855ea17e0b0958f73ec801ae140b0a1679",
"repo_url": "https://github.com/leanprover-community/mathlib4.git",
"default_target": "Mathlib",
"read_only_path_patterns": [
"**/*"
],
"toolchain": "leanprover/lean4:v4.35.0"
} | medium | nvidia/Nemotron-Math-Proofs-v3-RL | 09f1de93-968e-5ae5-aeaf-3d732a3d145a | cc-by-4.0 | [
"nmp3_proof"
] | 7e5cc782293420034d285c0a5067575ebbba0089ab447c6a23ea432730f36407 | tasks/nmp3_09f1de93-968e-5ae5-aeaf-3d732a3d145a | {
"split": "train",
"difficulty": "medium",
"source": "nvidia/Nemotron-Math-Proofs-v3-RL",
"source_id": "09f1de93-968e-5ae5-aeaf-3d732a3d145a",
"source_license": "cc-by-4.0",
"source_dataset": "davinci-prover/agentic-prover-RL",
"source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"
} |
nmp3_0a477f55-5c73-5c1d-aa13-7adabd8262d2 | lean_theorem_proving | -- Original natural-language problem:
-- Let $f:(0,\infty)\to(0,\infty)$ satisfy $f(xy)\le f(x)f(y)$ for all $x,y>0$. Prove that for every $x>0$ and every positive integer $n$,
-- \[
-- f(x^n)\le f(x)\,f(x^2)^{\frac12}\,f(x^3)^{\frac13}\cdots f(x^n)^{\frac1n}.
-- \]
import Mathlib
open scoped BigOperators
namespace P... | {
"name": "target",
"commit_hash": "56a005855ea17e0b0958f73ec801ae140b0a1679",
"repo_url": "https://github.com/leanprover-community/mathlib4.git",
"default_target": "Mathlib",
"read_only_path_patterns": [
"**/*"
],
"toolchain": "leanprover/lean4:v4.35.0"
} | medium | nvidia/Nemotron-Math-Proofs-v3-RL | 0a477f55-5c73-5c1d-aa13-7adabd8262d2 | cc-by-4.0 | [
"nmp3_proof"
] | 8cc4d8dc75510d91654ec4675c23da2c9a4a4cb9ef0d5b86a973c274443d4f08 | tasks/nmp3_0a477f55-5c73-5c1d-aa13-7adabd8262d2 | {
"split": "train",
"difficulty": "medium",
"source": "nvidia/Nemotron-Math-Proofs-v3-RL",
"source_id": "0a477f55-5c73-5c1d-aa13-7adabd8262d2",
"source_license": "cc-by-4.0",
"source_dataset": "davinci-prover/agentic-prover-RL",
"source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"
} |
nmp3_0a5d8699-998f-5db0-b2b0-2f5a7079c929 | lean_theorem_proving | -- Original natural-language problem:
-- Let \(x,y,z\in\mathbb R\) be real numbers such that the denominators are non‑zero \((x^2+y^2\neq0,\;y^2+z^2\neq0,\;z^2+x^2\neq0)\). Prove that
-- \[
-- \frac{x(x+y)}{x^{2}+y^{2}}+\frac{y(y+z)}{y^{2}+z^{2}}+\frac{z(z+x)}{z^{2}+x^{2}}\le 3.
-- \]
import Mathlib
/-!
# Formalizat... | {
"name": "target",
"commit_hash": "56a005855ea17e0b0958f73ec801ae140b0a1679",
"repo_url": "https://github.com/leanprover-community/mathlib4.git",
"default_target": "Mathlib",
"read_only_path_patterns": [
"**/*"
],
"toolchain": "leanprover/lean4:v4.35.0"
} | medium | nvidia/Nemotron-Math-Proofs-v3-RL | 0a5d8699-998f-5db0-b2b0-2f5a7079c929 | cc-by-4.0 | [
"nmp3_proof"
] | 4dc8c5dec597805c80f0865ecbb6e44e94a6f2863e2e090bd684ec2ecd20d7e9 | tasks/nmp3_0a5d8699-998f-5db0-b2b0-2f5a7079c929 | {
"split": "train",
"difficulty": "medium",
"source": "nvidia/Nemotron-Math-Proofs-v3-RL",
"source_id": "0a5d8699-998f-5db0-b2b0-2f5a7079c929",
"source_license": "cc-by-4.0",
"source_dataset": "davinci-prover/agentic-prover-RL",
"source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"
} |
nmp3_0a65bf83-cd65-566c-a602-a460a84e10a5 | lean_theorem_proving | -- Original natural-language problem:
-- Let $ABC$ be an acute‑angled triangle. Let $O$ be its circumcenter. Let $BH$ be the altitude from $B$ to $AC$ (so $H$ is the foot of the altitude) and let $BM$ be the median from $B$ (so $M$ is the midpoint of $AC$). The circles $(AOB)$ and $(BHC)$ intersect again at $E\neq B$, ... | {
"name": "target",
"commit_hash": "56a005855ea17e0b0958f73ec801ae140b0a1679",
"repo_url": "https://github.com/leanprover-community/mathlib4.git",
"default_target": "Mathlib",
"read_only_path_patterns": [
"**/*"
],
"toolchain": "leanprover/lean4:v4.35.0"
} | hard | nvidia/Nemotron-Math-Proofs-v3-RL | 0a65bf83-cd65-566c-a602-a460a84e10a5 | cc-by-4.0 | [
"nmp3_proof"
] | 485dfdb354595c692789952b1ff6104c6d6ceb1fbecc1a8f931df57421c7e7f0 | tasks/nmp3_0a65bf83-cd65-566c-a602-a460a84e10a5 | {
"split": "train",
"difficulty": "hard",
"source": "nvidia/Nemotron-Math-Proofs-v3-RL",
"source_id": "0a65bf83-cd65-566c-a602-a460a84e10a5",
"source_license": "cc-by-4.0",
"source_dataset": "davinci-prover/agentic-prover-RL",
"source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"
} |
nmp3_0a7d99e8-e3f2-5e95-b1a1-7677e21c0215 | lean_theorem_proving | -- Original natural-language problem:
-- Let $a,b,c>0$ and $\displaystyle\frac1a+\frac1b+\frac1c=1$. Prove that
-- \[
-- \sqrt{\frac{a-1}{b}}+\sqrt{\frac{b-1}{c}}+\sqrt{\frac{c-1}{a}}\ge\sqrt6\,.
-- \]
import Mathlib
/-!
Formalization of the target assertion in `problem.md`.
The source states: for positive real num... | {
"name": "target",
"commit_hash": "56a005855ea17e0b0958f73ec801ae140b0a1679",
"repo_url": "https://github.com/leanprover-community/mathlib4.git",
"default_target": "Mathlib",
"read_only_path_patterns": [
"**/*"
],
"toolchain": "leanprover/lean4:v4.35.0"
} | hard | nvidia/Nemotron-Math-Proofs-v3-RL | 0a7d99e8-e3f2-5e95-b1a1-7677e21c0215 | cc-by-4.0 | [
"nmp3_proof"
] | debe8563f0bf5cdd7653837350e5aa82567d6a10a92215415b6b228a1a0aab3f | tasks/nmp3_0a7d99e8-e3f2-5e95-b1a1-7677e21c0215 | {
"split": "train",
"difficulty": "hard",
"source": "nvidia/Nemotron-Math-Proofs-v3-RL",
"source_id": "0a7d99e8-e3f2-5e95-b1a1-7677e21c0215",
"source_license": "cc-by-4.0",
"source_dataset": "davinci-prover/agentic-prover-RL",
"source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"
} |
nmp3_0a90363a-46ad-5ed8-a7ab-16134789df58 | lean_theorem_proving | -- Original natural-language problem:
-- Let $x_1,x_2,\dots,x_k$ be positive real numbers with $k>3$. Prove that
-- \[
-- \frac{x_1}{x_k+x_2}+\frac{x_2}{x_1+x_3}+\cdots+\frac{x_k}{x_{k-1}+x_1}\ge 2,
-- \]
-- where the indices are taken cyclically (e.g., $x_{k+1}=x_1$, $x_0=x_k$).
import Mathlib
/-!
# Formal statem... | {
"name": "target",
"commit_hash": "56a005855ea17e0b0958f73ec801ae140b0a1679",
"repo_url": "https://github.com/leanprover-community/mathlib4.git",
"default_target": "Mathlib",
"read_only_path_patterns": [
"**/*"
],
"toolchain": "leanprover/lean4:v4.35.0"
} | hard | nvidia/Nemotron-Math-Proofs-v3-RL | 0a90363a-46ad-5ed8-a7ab-16134789df58 | cc-by-4.0 | [
"nmp3_proof"
] | e5d9989de43cdc6dd0c9cb86bde26011c41d17218a9c9ea346c70219c7855fcd | tasks/nmp3_0a90363a-46ad-5ed8-a7ab-16134789df58 | {
"split": "train",
"difficulty": "hard",
"source": "nvidia/Nemotron-Math-Proofs-v3-RL",
"source_id": "0a90363a-46ad-5ed8-a7ab-16134789df58",
"source_license": "cc-by-4.0",
"source_dataset": "davinci-prover/agentic-prover-RL",
"source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"
} |
nmp3_0b082f99-f0b0-5af6-9072-8f5b3359f734 | lean_theorem_proving | -- Original natural-language problem:
-- Suppose $a_1,\dots,a_n$ are integers with $\gcd(a_1,\dots,a_n)=1$. Let $S\subseteq\mathbb Z$ satisfy
--
-- (a) $a_i\in S$ for each $i=1,\dots,n$;
--
-- (b) $a_i-a_j\in S$ for all $i,j\in\{1,\dots,n\}$ (indices need not be distinct);
--
-- (c) For any integers $x,y\in S$... | {
"name": "target",
"commit_hash": "56a005855ea17e0b0958f73ec801ae140b0a1679",
"repo_url": "https://github.com/leanprover-community/mathlib4.git",
"default_target": "Mathlib",
"read_only_path_patterns": [
"**/*"
],
"toolchain": "leanprover/lean4:v4.35.0"
} | hard | nvidia/Nemotron-Math-Proofs-v3-RL | 0b082f99-f0b0-5af6-9072-8f5b3359f734 | cc-by-4.0 | [
"nmp3_proof"
] | ae68e1939ab3712dbd53793e0d865d482912cf4b6a5a3663959b0e6e6463ce99 | tasks/nmp3_0b082f99-f0b0-5af6-9072-8f5b3359f734 | {
"split": "train",
"difficulty": "hard",
"source": "nvidia/Nemotron-Math-Proofs-v3-RL",
"source_id": "0b082f99-f0b0-5af6-9072-8f5b3359f734",
"source_license": "cc-by-4.0",
"source_dataset": "davinci-prover/agentic-prover-RL",
"source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"
} |
nmp3_0b0b696a-c4d1-5fe9-a9e3-e60d6797deb9 | lean_theorem_proving | -- Original natural-language problem:
-- Let $a,b,c,d$ be nonnegative real numbers. Prove that
-- \[
-- a^4+b^4+c^4+d^4+2abcd\ge a^2b^2+a^2c^2+a^2d^2+b^2c^2+b^2d^2+c^2d^2.
-- \]
import Mathlib
namespace Problem
/--
For all nonnegative real numbers `a`, `b`, `c`, and `d`, the inequality
`a^4 + b^4 + c^4 + d^4 + 2abc... | {
"name": "target",
"commit_hash": "56a005855ea17e0b0958f73ec801ae140b0a1679",
"repo_url": "https://github.com/leanprover-community/mathlib4.git",
"default_target": "Mathlib",
"read_only_path_patterns": [
"**/*"
],
"toolchain": "leanprover/lean4:v4.35.0"
} | medium | nvidia/Nemotron-Math-Proofs-v3-RL | 0b0b696a-c4d1-5fe9-a9e3-e60d6797deb9 | cc-by-4.0 | [
"nmp3_proof"
] | c9a79bdd026298732e4875770c87a88fc4b2882b18cba9f828954b91f195ddf5 | tasks/nmp3_0b0b696a-c4d1-5fe9-a9e3-e60d6797deb9 | {
"split": "train",
"difficulty": "medium",
"source": "nvidia/Nemotron-Math-Proofs-v3-RL",
"source_id": "0b0b696a-c4d1-5fe9-a9e3-e60d6797deb9",
"source_license": "cc-by-4.0",
"source_dataset": "davinci-prover/agentic-prover-RL",
"source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"
} |
nmp3_0b1aca32-a32c-554a-9448-cf704fa003eb | lean_theorem_proving | -- Original natural-language problem:
-- Let $x,y,z\ge 0$ satisfy $x^2+y^2+z^2=1$. Prove that
-- \[
-- \sqrt{1-xy}\,\sqrt{1-yz}+\sqrt{1-yz}\,\sqrt{1-zx}+\sqrt{1-zx}\,\sqrt{1-xy}\ge 2.
-- \]
-- (The sum is taken cyclically over $(x,y,z)$.)
import Mathlib
noncomputable section
namespace Problem
/-- The real square... | {
"name": "target",
"commit_hash": "56a005855ea17e0b0958f73ec801ae140b0a1679",
"repo_url": "https://github.com/leanprover-community/mathlib4.git",
"default_target": "Mathlib",
"read_only_path_patterns": [
"**/*"
],
"toolchain": "leanprover/lean4:v4.35.0"
} | medium | nvidia/Nemotron-Math-Proofs-v3-RL | 0b1aca32-a32c-554a-9448-cf704fa003eb | cc-by-4.0 | [
"nmp3_proof"
] | 8be83f1a75c43e67dcc49ae7d98991efe4dd06afc46df2798255147314442975 | tasks/nmp3_0b1aca32-a32c-554a-9448-cf704fa003eb | {
"split": "train",
"difficulty": "medium",
"source": "nvidia/Nemotron-Math-Proofs-v3-RL",
"source_id": "0b1aca32-a32c-554a-9448-cf704fa003eb",
"source_license": "cc-by-4.0",
"source_dataset": "davinci-prover/agentic-prover-RL",
"source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"
} |
nmp3_0b1bb5c5-3438-5f93-a27a-1b78facb4dc7 | lean_theorem_proving | -- Original natural-language problem:
-- Let $x,y,z>0$ with $xyz=1$. Prove that
-- \[
-- \frac{1}{\sqrt{4x^{2}+x+4}}+\frac{1}{\sqrt{4y^{2}+y+4}}+\frac{1}{\sqrt{4z^{2}+z+4}}\le 1.
-- \]
import Mathlib
/-!
# Formal statement for the cyclic square-root inequality
The source problem asks, for positive real numbers `x`, ... | {
"name": "target",
"commit_hash": "56a005855ea17e0b0958f73ec801ae140b0a1679",
"repo_url": "https://github.com/leanprover-community/mathlib4.git",
"default_target": "Mathlib",
"read_only_path_patterns": [
"**/*"
],
"toolchain": "leanprover/lean4:v4.35.0"
} | medium | nvidia/Nemotron-Math-Proofs-v3-RL | 0b1bb5c5-3438-5f93-a27a-1b78facb4dc7 | cc-by-4.0 | [
"nmp3_proof"
] | 0e9df14aa441c74d270803ecc96e68231c82fe15e1e05e5fd18aed7969576b3c | tasks/nmp3_0b1bb5c5-3438-5f93-a27a-1b78facb4dc7 | {
"split": "train",
"difficulty": "medium",
"source": "nvidia/Nemotron-Math-Proofs-v3-RL",
"source_id": "0b1bb5c5-3438-5f93-a27a-1b78facb4dc7",
"source_license": "cc-by-4.0",
"source_dataset": "davinci-prover/agentic-prover-RL",
"source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"
} |
nmp3_0b34a3c5-036e-51b4-aab3-841226d0eee3 | lean_theorem_proving | -- Original natural-language problem:
-- Let $ABC$ be a triangle with side lengths $BC=a$, $CA=b$, $AB=c$ and circumradius $R$. For any point $P$ inside $\triangle ABC$ prove that
-- \[
-- \frac{PA}{a^{2}}+\frac{PB}{b^{2}}+\frac{PC}{c^{2}}\ge\frac1R.
-- \]
-- Equivalently, $\displaystyle\frac{PA}{BC^{2}}+\frac{PB}{C... | {
"name": "target",
"commit_hash": "56a005855ea17e0b0958f73ec801ae140b0a1679",
"repo_url": "https://github.com/leanprover-community/mathlib4.git",
"default_target": "Mathlib",
"read_only_path_patterns": [
"**/*"
],
"toolchain": "leanprover/lean4:v4.35.0"
} | hard | nvidia/Nemotron-Math-Proofs-v3-RL | 0b34a3c5-036e-51b4-aab3-841226d0eee3 | cc-by-4.0 | [
"nmp3_proof"
] | 553c2a20273e63398932b957bbadae3bd3f71b39e2590bd4a033f6a97526783e | tasks/nmp3_0b34a3c5-036e-51b4-aab3-841226d0eee3 | {
"split": "train",
"difficulty": "hard",
"source": "nvidia/Nemotron-Math-Proofs-v3-RL",
"source_id": "0b34a3c5-036e-51b4-aab3-841226d0eee3",
"source_license": "cc-by-4.0",
"source_dataset": "davinci-prover/agentic-prover-RL",
"source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"
} |
nmp3_0b3e46c4-8626-5f96-940b-c8205c38a579 | lean_theorem_proving | -- Original natural-language problem:
-- Let $a>1$ be a positive integer. For $n\ge1$ define
-- \[
-- a_n=\Bigl\lfloor\frac{a^n}{n}\Bigr\rfloor .
-- \]
-- Prove that for every positive integer $N$ there exists an index $n$ such that $N$ divides $a_n$ (i.e. some term of the sequence is a multiple of $N$).
module
publi... | {
"name": "target",
"commit_hash": "56a005855ea17e0b0958f73ec801ae140b0a1679",
"repo_url": "https://github.com/leanprover-community/mathlib4.git",
"default_target": "Mathlib",
"read_only_path_patterns": [
"**/*"
],
"toolchain": "leanprover/lean4:v4.35.0"
} | hard | nvidia/Nemotron-Math-Proofs-v3-RL | 0b3e46c4-8626-5f96-940b-c8205c38a579 | cc-by-4.0 | [
"nmp3_proof"
] | f8f4f44b6cdabe9308d81db124f1800fb98d9206e6601d56b63947ba04d15bbe | tasks/nmp3_0b3e46c4-8626-5f96-940b-c8205c38a579 | {
"split": "train",
"difficulty": "hard",
"source": "nvidia/Nemotron-Math-Proofs-v3-RL",
"source_id": "0b3e46c4-8626-5f96-940b-c8205c38a579",
"source_license": "cc-by-4.0",
"source_dataset": "davinci-prover/agentic-prover-RL",
"source_revision": "fe15df9eceb1162c74683d92f230206d16a39487"
} |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.